发布求助
文献互助 智能选刊 最新文献

[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science最新文献

筛选
英文 中文
New foundations for the geometry of interaction 相互作用几何的新基础
[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science Pub Date : 1992-06-22 DOI: 10.1109/LICS.1992.185534
S. Abramsky, R. Jagadeesan
{"title":"New foundations for the geometry of interaction","authors":"S. Abramsky, R. Jagadeesan","doi":"10.1109/LICS.1992.185534","DOIUrl":"https://doi.org/10.1109/LICS.1992.185534","url":null,"abstract":"A new formal embodiment of J.-Y. Girard's (1989) geometry of interaction program is given. The geometry of interaction interpretation considered is defined, and the computational interpretation is sketched in terms of dataflow nets. Some examples that illustrate the key ideas underlying the interpretation are given. The results, which include the semantic analogue of cut-elimination, stated in terms of a finite convergence property, are outlined.<<ETX>>","PeriodicalId":6412,"journal":{"name":"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science","volume":"26 1","pages":"211-222"},"PeriodicalIF":0.0,"publicationDate":"1992-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87660218","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 138
Solving systems of set constraints 求解集合约束的方程组
[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science Pub Date : 1992-06-22 DOI: 10.1109/LICS.1992.185545
A. Aiken, E. Wimmers
{"title":"Solving systems of set constraints","authors":"A. Aiken, E. Wimmers","doi":"10.1109/LICS.1992.185545","DOIUrl":"https://doi.org/10.1109/LICS.1992.185545","url":null,"abstract":"It is shown that systems of set constraints that use all the standard set operations, especially unrestricted union and complement, can be solved. The centerpiece of the development is an algorithm that incrementally transforms a system of constraints while preserving the set of solutions. Eventually, either the system is shown to be inconsistent or all solutions can be exhibited. Most of the work is in proving that if this algorithm does not discover an inconsistency, then the system has a solution. This is done by showing that the system of constraints generated by the algorithm can be transformed into an equivalent set of equations that are guaranteed to have a solution. These equations are essentially tree automata.<<ETX>>","PeriodicalId":6412,"journal":{"name":"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science","volume":"111 1","pages":"329-340"},"PeriodicalIF":0.0,"publicationDate":"1992-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82886619","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 120
Subtype inequalities 子类型的不平等
[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science Pub Date : 1992-01-01 DOI: 10.1109/LICS.1992.185543
J. Tiuryn
{"title":"Subtype inequalities","authors":"J. Tiuryn","doi":"10.1109/LICS.1992.185543","DOIUrl":"https://doi.org/10.1109/LICS.1992.185543","url":null,"abstract":"The satisfiability problem for subtype inequalities in simple types is studied. The naive algorithm that solves this problem runs in nondeterministic exponential time for every predefined poset of atomic subtypings the satisfiability problem for subtype inequalities is PSPACE-hard. On the other hand, it is proved that if the poset of atomic subtypings is a disjoint union of lattices, then the satisfiability problem for subtype inequalities is solvable in PTIME. This result covers the important special case of the unification problem that can be obtained when the atomic subtype relation is equality.<<ETX>>","PeriodicalId":6412,"journal":{"name":"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science","volume":"8 1","pages":"308-315"},"PeriodicalIF":0.0,"publicationDate":"1992-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84384654","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 70
Functional parametricity 功能性parametricity
[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science Pub Date : 1992-01-01 DOI: 10.1109/LICS.1992.185555
P. Freyd, E. Robinson, G. Rosolini
{"title":"Functional parametricity","authors":"P. Freyd, E. Robinson, G. Rosolini","doi":"10.1109/LICS.1992.185555","DOIUrl":"https://doi.org/10.1109/LICS.1992.185555","url":null,"abstract":"The authors consider the idea of treating a parametrized type as an arbitrary functor from some parametrizing category to a category of types, and giving elements semantics as natural transformations. They show that under reasonable hypotheses this is only possible when the parametrizing category is a groupoid. This suggests a semantics for a semiparametric form of polymorphism. They discuss the interpretation of this form of parametricity in a PER model, and show that it coincides with the ostensibly stronger form derived from dinaturality.<<ETX>>","PeriodicalId":6412,"journal":{"name":"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science","volume":"29 1","pages":"444-452"},"PeriodicalIF":0.0,"publicationDate":"1992-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88484601","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信