Control categories and duality: On the categorical semantics of the lambda-mu calculus

Mathematical Structures in Computer Science

Volumn 11, Issue 2, 2001, Pages 207-

  Selinger, Peter ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85015306488     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S096012950000311X     Document Type: Article

References (25)

1. Agapiev, B. and Moggi, E. (1991) Declarative continuations and monads. (unpublished draft).
2. De Groote, P. (1994a) A CPS-translation of the λy-calculus. In: Proceedings of the 19th International Colloquium on Trees in Algebra and Programming - CAAP ’94. Springer-Verlag Lecture Notes in Computer Science 787 85–99.
3. De Groote, P. (1994b) On the relation between the λμ-calculus and the syntactic theory of sequential control. Springer-Verlag Lecture Notes in Computer Science 822.
4. Felleisen, M. (1986) The calculi of λv-conversion: A syntactic theory of control and state in imperative higher order programming languages, Ph. D. thesis, Indiana University.
5. Felleisen, M. and Hieb, R. (1992) The revised report on the syntactic theories of sequential control and state. Theoretical Computer Science 103 235–271.
6. Filinski, A. (1989) Declarative continuations and categorical duality. Master’s thesis, DIKU, Computer Science Department, University of Copenhagen. DIKU Report 89(11).
7. Fiihrmann, C. (1998) Direct-style and continuation-passing style models of control. Available from http://www.dcs.ed.ac.uk/home/car/research.htm.
8. Fiihrmann, C. (1999) Direct models of the computational lambda-calculus. In: Proceedings MFPS XV. Electronic Notes in Theoretical Computer Science 20.
9. Griffin, T. G. (1990) A formulae-as-types notion of control. In: POPL '90: Proceedings of the 17th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages.
10. Hofmann, M. and Streicher, T. (1997) Continuation models are universal for 2y-calculus. In: Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science 387–397.
11. Jeffrey, A. (1997) Premonoidal categories and a graphical view of programs (preprint).
12. Kelly, G. M. (1964) On Mac Fane’s conditions for coherence of natural associativities, Commutativities, etc. J. Algebra 1 397–402.
13. Fafont, Y., Reus, B. and Streicher, T. (1993) Continuations semantics or expressing implication by negation. Technical Report 93–21, University of Munich.
14. Fambek, J. and Scott, P. J. (1986) An Introduction to Higher Order Categorical Logic, Cambridge Studies in Advanced Mathematics 7, Cambridge University Press.
15. Mac Fane, S. (1963) Natural associativity and commutativity. Rice University Studies 49 28–46.
16. Moggi, E. (1988) Computational lambda-calculus and monads. Technical Report ECS-LFCS-88-66, Edinburgh University, Department of Computer Science.
17. Ong, C.-H. A semantic view of classical proofs: Type-theoretic, categorical, and denotational characterizations. In: Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science 230–241.
18. Ong, C.-H.L. and Stewart, C. A. A Curry-Howard foundation for functional computation with control. In: Proceedings of the Symposium on Principles of Programming Languages 215–227.
19. Parigot, M. (1992) λμ-calculus: An algorithmic interpretation of classical natural deduction. In: Proceedings of the International Conference on Logic Programming and Automated Reasoning, St. Petersburg. Springer-Verlag Lecture Notes in Computer Science 624 190–201.
20. Plotkin, G. D. (1975) Call-by-name, call-by-value and the 2-calculus. Theoretical Computer Science 1 125–159.
21. Power, J. and Robinson, E. (1997) Premonoidal categories and notions of computation. Mathematical Structures in Computer Science 7 (5) 445–452.
22. Pym, D. and Ritter, E. (1998) On the semantics of classical disjunction (preprint).
23. Selinger, P. (1998) An implementation of the call-by-name λμv-calculus (preprint - available from the Hypatia Electronic Library).
24. Streicher, T. and Reus, B. (1998) Classical logic, continuation semantics and abstract machines. Journal of Functional Programming 8 (6) 543–572.
25. Thielecke, H. (1997) Categorical Structure of Continuation Passing Style, Ph. D. thesis, University of Edinburgh, 1997.