Denotational semantics is a methodology for giving mathematical meaning to programming
languages and systems. It was developed by Christopher Strachey's Programming …

The programming language Scheme contains the control construct call/cc that allows access
to the current continuation (the current control context). This, in effect, provides Scheme with …

Modern system-on-chip (SoC) design shows a clear trend toward integration of multiple
processor cores on a single chip. Designing a multiprocessor system-on-chip (MPSOC) …

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 …

We show that any monad whose unit and extension operations are expressible as purely
functional terms can be embedded in a call-by-value language with “composable …

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 …

Plotkin's λ-value calculus is sound but incomplete for reasoning about βeegr;-
transformations on programs in continuation-passing style (CPS). To find a complete …

This paper proposes that the meanings of some natural language expressions should be
thought of as functions on their own continuations. Continuations are a well-established …

We show that standard formulations of intersection type systems are unsound in the
presence of computational effects, and propose a solution similar to the value restriction for …

We present a general theory of scope and binding in which both crossover and superiority
violations are ruled out by one key assumption: that natural language expressions are …