Categorical semantics of the call-by-value lambda-calculus. - Alberto Pravato; Simona Ronchi Della Rocca; Luca Roversi (TLCA, 1995)

A Type-Free Resource-Aware Lambda-Calculus. - Luca Roversi (CSL, 1996)

Lambda Calculus and Intuitionistic Linear Logic. - Simona Ronchi Della Rocca; Luca Roversi (Stud Logica, 1997)

A Polymorphic Language Which Is Typable and Poly-step. - Luca Roversi (ASIAN, 1998)

A P-Time Completeness Proof for Light Logics. - Luca Roversi (CSL, 1999)

The call-by-value [lambda]-calculus: a semantic investigation. - Alberto Pravato; Simona Ronchi Della Rocca; Luca Roversi (Math. Struct. Comput. Sci., 1999)

Light Affine Logic (Proof Nets, Programming Notation, P-Time Correctness and Completeness) - Andrea Asperti; Luca Roversi (CoRR, 2000)

Light Affine Logic as a Programming Language: A First Contribution. - Luca Roversi (Int. J. Found. Comput. Sci., 2000)

Intersection Logic. - Simona Ronchi Della Rocca; Luca Roversi (CSL, 2001)

Intuitionistic Light Affine Logic. - Andrea Asperti; Luca Roversi (ACM Trans. Comput. Log., 2002)

Higher-Order Linear Ramified Recurrence. - Ugo Dal Lago; Simone Martini 001; Luca Roversi (TYPES, 2003)

Weak Affine Light Typing: Polytime intensional expressivity, soundness and completeness - Luca Roversi (CoRR, 2007)

Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets. - Luca Roversi; Luca Vercelli (TYPES, 2008)

Weak Affine Light Typing is complete with respect to Safe Recursion on Notation - Luca Roversi (CoRR, 2008)

A Local Criterion for Polynomial-Time Stratified Computations. - Luca Roversi; Luca Vercelli (FOPARA, 2009)

Taming Modal Impredicativity: Superlazy Reduction. - Ugo Dal Lago; Luca Roversi; Luca Vercelli (LFCS, 2009)

A By-Level Analysis of Multiplicative Exponential Linear Logic. - Marco Gaboardi; Luca Roversi; Luca Vercelli (MFCS, 2009)

Safe Recursion on Notation into a Light Logic by Levels - Luca Roversi; Luca Vercelli (DICE, 2010)

Linear lambda calculus with explicit substitutions as proof-search in Deep Inference - Luca Roversi (CoRR, 2010)

Typing a Core Binary-Field Arithmetic in a Light Logic. - Emanuele Cesena; Marco Pedicini; Luca Roversi (FOPARA, 2011)

Linear Lambda Calculus and Deep Inference. - Luca Roversi (TLCA, 2011)

A Modular Database Architecture Enabled to Comparative Sequence Analysis. - Paola Bonfante; Francesca Cordero; Stefano Ghignone; Dino Ienco; Luisa Lanfranco; Giorgio Leonardi; Rosa Meo; Stefania Montani; Luca Roversi; Alessia Visconti (Trans. Large Scale Data Knowl. Centered Syst., 2011)

Extending a system in the calculus of structures with a self-dual quantifier - Luca Roversi (CoRR, 2012)

Communication, and concurrency with logic-based restriction inside a calculus of structures - Luca Roversi (CoRR, 2012)

Intersection Types from a Proof-theoretic Perspective. - Elaine Pimentel; Simona Ronchi Della Rocca; Luca Roversi (Fundam. Informaticae, 2012)

Can a Light Typing Discipline Be Compatible with an Efficient Implementation of Finite Fields Inversion? - Daniele Canavese; Emanuele Cesena; Rachid Ouchary; Marco Pedicini; Luca Roversi (FOPARA, 2013)

A Certified Study of a Reversible Programming Language. - Luca Paolini; Mauro Piccolo; Luca Roversi (TYPES, 2015)

A Class of Reversible Primitive Recursive Functions. - Luca Paolini; Mauro Piccolo; Luca Roversi (ICTCS, 2015)

Light combinators for finite fields arithmetic. - Daniele Canavese; Emanuele Cesena; Rachid Ouchary; Marco Pedicini; Luca Roversi (Sci. Comput. Program., 2015)

A deep inference system with a self-dual binder which is complete for linear lambda calculus. - Luca Roversi (J. Log. Comput., 2016)

The Fixed Point Problem for General and for Linear SRL Programs is Undecidable. - Armando B. Matos; Luca Paolini; Luca Roversi (ICTCS, 2018)

Quantum programming made easy. - Luca Paolini; Luca Roversi; Margherita Zorzi (Linearity-TLLA@FLoC, 2018)

Subatomic systems need not be subatomic. - Luca Roversi (CoRR, 2018)

On a Class of Reversible Primitive Recursive Functions and Its Turing-Complete Extensions. - Luca Paolini; Mauro Piccolo; Luca Roversi (New Gener. Comput., 2018)

Introducing Yet Another REversible Language. - Claudio Grandi; Dariush Moshiri; Luca Roversi (CoRR, 2019)

On the Expressivity of Total Reversible Programming Languages. - Armando B. Matos; Luca Paolini; Luca Roversi (RC, 2020)

Probabilistic Soft Type Assignment. - Gianluca Curzi; Luca Roversi (CoRR, 2020)

A type-assignment of linear erasure and duplication. - Gianluca Curzi; Luca Roversi (Theor. Comput. Sci., 2020)

The fixed point problem of a simple reversible language. - Armando B. Matos; Luca Paolini; Luca Roversi (Theor. Comput. Sci., 2020)

A class of Recursive Permutations which is Primitive Recursive complete. - Luca Paolini; Mauro Piccolo; Luca Roversi (Theor. Comput. Sci., 2020)

Splitting Recursion Schemes into Reversible and Classical Interacting Threads. - Armando B. Matos; Luca Paolini; Luca Roversi (RC, 2021)

Interleaving classical and reversible. - Armando B. Matos; Luca Paolini; Luca Roversi (CoRR, 2021)

Certifying Algorithms and Relevant Properties of Reversible Primitive Permutations with Lean. - Giacomo Maletto; Luca Roversi (RC, 2022)

Programming the Interaction with Quantum Coprocessors. - Ferruccio Damiani; Luca Paolini; Luca Roversi (ERCIM News, 2022)

Host-Core Calculi for Non-classical Computations: A First Insight. - Matteo Palazzo; Luca Paolini; Luca Roversi; Margherita Zorzi (ICTCS, 2024)

Algorithmically Expressive, Always-Terminating Model for Reversible Computation. - Matteo Palazzo; Luca Roversi (RC, 2024)

Quantum-Classical Sentiment Analysis. - Mario Bifulco; Luca Roversi (CoRR, 2024)

Certifying expressive power and algorithms of reversible primitive permutations with Lean. - Giacomo Maletto; Luca Roversi (J. Log. Algebraic Methods Program., 2024)

Towards a Characterization of Two-Way Bijections in a Reversible Computational Model. - Matteo Palazzo; Luca Roversi (RC, 2025)

Termination of rewriting on reversible Boolean circuits as a free 3-category problem. - Adriano Barile; Stefano Berardi; Luca Roversi (Theor. Comput. Sci., 2025)

Reversible Computation with Stacks and "Reversible Management of Failures". - Matteo Palazzo; Luca Roversi (CoRR, 2025)