• Corpus ID: 13216

A semantic analysis of control

@inproceedings{Laird1999ASA,
  title={A semantic analysis of control},
  author={James David Laird},
  year={1999}
}
  • J. Laird
  • Published 1 July 1999
  • Computer Science
This thesis examines the use of denotational semantics to reason about control flow in sequential, basically functional languages. It extends recent work in game semantics, in which programs are interpreted as strategies for computation by interaction with an environment. Abramsky has suggested that an intensional hierarchy of computational features such as state, and their fully abstract models, can be captured as violations of the constraints on strategies in the basic functional model. Non… 
Game semantics and realizability for classical logic
This thesis investigates two realizability models for classical logic built on HO game semantics. The main motivation is to have a direct computational interpretation of classical logic, arithmetic
Extensional Semantics of Program Behaviour : Case for Support In
  • Computer Science
  • 2008
TLDR
This research project aims to capture intensional aspects of program behaviour using extensional models to discover new kinds of game semantics, perhaps embodying different notions of sequentiality, and new ways of reasoning about games and strategies.
Game semantics and linear CPS interpretation
  • J. Laird
  • Computer Science
    Theor. Comput. Sci.
  • 2005
Compositional relational reasoning via operational game semantics
We show how to use operational game semantics as a guide to develop relational techniques for establishing contextual equivalences with respect to contexts drawn from a hierarchy of four
Combining and Relating Control Effects and their Semantics
TLDR
This work describes and compares games models for a programming language which includes local exceptions and first class continuations, as well as higher-order references, and concludes that soundness of such a concrete and complex model is a non-trivial problem.
Game semantics for an object-oriented language
TLDR
This thesis defines a class-based, stateful object-oriented language, and gives a heapbased operational semantics and an interpretation in the game model, and shows that definability and full abstraction hold at certain types of arbitrary rank, but are problematic at other types.
Verification of Higher-Order Computation: A Game-Semantic Approach
  • C. Ong
  • Computer Science
    ESOP
  • 2008
TLDR
A theme of the work is the fruitful interplay of ideas between the neighbouring fields of semantics and verification in an approach to the verification of higher-order computation based on game semantics.
Algorithmic Game Semantics: A Tutorial Introduction
TLDR
The aim in this tutorial presentation is to give a first indication of how Game Semantics can be developed in a new, algorithmic direction, with a view to applications in computer-assisted verification and program anal ysis.
A game semantics of names and pointers
  • J. Laird
  • Computer Science
    Ann. Pure Appl. Log.
  • 2008
...
...

References

SHOWING 1-10 OF 84 REFERENCES
Classical logic, continuation semantics and abstract machines
TLDR
The goal of this paper is to demonstrate that denotational semantics is useful for operational issues like implementation of functional languages by abstract machines by studying the case of extensional untyped call-by-name λ-calculus with Felleisen's control operator.
Full Abstraction for PCF
TLDR
The effective version of the model is considered and it is proved that every element of the effective extensional model is definable in PCF, which is the first syntax-independent description of the fully abstract model for PCF.
Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions
Full abstraction for functional languages with control
  • J. Laird
  • Computer Science
    Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science
  • 1997
TLDR
A fully abstract and effectively presentable model of a functional language with non-local control as part of a modular approach to modelling non-functional features using games is defined.
LCF Considered as a Programming Language
A Game Semantics for Linear Logic
  • A. Blass
  • Philosophy
    Ann. Pure Appl. Log.
  • 1992
A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations
  • C. Ong
  • Philosophy
    Proceedings 11th Annual IEEE Symposium on Logic in Computer Science
  • 1996
TLDR
This extended abstract outlines a semantic theory of classical proofs based on a variant of Parigot's /spl lambda//spl mu/-calculus, but presented here as a type theory.
A Simple Adequate Categorical Model for PCF
TLDR
An axiomatic approach to adequacy for PCF is presented, in the sense that categorical axioms enabling an adequate semantics to be given are introduced, which takes the point of view that partiality is the fundamental notion from which order-structure should be derived.
A generic account of continuation-passing styles
TLDR
This work unifies previous work on continuation-passing style (CPS) transformations in a generic framework based on Moggi's computational meta-language, and proves an adequacy property for the generic transformation and establishes an equational correspondence between the meta- language and CPS terms.
On Full Abstraction for PCF: I, II, and III
TLDR
An order-extensional, order (or inequationally) fully abstract model for Scott's language pcf, based on a kind of game in which each play consists of a dialogue of questions and answers between two players who observe the following principles of civil conversation.
...
...