Foundations of Software Science and Computation Structures [[electronic resource] ] : 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 Simpson

• Autore: Bojańczyk Mikołaj
• Pubblicazione: Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
• Edizione: 1st ed. 2019.
• Descrizione fisica: 1 online resource (XV, 542 p. 2401 illus., 6 illus. in color.)
• Disciplina: 005.131
• Soggetto topico: Machine 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
• Persona (resp. second.): BojańczykMikołaj; SimpsonAlex
• Nota di contenuto: 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.
• Sommario/riassunto: This book is Open Access under a CC BY licence.
• Titolo autorizzato: Foundations of Software Science and Computation Structures
• ISBN: 3-030-17127-2
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 996466276303316
• Lo trovi qui: Univ. di Salerno
• Serie: Theoretical Computer Science and General Issues, . 2512-2029 ; ; 11425