| 2022 | FSCD | On Quantitative Algebraic Higher-Order Theories. | Ugo Dal Lago, Furio Honsell, Marina Lenisa, Paolo Pistone |
| 2018 | LPAR | The involutions-as-principal types/application-as-unification Analogy. | Alberto Ciaffaglione, Furio Honsell, Marina Lenisa, Ivan Scagnetto |
| 2016 | APLAS | Implementing Cantor's Paradise. | Furio Honsell, Marina Lenisa, Luigi Liquori, Ivan Scagnetto |
| 2013 | CSL | Innocent Game Semantics via Intersection Type Assignment Systems. | Pietro Di Gianantonio, Marina Lenisa |
| 2012 | MFCS | Categories of Coalgebraic Games. | Furio Honsell, Marina Lenisa, Rekha Redamalla |
| 2010 | CONCUR | Efficient Bisimilarities from Second-Order Reaction Semantics for | Pietro Di Gianantonio, Svetlana Jaksic, Marina Lenisa |
| 2009 | CALCO | Conway Games, Coalgebraically. | Furio Honsell, Marina Lenisa |
| 2008 | FOSSACS | RPO, Second-Order Contexts, and lambda-Calculus. | Pietro Di Gianantonio, Furio Honsell, Marina Lenisa |
| 2008 | LPAR | A Conditional Logical Framework. | Furio Honsell, Marina Lenisa, Luigi Liquori, Ivan Scagnetto |
| 2003 | LPAR | Strict Geometry of Interaction Graph Models. | Furio Honsell, Marina Lenisa, Rekha Redamalla |
| 2001 | CSL | Fully Complete Minimal PER Models for the Simply Typed lambda-Calculus. | Samson Abramsky, Marina Lenisa |
| 2000 | CSL | A Fully Complete PER Model for ML Polymorphic Types. | Samson Abramsky, Marina Lenisa |
| 2000 | MFCS | Axiomatizing Fully Complete Models for ML Polymorphic Types. | Samson Abramsky, Marina Lenisa |
| 1999 | FOSSACS | A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects. | Marina Lenisa |
| 1994 | MFCS | Processes and Hyperuniverses. | Michael Forti, Furio Honsell, Marina Lenisa |
| 1993 | MFCS | Some Results on the Full Abstraction Problem for Restricted Lambda Calculi. | Furio Honsell, Marina Lenisa |