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

**Semantics: Advances in Theories and Mathematical Models**

by

**Muhammad Tanvir Afzal (ed.)**-

**InTech**

The book is a blend of a number of great ideas, theories, mathematical models, and practical systems in the domain of Semantics. Topics include: Background; Queries, Predicates, and Semantic Cache; Algorithms and Logic Programming; etc.

(

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

(

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

(

**16245**views)

**Formal Languages**

by

**Keijo Ruohonen**-

**Tampere University of Technology**

In these notes the classical Chomskian formal language theory is fairly fully dealt with, omitting however much of automata constructs and computability issues. Surveys of Lindenmayer system theory and the mathematical theory of codes are given.

(

**9246**views)