Vai al contenuto principale
Logo Università
Logo di Dipartimento di Informatica

Dipartimento di Informatica

Dipartimento di Informatica

Seguici su

Logo di Dipartimento di Informatica

Luca Roversi

Professore/Professoressa associato/a

Contatti

Presso

  • Computer Science Department
  • Dipartimento di Informatica
  • Corso di laurea in Informatica
  • Corso di laurea magistrale in Informatica
  • PhD in Computer Science

Prodotti della ricerca selezionati

Adriano Barile; Stefano Berardi; Luca Roversi (2023)
Termination of Rewriting on Reversible Boolean Circuits
https://iris.unito.it/handle/2318/1947732

Giacomo Maletto; Luca Roversi (2023)
Certifying expressive power and algorithms of reversible primitive permutations with Lean
https://iris.unito.it/handle/2318/1948391

Giacomo Maletto; Luca Roversi (2022)
Certifying Algorithms and Relevant Properties of Reversible Primitive Permutations with Lean
https://iris.unito.it/handle/2318/1867901

Felice Cardone; Sergio Rabellino; Luca Roversi (2022)
UN ASSETTO MOODLE PER L’ESAME ONLINE DI UN CORSO DI PROGRAMMAZIONE
https://iris.unito.it/handle/2318/1889509

Armando Matos; Paolini Luca; Roversi Luca (2021)
Splitting Recursion Schemes into Reversible and Classical Interacting Threads
https://iris.unito.it/handle/2318/1794961

Armando Matos, Luca Paolini, Luca Roversi (2020)
The fixed point problem of a simple reversible language.
https://iris.unito.it/handle/2318/1734164

Paolini L , Piccolo M , Roversi L (2020)
A class of Recursive Permutations which is Primitive Recursive complete.
https://iris.unito.it/handle/2318/1734163

Paolini, Luca, Roversi, Luca, Zorzi, Margherita (2019)
Quantum programming made easy.
https://iris.unito.it/handle/2318/1703918

Luca Paolini, Mauro Piccolo, Luca Roversi (2018)
A certified study of a reversible programming language.
https://iris.unito.it/handle/2318/99058

Matos, Armando B , Paolini, Luca, Roversi, Luca (2018)
The fixed point problem for general and for linear SRL programs is undecidable.
https://iris.unito.it/handle/2318/1683911

Luca Paolini, Mauro Piccolo , Luca Roversi (2018)
On a Class of Reversible Primitive Recursive Functions and Its Turing-Complete Extensions.
https://iris.unito.it/handle/2318/1677880

Paolini, Luca, Piccolo, Mauro, Roversi, Luca (2016)
A Class of Reversible Primitive Recursive Functions.
https://iris.unito.it/handle/2318/1558982

Canavese, D , Cesena, E , Ouchary, R , Pedicini, M , Roversi, L (2015)
Light combinators for finite fields arithmetic.
https://iris.unito.it/handle/2318/1526049

L Roversi (2014)
A deep inference system with a self-dual binder which is complete for linear lambda calculus.
https://iris.unito.it/handle/2318/151481

L Roversi (2012)
Communication, and concurrency with logic-based restriction inside a calculus of structures.
https://iris.unito.it/handle/2318/147814

E Pimentel, L Roversi, S Ronchi Della Rocca (2012)
Intersection types from a proof theoretic perspective.
https://iris.unito.it/handle/2318/126871

Emanuele Cesena, Marco Pedicini, Luca Roversi (2012)
Typing a Core Binary-Field Arithmetic in a Light Logic.
https://iris.unito.it/handle/2318/101493

P Bonfante, F Cordero, S Ghignone, D Ienco, L Lanfranco, G Leonardi, R Meo, S Montani, L Roversi, A Visconti (2011)
A modular database architecture enabled to comparative sequence analysis.
https://iris.unito.it/handle/2318/91448

Luca Roversi (2011)
Linear Lambda Calculus and Deep Inference.
https://iris.unito.it/handle/2318/92530

Luca Roversi, Luca Vercelli (2010)
A local criterion for polynomial-time stratified computations.
https://iris.unito.it/handle/2318/85119

Francesca Cordero, Stefano Ghignone, Luisa Lanfranco, Giorgio Leonardi, Rosa Meo, Stefania Montani, Luca Roversi (2010)
BIOBITS: A Study on Candidatus Glomeribacter Gigasporarum with a Data Warehouse.
https://iris.unito.it/handle/2318/81397

Luca Roversi, Luca Vercelli (2010)
Safe Recursion on Notation into a Light Logic by Levels.
https://iris.unito.it/handle/2318/131262

Ugo Dal Lago, Luca Roversi, Luca Vercelli (2009)
Taming Modal Impredicativity: Superlazy Reduction.
https://iris.unito.it/handle/2318/84359

Luca Roversi, Luca Vercelli (2009)
Some Complexity and Expressiveness results on Multimodal andStratified Proof-nets.
https://iris.unito.it/handle/2318/101465

Marco Gaboardi, Luca Roversi, Luca Vercelli (2009)
A by-level analysis of Multiplicative Exponential Linear Logic.
https://iris.unito.it/handle/2318/86918

Matteo Baldoni, Cristina Baroglio, Claudio Grandi, Luca Roversi (2007)
Live! I-Learn @ Home, versione 2007.
https://iris.unito.it/handle/2318/85657

M Baldoni, C Baroglio, C Grandi, C Mattutino, L Roversi (2007)
CD_ROM live per il supporto online alla didattica: l'esperienza di Live! I-Learn @ Home.
https://iris.unito.it/handle/2318/49924

M Baldoni, C Baroglio, C Grandi, L Roversi (2005)
Live! I-Learn @ Home.
https://iris.unito.it/handle/2318/28808

Luca Roversi (2004)
MR1989176 (2004g:03037) Danos, Vincent(F-CNRS); Joinet, Jean-Baptiste(F-PARIS1) Linear logic and elementary time. (English summary) Special issue: ICC'99 (Trento). Inform. and Comput. 183 (2003), no. 1, 123--137.
https://iris.unito.it/handle/2318/65622

U DAL LAGO, MARTINI, L ROVERSI (2004)
Higer-Order Linear Ramified Recurrence.
https://iris.unito.it/handle/2318/23065

ASPERTI, L ROVERSI (2002)
Intuitionistic light affine logic.
https://iris.unito.it/handle/2318/23062

RESTIVO A , RONCHI DELLA ROCCA S , ROVERSI L (2001)
Theoretical Computer Science7th Italian Conference, ICTCS 2001 Torino, Italy, October 4–6, 2001 Proceedings(LNCS).
https://iris.unito.it/handle/2318/63802

S RONCHI DELLA ROCCA, L ROVERSI (2001)
Intersection Logic.
https://iris.unito.it/handle/2318/23066

L ROVERSI (2000)
Light Affine Logic as a Programming Language: a First Contribution.
https://iris.unito.it/handle/2318/23063

L ROVERSI (1999)
A P-Time Completeness Proof for Light Logics.
https://iris.unito.it/handle/2318/23067

PRAVATO, S RONCHI DELLA ROCCA, L ROVERSI (1999)
The call by value Lambda-calculus: a semantic investigation.
https://iris.unito.it/handle/2318/23064

L ROVERSI (1998)
A Polymorphic Language which is Typable and Poly-step.
https://iris.unito.it/handle/2318/23068

L ROVERSI (1998)
Concrete Syntax for Intuitionistic Light Affine Logic with Polymorphic Type Assignment.
https://iris.unito.it/handle/2318/43243

S RONCHI DELLA ROCCA, L ROVERSI (1997)
Lambda Calculus and Intuitionistic Linear Logic.
https://iris.unito.it/handle/2318/41226

L ROVERSI (1996)
A Type-Free Resource-Aware Lambda-Calculus.
https://iris.unito.it/handle/2318/23069

PRAVATO A , S RONCHI DELLA ROCCA, ROVERSI L (1995)
Categorical semantics of the call-by-value lambda calculus.
https://iris.unito.it/handle/2318/40602

Insegnamenti

Gruppi di ricerca

Attività in agenda

Consulta la mia agenda

Organi

Ricevimento studenti

Please, send me an email, if you need to meet me.

Luca Roversi is an associate professor in Computer Science.

From 2001 to 2013, he was a lecturer at the former Faculty of Political Sciences -- Turin. Since 2014, he has been teaching at the Department of Computer Science -- Turin, where he graduated in Computer Science in 1990.

He obtained his PhD in Computer Science from the Department of Computer Science -- Pisa in 1995.

He spent post-doctoral periods at the Computer Science Department of Brandeis University -- Boston, and at the Institut de Mathématiques de Luminy -- Marseille as a TMR --- Marie Curie fellow.

His current research activity is carried out at the Department of Computer Science -- Turin, where he was a researcher. His research is in theoretical computer science with a particular interest in formal methods for computational models. He has written articles on lambda-calculus, type theory, applications of category theory, linear and resource logic, deep-inference, and reversible/quantum computing.

He was a member of the Executive Board of the Italian Association of Logic and Applications (AILA.)

He is a member of the Executive Board of the Italian Chapter of the European Association of Theoretical Computer Science (IC-EATCS.)

Ultimo aggiornamento: 28/04/2024 19:52
Location: http://informatica.unito.it/robots.html
Non cliccare qui!