Logical relations for dynamically-allocated storage cells
Abstract: Languages such as ML or Lisp permit the use of recursively defined function expressions with locally declared storage locations. Although this can be very convenient from a programming point of view it severely complicates the properties of program equivalence even for relatively simple fragments of such languages - such as the simply typed fragment of Standard ML with integer-valued references considered here. This paper presents a method for reasoning about contextual equivalence of programs... (Update)
Cited by: More
Local Variable Scoping and - Kleene Algebra With
(Correct)
Relational Semantics for Higher-Order - Functional Programs Kamal
(Correct)
Relational Semantics of Local Variable Scoping - Kamal Aboul-Hosn Kamal
(Correct)
Similar documents (at the sentence level):
61.1%: Operational Reasoning for - Functions With Local
(Correct)
Active bibliography (related documents): More All
0.6: Reasoning about Local Variables with Operationally-Based Logical.. - Pitts (1996)
(Correct)
0.4: Compilation and Equivalence of Imperative Objects - Gordon, Hankin, Lassen (1997)
(Correct)
0.3: Operational Versus Denotational Methods in the Semantics of Higher .. - Pitts (1998)
(Correct)
Similar documents based on text: More All
0.3: Operational Semantics and Program Equivalence - Pitts (2000)
(Correct)
0.1: Observable Properties of Higher Order Functions - That Dynamically Create
(Correct)
0.0: Towards a Theory of Bisimulation for Local Names - Jeffrey, Rathke (1999)
(Correct)
Related documents from co-citation: More All
17: Observable properties of higher order functions that dynamically create local na..
- Pitts, Stark - 1993
13: Bisimilarity as a theory of functional programming (context) - Gordon - 1995
11: Operationally-based theories of program equivalence
- Pitts - 1995
BibTeX entry: (Update)
A. M. Pitts and I. D. B. Stark. Operational reasoning for functions with local state. In A. D. Gordon and A. M. Pitts, editors, Higher Order Operational Techniques in Semantics. 1996. To appear. http://citeseer.ist.psu.edu/pitts96operational.html More
@incollection{ pitts/stark:operfl,
author = {Andrew Pitts and Ian Stark},
title = {Operational Reasoning for Functions with Local
State},
booktitle = {Higher Order Operational Techniques in Semantics},
editor = {Andrew Gordon and Andrew Pitts},
year = {1998},
pages = {227--273},
publisher = {Publications of the Newton Institute, Cambridge
University Press},
url = {citeseer.ist.psu.edu/pitts96operational.html},
url = {http://www.ed.ac.uk/~stark/operfl.html} }
Citations (may not include all citations):
1074
The Definition of Standard ML (context) - Milner, Tofte et al. - 1990 ACM
206
Why functional programming matters
- Hughes - 1989 ACM DBLP
147
abstraction and parametric polymorphism (context) - Reynolds - 1983
106
Observable properties of higher order functions that dynamic..
- Pitts, Stark - 1993
76
Control operators (context) - Felleisen, Friedman - 1986
69
Curry: Essays on Combinatory Logic (context) - Seldin, Hindley - 1981
69
Relational properties of domains
- Pitts - 1996 DBLP
65
Equivalence in functional languages with effects
- Mason, Talcott DBLP
53
Lambda-definability in the full type hierarchy (context) - Plotkin - 1980
46
Relational parametricity and local variables (context) - O'Hearn, Tennent - 1993 ACM DBLP
35
Typing first-class continuations in ML
- Harper, Duba et al. - 1993 ACM DBLP
29
Inferring the equivalence of functional programs that mutate..
- Mason, Talcott ACM DBLP
29
A variable typed logic of effects
- Honsell, Mason et al. - 1995 ACM DBLP
28
From operational semantics to domain theory
- Mason, Smith et al. - 1996 ACM DBLP
27
local variables and operational reasoning (context) - Mason, Talcott
23
Parametricity and local variables (context) - O'Hearn, Tennent - 1995 ACM DBLP
18
Relational interpretation of recursive types in an operation..
- Birkedal, Harper - 1997
12
The Semantics of Destructive Lisp (context) - Mason - 1986 ACM
11
Computational adequacy via `mixed' inductive definitions
- Pitts - 1994
9
Reasoning about functions with effects
- Talcott - 1997 ACM
8
Program transformations for configuring components
- Mason, Talcott ACM DBLP
6
Lambda-definability and logical relations (context) - Plotkin - 1973
4
A type-theoretic account of Standard ML 1996 (context) - Harper, Stone - 1996
2
Full abstraction for the second order subset of an ALGOLlike.. (context) - Seiber - 1995
1
ML for the Working Programmer (context) - the, -- - 1991 ACM
1
Idealized Algol and its specification logic (context) - Algorithmic, pp et al. - 1982 ACM
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cl.cam.ac.uk/users/ap/papers/): More
On the Observable Properties of Higher Order Functions that.. - Pitts, Stark (1993)
(Correct)
Existential Types: Logical Relations and Operational Equivalence - Pitts (1998)
(Correct)
Categorical Logic - Pitts (2001)
(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