LAM: another Prolog abstract machine

The Warren Abstract Machine has been accepted as the de facto standard for implementing Prolog for more than ten years. The WAM adopts structure copying to represent Prolog terms. It flattens nested structures and expands them into efficient WAM instructions which either copy terms into the heap or unify terms along the heap pointer. When two terms to be unified are structure instances in the heap, the WAM must invoke a built-in procedure to carry out the stack based full unification. We propose a new Prolog execution model-the Lakehead Abstract Machine. The LAM is designed to retain the control features of the WAM, but the structure copying is replaced by program sharing for implementing unification. The idea of program sharing is originated from the structure sharing used in the DEC-10 Prolog. The significant difference, however, is that the shared resources are no longer structure prototypes, but executable LAM code. With the LAM, nested structures are flattened and then translated into a set of subprograms. In constructing a structure, the LAM only puts its corresponding subprogram pointer into the heap. When two terms to be unified are structures, their bound subprograms will be invoked. We have implemented an experimental LAM emulator in C. Benchmarks show that the LAM based Prolog implementation is quite competitive with the WAM based systems, such as SICStus and BIN-Prolog