Relational parametricity and control

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2005, Pages 72-81

  Hasegawa, Masahito ^a,b  

^a KYOTO UNIVERSITY   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUATION-PASSING STYLE (CPS); CPS SEMANTICS; EQUATIONAL THEORY; RELATIONAL PARAMETRICITY;

CONTROL THEORY; SEMANTICS;

PARAMETER ESTIMATION;

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

References (37)

1. M. Abadi, L. Cardelli, and P.-L. Curien. Formal parametric polymorphism. Theoret. Comput. Sci. 121:9-58, 1993.
2. G. Barthe and T. Uustalu. CPS translating inductive and coinductive types. In Proc. Partial Evaluation and Semantics-Based Program Manipulation, pp. 131-142, 2002.
3. 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.
4. B.P. Dunphy. Parametricity as a Notion of Uniformity in Reflexive Graphs. PhD thesis, University of Illinois, 2002.
5. 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.
6. 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.187-201, 2005.
7. 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.
8. J.-Y. Girard. Linear logic. Theoret. Comp. Sci. 50, 1-102, 1987.
9. 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.
10. M. Hasegawa and Y. Kakutani. Axioms for recursion in callby-value. Higher-Order and Symbolic Comput. 15(2/3):235-264, 2002.
11. R. Hasegawa. Categorical data types in parametric polymorphism. Math. Struct. Comp. Sci. 4(1):71-109, 1994.
12. M. Hofmann and T. Streicher. Completeness of continuation models for λμ-calculus. Inf. Comput. 179(2):332-355, 2002.
13. B. Jacobs. Categorical Logic and Type Theory. Elsevier, 1999.
14. 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.
15. Y. Kakutani and M. Hasegawa. Parameterizations and fixed-point operators on control categories. Fundam. Inform. 65(1/2):153-172, 2005.
16. 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.
17. E. Moggi. Notions of computation and monads. Inf. Comput. 93(1):55-92, 1991.
18. 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.
19. 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.
20. 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.
21. 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.
22. M. Parigot. Proofs of strong normalisation for second order classical natural deduction. J. Symb. Log. 62(4):1461-1479, 1997.
23. G.D. Plotkin. Call-by-name, call-by-value, and the λ-calculus. Theoret. Comput. Sci. 1(1):125-159, 1975.
24. G.D. Plotkin. Type theory and recursion (extended abstract). In Proc. Logic in Computer Science, pp.374, 1993.
25. 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.
26. A.J. Power and E. Robinson. Premonoidal categories and notions of computation. Math. Struct. Comp. Sci. 7(5):453-468, 1997.
27. 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.
28. J.C. Reynolds. Types, abstraction and parametric polymorphism. In Proc. IFIP 9th World Computer Congress, Information Processing 83, pp.513-523, 1983.
29. A. Sabry. Note on axiomatizing the semantics of control operators. Tech. Rep. CIS-TR-96-03, University of Oregon, 1996.
30. P. Selinger. Control categories and duality: on the categorical semantics of the lambda-mu calculus. Math. Struct. Comp. Sci. 11(2):207-260, 2001.
31. P. Selinger. Some remarks on control categories. Manuscript, 2003.
32. T. Streicher and B. Reus. Classical logic, continuation semantics and abstract machines. J. Funct. Program. 8(6):543-572, 1998.
33. I. Takeuti. An axiomatic system of parametricity. Fundam. Inform. 33(4):397-432, 1998.
34. P. Taylor. Sober spaces and continuations. Theory and Applications of Categories 10(12):248-300, 2002.
35. H. Thielecke. Categorical Structure of Continuation Passing Style. PhD thesis, University of Edinburgh, 1997.
36. 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.
37. P. Wadler. Theorems for free! In Proc. Functional Programming Languages and Computer Architecture, pp.347-359, 1989.