Notions of Computation Determine Monads
Authors:
Top Cited Papers
- 15 March 2002
- book chapter
- Published by Springer Nature
- p. 342-356
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Combining Computational Effects: Commutativity and Sum2002
- Call-by-Push-Value: A Subsuming Paradigm1999
- A representable approach to finite nondeterminismTheoretical Computer Science, 1997
- Categorical models for local namesHigher-Order and Symbolic Computation, 1996
- Adjunctions whose counits are coequalizers, and presentations of finitary enriched monadsJournal of Pure and Applied Algebra, 1993
- Notions of computation and monadsInformation and Computation, 1991
- Full abstraction for a simple parallel programming language1979
- Categories for the Working Mathematician1971