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

**Lecture Notes on Static Analysis**

by

**Michael I. Schwartzbach**-

**IT University of Copenhagen**

These notes present principles and applications of static analysis of programs. We cover type analysis, lattice theory, control flow graphs, dataflow analysis, fixed-point algorithms, narrowing and widening, control flow analysis, pointer analysis.

(

**4500**views)

**Denotational Semantics: A Methodology for Language Development**

by

**David Schmidt**-

**Kansas State University**

Denotational semantics is a methodology for giving mathematical meaning to programming languages and systems. This book was written to make denotational semantics accessible to a wider audience and to update existing texts in the area.

(

**8627**views)

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

(

**10993**views)

**Implementing Functional Languages: a tutorial**

by

**Simon Peyton Jones, David Lester**-

**Prentice Hall**

This book gives a practical approach to understanding implementations of non-strict functional languages using lazy graph reduction. It is intended to be a source of practical material, to help make functional-language implementations come alive.

(

**9480**views)