| Complete restrictions of the intersection type discipline S van Bakel Theoretical Computer Science 102 (1), 135-163, 1992 | 220 | 1992 |
| Intersection type assignment systems S van Bakel Theoretical Computer Science 151 (2), 385-435, 1995 | 135 | 1995 |
| Intersection type disciplines in lambda calculus and applicative term rewriting systems SJ van Bakel Mathematisch Centrum, 1993 | 93 | 1993 |
| Intersection types for explicit substitutions S Lengrand, P Lescanne, D Dougherty, M Dezani-Ciancaglini, ... Information and Computation 189 (1), 17-42, 2004 | 70 | 2004 |
| The Language χ: Circuits, Computations and Classical Logic S van Bakel, S Lengrand, P Lescanne Theoretical Computer Science, 81-96, 2005 | 62 | 2005 |
| Principal type schemes for the strict type assignment system S van Bakel Journal of Logic and Computation 3 (6), 643-670, 1993 | 47 | 1993 |
| Strict intersection types for the lambda calculus SV Bakel ACM Computing Surveys (CSUR) 43 (3), 1-49, 2011 | 42 | 2011 |
| Normalization results for typeable rewrite systems S van Bakel, M Fernández Information and Computation 133 (2), 73-116, 1997 | 42 | 1997 |
| Computation with classical sequents S van Bakel, P Lescanne Mathematical Structures in Computer Science 18 (3), 555-609, 2008 | 36 | 2008 |
| Comparing cubes of typed and type assignment systems S van Bakel, L Liquori, S Ronchi Della Rocca, P Urzyczyn Annals of Pure and Applied Logic 86 (3), 267-303, 1997 | 30 | 1997 |
| Rank 2 intersection type assignment in term rewriting systems S van Bakel Fundamenta Informaticae 26 (2), 141-166, 1996 | 26 | 1996 |
| Cut-Elimination in the strict intersection type assignment system is strongly normalizing S van Bakel Notre Dame journal of Formal Logic 45 (1), 35-63, 2004 | 25 | 2004 |
| From X to Pi; Representing the Classical Sequent Calculus in the Pi-calculus S van Bakel, L Cardelli, MG Vigliotti arXiv preprint arXiv:1109.4817, 2011 | 24 | 2011 |
| Completeness and partial soundness results for intersection and union typing for λ¯ μμ̃ S van Bakel Annals of Pure and Applied Logic 161 (11), 1400-1430, 2010 | 24 | 2010 |
| Normalization, approximation, and semantics for combinator systems S van Bakel, M Fernández Theoretical Computer Science 290 (1), 975-1019, 2003 | 21 | 2003 |
| A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types S van Bakel, MG Vigliotti CONCUR 2009-Concurrency Theory: 20th International Conference, CONCUR 2009 …, 2009 | 20 | 2009 |
| The minimal relevant logic and the call-by-value lambda calculus S van Bakel, M Dezani-Ciancaglini, U de’Liguoro, Y Motohama Technical Report TR-ARP-05-2000, The Australian National University 2 (4.1), 2.8, 2000 | 19 | 2000 |
| Partial type assignment in left linear applicative term rewriting systems: Theory, applications and implementation S van Bakel, S Smetsers, S Brock CAAP'92: 17th Colloquium on Trees in Algebra and Programming Rennes, France …, 1992 | 19 | 1992 |
| Sound and complete typing for lambda-mu S van Bakel arXiv preprint arXiv:1101.4425, 2011 | 18 | 2011 |
| A Filter Model for the λμ-Calculus: S Van Bakel, F Barbanera, U de’Liguoro Typed Lambda Calculi and Applications: 10th International Conference, TLCA …, 2011 | 18 | 2011 |
Ugo de'LiguoroUniversità di TorinoVerified email at di.unito.it
