Type theory is one of the most important tools in the design of higher-level programming
languages, such as ML. This book introduces and teaches its techniques by focusing on one …

This textbook offers an understanding of the essential concepts of programming languages.
The approach is analytic and hands-on. The text uses interpreters, written in Scheme, to …

Programming is hard. Building a large program is like constructing a steam locomotive
through a hole the size of a postage stamp. An artefact that is the fruit of hundreds of person …

We bridge the gap between functional evaluators and abstract machines for the λ-calculus,
using closure conversion, transformation into continuation-passing style, and …

Self-maintaining natural systems include the global climate system, all living organisms,
many cognitive processes, and a diversity of human social institutions. The capacity to …

Computational semantics is the art and science of computing meaning in natural language.
The meaning of a sentence is derived from the meanings of the individual words in it, and …

The formal systems that are nowadays called λ-calculus and combinatory logic were both
invented in the 1920s, and their aim was to describe the most basic properties of function …

Combinatory logic is one of the most versatile areas within logic that is tied to parts of
philosophical, mathematical, and computational logic. Functioning as a comprehensive …

The dangers of programs performing floating-point computations are well known. This is due
to the sensitivity of the results to the way formulæ are written. These last years, several …

We materialize the common understanding that calculi with explicit substitutions provide an
intermediate step between an abstract specification of substitution in the lambda-calculus …