A substitution based model for the implementation of PROLOG
Since PROLOG has been chosen as the Fifth Generation Computer’s Kernal Language, it is presently one of the hottest topics among computer scientists all over the world. Recently, the implementation technique and the application of PROLOG have been developed rapidly. In this paper, a new implementation scheme for PROLOG is proposed. The scheme is based on the substitution of instantiated veriable values. It has many advantages, such as a higher running speed, less main memory requirement, and easier to be implemented. The scheme has been implemented by the authors on IBM4341.
KeywordsImplementation Scheme Transformation Rule Parent Goal Prolog System Exit Module
Unable to display preview. Download preview PDF.
- H.D. Warren and L.M. Pereira, PROLOG-the Language and its Implementation Compared with LISP, ACM Proc. of the Symposium on Artificial Intelligence and Programming Language, New York, 1977, 109–115.Google Scholar
- B. Dzmolki and P. Szeredi, PROLOG in Practice, Proc. IFIP83, North Holland Elsevier, 1983, 627–636.Google Scholar
- J.F. Nilsson, On the Compilation of a Domain-based PROLOG, Proc. IFIP83, North Holland Elsevier, 1983, 293–298.Google Scholar
- W.F. Cloksin and C.S. Mellish, Programming in PROLOG, Springe Verlag, Berlin Heidelberg New York, 1981.Google Scholar
- Edited by J.A. Campbell, Implementation of PROLOG, Ellis Horwood Limited, New York, Chichester, Brisbane, Toronto, 1984.Google Scholar
- Chen Zhaoxiong, A Theoretical Model for the Implementation of Concurrent-PROLOG,Computer Research and Development,23:8(1986).Google Scholar