首页> 外文期刊>Theoretical computer science >Interfaces as functors, programs as coalgebras - A final coalgebra theorem in intensional type theory
【24h】

Interfaces as functors, programs as coalgebras - A final coalgebra theorem in intensional type theory

机译:作为函子的接口,作为余数的程序-内涵类型理论中的末余余数定理

获取原文
获取原文并翻译 | 示例
       

摘要

In [P. Hancock, A. Setzer, Interactive programs in dependent type theory, in: P. Clote, H. Schwichtenberg (Eds.), Proc. 14th Annu. Conf. of EACSL, CSL'00, Fischbau, Germany, 21-26 August 2000, Vol. 1862, Springer, Berlin, 2000, pp. 317-331, URL (citeseer.ist.psu.edu/article/hancock00interactive.html); P. Hancock, A. Setzer, Interactive programs and weakly final coalgebras in dependent type theory, in: L. Crosilla, P. Schuster (Eds.), From Sets and Types to Topology and Analysis. Towards Practicable Foundations for Constructive Mathematics, Oxford Logic Guides, Clarendon Press, 2005, URL 〈www.cs.swan.ac.uk/~csetzer/〉] Hancock and Setzer introduced rules to extend Martin-Lof's type theory in order to represent interactive programming. The rules essentially reflect the existence of weakly final coalgebras for a general form of polynomial functor. The standard rules of dependent type theory allow the definition of inductive types, which correspond to initial algebras. Coalgebraic types are not represented in a direct way. In this article we show the existence of final coalgebras in intensional type theory for these kind of functors, where we require uniqueness of identity proofs (UIP) for the set of states S and the set of commands C which determine the functor. We obtain the result by identifying programs which have essentially the same behaviour, viz. are bisimular. This proves the rules of Setzer and Hancock admissible in ordinary type theory, if we replace definitional equality by bisimulation. All proofs [M. Michel-brink, Verifications of final coalgebra theorem in: Interfaces as Functors, Programs as Coalgebras - A Final Coalgebra Theorem in Intensional Type Theory, 2005, URL 〈www.cs.swan.ac.uk/~csmichey〉] are verified in the theorem prover agda [C. Coquand, Agda, Internet, URL 〈www.cs.chalmers.se/~catarina/agda〉]; K. Peterson, A programming system for type theory, Technical Report, S-412 96, Chalmers University of Technology, Goteborg, 1982], which is based on intensional Martin-Lof type theory.
机译:在[P. Hancock,A. Setzer,“依赖类型理论中的交互程序”,载于:P. Clote,H。Schwichtenberg(编),Proc.Natl.Acad.Sci.USA,87:1877。 14日。 Conf。 EACSL,CSL'00,Fischbau,Germany,2000年8月21-26日,第1862年,施普林格,柏林,2000年,第317-331页,URL(citeseer.ist.psu.edu/article/hancock00interactive.html); P. Hancock,A. Setzer,从属类型理论中的交互式程序和弱最终结余,作者:L。Crosilla,P。Schuster(编),从集和类型到拓扑结构和分析。建立实用数学基础,牛津逻辑指南,克拉伦登出版社,2005,URL 〈www.cs.swan.ac.uk/~csetzer/〉]汉考克和塞泽尔介绍了扩展马丁·洛夫类型论的规则,以表示交互作用编程。这些规则实质上反映了多项式函子的一般形式的弱最终结余的存在。依赖类型理论的标准规则允许定义归纳类型,该归纳类型对应于初始代数。不能以直接的方式表示成煤类型。在本文中,我们证明了在这类类型的函子的强度类型理论中最终定理的存在,其中我们需要状态集S和确定函子的命令C的身份证明(UIP)的唯一性。我们通过识别本质上具有相同行为的程序来获得结果。是双模的。如果我们用双仿真代替定义等式,这证明了普通类型理论中Setzer和Hancock的规则是可接受的。所有证明[M. Michel-brink,“以接口为函子,以程序为煤代数-内涵类型理论中的最终煤代数定理,2005年,URL 〈www.cs.swan.ac.uk/~csmichey〉]中的最终恒等式定理的验证。定理证明者agda [C. Coquand,Agda,Internet,URL ]; K. Peterson,类型理论的编程系统,技术报告,S-412 96,查尔默斯工业大学,哥德堡,1982年],它基于内涵式马丁-洛夫类型理论。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号