Adjunction models for call-by-push-value with stacks

Theory and Applications of Categories

Volumn 14, Issue 5, 2005, Pages

  Levy, Paul Blain ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Adjunction; Call by name; Call by push value; Call by value; CK machine; Continuations; Denotational semantics; Game semantics; Indexed category; Monad; Possible worlds

Indexed keywords

EID: 27844452935     PISSN: 1201561X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (43)

1. [AHM98] S. Abramsky, K. Honda, and G. McCusker. A fully abstract game semantics for general references. In Proc., 13th Ann. IEEE Symp. on Logic in Comp. Sci., 1998.
2. [AM98] S. Abramsky and G. McCusker. Call-by-value games. In M. Nielsen and W. Thomas, editors, Computer Science Logic: 11th International Workshop Proceedings, LNCS. Springer, 1998.
3. [CH00] Pierre-Louis Curien and Hugo Herbelin. The duality of computation. In Proc., ACM Sigplan International Conference on Functional Programming (ICFP-00), volume 35.9 of ACM Sigplan Notices, pages 233-243, N.Y., September 18-21 2000. ACM Press.
4. [CLW93] A. Carboni, S. Lack, and R. F. C. Walters. Introduction to extensive and distributive categories. Journal of Pure and Applied Algebra, 84:145-158, 1993.
5. [CM93] P. Cenciarelli and E. Moggi. A syntactic approach to modularity in denotational semantics. In CTCS 1993, 1993.
6. [Coc93] J. R. B. Cockett. Introduction to distributive categories. Mathematical Structures in Computer Science, 3(3):277-307, September 1993.
7. [CS] R. Cockett and R. Seely. Polarized category theory, modules and game semantics. Preprint.
8. [Dan92] O. Danvy. Back to direct style. In Proc. European Symposium on Programming, volume 582 of LNCS, 1992.
9. [FF86] M. Felleisen and D. Friedman. Control operators, the SECD-rnachine, and the λ-calculus. In M. Wirsing, editor, Formal Description of Prog. Concepts. North-Holland, 1986.
10. [Fil96] A. Filinski. Controlling Effects. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, 1996.
11. [FPD99] M. Fiore, G. D. Plotkin, and D.Turi. Abstract syntax and variable binding. In G. Longo, editor, Proceedings of the 14th Annual Symposium on Logic in Computer Science (LICS'99), pages 193-202, Trento, Italy, July 1999. IEEE Computer Society Press.
12. [Har99] R. Harmer. Games and full abstraction for nondeterministic languages. PhD thesis, Univ. of London, 1999.
13. [HO00] M. Hyland and L. Ong. On full abstraction for PCF: I, II, and III. Inf. and Comp., 163(2), 2000.
14. [HY97] K. Honda and N. Yoshida. Game theoretic analysis of call-by-value computation. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, Automata, Languages and Programming, 24th International Colloquium, volume 1256 of LNCS, pages 225-236, Bologna, Italy, 1997. Springer.
15. [Jef99] A. Jeffrey. A fully abstract semantics for a higher-order functional language with nondeterministic computation. Theoretical Comp. Sci., 228, 1999.
16. [Kri85] J.-L. Krivine. Un interpréteur de λ-calcul. Unpublished, 1985.
17. [Lai97] J. Laird. Rill abstraction for functional languages with control. In Proceedings, Twelfth Annual IEEE Symposium on Logic in Computer Science, pages 58-67, Warsaw, Poland, 1997. IEEE Computer Society Press.
18. [Lai98] J. Laird. A Semantic Analysis of Control. PhD thesis, University of Edinburgh, 1998.
19. [Lai02] James Laird. Exceptions, continuations and macro-expressiveness. Lecture Notes in Computer Science, 2305, 2002.
20. [Lau02] Olivier Laurent. Polarized games. In Logic in Computer Science, pages 265-274, Los Alamitos, CA, USA, July 22-25 2002. IEEE Computer Society.
21. [Law63] F. W. Lawvere. Functorial Semantics of Algebraic Theories. PhD thesis, Columbia University, 1963.
22. Reprinted as Reprints in Theory and Applications of Categories, No. 5 (2004), pages 1-121.
23. [Lev] P. B. Levy. Call-by-push-value: Decomposing call-by-value and call-by-name, submitted.
24. [Lev96] P. B. Levy. λ-calculus and cartesian closed categories. Essay for Part III of the Mathematical Tripos, Cambridge University, manuscript, 1996.
25. [Lev99] P. B. Levy. Call-by-push-value: a subsuming paradigm (extended abstract). In J.-Y Girard, editor, Typed Lambda-Calculi and Applications, volume 1581 of LNCS, 1999.
26. [Lev0l] P. B. Levy. Call-by-push-value. PhD thesis, Queen Mary, University of London, 2001.
27. [Lev02] P. B. Levy. Possible world semantics for general storage in call-by-value. In J. Bradfield, editor, Proc., 16th Annual Conference in Computer Science Logic, Edinburgh, 2002, volume 2471 of LNCS, pages 232-246. Springer, 2002.
28. [Lev03] P. B. Levy. Adjunction models for call-by-push-value with stacks. In R. Blute and P. Selinger, editors, Proc., 9th Conference on Category Theory and Computer Science, Ottawa, 2002, volume 69 of Electronic Notes in Theoretical Computer Science, 2003.
29. [Lev04] P. B. Levy. Call-By-Push-Value. Semantic Structures in Computation. Kluwer, 2004.
30. [LPT03] P. B. Levy, A. J. Power, and H. Thielecke. Modelling environments in call-by-value programming languages. Information and Computation, 185:182-210, 2003.
31. [LRS93] Y. Lafont, B. Reus, and Th. Streicher. Continuation semantics or expressing implication by negation. Technical Report 9321, Ludwig-Maximilians- Universität, München, 1993.
32. [LS86] J. Lambek and P. Scott. Introduction to Higher Order Categorical Logic. Cambridge University Press, Cambridge, 1986.
33. [Mog91] E. Moggi. Notions of computation and monads. Inf. and Comp., 93, 1991.
34. [Mog90] E Moggi. An abstract view of programming languages. Technical Report ECS-LFCS-90-113, Dept. of Computer Science, Edinburgh Univ., 90.
35. [Nic96] H. Nickau. Hereditarily Sequential Functionals: A Game-Theoretic Approach to Sequentially. Shaker-Verlag, 1996. Diss., Universität Gesamthochschule Siegen.
36. [Ole82] F. J. Oles. A Category-Theoretic Approach to the Semantics of Programming Languages. Ph. D. dissertation, Syracuse University, August 1982.
37. [Plo85] G. D. Plotkin. Lectures on predomains and partial functions. Course notes, Center for the Study of Language and Information, Stanford, 1985.
38. [PP01] Gordon Plotkin and John Power. Adequacy for algebraic effects. Lecture Notes in Computer Science, 2030, 2001.
39. [PS98] A. M. Pitts and I. D. B. Stark. Operational reasoning for functions with local state. In A. D. Gordon and A. M. Pitts, editors, Higher Order Operational Techniques in Semantics, Publications of the Newton Institute, pages 227-273. Cambridge University Press, 1998.
40. [Sel01] P. Selinger. Control categories and duality: On the categorical semantics of the λμ-calculus. Mathematical Structures in Computer Science, 11(2), 2001.
41. [SF93] A. Sabry and M. Felleisen. Reasoning about programs in continuation-passing style. Lisp and Symbolic Computation, 6(3/4), 1993.
42. [SR98] Th. Streicher and B. Reus. Classical logic, continuation semantics and abstract machines. Journal of Functional Programming, 8(6), 1998.
43. [Thi97] H. Thielecke. Continuation semantics and self-adjointness. In Proceedings MFPS XIII, Electronic Notes in Theoretical Computer Science. Elsevier, 1997.