Induction, coinduction, and adjoints - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Electronic Notes in Theoretical Computer Science Année : 2003

Induction, coinduction, and adjoints

Résumé

We investigate the reasons for which the existence of certain right adjoints implies the existence of some final coalgebras, and vice-versa. In particular we prove and discuss the following theorem which has been partially available in the literature: let F G be a pair of adjoint functors, and suppose that an initial algebra F(X) of the functor H(Y) = X + F(Y) exists; then a right adjoint G(X) to F(X) exists if and only if a final coalgebra HG(X) of the functor K(Y) = X ×G(Y) exists. Motivated by the problem of understanding the structures that arise from initial algebras, we show the following: if F is a left adjoint with a certain commutativity property, then an initial algebra of H(Y) = X + F(Y) generates a subcategory of functors with inductive types where the functorial composition is constrained to be a Cartesian product.

Dates et versions

hal-01288863 , version 1 (15-03-2016)

Identifiants

Citer

Luigi Santocanale, Robin Cockett. Induction, coinduction, and adjoints. Electronic Notes in Theoretical Computer Science, 2003, 69, pp. 1--19. ⟨10.1016/S1571-0661(04)80561-9⟩. ⟨hal-01288863⟩
79 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More