一类证明无关命题的自由归一化

Log. Methods Comput. Sci. Pub Date : 2021-03-07 DOI:10.46298/lmcs-19(3:5)2023

T. Coquand

{"title":"一类证明无关命题的自由归一化","authors":"T. Coquand","doi":"10.46298/lmcs-19(3:5)2023","DOIUrl":null,"url":null,"abstract":"We show normalisation and decidability of convertibility for a type theory\nwith a hierarchy of universes and a proof irrelevant type of propositions,\nclose to the type system used in the proof assistant Lean. Contrary to previous\narguments, the proof does not require explicitly to introduce a notion of\nneutral and normal forms.","PeriodicalId":314387,"journal":{"name":"Log. Methods Comput. Sci.","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Reduction Free Normalisation for a proof irrelevant type of propositions\",\"authors\":\"T. Coquand\",\"doi\":\"10.46298/lmcs-19(3:5)2023\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show normalisation and decidability of convertibility for a type theory\\nwith a hierarchy of universes and a proof irrelevant type of propositions,\\nclose to the type system used in the proof assistant Lean. Contrary to previous\\narguments, the proof does not require explicitly to introduce a notion of\\nneutral and normal forms.\",\"PeriodicalId\":314387,\"journal\":{\"name\":\"Log. Methods Comput. Sci.\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Log. Methods Comput. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.46298/lmcs-19(3:5)2023\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Log. Methods Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46298/lmcs-19(3:5)2023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

我们展示了具有宇宙层次和证明无关类型命题的类型论的可转换性的归一化和可判决性，接近于证明辅助Lean中使用的类型系统。与前面的论证相反，这个证明不需要明确地引入中性和正规形式的概念。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Reduction Free Normalisation for a proof irrelevant type of propositions

We show normalisation and decidability of convertibility for a type theory with a hierarchy of universes and a proof irrelevant type of propositions, close to the type system used in the proof assistant Lean. Contrary to previous arguments, the proof does not require explicitly to introduce a notion of neutral and normal forms.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Log. Methods Comput. Sci.

自引率

0.00%

发文量