Abstract is missing.
- Comprehensive Parametric Polymorphism: Categorical Models and Type TheoryNeil Ghani, Fredrik Nordvall Forsberg, Alex Simpson. 3-19 [doi]
- Guarded Dependent Type Theory with Coinductive TypesAles Bizjak, Hans Bugge Grathwohl, Ranald Clouston, Rasmus Ejlers Møgelberg, Lars Birkedal. 20-35 [doi]
- Dependent Types and Fibred Computational EffectsDanel Ahman, Neil Ghani, Gordon D. Plotkin. 36-54 [doi]
- Game Semantics for Bounded PolymorphismJames Laird. 55-70 [doi]
- Join Inverse Categories as Models of Reversible RecursionHolger Bock Axelsen, Robin Kaarsgaard. 73-90 [doi]
- A Coalgebraic View of Bar Recursion and Bar InductionVenanzio Capretta, Tarmo Uustalu. 91-106 [doi]
- A New Foundation for Finitary Corecursion - The Locally Finite Fixpoint and Its PropertiesStefan Milius, Dirk Pattinson, Thorsten Wißmann. 107-125 [doi]
- Fixed-Point Elimination in the Intuitionistic Propositional CalculusSilvio Ghilardi, Maria João Gouveia, Luigi Santocanale. 126-141 [doi]
- A Theory of Monitors - (Extended Abstract)Adrian Francalanza. 145-161 [doi]
- Contextual Approximation and Higher-Order ProceduresRanko Lazic, Andrzej S. Murawski. 162-179 [doi]
- A Theory of Slicing for Probabilistic Control Flow GraphsTorben Amtoft, Anindya Banerjee. 180-196 [doi]
- Verification of Parameterized Communicating Automata via Split-WidthMarie Fortin, Paul Gastin. 197-213 [doi]
- Quantifier Alternation for Infinite WordsThéo Pierron, Thomas Place, Marc Zeitoun. 234-251 [doi]
- Synchronizing Automata over Nested WordsDmitry Chistikov, Pavel Martyugin, Mahsa Shirmohammadi. 252-268 [doi]
- On Freeze LTL with Ordered AttributesNormann Decker, Daniel Thoma. 269-284 [doi]
- Regular Transformations of Data Words Through Origin InformationAntoine Durand-Gasselin, Peter Habermehl. 285-300 [doi]
- Trace Refinement in Labelled Markov Decision ProcessesNathanaël Fijalkow, Stefan Kiefer, Mahsa Shirmohammadi. 303-318 [doi]
- Qualitative Analysis of VASS-Induced MDPsParosh Aziz Abdulla, Radu Ciobanu, Richard Mayr, Arnaud Sangnier, Jeremy Sproston. 319-334 [doi]
- Metric Temporal Logic with CountingShankara Narayanan Krishna, Khushraj Madnani, Paritosh K. Pandya. 335-352 [doi]
- Unary Resolution: Characterizing PtimeClément Aubert, Marc Bagnol, Thomas Seiller. 373-389 [doi]
- Focused and Synthetic Nested SequentsKaustuv Chaudhuri, Sonia Marin, Lutz Straßburger. 390-407 [doi]
- Strong Normalizability as a Finiteness Structure via the Taylor Expansion of \lambda λ -termsMichele Pagani, Christine Tasson, Lionel Vaux. 408-423 [doi]
- Reasoning About Call-by-need by Means of TypesDelia Kesner. 424-441 [doi]
- Coverability Trees for Petri Nets with Unordered DataPiotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke. 445-461 [doi]
- Shortest Paths in One-Counter SystemsDmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar. 462-478 [doi]
- The Invariance Problem for Matrix SemigroupsKlaus Dräger. 479-492 [doi]
- Towards a Formal Theory of Graded MonadsSoichiro Fujii, Shin-ya Katsumata, Paul-André Melliès. 513-530 [doi]
- Profinite Monads, Profinite Equations, and Reiterman's TheoremLiang-Ting Chen, Jirí Adámek, Stefan Milius, Henning Urbat. 531-547 [doi]