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

**Elements of Programming**

by

**Alexander Stepanov, Paul McJones**-

**Semigroup Press**

This book applies the deductive method to programming by affiliating programs with the abstract mathematical theories. Specification of these theories, algorithms and theorems and lemmas describing their properties are presented together.

(

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

(

**16364**views)

**Categories, Types, and Structures**

by

**Andrea Asperti, Giuseppe Longo**-

**MIT Press**

Here is an introduction to category theory for the working computer scientist. It is a self-contained introduction to general category theory and the mathematical structures that constitute the theoretical background.

(

**18989**views)

**Linkers and Loaders**

by

**John R. Levine**-

**Morgan Kaufmann**

The author presents clear practical advice to help you create faster, cleaner code. You'll learn to avoid the pitfalls associated with Windows DLLs, take advantage of the performance-improving techniques supported by many modern linkers, etc.

(

**12974**views)