| The parametric lambda calculus: a metamodel for computation SR Della Rocca, L Paolini Springer Science & Business Media, 2013 | 122 | 2013 |
| Call-by-value Solvability L Paolini, SR Della Rocca Rairo-theoretical informatics and applications 33 (6), 507-534, 1999 | 62 | 1999 |
| Call-by-value solvability, revisited B Accattoli, L Paolini Functional and Logic Programming: 11th International Symposium, FLOPS 2012 …, 2012 | 51 | 2012 |
| Essential and relational models L Paolini, M Piccolo, SR Della Rocca Mathematical Structures in Computer Science 27 (5), 626-650, 2017 | 36 | 2017 |
| A stable programming language L Paolini Information and Computation 204 (3), 339-375, 2006 | 35 | 2006 |
| Call-by-value separability and computability A Restivo, SR Della Rocca, L Roversi, L Paolini Theoretical Computer Science: 7th Italian Conference, ICTCS 2001 Torino …, 2001 | 33 | 2001 |
| Bounding normalization time through intersection types E De Benedetti, SR Della Rocca arXiv preprint arXiv:1307.8205, 2013 | 32 | 2013 |
| Parametric parameter passing λ-calculus L Paolini, SR Della Rocca Information and Computation 189 (1), 87-106, 2004 | 27 | 2004 |
| On a class of reversible primitive recursive functions and its turing-complete extensions L Paolini, M Piccolo, L Roversi New Generation Computing 36 (3), 233-256, 2018 | 18 | 2018 |
| Standardization and conservativity of a refined call-by-value lambda-calculus G Guerrieri, L Paolini, SR Della Rocca arXiv preprint arXiv:1611.07255, 2016 | 18 | 2016 |
| A class of reversible primitive recursive functions L Paolini, M Piccolo, L Roversi Electronic Notes in Theoretical Computer Science 322, 227-242, 2016 | 18 | 2016 |
| From featured transition systems to modal transition systems with variability constraints MH ter Beek, F Damiani, S Gnesi, F Mazzanti, L Paolini Software Engineering and Formal Methods: 13th International Conference, SEFM …, 2015 | 17 | 2015 |
| Lazy strong normalization L Paolini, E Pimentel, SR Della Rocca Electronic Notes in Theoretical Computer Science 136, 103-116, 2005 | 16 | 2005 |
| Syntactical, operational and denotational linearity MG Gaboardi, L Paolini Linear Logic, Ludics, Implicit Complexity and Operator Algebras, 1-3, 2007 | 15 | 2007 |
| On the expressiveness of modal transition systems with variability constraints MH ter Beek, F Damiani, S Gnesi, F Mazzanti, L Paolini Science of Computer Programming 169, 1-17, 2019 | 14 | 2019 |
| A formal model for multi SPLs F Damiani, M Lienhardt, L Paolini Fundamentals of Software Engineering: 7th International Conference, FSEN …, 2017 | 14 | 2017 |
| Standardization of a call-by-value lambda-calculus G Guerrieri, L Paolini, S Ronchi Della Rocca 13th International Conference on Typed Lambda Calculi and Applications (TLCA …, 2015 | 14 | 2015 |
| A formal model for multi software product lines F Damiani, M Lienhardt, L Paolini Science of Computer Programming 172, 203-231, 2019 | 13 | 2019 |
| : A Language for Quantum Circuit Computations L Paolini, M Zorzi Theory and Applications of Models of Computation: 14th Annual Conference …, 2017 | 13 | 2017 |
| Semantically linear programming languages L Paolini, M Piccolo Proceedings of the 10th international ACM SIGPLAN conference on Principles …, 2008 | 13 | 2008 |
Luca RoversiProfessor of Computer Science, Università di TorinoVerified email at di.unito.it
