15-816 Linear Logic
Lecture 14: Logical Compilation

In this lecture we discuss some examples of linear logic programming in the Lolli language. An implementation of Lolli as an interpreter written in Standard ML is available for this course. The main example will be a program to solve a solitaire puzzle.

We also sketch resource management and show how the foundations of a compiler for Lolli can be motivated logically via a notion of residuation. It translates program clauses into a sequence of proposition that can be read as search instructions.

[CHP00] Iliano Cervesato, Joshua S. Hodas and Frank Pfenning.
Efficient Resource Management for Linear Logic Proof Search
Theoretical Computer Science, 232:133-163, 2000.

[ Home | Schedule | Assignments | Handouts | Software | Resources ]

Frank Pfenning