Normalisation by Evaluation for Dependent Types

Thorsten Altenkirch, A. Kaposi
{"title":"Normalisation by Evaluation for Dependent Types","authors":"Thorsten Altenkirch, A. Kaposi","doi":"10.4230/LIPIcs.FSCD.2016.6","DOIUrl":null,"url":null,"abstract":"We develop normalisation by evaluation (NBE) for dependent types based \non presheaf categories. Our construction is formulated using internal \ntype theory using quotient inductive types. We use a typed \npresentation hence there are no preterms or realizers in our \nconstruction. NBE for simple types is using a logical relation between \nthe syntax and the presheaf interpretation. In our construction, we \nmerge the presheaf interpretation and the logical relation into a \nproof-relevant logical predicate. We have formalized parts of the \nconstruction in Agda.","PeriodicalId":284975,"journal":{"name":"International Conference on Formal Structures for Computation and Deduction","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Formal Structures for Computation and Deduction","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/LIPIcs.FSCD.2016.6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21

Abstract

We develop normalisation by evaluation (NBE) for dependent types based on presheaf categories. Our construction is formulated using internal type theory using quotient inductive types. We use a typed presentation hence there are no preterms or realizers in our construction. NBE for simple types is using a logical relation between the syntax and the presheaf interpretation. In our construction, we merge the presheaf interpretation and the logical relation into a proof-relevant logical predicate. We have formalized parts of the construction in Agda.
依赖类型的求值规范化
我们开发了基于预表类别的依赖类型的评估规范化(NBE)。我们的构造是使用商归纳类型的内部类型理论来表述的。我们使用类型化表示,因此在我们的构造中没有预先条件或实现器。简单类型的NBE使用语法和预表解释之间的逻辑关系。在我们的构造中,我们将预表解释和逻辑关系合并为一个证明相关的逻辑谓词。我们已经在《议程》中正式确定了部分建设。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信