15-816 Linear Logic |
Simple imperative programming languages can be elegantly represented in Lolli. But the absence of a proof term language and dependent types limit its expressiveness.
In this lecture we motivate a linear logical framework which provides a proof term language, and dependent types, and we show at the example of a more advanced imperative programming language how to use higher order representation techniques.