首页> 外文会议>Typed lambda calculi and applications >A Type-Checking Algorithm for Martin-Loef Type Theory with Subtyping Based on Normalisation by Evaluation
【24h】

A Type-Checking Algorithm for Martin-Loef Type Theory with Subtyping Based on Normalisation by Evaluation

机译:基于评估归一化的Martin-Loef子类型理论的子类型检查算法

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

摘要

We present a core Martin-Loef type theory with subtyping; it has a cumulative hierarchy of universes and the contravariant rule for subtyping between dependent product types. We extend to this calculus the normalisation by evaluation technique defined for a variant of MLTT without subtyping. This normalisation function makes the subtyping relation and type-checking decidable. To our knowledge, this is the first time that the normalisation by evaluation technique has been considered in the context of subtypes, which introduce some subtleties in the proof of correctness of NbE; an important result to prove correctness and completeness of type-checking.
机译:我们提出了带有子类型的核心马丁·洛夫类型理论。它具有宇宙的累积层次结构以及从属产品类型之间子类型化的反变规则。我们将这种评估方法的扩展归一化,是通过为MLTT的一个变体定义的评估技术来实现的,而无需分型。此归一化功能可确定子类型关系和类型检查。据我们所知,这是第一次在亚型的背景下考虑通过评估技术进行归一化,这在证明NbE正确性方面引入了一些微妙之处。证明类型检查的正确性和完整性的重要结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号