Varieties of effects

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

Volumn 2303, Issue , 2002, Pages 144-159

  Führmann, Carsten ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPUTATIONAL EFFECTS; GLOBAL STATE;

COMPUTATION THEORY;

EID: 84948986901     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45931-6_11     Document Type: Conference Paper

References (13)

1. Anna Bucalo, Carsten Führmann, and Alex Simpson. An equational notion of lifting monad. Theoretical Computer Science, to appear.
2. Andrzej Filinski. Recursion from iteration. Lisp and Symbolic Computation,, 7(1):11–38, 1994.
3. Carsten Führmann. Direct models of the computational lambda-calculus. In Proceedings MFPS XV, volume 20 of Electronic Notes in Theoretical Computer Science, New Orleans, 1999. Elsevier.
4. Carsten Führmann. The structure of call-by-value. PhD thesis, Division of Informatics, University of Edinburgh, 2000.
5. Masahito Hasegawa and Yoshihiko Kakutani. Axioms for recursion in call-by-value. Higher-Order and Symbolic Computation, To appear.
6. A. Kock. Strong functors and monoidal monads. Archive der Mathematik, 23:113–120, 1972.
7. E. Moggi. Computational lambda-calculus and monads. Technical Report ECSLFCS-88-66, Edinburgh Univ., Dept. of Comp. Sci., 1988.
8. E. Moggi. Notions of computation and monads. Information and Computation, 93(1), 1991.
9. Flemming Nielson, Hanne Riis Nielson, and Chris Hankin. Principles of Program Analysis. Springer-Verlag, 1999.
10. John Power and Edmund Robinson. Premonoidal categories and notions of computation. Mathematical Structures in Computer Science, 7(5):453–468, October 1997.
11. Peter Selinger. Control categories and duality: on the categorical semantics of the lambda-mu calculus. Mathematical Structures in Computer Science, 11:207–260, 2001.
12. Hayo Thielecke. Categorical Structure of Continuation Passing Style. PhD thesis, University of Edinburgh, 1997.
13. Hayo Thielecke. Using a continuation twice and its implications for the expressive power of call/cc. Higher-Order and Symbolic Computation, 12(1):47–74, 1999.