Relational parametricity and control

Logical Methods in Computer Science

Volumn 2, Issue 3, 2006, Pages

  Hasegawa, Masahito ^a,b  

^a KYOTO UNIVERSITY   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

Continuations; Parametricity; Polymorphism

Indexed keywords

DIFFERENTIATION (CALCULUS); POLYMORPHISM;

CONTINUATION-PASSING STYLE; CONTINUATIONS; EQUATIONAL THEORY; LAMBDA CALCULUS; LAMBDA-MU CALCULUS; PARAMETRICITY; RELATIONAL PARAMETRICITY; SECOND ORDERS;

CALCULATIONS;

EID: 38149123958     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-2(3:3)2006     Document Type: Article

References (44)

1. M. Abadi, L. Cardelli, and P.-L. Curien. Formal parametric polymorphism. Theoret. Comput. Sci. 121:9-58, 1993.
2. Z.M. Ariola and H. Herbelin. Minimal classical logic and control operators. In Proc. Automata, Languages and Programming, Springer Lecture Notes in Comput. Sci. 2719, pp.871-885, 2003.
3. G. Barthe and T. Uustalu. CPS translating inductive and coinductive types. In Proc. Partial Evaluation and Semantics-Based Program Manipulation, pp.131-142, 2002.
4. G.M. Bierman, A.M. Pitts, and C.V. Russo. Operational properties of Lily, a polymorphic linear lambda calculus with recursion. In Proc. Higher Order Operational Techniques in Semantics, Electronic Notes in Theoretical Computer Science 41, 2000.
5. B.P. Dunphy. Parametricity as a Notion of Uniformity in Reflexive Graphs. PhD thesis, University of Illinois, 2002.
6. A. Filinski. Declarative continuations: an investigation of duality in programming language semantics. In Proc. Category Theory and Computer Science, Springer Lecture Notes in Comput. Sci. 389, pp.224-249, 1989.
7. K. Fujita. Galois embedding from polymorphic types into existential types. In Proc. Typed Lambda Calculi and Applications, Springer Lecture Notes in Comput. Sci. 3461, pp.194-208, 2005.
8. C. Führmann. Varieties of effects. In Proc. Foundations of Software Science and Computation Structures, Springer Lecture Notes in Comput. Sci. 2303, pp.144-159, 2002.
9. J.-Y. Girard. Interprétation fonctionnelle et élimination des coupures de l’arithmétique d’ordre supérieur. Thèse d’Etat, Université Paris VII, 1972.
10. J.-Y. Girard. Linear logic. Theoret. Comp. Sci. 50:1-102, 1987.
11. B. Harper, B.F. Duba and D. MacQueen. Typing first-class continuations in ML. J. Funct. Programming 3(4):465-484.
12. M. Hasegawa. Semantics of linear continuation-passing in call-by-name. In Proc. Functional and Logic Programming, Springer Lecture Notes in Comput. Sci. 2998, pp.229-243, 2004.
13. M. Hasegawa, Relational parametricity and control (extended abstract). In Proc. Logic in Computer Science, pp.72-81, 2005.
14. M. Hasegawa and Y. Kakutani. Axioms for recursion in call-by-value. Higher-Order and Symbolic Comput. 15(2/3):235-264, 2002.
15. R. Hasegawa. Categorical data types in parametric polymorphism. Math. Struct. Comp. Sci. 4(1):71-109, 1994.
16. M. Hofmann and T. Streicher. Completeness of continuation models for λμ-calculus. Inf. Comput. 179(2):332-355, 2002.
17. B. Jacobs. Categorical Logic and Type Theory. Elsevier, 1999.
18. Y. Kakutani. Duality between call-by-name recursion and call-by-value iteration. In Proc. Computer Science Logic, Springer Lecture Notes in Comput. Sci. 2471, pp.506-521, 2002.
19. Y. Kakutani and M. Hasegawa. Parameterizations and fixed-point operators on control categories. Fundam. Inform. 65(1/2):153-172, 2005.
20. J. Lambek and P. Scott (1986) Introduction to Higher-order Categorical Logic. Cambridge University Press.
21. R. Matthes. Parigot’s second order λμ-calculus and inductive types. In Proc. Typed Lambda Calculi and Applications, Springer Lecture Notes in Comput. Sci. 2044, pp.329-343, 2001.
22. E. Moggi. Notions of computation and monads. Inf. Comput. 93(1):55-92, 1991.
23. K. Nakazawa and M. Tatsuta. Strong normalization proof with CPS-translation for second order classical natural deduction. J. Symb. Log. 68(3):851-859, 2003. Corrigendum: J. Symb. Log. 68(4):1415-1416, 2003.
24. C.-H.L. Ong. A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations (preliminary extended abstract). In Proc. Logic in Computer Science, pp.230-241, 1996.
25. C.-H.L. Ong and C.A. Stewart. A Curry-Howard foundation for functional computation with control. In Proc. Principles of Programming Languages, pp.215-227, 1997.
26. M. Parigot. λμ-calculus: an algorithmic interpretation of classical natural deduction. In Proc. Logic Programming and Automated Reasoning, Springer Lecture Notes in Comput. Sci. 624, pp.190-201, 1992.
27. M. Parigot. Proofs of strong normalisation for second order classical natural deduction. J. Symb. Log. 62(4):1461-1479, 1997.
28. A. Pitts, Parametric polymorphism and operational equivalence. Math. Struct. Comp. Sci. 10:321-359, 2000.
29. G.D. Plotkin. Call-by-name, call-by-value, and the λ-calculus. Theoret. Comput. Sci. 1(1):125-159, 1975.
30. G.D. Plotkin. Type theory and recursion (extended abstract). In Proc. Logic in Computer Science, pp.374, 1993.
31. G.D. Plotkin and M. Abadi. A logic for parametric polymorphism. In Proc. Typed Lambda Calculi and Applications, Springer Lecture Notes in Comput. Sci. 664, pp.361-375, 1993.
32. A.J. Power and E. Robinson. Premonoidal categories and notions of computation. Math. Struct. Comp. Sci. 7(5):453-468, 1997.
33. J.C. Reynolds. Towards a theory of type structure. In Proc. Colloque sur la Programmation, Springer Lecture Notes in Comput. Sci. 19, pp.408-425, 1974.
34. J.C. Reynolds. Types, abstraction and parametric polymorphism. In Proc. IFIP 9th World Computer Congress, Information Processing 83, pp.513-523, 1983.
35. A. Sabry. Note on axiomatizing the semantics of control operators. Tech. Rep. CIS-TR-96-03, University of Oregon, 1996.
36. P. Selinger. Control categories and duality: on the categorical semantics of the lambda-mu calculus. Math. Struct. Comp. Sci. 11(2):207-260, 2001.
37. P. Selinger. Some remarks on control categories. Manuscript, 2003.
38. A. Simpson. Relational parametricity for computational effects. Manuscript, 2006.
39. T. Streicher and B. Reus. Classical logic, continuation semantics and abstract machines. J. Funct. Program. 8(6):543-572, 1998.
40. I. Takeuti. An axiomatic system of parametricity. Fundam. Inform. 33(4):397-432, 1998.
41. P. Taylor. Sober spaces and continuations. Theory and Applications of Categories 10(12):248-300, 2002.
42. H. Thielecke. Categorical Structure of Continuation Passing Style. PhD thesis, University of Edinburgh, 1997.
43. H. Thielecke. Answer type polymorphism in call-by-name continuation passing. In Proc. European Symposium on Programming, Springer Lecture Notes in Comput. Sci. 2986, pp.279-293, 2004.
44. P. Wadler. Theorems for free! In Proc. Functional Programming Languages and Computer Architecture, pp.347-359, 1989.