| 2019 | A Hierarchy of Monadic Effects for Program Verification Using Equational Reasoning. Reynald Affeldt, David Nowak, Takafumi Saikawa |
| 2019 | An Analysis of Repeated Graph Search. Roland Carl Backhouse |
| 2019 | Certification of Breadth-First Algorithms by Extraction. Dominique Larchey-Wendling, Ralph Matthes |
| 2019 | Coding with Asymmetric Numeral Systems. Jeremy Gibbons |
| 2019 | Completeness and Incompleteness of Synchronous Kleene Algebra. Jana Wagemaker, Marcello M. Bonsangue, Tobias Kappé, Jurriaan Rot, Alexandra Silva |
| 2019 | Cylindric Kleene Lattices for Program Construction. Brijesh Dongol, Ian J. Hayes, Larissa Meinicke, Georg Struth |
| 2019 | En Garde! Unguarded Iteration for Reversible Computation in the Delay Monad. Robin Kaarsgaard, Niccolò Veltri |
| 2019 | Experiments in Information Flow Analysis. Annabelle McIver |
| 2019 | Handling Local State with Global State. Koen Pauwels, Tom Schrijvers, Shin-Cheng Mu |
| 2019 | How to Calculate with Nondeterministic Functions. Richard S. Bird, Florian Rabe |
| 2019 | Mathematics of Program Construction - 13th International Conference, MPC 2019, Porto, Portugal, October 7-9, 2019, Proceedings Graham Hutton |
| 2019 | Self-certifying Railroad Diagrams - Or: How to Teach Nondeterministic Finite Automata. Ralf Hinze |
| 2019 | Setoid Type Theory - A Syntactic Translation. Thorsten Altenkirch, Simon Boulier, Ambrus Kaposi, Nicolas Tabareau |
| 2019 | Shallow Embedding of Type Theory is Morally Correct. Ambrus Kaposi, András Kovács, Nicolai Kraus |
| 2019 | System F in Agda, for Fun and Profit. James Chapman, Roman Kireev, Chad Nester, Philip Wadler |
| 2019 | Unraveling Recursion: Compiling an IR with Recursion to System F. Michael Peyton Jones, Vasilis Gkoumas, Roman Kireev, Kenneth MacKenzie, Chad Nester, Philip Wadler |
| 2019 | Verified Self-Explaining Computation. Jan Stolarek, James Cheney |