Coproducts of Ideal Monads
RAIRO-Theor. Inf. Appl., 38 4 (2004) 321-342
Published online: 2004-10-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Modular Models of Monoids with Operations
Zhixuan Yang and Nicolas WuProceedings of the ACM on Programming Languages 7 (ICFP) 566 (2023)
https://doi.org/10.1145/3607850
Coalgebraic Methods in Computer Science
Aloïs Rosset, Helle Hvid Hansen and Jörg EndrullisLecture Notes in Computer Science, Coalgebraic Methods in Computer Science 13225 110 (2022)
https://doi.org/10.1007/978-3-031-10736-8_6
A unified view of monadic and applicative non-determinism
Exequiel Rivas, Mauro Jaskelioff and Tom SchrijversScience of Computer Programming 152 70 (2018)
https://doi.org/10.1016/j.scico.2017.09.007
Isomorphism theorems between models of mixed choice
JEAN GOUBAULT-LARRECQMathematical Structures in Computer Science 27 (6) 1032 (2017)
https://doi.org/10.1017/S0960129515000547
Interleaving data and effects
ROBERT ATKEY and PATRICIA JOHANNJournal of Functional Programming 25 (2015)
https://doi.org/10.1017/S0956796815000209
47 (2014)
https://doi.org/10.1145/2541568.2541573
The Coinductive Resumption Monad
Maciej Piróg and Jeremy GibbonsElectronic Notes in Theoretical Computer Science 308 273 (2014)
https://doi.org/10.1016/j.entcs.2014.10.015
Monads for Behaviour
Maciej Piróg and Jeremy GibbonsElectronic Notes in Theoretical Computer Science 298 309 (2013)
https://doi.org/10.1016/j.entcs.2013.09.019
45 (2012)
https://doi.org/10.1109/LICS.2012.16
Modularity and Implementation of Mathematical Operational Semantics
Mauro Jaskelioff, Neil Ghani and Graham HuttonElectronic Notes in Theoretical Computer Science 229 (5) 75 (2011)
https://doi.org/10.1016/j.entcs.2011.02.017
On second-order iterative monads
Jiří Adámek, Stefan Milius and Jiří VelebilTheoretical Computer Science 412 (38) 4969 (2011)
https://doi.org/10.1016/j.tcs.2011.04.027
Recursive Program Schemes and Context-Free Monads
Jiří Adámek, Stefan Milius and Jiří VelebilElectronic Notes in Theoretical Computer Science 264 (2) 3 (2010)
https://doi.org/10.1016/j.entcs.2010.07.011
Computer Science Logic
Jean Goubault-LarrecqLecture Notes in Computer Science, Computer Science Logic 4646 542 (2007)
https://doi.org/10.1007/978-3-540-74915-8_40
Term Rewriting and Applications
Michael Abbott, Neil Ghani and Christoph LüthLecture Notes in Computer Science, Term Rewriting and Applications 3467 46 (2005)
https://doi.org/10.1007/978-3-540-32033-3_5
Completely iterative algebras and completely iterative monads
Stefan MiliusInformation and Computation 196 (1) 1 (2005)
https://doi.org/10.1016/j.ic.2004.05.003