Towards Merging Recursion and Comonads

Towards Merging Recursion and Comonads (2000)

by Alberto Pardo

Citations:

8 - 2 self

Datum	Value	Source
TITLE	Universidad de la Rep'ublica	SVM HeaderParse 0.1
AUTHOR NAME	Alberto Pardo	SVM HeaderParse 0.1
ABSTRACT	Comonads are mathematical structures that account naturally for effects that derive from the context in which a program is executed. This paper reports ongoing work on the interaction between recursion and comonads. Two applications are shown that naturally lead to versions of a comonadic fold operator on the product comonad. Both versions capture functions that require extra arguments for their computation and are related with the notion of strong datatype. 1	SVM HeaderParse 0.1
CITATIONS	34 found	ParsCit 1.0