Abstract
We study a weakening of the notion of logical relations, called pre-logical relations, that has many of the features that make logical relations so useful as well as 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 pairs of functions that are expressible by the same lambda term. 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 refi- nement where the fact that pre-logical relations compose explains why stepwise refinement is sound.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Abramsky. Abstract interpretation, logical relations, and Kan extensions. Journal of Logic and Computation 1:5–40 (1990).
R. Gandy. Proofs of strong normalization. In: To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, 457–477. Academic Press (1980).
A. Jung and J. Tiuryn. A new characterization of lambda definability. Proc. TLCA’93. Springer LNCS 664, 245–257 (1993).
Y. Kinoshita, P. O’Hearn, J. Power, M. Takeyama and R. Tennent. An axiomatic approach to binary logical relations with applications to data refinement. Proc. TACS’97, Springer LNCS 1281, 191–212 (1997).
J. Mitchell. Type Systems for Programming Languages. Chapter 8 of Handbook of Theoretical Computer Science, Vol B. Elsevier (1990).
J. Mitchell. Foundations for Programming Languages. MIT Press (1996).
J. Mitchell and E. Moggi. Kripke-style models for typed lambda calculus. Annals of Pure And Applied Logic 51:99–124 (1991).
G. Plotkin. Lambda-definability in the full type hierarchy. In: To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, 363–373. Academic Press (1980).
G. Plotkin, J. Power and D. Sannella. A compositional generalisation of logical relations. Draft report, http://www.dcs.ed.ac.uk/home/dts/pub/laxlogrel.ps (1998).
E. Robinson. Logical relations and data abstraction. Report 730, Queen Mary and Westfield College (1996).
D. Sannella and A. Tarlecki. Toward formal development of programs from algebraic specifications: implementations revisited. Acta Informatica 25:233–281 (1988).
O. Schoett. Data Abstraction and the Correctness of Modular Programming. Ph.D. thesis CST-42-87, Univ. of Edinburgh (1987).
R. Statman. Logical relations and the typed lambda calculus. Information and Control 65:85–97 (1985).
R. Tennent. Correctness of data representations in Algol-like languages. In: AClassic al Mind: Essays in Honour of C.A.R. Hoare. Prentice Hall (1994).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Honsell, F., Sannella, D. (1999). Pre-logical Relations. In: Flum, J., Rodriguez-Artalejo, M. (eds) Computer Science Logic. CSL 1999. Lecture Notes in Computer Science, vol 1683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48168-0_38
Download citation
DOI: https://doi.org/10.1007/3-540-48168-0_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66536-6
Online ISBN: 978-3-540-48168-3
eBook Packages: Springer Book Archive