Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Notes on Prolog program transformations, Prolog style, and efficient compilation to the Warren abstract machine

  • Conference paper
  • First Online:
9th International Conference on Automated Deduction (CADE 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 310))

Included in the following conference series:

Abstract

Most of the efficient implementations of Prolog are based on Warren's abstract machine [1,4]. Evan Tick [3] has argued that a substantial percentage of execution time in such implementations is directly related to the creation and the use of choice points. In this paper, we discuss how the overhead of choice point creation and processing can be avoided without sacrificing the declarative meaning of Prolog programs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Gabriel, T. Lindholm, E. Lusk and R. A. Overbeek, “Tutorial on Warren abstract machine,” Technical Report ANL-84-84, Argonne National Laboratory, Argonne, Illinois, October, 1984.

    Google Scholar 

  2. E. L. Lusk, R. A. Overbeek, and R. Butler, “The Warren abstract machine for computational logic: Extension to support cut, the occur check, subsumption checks and unit databases, (in preparation).

    Google Scholar 

  3. E. Tick, “Lisp and Prolog memory performance,” Technical Report 86-291, Departments of Electrical Engineering and Computer Science, Stanford University, January, 1986.

    Google Scholar 

  4. D. H. D. Warren, “An abstract prolog instruction set,” SRI Technical Note 309, SRI International, October, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Computer and Information Science, Univ. of North Florida, 32216, Jacksonville, FL

    Ralph M. Butler

  2. Center for Advanced Computer Studies, P.O.Box 4330, USL, 70504-4330, Lafayette, LA

    Rasiah Loganantharaj

  3. Mathematics and Computer Science Division, Argonne National Laboratory, 60439, Argonne, Illinois

    Robert Olson

Authors
  1. Ralph M. Butler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rasiah Loganantharaj
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Robert Olson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ewing Lusk Ross Overbeek

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Butler, R.M., Loganantharaj, R., Olson, R. (1988). Notes on Prolog program transformations, Prolog style, and efficient compilation to the Warren abstract machine. In: Lusk, E., Overbeek, R. (eds) 9th International Conference on Automated Deduction. CADE 1988. Lecture Notes in Computer Science, vol 310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012840

Download citation

  • DOI: https://doi.org/10.1007/BFb0012840

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19343-2

  • Online ISBN: 978-3-540-39216-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation