Abstract
This is the first part of a work presenting a natural and transparent albeit entirely mathematical description of Warren's 1983 abstract machine for executing Prolog. We derive the description from Börger's 1990b phenomenological description of the language, refining Prolog algebras stepwise, proving conservation of correctness at each step.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Aït-Kaci, K. 1990: The WAM: A (Real) Tutorial, PRL Research Report 5, Digital Equipment Corporation, Paris Research Laboratory
Börger, E. 1990a: A Logical Operational Semantics of Full Prolog. Part I. Selection Core and Control, in: CSL '89. 3rd Workshop on Computer Science Logic (Eds. E. Börger, H. Kleine Büning, M. Richter), Springer LNCS 440, pp. 36–64
Börger, E. 1990b: A Logical Operational Semantics of Full Prolog. Part II. Built-in Predicates for Database Manipulations, in: MFCS '90. Mathematical Foundations of Computer Science (B. Rovan, Ed.), Springer LNCS 452, pp. 1–14
Börger, E. 1991: A Logical Operational Semantics of Full Prolog. Part III. Built-in Predicates for Files, Terms, Arithmetic and Input-Output. In: Proc. Workshop on Logic from Computer Science (Y. Moschovakis, Ed.), Berkeley 1989, Springer MSRI Publications (to appear)
Börger, E. & Rosenzweig D. 1991: WAM Algebras-A Mathematical Study of Implementation, Part II, in preparation
Börger, E. & Schmitt P. 1991: A Formal Operational Semantics for Languages of Type Prolog III, this volume
DFPS 1990: Deransart, P., Folkjær P., Pique, J-F., Scowen, R. S: Prolog. Draft for Working Draft 4.0, ISO/IEC JTC1 SC22 WG 17 No 64, September 1990
Gurevich, Y. 1988: Logic and the Challenge of Computer Science, in: Trends in Theoretical Computer Science (E. Börger ed.), Computer Science Press, pp. 1–57
Gurevich, Y. 1991: Evolving Algebras. A Tutorial Introduction, in: EATCS Bulletin 43, February 1991
Gurevich, Y. & Morris, J. M. 1988: Algebraic Operational Semantics and Modula-2, in: CSL '87. 1st Workshop on Computer Science Logic (Eds. E. Börger, H. Kleine Büning, M. Richter), Springer LNCS 329, pp. 81–101
Gurevich, Y. & Moss, L. S. 1990: Algebraic Operational Semantics and Occam, in: CSL '90. 3rd Workshop on Computer Science Logic (Eds. E. Börger, H. Kleine Büning, M. M. Richter), Springer LNCS 440, pp. 176–192
Lindholm, T. G. & O'Keefe, R. A. 1987: Efficient Implementation of a Defensible Semantics for Dynamic Prolog Code, in: Proceedings of the Fourth International Conference on Logic Programming, pp. 21–39
North, N. D. & Scowen, R. S. 1990: Budapest 1990 Meeting ISO/IEC JTC1 SC22 WG 17 No 68, November 1990
Rusinoff, D. M. 1989: A Verified Prolog Compiler for the Warren Abstract Machine, MCC Technical Report ACT-ST-292-89, Austin, Texas
Semle, H. 1989: Erweiterung einer abstrakten Maschine für ordnungssortiertes Prolog um die Behandlung polymorpher Sorten, IWBS Report 75, IBM Deutschland
Warren, D. H. D. 1983: An Abstract Prolog Instruction Set, Technical Note 309, Artificial Intelligence Center, SRI International
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Börger, E., Rosenzweig, D. (1991). From prolog algebras towards WAM-A mathematical study of implementation. In: Börger, E., Kleine Büning, H., Richter, M.M., Schönfeld, W. (eds) Computer Science Logic. CSL 1990. Lecture Notes in Computer Science, vol 533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54487-9_51
Download citation
DOI: https://doi.org/10.1007/3-540-54487-9_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54487-6
Online ISBN: 978-3-540-38401-4
eBook Packages: Springer Book Archive