Notions of Computation Determine Monads
By Gordon D. Plotkin, John Power. Foundations of Software Science and Computation Structure, 2002
360 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/8e4de5bc819e1c3474dde064a0e0f9fb3e28cf9d
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Ian David Bede Stark
- Matija Pretnar
- Gordon D. Plotkin
- Nicolas Oury
- Ohad Kammar
- S. Lindley
- John Power
- Marie-Claude Gaudel
In Computational Theory and Mathematics
- Ian David Bede Stark
- Matija Pretnar
- Gordon D. Plotkin
- Nicolas Oury
- Ohad Kammar
- S. Lindley
- John Power
Citations in the corpus
- Free-Algebra Models for the pi-Calculus (2005, methodology): “We sketch very briefly the theoretical basis for our development: for more on enriched algebraic theories see Robinson’s clear and detailed exposition [31]; the link to computations and generic effects is described in [ 27 , 28].”
- Handlers in action (2013, background): “Algebraic Effects and Effect Handlers Effect operations were pioneered by Plotkin and Power [35], leading to an algebraic account of computational effects [34] and their combination [15].”
- Handlers of Algebraic Effects (2009, methodology): “The equations of the theory, for example the ones stating that or is a semi-lattice operation, generate the free-model functor, which is exactly the monad proposed by Moggi to model the corresponding effect [9] (modulo the forgetful functor) and which is used to interpret the type Fσ.”
- Algebraic Operations and Generic Effects (2003, methodology): “In all cases we can go further, taking the monad T to be generated by the operations subject to accompanying equations; this idea is explored in [ 22 ,7].”