Text size
  • Small
  • Medium
  • Large
Contrast
  • Standard
  • Blue text on blue
  • High contrast (Yellow text on black)
  • Blue text on beige

    The Universal Algebra of Computational Effects: Lawvere Theories and Monads

    Workshop on Mathematically Structured Functional Programming (MSFP 2006)

    Kuressaare, Estonia, 2 July 2006

    AUTHORS

    John Power

    ABSTRACT

    Lawvere theories were defined in 1963 as a category theoretic axiomatisation of the notion of a clone of an equational theory.

    A connection was soon established with the notion of monad, which had been extant in algebraic topology for the previous decade.

    Monads, although mathematically the less direct and less malleable formulation, rapidly gained precedence. In 1987, they were proposed as a unified model of computational effects, but without reference to universal algebra.

    But universal algebra is central to the idea of computational effect, as it provides a theoretical foundation for the computational operations that give rise to the effect.

    Recognition of that fact has led to renewed prominence of the notion of Lawvere theory.

    We study the history of the development, in particular asking why Lawvere theories were eclipsed by monads, and how the renewed interest in them in the setting of computational effects might develop.

    PAPER FORMATS

    PDF filePDF Version of this Paper (5kb)