| 2025 | FOSSACS | Sharing and Linear Logic with Restricted Access. | Pablo Barenbaum, Eduardo Bonelli |
| 2023 | CSL | Reductions in Higher-Order Rewriting and Their Equivalence. | Pablo Barenbaum, Eduardo Bonelli |
| 2020 | CSL | Strong Bisimulation for Control Operators (Invited Talk). | Delia Kesner, Eduardo Bonelli, Andrs Viso |
| 2020 | PPDP | Rewrites as Terms through Justification Logic. | Pablo Barenbaum, Eduardo Bonelli |
| 2018 | PPDP | Pattern Matching and Fixed Points: Resource Types and Strong Call-By-Need: Extended Abstract. | Pablo Barenbaum, Eduardo Bonelli, Kareem Mohamed |
| 2014 | POPL | A nonstandard standardization theorem. | Beniamino Accattoli, Eduardo Bonelli, Delia Kesner, Carlos Lombardi |
| 2010 | ICTAC | Justification Logic and History Based Computation. | Francisco Bavera, Eduardo Bonelli |
| 2009 | LFCS | The Logic of Proofs as a Foundation for Certifying Mobile Computation. | Eduardo Bonelli, Federico Feller |
| 2008 | SAC | Type-based information flow analysis for bytecode languages with variable object field policies. | Francisco Bavera, Eduardo Bonelli |
| 2007 | LFCS | The Intensional Lambda Calculus. | Sergei N. Artmov, Eduardo Bonelli |
| 2004 | MFCS | Boxed Ambients with Communication Interfaces. | Eduardo Bonelli, Adriana B. Compagnoni, Mariangiola Dezani-Ciancaglini, Pablo Garralda |
| 2003 | FOSSACS | A Normalisation Result for Higher-Order Calculi with Explicit Substitutions. | Eduardo Bonelli |
| 1999 | CSL | Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting. | Eduardo Bonelli |