Abstract is missing.
- Non-angelic Concurrent Game SemanticsSimon Castellan, Pierre Clairambault, Jonathan Hayman, Glynn Winskel. 3-19 [doi]
- A Trace Semantics for System F Parametric PolymorphismGuilhem Jaber, Nikos Tzevelekos. 20-38 [doi]
- Categorical Combinatorics for Non Deterministic Strategies on Simple GamesClément Jacq, Paul-André Melliès. 39-70 [doi]
- A Syntactic View of Computational AdequacyMarco Devesas Campos, Paul Blain Levy. 71-87 [doi]
- A New Linear Logic for Deadlock-Free Session-Typed ProcessesOrnela Dardha, Simon J. Gay. 91-109 [doi]
- A Double Category Theoretic Analysis of Graded Linear Exponential ComonadsShin-ya Katsumata. 110-127 [doi]
- Depending on Session-Typed ProcessesBernardo Toninho, Nobuko Yoshida. 128-145 [doi]
- Fab ous Interoperability for ML and a Linear LanguageGabriel Scherer, Max S. New, Nick Rioux, Amal Ahmed. 146-162 [doi]
- Automata for True Concurrency PropertiesPaolo Baldan, Tommaso Padoan. 165-182 [doi]
- A Theory of Encodings and Expressiveness (Extended Abstract) - (Extended Abstract)Rob van Glabbeek. 183-202 [doi]
- A Framework for Parameterized MonitorabilityLuca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir. 203-220 [doi]
- Logics for Bisimulation and DivergenceXinxin Liu, Tingting Yu, Wenhui Zhang. 221-237 [doi]
- Call-by-Need, Neededness and All ThatDelia Kesner, Alejandro Ríos, Andrés Viso. 241-257 [doi]
- Fitch-Style Modal Lambda CalculiRanald Clouston. 258-275 [doi]
- Realizability Interpretation and Normalization of Typed Call-by-Need \lambda -calculus with ControlÉtienne Miquey, Hugo Herbelin. 276-292 [doi]
- Quotient Inductive-Inductive TypesThorsten Altenkirch, Paolo Capriotti, Gabe Dijkstra, Nicolai Kraus, Fredrik Nordvall Forsberg. 293-310 [doi]
- Guarded Traced CategoriesSergey Goncharov 0001, Lutz Schröder. 313-330 [doi]
- Proper Semirings and Proper Convex FunctorsAna Sokolova, Harald Woracek. 331-347 [doi]
- From Symmetric Pattern-Matching to Quantum ControlAmr Sabry, Benoît Valiron, Juliana Kaizer Vizzotto. 348-364 [doi]
- The Complexity of Graph-Based Reductions for Reachability in Markov Decision ProcessesStéphane Le Roux 0001, Guillermo A. Pérez. 367-383 [doi]
- A Hierarchy of Scheduler Classes for Stochastic AutomataPedro R. D'Argenio, Marcus Gerhold, Arnd Hartmanns, Sean Sedwards. 384-402 [doi]
- Symbolically Quantifying Response Time in Stochastic Models Using Moments and SemiringsHugo Bazille, Eric Fabre, Blaise Genest. 403-419 [doi]
- Comparator Automata in Quantitative VerificationSuguman Bansal, Swarat Chaudhuri, Moshe Y. Vardi. 420-437 [doi]
- Modular Tableaux Calculi for Separation TheoriesSimon Docherty, David J. Pym. 441-458 [doi]
- Differential Calculus with Imprecise Input and Its Logical FrameworkAbbas Edalat, Mehrdad Maleki. 459-475 [doi]
- The Effects of Adding Reachability Predicates in Propositional Separation LogicStéphane Demri, Étienne Lozes, Alessio Mansutti. 476-493 [doi]
- The Equational Theory of the Natural Join and Inner Union is DecidableLuigi Santocanale. 494-510 [doi]
- Minimization of Graph Weighted Models over Circular StringsGuillaume Rabusseau. 513-529 [doi]
- Games on Graphs with a Public Signal MonitoringPatricia Bouyer. 530-547 [doi]
- WQO Dichotomy for 3-GraphsSlawomir Lasota, Radoslaw Piórkowski. 548-564 [doi]
- Verifying Higher-Order Functions with Tree AutomataThomas Genet, Timothée HAUDEBOURG, Thomas P. Jensen. 565-582 [doi]