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

Proceedings 11th Annual IEEE Symposium on Logic in Computer Science最新文献

筛选
英文 中文
The subtyping problem for second-order types is undecidable 二阶类型的子类型问题是不可确定的
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561306
J. Tiuryn, P. Urzyczyn
{"title":"The subtyping problem for second-order types is undecidable","authors":"J. Tiuryn, P. Urzyczyn","doi":"10.1109/LICS.1996.561306","DOIUrl":"https://doi.org/10.1109/LICS.1996.561306","url":null,"abstract":"We prove that the subtyping problem induced by Mitchell's containment relation (1988) for second-order polymorphic types is undecidable. It follows that type-checking is undecidable for the polymorphic lambda-calculus extended by an appropriate subsumption rule.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117116518","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}
引用次数: 53
Subtyping dependent types 子类型依赖类型
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561307
David Aspinall, Adriana B. Compagnoni
{"title":"Subtyping dependent types","authors":"David Aspinall, Adriana B. Compagnoni","doi":"10.1109/LICS.1996.561307","DOIUrl":"https://doi.org/10.1109/LICS.1996.561307","url":null,"abstract":"The need for subtyping in type-systems with dependent types has been realized for some years. But it is hard to prove that systems combining the two features have fundamental properties such as subject reduction. Here we investigate a subtyping extension of the system /spl lambda/P, which is an abstract version of the type system of the Edinburgh Logical Framework LF. By using an equivalent formulation, we establish some important properties of the new system /spl lambda/P/sub /spl les//, including subject reduction. Our analysis culminates in a complete and terminating algorithm which establishes the decidability of type-checking.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114161794","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}
引用次数: 112
The Scott topology induces the weak topology Scott拓扑推导出弱拓扑
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561450
A. Edalat
{"title":"The Scott topology induces the weak topology","authors":"A. Edalat","doi":"10.1109/LICS.1996.561450","DOIUrl":"https://doi.org/10.1109/LICS.1996.561450","url":null,"abstract":"Given a probability measure on a compact metric space, we construct an increasing chain of valuations on the upper space of the metric space whose least upper bound is the measure. We then obtain the expected value of any Holder continuous function with respect to the measure up to any precision. We prove that the Scott topology induces the weak topology of the space of probability measures in the following general setting: Whenever a separable metric space is embedded into a subset of the maximal elements of an /spl omega/-continuous dcpo, which is a G/sub /spl delta// subset of the dcpo equipped with the Scott topology, we show that the space of probability measures of the metric space equipped with the weak topology is then embedded into a subspace of the maximal elements of the probabilistic power domain of the dcpo. We present a novel application in the theory of periodic doubling route to chaos.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117274098","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}
引用次数: 20
Efficient model checking via the equational /spl mu/-calculus 通过方程/spl mu/-演算进行有效的模型检查
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561358
Girish Bhat, R. Cleaveland
{"title":"Efficient model checking via the equational /spl mu/-calculus","authors":"Girish Bhat, R. Cleaveland","doi":"10.1109/LICS.1996.561358","DOIUrl":"https://doi.org/10.1109/LICS.1996.561358","url":null,"abstract":"This paper studies the use of an equational variant of the modal /spl mu/-calculus as a unified framework for efficient temporal logic model checking. In particular we show how an expressive temporal logic, CTL*, may be efficiently translated into the /spl mu/-calculus. Using this translation, one may then employ /spl mu/-calculus model-checking techniques, including on-the-fly procedures, BDD-based algorithms and compositional model-checking approaches, to determine if systems satisfy formulas in CTL*.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129880109","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}
引用次数: 55
Higher dimensional transition systems 高维转换系统
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561303
Gian Luca Cattani, V. Sassone
{"title":"Higher dimensional transition systems","authors":"Gian Luca Cattani, V. Sassone","doi":"10.1109/LICS.1996.561303","DOIUrl":"https://doi.org/10.1109/LICS.1996.561303","url":null,"abstract":"We introduce the notion of higher dimensional transition systems as a model of concurrency providing an elementary, set-theoretic formalisation of the idea of higher dimensional transition. We show an embedding of the category of higher dimensional transition systems into that of higher dimensional automata which cuts down to an equivalence when we restrict to non-degenerate automata. Moreover, we prove that the natural notion of bisimulation for such structures is a generalisation of the strong history preserving bisimulation, and provide an abstract categorical account of it via open maps. Finally, we define a notion of unfolding for higher dimensional transition systems and characterise the structures so obtained as a generalisation of event structures.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125609542","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}
引用次数: 65
Decision problems for semi-Thue systems with a few rules 具有少量规则的半图系统的决策问题
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561469
Y. Matiyasevich, Géraud Sénizergues
{"title":"Decision problems for semi-Thue systems with a few rules","authors":"Y. Matiyasevich, Géraud Sénizergues","doi":"10.1109/LICS.1996.561469","DOIUrl":"https://doi.org/10.1109/LICS.1996.561469","url":null,"abstract":"For several decision problems about semi-Thue systems, we try to locate the frontier between the decidable and the undecidable from the point of view of the number of rules. We show that the the Termination Problem, the U-Termination Problem, the Accessibility Problem and the Common-Descendant Problem are undecidable for 3 rules semi-Thue systems. As a corollary we obtain the undecidability of the Post-Correspondence Problem for 7 pairs of words.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127617821","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}
引用次数: 145
A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations 经典证明的语义学观点:类型论、范畴论和指称性表征
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561323
C. Ong
{"title":"A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations","authors":"C. Ong","doi":"10.1109/LICS.1996.561323","DOIUrl":"https://doi.org/10.1109/LICS.1996.561323","url":null,"abstract":"Classical logic is one of the best examples of a mathematical theory that is truly useful to computer science. Hardware and software engineers apply the theory routinely. Yet from a foundational standpoint, there are aspects of classical logic that are problematic. Unlike intuitionistic logic, classical logic is often held to be non-constructive, and so, is said to admit no proof semantics. To draw an analogy in the proofs-as-programs paradigm, it is as if we understand well the theory of manipulation between equivalent specifications (which we do), but have comparatively little foundational insight of the process of transforming one program to another that implements the same specification. This extended abstract outlines a semantic theory of classical proofs based on a variant of Parigot's /spl lambda//spl mu/-calculus, but presented here as a type theory. After reviewing the conceptual problems in the area and the potential benefits of such a theory, we sketch the key steps of our approach in terms of the questions that we have sought to answer: Syntax: How should one circumscribe a coherent system of classical proofs? Is there a satisfactory Curry-Howard style representation theory? Categorical characterization: What is the \"boolean algebra\" of classical propositional proofs (as opposed to validity)? What manner of categories characterizes classical proofs the same way that cartesian closed categories capture intuitionistic propositional proofs? Complete denotational models: Are there good intensional game models of classical logic canonical for the circumscribed proofs?.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126998375","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}
引用次数: 76
Zero-one laws for Gilbert random graphs 吉尔伯特随机图的零一定律
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561448
G. McColm
{"title":"Zero-one laws for Gilbert random graphs","authors":"G. McColm","doi":"10.1109/LICS.1996.561448","DOIUrl":"https://doi.org/10.1109/LICS.1996.561448","url":null,"abstract":"We look at a competitor of the Erdos-Renyi models of random graphs, one proposed by E. Gilbert (1961): given /spl delta/>0 and a metric space X of diameter >/spl delta/, scatter n vertices at random on X and connect those of distance </spl delta/ apart: we get a random graph G/sub n,/spl delta///sup X/. Question: for fixed X, /spl delta/, do we have 0-1 laws for FO logic? We prove that this is true if X is a circle.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132442927","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}
引用次数: 3
Games and full abstraction for FPC 游戏和完整的FPC抽象
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561316
G. McCusker
{"title":"Games and full abstraction for FPC","authors":"G. McCusker","doi":"10.1109/LICS.1996.561316","DOIUrl":"https://doi.org/10.1109/LICS.1996.561316","url":null,"abstract":"We present a new category of games, /spl Gscr/, and build from it a cartesian closed category I and its extensional quotient /spl epsi/. /spl epsi/ represents an improvement over existing categories of games in that it has sums as well as products, function spaces and recursive types. A model of the language FPC, a sequential functional language with just this type structure, in /spl epsi/ is described and shown to be fully abstract.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131506656","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}
引用次数: 83
Reasoning about local variables with operationally-based logical relations 使用基于操作的逻辑关系对局部变量进行推理
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561314
A. Pitts
{"title":"Reasoning about local variables with operationally-based logical relations","authors":"A. Pitts","doi":"10.1109/LICS.1996.561314","DOIUrl":"https://doi.org/10.1109/LICS.1996.561314","url":null,"abstract":"A parametric logical relation between the phrases of an Algol-like language is presented. Its definition involves the structural operational semantics of the language, but was inspired by recent denotationally-based work of O'Hearn and Reynolds on translating Algol into a predicatively polymorphic linear lambda calculus. The logical relation yields an applicative characterisation of contextual equivalence for the language and provides a useful (and complete) method for proving equivalences. Its utility is illustrated by giving simple and direct proofs of some contextual equivalences, including an interesting equivalence due to O'Hearn which hinges upon the undefinability of 'snapback' operations (and which goes beyond the standard suite of 'Meyer-Sieber' examples). Whilst some of the mathematical intricacies of denotational semantics are avoided, the hard work in this operational approach lies in establishing the 'fundamental property' for the logical relation-the proof of which makes use of a compactness property of fixpoint recursion with respect to evaluation of phrases. But once this property has been established, the logical relation provides a verification method with an attractively low mathematical overhead.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134044656","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}
引用次数: 53
下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信