Micro-PROLOG: programming in logic
Micro-PROLOG: programming in logic
Programming in Prolog (2nd ed.)
Programming in Prolog (2nd ed.)
Introduction to logic programming
Introduction to logic programming
Using object-orientation to implement logic programming
SIGSMALL '90 Proceedings of the 1990 ACM SIGSMALL/PC symposium on Small systems
| Hi-index | 0.00 |
With the current intense interest in new computing paradigms based on logic, the efficient implementation of Prolog has become an issue of prime importance. Compiling Prolog involves some unique and difficult problems relating to storage management: in particular, the somewhat conflicting requirements of backtracking, and cut and tail recursion processing. The usual solution is to use garbage collection, an expensive process in small computers with limited storage. We describe a Prolog compiler which maintains the heap as lists of free records, to which records are released at the time they are deallocated, thus avoiding garbage collection. In this compiler, variable bindings are recorded in such a way that the speed of unification does not depend on the length of chains of bound variables. Also, tail recursion optimisation is more thorough than in other implementations.