Efficient implementation of a linear logic programming language

A number of logic programming languages based on Linear Logic [3] have been proposed. However, the implementation techniques proposed for these languages have relied heavily on the copying and scanning of large data struc-tures to ensure that linearity conditions have been met, and thus have been most suited to the creation of interpreters written in high-level languages. In this paper we present a new formulation of the logic of the language Lolli that is conducive to the creation of both more efficient interpreters, as well as compilers based on extensions of the standard WAM model. We present such an extension which implements a useful fragment of Lolli. Resource con-scious algorithms executed using this system show signiflcant performance advantages relative to their traditional Prolog implementations