Relational parametricity for computational effects

Logical Methods in Computer Science

Volumn 5, Issue 3, 2009, Pages

  Møgelberg, Rasmus Ejlers ^a   Simpson, Alex ^b  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Computational effects; Intuitionistic set theory; Monads; Relational parametricity

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COMPUTATIONAL EFFECTS; DATA ABSTRACTION; DATATYPES; MATHEMATICAL FORMULATION; MONADS; RELATIONAL PARAMETRICITY; STANDARD THEORIES; UNIFORM ALGORITHMS;

COMPUTATION THEORY;

EID: 84871009624     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-5(3:7)2009     Document Type: Article

References (41)

1. P. Aczel and M. Rathjen. Notes on Constructive Set Theory. Technical Report 40, Mittag-Leffler Institute, 2001.
2. A. Barber. Linear Type Theories, Semantics and Action Calculi. PhD thesis, University of Edinburgh, 1997.
3. G. Bierman, A. Pitts, and C. Russo. Operational properties of Lily, a polymorphic linear lambda calculus with recursion. ENTCS, 41: 70-88, 2000.
4. L. Birkedal, R. E. Møgelberg, and R. L. Petersen. Linear Abadi & Plotkin logic. Logical Methods in Computer Science, 2, 2006.
5. A. Filinski. Controlling Effects. PhD thesis, School of Computer Science, CMU, 1996.
6. J.-Y. Girard. A new constructive logic: classical logic. Mathematical Structures in Computer Science, 1: 255-296, 1991.
7. J.-Y. Girard. On the unity of logic. Annals of Pure and Applied Logic, 59: 201-217, 1993.
8. J. Goubault-Larrecq, S. Lasota, and D. Nowak. Logical relations for monadic types. Mathematical Structures in Computer Science, 18: 1169-1217, 2008.
9. M. Hasegawa. Relational parametricity and control. Logical Methods in Computer Science, 2, 2006. Special issue for selected papers from LICS 2005.
10. J.M.E. Hyland. A small complete category. Annals of Pure and Applied Logic, 40: 135-165, 1988.
11. J.M.E. Hyland. First steps in synthetic domain theory. Proc. of the 1990 Como Category Theory Conference, pp. 131-156, Springer LNM 1488, 1991.
12. J.M.E. Hyland, E. Robinson, and G. Rosolini. The discrete objects in the effective topos. Proc. LMS., 3(60), 1990.
13. A. Joyal and I. Moerdijk. Algebraic Set Theory. LMS Lecture Note Series 220, CUP, 1995.
14. S. Katsumata. A semantic formulation of ⊤⊤-lifting and logical predicates for computational metalanguage. In Computer Science Logic, Springer LNCS 3634, 2005.
15. P.B. Levy. Call-By-Push-Value. Springer, 2004.
16. P.B. Levy. Adjunction models for call-by-push-value with stacks. Theory and Applications of Categories, 14: 75-110, 2005.
17. S. Mac Lane. Categories for the Working Mathematician. Springer Graduate Texts in Mathematics, 1971.
18. R.E. Møgelberg, L. Birkedal and G. Rosolini. Synthetic domain theory and models of linear Abadi & Plotkin logic. Annals of Pure and Applied Logic, 155: 115-133, 2008.
19. R.E. Møgelberg and A. Simpson. Relational Parametricity for Computational Effects. In Proc. 22nd LICS Symposium, pages 346-355, 2007.
20. R.E. Møgelberg and A. Simpson. Relational Parametricity for Control Considered as a Computational Effect. In Proc. MFPS XXIII, ENTCS 173: 295-312, 2007.
21. R.E. Møgelberg and A. Simpson. A logic for parametric polymorphism with effects. In TYPES, volume 4941 of Lecture Notes in Computer Science, pages 142-156. Springer, 2007.
22. E. Moggi. Computational lambda-calculus and monads. In Proc. 4th LICS Symposium, pages 14-23, 1989.
23. E. Moggi. Notions of computation and monads. Information and Computation, 93(1), 1991.
24. M. Parigot. Strong normalization for second order classical natural deduction. J. Symb. Logic, 62: 1461-1479, 1997.
25. A.M. Pitts. Polymorphism is set theoretic, constructively. In Proc. CTCS, pages 12-39. Springer LNCS 283, 1987.
26. A.M. Pitts. Non-trivial power types can’t be subtypes of polymorphic types. In Proc. 4th LICS Symposium, pages 6-13, 1989.
27. A.M. Pitts. Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science, 10: 321-359, 2000.
28. G. Plotkin. Type theory and recursion (extended abstract). In Proc. 8th LICS Symposium, page 374, 1993.
29. G. Plotkin and M. Abadi. A logic for parametric polymorphism. Proc. TLCA, pp.361-375. Springer LNCS 664, 1993.
30. G. Plotkin and A.J. Power. Algebraic operations and generic effects. Applied Categorical Structures, 11: 69-94, 2003.
31. G. Plotkin and A.J. Power. Computational effects and operations: an overview. ENTCS, 73: 149-163, 2004.
32. J. Reynolds. Types, abstraction and parametric polymorphism. In Inf. Processing, pp.513-523. N. Holland, 1983.
33. J. Reynolds. Polymorphism is not set-theoretic. In Semantics of Data Types. Springer LNCS 173, 1984.
34. E. Robinson. How complete is PER? In Proc. 4th LICS Symposium, pages 106-111, 1989.
35. G. Rosolini and A. Simpson. Using Synthetic Domain Theory to Prove Operational Properties of a Polymorphic Programming Language Based on Strictness. Preprint, 2004.
36. A. Ščedrov. Intuitionistic set theory. In Harvey Friedman’s Research on The Foundations of Mathematics, pages 257-284. Elsevier Science Publishers, 1985.
37. A. Simpson. Computational adequacy in an elementary topos. In Computer Science Logic, Springer LNCS 1585, pp. 232-242, 1999.
38. A. Simpson. Elementary axioms for categories of classes (extended abstract). In Proc. 14th LICS Symposium, pp. 77-85, 1999.
39. A. Simpson. Computational adequacy for recursive types in models of intuitionistic set theory. Annals of Pure and Applied Logic, 130: 207-275, 2004.
40. A. Simpson. Beyond Classical Domain Theory. Tutorial given at MFPS XXIII, New Orleans, 2007.
41. P. Wadler. Theorems for free! In Proc. 4th Int. Conf. on Funct. Prog. Languages and Computer Arch. London, 1989.