首页> 外文会议>International Conference on Computer Aided Systems Theory(EUROCAST 2005); 20050207-11; Las Palmas de Gran Canaria(ES) >On Recursive Functions and Well—Founded Relations in the Calculus of Constructions
【24h】

On Recursive Functions and Well—Founded Relations in the Calculus of Constructions

机译:关于构造演算中的递归函数和有根据的关系

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

摘要

This paper presents a reflection about function construction through well-founded recursion in the type theory known as Calculus of Inductive Constructions. It shows the expressive power of this calculus when dealing with concepts as accesibility and noetherianity among others. The properties of the General Recursion Scheme ([2]) and its relation with Structural Recursion in inductive types are analyzed. As a consequence, a methodology arises which is illustrated with some examples. We use the INRIA's compiler of the Calculus of Inductive Constructions: Coq.
机译:本文通过被称为归纳构造演算的类型理论中的有据可归的递归,对功能构造进行了反思。它显示了这种演算在处理诸如可访问性和无网络性等概念时的表达能力。分析了一般递归方案([2])的性质及其与归纳类型中结构递归的关系。结果,出现了用一些示例说明的方法。我们使用INRIA的归纳构造演算:Coq的编译器。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号