A calculus of coroutines

  title={A calculus of coroutines},
  author={James David Laird},
  journal={Theor. Comput. Sci.},
  • J. Laird
  • Published 7 February 2006
  • Computer Science
  • Theor. Comput. Sci.
Imperative Programs as Proofs via Game Semantics
A Small-Step Semantics of a Concurrent Calculus with Goroutines and Deferred Functions
  • M. Steffen
  • Computer Science
    Theory and Practice of Formal Methods
  • 2016
A small-step operational semantics for a small concurrent language supporting deferred function calls and related constructs in the style of the Go programming language and the notion of closures in the semantics is presented.
A semantics for aspects by compositional translation
It is shown that abandoning the labelling technique, and consequently relaxing the so-called ``obliviousness'' property of aspectual languages, allows preemptive aspects to be included in the general references model without the need for exceptions.


Sequentiality and the π-Calculus
The result shows how a typed π-calculus can be used as a descriptive tool for a significant class of programming languages without losing the latter’s semantic properties.
A Game Semantics of the Asynchronous pi-Calculus
A simple game semantics of this language is described, placing it within a rich hierarchy of games models for programming languages, based on the notion of closed Freyd category, and it is shown that the denotations of processes are equivalent to their sets of traces.
A Game Semantics of the Asynchronous π-Calculus
A simple game semantics of the typed asynchronous π-calculus is described, placing it within a rich hierarchy of games models for programming languages, and it is shown that the denotations of processes are equivalent, via this correspondence, to their sets of traces.
Game Semantics for Higher-Order Concurrency
A denotational (game) semantics for a call-by-value functional language with multiple threads of control, which may communicate values of general type on locally declared channels is described, and it is proved that the semantics is fully abstract with respect to may-testing using a correspondence between channel and function types based on the triggering representation of procedure-passing in terms of name-Passing.
The regular-language semantics of second-order idealized ALGOL
Decidability in Syntactic Control of Interference
It is shown that both observational approximation and observational equivalence are decidable in this language by describing a fully abstract games model in which strategies are regular languages.
A semantic analysis of control
This thesis examines the use of denotational semantics to reason about control flow in sequential, basically functional languages, and establishes decidability of observational equivalence for finitary PCF, contrasting with the undecidable of the analogous relation in pure PCF.
Bidomains and Full Abstraction for Countable Nondeterminism
We describe a denotational semantics for a sequential functional language with random number generation over a countably infinite set (the natural numbers), and prove that it is fully abstract with
Observable sequentiality and full abstraction
This paper focuses on a sequential extension of PCF that includes two classes of control operators: error generators and error-sensitve functions, which enable us to construct a fully abstract model for SPCF that interprets higher types as sets of error-sensitive functions instead of continuous functions.
Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions