{"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}
引用次数: 25
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.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
