MinLem

MinLem is a program written in ML to calculate the smallest set of lemmas that is sufficient to prove an assumed partial-order relation on a finite set.

See the paper (dvi, ps, ps.gz, pdf) to get more information.

Version 1.0 beta of MinLem is now available. It is developed with MoscowML but the code should be easy to port to other ML dialects. Please, send me an email, if you run it with a different ML dialect or on a platform different from the ones indicated below. Sugestions, bug reports, questions, and comments are welcome, as well.

Source code distributions:
- MinLem_1.0b_src.tar.gz (6 KByte)
- MinLem_1.0b_src.hqx (296 KByte; includes binaries)
Binary distributions (standalone executables):
- MinLem_1.0b_solaris_sparc.tar.gz (46 KByte)
- MinLem_1.0b_linux_intel.tar.gz (46 KByte)
- MinLem_1.0b_linux_ppc.tar.gz (50 KByte)
- MinLem_1.0b_macos_ppc.hqx (280 KByte)

This page was last updated on 25th April 2001.