default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuca Roversi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Giacomo Maletto, Luca Roversi
:
Certifying expressive power and algorithms of reversible primitive permutations with Lean. J. Log. Algebraic Methods Program. 136: 100923 (2024)- [c24]Matteo Palazzo, Luca Paolini, Luca Roversi, Margherita Zorzi:
Host-Core Calculi for Non-classical Computations: A First Insight. ICTCS 2024: 255-268 - [c23]Matteo Palazzo, Luca Roversi:
Algorithmically Expressive, Always-Terminating Model for Reversible Computation. RC 2024: 31-49 - [e2]Ugo de'Liguoro, Matteo Palazzo, Luca Roversi:
Proceedings of the 25th Italian Conference on Theoretical Computer Science, Torino, Italy, September 11-13, 2024. CEUR Workshop Proceedings 3811, CEUR-WS.org 2024 [contents] - [i19]Adriano Barile, Stefano Berardi, Luca Roversi:
Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem. CoRR abs/2401.02091 (2024) - [i18]Matteo Palazzo, Luca Roversi:
Algorithmically Expressive, Always-Terminating Model for Reversible Computation. CoRR abs/2402.19012 (2024) - [i17]Mario Bifulco, Luca Roversi:
Quantum-Classical Sentiment Analysis. CoRR abs/2409.16928 (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
- [c21]Giacomo Maletto, Luca Roversi:
Certifying Algorithms and Relevant Properties of Reversible Primitive Permutations with Lean. RC 2022: 111-127 - [i16]Giacomo Maletto, Luca Roversi:
Certifying algorithms and relevant properties of Reversible Primitive Permutations with Lean. CoRR abs/2201.10443 (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) - [j10]Gianluca Curzi, Luca Roversi:
A type-assignment of linear erasure and duplication. Theor. Comput. Sci. 837: 26-53 (2020) - [c19]Armando B. Matos, Luca Paolini, Luca Roversi:
On the Expressivity of Total Reversible Programming Languages. RC 2020: 128-143 - [i12]Gianluca Curzi, Luca Roversi:
Probabilistic Soft Type Assignment. CoRR abs/2007.01733 (2020)
2010 – 2019
- 2019
- [i11]Claudio Grandi, Dariush Moshiri, Luca Roversi:
Introducing Yet Another REversible Language. CoRR abs/1902.05369 (2019) - [i10]Gianluca Curzi, Luca Roversi:
A type-assignment of linear erasure and duplication. CoRR abs/1912.12837 (2019) - 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 - [i9]Luca Roversi:
Subatomic systems need not be subatomic. CoRR abs/1804.08105 (2018) - 2016
- [j8]Luca Roversi:
A deep inference system with a self-dual binder which is complete for linear lambda calculus. J. Log. Comput. 26(2): 677-698 (2016) - 2015
- [j7]Daniele Canavese, Emanuele Cesena, Rachid Ouchary, Marco Pedicini, Luca Roversi:
Light combinators for finite fields arithmetic. Sci. Comput. Program. 111: 365-394 (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 - 2013
- [c14]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: 38-57 - 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) - [i8]Luca Roversi:
Extending a system in the calculus of structures with a self-dual quantifier. CoRR abs/1212.4483 (2012) - [i7]Luca Roversi:
Communication, and concurrency with logic-based restriction inside a calculus of structures. CoRR abs/1212.4669 (2012) - 2011
- [j5]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: 124-147 (2011) - [c13]Emanuele Cesena, Marco Pedicini, Luca Roversi:
Typing a Core Binary-Field Arithmetic in a Light Logic. FOPARA 2011: 19-35 - [c12]Luca Roversi:
Linear Lambda Calculus and Deep Inference. TLCA 2011: 184-197 - [i6]Emanuele Cesena, Marco Pedicini, Luca Roversi:
Typing a Core Binary Field Arithmetic in a Light Logic. CoRR abs/1106.5622 (2011) - 2010
- [c11]Luca Roversi, Luca Vercelli:
Safe Recursion on Notation into a Light Logic by Levels. DICE 2010: 63-77 - [i5]Luca Roversi:
Linear lambda calculus with explicit substitutions as proof-search in Deep Inference. CoRR abs/1011.3668 (2010)
2000 – 2009
- 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 - [i4]Luca Roversi:
Weak Affine Light Typing is complete with respect to Safe Recursion on Notation. CoRR abs/0804.0660 (2008) - [i3]Ugo Dal Lago, Luca Roversi, Luca Vercelli:
Taming Modal Impredicativity: Superlazy Reduction. CoRR abs/0810.2891 (2008) - 2007
- [i2]Luca Roversi:
Weak Affine Light Typing: Polytime intensional expressivity, soundness and completeness. CoRR abs/0712.4222 (2007) - 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
- [j3]Luca Roversi:
Light Affine Logic as a Programming Language: A First Contribution. Int. J. Found. Comput. Sci. 11(1): 113-152 (2000) - [i1]Andrea Asperti, Luca Roversi:
Light Affine Logic (Proof Nets, Programming Notation, P-Time Correctness and Completeness). CoRR cs.LO/0006010 (2000)
1990 – 1999
- 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) - [c4]Luca Roversi:
A P-Time Completeness Proof for Light Logics. CSL 1999: 469-483 - 1998
- [c3]Luca Roversi:
A Polymorphic Language Which Is Typable and Poly-step. ASIAN 1998: 43-60 - 1997
- [j1]Simona Ronchi Della Rocca, Luca Roversi:
Lambda Calculus and Intuitionistic Linear Logic. Stud Logica 59(3): 417-448 (1997) - 1996
- [c2]Luca Roversi:
A Type-Free Resource-Aware Lambda-Calculus. CSL 1996: 399-413 - 1995
- [c1]Alberto Pravato, Simona Ronchi Della Rocca, Luca Roversi:
Categorical semantics of the call-by-value lambda-calculus. TLCA 1995: 381-396
Coauthor Index
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-11-08 20:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
