Results 1 
4 of
4
A Semantic analysis of control
, 1998
"... 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 ..."
Abstract

Cited by 32 (5 self)
 Add to MetaCart
(Show Context)
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. Nonlocal control flow is shown to fit into this framework as the violation of strong and weak ‘bracketing ’ conditions, related to linear behaviour. The language µPCF (Parigot’s λµ with constants and recursion) is adopted as a simple basis for highertype, sequential computation with access to the flow of control. A simple operational semantics for both callbyname and callbyvalue evaluation is described. It is shown that dropping the bracketing condition on games models of PCF yields fully abstract models of µPCF.
Axioms for Definability and Full Completeness
 in Proof, Language and Interaction: Essays in Honour of Robin
, 2000
"... ion problem for PCF (see [BCL86, Cur93, Ong95] for surveys). The importance of full abstraction for the semantics of programming languages is that it is one of the few quality filters we have. Specifically, it provides a clear criterion for assessing how definitive a semantic analysis of some langu ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
ion problem for PCF (see [BCL86, Cur93, Ong95] for surveys). The importance of full abstraction for the semantics of programming languages is that it is one of the few quality filters we have. Specifically, it provides a clear criterion for assessing how definitive a semantic analysis of some language is. It must be admitted that to date the quest for fully abstract models has not yielded many obvious applications; but it has generated much of the deepest work in semantics. Perhaps it is early days yet. Recently, game semantics has been used to give the first syntaxindependent constructions of fully abstract models for a number of programming languages, including PCF [AJM96, HO96, Nic94], richer functional languages [AM95, McC96b, McC96a, HY97], and languages with nonfunctional features such as reference types and nonlocal control constructs [AM97c, AM97b, AM97a, Lai97]. A noteworthy feature is that the key definability results for the richer languages are proved by a reduction to...
Elementary Proofs of Adequacy
, 1997
"... We give a technique for proving computational adequacy, applied to models of Plotkin's FPC. The proof is elementary, in that it avoids the use of certain abstract notions, namely logical relations. The technique appears to be quite general. We present an arbitrary term using fixedpoints whose ..."
Abstract
 Add to MetaCart
We give a technique for proving computational adequacy, applied to models of Plotkin's FPC. The proof is elementary, in that it avoids the use of certain abstract notions, namely logical relations. The technique appears to be quite general. We present an arbitrary term using fixedpoints whose finite iterates have certain finiteness properties. These finiteness properties give adequacy for some approximations to the term. In models where the fixedpoints are wellbehaved, adequacy extends from the approximations to the original term. 1 Introduction This article gives a technique for proving computational adequacy for denotational models of programming languages. A model of a programming language, with an element ? of the model intended to represent nontermination, is called computationally adequate if, whenever P is a nonterminating program, P is represented in the model by ?. Following [Plo77], such results traditionally have been proven using logical relations. However, for compl...