2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)最新文献

Separation for dot-depth two 分离为点深度二

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.46298/lmcs-17(3:24)2021

Thomas Place, M. Zeitoun

引用次数: 24

An interpretation of system F through bar recursion 用棒状递归解释系统F

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.1109/LICS.2017.8005066

Valentin Blot

{"title":"An interpretation of system F through bar recursion","authors":"Valentin Blot","doi":"10.1109/LICS.2017.8005066","DOIUrl":"https://doi.org/10.1109/LICS.2017.8005066","url":null,"abstract":"There are two possible computational interpretations of second-order arithmetic: Girard's system F or Spector's bar recursion and its variants. While the logic is the same, the programs obtained from these two interpretations have a fundamentally different computational behavior and their relationship is not well understood. We make a step towards a comparison by defining the first translation of system F into a simply-typed total language with a variant of bar recursion. This translation relies on a realizability interpretation of second-order arithmetic. Due to Gödel's incompleteness theorem there is no proof of termination of system F within second-order arithmetic. However, for each individual term of system F there is a proof in second-order arithmetic that it terminates, with its realizability interpretation providing a bound on the number of reduction steps to reach a normal form. Using this bound, we compute the normal form through primitive recursion. Moreover, since the normalization proof of system F proceeds by induction on typing derivations, the translation is compositional. The flexibility of our method opens the possibility of getting a more direct translation that will provide an alternative approach to the study of polymorphism, namely through bar recursion.","PeriodicalId":313950,"journal":{"name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129785411","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}

引用次数: 5

Infinitary intersection types as sequences: A new answer to Klop's problem 作为序列的无穷交型:对Klop问题的新解答

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.1109/LICS.2017.8005103

Pierre Vial

引用次数: 13

The clocks are ticking: No more delays! 时间紧迫:不要再耽搁了!

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.1109/LICS.2017.8005097

P. Bahr, Hans Bugge Grathwohl, Rasmus Ejlers Møgelberg

引用次数: 38

Logics for continuous reachability in Petri nets and vector addition systems with states Petri网和有状态的向量加法系统的连续可达性逻辑

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.1109/LICS.2017.8005068

Michael Blondin, C. Haase

引用次数: 16

Quantitative semantics of the lambda calculus: Some generalisations of the relational model lambda演算的数量语义:关系模型的一些概括

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.1109/LICS.2017.8005064

C. Ong

引用次数: 21

Typability in bounded dimension 有界维度的可Typability

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.1109/LICS.2017.8005127

Andrej Dudenhefner, J. Rehof

引用次数: 10

Capturing polynomial time using Modular Decomposition 使用模分解捕获多项式时间

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.23638/LMCS-15(1:24)2019

Berit Grußien

{"title":"Capturing polynomial time using Modular Decomposition","authors":"Berit Grußien","doi":"10.23638/LMCS-15(1:24)2019","DOIUrl":"https://doi.org/10.23638/LMCS-15(1:24)2019","url":null,"abstract":"The question of whether there is a logic that captures polynomial time is one of the main open problems in descriptive complexity theory and database theory. In 2010 Grohe showed that fixed point logic with counting captures polynomial time on all classes of graphs with excluded minors. We now consider classes of graphs with excluded induced subgraphs. For such graph classes, an effective graph decomposition, called modular decomposition, was introduced by Gallai in 1976. The graphs that are non-decomposable with respect to modular decomposition are called prime. We present a tool, the Modular Decomposition Theorem, that reduces (definable) canonization of a graph class C to (definable) canonization of the class of prime graphs of C that are colored with binary relations on a linearly ordered set. By an application of the Modular Decomposition Theorem, we show that fixed point logic with counting also captures polynomial time on the class of permutation graphs. As a side effect of the Modular Decomposition Theorem, we further obtain that the modular decomposition tree is computable in logarithmic space. It follows that cograph recognition and cograph canonization is computable in logarithmic space.","PeriodicalId":313950,"journal":{"name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123888532","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

The Weisfeiler-Leman dimension of planar graphs is at most 3 平面图的Weisfeiler-Leman维数最多为3

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.1145/3333003

Sandra Kiefer, I. Ponomarenko, Pascal Schweitzer

引用次数: 54

First-order logic with counting 带计数的一阶逻辑

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.1109/LICS.2017.8005133

D. Kuske, Nicole Schweikardt

引用次数: 24