{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":30,"n_cols":5,"rows_kept":30,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[11,2,11,3],[24,2,24,3],[25,2,25,3],[27,2,27,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910337848003321"]
[null,null,"Autore",null,"Bojańczyk Mikołaj"]
[null,null,"Titolo",null,"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 / / edited by Mikołaj Bojańczyk, Alex Simpson"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019"]
[null,null,"ISBN",null,"9783030171278"]
[{"$nulls":4},"3030171272"]
[null,null,"Edizione",null,"[1st ed. 2019.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XV, 542 p. 2401 illus., 6 illus. in color.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 11425"]
[null,null,"Disciplina",null,"005.131"]
[{"$nulls":4},"005.1"]
[null,null,"Soggetti",null,"Machine theory"]
[{"$nulls":4},"Artificial intelligence"]
[{"$nulls":4},"Computer science - Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Artificial intelligence - Data processing"]
[{"$nulls":4},"Compilers (Computer programs)"]
[{"$nulls":4},"Computer programming"]
[{"$nulls":4},"Formal Languages and Automata Theory"]
[{"$nulls":4},"Artificial Intelligence"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Data Science"]
[{"$nulls":4},"Compilers and Interpreters"]
[{"$nulls":4},"Programming Techniques"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"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 -- "]
[{"$nulls":4},"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."]
[null,null,null,"Sommario/riassunto","This book is Open Access under a CC BY licence."]