Modelling environments in call-by-value programming languages

Information and Computation

Volumn 185, Issue 2, 2003, Pages 182-210

  Levy, Paul Blain ^a   Power, John ^b   Thielecke, Hayo ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; CONFORMAL MAPPING; THEOREM PROVING;

CALL BY VALUE PROGRAMMING LANGUAGES; LAMBDA CALCULUS; MODELLING ENVIRONMENTS;

SEMANTICS;

EID: 0043196810     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00088-9     Document Type: Article

References (17)

1. R. Blackwell, G.M. Kelly, A.J. Power, Two-dimensional monad theory, Journal of Pure and Applied Algebra 59 (1989) 1-41.
2. R. Blute, J.R.B. Cockett, R.A.G. Seely, Categories for computation in context and unified logic, Journal of Pure and Applied Algebra 116 (1997) 49-98.
3. M. Hasegawa, Decomposing typed lambda calculus into a couple of categorical programming languages, in: D. Pitt, D.E. Rydeheard, P.T. Johnstone (Eds.), Proceedings of the 6th International Conference on Category Theory and Computer Science (CTCS'95), LNCS, vol. 953, Springer, Berlin, 1995, pp. 200-219.
4. B. Jacobs, Categorical Type Theory. Phd thesis, University of Nijmegen, 1991.
5. G.M. Kelly, The Basic Concepts of Enriched Categories, Cambridge University Press, Cambridge, 1982.
6. G.M. Kelly, A.J. Power, Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads, Journal of Pure and Applied Algebra 89 (1993) 163-179.
7. P.B. Levy, Call-by-push-value: a subsuming paradigm (extended abstract), in: J.-Y Girard (Ed.), Typed Lambda-Calculi and Applications, LNCS, vol. 1581, Springer, L'Aquila, 1999, pp. 228-242.
8. P.B. Levy, Call-by-push-value, PhD thesis, Queen Mary, University of London, 2001.
9. E. Moggi, Computational Lambda Calculus and Monads, Proc. LICS, 89, IEEE Press, 1989, pp. 14-23.
10. E. Moggi, Notions of computation and monads, Information and Computation 93 (1991) 55-92.
11. A.J. Power, Premonoidal categories as categories with algebraic structure, Theoretical Computer Science 278 (1-2) (2002) 303-321.
12. A.J. Power, E.P. Robinson, Premonoidal categories and notions of computation, Mathematical Structures in Computer Science 7 (5) (1997) 453-468.
13. A.J. Power, H. Thielecke, Environments, continuation semantics and indexed categories, Proceedings TACS'97, LNCS, vol. 1281, Springer, Berlin, 1997, pp. 391-414.
14. A.J. Power, H. Thielecke, Closed Freyd- and kappa-categories, Proceedings ICALP '99, LNCS, vol. 1644, Springer, Berlin, 1999, pp. 625-634.
15. E.P. Robinson, Variations on algebra: monadicity and generalisations of equational theories, Formal Aspects of Computing 13 (3-5) (2002) 308-326.
16. E.P. Robinson, G. Rosolini, Categories of partial maps, Information and Computation 79 (1988) 95-130.
17. H. Thielecke, Categorical Structure of Continuation Passing Style. PhD thesis, University of Edinburgh, 1997. Also available as technical report ECS-LFCS-97-376.