Skip to Content.
Sympa Menu

coq-club - [Coq-Club] Release of Maude 2.0

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

[Coq-Club] Release of Maude 2.0


chronological Thread 
  • From: "Ambarish Sridharanarayanan" <srdhrnry AT uiuc.edu>
  • To: <acl2 AT cs.utexas.edu>, <agents AT cs.umbc.edu>, <amast AT cs.utwente.nl>, <categories AT mta.ca>, <ccl AT dfki.uni-sb.de>, <clp AT iscs.nus.edu.sg>, <concurrency AT cwi.nl>, <coq-club AT pauillac.inria.fr>, <csp AT carlit.toulouse.inra.fr>, <dataloger AT cs.chalmers.se>, <eacsl AT dimi.uniud.it>, <fsdm AT it.uq.edu.au>, <info-hol AT leopard.cs.byu.edu>, <isabelle-users AT cl.cam.ac.uk>, <lambda-usergroup AT dcs.ed.ac.uk>, <lfcs-interest AT dcs.ed.ac.uk>, <logic-ml AT logic.jaist.ac.jp>, <nuprllist AT cs.cornell.edu>, <PetriNets AT daimi.aau.dk>, <pvs AT csl.sri.com>, <rewriting AT ens-lyon.fr>, <theorem-provers AT ai.mit.edu>, <types AT cis.upenn.edu>, <zeves AT ora.on.ca>, <coalgebras AT iti.cs.tu-bs.de>, <MAUDE AT LISTSERV.REDIRIS.ES>
  • Cc: <clt AT cs.stanford.edu>, <eker AT csl.sri.com>, <meseguer AT cs.uiuc.edu>
  • Subject: [Coq-Club] Release of Maude 2.0
  • Date: Mon, 9 Jun 2003 06:47:16 -0500 (CDT)
  • Importance: Normal
  • List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>

Apologies if you receive multiple copies:

                       Release of Maude 2.0

Maude is a high-performance multiparadigm language based on rewriting
logic, and contains a functional sublanguage based on equational logic.
It can be used for both programming and executable system specification
in a variety of areas such as distributed and mobile systems and
communication protocols, and functional applications.  Thanks to its
reflective features it can be used as a metalanguage and is easily
extensible with powerful module composition operations as those
supported in its Full Maude extension.  It can also be used as a
semantic framework to specify and prototype different languages,
concurrency calculi, and SOS specifications; and as a logical framework
to represent and mechanize different logics and proving tools.

Maude 2.0 is now available, free of charge, from the Maude web page:

http://maude.cs.uiuc.edu

which also contains a Maude 2.0 manual, various papers on Maude, and a
collection of examples.  Some new features in the Maude 2.0 version
include:

 - more general conditions in conditional equations and rules.

 - more efficient algorithms for rewriting modulo associativity,
   associativity-identity, associativity-commutativity and
   associativity-commutativity-identity.

 - new commands for fair rewriting and for breadth-first search.

 - new predefined modules, including naturals, integers, rationals,
   floats, and strings.

 - a model checker to model check LTL properties of Maude modules.

 - a new META-LEVEL module supporting reflective computation with
   new, more powerful reflective operations.

 - more powerful module operations in its Full Maude extension,
   including parameterized theories and views.







Archive powered by MhonArc 2.6.16.

Top of Page