## 15-816 Linear Logic |

LLF is an type theory, which extends the simply-typed lambda calculus by dependent and linear types. It has been implemented as part of the Twelf project (we call it linear Twelf, to distinguish it from the non-linear Twelf), and can hence be used for type checking of signatures, and executing queries by interpreting signatures as logic programs. In this lecture we discuss the formal framework of LLF and show that type checking is decidable.

Carsten Schuermann carsten@cs.cmu.edu