Abstract is missing.
- Black Ninjas in the Dark: Formal Analysis of Population ProtocolsMichael Blondin, Javier Esparza, Stefan Jaax, Antonín Kucera. 1-10 [doi]
- Inner Models of UnivalenceThierry Coquand. 11-12 [doi]
- Continuous Reasoning: Scaling the impact of formal methodsPeter W. O'Hearn. 13-25 [doi]
- Quasi-Open Bisimilarity with Mismatch is IntuitionisticRoss Horne, Ki Yung Ahn, Shang-Wei Lin, Alwen Tiu. 26-35 [doi]
- Distribution-based objectives for Markov Decision ProcessesS. Akshay, Blaise Genest, Nikhil Vyas. 36-45 [doi]
- A Simple and Optimal Complementation Algorithm for Büchi AutomataJoël D. Allred, Ulrich Ultes-Nitsche. 46-55 [doi]
- Syntax and Semantics of Quantitative Type TheoryRobert Atkey. 56-65 [doi]
- Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism ProblemAlbert Atserias, Joanna Ochremiak. 66-75 [doi]
- Impredicative Encodings of (Higher) Inductive TypesSteve Awodey, Jonas Frey, Sam Speight. 76-85 [doi]
- Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision ProcessesChristel Baier, Nathalie Bertrand 0001, Clemens Dubslaff, Daniel Gburek, Ocan Sankur. 86-94 [doi]
- Extensional and Intensional Semantic Universes: A Denotational Model of Dependent TypesValentin Blot, Jim Laird. 95-104 [doi]
- A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNPManuel Bodirsky, Florent R. Madelaine, Antoine Mottet. 105-114 [doi]
- A Hybrid, Dynamic Logic for Hybrid-Dynamic Information FlowBrandon Bohrer, André Platzer. 115-124 [doi]
- Regular and First-Order List FunctionsMikolaj Bojanczyk, Laure Daviaud, Shankara Narayanan Krishna. 125-134 [doi]
- Definable decompositions for graphs of bounded linear cliquewidthMikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk. 135-144 [doi]
- On computability and tractability for infinite setsMikolaj Bojanczyk, Szymon Torunczyk. 145-154 [doi]
- Automaton-Based Criteria for Membership in CTLUdi Boker, Yariv Shaulian. 155-164 [doi]
- Rewriting with FrobeniusFilippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi. 165-174 [doi]
- Sound up-to techniques and Complete abstract domainsFilippo Bonchi, Pierre Ganty, Roberto Giacobazzi, Dusko Pavlovic. 175-184 [doi]
- Efficient Algorithms for Asymptotic Bounds on Termination Time in VASSTomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný 0001, Dominik Velan, Florian Zuleger. 185-194 [doi]
- Concurrency and Probability: Removing Confusion, CompositionallyRoberto Bruni, Hernán C. Melgratti, Ugo Montanari. 195-204 [doi]
- Higher Groups in Homotopy Type TheoryUlrik Buchholtz, Floris van Doorn, Egbert Rijke. 205-214 [doi]
- The concurrent game semantics of Probabilistic PCFSimon Castellan, Pierre Clairambault, Hugo Paquet, Glynn Winskel. 215-224 [doi]
- Tree-depth, quantifier elimination, and quantifier rankYijia Chen, Jörg Flum. 225-234 [doi]
- A parameterized halting problem, the linear time hierarchy, and the MRDP theoremYijia Chen, Moritz Müller, Keita Yokoyama. 235-244 [doi]
- Computability Beyond Church-Turing via Choice SequencesMark Bickford, Liron Cohen 0001, Robert L. Constable, Vincent Rahli. 245-254 [doi]
- On Higher Inductive Types in Cubical Type TheoryThierry Coquand, Simon Huber, Anders Mörtberg. 255-264 [doi]
- Strong Sums in Focused LogicKarl Crary. 265-274 [doi]
- Probabilistic Stable Functions on Discrete Cones are Power SeriesRaphaëlle Crubillé. 275-284 [doi]
- Unary negation fragment with equivalence relations has the finite model propertyDaniel Danielski, Emanuel Kieronski. 285-294 [doi]
- Logics for Word Transductions with SynthesisLuc Dartois, Emmanuel Filiot, Nathan Lhote. 295-304 [doi]
- Work Analysis with Resource-Aware Session TypesAnkush Das, Jan Hoffmann 0002, Frank Pfenning. 305-314 [doi]
- Regular Transducer Expressions for Regular TransformationsVrunda Dave, Paul Gastin, Shankara Narayanan Krishna. 315-324 [doi]
- A pseudo-quasi-polynomial algorithm for mean-payoff parity gamesLaure Daviaud, Marcin Jurdzinski, Ranko Lazic. 325-334 [doi]
- Logical paradoxes in quantum computationNadish de Silva. 335-343 [doi]
- Causal Computational Complexity of Distributed ProcessesRomain Demangeon, Nobuko Yoshida. 344-353 [doi]
- Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small DepthArnaud Durand 0001, Anselm Haak, Heribert Vollmer. 354-363 [doi]
- Eager Functions as ProcessesAdrien Durier, Daniel Hirschkoff, Davide Sangiorgi. 364-373 [doi]
- What's in a game?: A theory of game modelsClovis Eberhart, Tom Hirschowitz. 374-383 [doi]
- One Theorem to Rule Them All: A Unified Translation of LTL into ω-AutomataJavier Esparza, Jan Kretínský, Salomon Sickert. 384-393 [doi]
- A Theory of Register MonitorsThomas Ferrère, Thomas A. Henzinger, N. Ege Saraç. 394-403 [doi]
- Playing with Repetitions in Data Words Using Energy GamesDiego Figueira, M. Praveen. 404-413 [doi]
- The State Complexity of Alternating AutomataNathanaël Fijalkow. 414-421 [doi]
- Rational Synthesis Under Imperfect InformationEmmanuel Filiot, Raffaella Gentilini, Jean-François Raskin. 422-431 [doi]
- Sequential Relational DecompositionDror Fried, Axel Legay, Joël Ouaknine, Moshe Y. Vardi. 432-441 [doi]
- ReLoC: A Mechanised Relational Logic for Fine-Grained ConcurrencyDan Frumin, Robbert Krebbers, Lars Birkedal. 442-451 [doi]
- Quantitative Behavioural Reasoning for Higher-order Effectful Programs: Applicative DistancesFrancesco Gavazzo. 452-461 [doi]
- Classical realizability as a classifier for nondeterminismGuillaume Geoffroy. 462-471 [doi]
- Compositional Game TheoryNeil Ghani, Jules Hedges, Viktor Winschel, Philipp Zahn. 472-481 [doi]
- A Generalized Modality for RecursionAdrien Guatto. 482-491 [doi]
- Can One Escape Red Chains?: Regular Path Queries Determinacy is UndecidableGrzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja. 492-501 [doi]
- Two complete axiomatisations of pure-state qubit quantum computingAmar Hadzihasanovic, Kang Feng Ng, Quanlong Wang. 502-511 [doi]
- Wreath Products of Distributive Forest AlgebrasMichael Hahn 0001, Andreas Krebs, Howard Straubing. 512-520 [doi]
- Cellular Cohomology in Homotopy Type TheoryUlrik Buchholtz, Kuen-Bang Hou (Favonia). 521-529 [doi]
- Polynomial Invariants for Affine ProgramsEhud Hrushovski, Joël Ouaknine, Amaury Pouly, James Worrell 0001. 530-539 [doi]
- Unification nets: canonical proof net quantifiersDominic J. D. Hughes. 540-549 [doi]
- Satisfiability in multi-valued circuitsPawel M. Idziak, Jacek Krzaczkowski. 550-558 [doi]
- A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum MechanicsEmmanuel Jeandel, Simon Perdrix, Renaud Vilmart. 559-568 [doi]
- Diagrammatic Reasoning beyond Clifford+T Quantum MechanicsEmmanuel Jeandel, Simon Perdrix, Renaud Vilmart. 569-578 [doi]
- Type-two polynomial-time and restricted lookaheadBruce M. Kapron, Florian Steinberg. 579-588 [doi]
- A Logical Account for Linear Partial Differential EquationsMarie Kerjean. 589-598 [doi]
- Free Higher Groups in Homotopy Type TheoryNicolai Kraus, Thorsten Altenkirch. 599-608 [doi]
- Conditional Value-at-Risk for Reachability and Mean Payoff in Markov Decision ProcessesJan Kretínský, Tobias Meggendorfer. 609-618 [doi]
- Weighted model counting beyond two-variable logicAntti Kuusisto, Carsten Lutz. 619-628 [doi]
- Around Classical and Intuitionistic Linear LogicsOlivier Laurent. 629-638 [doi]
- A modal μ perspective on solving parity games in quasi-polynomial timeKaroliina Lehtinen. 639-648 [doi]
- Probabilistic Böhm Trees and Probabilistic SeparationThomas Leventis. 649-658 [doi]
- Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String DiagramsBert Lindenhovius, Michael Mislove, Vladimir Zamdzhiev. 659-668 [doi]
- Boolean-Valued Semantics for the Stochastic λ-CalculusGiorgio Bacci, Robert Furber, Dexter Kozen, Radu Mardare, Prakash Panangaden, Dana Scott. 669-678 [doi]
- An Algebraic Theory of Markov ProcessesGiorgio Bacci, Radu Mardare, Prakash Panangaden, Gordon D. Plotkin. 679-688 [doi]
- Ribbon Tensorial LogicPaul-André Melliès. 689-698 [doi]
- An Asynchronous Soundness Theorem for Concurrent Separation LogicPaul-André Melliès, Léo Stefanesco. 699-708 [doi]
- Riesz Modal Logic with Threshold OperatorsMatteo Mio. 710-719 [doi]
- A sequent calculus with dependent types for classical arithmeticÉtienne Miquey. 720-729 [doi]
- An answer to the Gamma questionBenoit Monin. 730-738 [doi]
- Dialectica models of type theorySean K. Moss, Tamara von Glehn. 739-748 [doi]
- The Geometry of Computation-Graph AbstractionKoko Muroya, Steven W. T. Cheung, Dan R. Ghica. 749-758 [doi]
- A Fixpoint Logic and Dependent Effects for Temporal Property VerificationYoji Nanjo, Hiroshi Unno 0001, Eric Koskinen, Tachio Terauchi. 759-768 [doi]
- MSO Queries on Trees: Enumerating Answers under Updates Using Forest AlgebrasMatthias Niewerth. 769-778 [doi]
- Degrees of Relatedness: A Unified Framework for Parametricity, Irrelevance, Ad Hoc Polymorphism, Intersections, Unions and Algebra in Dependent Type TheoryAndreas Nuyts, Dominique Devriese. 779-788 [doi]
- Parameterized circuit complexity of model-checking on sparse structuresMichal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk. 789-798 [doi]
- On the number of types in sparse graphsMichal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk. 799-808 [doi]
- Syntax and Semantics for Operations with ScopesMaciej Piróg, Tom Schrijvers, Nicolas Wu, Mauro Jaskelioff. 809-818 [doi]
- Differential Equation Axiomatization: The Impressive Power of Differential GhostsAndré Platzer, Yong Kiam Tan. 819-828 [doi]
- Allegories: decidability and graph homomorphismsDamien Pous, Valeria Vignudelli. 829-838 [doi]
- A functional interpretation with stateThomas Powell. 839-848 [doi]
- LMSO: A Curry-Howard Approach to Church's Synthesis via Linear LogicPierre Pradic, Colin Riba. 849-858 [doi]
- Computable decision making on the reals and other spaces: via partiality and nondeterminismBenjamin Sherman, Luke Sciarappa, Adam Chlipala, Michael Carbin. 859-868 [doi]
- A General Framework for Relational ParametricityKristina Sojakova, Patricia Johann. 869-878 [doi]
- Guarded Computational Type TheoryJonathan Sterling, Robert Harper. 879-888 [doi]
- Species, Profunctors and Taylor Expansion Weighted by SMCC: A Unified Framework for Modelling Nondeterministic, Probabilistic and Quantum ProgramsTakeshi Tsukada, Kazuyuki Asada, C.-H. Luke Ong. 889-898 [doi]
- Every λ-Term is Meaningful for the Infinitary Relational ModelPierre Vial. 899-908 [doi]
- A van Benthem Theorem for Fuzzy Modal LogicPaul Wild, Lutz Schröder, Dirk Pattinson, Barbara König 0001. 909-918 [doi]
- A theory of linear typings as flows on 3-valent graphsNoam Zeilberger. 919-928 [doi]
- Separability by piecewise testable languages and downward closures beyond subwordsGeorg Zetzsche. 929-938 [doi]