D. Caucal, On infinite transition graphs having a decidable monadic theory, Proc. 23rd International Colloquium on Automata, Languages and Programming, pp.194-205, 1996.

J. R. Cockett and L. Santocanale, Induction, Coinduction, and Adjoints, Electronic Notes in Theoretical Computer Science, vol.69, pp.101-119, 2003.
DOI : 10.1016/S1571-0661(04)80561-9
URL : https://hal.archives-ouvertes.fr/hal-01288863

W. Damm, The IO- and OI-hierarchies, Theoretical Computer Science, vol.20, issue.2, pp.95-207, 1982.
DOI : 10.1016/0304-3975(82)90009-3

J. Fortier, Puissance expressive des preuves circulaires, 2014.
URL : https://hal.archives-ouvertes.fr/tel-01154972

J. Fortier and L. Santocanale, Cuts for Circular Proofs: Semantics and Cut-Elimination, Computer Science Logic 2013 (CSL'13). LIPIcs, pp.248-262, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01260986

B. Jacobs and J. Rutten, A Tutorial on (Co)Algebras and (Co)Induction, EATCS Bulletin, vol.62, pp.62-222, 1997.

T. Knapik, D. Niwi´nskiniwi´nski, and P. Urzyczyn, Higher-Order Pushdown Trees Are Easy, FoSSaCS 2002, pp.205-222, 2002.
DOI : 10.1007/3-540-45931-6_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.5773

J. Lambek and P. J. Scott, Introduction to higher order categorical logic. Cambridge studies in advanced mathematics 7, 1986.

S. Maclane, Categories for the Working Mathematician, 1998.

R. Paré and L. Román, Monoidal categories with natural numbers object, Studia Logica, vol.37, issue.2, pp.361-376, 1989.
DOI : 10.1007/BF00370829

L. Santocanale, A Calculus of Circular Proofs and its Categorical Semantics, FoSSaCS 2002, pp.357-371, 2002.
URL : https://hal.archives-ouvertes.fr/hal-01261170