Direct models for the computational lambda-calculus

Electronic Notes in Theoretical Computer Science

Volumn 20, Issue , 1999, Pages 245-292

  Führmann, Carsten ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; SEMANTICS; THEOREM PROVING;

COMPUTATIONAL LAMBDA-CALCULUS; DIRECT MODELS; KLEISLI CATEGORY; MONADIC MODELS;

COMPUTATIONAL METHODS;

EID: 0003367691     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80078-1     Document Type: Conference Paper

References (18)

1. Anderson S.O., Power A.J. A representable approach to finite nondeterminism. Theoretical Computer Science. 177:1997;3-25
2. Appel A.W. Compiling with Continuations. 1992;Cambridge University Press
3. Bucalo A., C. Führmann and A. Simpson, Equational lifting monads, Available from http://www.dcs.ed.ac.uk/home/car/research.htm (1999), submitted.
4. Führmann C., Relating two models of continuations, Available from http://www.dcs.ed.ac.uk/home/car/research.htm (1998).
5. Hasegawa M., Recursion from cyclic sharing: traced monoidal categories and models of cyclic lambda calculi, in: Proc. 6th Intrnational Conference on Category Theory and Computer Science (CTCS'95), LNCS 1210 (1997).
6. Hasegawa M., "Models of Sharing Graphs (A Categorical Semantics of Let and Letrec)," Distinguished Dissertation Series, Springer-Verlag, 1999
7. Jacobs B. Semantics of weakening and contraction. Annals of Pure and Applied Logic. 69:1994;73-106
8. Jeffrey A., Premonoidal categories and a graphical view of programs, Available from http://klee.cs.depaul.edu/premon/ (1998).
9. Lane S.M. Categories for the Working Mathematician. Graduate Texts in Mathematics. 1971;Springer-Verlag
10. Moggi E., Computational Lambda-calculus and monads, Technical Report ECS-LFCS-88-66, Edinburgh Univ., Dept. of Comp. Sci. (1988).
11. Moggi E. Notions of computation and monads. Information and Computation. 93:1991
12. Power J., Robinson E. Premonoidal categories and notions of computation. Mathematical Structures in Computer Science. 7:1977;453-468
13. Power J. and H. Thielecke, Environments, continuation semantics and indered categories, in: Proceedings TACS'97, LNCS 1281 (1997), pp.391-414.
14. Power J. and H. Thielecke, Environments in Freyd categories and k-categories (1999), iCALP'99, to appear.
15. Schweimeier R. and A. Jefferey, A categorical and graphical treatment of closure conversion, in: Electronic Notes in Theoretical Computer Science. Proceedings MFPS XV, New Orleans, 1999.
16. Simpson A., Towads algebraic semantics of programming languages Notes for a talk at the LFCS Lab Lugh (1993).
17. Thielecke H., "Categorical Structure of Contituation Passing Style," Ph.D. thesis, University of Edinburgh (1997).
18. Thielecke H. Continuation semantics and self-adjointness, in: Proceedings MFPS XIII, Electronic Notes in Theoretical Computer Science, URL:http://www.elsevier.nl/locate/entcs/volume6.html (1997).