| 2026 | CSL | Useful Call-by-Value: A Semantic Interpretation via Quantitative Types. | Pablo Barenbaum, Delia Kesner, Mariana Milicich |
| 2025 | CADE | A Fresh Inductive Approach to Useful Call-by-Value. | Pablo Barenbaum, Delia Kesner, Mariana Milicich |
| 2025 | FOSSACS | Sharing and Linear Logic with Restricted Access. | Pablo Barenbaum, Eduardo Bonelli |
| 2024 | LPAR | Hybrid Intersection Types for PCF. | Pablo Barenbaum, Delia Kesner, Mariana Milicich |
| 2023 | APLAS | A Diamond Machine for Strong Evaluation. | Beniamino Accattoli, Pablo Barenbaum |
| 2023 | CSL | Reductions in Higher-Order Rewriting and Their Equivalence. | Pablo Barenbaum, Eduardo Bonelli |
| 2023 | CSL | Proofs and Refutations for Intuitionistic and Second-Order Logic. | Pablo Barenbaum, Teodoro Freund |
| 2023 | FSCD | Two Decreasing Measures for Simply Typed λ-Terms. | Pablo Barenbaum, Cristian Sottile |
| 2021 | LICS | A Constructive Logic with Classical Proofs and Refutations. | Pablo Barenbaum, Teodoro Freund |
| 2020 | ICTAC | Semantics of a Relational λ-Calculus. | Pablo Barenbaum, Federico Lochbaum, Mariana Milicich |
| 2020 | PPDP | Rewrites as Terms through Justification Logic. | Pablo Barenbaum, Eduardo Bonelli |
| 2018 | APLAS | Factoring Derivation Spaces via Intersection Types. | Pablo Barenbaum, Gonzalo Ciruelos |
| 2018 | PPDP | Pattern Matching and Fixed Points: Resource Types and Strong Call-By-Need: Extended Abstract. | Pablo Barenbaum, Eduardo Bonelli, Kareem Mohamed |
| 2015 | APLAS | A Strong Distillery. | Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza |
| 2014 | ICFP | Distilling abstract machines. | Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza |