Martin-Lof类型理论中子集类型的强度

[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science Pub Date : 1988-07-05 DOI:10.1109/LICS.1988.5135

A. Salvesen, Jan M. Smith

{"title":"Martin-Lof类型理论中子集类型的强度","authors":"A. Salvesen, Jan M. Smith","doi":"10.1109/LICS.1988.5135","DOIUrl":null,"url":null,"abstract":"The authors show that the exact formulation of the rules of type theory is important for rules of subset type. It turns out that there are propositions involving subsets that are trivially true in naive set theory, but which cannot be proved in type theory. They examine the probability of a type proposition that is important when modularizing program derivations.<<ETX>>","PeriodicalId":425186,"journal":{"name":"[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"The strength of the subset type in Martin-Lof's type theory\",\"authors\":\"A. Salvesen, Jan M. Smith\",\"doi\":\"10.1109/LICS.1988.5135\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors show that the exact formulation of the rules of type theory is important for rules of subset type. It turns out that there are propositions involving subsets that are trivially true in naive set theory, but which cannot be proved in type theory. They examine the probability of a type proposition that is important when modularizing program derivations.<<ETX>>\",\"PeriodicalId\":425186,\"journal\":{\"name\":\"[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.1988.5135\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1988.5135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 25

摘要

作者证明了类型论规则的精确表述对于子集类型规则的重要性。事实证明，有些涉及子集的命题，在朴素集合论中是平凡为真的，但在类型论中却不能证明。他们检查类型命题的概率，这在模块化程序派生时很重要。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

The strength of the subset type in Martin-Lof's type theory

The authors show that the exact formulation of the rules of type theory is important for rules of subset type. It turns out that there are propositions involving subsets that are trivially true in naive set theory, but which cannot be proved in type theory. They examine the probability of a type proposition that is important when modularizing program derivations.<>

求助全文

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

来源期刊

[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science

自引率

0.00%

发文量

期刊最新文献

Petri nets are monoids: a new algebraic foundation for net theory Complete axiomatizations of the algebras of finite, rational and infinite trees Notational definition-a formal account A modal process logic A category of labelled Petri nets and compositional proof system