Programming Languages: Build, Prove, and Compare

Programming Languages as Working Systems

Norman Ramsey’s Programming Languages: Build, Prove, and Compare approaches language design from the interpreter up. Instead of asking readers to memorize feature lists from several industrial languages, it narrows the field to small, learnable “bridge” languages. Each one is implemented by an interpreter whose essential parts are explained, so abstract ideas about syntax, evaluation, types, and modules become concrete machinery that readers can inspect and modify.

Build Small Languages, Understand Large Ones

The bridge-language method gives the book a practical spine. Readers see how functional and object-oriented programming can share foundational concepts, how type systems enforce invariants, and how modules and generics support larger programs. That layered view helps explain why modern languages make the choices they do—and what those choices cost in implementation and use.

Where Theory Meets Implementation

Type checking, type inference, abstract data types, object orientation, garbage collection, and arbitrary-precision arithmetic all appear as working systems rather than isolated theory. The text connects formal rules to interpreters, so readers can move between the “prove” and “build” sides of programming-language study without losing the thread.

Substantial Projects and More Than 300 Exercises

• Milner’s type inference algorithm
• Copying and mark-and-sweep garbage collection
• Arithmetic on arbitrary-precision integers

These projects are supported by more than 300 practice exercises that exploit the interpreters. The exercises are not busywork; they give readers a way to test their understanding by changing the languages and watching the consequences.

Who Will Benefit

This is an undergraduate programming-languages textbook, but its implementation-centered approach also suits programmers who want a deeper foundation than a typical language survey provides. Readers comfortable with basic programming and eager to understand interpreters, type systems, and language design will find the material substantial and coherent.

A Rigorous Path Through Language Design

Ramsey, an associate professor of computer science at Tufts University, writes with the assumption that computer scientists often need to learn new languages quickly. The best preparation is not a catalog of syntax but a grasp of the principles underneath. Programming Languages: Build, Prove, and Compare offers that grasp through construction, comparison, and proof.