Journal of South China University of Technology(Natural Science Edition) ›› 2012, Vol. 40 ›› Issue (9): 62-68.

• Computer Science & Technology • Previous Articles     Next Articles

Generalised Coiteration and Its Calculation Laws

Su Jin-dian1  Yu Shan-shan2   

  1. 1. School of Computer Science and Engineering,South China University of Technology,Guangzhou 510006,Guangdong,China; 2. School of Information Science and Technology,Sun Yet-Sen University,Guangzhou 510275,Guangdong,China
  • Received:2012-05-07 Revised:2012-06-05 Online:2012-09-25 Published:2012-08-01
  • Contact: 苏锦钿(1980-) ，男，博士，讲师，主要从事形式化方法、形式语义、构件技术、共代数与双代数研究． E-mail:SuJD@scut.edu.cn
  • About author:苏锦钿(1980-) ，男，博士，讲师，主要从事形式化方法、形式语义、构件技术、共代数与双代数研究．
  • Supported by:

    国家自然科学基金资助项目( 61103039) ; 高等学校博士学科点专项科研基金资助项目( 20100172120043) ; 华南理工大学中央高校基本科研业务费专项资金资助项目( 2009ZM0158)

PDF

881

Abstract:

Due to a lack of general descriptions of various corecursion operations defined on coinductive data types in functional programming,gunfold,a definition of generalised coiteration for coinductive data types,is proposed based on Monads and its distributive laws on coalgebraic functors. It is proved that gunfold can offer a general and abstract description of the coiteration,the primitive corecursion and the course-of-value coiteration. Based on the proof,the properties and the relevant calculation laws for gunfold are analyzed from the viewpoint of the category theory.

Key words: functional programming, coinductive data type, final coalgebra, corecursion, Monads, category theory

CLC Number: