多态分型学科中分型的表征

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

P. Giannini, S. D. Rocca

{"title":"多态分型学科中分型的表征","authors":"P. Giannini, S. D. Rocca","doi":"10.1109/LICS.1988.5101","DOIUrl":null,"url":null,"abstract":"Polymorphic type discipline for lambda -calculus is an extension of H.B. Curry's (1969) classical functionality theory, in which types can be universally quantified. An algorithm that, given a term M, builds a set of constraints, is satisfied. Moreover, all the typings for M (if any) are built from the set of constraints by substitutions. Using the set of constraints, some properties of polymorphic type discipline are proved.<<ETX>>","PeriodicalId":425186,"journal":{"name":"[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"69","resultStr":"{\"title\":\"Characterization of typings in polymorphic type discipline\",\"authors\":\"P. Giannini, S. D. Rocca\",\"doi\":\"10.1109/LICS.1988.5101\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Polymorphic type discipline for lambda -calculus is an extension of H.B. Curry's (1969) classical functionality theory, in which types can be universally quantified. An algorithm that, given a term M, builds a set of constraints, is satisfied. Moreover, all the typings for M (if any) are built from the set of constraints by substitutions. Using the set of constraints, some properties of polymorphic type discipline are proved.<<ETX>>\",\"PeriodicalId\":425186,\"journal\":{\"name\":\"[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science\",\"volume\":\"64 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"69\",\"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.5101\",\"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.5101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 69

摘要

λ微积分的多态类型学科是对H.B. Curry(1969)经典泛函理论的扩展，其中类型可以被普遍量化。一个算法，给定一个项M，建立一组约束，是满足的。此外，M的所有类型(如果有的话)都是通过替换从约束集构建的。利用约束集证明了多态类型学科的一些性质。

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

查看原文本刊更多论文

Characterization of typings in polymorphic type discipline

Polymorphic type discipline for lambda -calculus is an extension of H.B. Curry's (1969) classical functionality theory, in which types can be universally quantified. An algorithm that, given a term M, builds a set of constraints, is satisfied. Moreover, all the typings for M (if any) are built from the set of constraints by substitutions. Using the set of constraints, some properties of polymorphic type discipline are proved.<>

求助全文

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

来源期刊

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

自引率

0.00%

发文量