Relational Parametricity for Control Considered as a Computational Effect

Electronic Notes in Theoretical Computer Science

Volumn 173, Issue SPEC. ISS., 2007, Pages 295-312

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

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Computational effects; control; denotational semantics; parametric polymorphism

Indexed keywords

COMPUTATIONAL EFFECTS; DENOTATIONAL SEMANTICS; PARAMETRIC POLYMORPHISM;

COMPUTATION THEORY; COMPUTATIONAL METHODS; DIFFERENTIATION (CALCULUS); MATHEMATICAL MODELS;

PARAMETERIZATION;

EID: 33847675878     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.02.040     Document Type: Article

References (25)

1. Bainbridge E.S., Freyd P.J., Scedrov A., and Scott P.J. Functorial polymorphism. Theoretical Computer Science 70 (1990) 35-64
2. G.M. Bierman, A.M. Pitts, and C.V. Russo. Operational properties of Lily, a polymorphic linear lambda calculus with recursion. In Fourth International Workshop on Higher Order Operational Techniques in Semantics, Montréal, volume 41 of Electronic Notes in Theoretical Computer Science. Elsevier, September 2000
3. Birkedal L., and Møgelberg R.E. Categorical models of Abadi-Plotkin's logic for parametricity. Mathematical Structures in Computer Science 15 4 (2005) 709-772
4. Birkedal L., Møgelberg R.E., and Petersen R.L. Linear Abadi & Plotkin logic. Logical Methods in Computer Science 2 (2006)
5. Gruenhage G., and Streicher T. Quotients of countably based spaces are not closed under sobrification. Math. Struct. in Comp. Sci. 16 (2006) 223-229
6. M. Hasegawa. Relational parametricity and control. In Proceedings Twentieth Annual LiCS Symposium, pages 72-81, 2005
7. Hasegawa M. Relational parametricity and control. Logical Methods in Computer Science 2 (2006)
8. Hasegawa R. Parametricity of extensionally collapsed term models of polymorphism and their categorical properties. In: Ito T., and Meyer A.R. (Eds). Proceedings of Theoretical Aspects of Computer Software. (TACS '91). LNCS volume 526 (September 1991), Springer 495-512
9. Hyland J.M.E. A small complete category. Annals of Pure and Applied Logic 40 2 (November 1988) 135-165
10. Hyland J.M.E. First steps in synthetic domain theory. In: Carboni A., Pedicchio M.C., and Rosolini G. (Eds). Proceedings of the 1990 Como Category Theory Conference. Lecture Notes in Mathematics volume 1488 (1991), Springer, Berlin 131-156
11. Hyland J.M.E., Robinson E.P., and Rosolini G. The discrete objects in the effective topos. Proc. London Math. Soc. 3 60 (1990) 1-36
12. Katsumata S. A Semantic Formulation of ⊤⊤-lifting and Logical Predicates for Computational Metalanguage. Proc. CSL 2005. LNCS 3634 (2005) 87-102
13. Levy P. Call By Push Value, a Functional/Imperative Synthesis (December 2003), Kluwer
14. R.E. Møgelberg and A.K. Simpson. Relational parametricity for computational effects. Submited manuscript, 2007
15. Moggi E. Notions of computation and monads. Information and Computation 93 (1991) 55-92
16. Parigot M. Proofs of strong normalisation for second order classical natural deduction. Journal of Symbolic Logic 62 4 (1997) 1461-1479
17. Pitts A.M. Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science 10 (2000) 321-359
18. G.D. Plotkin. Type theory and recursion (extended abstract). In Proceedings, Eighth Annual IEEE Symposium on Logic in Computer Science, page 374, Montreal, Canada, 19-23 June 1993. IEEE Computer Society Press
19. Reynolds J.C. Types, abstraction, and parametric polymorphism. Information Processing 83 (1983) 513-523
20. Reynolds J.C. Polymorphism is not set-theoretic. In: Kahn G., MacQueen D.B., and Plotkin G.D. (Eds). Semantics of Data Types. Lecture Notes in Computer Science volume 173 (1984), Springer-Verlag 145-156
21. Selinger P. Control categories and duality: On the categorical semantics of the lambda-mu calculus. Mathematical Structures in Computer Science 11 2 (2001) 207-260
22. Streicher T., and Reus B. Classical logic, continuation semantics and abstract machines. Journal of Functional Programming 8 6 (1998) 543-572
23. Taylor P. The fixed point property in synthetic domain theory. 6th Annual Symposium on Logic in Computer Science (1991), IEEE Computer Society Press, Washington 152-160
24. Taylor P. Sober spaces and continuations. Theory and Applications of Categories 10 12 (2002) 248-300
25. H. Thielecke. Categorical Structure of Continuation Passing Style. Phd thesis, Laboratory for Foundations of Computer Science, Univ. of Edinburgh, 1997