Linear logic
developed by J.-Y. Girard [3]
can be described as a logic of resources.
There have been several proposals for
logic programming language based on linear logic:
LO [2],
LinLog [1],
ACL [5],
Lolli
[4],
Lygon
[7], and
Forum
[6].
Lolli and Lygon
are implemented as interpreter systems
(on SML and 
Prolog for Lolli, on Prolog for Lygon).
But, none of them have been implemented as a compiler system.
We developed a compiler system of a linear logic programming language called LLP [8]. LLP programs are compiled into LLPAM (LLP Abstract Machine) code, which is an extended WAM (Warren Abstract Machine) designed for LLP.
LLP is a superset of Prolog and a subset of another linear logic programming language Lolli. Prolog programs can be executed without any modification (however, some built-in predicates are missing in our current implementation).
In this paper, we describe syntax and programming features of LLP. Various example programs are also included to show that LLP is suitable for describing many kind of constraint satisfaction problems.