Skip to main content
SpringerLink
Log in

How to invent a Prolog machine

  • Special Issue
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

In this paper we study the compilation of Prolog by making visible hidden operations (especially unification), and then optimizing them using well-known partial evaluation techniques. Inspection of straightforward partially evaluated unification algorithms gives an idea how to design special abstract machine instructions which later form the target language of our compilation. We handle typical compiler problems like representation of terms explicitly. This work gives a logical reconstruction of abstract Prolog machine code, and represents an approach of constructing a correct compiler from Prolog to such a code. As an example, we are explaining the unification principles of Warren’s New Prolog Engine within our framework.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bowen, D. L. and Byrd, L. M., “A Portable Prolog COmpiler,”Proc. of the Logic Programming Workshop, Portugal 74–83, 1983.

  2. Clocksin, W. F. and Mellish, C. S.,Programming in Prolog, 2nd Ed., Springer, 1984.

  3. Clocksin, W. F., “Design and Simulation of a Sequential Prolog Machine,”New Generation Computing, 3, pp. 101–120, 1985.

    Article  Google Scholar 

  4. Ershov, A. P., “On the Partial Evaluation Principle,”Information Processing Letters, Vol. 6, No. 2, pp. 38–41, 1977.

    Article  MATH  Google Scholar 

  5. Ershov, A. P., “Mixed Computation: Potential Applications and Problems for Study,”Theor. Comp. Sci., 18, pp. 41–67, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  6. Futamura, Y., “Partial Evaluation of Computation Process_— An Approach to a Compiler-Compiler,”Systems, Computers, Controls, Vol. 2, 5, pp. 45–50, 1971.

    Google Scholar 

  7. Heck, N. and Avenhaus, J., “Automatic Implementation of Abstract Data Types Specified by the Logic Programming Language”Proc. of the International Conference on Fifth Generation Computer Systems 1984, ICOT, pp. 210–219, 1984.

  8. Hsiang, J. and Srivas, M. K. “A Prolog Environment for Developing and Reasoning about Data Types,” inFormal Methods and Software Development, Vol. 2 (H. Ehrig et al., eds.), LNCS, 186, pp. 276–293, 1985.

  9. Jones, N. D., Sestoft, P. and Søndergaard, H., “An Experiment in Partial Evaluation: The Generation of a Compiler Generator,”1st Int. Conf. on Rewriting Techniques and Applications, Dijon, LNCS, 202, pp. 124–140, 1985.

  10. Kahn, K. M. and Carlsson, M., “The Compilation of Prolog Programs without the Use of a Prolog Compiler,”Proc. of the International Conference on Fifth Generation Computer Systems 1984, ICOT, pp. 348–355, 1984.

  11. Mellish, C. S., “Some Global Optimizations for a Prolog Compiler,”Journal of Logic Programming, 1, pp. 43–66, 1985.

    Article  Google Scholar 

  12. Neidecker, B., “KAP-Maschine: Maschinenmodell und Instruktionssatz,”internal report 19/86, University of Karlsruhe, 1986 [in German].

  13. Tick, E. and Warren, D. H. D., “Towards a Pipelined Prolog Processor,”New Generation Computing, 2, pp. 323–345, 1984.

    Article  Google Scholar 

  14. Venken, R., A Prolog Meta-Interpreter for Partial Evaluation and its Application to Source to Source Transformation and Query-Optimisation, ECAI 84, Elsevier Sc. Publ., North-Holland, pp. 91–104, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Gesellschaft für Mathematik und Datenverarbeitung mbH, Forschungsstelle an der Universität Karlsruhe, Haid-und-Neu-Str. 7, D-7500, Karlsruhe 1, Germany (West)

    Peter Kursawe

Authors
  1. Peter Kursawe
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peter Kursawe.

About this article

Cite this article

Kursawe, P. How to invent a Prolog machine. New Gener Comput 5, 97–114 (1987). https://doi.org/10.1007/BF03037460

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation