μ-Bicomplete Categories and Parity Games
RAIRO-Theor. Inf. Appl., 36 2 (2002) 195-227
Published online: 2002-12-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):
14787 242 (2024)
https://doi.org/10.1007/978-3-031-68279-7_15
CHAD for expressive total languages
Fernando Lucatelli Nunes and Matthijs VákárMathematical Structures in Computer Science 1 (2023)
https://doi.org/10.1017/S096012952300018X
1 (2022)
https://doi.org/10.1145/3531130.3533375
Fixed-point Elimination in the Intuitionistic Propositional Calculus
Silvio Ghilardi, Maria João Gouveia and Luigi SantocanaleACM Transactions on Computational Logic 21 (1) 1 (2020)
https://doi.org/10.1145/3359669
Programming Languages and Systems
Henning Basold, Ekaterina Komendantskaya and Yue LiLecture Notes in Computer Science, Programming Languages and Systems 11423 783 (2019)
https://doi.org/10.1007/978-3-030-17184-1_28
Strong functors and interleaving fixpoints in game semantics
Pierre ClairambaultRAIRO - Theoretical Informatics and Applications 47 (1) 25 (2013)
https://doi.org/10.1051/ita/2012028
On the equivalence of game and denotational semantics for the probabilistic mu-calculus
Matteo MioLogical Methods in Computer Science Volume 8, Issue 2 (2012)
https://doi.org/10.2168/LMCS-8(2:7)2012
Conway games, algebraically and coalgebraically
Furio Honsell and Marina LenisaLogical Methods in Computer Science Volume 7, Issue 3 (2011)
https://doi.org/10.2168/LMCS-7(3:8)2011
The variable hierarchy for the games μ-calculus
Walid Belkhir and Luigi SantocanaleAnnals of Pure and Applied Logic 161 (5) 690 (2010)
https://doi.org/10.1016/j.apal.2009.07.015
Algebra and Coalgebra in Computer Science
Furio Honsell and Marina LenisaLecture Notes in Computer Science, Algebra and Coalgebra in Computer Science 5728 300 (2009)
https://doi.org/10.1007/978-3-642-03741-2_21
Completions of μ-algebras
Luigi SantocanaleAnnals of Pure and Applied Logic 154 (1) 27 (2008)
https://doi.org/10.1016/j.apal.2007.11.001
Logic for Programming, Artificial Intelligence, and Reasoning
Luigi Santocanale and Yde VenemaLecture Notes in Computer Science, Logic for Programming, Artificial Intelligence, and Reasoning 4790 499 (2007)
https://doi.org/10.1007/978-3-540-75560-9_36
Sequential algorithms and strongly stable functions
Paul-André MellièsTheoretical Computer Science 343 (1-2) 237 (2005)
https://doi.org/10.1016/j.tcs.2005.05.015
219 (2005)
https://doi.org/10.1109/LICS.2005.11
Ambiguous classes in μ-calculi hierarchies
Luigi Santocanale and André ArnoldTheoretical Computer Science 333 (1-2) 265 (2005)
https://doi.org/10.1016/j.tcs.2004.10.024
Foundations of Software Science and Computation Structures
André Arnold and Luigi SantocanaleLecture Notes in Computer Science, Foundations of Software Science and Computation Structures 2620 70 (2003)
https://doi.org/10.1007/3-540-36576-1_5
Logical Construction of Final Coalgebras
Luigi SantocanaleElectronic Notes in Theoretical Computer Science 82 (1) 321 (2003)
https://doi.org/10.1016/S1571-0661(04)80647-9