Relational parametricity for computational effects

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2007, Pages 346-355

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

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EFFECTS; DATA ABSTRACTION; DATATYPES; MATHEMATICAL FORMULATION; RELATIONAL PARAMETRICITY; REYNOLDS;

COMPUTATION THEORY;

EID: 44649153132     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2007.40     Document Type: Conference Paper

References (26)

1. G. Bierman, A. Pitts, and C. Russo. Operational properties of Lily, a polymorphic linear lambda calculus with recursion. ENTCS, 41:70-88, 2000. (Pubitemid 40700223)
2. L. Birkedal, R. E. Møgelberg, and R. L. Petersen. Linear Abadi & Plotkin logic. Log. Meth. in Comp. Sci., 2, 2006.
3. J.-Y. Girard. On the unity of logic. Annals of Pure and Applied Logic, 59:201-217, 1993.
4. J. Goubault-Larrecq, S. Lasota, and D. Nowak. Logical relations for monadic types. In Computer Science Logic, pages 553-568. Springer LNCS 2571, 2002.
5. M. Hasegawa. Relational parametricity and control. Logical Methods in Computer Science, 2, 2006. Special issue for selected papers from LICS 2005.
6. J.M.E. Hyland. A small complete category. Annals of Pure and Applied Logic, 40:135 - 165, 1988.
7. J.M.E. Hyland, E. Robinson, and G. Rosolini. The discrete objects in the effective topos. Proc. LMS., 3(60), 1990.
8. S. Katsumata. A semantic formulation of TT-lifting and logical predicates for computational metalanguage. In Computer Science Logic, Springer LNCS 3634, 2005.
9. P. Levy. Call-By-Push-Value. Springer, 2004.
10. R.E. Møgelberg and A. Simpson. Relational Parametricity for Control Considered as a Computational Effect. In Proc. MFPSXXIII, ENTCS 173:295-312, 2007. (Pubitemid 46367807)
11. R.E. Møgelberg and A. Simpson. A logic for parametric polymorphism with effects. In preparation, 2007.
12. E. Moggi. Computational lambda-calculus and monads. In LICS'89, Proc. 4th LICS Symposium, pages 14-23, 1989. (Pubitemid 20617510)
13. E. Moggi. Notions of computation and monads. Information and Computation, 93(1), 1991.
14. M. Parigot. Strong normalization for second order classical natural deduction. J. Symb. Logic, 62:1461-1479, 1997.
15. A. Pitts. Polymorphism is set theoretic, constructively. In Proc. CTCS, pages 12-39. Springer LNCS 283, 1987.
16. A. Pitts. Non-trivial power types can't be subtypes of polymorphic types. In Proc. 4th LICS Symp., pages 6-13, 1989. (Pubitemid 20617509)
17. G. Plotkin. Type theory and recursion (extended abstract). In Proc. 8th LICS Symposium, page 374, 1993.
18. G. Plotkin and M. Abadi. A logic for parametric polymorphism. Proc. TLCA, pp.361-375. Springer LNCS 664, 1993.
19. G. Plotkin and A.J. Power. Algebraic operations and generic effects. Applied categorical Structures, 11:69-94, 2003.
20. G. Plotkin and A.J. Power. Computational effects and operations: an overview. ENTCS, 73:149-163, 2004. (Pubitemid 40702149)
21. J. Reynolds. Types, abstraction and parametric polymorphism. In Inf. Processing, pp.513-523. N. Holland, 1983.
22. J. Reynolds. Polymorphism is not set-theoretic. In Semantics of Data Types. Springer LNCS 173, 1984.
23. E. Robinson. How complete is PER? In Proc. 4th LICS Symposium, pages 106-111, 1989. (Pubitemid 20617519)
24. G. Rosolini and A. Simpson. Using Synthetic Domain Theory to Prove Operational Properties of a Polymorphic Programming Language Based on Strictness. Preprint, 2004.
25. A. Sčedrov. Intuitionistic set theory. In Harvey Friedman's Research on The Foundations of Mathematics, pages 257-284. Elsevier Science Publishers, 1985.
26. P. Wadler. Theorems for free! In Proc. 4th Int. Conf. on Funct. Prog. Languages and Computer Arch. London, 1989.