Follow
Luca Paolini
Title
Cited by
Cited by
Year
The parametric lambda calculus: a metamodel for computation
SR Della Rocca, L Paolini
Springer Science & Business Media, 2013
1292013
Call-by-value Solvability
L Paolini, SR Della Rocca
Rairo-theoretical informatics and applications 33 (6), 507-534, 1999
691999
Call-by-value solvability, revisited
B Accattoli, L Paolini
Functional and Logic Programming: 11th International Symposium, FLOPS 2012 …, 2012
652012
Essential and relational models
L Paolini, M Piccolo, SR Della Rocca
Mathematical Structures in Computer Science 27 (5), 626-650, 2017
362017
A stable programming language
L Paolini
Information and Computation 204 (3), 339-375, 2006
342006
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
332001
Bounding normalization time through intersection types
E De Benedetti, SR Della Rocca
arXiv preprint arXiv:1307.8205, 2013
312013
Parametric parameter passing λ-calculus
L Paolini, SR Della Rocca
Information and Computation 189 (1), 87-106, 2004
262004
Standardization and conservativity of a refined call-by-value lambda-calculus
G Guerrieri, L Paolini, SR Della Rocca
Logical Methods in Computer Science 13, 2017
242017
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
222018
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
212019
Static analysis of featured transition systems
MH Beek, F Damiani, M Lienhardt, F Mazzanti, L Paolini
Proceedings of the 23rd International Systems and Software Product Line …, 2019
202019
A class of reversible primitive recursive functions
L Paolini, M Piccolo, L Roversi
Electronic Notes in Theoretical Computer Science 322, 227-242, 2016
202016
QPCF: Higher-order languages and quantum circuits
L Paolini, M Piccolo, M Zorzi
Journal of Automated Reasoning 63, 941-966, 2019
182019
From featured transition systems to modal transition systems with variability constraints
MH ter Beek, F Damiani, S Gnesi, F Mazzanti, L Paolini
SEFM 2015 Collocated Workshops, 344-359, 2015
182015
Hydrogen production from hydrolysis of magnesium wastes reprocessed by mechanical milling under air
M Rodrķguez, F Niro, G Urretavizcaya, JL Bobet, FJ Castro
International Journal of Hydrogen Energy 47 (8), 5074-5084, 2022
16*2022
: A Language for Quantum Circuit Computations
L Paolini, M Zorzi
International Conference on Theory and Applications of Models of Computation …, 2017
162017
Efficient static analysis and verification of featured transition systems
MH ter Beek, F Damiani, M Lienhardt, F Mazzanti, L Paolini
Empirical Software Engineering 27 (1), 10, 2022
152022
Lazy strong normalization
L Paolini, E Pimentel, SR Della Rocca
Electronic Notes in Theoretical Computer Science 136, 103-116, 2005
152005
A class of recursive permutations which is primitive recursive complete
L Paolini, M Piccolo, L Roversi
Theoretical Computer Science 813, 218-233, 2020
142020
The system can't perform the operation now. Try again later.
Articles 1–20