Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-25T14:34:04.544Z Has data issue: false hasContentIssue false
  • English
  • Français

Recursive coalgebras of finitary functors

Published online by Cambridge University Press:  17 August 2007

Jiří Adámek ,
Dominik Lücke  and
Stefan Milius
Jiří Adámek
Affiliation:
Technical University of Braunschweig, Institute of Theoretical Computer Science, Braunschweig, Germany; [email protected]; [email protected]
Dominik Lücke
Affiliation:
Department of Computer Science, University of Bremen, PO Box 330440, 28334 Bremen, Germany; [email protected]
Stefan Milius
Affiliation:
Technical University of Braunschweig, Institute of Theoretical Computer Science, Braunschweig, Germany; [email protected]; [email protected]
Get access

Abstract

For finitary set functors preserving inverse images, recursive coalgebras A of Paul Taylor are proved to be precisely those for which the system described by A always halts in finitely many steps.

Keywords

Recursive coalgebracoalgebradefinition by recursivity
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 41 , Issue 4 , October 2007 , pp. 447 - 462
Copyright
© EDP Sciences, 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

P. Aczel and N. Mendler, A Final Coalgebra Theorem, Proceedings Category Theory and Computer Science, edited by D.H. Pitt et al. Lect. Notes Comput. Sci. (1989) 357–365.
Adámek, J. and Milius, S., Terminal coalgebras and free iterative theories. Inform. Comput. 204 (2006) 1139–1172. CrossRef
J. Adámek and V. Trnková, Automata and Algebras in Categories. Kluwer Academic Publishers (1990).
J. Adámek, D. Lücke and S. Milius, Recursive coalgebras of finitary functors, in CALCO-jnr 2005 CALCO Young Researchers Workshop Selected Papers, edited by P. Mosses, J. Power and M. Seisenberger, Report Series, University of Swansea, 1–14.
Barr, M., Terminal coalgebras in well-founded set theory. Theoret. Comput. Sci. 114 (1993) 299–315. CrossRef
Capretta, V., Uustalu, T. and Vene, V., Recursive coalgebras from comonads. Inform. Comput. 204 (2006) 437–468. CrossRef
Koubek, V., Set functors. Comment. Math. Univ. Carolin. 12 (1971) 175–195.
Lambek, J., A fixpoint theorem for complete categories. Math. Z. 103 (1968) 151–161. CrossRef
Milius, S., Completely iterative algebras and completely iterative monads. Inform. Comput. 196 (2005) 1–41. CrossRef
R. Montague, Well-founded relations; generalizations of principles of induction and recursion (abstract). Bull. Amer. Math. Soc. 61 (1955) 442.
G. Osius, Categorical set theory: a characterization of the category of sets. J. Pure Appl. Algebra  4 (1974) 79–119. CrossRef
Rutten, J., Universal coalgebra, a theory of systems. Theoret. Comput. Sci. 249 (2000) 3–80.
P. Taylor, Practical Foundations of Mathematics. Cambridge University Press (1999).
V. Trnková, On a descriptive classification of set-functors I. Comment. Math. Univ. Carolin. 12 (1971) 143–174.