leanEA: A lean evolving algebra compiler

  • Bernhard Beckert
  • Joachim Posegga
Conference paper

DOI: 10.1007/3-540-61377-3_32

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1092)
Cite this paper as:
Beckert B., Posegga J. (1996) leanEA: A lean evolving algebra compiler. In: Kleine Büning H. (eds) Computer Science Logic. CSL 1995. Lecture Notes in Computer Science, vol 1092. Springer, Berlin, Heidelberg


The Prolog program “term_expansion((define C as A with B), (C=>A:-B,!)). term-expansion((transition E if C then D), ((transition E):-C,!,B,A,(transition _))):-rearrange(D,B,A). rearrange((E,F),(C,D),(A,B)):-rearrange(E,C,B), rearrange(F,D,A). rearrange(F:=G, ([G]=>*[E], F=. [C¦D], D=>*B,A=. [C¦B]), asserta(A=>E)). [G¦H]=>*[E¦F]:-(G=>E; G=.[C¦D], D=>*B,A=.[C¦B],A=>E), !,H=>*F. []=>*[]. A=?B:- [A,B]=>*[D,C], D==C.” implements an efficient and flexible simulator for evolving algebra specifications.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • Bernhard Beckert
    • 1
  • Joachim Posegga
    • 2
  1. 1.Institute for Logic, Complexity and Deduction SystemsUniversity of KarlsruheKarlsruheGermany
  2. 2.Research CentreDeutsche Telekom AGDarmstadtGermany

Personalised recommendations