A universal embedding for the higher order structure of computational effects

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2701, Issue , 2003, Pages 301-315

  Power, John ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; COMPUTATIONAL MECHANICS; DIFFERENTIATION (CALCULUS); SEMANTICS;

COMPUTATIONAL EFFECTS; COMPUTATIONAL LAMBDA CALCULUS; ENRICHED CATEGORIES; FREE COCOMPLETION; HIGHER-ORDER STRUCTURE; LINEAR LAMBDA CALCULUS; SIMPLY TYPED LAMBDA CALCULUS; UNIVERSAL PROPERTIES;

CALCULATIONS;

EID: 33749520176     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44904-3_21     Document Type: Article

References (22)

1. R. Blackwell, G.M. Kelly, and A.J. Power. Two-dimensional monad theory. J. Pure Appl. Algebra, 59:1-41, 1989.
2. E. Cheng, M. Hyland, and A.J. Power. Pseudo-distributive laws. Submitted.
3. B.J. Day. On closed categories of functors. In Midwest Category Seminar Reports IV, volume 137 of Lectures Notes in Mathematics, pages 1-38, 1970.
4. M. Fiore, G.D. Plotkin, and D. Turi. Abstract syntax and variable binding. In Proceedings of 14th Symposium on Ligic in Computer Science, pages 214-224, IEEE Computer Society Press, 1999.
5. Guen Bin Im and G.M. Kelly. A universal property of the convolution monoidal structure. J. Pure Appl. Algebra, 43:76-88, 1986.
6. A. Joyal, M. Nielsen, and G. Winskel. Bisimulation from open maps. Information and Computation, 127: 164-185, 1996.
7. G.M. Kelly. Basic concepts of enriched category theory, volume 64 of London Mathematical Society Lecture Notes Series, Cambridge University Press, 1982.
8. Y. Kinoshita and A.J. Power. Data-refinement in call-by-value languages. In Proceedings of Computer Science Logic, in volume 1683 of Lecture Notes in Computer Science, pages 562-576, 1999.
9. P.B. Levy, A.J. Power, and H. Thielecke. Modelling environments in call-by-value programming languages. Theoretical Computer Science, to appear.
10. E. Moggi. Computational lambda-calculus and monads. In Proceedings of 4th Symposium on Logic in Computer Science, pages 14-32, IEEE Computer Society Press, 1989.
11. E. Moggi. Notions of computation and monads. Information and Computation, 93:55-92, 1991.
12. M. Nygaard and G. Winskel. Linearity in Process Languages. In Proceedings of 17th Symposium on Logic in Computer Science, pages 433-444, IEEE Computer Society Press, 2002.
13. P.W. O'Hearn and D.J. Pym. The logic of bunched implications. Bull. Symbolic Logic 5:215-403, 1999.
14. G.D. Plotkin and A.J. Power. Adequacy for algebraic effects. In Proceedings of Foundations of Software Science and Compuation Structures, in volume 2030 of Lecture Notes in Computer Science, pages 1-24, 2001.
15. G.D. Plotkin and A.J. Power. Semantics for algebraic operations. In Proceedings of Mathematical Foundations of Programming Semantics, in volume 45 of Electronic Notes in Theoretical Computer Science, 2001.
16. G.D. Plotkin and A.J. Power. Algebraic operations and generic effects. Applied Categorical Structures, to appear.
17. A.J. Power. Premonoidal categories as categories with algebraic structure. Theoretical Computer Science, 278:303-321, 2002.
18. A.J. Power. Models for the computational λ-calculus. In Proceedings of 1st Irish Conferenence on Mathematical Foundations of Computer Science and Information Technology, in volume 40 of Electronic Notes in Theoretical Computer Science, 40, 2001.
19. A.J. Power and E.P. Robinson. Premonoidal categories and notions of computation. In: Proc. LDPL 96, Math Structures in Computer Science 7:453-468, 1997.
20. Miki Tanaka. Abstract syntax and variable binding for linear binders. In Proceedings of 25th Mathematical Foundations of Computer Science, in volume 1893 of Lecture Notes in Computer Science, pages 670-679, 2000.
21. Hayo Thielecke. Continuation passing style and self-adjointness. In Proceedings 2nd ACM SIGPLAN Workshop on Continuations, number NS-96-13 in BRICS Notes Series, December 1996.
22. Hayo Thielecke. Continuations semantics and self-adjointness. In Proceedings of 13th Conference on Mathematical Foundations of Programming Semantics, in volume 6 of Electronic Notes in Theoretical Computer Science.