Luca Roversi

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 26

Top Topics

Recursive Functions

Programming Language

Rewriting Rules

Top Venues

Theor. Comput. Sci.

Publications

Matteo Palazzo, Luca Roversi
Algorithmically Expressive, Always-Terminating Model for Reversible Computation. RC (2024)
Giacomo Maletto, Luca Roversi
Certifying expressive power and algorithms of reversible primitive permutations with Lean. J. Log. Algebraic Methods Program. 136 (2024)
Matteo Palazzo, Luca Roversi
Algorithmically Expressive, Always-Terminating Model for Reversible Computation. CoRR (2024)
Adriano Barile, Stefano Berardi, Luca Roversi
Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem. CoRR (2024)
Adriano Barile, Stefano Berardi, Luca Roversi
Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem. ICTCS (2023)
Ferruccio Damiani, Luca Paolini, Luca Roversi
Programming the Interaction with Quantum Coprocessors. ERCIM News 2022 (128) (2022)
Giacomo Maletto, Luca Roversi
Certifying Algorithms and Relevant Properties of Reversible Primitive Permutations with Lean. RC (2022)
Giacomo Maletto, Luca Roversi
Certifying algorithms and relevant properties of Reversible Primitive Permutations with Lean. CoRR (2022)
Armando B. Matos, Luca Paolini, Luca Roversi
Splitting Recursion Schemes into Reversible and Classical Interacting Threads. RC (2021)
Armando B. Matos, Luca Paolini, Luca Roversi
Interleaving classical and reversible. CoRR (2021)
Armando B. Matos, Luca Paolini, Luca Roversi
Splitting recursion schemes into reversible and classical interacting threads. CoRR (2021)
Armando B. Matos, Luca Paolini, Luca Roversi
The fixed point problem of a simple reversible language. Theor. Comput. Sci. 813 (2020)
Gianluca Curzi, Luca Roversi
A type-assignment of linear erasure and duplication. Theor. Comput. Sci. 837 (2020)
Armando B. Matos, Luca Paolini, Luca Roversi
On the Expressivity of Total Reversible Programming Languages. RC (2020)
Gianluca Curzi, Luca Roversi
Probabilistic Soft Type Assignment. CoRR (2020)
Luca Paolini, Mauro Piccolo, Luca Roversi
A class of Recursive Permutations which is Primitive Recursive complete. Theor. Comput. Sci. 813 (2020)
Gianluca Curzi, Luca Roversi
A type-assignment of linear erasure and duplication. CoRR (2019)
Claudio Grandi, Dariush Moshiri, Luca Roversi
Introducing Yet Another REversible Language. CoRR (2019)
Armando B. Matos, Luca Paolini, Luca Roversi
The Fixed Point Problem for General and for Linear SRL Programs is Undecidable. ICTCS (2018)
Luca Paolini, Mauro Piccolo, Luca Roversi
On a Class of Reversible Primitive Recursive Functions and Its Turing-Complete Extensions. New Gener. Comput. 36 (3) (2018)
Luca Paolini, Luca Roversi, Margherita Zorzi
Quantum programming made easy. Linearity-TLLA@FLoC (2018)
Luca Roversi
Subatomic systems need not be subatomic. CoRR (2018)
Luca Paolini, Mauro Piccolo, Luca Roversi
A Class of Reversible Primitive Recursive Functions. Electron. Notes Theor. Comput. Sci. 322 (2016)
Luca Roversi
A deep inference system with a self-dual binder which is complete for linear lambda calculus. J. Log. Comput. 26 (2) (2016)
Luca Paolini, Mauro Piccolo, Luca Roversi
A Certified Study of a Reversible Programming Language. TYPES (2015)
Daniele Canavese, Emanuele Cesena, Rachid Ouchary, Marco Pedicini, Luca Roversi
Light combinators for finite fields arithmetic. Sci. Comput. Program. 111 (2015)
Daniele Canavese, Emanuele Cesena, Rachid Ouchary, Marco Pedicini, Luca Roversi
Can a Light Typing Discipline Be Compatible with an Efficient Implementation of Finite Fields Inversion? FOPARA (2013)
Luca Roversi
Extending a system in the calculus of structures with a self-dual quantifier CoRR (2012)
Elaine Pimentel, Simona Ronchi Della Rocca, Luca Roversi
Intersection Types from a Proof-theoretic Perspective. Fundam. Informaticae 121 (1-4) (2012)
Luca Roversi
Communication, and concurrency with logic-based restriction inside a calculus of structures CoRR (2012)
Emanuele Cesena, Marco Pedicini, Luca Roversi
Typing a Core Binary-Field Arithmetic in a Light Logic. FOPARA (2011)
Luca Roversi
Linear Lambda Calculus and Deep Inference. TLCA (2011)
Emanuele Cesena, Marco Pedicini, Luca Roversi
Typing a Core Binary Field Arithmetic in a Light Logic CoRR (2011)
Paola Bonfante, Francesca Cordero, Stefano Ghignone, Dino Ienco, Luisa Lanfranco, Giorgio Leonardi, Rosa Meo, Stefania Montani, Luca Roversi, Alessia Visconti
A Modular Database Architecture Enabled to Comparative Sequence Analysis. Trans. Large Scale Data Knowl. Centered Syst. 4 (2011)
Luca Roversi
Linear lambda calculus with explicit substitutions as proof-search in Deep Inference CoRR (2010)
Luca Roversi, Luca Vercelli
Safe Recursion on Notation into a Light Logic by Levels DICE (2010)
Marco Gaboardi, Luca Roversi, Luca Vercelli
A By-Level Analysis of Multiplicative Exponential Linear Logic. MFCS (2009)
Ugo Dal Lago, Luca Roversi, Luca Vercelli
Taming Modal Impredicativity: Superlazy Reduction. LFCS (2009)
Luca Roversi, Luca Vercelli
A Local Criterion for Polynomial-Time Stratified Computations. FOPARA (2009)
Luca Roversi
Weak Affine Light Typing is complete with respect to Safe Recursion on Notation CoRR (2008)
Luca Roversi, Luca Vercelli
Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets. TYPES (2008)
Ugo Dal Lago, Luca Roversi, Luca Vercelli
Taming Modal Impredicativity: Superlazy Reduction CoRR (2008)
Luca Roversi
Weak Affine Light Typing: Polytime intensional expressivity, soundness and completeness CoRR (2007)
Ugo Dal Lago, Simone Martini, Luca Roversi
Higher-Order Linear Ramified Recurrence. TYPES (2003)
Andrea Asperti, Luca Roversi
Intuitionistic Light Affine Logic. ACM Trans. Comput. Log. 3 (1) (2002)
Simona Ronchi Della Rocca, Luca Roversi
Intersection Logic. CSL (2001)
Luca Roversi
Light Affine Logic as a Programming Language: A First Contribution. Int. J. Found. Comput. Sci. 11 (1) (2000)
Andrea Asperti, Luca Roversi
Light Affine Logic (Proof Nets, Programming Notation, P-Time Correctness and Completeness) CoRR (2000)
Alberto Pravato, Simona Ronchi Della Rocca, Luca Roversi
The call-by-value [lambda]-calculus: a semantic investigation. Math. Struct. Comput. Sci. 9 (5) (1999)
Luca Roversi
A P-Time Completeness Proof for Light Logics. CSL (1999)
Luca Roversi
A Polymorphic Language Which Is Typable and Poly-step. ASIAN (1998)
Simona Ronchi Della Rocca, Luca Roversi
Lambda Calculus and Intuitionistic Linear Logic. Stud Logica 59 (3) (1997)
Luca Roversi
A Type-Free Resource-Aware Lambda-Calculus. CSL (1996)
Alberto Pravato, Simona Ronchi Della Rocca, Luca Roversi
Categorical semantics of the call-by-value lambda-calculus. TLCA (1995)