Electronic Notes in Theoretical Computer Science最新文献

{"title":"From Global to Local State, Coalgebraically and Compositionally","authors":"Jim Laird","doi":"10.1016/j.entcs.2019.09.011","DOIUrl":"10.1016/j.entcs.2019.09.011","url":null,"abstract":"<div><p>We describe a type theory or metalanguage for constructing and reasoning about higher-order programs with global and local state, and its categorical model. This provides an encapsulation primitive for abstracting global state and making it local to an object, so that it is passed only between its invocations. Our calculus and its semantics extend the interpretation of lambda-terms in a Cartesian closed category with a monoidal action on a category of evaluation contexts — <em>the sequoid</em> — which is dual to the action of the function type. This gives an interpretation of a new type constructor which allows the representation of both global state — via “state-passing-style” interpretation which uses it to represent output states — and local state, via encapsulation, which corresponds to the unique map into a <em>final coalgebra</em> for the sequoid. This provides the equational theory of our calculus with a coinduction rule for proving equivalence between objects with local state. We show that this theory is sound and complete with respect to the categorical semantics by constructing a term model and we show that it is consistent by giving a concrete example based on a category of games and strategies previously used to interpret general references.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2019.09.011","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127540276","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The Effects of Effects on Constructivism","authors":"Liron Cohen,&nbsp;Sofia Abreu Faro,&nbsp;Ross Tate","doi":"10.1016/j.entcs.2019.09.006","DOIUrl":"10.1016/j.entcs.2019.09.006","url":null,"abstract":"<div><p>It is commonly understood that Countable Choice holds constructively due to the underlying computational nature of constructivism. However, in this paper we demonstrate that invoking different notions of computation result in radically different behaviors regarding Countable Choice. In particular, we illustrate that, although <em>deterministic</em> computation guarantees Countable Choice, <em>non</em>-deterministic computation can negate Countable Choice. We then further show that using <em>stateful</em> computation can restore Countable Choice even in the presence of non-determinism. This finding suggests that much of the modern discourse of constructivism assumes a deterministic underlying computational system, despite non-determinism being a fundamental aspect of modern-day computation.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2019.09.006","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121792679","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Neural Nets via Forward State Transformation and Backward Loss Transformation","authors":"Bart Jacobs ,&nbsp;David Sprunger","doi":"10.1016/j.entcs.2019.09.009","DOIUrl":"10.1016/j.entcs.2019.09.009","url":null,"abstract":"<div><p>This article studies (multilayer perceptron) neural networks with an emphasis on the transformations involved — both forward and backward — in order to develop a semantic/logical perspective that is in line with standard program semantics. The common two-pass neural network training algorithms make this viewpoint particularly fitting. In the forward direction, neural networks act as state transformers, using Kleisli composition for the multiset monad — for the linear parts of network layers. In the reverse direction, however, neural networks change losses of outputs to losses of inputs, thereby acting like a (real-valued) predicate transformer. In this way, backpropagation is functorial by construction, as shown in other works recently. We illustrate this perspective by training a simple instance of a neural network.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2019.09.009","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114308173","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Diacritical Companions","authors":"Dariusz Biernacki ,&nbsp;Sergueï Lenglet ,&nbsp;Piotr Polesiuk","doi":"10.1016/j.entcs.2019.09.003","DOIUrl":"10.1016/j.entcs.2019.09.003","url":null,"abstract":"<div><p>Coinductive reasoning in terms of bisimulations is in practice routinely supported by carefully crafted up-to techniques that can greatly simplify proofs. However, designing and proving such bisimulation enhancements sound can be challenging, especially when striving for modularity. In this article, we present a theory of up-to techniques that builds on the notion of companion introduced by Pous and that extends our previous work which allows for powerful up-to techniques defined in terms of diacritical progress of relations. The theory of diacritical companion that we put forward works in any complete lattice and makes it possible to modularly prove soundness of up-to techniques which rely on the distinction between passive and active progresses, such as up to context in <em>λ</em>-calculi with control operators and extensionality.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2019.09.003","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124016136","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The Construction of Set-Truncated Higher Inductive Types","authors":"Niels van der Weide ,&nbsp;Herman Geuvers","doi":"10.1016/j.entcs.2019.09.014","DOIUrl":"10.1016/j.entcs.2019.09.014","url":null,"abstract":"<div><p>We construct finitary set-truncated higher inductive types (HITs) from quotients and the propositional truncation. For that, we first define signatures as a modification of the schema by Basold <em>et al.</em>, and we show they give rise to univalent categories of algebras in both sets and setoids. To interpret HITs, we use the well-known method of initial algebra semantics. The desired algebra is obtained by lifting the quotient adjunction to the level of algebras and adapting Dybjer's and Moeneclaey's interpretation of HITs in setoids. From this construction, we conclude that the equality types of HITs are freely generated and that HITs are unique. The results are formalized in the UniMath library.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2019.09.014","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133552525","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Bisimulation Maps in Presheaf Categories","authors":"Harsh Beohar,&nbsp;Sebastian Küpper","doi":"10.1016/j.entcs.2019.09.002","DOIUrl":"10.1016/j.entcs.2019.09.002","url":null,"abstract":"<div><p>The category of presheaves on a (small) category is a suitable semantic universe to study behaviour of various dynamical systems. In particular, presheaves can be used to record the executions of a system and their morphisms correspond to simulation maps for various kinds of state-based systems. In this paper, we introduce a notion of bisimulation maps between presheaves (or executions) to capture well known behavioural equivalences in an abstract way. We demonstrate the versatility of this framework by working out the characterisations for standard bisimulation, ∀-fair bisimulation, and branching bisimulation.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2019.09.002","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78055485","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Taylor Expansion, Finiteness and Strategies","authors":"Jules Chouquet","doi":"10.1016/j.entcs.2019.09.005","DOIUrl":"10.1016/j.entcs.2019.09.005","url":null,"abstract":"<div><p>We examine some recent methods introduced to extend Ehrhard and Regnier's result on Taylor expansion: infinite linear combinations of approximants of a lambda-term can be normalized while keeping all coefficients finite. The methods considered allow to extend this result to non-uniform calculi; we show that when focusing on precise reduction strategies, such as Call-By-Value, Call-By-Need, PCF or variants of Call-By-Push-Value, the extension of Ehrhard and Regnier's finiteness result can hold or not, depending on the structure of the original calculus.</p><p>In particular, we introduce a resource calculus for Call-By-Need, and show that the finiteness result about its Taylor expansion can be derived from our Call-By-Value considerations. We also introduce a resource calculus for a presentation of PCF with an explicit fixpoint construction, and show how it interferes with the finiteness result. We examine then Ehrhard and Guerrieri's Bang Calculus which enjoys some Call-By-Push-Value features in a slightly different presentation.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2019.09.005","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132279500","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"On Edge-magic Labelings of Forests","authors":"Márcia R. Cerioli ,&nbsp;Cristina G. Fernandes ,&nbsp;Orlando Lee ,&nbsp;Carla N. Lintzmayer ,&nbsp;Guilherme O. Mota ,&nbsp;Cândida N. da Silva","doi":"10.1016/j.entcs.2019.08.027","DOIUrl":"10.1016/j.entcs.2019.08.027","url":null,"abstract":"<div><p>Given an <em>n</em>-vertex graph <em>G</em> = (<em>V</em>,<em>E</em>) with <em>m</em> edges, a labeling <em>f</em> of <em>V</em> ∪ <em>E</em> that uses all the labels in the set {1,2,...,<em>n</em> + <em>m</em>} is <em>edge-magic</em> if there is an integer <em>k</em> such that <em>f</em>(<em>u</em>) + <em>f</em>(<em>v</em>) + <em>f</em>(<em>uv</em>) = <em>k</em> for every edge <em>uv</em> ∈ <em>E</em>. Furthermore, if the labels in {1,2,...,<em>n</em>} are given to the vertices, then <em>f</em> is called <em>super edge-magic</em>. Kotzig [On magic valuations of trichromatic graphs, Reports of the CRM, 1971] started the investigation of super edge-magic labelings of forests. Following this line of research, we prove that some forests of stars admit a super edge-magic labeling and that some forests of caterpillars admit an edge-magic labeling.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2019.08.027","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123543501","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Backbone Coloring of Graphs with Galaxy Backbones","authors":"Camila Araujo,&nbsp;Julio Araujo,&nbsp;Ana Silva,&nbsp;Alexandre Cezar","doi":"10.1016/j.entcs.2019.08.006","DOIUrl":"10.1016/j.entcs.2019.08.006","url":null,"abstract":"<div><p>A (proper) <em>k</em>-coloring of a graph <em>G</em> = (<em>V</em>,<em>E</em>) is a function <em>c</em> : <em>V</em> (<em>G</em>) → {1,...,<em>k</em>} such that <em>c</em>(<em>u</em>) ≠ <em>c</em>(<em>v</em>) for every <em>uv</em> ∈ <em>E</em>(<em>G</em>). Given a graph <em>G</em> and a subgraph <em>H</em> of <em>G</em>, a <em>q</em>-backbone <em>k</em>-coloring of (<em>G</em>,<em>H</em>) is a <em>k</em>-coloring <em>c</em> of <em>G</em> such that <em>q</em> ≤ <em>|c</em>(<em>u</em>) <em>− c</em>(<em>v</em>)<em>|</em> for every edge <em>uv</em> ∈ <em>E</em>(<em>H</em>). The <em>q</em>-backbone chromatic number of (<em>G</em>,<em>H</em>), denoted by BBC<em>q</em>(<em>G</em>,<em>H</em>), is the minimum integer <em>k</em> for which there exists a <em>q</em>-backbone <em>k</em>-coloring of (<em>G</em>,<em>H</em>). Similarly, a circular <em>q</em>-backbone <em>k</em>-coloring of (<em>G</em>,<em>H</em>) is a function <em>c</em>: <em>V</em> (<em>G</em>) → {1,...,<em>k</em>} such that, for every edge <em>uv</em> ∈ <em>E</em>(<em>G</em>), we have <em>|c</em>(<em>u</em>)<em>−c</em>(<em>v</em>)<em>|</em> ≥ 1 and, for every edge <em>uv</em> ∈ <em>E</em>(<em>H</em>), we have <em>k−q</em> ≥ <em>|c</em>(<em>u</em>)<em>−c</em>(<em>v</em>)<em>|</em> ≥ <em>q</em>. The circular <em>q</em>-backbone chromatic number of (<em>G</em>,<em>H</em>), denoted by CBC<em>q</em>(<em>G</em>,<em>H</em>), is the smallest integer <em>k</em> such that there exists such coloring <em>c</em>.</p><p>In this work, we first prove that if <em>G</em> is a 3-chromatic graph and <em>F</em> is a galaxy, then CBC<em>q</em>(<em>G</em>,<em>F</em>) ≤ 2<em>q</em> + 2. Then, we prove that CBC3(<em>G</em>,<em>M</em>) ≤ 7 and CBC<em>q</em>(<em>G</em>,<em>M</em>) ≤ 2<em>q</em>, for every <em>q</em> ≥ 4, whenever <em>M</em> is a matching of a planar graph <em>G</em>. Moreover, we argue that both bounds are tight. Such bounds partially answer open questions in the literature. We also prove that one can compute BBC2(<em>G</em>,<em>M</em>) in polynomial time, whenever <em>G</em> is an outerplanar graph with a matching backbone <em>M</em>. Finally, we show a mistake in a proof that BBC2(<em>G</em>,<em>M</em>) ≤ Δ(<em>G</em>)+1, for any matching <em>M</em> of an arbitrary graph <em>G</em> [Miškuf <em>et al.</em>, 2010] and we present how to fix it.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2019.08.006","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125544031","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"On Computing the Path Number of a Graph","authors":"F. Botler,&nbsp;R. Cano,&nbsp;M. Sambinelli","doi":"10.1016/j.entcs.2019.08.017","DOIUrl":"10.1016/j.entcs.2019.08.017","url":null,"abstract":"<div><p>Gallai (1966) conjectured that the edge set of every graph <em>G</em> on <em>n</em> vertices can be covered by at most ⌈<em>n</em>/2⌉ edge-disjoint paths. Such a covering by edge-disjoint paths is called a <em>path decomposition</em>, and the size of a path decomposition with a minimum number of elements is called the <em>path number</em> of <em>G</em>. Peroche (1984) proved that the problem of computing the path number is NP-Complete; and Constantinou and Ellinas (2018) proved that it is polynomial for a family of complete bipartite graphs. In this paper we present an Integer Linear Programming model for computing the path number of a graph. This allowed us to verify Gallai's Conjecture for a large collection of graphs. As a result, following a work of Heinrich, Natale and Streicher on cycle decompositions (2017), we verify Gallai's Conjecture for graphs with at most 11 vertices; for bipartite graphs with at most 16 vertices; and for regular graphs with at most 14 vertices.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2019.08.017","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116109289","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}