收稿日期: 2013-07-16
修回日期: 2013-09-29
网络出版日期: 2013-12-01
基金资助
国家自然科学基金资助项目(61103038);高等学校博士学科点专项科研基金资助项目(20100172120043);华南理工大学中央高校基本科研业务费专项资金资助项目(2013ZZ0055)
Comonadic Corecursions on Strong Coinductive Data Types
Received date: 2013-07-16
Revised date: 2013-09-29
Online published: 2013-12-01
Supported by
国家自然科学基金资助项目(61103038);高等学校博士学科点专项科研基金资助项目(20100172120043);华南理工大学中央高校基本科研业务费专项资金资助项目(2013ZZ0055)
苏锦钿 余珊珊 . 强共归纳数据类型上的 Comonadic 共递归[J]. 华南理工大学学报(自然科学版), 2014 , 42(1) : 128 -134 . DOI: 10.3969/j.issn.1000-565X.2014.01.022
As the unfold on coinductive data types can not describe the corecursive functions with parameters,thefinal coalgebras on Cartesian closed category are proved to be strongly final,and a category- theoretical definition ofstrong coinductive data types as well as the corresponding corecursion with fixed parameters,which is called pun-fold,is proposed.As a result,the corecursion defined on coinductive data types may include extra parameters asthe input of calculation.Moreover,the comonadic corecursions based on comonads is used to give a unified de-scription for unfold and punfold,and various calculation laws for punfold are further analyzed.Thus,the researchesof Pardo on the recursions with parameters via Comonads are successfully extended to coinductive data types.
Key words: recursive functor; coinductive data type; final coalgebra; corecursion; comonads
/
| 〈 |
|
〉 |