Abstract is missing.
- Disjoint PolymorphismJoão Alpuim, Bruno C. D. S. Oliveira, Zhiyuan Shi. 1-28 [doi]
- Generalizing Inference Systems by CoaxiomsDavide Ancona, Francesco Dagnino, Elena Zucca. 29-55 [doi]
- Observed Communication Semantics for Classical ProcessesRobert Atkey. 56-82 [doi]
- Is Your Software on Dope? - Formal Analysis of Surreptitiously "enhanced" ProgramsPedro R. D'Argenio, Gilles Barthe, Sebastian Biewer, Bernd Finkbeiner, Holger Hermanns. 83-110 [doi]
- Friends with Benefits - Implementing Corecursion in Foundational Proof AssistantsJasmin Christian Blanchette, Aymeric Bouzy, Andreas Lochbihler, Andrei Popescu 0001, Dmitriy Traytel. 111-140 [doi]
- Confluence of Graph Rewriting with InterfacesFilippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi. 141-169 [doi]
- Verifying Robustness of Event-Driven Asynchronous Programs Against ConcurrencyAhmed Bouajjani, Michael Emmi, Constantin Enea, Burcu Kulahcioglu Ozkan, Serdar Tasiran. 170-200 [doi]
- Incremental Update for Graph RewritingPierre Boutillier, Thomas Ehrhard, Jean Krivine. 201-228 [doi]
- Linearity, Control Effects, and Behavioral TypesLuís Caires, Jorge A. Pérez. 229-259 [doi]
- Temporary Read-Only Permissions for Separation LogicArthur Charguéraud, François Pottier. 260-286 [doi]
- Faster Algorithms for Weighted Recursive State MachinesKrishnendu Chatterjee, Bernhard Kragl, Samarth Mishra, Andreas Pavlogiannis. 287-313 [doi]
- ML and Extended Branching VASSConrad Cotton-Barratt, Andrzej S. Murawski, C.-H. Luke Ong. 314-340 [doi]
- Metric Reasoning About \lambda -Terms: The General CaseRaphaëlle Crubillé, Ugo Dal Lago. 341-367 [doi]
- Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and ScoringRyan Culpepper, Andrew Cobb. 368-392 [doi]
- Probabilistic Termination by Monadic Affine Sized TypingUgo Dal Lago, Charles Grellois. 393-419 [doi]
- Caper - Automatic Verification for Fine-Grained ConcurrencyThomas Dinsdale-Young, Pedro da Rocha Pinto, Kristoffer Just Andersen, Lars Birkedal. 420-447 [doi]
- Tackling Real-Life Relaxed Concurrency with FSL++Marko Doko, Viktor Vafeiadis. 448-475 [doi]
- Extensible Datasort RefinementsJoshua Dunfield. 476-503 [doi]
- Programs Using Syntax with First-Class BindersFrancisco Ferreira 0001, Brigitte Pientka. 504-529 [doi]
- LINCX: A Linear Logical Framework with First-Class ContextsAina Linn Georges, Agata Murawska, Shawn Otis, Brigitte Pientka. 530-555 [doi]
- APLicative Programming with Naperian FunctorsJeremy Gibbons. 556-583 [doi]
- Verified Characteristic Formulae for CakeMLArmaël Guéneau, Magnus O. Myreen, Ramana Kumar, Michael Norrish. 584-610 [doi]
- Unified Reasoning About Robustness Properties of Symbolic-Heap Separation LogicChristina Jansen, Jens Katelaan, Christoph Matheja, Thomas Noll, Florian Zuleger. 611-638 [doi]
- Proving Linearizability Using Partial OrdersArtem Khyzha, Mike Dodds, Alexey Gotsman, Matthew J. Parkinson. 639-667 [doi]
- The Power of Non-determinism in Higher-Order Implicit Complexity - Characterising Complexity Classes Using Non-deterministic Cons-Free ProgrammingCynthia Kop, Jakob Grue Simonsen. 668-695 [doi]
- The Essence of Higher-Order Concurrent Separation LogicRobbert Krebbers, Ralf Jung 0002, Ales Bizjak, Jacques-Henri Jourdan, Derek Dreyer, Lars Birkedal. 696-723 [doi]
- Comprehending Isabelle/HOL's ConsistencyOndrej Kuncar, Andrei Popescu 0001. 724-749 [doi]
- The Essence of Functional Programming on Semantic DataMartin Leinberger, Ralf Lämmel, Steffen Staab. 750-776 [doi]
- A Classical Sequent Calculus with Dependent TypesÉtienne Miquey. 777-803 [doi]
- Context-Free Session Type InferenceLuca Padovani. 804-830 [doi]
- Modular Verification of Higher-Order Functional ProgramsRyosuke Sato, Naoki Kobayashi 0001. 831-854 [doi]
- Commutative Semantics for Probabilistic ProgrammingSam Staton. 855-879 [doi]
- Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library SummarizationHao Tang, Di Wang, Yingfei Xiong, Lingming Zhang, Xiaoyin Wang, Lu Zhang 0023. 880-908 [doi]
- A Higher-Order Logic for Concurrent Termination-Preserving RefinementJoseph Tassarotti, Ralf Jung, Robert Harper. 909-936 [doi]
- Modular Verification of Procedure Equivalence in the Presence of Memory AllocationTim Wood, Sophia Drossopolou, Shuvendu K. Lahiri, Susan Eisenbach. 937-963 [doi]
- Abstract Specifications for Concurrent MapsShale Xiong, Pedro da Rocha Pinto, Gian Ntzik, Philippa Gardner. 964-990 [doi]