This text develops a comprehensive theory of programming languages based on type
systems and structural operational semantics. Language concepts are precisely defined by …

This paper presents a way of extending the paradigm" proofs as programs" to classical
proofs. The system we use is derived from the general Free Deduction system presented in …

Propositions as types Page 1 DECEMBER 2015 | VOL. 58 | NO. 12 | COMMUNICATIONS OF
THE ACM 75 DOI:10.1145/2699407 Connecting mathematical logic and computation, it …

The syntactic theories of control and state are conservative extensions of the λ υ-calculus for
equational reasoning about imperative programming facilities in higher-order languages …

When scripts in untyped languages grow into large programs, maintaining them becomes
difficult. A lack of types in typical scripting languages means that programmers must (re) …

Plotkin's λ v-calculus for call-by-value programs is weaker than the λβη-calculus for the
same programs in continuation-passing style (CPS). To identify the call-by-value axioms that …

This paper investigates the transformation of v-terms into continuation-passing style (CPS).
We show that by appropriate-expansion of Fischer and Plotkin's two-pass equational speci …

This book takes concepts developed by researchers in theoretical computer science and
adapts and applies them to the study of natural language meaning. Summarizing more than …

We present a particularly simple lazy lambda-calculus machine, which was introduced
twenty-five years ago. It has been, since, used and implemented by several authors, but …

Call-by-push-value is a programming language paradigm that, surprisingly, breaks down the
call-by-value and call-by-name paradigms into simple primitives. This monograph, written for …