Andrew M. Pitts  Home/Search
Context Related
| www3.oup.co.uk/igpl/Volu...pitts.pdf.gz www3.oup.co.uk/igpl/Volum...pitts.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: www3.oup.co.uk/igpl/Vol...#jipsen (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This note gives a new proof of the `operational extensionality' property of Abramsky's lazy lambda calculus---namely the coincidence of contextual equivalence with a co-inductively defined notion of `applicative bisimilarity'. This purely syntactic result is here proved using a logical relation (due to Plotkin) between the syntax and its denotational semantics. The proof exploits a mixed inductive/coinductive characterisation of the logical relation recently discovered by the author. 1... (Update)
Similar documents based on text: More All
0.4: Operational Semantics and Program Equivalence - Pitts (2000) (Correct)
0.3: A Note on Logical Relations Between Semantics and Syntax - Pitts (Correct)
0.2: Operationally-Based Theories of Program Equivalence - Pitts (1995) (Correct)
BibTeX entry: (Update)
A.M.Pitts, A Note on Logical Relations Between Semantics and Syntax, to appear in WoLLIC'96 Proc., J. of the Interest Group in Pure and Applied Logics. http://citeseer.ist.psu.edu/327520.html More
@misc{ pitts-note,
author = "A. Pitts",
title = "A Note on Logical Relations Between Semantics and Syntax",
text = "A.M.Pitts, A Note on Logical Relations Between Semantics and Syntax, to
appear in WoLLIC'96 Proc., J. of the Interest Group in Pure and Applied
Logics.",
url = "citeseer.ist.psu.edu/327520.html" }
Citations (may not include all citations):306 LCF considered as a programming language (context) - Plotkin - 1977
130 Full abstraction in the lazy lambda calculus (context) - Abramsky, Ong - 1993
112 Bisimilarity as a theory of functional programming (context) - Gordon - 1995
75 Annals of Pure and Applied Logic (context) - Abramsky - 1991
75 Proving congruence of bisimulation in functional programming.. - Howe - 1996
72 Fully abstract models of typed lambda-calculi (context) - Milner - 1977
69 Relational properties of domains - Pitts - 1996
68 On full abstraction for PCF (context) - Hyland - 1996
48 Operationally-based theories of program equivalence - Pitts - 1997
31 Games and full abstraction for FPC - McCusker - 1996
30 Distinguished Dissertations in Computer Science (context) - Gordon - 1994
19 Notes for a course given at the Center for the Study of Lang.. (context) - Plotkin - 1985
12 An axiomatization of computationally adequate domain theoret.. (context) - Fiore, Plotkin - 1994
1 Games and full abstraction for the lazy #-calculus (context) - Abramsky, McCusker - 1995
1 CONCLUSION 601 a case study (context) - Egidi, Honsell et al. - 1992
[Article contains additional citations not shown here]
Documents on the same site (http://www3.oup.co.uk/igpl/Volume_05/Issue_04/#jipsen): More
Some Semantical Aspects of Linear Logic - Blass (1997) (Correct)
Relation Algebras from Cylindric and Polyadic Algebras - Németi, Simon (1997) (Correct)
Logic Journal - Of The Editor-In-Chief (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC