2012 27th Annual IEEE Symposium on Logic in Computer Science最新文献_第3页

On Building Constructive Formal Theories of Computation Noting the Roles of Turing, Church, and Brouwer 论构建计算的构造形式理论——注意图灵、丘奇和布劳威尔的作用

2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.9

R. Constable

{"title":"On Building Constructive Formal Theories of Computation Noting the Roles of Turing, Church, and Brouwer","authors":"R. Constable","doi":"10.1109/LICS.2012.9","DOIUrl":"https://doi.org/10.1109/LICS.2012.9","url":null,"abstract":"In this article I will examine a few key concepts and design decisions that account for the high value of implemented constructive type theories in computer science. I'll stress the historical fact that these theories, and the proof assistants that animate them, were born from a strong partnership linking computer science, logic, and mathematics. I will recall how modern type theory researchers built on deep insights from the earliest pioneers: Turing - the first computer scientist, Church - the patriarch of logic in computer science, and Brouwer - a singular pioneer of intuitionism and constructive mathematics. They created solid intellectual ground on which to build a formal implemented constructive theory of computation whose influence will be felt well beyond computing and information science alone. All generations of constructive type theory researchers since this beginning have had leaders from all three disciplines. Much of the seminal modern work creating these type theories and their proof assistants was presented in LICS proceedings, and LICS could be a natural home for future work in this flourishing area which is the epitome of logic in computer science.","PeriodicalId":407972,"journal":{"name":"2012 27th Annual IEEE Symposium on Logic in Computer Science","volume":"384 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122709952","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}

引用次数: 4

Capsules and Separation 胶囊和分离

2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.52

Jean-Baptiste Jeannin, D. Kozen

引用次数: 4

Privacy, Anonymity, and Accountability in Ad-Supported Services 广告支持服务中的隐私、匿名和责任

2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.10

J. Feigenbaum

引用次数: 1

A Computational Interpretation of Parametricity 参数化的计算解释

2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.25

Jean-Philippe Bernardy, Guilhem Moulin

引用次数: 35

Extending Type Theory with Forcing 用强制法扩展类型理论

2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.49

Guilhem Jaber, Nicolas Tabareau, Matthieu Sozeau

引用次数: 31

The Complete Proof Theory of Hybrid Systems 混合系统的完全证明理论

2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.64

André Platzer

引用次数: 133

First-Order and Monadic Second-Order Model-Checking on Ordered Structures 有序结构的一阶和一元二阶模型检验

2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.38

Viktor Engelmann, S. Kreutzer, S. Siebertz

{"title":"First-Order and Monadic Second-Order Model-Checking on Ordered Structures","authors":"Viktor Engelmann, S. Kreutzer, S. Siebertz","doi":"10.1109/LICS.2012.38","DOIUrl":"https://doi.org/10.1109/LICS.2012.38","url":null,"abstract":"Model-checking for first- and monadic second-order logic in the context of graphs has received considerable attention in the literature. It is well-known that the problem of verifying whether a formula of these logics is true in a graph is computationally intractable but it does become tractable on interesting classes of graphs such as classes of bounded tree-width. In this paper we continue this line of research but study model checking for first- and monadic second-order logic in the presence of an ordering on the input structure. We do so in two settings: the general ordered case, where the input structures are equipped with a fixed order or successor relation, and the order invariant case, where the formulas may resort to an ordering but their truth must be independent of the particular choice of order. In the first setting we show very strong intractability results for most interesting classes of graphs. In contrast, in order invariant case we obtain tractability results for order invariant monadic second-order logic on the same classes of graphs as in the unordered case. For first-order logic, we obtain tractability of successor-invariant FO on planar graphs.","PeriodicalId":407972,"journal":{"name":"2012 27th Annual IEEE Symposium on Logic in Computer Science","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116017083","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}

引用次数: 14

Near Unanimity Constraints Have Bounded Pathwidth Duality 近一致约束具有有界路径宽度对偶性

2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.24

L. Barto, M. Kozik, R. Willard

引用次数: 31

Conservative Concurrency in Haskell Haskell中的保守并发

2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.66

David Sabel, M. Schmidt-Schauß

引用次数: 19

Functionals Using Bounded Information and the Dynamics of Algorithms 使用有界信息的函数和算法的动力学

2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.45

S. Grigorieff, Pierre Valarcher

引用次数: 1