Parameter Passing and Control Stack Management in Prolog Implementation Revisited

ACM Transactions on Programming Languages and Systems

Volumn 18, Issue 6, 1996, Pages 752-779

  Zhou, Neng Fa ^a  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Abstract machine; D.1.6 Programming Techniques : Logic Programming; D.3.4 Programming Languages : Processors Compilers; Experimentation; Languages; Prolog

Indexed keywords

DATA STORAGE EQUIPMENT; LOGIC PROGRAMMING; PROGRAM COMPILERS; PROGRAM PROCESSORS;

ANOTHER TREE ORIENTED ABSTRACT MACHINE; CONTROL STACK MANAGEMENT; PARAMETER PASSING; WARREN ABSTRACT MACHINE;

PROLOG (PROGRAMMING LANGUAGE);

EID: 0030284443     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/236114.236120     Document Type: Article

References (21)

1. AHO, A., SETHI, R., AND ULLMAN, J. 1986. Compilers - Principles, Techniques, and Tools. Addison-Wesley, Reading, Mass.
2. AIT-KACI, H. 1991. Warren's Abstract Machine. MIT Press, Cambridge, Mass.
3. CAMPBELL, J. 1984. Implementations of Prolog. Ellis Horwood Chichester, U.K.
4. CARLSSON, M. 1990. Design and implementation of an or-parallel prolog engine. Ph.D. thesis, S-16428, Swedish Institute of Computer Science, Kista, Sweden.
5. CLARK, K. AND TARNLUND, S. 1982. Logic Programming. Academic Press, New York.
6. DEDRAY, S. 1988. Unfold/fold transformations and loop optimizations of logic programs. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM Press, New York, 297-307.
7. HICKEY, T. AND MUDAMBI, S. 1989. Global compilation of prolog. J. Logic Program. 7, 3, 193-230.
8. KRALL, A. AND BERGER, T. 1995. Incremental global compilation of prolog with the vienna abstract machine. In Proceedings the 12th International Conference on Logic Programming. MIT Press, Cambridge, Mass., 333-347.
9. MARIEN, A. AND DEMOEN, B. 1990. On the management of choice point and environment frames in the wam. In Proceedings of the North American Conference on Logic Programming. MIT Press, Cambridge, Mass., 1030-1047.
10. MEIER, M. 1991. Recursion vs. iteration in prolog. In Proceedings of the 8th International Conference on Logic Programming. MIT Press, Cambridge, Mass., 156-169.
11. TARAU, P. 1991. A simplified abstract machine for the execution of binary metaprograms. In Proceedings of the Logic Programming Conference. ICOT, Tokyo, Japan, 119-128.
12. TAYLOR, A. 1989. Removal of dereferencing and trailing in prolog compilation. In Proceedings of the 6th International Conference on Logic Programming. MIT Press, Cambridge, Mass., 48-60.
13. UEDA, K. AND CHIKAYAMA, T. 1990. Design of the kernel language for the parallel inference machine. Comput. J. 33, 494-500.
14. VAN ROY, P. 1990. Can logic programming executes as fast as imperative programming? Ph.D. thesis, Dept. of Computer Science, Univ. of California, Berkeley, Calif.
15. VAN ROY, P. 1994. 1983-1993: The wonder years of sequential prolog implementation. J. Logic Program. 19, 385-441.
16. VAN ROY, P. 1995. Aquarius benchmarks. Available by anonymous ftp from gatekeeper.dec.com in pub/plan/prolog/AquariusBenchmarks.tar.Z.
17. WARREN, D. 1977. Implementing prolog-compiling predicate logic programs. Ph.D. thesis, Dept. of Artificial Intelligence, Univ. of Edinburgh, Edinburgh, U.K.
18. WARREN, D. 1983. An abstract Prolog instruction set. Tech. Rep., SRI International, Menlo Park, Calif.
19. ZHOU, N. 1993. Global optimizations in a prolog compiler for the toam. J. Logic Program. 15, 265-294.
20. ZHOU, N. 1994. On the scheme of passing arguments in stack frames for prolog. In Proceedings of the 11th International Conference on Logic Programming. MIT Press, Cambridge, Mass., 159-174.
21. ZHOU, N. 1996. A novel implementation method for delay. In Proceedings of the Joint International Conference and Symposium on Logic Programming. MIT Press, Cambridge, Mass., 97-111.