Abstract
In 1988, Y. Gurevich proposed an approach to operational semantics, which is based on finite, dynamic algebras. Dynamic algebras are comprehensible, precise and universally applicable. E. Börger recently presented a Dynamic Algebra Specification of full Prolog.
The main purpose of our work is a general concept for the implementation of dynamic algebras. We present a concrete language for Dynamic Algebra Specifications and the design of an abstract target machine specially tailored for Dynamic Algebra computations. Finally we explain some principles of code generation leading to highly efficient target programs.
Though the given concepts are independent from an implementation language, we show that they may very naturally be expressed within the framework of Logic Programming. A prototype of the compiler has been realized in Prolog. Starting with Börger's transition system for full Prolog we derived a Prolog interpreter in our Dynamic Algebra Specification Language.
Preview
Unable to display preview. Download preview PDF.
References
E. Börger and B. Demoen. A Framework to Specify Database Update Views for Prolog. In J. Maluszyński and M. Wirsing, editors, Programming Language Implementation and Logic Programming (PLILP), number 528, 1991.
E. Börger, H. Kleine Büning, and M. Richter, editors. 3rd Workshop on Computer Science Logic, 1989.
Egon Börger. A Logical Operational Semantics of Full Prolog, part I: Selection Core and Control. In Börger et al. [BKBR89].
Egon Börger. A Logical Operational Semantics of Full Prolog, part II: Built-in Predicates for Database Manipulations. Technical Report IWBS 115, IBM Deutschland GmbH, 1990.
Egon Börger. A Logical Operational Semantics of Full Prolog, part III: Built-in Predicates for Files, Terms, Arithmetic and Input-Output. In Y Moschovakis, editor, Workshop on Logic from Computer Science. Springer Verlag, 1990.
Yuri Gurevich. Logic and the Challenge of Computer Science. In Egon Börger, editor, Current Trends in Theoretical Computer Science. Computer Science Press, 1988.
A. M. Kappel. Implementation of Dynamic Algebras with an Application to Prolog. Diploma thesis, Universität Dortmund, Germany, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kappel, A.M. (1993). Executable specifications based on dynamic algebras. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1993. Lecture Notes in Computer Science, vol 698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56944-8_56
Download citation
DOI: https://doi.org/10.1007/3-540-56944-8_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56944-2
Online ISBN: 978-3-540-47830-0
eBook Packages: Springer Book Archive