15-816 Linear Logic
Lecture 18: Linear Logic Programming
Functional programming arises from the lambda-calculus by fixing
an evaluation strategy. Logic programming arises from the sequent
calculus by fixing a proof search strategy. This proof search strategy
is characterized by goal-directed search, focussed use of assumptions,
and the interpretation of atomic goals as procedure calls.
In this lecture we develop the fragment of linear logic for which
the operational interpretation is sound and weakly complete. The
resulting language Lolli due to Hodas and Miller has a number of
interesting features which allows logic programming with state. We
explore these features through two examples: a simple database and a
- Iliano Cervesato, Joshua Hodas, and Frank Pfenning.
Efficient Resource Management for Linear
Logic Proof Search.
This is a revised and extended version of
a summary from the International Workshop on Extensions of Logic
Programming (ELP'96), Leipzig, Germany, March 28-30, 1996.
- J. S. Hodas and D. Miller.
Logic programming in a fragment of
intuitionistic linear logic.
Information and Computation, 110(2):327-365, 1994.
Revised version of an extended abstract which appeared in the
Proceedings of the Sixth Annual Symposium on Logic in Computer Science,
Amsterdam, July 15-18, 1991.