The latest relase is 3.1 beta 6 (Jul/2001). It is stable and it is independent of platform
Handling of Abstract Data Types
Allow the specification of ADT using a simple equational
language: The ManTa 3 language. The formal background of this language ensures that every specification written with it has a model.
Can generate semi-automatically new ADTs by some methods (Copy, Instatiation,
Cartesian Product, Restriction, Completion and Variation)
Includes some predefined types: NAT, BOOL, Char, String, List, Stack and Queue.
Allows the representation of ADTs using existing ADTs (e.g Represent the
ADT Stack with ADT Queue)
Includes a rewriting motor to evaluate expressions.
Allows to prove equality theorems on specifications by Rewriting
It can prove if a representation mantains the pretended semantics
It can generate implantations of the ADTs in ANSI C, and it also generates
a program to test the implanted ADT. The makefiles generated can
be used with almost every make program (includes special support for BC++
Includes a tool (m2ocaml) that can generate implementations of ADTs in Ocaml.
It's written in ANSI C and is highly portable. The most recent version has been
compiled and tested in DOS with the compiler DJGPP, and in Linux, SunOS and OpenBSD with
the compiler gcc.
Some portions of the sources and documentation is in the public domain, while
others are covered by the GPL.
Once you compile and install ManTa, we will appreciate your
opinion and bug reports.
Support and Feedback