Intuitionistic light affine logic A Asperti, L Roversi ACM Transactions on Computational Logic (TOCL) 3 (1), 137-175, 2002 | 139 | 2002 |

Lambda calculus and intuitionistic linear logic SR Della Rocca, L Roversi Studia Logica 59 (3), 417-448, 1997 | 43 | 1997 |

A P-time completeness proof for light logics L Roversi International Workshop on Computer Science Logic, 469-483, 1999 | 41 | 1999 |

Intersection logic SR Della Rocca, L Roversi International Workshop on Computer Science Logic, 414-429, 2001 | 31 | 2001 |

The call-by-value λ-calculus: a semantic investigation A Pravato, SR Della Rocca, L Roversi Mathematical structures in computer science 9 (05), 617-650, 1999 | 28 | 1999 |

Intersection Types from a proof-theoretic perspective E Pimentel, S Ronchi Della Rocca, L Roversi Fundamenta Informaticae 121 (1-4), 253-274, 2012 | 16 | 2012 |

Higher-order linear ramified recurrence U Dal Lago, S Martini, L Roversi International Workshop on Types for Proofs and Programs, 178-193, 2003 | 15 | 2003 |

A class of reversible primitive recursive functions L Paolini, M Piccolo, L Roversi Electronic Notes in Theoretical Computer Science 322, 227-242, 2016 | 14 | 2016 |

Linear lambda calculus and deep inference L Roversi Typed Lambda Calculi and Applications, 184-197, 2011 | 14* | 2011 |

Intersection types: a proof-theoretical approach E Pimentel, SR Della Rocca, L Roversi Fakultät Informatik, 189, 2005 | 14 | 2005 |

Light affine logic as a programming language: a first contribution L Roversi International Journal of Foundations of Computer Science 11 (01), 113-152, 2000 | 14 | 2000 |

A polymorphic language which is typable and poly-step L Roversi Annual Asian Computing Science Conference, 43-60, 1998 | 14 | 1998 |

A deep inference system with a self-dual binder which is complete for linear lambda calculus L Roversi Journal of Logic and Computation 26 (2), 677-698, 2016 | 13 | 2016 |

Some complexity and expressiveness results on multimodal and stratified proof nets L Roversi, L Vercelli International Workshop on Types for Proofs and Programs, 306-322, 2008 | 12 | 2008 |

Safe recursion on notation into a light logic by levels L Roversi, L Vercelli arXiv preprint arXiv:1005.0522, 2010 | 9 | 2010 |

A local criterion for polynomial-time stratified computations L Roversi, L Vercelli Foundational and Practical Aspects of Resource Analysis, 114-130, 2010 | 8* | 2010 |

Categorical semantics of the call-by-value λ-calculus A Pravato, SR Della Rocca, L Roversi International Conference on Typed Lambda Calculi and Applications, 381-396, 1995 | 8 | 1995 |

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 | 6 | 2018 |

A by-level analysis of multiplicative exponential linear logic M Gaboardi, L Roversi, L Vercelli International Symposium on Mathematical Foundations of Computer Science, 344-355, 2009 | 6 | 2009 |

Taming modal impredicativity: Superlazy reduction U Dal Lago, L Roversi, L Vercelli International Symposium on Logical Foundations of Computer Science, 137-151, 2009 | 6 | 2009 |