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 …

This book serves as an introduction to an area of computability theory that originated in the
1950s, and since then has fanned out in many different directions under the influence of …

The Full Abstraction Problem for PCF [23, 20, 7, 11] is one of the longeststanding problems
in the semantics of programming languages. There is quite widespread agreement that it is …

In order to define models of simply typed functional programming languages being closer to
the operational semantics of these languages, the notions of sequentiality, stability and …

Language-based security relies on the assumption that all potential attacks follow the rules
of the language in question. When programs are compiled into a different language, this is …

The Structure of Typed Programming Languages describes the fundamental syntactic and
semantic features of modern programming languages, carefully spelling out their impacts on …

Language-based security relies on the assumption that all potential attacks are bound by the
rules of the language in question. When programs are compiled into a different language …

One of the major challenges in denotational semantics is the construction of a fully abstract
semantics for a higher-order sequential programming language. For the past fifteen years …

First-class control operators provide programmers with an expressive and efficient means for
manipulating control through reification of the current control state as a first-class object …

Nondeterminism is a pervasive phenomenon in computation. Often it arises as an emergent
property of a complex system, typically as the result of contention for access to shared …