<--- Back to Details
First PageDocument Content
Computability theory / Lambda calculus / Theoretical computer science / Computer science / Mathematics / Academia / Proof theory
Date: 2009-12-18 13:56:03
Computability 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 chap

Add to Reading List

Source URL: www.cs.bu.edu

Download Document from Source Website

File Size: 83,91 KB

Share Document on Facebook

Similar Documents