First Page | Document Content | |
---|---|---|
Date: 2009-12-18 13:56:03Computability theory Lambda calculus Theoretical computer science Computer science Mathematics Academia Proof theory | Chapter 3 Simple Types We study simple types in this chapter, We first formalize a simply-typed programming language L0 and then establish its type soundness, setting some machinery for development in the following chapAdd to Reading ListSource URL: www.cs.bu.eduDownload Document from Source WebsiteFile Size: 83,91 KBShare Document on Facebook |