Logical relations, data abstraction, and structured fibrations

Proceedings of the 2nd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn , Issue , 2000, Pages 15-23

  Power, John ^a   Robinson, Edmund ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Cartesian closed fibrations; Interpretations; Linear calculus; Logical relations; calculus

Indexed keywords

DATA REDUCTION; FORMAL LOGIC; SEMANTICS; SET THEORY;

DATA ABSTRACTION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0034592799     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/351268.351271     Document Type: Conference Paper

References (18)

1. A. Alimohamed. A characterisation of lambda definability in categorical models of implicit polymorphism. Theoretical Computer Science, 146:5-23, 1995.
2. M. Fiore and G. Plotkin. An axiomatisation of computationally adequate domain-theoretic models of f pc. In Proc LICS 94, pages 92-102, 1994.
3. C. Hermida. Fibrations, Logical Predicates and Indeterminates. PhD thesis, University of Edinburgh, 1993.
4. F. Honsell and D. Sannella. Pre-logical relations. In Proc CSL 99, LNCS 1683, pages 546-562, 1999.
5. A. Jung and J. Tiuryn. A new characterisation of lambda definability. In Proc. TLCA 93, LNCS 664, pages 245-257, 1993.
6. Y. Kinoshita, P. O'Hearn, A. Power, M. Takeyama, and R. Tennent. An axiomatic approach to binary logical relations with applications to data refinement. In Proc TACS 97, LNCS 1281, pages 191-212, 1997.
7. F. Lawvere. Equality in hyperdoctrines and the comprehension schema as an adjoint functor. In Proc New York Symposium on Applications of Categorical Algebra, pages 1-14, 1970.
8. Q. Ma and J. Reynolds. Types, abstraction and parametric polymorphism 2. In Proc MFPS 91, LNCS 598, pages 1-40, 1991.
9. R. Milner. Fully abstract models of typed lambda-calculus. Theoretical Computer Science, 4:1-20, 1977.
10. J. Mitchell. Type systems for programming languages. In Handbook of Theoretical Computer ScienCe B, pages 365-458. North-Holland, 1990.
11. J. Mitchell. Foundations for programming languages. Foundations of Computing Series. MIT Press, 1996.
12. E. Moggi. Computational lambda-calculus and monads. In Proc LICS 89, pages 14-23, 1989.
13. G. Plotkin, A. Power, D. Sannella, and R. Tennent. Lax logical relations. In Proc ICALP 2000, to appear.
14. A. Power. Premonoidal categories as categories with algebraic structure. Theoretical Computer Science, to appear.
15. A. Power and E. Robinson. Premonoidal categories and notions of computation. Math. Structures in Computer Science, 7:453-468, 1997.
16. A. Power and E. Robinson. Logical relations and data abstraction. In Proc CSL 2000, to appear.
17. J. Reynolds. Types, abstraction, and parametric polymorphism, nformation Processing, 83:513-523, 1983.
18. R. Tennent. Correctness of data representations in algol-like languages. A Classical Mind, Essays in Honour of C.A.R. Hoare, pages 405-417, 1994.