## User login## Navigation |
## Lawvere Theories and MonadsMartin Hyland and John Power (2007). The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads. ENTCS 172:437-458. Both monads and Lawvere theories provide characterisations of algebraic structure, with monads providing the more general characterisation. The authors provide an introduction to Lawvere theories, discusses their relationship to sets, and why monads became the more popular treatment. Then they tackle the application of the theory to the semantics of side effects, where they argue that the generality of monads allow them to characterise computational phenomena that are not to do with side effects such as partiality and continuations, and argue that Lawvere theories more cleanly characterise what side effects are. This paper is a good introduction to an important line of recent research done by Hyland&Power; cf. also the LtU story Combining computational effects. |
## Browse archives## Active forum topics- Programming Languages as Mathematical Representations
- Looking for references on the expressiveness and computational completeness of a relational programming language
- language handling of memory and other resource failures
- Whither FRP?
- Is there a language with the ability to write arbitrary type functions?
## New forum topics |

## Recent comments

21 min 7 sec ago

52 min 13 sec ago

59 min 32 sec ago

1 hour 21 min ago

1 hour 26 min ago

1 hour 33 min ago

5 hours 40 min ago

7 hours 26 min ago

8 hours 42 min ago

13 hours 55 min ago