RAIRO-Theor. Inf. Appl.
Volume 38, Number 4, October-December 2004Fixed Points in Computer Science (FICS'03)
|Page(s)||321 - 342|
|Published online||15 October 2004|
Coproducts of Ideal Monads
Department of Mathematics and Computer Science, University of Leicester,
University Road, Leicester LE1 7RH, UK; firstname.lastname@example.org.
2 Institute of Cybernetics, Tallinn Technical University, Akadeemia tee 21, EE-12618 Tallinn, Estonia; email@example.com.
The question of how to combine monads arises naturally in many areas with much recent interest focusing on the coproduct of two monads. In general, the coproduct of arbitrary monads does not always exist. Although a rather general construction was given by Kelly [Bull. Austral. Math. Soc. 22 (1980) 1–83], its generality is reflected in its complexity which limits the applicability of this construction. Following our own research [C. Lüth and N. Ghani, Lect. Notes Artif. Intell. 2309 (2002) 18–32], and that of Hyland, Plotkin and Power [IFIP Conf. Proc. 223 (2002) 474–484], we are looking for specific situations when simpler constructions are available. This paper uses fixed points to give a simple construction of the coproduct of two ideal monads.
Mathematics Subject Classification: 08B20 / 18C15 / 18C50 / 68Q55
© EDP Sciences, 2004
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.