• DocumentCode
    3092311
  • Title

    Coproducts of Monads on Set

  • Author

    Ad´mek, J. ; Milius, Stefan ; Bowler, Nathan ; Levy, Paul B.

  • Author_Institution
    Inst. fur Theor. Inf., Tech. Univ. Braunschweig, Braunschweig, Germany
  • fYear
    2012
  • fDate
    25-28 June 2012
  • Firstpage
    45
  • Lastpage
    54
  • Abstract
    Coproducts of monads on Set have arisen in both the study of computational effects and universal algebra. We describe coproducts of consistent monads on Set by an initial algebra formula, and prove also the converse: if the coproduct exists, so do the required initial algebras. That formula was, in the case of ideal monads, also used by Ghani and Uustalu. We deduce that coproduct embeddings of consistent monads are injective; and that a coproduct of injective monad morphisms is injective. Two consistent monads have a coproduct iff either they have arbitrarily large common fixpoints, or one is an exception monad, possibly modified to preserve the empty set. Hence a consistent monad has a coproduct with every monad iff it is an exception monad, possibly modified to preserve the empty set. We also show other fixpoint results, including that a functor (not constant on nonempty sets) is finitary iff every sufficiently large cardinal is a fixpoint.
  • Keywords
    process algebra; set theory; consistent monads; coproduct embeddings; coproducts; empty set; initial algebra formula; injective monad morphisms; universal algebra; Algebra; Computer science; Educational institutions; Equations; Indexes; Semantics; Writing; bialgebras; computational effects; coproducts; fixpoints; monads;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science (LICS), 2012 27th Annual IEEE Symposium on
  • Conference_Location
    Dubrovnik
  • ISSN
    1043-6871
  • Print_ISBN
    978-1-4673-2263-8
  • Type

    conf

  • DOI
    10.1109/LICS.2012.16
  • Filename
    6280423