Abstract
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Börger, Egon, & Rosenzweig, Dean. 1995. A Mathematical Definition of Full Prolog. Science of Computer Programming, 24(3), 249–286.
Börger, Egon, Durdanovic, Igor, & Rosenzweig, Dean. 1994a. Occam: Specification and Compiler Correctness. Pages 489–508 of: Montanari, U., & Olderog, E.-R. (eds), Proceedings, IFIP Working Conference on Programming Concepts, Methods and Calculi (PROCOMET 94). North-Holland.
Borger, Egon, Del Castillo, Giuseppe, Glavan, P., & Rosenzweig, Dean. 1994b. Towards a Mathematical Specification of the APE100 Architecture: The Apese Model. Pages 396–401 of: Pehrson, B., & Simon, I. (eds), Proceedings, IFIP 13th World Computer Congress, vol. 1. Amsterdam: Elsevier.
Gurevich, Yuri. 1991. Evolving Algebras. A Tutorial Introduction. Bulletin of the EATCS, 43, 264–284.
Gurevich, Yuri. 1995. Evolving Algebras 1993: Lipari Guide. In:Börger, E. (ed), Specification and Validation Methods. Oxford University Press.
Gurevich, Yuri, & Huggins, Jim. 1993. The Semantics of the C Programming Language. Pages 273–309 of: Proceedings, Computer Science Logic (CSL). Lncs 702. Springer.
Gurevich, Yuri, & Mani, Raghu. 1995. Group Membership Protocol: Specification and Verification. In:Börger, E. (ed), Specification and Validation Methods. Oxford University Press.
Kappel, Angelica M. 1993. Executable Specifications based on Dynamic Algebras. Pages 229–240 of: Proceedings, 4th International Conference on Logic Programming and Automated Reasoning (LPAR), St. Petersburg, Russia. Lncs 698. Springer.
O'Keefe, Richard A. 1990. The Craft of Prolog. Mit Press.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/3-540-61377-3_32
Download citation
DOI: https://doi.org/10.1007/3-540-61377-3_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61377-0
Online ISBN: 978-3-540-68507-4
eBook Packages: Springer Book Archive