Linear logic, introduced in 1986 by J.-Y. Girard, is based upon a fine grain analysis of the
main proof-theoretical notions of logic. The subject develops along the lines of denotational …

An intensional model for the programming language PCF is described in which the types of
PCF are interpreted by games and the terms by certain history-free strategies. This model is …

When you think about how far and fast computer science has progressed in recent years, it's
not hard to conclude that a seven-year old handbook may fall a little short of the kind of …

First published in 1998, this textbook is a broad but rigourous survey of the theoretical basis
for the design, definition and implementation of programming languages and of systems for …

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 …

A programming language possesses two fundamental features: syntax and semantics.
Syntax refers to the appearance of the well-formed programs of the language, and …

We present the general theory of the method of glueing and associated technique of
orthogonality for constructing categorical models of all the structure of linear logic: in …

Realizability toposes are" models of constructive set theory" based on abstract notions of
computability. They arose originally in the study of mathematical logic, but since then various …

We investigate implementation techniques arising directly from Girard's Geometry of
Interaction semantics for Linear Logic, specifically for a simple functional programming …

Axiomatic categorical domain theory is crucial for understanding the meaning of programs
and reasoning about them. This book is the first systematic account of the subject and …