**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

**Reasoned Programming**

by

**Krysia Broda et al**-

**Prentice Hall Trade**

The text for advanced undergraduate/graduate students of computer science. It introduces functional, imperative and logic programming and explains how to do it correctly. Functional programming is presented as a programming language in its own right.

(

**12217**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.

(

**11981**views)

**Programming and Programming Languages**

by

**Shriram Krishnamurthi**-

**Brown University**

Many people would regard this as being two books in one. One book is an introduction to programming, teaching you basic concepts of organizing data and the programs that operate over them. The other book is an introduction to programming languages.

(

**7204**views)

**Computational Category Theory**

by

**D.E. Rydeheard, R.M. Burstall**

The book is a bridge-building exercise between computer programming and category theory. Basic constructions of category theory are expressed as computer programs. It is a first attempt at connecting the abstract mathematics with concrete programs.

(

**18064**views)