Article

Free access

Efficient interpretation of Prolog programs

Author:

J. BarklundAuthors Info & Claims

SIGPLAN '87: Papers of the Symposium on Interpreters and interpretive techniques

Pages 132 - 137

https://doi.org/10.1145/29650.29664

Published: 01 July 1987 Publication History

Abstract

The paper focuses on three ideas for solving problems with writing interpreters for the logic programming language Prolog in Prolog and how to combine these ideas to an interpreter for Prolog which is both simple and efficient. The resulting interpreter system can be incorporated into a Prolog based on Warren's Abstract Machine and built mostly from existing parts of it. The interpreter has been implemented and is used in a Prolog system developed at Uppsala University.

References

[1]

{Barklund el al. 86} J. Barklund, L. Oestreicher, Å. Hugosson, M. Nylén, Tricia User's Guide, Computing Science Department, Uppsala University, Sept. 1986.

[2]

{Barklund & Millroth 86} J. Barklund, H. Millroth, Garbage Cut for Garbage Collection of Iterative Prolog Programs, in 1986 Symposium on Logic Programming , Salt Lake City, Sept. 1986.

[3]

{Barklund & Millroth A.} J. Barklund, H. Millroth, Code Generation and Runtime System for Tricia, UPMAIL Technical Report 36, Uppsala, in preparation.

[4]

{Bowen 81} D. L. Bowen, DECsystem-10 Prolog User's Manual, University of Edinburgh, Dept. of Artificial Intelligence, Edinburgh, 1981.

[5]

{Bruynooghe 82} M. Bruynooghe, The Memory Management of Prolog Implementations, in K. L. Clark, S.-Å. Tärnlund, Logic Programming, London, 1982.

[6]

{Carlsson 84} M. Carlsson, LM-Prolog - the Language and Its Implementation, UPMAIL Technical Report 30, Oct. 1984.

[7]

{Carlsson 86} M. Carlsson, Compilation for Tricia and Its Abstract Machine, UPMAIL Technical Report 35, Uppsala, Sept. 1986.

[8]

{Clocksin & Mellish 81} W. F. Clocksin, C. S. Mellish, Programming in Prolog, New York, 1981.

Digital Library

[9]

{Kahn 83} K. Kahn, Unique Features of LISP Machine Prolog, UPMAIL Technical Report 15B, Uppsala, 1983 (revised by M. Carlsson Feb. 1985).

[10]

{Knuth 73} D. E. Knuth, The Art of Computer Programming, Volume 1 / Fundamental Algorithms, Reading, Mass., 1973.

Digital Library

[11]

{Kowalski 79} R. Kowalski, Logic for Problem Solving, New York, 1979.

Digital Library

[12]

{Lloyd 84} J. W. Lloyd, Foundations of Logic Programming , New York, 1984.

Digital Library

[13]

{Mellish 82} C. S. Mellish, An Alternative to Structure Sharing in the Implementation of a Prolog Interpreter, in K. L. Clark, S.-Å. Tärnlund, Logic Programming, London, 1982.

[14]

{Robinson 65} J. A. Robinson, A Machine-oriented Logic based on the Resolution Principle, Journal of the ACM, vol. 12, no. 1, pp. 23-41, 1965.

Digital Library

[15]

{Sterling & Shapiro 86} L. Sterling, E. Shapiro, The Art of Prolog: Advanced Programming Techniques, Cambridge, Mass., 1986.

Digital Library

[16]

{Warren 83} D. H. D. Warren, An Abstract Prolog Instruction Set, SRI Technical Note 309, October 1983.

Cited By

Demoen BMariën A(2005)Implementation of Prolog as binary definite programsLogic Programming10.1007/3-540-55460-2_12(165-176)Online publication date: 27-May-2005
https://doi.org/10.1007/3-540-55460-2_12
Terwilliger R(1988)Please: a language combining imperative and logic programmingACM SIGPLAN Notices10.1145/44326.4433723:4(103-110)Online publication date: 1-Apr-1988
https://dl.acm.org/doi/10.1145/44326.44337
Gibson I(1990)Analysis of experimental Prolog-database hardwareTwenty-Third Annual Hawaii International Conference on System Sciences10.1109/HICSS.1990.205096(30-39)Online publication date: 1990
https://doi.org/10.1109/HICSS.1990.205096

Index Terms

Efficient interpretation of Prolog programs

Recommendations

Efficient interpretation of Prolog programs

The paper focuses on three ideas for solving problems with writing interpreters for the logic programming language Prolog in Prolog and how to combine these ideas to an interpreter for Prolog which is both simple and efficient. The resulting interpreter ...
Compiling Prolog programs with list structure into procedural languages
Towards a jitting VM for prolog execution
PPDP '10: Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming

Most Prolog implementations are implemented in low-level languages such as C and are based on a variation of the WAM instruction set, which enhances their performance but makes them hard to write. In addition, many of the more dynamic features of Prolog ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGPLAN '87: Papers of the Symposium on Interpreters and interpretive techniques

July 1987

291 pages

ISBN:0897912357

DOI:10.1145/29650

Editor:
Richard L. Wexelblat
Philips Laboratories, Briarcliff Manor, NY

ACM SIGPLAN Notices Volume 22, Issue 7
July 1987
291 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/960114
Issue’s Table of Contents

Copyright © 1987 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1987

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
395
Total Downloads

Downloads (Last 12 months)74
Downloads (Last 6 weeks)14

Reflects downloads up to 01 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Demoen BMariën A(2005)Implementation of Prolog as binary definite programsLogic Programming10.1007/3-540-55460-2_12(165-176)Online publication date: 27-May-2005
https://doi.org/10.1007/3-540-55460-2_12
Terwilliger R(1988)Please: a language combining imperative and logic programmingACM SIGPLAN Notices10.1145/44326.4433723:4(103-110)Online publication date: 1-Apr-1988
https://dl.acm.org/doi/10.1145/44326.44337
Gibson I(1990)Analysis of experimental Prolog-database hardwareTwenty-Third Annual Hawaii International Conference on System Sciences10.1109/HICSS.1990.205096(30-39)Online publication date: 1990
https://doi.org/10.1109/HICSS.1990.205096

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents