| Intersection Types and (Positive) Almost-Sure Termination | 0 | 0.34 | 2021 |
| Solvability = Typability Plus Inhabitation | 0 | 0.34 | 2021 |
| Solvability in a Probabilistic Setting (Invited Talk). | 0 | 0.34 | 2020 |
| Lambda Calculus and Probabilistic Computation | 0 | 0.34 | 2019 |
| Inhabitation for Non-idempotent Intersection Types. | 0 | 0.34 | 2018 |
| Observability = Typability + Inhabitation. | 0 | 0.34 | 2018 |
| Essential and relational models. | 1 | 0.35 | 2017 |
| Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus. | 0 | 0.34 | 2017 |
| Intersection Types and Denotational Semantics: An Extended Abstract (Invited Paper). | 0 | 0.34 | 2016 |
| The Ackermann Award 2015. | 0 | 0.34 | 2015 |
| Preface of the special issue on Foundational and Practical Aspects of Resource Analysis (FOPARA) 2009 & 2011. | 0 | 0.34 | 2015 |
| Standardization of a Call-By-Value Lambda-Calculus | 2 | 0.52 | 2015 |
| Observability for Pair Pattern Calculi. | 0 | 0.34 | 2015 |
| Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus. | 1 | 0.38 | 2014 |
| The Inhabitation Problem for Non-idempotent Intersection Types. | 9 | 0.62 | 2014 |
| Bounding Normalization Time Through Intersection Types | 11 | 0.61 | 2013 |
| Intersection Types from a Proof-theoretic Perspective | 5 | 0.47 | 2012 |
| Standardization In Resource Lambda-Calculus | 0 | 0.34 | 2012 |
| Strong normalization from an unusual point of view | 2 | 0.39 | 2011 |
| Solvability in Resource Lambda-Calculus | 18 | 0.83 | 2010 |
| Intersection Logic in sequent calculus style | 0 | 0.34 | 2010 |
| Linearity, Non-determinism and Solvability | 11 | 0.72 | 2010 |
| An Implicit Characterization of PSPACE | 6 | 0.45 | 2010 |
| On tiered small jump operators | 2 | 0.37 | 2009 |
| Intersection, universally quantified, and reference types | 1 | 0.38 | 2009 |
| Guest editorial: Special issue on implicit computational complexity | 12 | 0.58 | 2009 |
| Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators | 2 | 0.40 | 2009 |
| Logical Semantics for Stability | 1 | 0.35 | 2009 |
| From light logics to type assignments: a case study | 1 | 0.35 | 2009 |
| Polynomial Size Analysis of First-Order Shapely Functions | 19 | 0.82 | 2009 |
| Light Logics and the Call-by-Value Lambda Calculus | 9 | 0.55 | 2008 |
| Type Inference for a Polynomial Lambda Calculus | 4 | 0.42 | 2008 |
| Soft Linear Logic and Polynomial Complexity Classes | 7 | 0.47 | 2008 |
| Typed Lambda Calculi and Applications, 8th International Conference, TLCA 2007, Paris, France, June 26-28, 2007, Proceedings | 22 | 1.78 | 2007 |
| Intersection-types à la Church | 12 | 0.70 | 2007 |
| A soft type assignment system for &lambda-calculus | 18 | 0.74 | 2007 |
| An operational characterization of strong normalization | 2 | 0.38 | 2006 |
| Elementary affine logic and the call-by-value lambda calculus | 11 | 0.64 | 2005 |
| Lazy Strong Normalization | 3 | 0.44 | 2005 |
| Towards an Intersection Typed System à la Church | 0 | 0.34 | 2005 |
| Principal Typing for Lambda Calculus in Elementary Affine Logic | 6 | 0.50 | 2005 |
| Parametric parameter passing Lambda-calculus | 3 | 0.49 | 2004 |
| Lazy Logical Semantics | 0 | 0.34 | 2004 |
| Principal typing in elementary affine logic | 7 | 0.65 | 2003 |
| Intersection Typed lambda-calculus | 4 | 0.48 | 2002 |
| Theoretical Computer Science, 7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001, Proceedings | 24 | 2.12 | 2001 |
| Operational semantics and extensionality | 0 | 0.34 | 2000 |
| The call-by-value [lambda]-calculus: a semantic investigation | 4 | 0.47 | 1999 |
| Call-by-value Solvability | 10 | 0.82 | 1999 |
| Structured Operational Semantics of a fragment of the language Scheme | 0 | 0.34 | 1998 |
