## 15-816 Linear Logic |

Type-checking linear lambda-calculus terms can also be seen as checking the validity of linear natural deductions. In this lecture we will develop an algorithm for linear type checking, that is, for type-checking terms in the linear lambda calculus.

We also show how we can generate linear proof terms for sequent calculus derivations. This allows us to validate derivations generated by tactics by checking the resulting proof terms.

- Next: Lecture 14: Linear Functional Programming
- Previous: Lecture 12: Proof Terms
- Schedule

Frank Pfenning fp@cs