An equational notion of lifting monad

  • Authors:

  • Anna Bucalo;Carsten Führmann;Alex Simpson

  • Affiliations:

  • Dipartimento di Matematica e Informatica, Università di Udine, Italy;School of Computer Science, University of Birmingham, Birmingham, UK;LFCS, Division of Informatics, University of Edinburgh, Scotland, UK

  • Venue:
  • Theoretical Computer Science - Category theory and computer science
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce the notion of an equational lifting monad: a commutative strong monad satisfying one additional equation (valid for monads arising from partial map classifiers). We prove that any equational lifting monad has a representation by a partial map classifier such that the Kleisli category of the former fully embeds in the partial category of the latter. Thus, equational lifting monads precisely capture the equational properties of partial maps as induced by partial map classifiers. The representation theorem also provides a tool for transferring nonequational properties of partial map classifiers to equational lifting monads. It is proved using a direct axiomatization of Kleisli categories of equational lifting monads. This axiomatization is of interest in its own right.