Prelogical relations

Information and Computation

Volumn 178, Issue 1, 2002, Pages 23-43

  Honsell, Furio ^a   Sannella, Donald ^b  

^a UNIVERSITY OF UDINE   (Italy)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Data refinement; Logical relations; Representation independence; Semantics; Typed lambda calculus

Indexed keywords

ALGEBRA; DIFFERENTIATION (CALCULUS); FUNCTIONS; SEMANTICS; SET THEORY;

DATA REFINEMENT; PRELOGICAL RELATIONS; TYPED LAMBDA CALCULUS;

FORMAL LOGIC;

EID: 0037057839     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(02)93115-9     Document Type: Article

References (34)

1. Abramsky, S. (1990), Abstract interpretation, logical relations, and Kan extensions, J. Logic Comput. 1, 5-40.
2. Alimohamed, M. (1995), A characterization of lambda definability in categorical models of implicit polymorphism, Theoret. Comput. Sci. 146, 5-23.
3. Altenkirch, T. (1998), Logical relations and inductive/coinductive types, in "Proc. Computer Science Logic, CSL '98, Brno," Lecture Notes in Computer Science, Vol. 1584, pp. 343-354, Springer-Verlag, Berlin.
4. Curien, P.-L. (1993), "Categorical Combinators, Sequential Algorithms, and Functional Programming," 2nd ed., Birkhäuser, Basel.
5. Di Gianantonio, P., and Honsell, F. (1993), An abstract notion of application, in "Proc. Intl. Conf. on Typed Lambda Calculi and Applications, Utrecht," Lecture Notes in Computer Science, Vol. 664, pp. 124-138. Springer-Verlag, Berlin.
6. Gandy, R. (1980), Proofs of strong normalization, in "To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism," pp. 457-477, Academic Press, San Diego.
7. Ginzburg, A. (1968), "Algebraic Theory of Automata," Academic Press, San Diego.
8. Honsell, F., Longley, J., Sannela, D., and Tarlecki, A. (2000), Constructive data refinement in typed lambda calculus, in "Proc. 2nd Intl. Conf. on Foundations of Software Science and Computation Structures, European Joint Conferences on Theory and Practice of Software (ETAPS'2000), Berlin," Lecture Notes in Computer Science, Vol. 1784, pp. 149-164, Springer-Verlag, Berlin.
9. Honsell, F., and Sannella, D. (1999), Pre-logical relations, in "Proc. Computer Science Logic, CSL'99, Madrid," Lecture Notes in Computer Science, Vol. 1683, pp. 546-561, Springer-Verlag, Berlin.
10. Jung, A., and Tiuryn, J. (1993), A new characterization of lambda definability, in "Proc. Intl. Conf. on Typed Lambda Calculi and Applications, Utrecht," Lecture Notes in Computer Science, Vol. 664, pp. 245-257, Springer-Verlag, Berlin.
11. Kinoshita, Y., O'Hearn, P., Power, J., Takeyama, M., and Tennent, R. (1997), An axiomatic approach to binary logical relations with applications to data refinement, in "Proc. TACS'97," Lecture Notes in Computer Science, Vol. 1281, pp. 191-212, Springer-Verlag, Berlin.
12. Loader, R. (2001), The undecidability of λ-definability, in "Logic, Meaning and Computation: Essays in Memory of Alonzo Church," Kluwer Academic, Dordrecht/Norwell, MA.
13. Longley, J. (1999), Matching typed and untyped realizability, in "Proc. Tutorial Workshop on Realizability Semantics and Applications, Trento," Electronic Notes in Theor. Comput. Sci. 23(1).
14. Ma, Q., and Reynolds, J. (1992), Types, abstraction, and parametric polymorphism, part 2, in "Proc. 7th Intl. Conf. on Mathematical Foundations of Programming Semantics, Pittsburgh," Lecture Notes in Computer Science, Vol. 598, pp. 1-40, Springer-Verlag, Berlin.
15. Marz, M., Rohr, A., and Streicher, T. (1999), Full abstraction and universality via realisability, in "Proc. 14th IEEE Symp. on Logic in Computer Science, Trento."
16. Milner, R. (1971), An algebraic definition of simulation between programs, in "Proc. 2nd Intl. Joint Conf. on Artificial Intelligence," pp. 481-489, British Computer Society.
17. Mitchell, J. (1990), Type systems for programming languages, in "Handbook of Theoretical Computer Science," Vol. B, Chap. 8, Elsevier, Amsterdam.
18. Mitchell, J. (1991), On the equivalence of data representations, in "Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy" (V. Lifschitz, Ed.), pp. 305-330, Academic Press, San Diego.
19. Mitchell, J. (1996), "Foundations for Programming Languages," MIT Press, Cambridge, MA.
20. Mitchell, J., and Meyer, A. (1985), Second-order logical relations, in "Proc. of the Conf. on Logic of Programs, Brooklyn," Lecture Notes in Computer Science, Vol. 193, pp. 225-236, Springer-Verlag, Berlin.
21. Mitchell, J., and Moggi, E. (1991), Kripke-style models for typed lambda calculus, Ann. Pure Appl. Logic 51, 99-124.
22. O'Hearn, P., and Riecke, J. (1995), Kripke logical relations and PCF, Inform. and Comput. 120, 107-116.
23. Plotkin, G. (1980), Lambda-definability in the full type hierarchy, in "To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism," pp. 363-373, Academic Press, San Diego.
24. Plotkin, G., Power, J., Sannella, D., and Tennent, R. (2000), Lax logical relations, in "Proc. 27th Intl. Colloq. on Automata, Languages and Programming, Geneva," Lecture Notes in Computer Science, Vol. 1853, pp. 85-102, Springer-Verlag, Berlin.
25. Power, J., and Robinson, E. (2000), Logical relations and data abstraction, in "Proc. Computer Science Logic, CSL 2000, Fischbachau," Lecture Notes in Computer Science, Vol. 1862, Springer-Verlag, Berlin.
26. Power, J., and Robinson, E. (2000), Logical relations, data abstraction and structured fibrations, in "Proc. 2nd Intl. ACM SIGPLAN Conf. on Principles and Practice of Declarative Programming, Montreal."
27. Riecke, J., and Sandholm, A. (1997), A relational account of call-by-value sequentiality, in "Proc. 12th IEEE Symp. on Logic in Computer Science, Warsaw," pp. 258-267. Inform. and Comput., to appear.
28. Robinson, E. (1996), "Logical relations and Data Abstraction," Report 730, Queen Mary and Westfield College.
29. Sannella, D., and Tarlecki, A. (1987), On observational equivalence and algebraic specifications, J. Comput. System Sci. 34, 150-178.
30. Sannella, D., and Tarlecki, A. (1988), Toward formal development of programs from algebraic specifications: Implementations revisited, Acta Inform. 25, 233-281.
31. Schoett, O. (1987), "Data Abstraction and the Correctness of Modular Programming," Ph.D. thesis CST-42-87, Univ. of Edinburgh.
32. Statman, R. (1983), λ-definable functionals and βη conversion, Arch. Math. Logik 23, 21-26.
33. Statman, R. (1985), Logical relations and the typed lambda calculus, Inform. and Control 65, 85-97.
34. Tennent, R. (1994), Correctness of data representations in Algol-like languages, in "A Classical Mind: Essays in Honour of C.A.R. Hoare," Prentice Hall, New York.