| 2025 | LICS | Probabilistic Strategies: Definability and the Tensor Completeness Problem. | Nathan J. Bowler, Sergey Goncharov, Paul Blain Levy |
| 2019 | CALCO | Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot. | Paul Blain Levy, Sergey Goncharov |
| 2018 | FOSSACS | A Syntactic View of Computational Adequacy. | Marco Devesas Campos, Paul Blain Levy |
| 2017 | LICS | A monad for full ground reference cells. | Ohad Kammar, Paul Blain Levy, Sean K. Moss, Sam Staton |
| 2017 | LICS | Effectful applicative bisimilarity: Monads, relators, and Howe's method. | Ugo Dal Lago, Francesco Gavazzo, Paul Blain Levy |
| 2017 | POPL | Contextual isomorphisms. | Paul Blain Levy |
| 2015 | CALCO | Final Coalgebras from Corecursive Algebras. | Paul Blain Levy |
| 2014 | CSL | Transition systems over games. | Paul Blain Levy, Sam Staton |
| 2013 | POPL | Universal properties of impure programming languages. | Sam Staton, Paul Blain Levy |
| 2012 | ICFP | Functional programs that explain their work. | Roly Perera, Umut A. Acar, James Cheney, Paul Blain Levy |
| 2012 | LICS | Coproducts of Monads on Set. | Jir Admek, Stefan Milius, Nathan J. Bowler, Paul Blain Levy |
| 2011 | FOSSACS | Similarity Quotients as Final Coalgebras. | Paul Blain Levy |
| 2010 | CiE | Higher-Order Containers. | Thorsten Altenkirch, Paul Blain Levy, Sam Staton |
| 2008 | LICS | Typed Normal Form Bisimulation for Parametric Polymorphism. | Sren B. Lassen, Paul Blain Levy |
| 2007 | CSL | Typed Normal Form Bisimulation. | Sren B. Lassen, Paul Blain Levy |
| 2006 | ICALP | Jumbo | Paul Blain Levy |
| 2002 | CSL | Possible World Semantics for General Storage in Call-By-Value. | Paul Blain Levy |