**Lectures on the Curry-Howard Isomorphism**

by Morten Heine B. Sorensen, Pawel Urzyczyn

**Publisher**: Elsevier Science 2006**ISBN/ASIN**: 0444520775**Number of pages**: 273

**Description**:

The Curry-Howard isomorphism states an amazing correspondence between systems of formal logic as encountered in proof theory and computational calculi as found in type theory. This book give an introduction to parts of proof theory and related aspects of type theory relevant for the Curry-Howard isomorphism. It can serve as an introduction to any or both of typed lambda-calculus and intuitionistic logic.

Download or read it online for free here:

**Download link**

(1.3MB, PDF)

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

(

**8530**views)

**Topics in History and Comparing Programming Languages**

by

**Dennie Van Tassel**-

**Gavilan College**

This website contains files on the history of computer programming language statements. The files compare programming language statements in several different languages tracing the statement from early languages to present languages.

(

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

(

**8650**views)

**The Theory of Languages and Computation**

by

**Jean Gallier, Andrew Hicks**-

**University of Pennsylvania**

From the table of contents: Automata; Formal Languages (A Grammar for Parsing English, Context-Free Grammars, Derivations and Context-Free Languages, Normal Forms for Context-Free Grammars, Chomsky Normal Form, ...); Computability; Current Topics.

(

**4212**views)