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

2012 27th Annual IEEE Symposium on Logic in Computer Science最新文献

筛选
英文 中文
Term rewriting and lambda calculus 项重写和微积分
2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.12
J. Klop
{"title":"Term rewriting and lambda calculus","authors":"J. Klop","doi":"10.1109/LICS.2012.12","DOIUrl":"https://doi.org/10.1109/LICS.2012.12","url":null,"abstract":"This tutorial will cover the following topics: (i) The origins of term rewriting systems and λ -calculus. (ii) Rewriting lingo: the basic vocabulary about confluence and termination. (iii) Newman’s Lemma, tiling games, and decreasing diagrams. (iv) Word rewriting: the free idempotent monoid; braids. (v) Term rewriting: some universal algebra; braids revisited; how hidden functions may help. Modularity: divide et impera. RPO revisited: ILPO, iterative lexicographic path ordering. (vi) Rewrite, rewrite, rewrite, rewrite, rewrite, rewrite, rewrite, rewrite, rewrite, rewrite, infinitary TRSs; Cauchy convergence versus strong convergence; a coinductive definition; loops make the difference. (vii) Orthogonal iTRSs: collapsing rules cause non-confluence; equivalence of global infinitary weak and strong normalization WN∞ ⇐⇒ SN∞; continuity of infinitary rewriting ; breakdown of properties for weakly orthogonal iTRSs. (viii) Infinitary lambda calculus λ ∞-calculus; subsumption of Scott’s Induction Rule SIR; Lego blocks for new fixed point combinators; the threefold path; looping λ -terms; clocked semantics of λ -calculus. (ix) παντα ρει : Streams and productivity. 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science","PeriodicalId":407972,"journal":{"name":"2012 27th Annual IEEE Symposium on Logic in Computer Science","volume":"1 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":"115721199","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
Coproducts of Monads on Set 集合上单元的余积
2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.16
J. Adámek, Stefan Milius, N. Bowler, P. Levy
{"title":"Coproducts of Monads on Set","authors":"J. Adámek, Stefan Milius, N. Bowler, P. Levy","doi":"10.1109/LICS.2012.16","DOIUrl":"https://doi.org/10.1109/LICS.2012.16","url":null,"abstract":"Coproducts of monads on Set have arisen in both the study of computational effects and universal algebra. We describe coproducts of consistent monads on Set by an initial algebra formula, and prove also the converse: if the coproduct exists, so do the required initial algebras. That formula was, in the case of ideal monads, also used by Ghani and Uustalu. We deduce that coproduct embeddings of consistent monads are injective; and that a coproduct of injective monad morphisms is injective. Two consistent monads have a coproduct iff either they have arbitrarily large common fixpoints, or one is an exception monad, possibly modified to preserve the empty set. Hence a consistent monad has a coproduct with every monad iff it is an exception monad, possibly modified to preserve the empty set. We also show other fixpoint results, including that a functor (not constant on nonempty sets) is finitary iff every sufficiently large cardinal is a fixpoint.","PeriodicalId":407972,"journal":{"name":"2012 27th Annual IEEE Symposium on Logic in Computer Science","volume":"12 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":"115910505","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}
引用次数: 19
Game Semantics in String Diagrams 字符串图中的游戏语义
2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.58
Paul-André Melliès
{"title":"Game Semantics in String Diagrams","authors":"Paul-André Melliès","doi":"10.1109/LICS.2012.58","DOIUrl":"https://doi.org/10.1109/LICS.2012.58","url":null,"abstract":"A dialogue category is a symmetric monoidal category equipped with a notion of tensorial negation. We establish that the free dialogue category is a category of dialogue games and total innocent strategies. The connection clarifies the algebraic and logical nature of dialogue games, and their intrinsic connection to linear continuations. The proof of the statement is based on an algebraic presentation of dialogue categories inspired by knot theory, and a factorization theorem established by rewriting techniques.","PeriodicalId":407972,"journal":{"name":"2012 27th Annual IEEE Symposium on Logic in Computer Science","volume":"1 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":"130203102","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
Induction in Algebra: A First Case Study 代数中的归纳法:第一个案例研究
2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.68
P. Schuster
{"title":"Induction in Algebra: A First Case Study","authors":"P. Schuster","doi":"10.1109/LICS.2012.68","DOIUrl":"https://doi.org/10.1109/LICS.2012.68","url":null,"abstract":"Many a concrete theorem of abstract algebra admits a short and elegant proof by contradiction but with Zorn's Lemma (ZL). A few of these theorems have recently turned out to follow in a direct and elementary way from the Principle of Open Induction distinguished by Raoult. The ideal objects characteristic of any invocation of ZL are eliminated, and it is made possible to pass from classical to intuitionistic logic. If the theorem has finite input data, then a finite partial order carries the required instance of induction, which thus is constructively provable. A typical example is the well-known theorem \"every nonconstant coefficient of an invertible polynomial is nilpotent\".","PeriodicalId":407972,"journal":{"name":"2012 27th Annual IEEE Symposium on Logic in Computer Science","volume":"44 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":"127918266","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}
引用次数: 29
An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus 与全λ -微积分同构的无穷仿射λ -微积分
2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.57
Damiano Mazza
{"title":"An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus","authors":"Damiano Mazza","doi":"10.1109/LICS.2012.57","DOIUrl":"https://doi.org/10.1109/LICS.2012.57","url":null,"abstract":"It is well known that the real numbers arise from the metric completion of the rational numbers, with the metric induced by the usual absolute value. We seek a computational version of this phenomenon, with the idea that the role of the rationals should be played by the affine lambda-calculus, whose dynamics is finitary; the full lambda-calculus should then appear as a suitable metric completion of the affine lambda-calculus. This paper proposes a technical realization of this idea: an affine lambda-calculus is introduced, based on a fragment of intuitionistic multiplicative linear logic; the calculus is endowed with a notion of distance making the set of terms an incomplete metric space; the completion of this space is shown to yield an infinitary affine lambda-calculus, whose quotient under a suitable partial equivalence relation is exactly the full (non-affine) lambda-calculus. We also show how this construction brings interesting insights on some standard rewriting properties of the lambda-calculus (finite developments, confluence, standardization, head normalization and solvability).","PeriodicalId":407972,"journal":{"name":"2012 27th Annual IEEE Symposium on Logic in Computer Science","volume":"38 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":"132123886","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
Higher Semantics of Quantum Protocols 量子协议的高级语义
2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.70
J. Vicary
{"title":"Higher Semantics of Quantum Protocols","authors":"J. Vicary","doi":"10.1109/LICS.2012.70","DOIUrl":"https://doi.org/10.1109/LICS.2012.70","url":null,"abstract":"We propose a higher semantics for the description of quantum protocols, which deals with quantum and classical information in a unified way. Central to our approach is the modelling of classical data by information transfer to the environment, and the use of 2-category theory to formalize the resulting framework. This 2-categorical semantics has a graphical calculus, the diagrams of which correspond exactly to physically-implementable quantum procedures. Quantum teleportation in its most general sense is reformulated as the ability to remove correlations between a quantum system and its environment, and is represented by an elegant graphical identity. We use this new formalism to describe two new families of quantum protocols.","PeriodicalId":407972,"journal":{"name":"2012 27th Annual IEEE Symposium on Logic in Computer Science","volume":"22 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":"114681221","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}
引用次数: 32
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets 时间弧Petri网、数据网和其他充实网的有序递归复杂度
2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.46
S. Haddad, S. Schmitz, P. Schnoebelen
{"title":"The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets","authors":"S. Haddad, S. Schmitz, P. Schnoebelen","doi":"10.1109/LICS.2012.46","DOIUrl":"https://doi.org/10.1109/LICS.2012.46","url":null,"abstract":"We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of the main decidable properties (safety, termination, regular simulation, etc.) of these models. Since these new lower bounds match the upper bounds that one can derive from wqo theory, they precisely characterise the computational power of these so-called \"enriched\" nets.","PeriodicalId":407972,"journal":{"name":"2012 27th Annual IEEE Symposium on Logic in Computer Science","volume":"44 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":"116697316","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}
引用次数: 38
The Complexity of Decomposing Modal and First-Order Theories 模态分解和一阶理论的复杂性
2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.43
Stefan Göller, J. C. Jung, Markus Lohrey
{"title":"The Complexity of Decomposing Modal and First-Order Theories","authors":"Stefan Göller, J. C. Jung, Markus Lohrey","doi":"10.1109/LICS.2012.43","DOIUrl":"https://doi.org/10.1109/LICS.2012.43","url":null,"abstract":"We show that the satisfiability problem for the two-dimensional extension KxK of unimodal K is nonelementary, hereby confirming a conjecture of Marx and Mikulas from 2001. Our lower bound technique allows us to derive further lower bounds for many-dimensional modal logics for which only elementary lower bounds were previously known. We also derive nonelementary lower bounds on the sizes of Feferman-Vaught decompositions w.r.t. product for any decomposable logic that is at least as expressive as unimodal K. Finally, we study the sizes of Feferman-Vaught decompositions and formulas in Gaifman normal form for fixed-variable fragments of first-order logic.","PeriodicalId":407972,"journal":{"name":"2012 27th Annual IEEE Symposium on Logic in Computer Science","volume":"74 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":"124714865","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}
引用次数: 17
Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection 可折叠下推自动机与标记递归方案:等价性、安全性与有效选择
2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.73
Arnaud Carayol, O. Serre
{"title":"Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection","authors":"Arnaud Carayol, O. Serre","doi":"10.1109/LICS.2012.73","DOIUrl":"https://doi.org/10.1109/LICS.2012.73","url":null,"abstract":"Higher-order recursion schemes are rewriting systems for simply typed terms and they are known to be equi-expressive with collapsible pushdown automata (CPDA) for generating trees. We argue that CPDA are an essential model when working with recursion schemes. First, we give a new proof of the translation of schemes into CPDA that does not appeal to game semantics. Second, we show that this translation permits to revisit the safety constraint and allows CPDA to be seen as Krivine machines. Finally, we show that CPDA permit one to prove the effective MSO selection property for schemes, subsuming all known decidability results for MSO on schemes.","PeriodicalId":407972,"journal":{"name":"2012 27th Annual IEEE Symposium on Logic in Computer Science","volume":"63 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":"125847464","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}
引用次数: 44
Approximate Verification of the Symbolic Dynamics of Markov Chains 马尔可夫链符号动力学的近似验证
2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-01 DOI: 10.1109/LICS.2012.17
Manindra Agrawal, S. Akshay, B. Genest, P. Thiagarajan
{"title":"Approximate Verification of the Symbolic Dynamics of Markov Chains","authors":"Manindra Agrawal, S. Akshay, B. Genest, P. Thiagarajan","doi":"10.1109/LICS.2012.17","DOIUrl":"https://doi.org/10.1109/LICS.2012.17","url":null,"abstract":"A finite state Markov chain M is often viewed as a probabilistic transition system. An alternative view - which we follow here - is to regard M as a linear transform operating on the space of probability distributions over its set of nodes. The novel idea here is to discretize the probability value space [0,1] into a finite set of intervals. A concrete probability distribution over the nodes is then symbolically represented as a tuple D of such intervals. The i-th component of the discretized distribution D will be the interval in which the probability of node i falls. The set of discretized distributions is a finite set and each trajectory, generated by repeated applications of M to an initial distribution, will induce a unique infinite string over this finite set of letters. Hence, given a set of initial distributions, the symbolic dynamics of M will consist of an infinite language L over the finite alphabet of discretized distributions. We investigate whether L meets a specification given as a linear time temporal logic formula whose atomic propositions will assert that the current probability of a node falls in an interval. Unfortunately, even for restricted Markov chains (for instance, irreducible and aperiodic chains), we do not know at present if and when L is an (omega)-regular language. To get around this we develop the notion of an epsilon-approximation, based on the transient and long term behaviors of M. Our main results are that, one can effectively check whether (i) for each infinite word in L, at least one of its epsilon-approximations satisfies the specification; (ii) for each infinite word in L all its epsilon approximations satisfy the specification. These verification results are strong in that they apply to all finite state Markov chains. Further, the study of the symbolic dynamics of Markov chains initiated here is of independent interest and can lead to other applications.","PeriodicalId":407972,"journal":{"name":"2012 27th Annual IEEE Symposium on Logic in Computer Science","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115927496","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}
引用次数: 46
首页 上一页 下一页 尾页
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学术官方微信