Recursive coalgebras from comonads

Recursive coalgebras from comonads (2006)

by Venanzio Capretta , Tarmo Uustalu , Varmo Vene

Venue:	Inform. and Comput
Citations:	6 - 3 self

Datum	Value	Source
TITLE	Recursive coalgebras from comonads	INFERENCE
AUTHOR NAME	Venanzio Capretta	SVM HeaderParse 0.2
AUTHOR AFFIL	Dept. of Mathematics and Statistics, University of Ottawa; 585 King Edward Ave., Ottawa	SVM HeaderParse 0.2
AUTHOR ADDR	ON, K1N 6N5, Canada	SVM HeaderParse 0.2
AUTHOR NAME	Tarmo Uustalu	SVM HeaderParse 0.2
AUTHOR AFFIL	Institute of Cybernetics at Tallinn University of Technology	SVM HeaderParse 0.2
AUTHOR ADDR	Akadeemia tee 21, EE-12618 Tallinn, Estonia	SVM HeaderParse 0.2
AUTHOR NAME	Varmo Vene	SVM HeaderParse 0.2
AUTHOR AFFIL	Dept. of Computer Science, University of Tartu	SVM HeaderParse 0.2
AUTHOR ADDR	J. Liivi 2, EE-50409 Tartu, Estonia	SVM HeaderParse 0.2
ABSTRACT	The concept of recursive coalgebra of a functor was introduced in the 1970s by Osius in his work on categorical set theory to discuss the relationship between wellfounded induction and recursively specified functions. In this paper, we motivate the use of recursive coalgebras as a paradigm of structured recursion in programming semantics, list some basic facts about recursive coalgebras and, centrally, give new conditions for the recursiveness of a coalgebra based on comonads, comonadcoalgebras and distributive laws of functors over comonads. We also present an alternative construction using countable products instead of cofree comonads.	SVM HeaderParse 0.2
YEAR	2006	INFERENCE
VENUE	Inform. and Comput	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	437--468	INFERENCE
CITATIONS	18 found	ParsCit 1.0