首页> 外文会议>International Symposium on Frontiers of Combining Systems >Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic
【24h】

Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic

机译:高阶逻辑的基础(CO)数据类型和(CO)递归

获取原文

摘要

We describe a line of work that started in 2011 towards enriching Isabelle/HOL's language with coinductive datatypes, which allow infinite values, and with a more expressive notion of inductive datatype than previously supported by any system based on higher-order logic. These (co)datatypes are complemented by definitional principles for (co)recursive functions and reasoning principles for (co)induction. In contrast with other systems offering codatatypes, no additional axioms or logic extensions are necessary with our approach.
机译:我们描述了2011年始于富裕的Isabelle / Hol的语言,允许具有无限值的Isabelle / HOL的语言,以及基于高阶逻辑的任何系统支持的归纳数据类型的更具表现力的概念。这些(CO)数据类型由(CO)递归函数和推理原则(CO)诱导的定义原则补充。与其他系统相比,我们的方法不需要额外的公理或逻辑扩展。

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号