Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Uustalu, Tarmo
2003.
Generalizing Substitution.
RAIRO - Theoretical Informatics and Applications,
Vol. 37,
Issue. 4,
p.
315.
Ghani, Neil
and
Uustalu, Tarmo
2003.
Explicit substitutions and higher-order syntax.
p.
1.
Matthes, Ralph
and
Uustalu, Tarmo
2003.
Substitution in Non-wellfounded Syntax with Variable Binding.
Electronic Notes in Theoretical Computer Science,
Vol. 82,
Issue. 1,
p.
191.
Ghani, Neil
and
Uustalu, Tarmo
2004.
Coproducts of Ideal Monads.
RAIRO - Theoretical Informatics and Applications,
Vol. 38,
Issue. 4,
p.
321.
Matthes, Ralph
and
Uustalu, Tarmo
2004.
Substitution in non-wellfounded syntax with variable binding.
Theoretical Computer Science,
Vol. 327,
Issue. 1-2,
p.
155.
Power, John
and
Shkaravska, Olha
2004.
From Comodels to Coalgebras: State and Arrays.
Electronic Notes in Theoretical Computer Science,
Vol. 106,
Issue. ,
p.
297.
Ghani, Neil
Uustalu, Tarmo
and
Hamana, Makoto
2006.
Explicit substitutions and higher-order syntax.
Higher-Order and Symbolic Computation,
Vol. 19,
Issue. 2-3,
p.
263.
Milius, Stefan
and
Moss, Lawrence S.
2006.
The category-theoretic solution of recursive program schemes.
Theoretical Computer Science,
Vol. 366,
Issue. 1-2,
p.
3.
Ghani, Neil
and
Kurz, Alexander
2007.
Algebra and Coalgebra in Computer Science.
Vol. 4624,
Issue. ,
p.
226.
Fiore, Marcelo
and
Hur, Chung-Kil
2007.
Automata, Languages and Programming.
Vol. 4596,
Issue. ,
p.
607.
Levy, Paul Blain
2008.
Infinite trace equivalence.
Annals of Pure and Applied Logic,
Vol. 151,
Issue. 2-3,
p.
170.
Fiore, Marcelo
and
Hur, Chung-Kil
2009.
On the construction of free algebras for equational systems.
Theoretical Computer Science,
Vol. 410,
Issue. 18,
p.
1704.
Adámek, Jiří
Milius, Stefan
and
Velebil, Jiří
2010.
Recursive Program Schemes and Context-Free Monads.
Electronic Notes in Theoretical Computer Science,
Vol. 264,
Issue. 2,
p.
3.
Adámek, Jiří
Milius, Stefan
and
Velebil, Jiří
2011.
On second-order iterative monads.
Theoretical Computer Science,
Vol. 412,
Issue. 38,
p.
4969.
Uustalu, Tarmo
and
Vene, Varmo
2011.
The Recursion Scheme from the Cofree Recursive Comonad.
Electronic Notes in Theoretical Computer Science,
Vol. 229,
Issue. 5,
p.
135.
Behrisch, Mike
Kerkhoff, Sebastian
and
Power, John
2012.
Category Theoretic Understandings of Universal Algebra and its Dual: Monads and Lawvere Theories, Comonads and What?.
Electronic Notes in Theoretical Computer Science,
Vol. 286,
Issue. ,
p.
5.
Adámek, Jiří
Milius, Stefan
and
Urbat, Henning
2021.
On the behaviour of coalgebras with side effects and algebras with effectful iteration.
Journal of Logic and Computation,
Vol. 31,
Issue. 6,
p.
1429.
Popescu, Andrei
2024.
Nominal Recursors as Epi-Recursors.
Proceedings of the ACM on Programming Languages,
Vol. 8,
Issue. POPL,
p.
425.