Pandit Deendayal Energy University Library Resource Centre Online Catalogue

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.

Contributor(s): Bojańczyk, Mikołaj [editor.] | Simpson, Alex [editor.] | SpringerLink (Online service)Series: Theoretical Computer Science and General Issues: 11425Publisher: Cham : Springer International Publishing : Imprint: Springer, 2019Edition: 1st ed. 2019Description: XV, 542 p. 2401 illus., 6 illus. in color. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783030171278Subject(s): Mathematical logic | Artificial intelligence | Computer science-Mathematics | Data structures (Computer science) | Programming languages (Electronic computers) | Computer programming | Mathematical Logic and Formal Languages | Artificial Intelligence | Discrete Mathematics in Computer Science | Data Structures | Programming Languages, Compilers, Interpreters | Programming TechniquesAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 005.131 LOC classification: QA8.9-10.3Online resources: Click here to access online
Contents:
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.
In: Springer Nature eBookSummary: This book is Open Access under a CC BY licence.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
No physical items for this record

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.

Open Access

This book is Open Access under a CC BY licence.

There are no comments on this title.

to post a comment.
Copyright ©  2022 PDEU Libraries All Rights Reserved.
Implemented and Customised by Dr. Bharat Chaudhari & Dr. Vijay Suthar
You Are OPAC Visitor No
free web counter

Powered by Koha