Foundations of Software Science and Computation Structures  22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings /  [electronic resource] : 
edited by Mikołaj Bojańczyk, Alex Simpson. 
 - 1st ed. 2019. 
 - XV, 542 p. 2401 illus., 6 illus. in color.  online resource. 
 - Theoretical Computer Science and General Issues ;  11425 .
 - Theoretical Computer Science and General Issues ;  11425 .
<br/><br/>Universal Graphs and Good for Small Games Automata: New Tools for Infinite Duration Games -- Resource-Tracking Concurrent Games -- Change Actions: Models of Generalised Differentiation -- Coalgebra Learning via Duality -- Tight Worst-Case Bounds for Polynomial Loop Programs -- A Complete Normal-Form Bisimilarity for State -- Identifiers in Registers - Describing Network Algorithms with Logic -- The Impatient May Use Limited Optimism to Minimize Regret -- Causality in Linear Logic: Full Completeness and Injectivity (Unit-Free Multiplicative-Additive Fragment) -- Rewriting Abstract Structures: Materialization Explained Categorically -- Two-Way Parikh Automata with a Visibly Pushdown Stack -- Kleene Algebra with Hypotheses -- Trees in Partial Higher Dimensional Automata -- The Bernays-Schoenfinkel-Ramsey Class of Separation Logic on Arbitrary Domains -- Continuous Reachability for Unordered Data Petri Nets is in PTime -- Optimal Satisfiability Checking for Arithmetic mu-Calculi -- Constructing Inductive-Inductive Types in Cubical Type Theory -- Causal Inference by String Diagram Surgery -- Higher-Order Distributions for Differential Linear Logic -- Languages Ordered by the Subword Order -- Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces -- A Sound and Complete Logic for Algebraic Effects -- Equational Axiomatization of Algebras with Structure -- Towards a Structural Proof Theory of Probabilistic μ-Calculi -- Partial and Conditional Expectations in Markov Decision Processes with Integer Weights -- Equational Theories and Monads from Polynomial Cayley Representations -- A Dialectica-Like Interpretation of a Linear MSO on Infinite Words -- Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time -- Justness: A Completeness Criterion for Capturing Liveness Properties -- Path category for Free - Open Morphisms from Coalgebras with Non-Deterministic Branching. 
<br/><br/> Open Access 
<br/><br/> This book is Open Access under a CC BY licence. 
<br/><br/><label>ISBN: </label>9783030171278 
<br/><br/><label>Standard No.: </label>10.1007/978-3-030-17127-8  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Mathematical logic.<br/>Artificial intelligence.<br/>Computer science—Mathematics.<br/>Data structures (Computer science).<br/>Programming languages (Electronic computers).<br/>Computer programming.<br/>Mathematical Logic and Formal Languages.<br/>Artificial Intelligence.<br/>Discrete Mathematics in Computer Science.<br/>Data Structures.<br/>Programming Languages, Compilers, Interpreters.<br/>Programming Techniques.
<br/><br/><label>LC Class. No.: </label>QA8.9-10.3 
<br/><br/><label>Dewey Class. No.: </label>005.131