**Practical Foundations for Programming Languages**

by Robert Harper

**Publisher**: Carnegie Mellon University 2016**Number of pages**: 580

**Description**:

This is a working draft of a book on the foundations of programming languages. The central organizing principle of the book is that programming language features may be seen as manifestations of an underlying type structure that governs its syntax and semantics. The emphasis, therefore, is on the concept of type, which codiļ¬es and organizes the computational universe in much the same way that the concept of set may be seen as an organizing principle for the mathematical universe. The purpose of this book is to explain this remark.

Download or read it online for free here:

**Download link**

(1.2MB, PDF)

## Similar books

**Formal Syntax and Semantics of Programming Languages**

by

**Kenneth Slonneger, Barry L. Kurtz**-

**Addison Wesley Longman**

The book presents the typically difficult subject of formal methods in an informal, easy-to-follow manner. Readers with a basic grounding in discreet mathematics will be able to understand the practical applications of these difficult concepts.

(

**12134**views)

**Semantics With Applications: A Formal Introduction**

by

**Hanne Riis Nielson, Flemming Nielson**-

**John Wiley & Sons**

The book covers the foundations of structural operational semantics and natural semantics. It shows how to describe the semantics of declarative as well as imperative language constructs and will also touch upon non-sequential constructs.

(

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

(

**9274**views)

**Lecture Notes on the Lambda Calculus**

by

**Peter Selinger**-

**Dalhousie University**

Topics covered in these notes include the untyped lambda calculus, the Church-Rosser theorem, combinatory algebras, the simply-typed lambda calculus, the Curry-Howard isomorphism, weak and strong normalization, type inference, etc.

(

**8296**views)