Abstract

A parametric logical relation between the phrases of an Algol-like language is presented. Its definition involves the structural operational semantics of the language, but was inspired by recent denotationally-based work of O’Hearn and Reynolds on translating Algol into a predicatively polymorphic linear lambda calculus. The logical relation yields an applicative characterisation of contextual equivalence for the language and provides a useful (and complete) method for proving equivalences. Its utility is illustrated by giving simple and direct proofs of some contextual equivalences, including an interesting equivalence due to O’Hearn which hinges upon the undefinability of ‘snapback ’ operations (and which goes beyond the standard suite of ‘Meyer-Sieber ’ examples). Whilst some of the mathematical intricacies of denotational semantics are avoided, the hard work in this operational approach lies in establishing the ‘fundamental property’ for the logical relation—the proof of which makes use of a compactness property of fixpoint recursion with respect to evaluation of phrases. But once this property has been established, the logical relation provides a verification method with an attractively low mathematical overhead. 1.

Citations

155	The essence of Algol - Reynolds - 1981
134	Type Systems for Programming Language - Mitchell - 1990
106	Observable properties of higher order functions that dynamically create local names, or what’s new - Pitts, Stark - 1993
104	Fully Abstract Models of Typed Lambda Calculi, Th - Milner - 1977
102	Proving congruence of bisimulation in functional programming languages - Howe - 1996
102	R.D.: Parametricity and local variables - O’Hearn, Tennent - 1995
101	I.D.B.: Operational reasoning for functions with local state - Pitts, Stark - 1998
96	Towards fully abstract semantics for local variables - Meyer, Sieber - 1988
92	Equality in lazy computation systems - Howe - 1989
73	Operationally-based theories of program equivalence - Pitts - 1997
53	J.C.: From Algol to polymorphic linear lambda-calculus - O’Hearn, Reynolds - 2000
50	Names and Higher-Order Functions - Stark - 1994
45	A variable typed logic of effects - Honsell, Mason, et al. - 1993
43	A type-theoretical alternative to ISWIM - Scott - 1993
42	Type algebras, functor categories and block structure - Oles - 1985
32	Global state considered unnecessary: An introduction to object-based semantics - Reddy - 1996
17	From operational to denotational semantics - Smith - 1992
15	A fully abstract translation between a -calculus with reference types and Standard ML - Ritter, Pitts - 1995
3	From Operational Semantics to Domain Theory. Information and Computation - Mason, Smith, et al. - 1995
2	Full abstraction for the second order subset of an ALGOL-like language - Seiber - 1995
1	Objects, Interference and the Yoneda Embedding, volume 1 - O'Hearn, Reddy - 1995
1	Relational properties of domains. Information and Computation. To appear. A preliminary version appeared as - Pitts - 1993
1	A type-theoretical alternative to ISWIM,CUCH - Scott - 1993
1	Full abstraction via logical relations - Sieber - 1995