Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
A probabilistic powerdomain of evaluations
Proceedings of the Fourth Annual Symposium on Logic in computer science
Category theory for computing science
Category theory for computing science
Notions of computation and monads
Information and Computation
Principles of programming with complex objects and collection types
ICDT '92 Selected papers of the fourth international conference on Database theory
The Powerdomain of Indexed Valuations
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Notions of Computation Determine Monads
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Combining Computational Effects: commutativity & sum
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Combining effects: sum and tensor
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Generic models for computational effects
Theoretical Computer Science - Logic, language, information and computation
Discrete Lawvere theories and computational effects
Theoretical Computer Science - Algebra and coalgebra in computer science
Combining algebraic effects with continuations
Theoretical Computer Science
Computational Effects and Operations: An Overview
Electronic Notes in Theoretical Computer Science (ENTCS)
Logic for computational effects: work in progress
IWFM'03 Proceedings of the 6th international conference on Formal Methods
Gabriel–ulmer duality and lawvere theories enriched over a general base
Journal of Functional Programming
Coalgebraic components in a many-sorted microcosm
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Second-order algebraic theories
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Just do it: simple monadic equational reasoning
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
A counterexample to tensorability of effects
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Algebraic foundations for effect-dependent optimisations
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Monoidal indeterminates and categories of possible worlds
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Nominal Lambda Calculus: An Internal Language for FM-Cartesian Closed Categories
Electronic Notes in Theoretical Computer Science (ENTCS)
Clones with Nullary Operations
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a Notion of Lambda Monoid
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
Lawvere theories and monads have been the two main category theoretic formulations of universal algebra, Lawvere theories arising in 1963 and the connection with monads being established a few years later. Monads, although mathematically the less direct and less malleable formulation, rapidly gained precedence. A generation later, the definition of monad began to appear extensively in theoretical computer science in order to model computational effects, without reference to universal algebra. But since then, the relevance of universal algebra to computational effects has been recognised, leading to renewed prominence of the notion of Lawvere theory, now in a computational setting. This development has formed a major part of Gordon Plotkin's mature work, and we study its history here, in particular asking why Lawvere theories were eclipsed by monads in the 1960's, and how the renewed interest in them in a computer science setting might develop in future.