05043nam 22008055 450 991033784800332120230329173152.03-030-17127-210.1007/978-3-030-17127-8(CKB)4100000007881202(DE-He213)978-3-030-17127-8(MiAaPQ)EBC5919832(Au-PeEL)EBL5919832(OCoLC)1096283475(oapen)https://directory.doabooks.org/handle/20.500.12854/26387(PPN)235668435(EXLCZ)99410000000788120220190405d2019 u| 0engurnn#008mamaatxtrdacontentcrdamediacrrdacarrierFoundations 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 /edited by Mikołaj Bojańczyk, Alex Simpson1st ed. 2019.Cham :Springer International Publishing :Imprint: Springer,2019.1 online resource (XV, 542 p. 2401 illus., 6 illus. in color.)Theoretical Computer Science and General Issues,2512-2029 ;114253-030-17126-4 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.This book is Open Access under a CC BY licence.Theoretical Computer Science and General Issues,2512-2029 ;11425Machine theoryArtificial intelligenceComputer science—MathematicsDiscrete mathematicsArtificial intelligence—Data processingCompilers (Computer programs)Computer programmingFormal Languages and Automata TheoryArtificial IntelligenceDiscrete Mathematics in Computer ScienceData ScienceCompilers and InterpretersProgramming TechniquesMachine theory.Artificial intelligence.Computer science—Mathematics.Discrete mathematics.Artificial intelligence—Data processing.Compilers (Computer programs).Computer programming.Formal Languages and Automata Theory.Artificial Intelligence.Discrete Mathematics in Computer Science.Data Science.Compilers and Interpreters.Programming Techniques.005.131005.1Bojańczyk Mikołajedt1351249Bojańczyk Mikołajedthttp://id.loc.gov/vocabulary/relators/edtSimpson Alexedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK9910337848003321Foundations of Software Science and Computation Structures3091299UNINA