**Practical Foundations for Programming Languages**

by Robert Harper

2008**Number of pages**: 470

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

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

(

**7846**views)

**Proofs and Types**

by

**J. Girard, Y. Lafont, P. Taylor**-

**Cambridge University Press**

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.

(

**11322**views)

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

(

**10464**views)

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

(

**2671**views)