Foundations of Software Science and Computation Structures: 22nd International Conference, FOSSACS 2
59.96 CHF
Versandkostenfrei
Lieferzeit: 7-14 Werktage
- Artikel-Nr.: 10222029
Beschreibung
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 mi-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.
Eigenschaften
Breite: | 155 |
Gewicht: | 838 g |
Höhe: | 236 |
Länge: | 32 |
Seiten: | 542 |
Sprachen: | Englisch |
Autor: | Alex Simpson, Mikolaj Bojanczyk |
Bewertung
Bewertungen werden nach Überprüfung freigeschaltet.
Zuletzt angesehen