by Furio Honsell, Donald Sannella
Proc. Computer Science Logic, CSL'99
http://www.dcs.ed.ac.uk/home/dts/pub/prelogrel.ps
Add To MetaCart
Abstract:
Abstract. We study a weakening of the notion of logical relations, called prelogical relations, that has many of the features that make logical relations so useful but having further algebraic properties including composability. The basic idea is simply to require the reverse implication in the definition of logical relations to hold only for lambda-expressible functions. Pre-logical relations are the minimal weakening of logical relations that gives composability for extensional structures and simultaneously the most liberal definition that gives the Basic Lemma. The use of pre-logical relations in place of logical relations gives an improved version of Mitchell's representation independence theorem which characterizes observational equivalence for all signatures rather than just for first-order signatures. Pre-logical relations can be used in place of logical relations to give an account of data refinement where the fact that pre-logical relations compose explains why stepwise refinement is sound.
Citations
|
250
|
Foundations for Programming Languages
– Mitchell
- 1996
|
|
150
|
D.—Tarlecki, A.: Toward Formal Development of Programs from Algebraic Specifications: Implementations Revisited
– Sannella
- 1988
|
|
54
|
Data abstraction and the correctness of modular programming
– Schoett
- 1987
|
|
52
|
Lambda Definability in the Full Type Hierarchy
– Plotkin
- 1980
|
|
49
|
Kripke-style models for typed lambda calculus
– Mitchell, Moggi
- 1991
|
|
46
|
Abstract interpretation, logical relations and Kan extensions
– Abramsky
- 1990
|
|
41
|
Behavioral Correctness of Data Representations
– Schoett
- 1990
|
|
35
|
Logical Relations and the Typed Lambda Calculus
– Statman
|
|
28
|
Proofs of strong normalization
– Gandy
- 1980
|
|
26
|
A new characterization of lambda definability
– Jung, Tiuryn
- 1993
|
|
21
|
An axiomatic approach to binary logical relations with applications to data refinement
– Kinoshita, O'Hearn, et al.
- 1997
|
|
16
|
A characterization of lambda definability in categorical models of implicit polymorphism, Theoretical Computer Science 146
– Alimohamed
- 1995
|
|
14
|
Correctness of data representations in Algol-like languages. In: A Classical Mind: Essays
– Tennent
- 1994
|
|
5
|
Type Systems for Programming Languages. Chapter 8
– Mitchell
- 1990
|
|
5
|
Logical relations and data abstraction
– Robinson
- 1996
|
|
2
|
The undecidability of #-definability, Church Memorial Volume
– Loader
|
|
2
|
Proofs of strong normalization. In: To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, 457--477
– Gandy
- 1980
|
|
1
|
A compositional generalisation of logical relations. Draft report, http://www.dcs.ed.ac.uk/home/dts/pub/laxlogrel.ps
– Plotkin, Power, et al.
- 1998
|
|
1
|
KOPTT97
– LNCS
- 1993
|
|
1
|
The undecidability of -definability. Church Memorial volume
– TACS'97
- 1997
|
|
1
|
The undecidability of λ-definability. Church Memorial volume
– Loader
|
