default search action
Luca Roversi
- > Home > Persons > Luca Roversi
Publications
- 2024
- [i18]Adriano Barile, Stefano Berardi, Luca Roversi:
Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem. CoRR abs/2401.02091 (2024) - 2023
- [c22]Adriano Barile, Stefano Berardi, Luca Roversi:
Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem. ICTCS 2023: 31-43 - 2022
- [i15]Ferruccio Damiani, Luca Paolini, Luca Roversi:
Programming the Interaction with Quantum Coprocessors. ERCIM News 2022(128) (2022) - 2021
- [c20]Armando B. Matos, Luca Paolini, Luca Roversi:
Splitting Recursion Schemes into Reversible and Classical Interacting Threads. RC 2021: 204-213 - [i14]Armando B. Matos, Luca Paolini, Luca Roversi:
Interleaving classical and reversible. CoRR abs/2102.09436 (2021) - [i13]Armando B. Matos, Luca Paolini, Luca Roversi:
Splitting recursion schemes into reversible and classical interacting threads. CoRR abs/2105.04910 (2021) - 2020
- [j12]Armando B. Matos, Luca Paolini, Luca Roversi:
The fixed point problem of a simple reversible language. Theor. Comput. Sci. 813: 143-154 (2020) - [j11]Luca Paolini, Mauro Piccolo, Luca Roversi:
A class of Recursive Permutations which is Primitive Recursive complete. Theor. Comput. Sci. 813: 218-233 (2020) - [c19]Armando B. Matos, Luca Paolini, Luca Roversi:
On the Expressivity of Total Reversible Programming Languages. RC 2020: 128-143 - 2018
- [j9]Luca Paolini, Mauro Piccolo, Luca Roversi:
On a Class of Reversible Primitive Recursive Functions and Its Turing-Complete Extensions. New Gener. Comput. 36(3): 233-256 (2018) - [c18]Armando B. Matos, Luca Paolini, Luca Roversi:
The Fixed Point Problem for General and for Linear SRL Programs is Undecidable. ICTCS 2018: 128-139 - [c17]Luca Paolini, Luca Roversi, Margherita Zorzi:
Quantum programming made easy. Linearity-TLLA@FLoC 2018: 133-147 - 2015
- [c16]Luca Paolini, Mauro Piccolo, Luca Roversi:
A Certified Study of a Reversible Programming Language. TYPES 2015: 7:1-7:21 - [c15]Luca Paolini, Mauro Piccolo, Luca Roversi:
A Class of Reversible Primitive Recursive Functions. ICTCS 2015: 227-242 - 2012
- [j6]Elaine Pimentel, Simona Ronchi Della Rocca, Luca Roversi:
Intersection Types from a Proof-theoretic Perspective. Fundam. Informaticae 121(1-4): 253-274 (2012) - 2010
- [c11]Luca Roversi, Luca Vercelli:
Safe Recursion on Notation into a Light Logic by Levels. DICE 2010: 63-77 - 2009
- [c10]Luca Roversi, Luca Vercelli:
A Local Criterion for Polynomial-Time Stratified Computations. FOPARA 2009: 114-130 - [c9]Ugo Dal Lago, Luca Roversi, Luca Vercelli:
Taming Modal Impredicativity: Superlazy Reduction. LFCS 2009: 137-151 - [c8]Marco Gaboardi, Luca Roversi, Luca Vercelli:
A By-Level Analysis of Multiplicative Exponential Linear Logic. MFCS 2009: 344-355 - 2008
- [c7]Luca Roversi, Luca Vercelli:
Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets. TYPES 2008: 306-322 - [i3]Ugo Dal Lago, Luca Roversi, Luca Vercelli:
Taming Modal Impredicativity: Superlazy Reduction. CoRR abs/0810.2891 (2008) - 2003
- [c6]Ugo Dal Lago, Simone Martini, Luca Roversi:
Higher-Order Linear Ramified Recurrence. TYPES 2003: 178-193 - 2002
- [j4]Andrea Asperti, Luca Roversi:
Intuitionistic Light Affine Logic. ACM Trans. Comput. Log. 3(1): 137-175 (2002) - 2001
- [c5]Simona Ronchi Della Rocca, Luca Roversi:
Intersection Logic. CSL 2001: 414-428 - [e1]Antonio Restivo, Simona Ronchi Della Rocca, Luca Roversi:
Theoretical Computer Science, 7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001, Proceedings. Lecture Notes in Computer Science 2202, Springer 2001, ISBN 3-540-42672-8 [contents] - 2000
- [i1]Andrea Asperti, Luca Roversi:
Light Affine Logic (Proof Nets, Programming Notation, P-Time Correctness and Completeness). CoRR cs.LO/0006010 (2000) - 1999
- [j2]Alberto Pravato, Simona Ronchi Della Rocca, Luca Roversi:
The call-by-value [lambda]-calculus: a semantic investigation. Math. Struct. Comput. Sci. 9(5): 617-650 (1999) - 1997
- [j1]Simona Ronchi Della Rocca, Luca Roversi:
Lambda Calculus and Intuitionistic Linear Logic. Stud Logica 59(3): 417-448 (1997) - 1995
- [c1]Alberto Pravato, Simona Ronchi Della Rocca, Luca Roversi:
Categorical semantics of the call-by-value lambda-calculus. TLCA 1995: 381-396
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint