Abstract is missing.
- Constructing a universe for the setoid modelThorsten Altenkirch, Simon Boulier, Ambrus Kaposi, Christian Sattler, Filippo Sestini. 1-21 [doi]
- Nominal Equational ProblemsMauricio Ayala-Rincón, Maribel Fernández, Daniele Nantes Sobrinho, Deivid Vale. 22-41 [doi]
- Finding Cut-Offs in Leaderless Rendez-Vous Protocols is EasyA. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin. 42-61 [doi]
- Fixpoint Theory - Upside DownPaolo Baldan, Richard Eggert, Barbara König 0001, Tommaso Padoan. 62-81 [doi]
- "Most of" leads to undecidability: Failure of adding frequencies to LTLBartosz Bednarczyk, Jakub Michaliszyn. 82-101 [doi]
- Combining Semilattices and SemimodulesFilippo Bonchi, Alessio Santamaria. 102-123 [doi]
- One-way Resynchronizability of Word TransducersSougata Bose, Shankara Narayanan Krishna, Anca Muscholl, Gabriele Puppis. 124-143 [doi]
- Fair Refinement for Asynchronous Session TypesMario Bravetti, Julien Lange, Gianluigi Zavattaro. 144-163 [doi]
- Running Time Analysis of Broadcast Consensus ProtocolsPhilipp Czerner, Stefan Jaax. 164-183 [doi]
- Leafy automata for higher-order concurrencyAlex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz. 184-204 [doi]
- Factorization in Call-by-Name and Call-by-Value Calculi via Linear LogicClaudia Faggian, Giulio Guerrieri. 205-225 [doi]
- Generalized Bounded Linear Logic and its Categorical SemanticsYoji Fukihara, Shin-ya Katsumata. 226-246 [doi]
- Focused Proof-search in the Logic of Bunched ImplicationsAlexander Gheorghiu, Sonia Marin. 247-267 [doi]
- Interpolation and Amalgamation for Arrays with MaxDiffSilvio Ghilardi, Alessandro Gianola, Deepak Kapur. 268-288 [doi]
- Adjoint Reactive GUI ProgrammingChristian Uldal Graulund, Dmitrij Szamozvancev, Neel Krishnaswami. 289-309 [doi]
- On the Expressiveness of Büchi ArithmeticChristoph Haase, Jakub Rózycki. 310-323 [doi]
- Parametricity for Primitive Nested TypesPatricia Johann, Enrico Ghiorzi, Daniel Jeffries. 324-343 [doi]
- The Spirit of Node ReplicationDelia Kesner, Loïc Peyrot, Daniel Ventura. 344-364 [doi]
- Nondeterministic and co-Nondeterministic Implies Deterministic, for Data LanguagesBartek Klin, Slawomir Lasota 0001, Szymon Torunczyk. 365-384 [doi]
- Certifying InexpressibilityOrna Kupferman, Salomon Sickert. 385-405 [doi]
- A General Semantic Construction of Dependent Refinement Type Systems, CategoricallySatoshi Kura. 406-426 [doi]
- Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNPRichard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak. 427-447 [doi]
- Nondeterministic Syntactic ComplexityRobert S. R. Myers, Stefan Milius, Henning Urbat. 448-468 [doi]
- A String Diagrammatic Axiomatisation of Finite-State AutomataRobin Piedeleu, Fabio Zanasi. 469-489 [doi]
- Work-sensitive Dynamic Complexity of Formal LanguagesJonas Schmidt, Thomas Schwentick, Till Tantau, Nils Vortmeier, Thomas Zeume. 490-509 [doi]
- Learning Pomset AutomataGerco van Heerdt, Tobias Kappé, Jurriaan Rot, Alexandra Silva 0001. 510-530 [doi]
- The Structure of Sum-Over-Paths, its Consequences, and Completeness for CliffordRenaud Vilmart. 531-550 [doi]
- A Quantified Coalgebraic van Benthem TheoremPaul Wild, Lutz Schröder. 551-571 [doi]