Hi, I'd like to announce the first public release of the 'boolean expression simplifier' library "bes". It is an implementation of several algorithms for minimizing boolean expressions similar to the espresso solver [1] -- though in OCaml. The source code is available on ocamlforge under the new bsd license:
http://bes.forge.ocamlcore.org/ It comes with a simple front-end program for reading and simplifying expressions in DFA from text files. Students trying to verify their Karnaugh Veitch map solutions rejoice! ;) Regards -Markus [1] http://embedded.eecs.berkeley.edu/pubs/downloads/espresso/index.htm -- Markus Weißmann, M.Sc. Technische Universität München Institut für Informatik Boltzmannstr. 3 D-85748 Garching Germany http://wwwknoll.in.tum.de/ -- Caml-list mailing list. Subscription management and archives: https://sympa-roc.inria.fr/wws/info/caml-list Beginner's list: http://groups.yahoo.com/group/ocaml_beginners Bug reports: http://caml.inria.fr/bin/caml-bugs
