**Proofs and Types**

by J. Girard, Y. Lafont, P. Taylor

**Publisher**: Cambridge University Press 1989**ISBN/ASIN**: 0521371813**ISBN-13**: 9780521371810**Number of pages**: 183

**Description**:

This little book comes from a short graduate course on typed lambda-calculus given at the Universite Paris. It is not intended to be encyclopedic and the selection of topics was really quite haphazard. Some very basic knowledge of logic is needed, but we will never go into tedious details.

Download or read it online for free here:

**Download link**

(multiple formats)

## Similar books

**A Practical Theory of Programming**

by

**Eric C.R. Hehner**-

**Springer**

Understanding programming languages requires knowledge of the underlying theoretical model. This book explores aspects of programming that are amenable to mathematical proof. It describes a simple and comprehensive theory.

(

**9223**views)

**Programming Languages: Application and Interpretation**

by

**Shriram Krishnamurthi**-

**Lulu.com**

The textbook for a programming languages course, taken primarily by advanced undergraduate and beginning graduate students. This book assumes that students have modest mathematical maturity, and are familiar with the existence of the Halting Problem.

(

**7703**views)

**Exploring Programming Language Architecture in Perl**

by

**Bill Hails**

This book presents an informal and friendly introduction to some of the core ideas in modern computer science, using the programming language Perl as its vehicle. The book takes the form of a series of working interpreters for the language PScheme.

(

**8460**views)

**Type Systems for Programming Languages**

by

**Robert Harper**

Provides an account of the role of type theory in programming language design and implementation. The stress is on the use of types as a tool for analyzing programming language features and studying their implementation.

(

**11401**views)