Recursive coalgebras of finitary functors
RAIRO-Theor. Inf. Appl., 41 4 (2007) 447-462
Published online: 2007-08-17
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):
Exact sequences in categories of coalgebras
Jean-Paul MavoungouJournal of Algebra and Its Applications 24 (02) (2025)
https://doi.org/10.1142/S0219498825500331
Perspectives of semantic modeling in categories
William SteingartnerJournal of King Saud University Computer and Information Sciences 37 (3) (2025)
https://doi.org/10.1007/s44443-025-00010-9
Strong functional pearl: Harper’s regular-expression matcher in Cedille
Aaron Stump, Christopher Jenkins, Stephan Spahn and Colin McDonaldProceedings of the ACM on Programming Languages 4 (ICFP) 1 (2020)
https://doi.org/10.1145/3409004
Well-founded coalgebras, revisited
JEAN-BAPTISTE JEANNIN, DEXTER KOZEN and ALEXANDRA SILVAMathematical Structures in Computer Science 27 (7) 1111 (2017)
https://doi.org/10.1017/S0960129515000481
Foundations of Software Science and Computation Structures
Venanzio Capretta and Tarmo UustaluLecture Notes in Computer Science, Foundations of Software Science and Computation Structures 9634 91 (2016)
https://doi.org/10.1007/978-3-662-49630-5_6
Conjugate Hylomorphisms -- Or
Ralf Hinze, Nicolas Wu and Jeremy GibbonsACM SIGPLAN Notices 50 (1) 527 (2015)
https://doi.org/10.1145/2775051.2676989
527 (2015)
https://doi.org/10.1145/2676726.2676989
Horizons of the Mind. A Tribute to Prakash Panangaden
Dexter KozenLecture Notes in Computer Science, Horizons of the Mind. A Tribute to Prakash Panangaden 8464 407 (2014)
https://doi.org/10.1007/978-3-319-06880-0_21
1 (2013)
https://doi.org/10.1145/2502488.2502496
Programming Languages and Systems
Jean-Baptiste Jeannin, Dexter Kozen and Alexandra SilvaLecture Notes in Computer Science, Programming Languages and Systems 7792 61 (2013)
https://doi.org/10.1007/978-3-642-37036-6_4
Adjoint folds and unfolds—An extended study
Ralf HinzeScience of Computer Programming 78 (11) 2108 (2013)
https://doi.org/10.1016/j.scico.2012.07.011
69 (2012)
https://doi.org/10.1145/2364394.2364405
Structured general corecursion and coinductive graphs [extended abstract]
Tarmo UustaluElectronic Proceedings in Theoretical Computer Science 77 55 (2012)
https://doi.org/10.4204/EPTCS.77.8
Presentation of Set Functors: A Coalgebraic Perspective
J. Adamek, H. P. Gumm and V. TrnkovaJournal of Logic and Computation 20 (5) 991 (2010)
https://doi.org/10.1093/logcom/exn090
Coequational logic for accessible functors
Daniel SchwenckeInformation and Computation 208 (12) 1469 (2010)
https://doi.org/10.1016/j.ic.2009.10.010
Formal Methods: Foundations and Applications
Venanzio Capretta, Tarmo Uustalu and Varmo VeneLecture Notes in Computer Science, Formal Methods: Foundations and Applications 5902 84 (2009)
https://doi.org/10.1007/978-3-642-10452-7_7
Coequational Logic for Finitary Functors
Daniel SchwenckeElectronic Notes in Theoretical Computer Science 203 (5) 243 (2008)
https://doi.org/10.1016/j.entcs.2008.05.028