Foundations of Software Science and Computation Structures

Front Matter ....Pages I-XV
Front Matter ....Pages 1-1
 Non-angelic Concurrent Game Semantics  (Simon Castellan, Pierre Clairambault, Jonathan Hayman, Glynn Winskel)....Pages 3-19
 A Trace Semantics for System F Parametric Polymorphism  (Guilhem Jaber, Nikos Tzevelekos)....Pages 20-38
 Categorical Combinatorics for Non Deterministic Strategies on Simple Games  (Clément Jacq, Paul-André Melliès)....Pages 39-70
 A Syntactic View of Computational Adequacy  (Marco Devesas Campos, Paul Blain Levy)....Pages 71-87
Front Matter ....Pages 89-89
 A New Linear Logic for Deadlock-Free Session-Typed Processes  (Ornela Dardha, Simon J. Gay)....Pages 91-109
 A Double Category Theoretic Analysis of Graded Linear Exponential Comonads  (Shin-ya Katsumata)....Pages 110-127
 Depending on Session-Typed Processes  (Bernardo Toninho, Nobuko Yoshida)....Pages 128-145
 FabOpen image in new windowous Interoperability for ML and a Linear Language  (Gabriel Scherer, Max New, Nick Rioux, Amal Ahmed)....Pages 146-162
Front Matter ....Pages 163-163
 Automata for True Concurrency Properties  (Paolo Baldan, Tommaso Padoan)....Pages 165-182
 A Theory of Encodings and Expressiveness (Extended Abstract)  (Rob van Glabbeek)....Pages 183-202
 A Framework for Parameterized Monitorability  (Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir)....Pages 203-220
 Logics for Bisimulation and Divergence  (Xinxin Liu, Tingting Yu, Wenhui Zhang)....Pages 221-237
Front Matter ....Pages 239-239
 Call-by-Need, Neededness and All That  (Delia Kesner, Alejandro Ríos, Andrés Viso)....Pages 241-257
 Fitch-Style Modal Lambda Calculi  (Ranald Clouston)....Pages 258-275
 Realizability Interpretation and Normalization of Typed Call-by-Need \(\lambda \)-calculus with Control  (Étienne Miquey, Hugo Herbelin)....Pages 276-292
 Quotient Inductive-Inductive Types  (Thorsten Altenkirch, Paolo Capriotti, Gabe Dijkstra, Nicolai Kraus, Fredrik Nordvall Forsberg)....Pages 293-310
Front Matter ....Pages 311-311
 Guarded Traced Categories  (Sergey Goncharov, Lutz Schröder)....Pages 313-330
 Proper Semirings and Proper Convex Functors  (Ana Sokolova, Harald Woracek)....Pages 331-347
 From Symmetric Pattern-Matching to Quantum Control  (Amr Sabry, Benoît Valiron, Juliana Kaizer Vizzotto)....Pages 348-364
Front Matter ....Pages 365-365
 The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes  (Stéphane Le Roux, Guillermo A. Pérez)....Pages 367-383
 A Hierarchy of Scheduler Classes for Stochastic Automata  (Pedro R. D’Argenio, Marcus Gerhold, Arnd Hartmanns, Sean Sedwards)....Pages 384-402
 Symbolically Quantifying Response Time in Stochastic Models Using Moments and Semirings  (Hugo Bazille, Eric Fabre, Blaise Genest)....Pages 403-419
 Comparator Automata in Quantitative Verification  (Suguman Bansal, Swarat Chaudhuri, Moshe Y. Vardi)....Pages 420-437
Front Matter ....Pages 439-439
 Modular Tableaux Calculi for Separation Theories  (Simon Docherty, David Pym)....Pages 441-458
 Differential Calculus with Imprecise Input and Its Logical Framework  (Abbas Edalat, Mehrdad Maleki)....Pages 459-475
 The Effects of Adding Reachability Predicates in Propositional Separation Logic  (Stéphane Demri, Étienne Lozes, Alessio Mansutti)....Pages 476-493
 The Equational Theory of the Natural Join and Inner Union is Decidable  (Luigi Santocanale)....Pages 494-510
Front Matter ....Pages 511-511
 Minimization of Graph Weighted Models over Circular Strings  (Guillaume Rabusseau)....Pages 513-529
 Games on Graphs with a Public Signal Monitoring  (Patricia Bouyer)....Pages 530-547
 WQO Dichotomy for 3-Graphs  (Sławomir Lasota, Radosław Piórkowski)....Pages 548-564
 Verifying Higher-Order Functions with Tree Automata  (Thomas Genet, Timothée Haudebourg, Thomas Jensen)....Pages 565-582
Back Matter ....Pages 583-583