期刊文献+

归纳数据类型的范畴论方法 被引量:1

Category Theoretical Method of Inductive Data Types
下载PDF
导出
摘要 归纳数据类型是类型论研究的重要分支,传统的数理逻辑或代数方法侧重于描述归纳数据类型的有限语法构造,在语义性质与归纳规则的分析与设计方面存在一定的不足。基于范畴论的方法,在集合范畴的框架内给出谓词的形式化定义,分析谓词范畴与代数范畴的构成与性质,并探讨集合范畴上自函子到谓词范畴上自函子的提升,最后利用伴随函子及其伴随性质深入分析了归纳数据类型具有普适意义的归纳规则。 Inductive data types are important research branch of type theory, and traditional methods including mathe- matical logic and algebra focus on describing finite syntax construction for inductive data types, resulting in some defi- ciencies for analyzing and designing semantics properties and inductive rules. This paper provided formal definition of predicate in the framework of set category by category theoretical methods, analyzed the construction and properties of predicate category and algebra category,and probed lifting of endofunctors from set category to predicate category, and at last deeply researched universal inductive rules of inductive data types by adjoint functor and its adjoint properties.
出处 《计算机科学》 CSCD 北大核心 2015年第6期8-11,共4页 Computer Science
基金 国家自然科学基金项目(61103038) 广东省自然科学基金项目(S2013010015944 2012A010701011) 韶关市科技计划项目(2013CX/K61)资助
关键词 归纳数据类型 范畴论 谓词范畴 提升 伴随函子 Inductive data types Category theory Predicate category Lift Adjoint functor
  • 相关文献

参考文献24

  • 1Rutten J J M M, Turi D. Initial algebra and final coalgebra se- mantics for concurrency[M]//A Decade of Concurrency Reflec- tions and Perspectives. 1993 : 530-582.
  • 2Rutten J J M M. Universal coalgebra: a theory of systems[J]. Theoretical Computer Science, 2000,249 (1) : 3-80.
  • 3苗德成,奚建清,贾连印,刘勇.一种形式语言代数模型[J].华南理工大学学报(自然科学版),2011,39(10):74-78. 被引量:8
  • 4Bird R. Introduction to functional programming using Haskell (2nd Edition)[M]. Prentice-Hall, UK, 1998 : 15-47.
  • 5Bird R S, Moor O D. Algebra of Programming [M]. Prentice- Hall, UK, 1997 : 107-156.
  • 6Hutton G. Fold and unfold for program semantics[C]//Proc, of the 3nd ACM SIGPLAN Int. Conf. on Functional Programming, 1998. NewYork: ACM, 1998 : 280-288.
  • 7苏锦钿,余珊珊.抽象数据类型的双代数结构及其计算[J].计算机研究与发展,2012,49(8):1787-1803. 被引量:10
  • 8Barr M, Wells C. Category theory for computing science[M]. NewYork: Prentice-Hall, 1990 : 14-t6.
  • 9Hermida C, Jacobs B. Structural induction and coinduction in a fibrational setting[J]. Information and Computation, 1998, 145 (2):107-152.
  • 10Ghani N,Johann P, Fumex C. Fibrational induction rules for ini- tial algebras[C]//Proceedings, Computer Science Logic. 2010: 336-350.

二级参考文献53

  • 1李未.数理逻辑基本原理与形式演算[M].北京:科学出版社,2007.
  • 2Floyd R W. Assigning meaning to programs [ J ]. Procee- dings of Symposium in Applied Mathematics, 1967, 19: 19-32.
  • 3Hoare C A R. An axiomatic basis for computer program- ming [J]. Communication of the ACM, 1969, 12 (10) : 576-580.
  • 4Manna Z, Waldinger R. Special relations in automated de- duction [ J]. Journal of the ACM, 1986,33 ( 1 ) : 1-59.
  • 5Dijkstra E W. The humble programmer [ J]. Communica- tion of the ACM, 1972,15 (10) : 859- 866.
  • 6Bjorner D, Jones B. The vienna development method:the meta-language [ M ]. London : Springer-Verlag, 1978 : 218- 277.
  • 7Boniolog D, Agostino M D, Di Fiore P P. Zsyntax : a formal language for molecular biology with projected applications in text mining and biological prediction [ J ]. Public Li- brary of Science ONE ,2010,5 ( 3 ) : 1-12.
  • 8Scan P, Yan Z. A tbrmal language for specifying complex XML authorizations with temporal constraints [ C ]//Pro- ceedings of the 5th Intemational Conference on Informa- tion Security and Cryptology. Berlin/Heidelberg:Springer- Verlag,2010:443-457.
  • 9Wegner P. The vienna definition language [ J ]. Journal of ACM Computing Surveys, 1972,4( 1 ) :5-63.
  • 10Broy M. On the algebraic definiation of programming lan- guage [ J ]. ACM Transactions on Programming Language and Systems, 1987,9( 1 ) :54-99.

共引文献17

同被引文献5

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部