Journal of South China University of Technology (Natural Science Edition) ›› 2014, Vol. 42 ›› Issue (7): 33-39,73.doi: 10.3969/j.issn.1000-565X.2014.07.006

• Computer Science & Technology • Previous Articles     Next Articles

Monadic Recursions with Fixed Parameters

Su Jin- dian1 Yu Shan- shan2   

  1. 1.School of Computer Science and Engineering,South China University of Technology,Guangzhou 510640,Guangdong,China;2.College of Medical Information Engineering,Guangdong Pharmaceutical University,Guangzhou 510006,Guangdong,China
  • Received:2014-03-14 Revised:2014-04-09 Online:2014-07-25 Published:2014-06-01
  • Contact: 苏锦钿(1980-)，男，博士，副教授，主要从事形式化方法、形式语义、构件技术、共代数与双代数研究． E-mail:SuJD@scut.edu.cn
  • About author:苏锦钿(1980-)，男，博士，副教授，主要从事形式化方法、形式语义、构件技术、共代数与双代数研究．
  • Supported by:

    国家自然科学基金资助项目(61103038);华南理工大学中央高校基本科研业务费专项资金资助项目(2013ZZ0055)

PDF

477

Abstract:

Aiming at the possible fixed parameters and computational side- effects of the recursive operations oninductive data types,the authors define the strong monadic inductive data type and presents proofs of strong monadicinitiality by combining the notions of monads in functional programming languages with the adjoint in the categorytheory.Furthermore,we propose a kind of recursion with fixed parameters and computational side- effects.It isproved that this kind of recursion can provide better abstraction and encapsulation in comparison with normal recur-sions.Meanwhile,we discuss the corresponding categorical properties and calculation laws.

Key words: recursion, inductive data type, initial algebra, monad, category theory, programming languages

CLC Number: