- 2022
- Jeremy Gibbons
, Donnacha Oisín Kidney, Tom Schrijvers, Nicolas Wu:
Breadth-First Traversal via Staging. MPC 2022: 1-33 - Brandon Hewer, Graham Hutton:
Subtyping Without Reduction. MPC 2022: 34-61 - Ralf Hinze, Wouter Swierstra:
Calculating Datastructures. MPC 2022: 62-101 - Dylan McDermott, Tarmo Uustalu:
Flexibly Graded Monads and Graded Algebras. MPC 2022: 102-128 - Minh Nguyen, Nicolas Wu:
Folding over Neural Networks. MPC 2022: 129-150 - Ayumu Saito, Reynald Affeldt:
Towards a Practical Library for Monadic Equational Reasoning in Coq. MPC 2022: 151-177 - Martin Sulzmann, Stefan Wehr:
Semantic Preservation for a Type Directed Translation Scheme of Featherweight Go. MPC 2022: 178-197 - Niccolò Veltri, Niels F. W. Voorneveld:
Streams of Approximations, Equivalence of Recursive Effectful Programs. MPC 2022: 198-221 - Zhixuan Yang, Nicolas Wu:
Fantastic Morphisms and Where to Find Them - A Guide to Recursion Schemes. MPC 2022: 222-267 - Ekaterina Komendantskaya:
Mathematics of Program Construction - 14th International Conference, MPC 2022, Tbilisi, Georgia, September 26-28, 2022, Proceedings. Lecture Notes in Computer Science 13544, Springer 2022, ISBN 978-3-031-16911-3 [contents] - 2019
- Reynald Affeldt, David Nowak, Takafumi Saikawa:
A Hierarchy of Monadic Effects for Program Verification Using Equational Reasoning. MPC 2019: 226-254 - Thorsten Altenkirch, Simon Boulier, Ambrus Kaposi, Nicolas Tabareau:
Setoid Type Theory - A Syntactic Translation. MPC 2019: 155-196 - Roland Carl Backhouse:
An Analysis of Repeated Graph Search. MPC 2019: 298-328 - Richard S. Bird, Florian Rabe:
How to Calculate with Nondeterministic Functions. MPC 2019: 138-154 - James Chapman, Roman Kireev, Chad Nester, Philip Wadler:
System F in Agda, for Fun and Profit. MPC 2019: 255-297 - Brijesh Dongol, Ian J. Hayes, Larissa Meinicke, Georg Struth:
Cylindric Kleene Lattices for Program Construction. MPC 2019: 197-225 - Jeremy Gibbons:
Coding with Asymmetric Numeral Systems. MPC 2019: 444-465 - Ralf Hinze:
Self-certifying Railroad Diagrams - Or: How to Teach Nondeterministic Finite Automata. MPC 2019: 103-137 - Michael Peyton Jones, Vasilis Gkoumas, Roman Kireev, Kenneth MacKenzie, Chad Nester, Philip Wadler:
Unraveling Recursion: Compiling an IR with Recursion to System F. MPC 2019: 414-443 - Robin Kaarsgaard, Niccolò Veltri:
En Garde! Unguarded Iteration for Reversible Computation in the Delay Monad. MPC 2019: 366-384 - Ambrus Kaposi, András Kovács, Nicolai Kraus:
Shallow Embedding of Type Theory is Morally Correct. MPC 2019: 329-365 - Dominique Larchey-Wendling, Ralph Matthes:
Certification of Breadth-First Algorithms by Extraction. MPC 2019: 45-75 - Annabelle McIver:
Experiments in Information Flow Analysis. MPC 2019: 1-17 - Koen Pauwels, Tom Schrijvers, Shin-Cheng Mu:
Handling Local State with Global State. MPC 2019: 18-44 - Jan Stolarek, James Cheney:
Verified Self-Explaining Computation. MPC 2019: 76-102 - Jana Wagemaker, Marcello M. Bonsangue, Tobias Kappé, Jurriaan Rot, Alexandra Silva:
Completeness and Incompleteness of Synchronous Kleene Algebra. MPC 2019: 385-413 - Graham Hutton:
Mathematics of Program Construction - 13th International Conference, MPC 2019, Porto, Portugal, October 7-9, 2019, Proceedings. Lecture Notes in Computer Science 11825, Springer 2019, ISBN 978-3-030-33635-6 [contents] - 2015
- Faris Abou-Saleh, James Cheney, Jeremy Gibbons, James McKinna, Perdita Stevens:
Notions of Bidirectional Computation and Entangled State Monads. MPC 2015: 187-214 - Patrick Bahr:
Calculating Certified Compilers for Non-deterministic Languages. MPC 2015: 159-186 - Rudolf Berghammer:
Column-Wise Extendible Vector Expressions and the Relational Computation of Sets of Sets. MPC 2015: 238-256
