This paper is a contribution to the foundations of coinductive types and coiterative functions, in (Hyper)set-theoretical Categories, in terms of coalgebras. We consider atoms as first class citizens. First of all, we give a sharpening, in the way of cardinality, of Aczel's Special Final Coalgebra Theorem, which allows for good estimates of the cardinality of the final coalgebra. To these end, we introduce the notion of k-Y -uniform functor, which subsumes Aczel's original notion. We give also an n-ary version of it, and we show that the resulting class of functors is closed under many interesting operations used in Final Semantics. We define also canonical wellfounded versions of the final coalgebras of functors uniform on maps. This leads to a reduction of coiteration to ordinal induction, giving a possible answer to a question raised by Moss and Danner. Finally, we introduce a generalization of the notion of F-bisimulation inspired by Aczel's notion of precongruence, and we show that it allows to extend the theory of categorical bisimulations also to functors non-weakly preserving pullbacks. Examples, non-examples, and open questions are frequent in the paper.

Coalgebraic Coinduction in (Hyper)set-theoretic Categories

HONSELL, Furio;LENISA, Marina
2000-01-01

Abstract

This paper is a contribution to the foundations of coinductive types and coiterative functions, in (Hyper)set-theoretical Categories, in terms of coalgebras. We consider atoms as first class citizens. First of all, we give a sharpening, in the way of cardinality, of Aczel's Special Final Coalgebra Theorem, which allows for good estimates of the cardinality of the final coalgebra. To these end, we introduce the notion of k-Y -uniform functor, which subsumes Aczel's original notion. We give also an n-ary version of it, and we show that the resulting class of functors is closed under many interesting operations used in Final Semantics. We define also canonical wellfounded versions of the final coalgebras of functors uniform on maps. This leads to a reduction of coiteration to ordinal induction, giving a possible answer to a question raised by Moss and Danner. Finally, we introduce a generalization of the notion of F-bisimulation inspired by Aczel's notion of precongruence, and we show that it allows to extend the theory of categorical bisimulations also to functors non-weakly preserving pullbacks. Examples, non-examples, and open questions are frequent in the paper.
File in questo prodotto:
File Dimensione Formato  
hyper.pdf

non disponibili

Tipologia: Documento in Post-print
Licenza: Non pubblico
Dimensione 1.48 MB
Formato Adobe PDF
1.48 MB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11390/735524
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? ND
social impact