A piggy-back compiler for Prolog

In this paper, we describe’ the design and impienieutation of an optimizing Prolog compiler. Our approach is novel both for the breadth of techniques employed and the performance we achieve as a resuit of using those techniques. Furthermore, we know of no other compiler for Prolog that utilizes the same techniques and achieves comparable performance. h addition to efficiency, the design goals were portah’lity and simplicity. Our compiler takes advantage of knowledge about what it is compiiing to reduce the mechanisms needed to support its runtime evaluation. The types of knowledge it uses are:

[1]  Chris Mellish,et al.  Some Global Optimizations for a Prolog Compiler , 1985, J. Log. Program..

[2]  Chris Mellish,et al.  Integrating Prolog in the POPLOG Environment , 1984, Implementations of Prolog.

[3]  Luca Cardelli,et al.  Compiling a functional language , 1984, LFP '84.

[4]  Jørgen Fischer Nilsson,et al.  On the Compilation of a Domain-Based Prolog , 1983, IFIP Congress.