Abstract
A new treatment of data refinement in typed lambda calculus is proposed, phrased in terms of pre-logical relations [HS99] rather than logical relations, and incorporating a constructive element. Constructive data refinement is shown to have desirable properties, and a substantial example of refinement is presented.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF. To appear in Information and Computation (1996).
T. Altenkirch. Logical relations and inductive/coinductive types. Proc. Computer Science Logic, CSL’98. Springer LNCS 1584, 343–354 (1998).
M. Beeson. Foundations of Constructive Mathematics. Springer (1985).
J. Goguen. Parameterized programming. IEEE Trans. on Software Engineering SE-10(5):528–543 (1984).
J. Hannay. Specification refinement with System F. Proc. Computer Science Logic, CSL’99, Madrid. Springer LNCS 1683, 530–545 (1999).
C.A.R. Hoare. Correctness of data representations. Acta Informatica 1:271–281 (1972).
F. Honsell and D. Sannella. Pre-logical relations. Proc. Computer Science Logic, CSL’99, Madrid. Springer LNCS 1683, 546–561 (1999).
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).
R. Milner. An algebraic definition of simulation between programs. Proc. 2nd Intl. Joint Conf. on Artificial Intelligence. British Computer Society, 481–489 (1971).
J. Mitchell. Foundations for Programming Languages. MIT Press (1996).
J. Mitchell and A. Meyer. Second-order logical relations. Proc. Logics of Programs, Brooklyn. Springer LNCS 193, 225–236 (1997).
D. Normann. The continuous functionals of finite types over the reals. Technical Report 19, Dept. of Mathematics, University of Oslo (1998).
G. Plotkin. LCF considered as a programming language. Theoretical Computer Science 5:223–255 (1977).
G. Plotkin, J. Power, D. Sannella and R. Tennent. Lax logical relations. Submitted for publication (2000).
D. Plume. A calculator for exact real number computation. B.Sc. project report, Univ. of Edinburgh; available from ftp://ftp.tardis.ed.ac.uk/users/dbp/report.ps.gz (1998).
J. Reynolds. The Craft of Programming. Prentice Hall (1981).
J. Reynolds. Types, abstraction and parametric polymorphism. Proc. 9th IFIP World Computer Congress, Paris. North Holland, 513–523 (1983).
D. Sannella, S. Soko lowski and A. Tarlecki. Toward formal development of programs from algebraic specifications: parameterisation revisited. Acta Informatica 29:689–736 (1992).
D. Sannella and A. Tarlecki. Toward formal development of programs from algebraic specifications: implementations revisited. Acta Informatica 25:233–281 (1988).
D. Sannella and A. Tarlecki. Essential concepts of algebraic specification and program development. Formal Aspects of Computing 9:229–269 (1997).
O. Schoett. Data Abstraction and the Correctness of Modular Programming. Ph.D. thesis, report CST-42-87, Dept. of Computer Science, Univ. of Edinburgh (1987).
O. Schoett. Behavioural correctness of data representations. Science of Computer Programming 14:43–57 (1990).
A.K. Simpson. Lazy functional algorithms for exact real functionals. Proc. 23rd Intl. Symp. on Mathematical Foundations of Computer Science, Brno. Springer LNCS 1450, 456–464 (1998).
R. Tennent. Correctness of data representations in Algol-like languages. In: A Classical 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
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Honsell, F., Longley, J., Sannella, D., Tarlecki, A. (2000). Constructive Data Refinement in Typed Lambda Calculus. In: Tiuryn, J. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2000. Lecture Notes in Computer Science, vol 1784. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46432-8_11
Download citation
DOI: https://doi.org/10.1007/3-540-46432-8_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67257-9
Online ISBN: 978-3-540-46432-7
eBook Packages: Springer Book Archive