Abstract is missing.
- Neural Flocking: MPC-Based Supervised Learning of Flocking ControllersUsama Mehmood, Shouvik Roy, Radu Grosu, Scott A. Smolka, Scott D. Stoller, Ashish Tiwari 0001. 1-16 [doi]
- On Well-Founded and Recursive CoalgebrasJirí Adámek, Stefan Milius, Lawrence S. Moss. 17-36 [doi]
- Timed NegotiationsS. Akshay, Blaise Genest, Loïc Hélouët, Sharvik Mital. 37-56 [doi]
- Cartesian Difference CategoriesMario Alvarez-Picallo, Jean-Simon Pacaud Lemay. 57-76 [doi]
- Contextual Equivalence for Signal Flow GraphsFilippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio Zanasi. 77-96 [doi]
- Parameterized Synthesis for Fragments of First-Order Logic Over Data WordsBéatrice Bérard, Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder. 97-118 [doi]
- Controlling a Random PopulationThomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann. 119-135 [doi]
- Decomposing Probabilistic Lambda-CalculiUgo Dal Lago, Giulio Guerrieri, Willem Heijltjes. 136-156 [doi]
- On the k-synchronizability of SystemsCinzia Di Giusto, Laetitia Laversa, Étienne Lozes. 157-176 [doi]
- General Supervised Learning as Change Propagation with Delta LensesZinovy Diskin. 177-197 [doi]
- Non-idempotent Intersection Types in Logical FormThomas Ehrhard. 198-216 [doi]
- On Computability of Data Word Functions Defined by TransducersLéo Exibard, Emmanuel Filiot, Pierre-Alain Reynier. 217-236 [doi]
- Minimal Coverability Tree Construction Made Complete and EfficientAlain Finkel, Serge Haddad, Igor Khmelnitsky. 237-256 [doi]
- Constructing Infinitary Quotient-Inductive TypesMarcelo P. Fiore, Andrew M. Pitts, S. C. Steenkamp. 257-276 [doi]
- Relative Full Completeness for Bicategorical Cartesian Closed StructureMarcelo Fiore, Philip Saville. 277-298 [doi]
- A Duality Theoretic View on Limits of Finite StructuresMai Gehrke, Tomás Jakl, Luca Reggio. 299-318 [doi]
- Correctness of Automatic Differentiation via Diffeologies and Categorical GluingMathieu Huot, Sam Staton, Matthijs Vákár. 319-338 [doi]
- Deep Induction: Induction Rules for (Truly) Nested TypesPatricia Johann, Andrew Polonsky. 339-358 [doi]
- Exponential Automatic Amortized Resource AnalysisDavid M. Kahn, Jan Hoffmann 0002. 359-380 [doi]
- Concurrent Kleene Algebra with Observations: From Hypotheses to CompletenessTobias Kappé, Paul Brunet, Alexandra Silva 0001, Jana Wagemaker, Fabio Zanasi. 381-400 [doi]
- Graded Algebraic TheoriesSatoshi Kura. 401-421 [doi]
- A Curry-style Semantics of Interaction: From Untyped to Second-Order Lazy λ μ-CalculusJames Laird. 422-441 [doi]
- An Axiomatic Approach to Reversible ComputationIvan Lanese, Iain C. C. Phillips, Irek Ulidowski. 442-461 [doi]
- An Auxiliary Logic on Trees: on the Tower-Hardness of Logics Featuring Reachability and Submodel ReasoningAlessio Mansutti. 462-481 [doi]
- The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order ReductionThomas Neele, Antti Valmari, Tim A. C. Willemse. 482-501 [doi]
- Semantical Analysis of Contextual TypesBrigitte Pientka, Ulrich Schöpp. 502-521 [doi]
- Ambiguity, Weakness, and Regularity in Probabilistic Büchi AutomataChristof Löding, Anton Pirogov. 522-541 [doi]
- Local Local Reasoning: A BI-Hyperdoctrine for Full Ground StoreMiriam Polzer, Sergey Goncharov 0001. 542-561 [doi]
- Quantum Programming with Inductive Datatypes: Causality and Affine Type TheoryRomain Péchoux, Simon Perdrix, Mathys Rennela, Vladimir Zamdzhiev. 562-581 [doi]
- Spinal Atomic Lambda-CalculusDavid Sherratt, Willem Heijltjes, Tom Gundersen, Michel Parigot. 582-601 [doi]
- Learning Weighted Automata over Principal Ideal DomainsGerco van Heerdt, Clemens Kupke, Jurriaan Rot, Alexandra Silva 0001. 602-621 [doi]
- The Polynomial Complexity of Vector Addition Systems with StatesFlorian Zuleger. 622-641 [doi]