Type algebras, functor categories and block structure
Algebraic methods in semantics
Towards fully abstract semantics for local variables
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Equality in lazy computation systems
Proceedings of the Fourth Annual Symposium on Logic in computer science
Type systems for programming languages
Handbook of theoretical computer science (vol. B)
A type-theoretical alternative to ISWIM, CUCH, OWHY
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
A variable typed logic of effects
Information and Computation
Parametricity and local variables
Journal of the ACM (JACM)
Proving congruence of bisimulation in functional programming languages
Information and Computation
From operational semantics to domain theory
Information and Computation
Operational reasoning for functions with local state
Higher order operational techniques in semantics
From Algol to polymorphic linear lambda-calculus
Journal of the ACM (JACM)
From Operational to Denotational Semantics
Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics
Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
A Fully Abstract Translation between a Lambda-Calculus with Reference Types and Standard ML
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Behavioral equivalence in the polymorphic pi-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Behavioral equivalence in the polymorphic pi-calculus
Journal of the ACM (JACM)
Soundness of data refinement for a higher-order imperative language
Theoretical Computer Science
A pi-calculus Process Semantics of Concurrent Idealised ALGOL
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Operational Semantics and Program Equivalence
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Observable Sharing for Functional Circuit Description
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Reasoning about Idealized ALGOL Using Regular Languages
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The regular-language semantics of second-order idealized ALGOL
Theoretical Computer Science
Parametric polymorphism and operational equivalence
Mathematical Structures in Computer Science
Slot games: a quantitative model of computation
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimilarity for the Region Calculus
Higher-Order and Symbolic Computation
Ownership confinement ensures representation independence for object-oriented programs
Journal of the ACM (JACM)
A complete, co-inductive syntactic theory of sequential control and state
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Imperative self-adjusting computation
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compositional Predicate Abstraction from Game Semantics
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
A complete, co-inductive syntactic theory of sequential control and state
Semantics and algebraic specification
The impact of higher-order state and control effects on local relational reasoning
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Assertion-based encapsulation, object invariants and simulations
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Relational reasoning in a nominal semantics for storage
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Hi-index | 0.01 |
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.