default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 59 matches
- 2025
- Adriano Barile, Stefano Berardi, Luca Roversi:
Termination of rewriting on reversible Boolean circuits as a free 3-category problem. Theor. Comput. Sci. 1028: 115031 (2025) - 2024
- Giacomo Maletto, Luca Roversi:
Certifying expressive power and algorithms of reversible primitive permutations with Lean. J. Log. Algebraic Methods Program. 136: 100923 (2024) - Matteo Palazzo, Luca Paolini, Luca Roversi, Margherita Zorzi:
Host-Core Calculi for Non-classical Computations: A First Insight. ICTCS 2024: 255-268 - Matteo Palazzo, Luca Roversi:
Algorithmically Expressive, Always-Terminating Model for Reversible Computation. RC 2024: 31-49 - 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] - Adriano Barile, Stefano Berardi, Luca Roversi:
Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem. CoRR abs/2401.02091 (2024) - Matteo Palazzo, Luca Roversi:
Algorithmically Expressive, Always-Terminating Model for Reversible Computation. CoRR abs/2402.19012 (2024) - Mario Bifulco, Luca Roversi:
Quantum-Classical Sentiment Analysis. CoRR abs/2409.16928 (2024) - 2023
- Adriano Barile, Stefano Berardi, Luca Roversi:
Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem. ICTCS 2023: 31-43 - 2022
- Giacomo Maletto, Luca Roversi:
Certifying Algorithms and Relevant Properties of Reversible Primitive Permutations with Lean. RC 2022: 111-127 - Giacomo Maletto, Luca Roversi:
Certifying algorithms and relevant properties of Reversible Primitive Permutations with Lean. CoRR abs/2201.10443 (2022) - Ferruccio Damiani, Luca Paolini, Luca Roversi:
Programming the Interaction with Quantum Coprocessors. ERCIM News 2022(128) (2022) - 2021
- Armando B. Matos, Luca Paolini, Luca Roversi:
Splitting Recursion Schemes into Reversible and Classical Interacting Threads. RC 2021: 204-213 - Armando B. Matos, Luca Paolini, Luca Roversi:
Interleaving classical and reversible. CoRR abs/2102.09436 (2021) - Armando B. Matos, Luca Paolini, Luca Roversi:
Splitting recursion schemes into reversible and classical interacting threads. CoRR abs/2105.04910 (2021) - 2020
- Gianluca Curzi, Luca Roversi:
A type-assignment of linear erasure and duplication. Theor. Comput. Sci. 837: 26-53 (2020) - Armando B. Matos, Luca Paolini, Luca Roversi:
The fixed point problem of a simple reversible language. Theor. Comput. Sci. 813: 143-154 (2020) - Luca Paolini, Mauro Piccolo, Luca Roversi:
A class of Recursive Permutations which is Primitive Recursive complete. Theor. Comput. Sci. 813: 218-233 (2020) - Armando B. Matos, Luca Paolini, Luca Roversi:
On the Expressivity of Total Reversible Programming Languages. RC 2020: 128-143 - Gianluca Curzi, Luca Roversi:
Probabilistic Soft Type Assignment. CoRR abs/2007.01733 (2020) - 2019
- Claudio Grandi, Dariush Moshiri, Luca Roversi:
Introducing Yet Another REversible Language. CoRR abs/1902.05369 (2019) - Gianluca Curzi, Luca Roversi:
A type-assignment of linear erasure and duplication. CoRR abs/1912.12837 (2019) - 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): 233-256 (2018) - Armando B. Matos, Luca Paolini, Luca Roversi:
The Fixed Point Problem for General and for Linear SRL Programs is Undecidable. ICTCS 2018: 128-139 - Luca Paolini, Luca Roversi, Margherita Zorzi:
Quantum programming made easy. Linearity-TLLA@FLoC 2018: 133-147 - Luca Roversi:
Subatomic systems need not be subatomic. CoRR abs/1804.08105 (2018) - 2016
- 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
- Daniele Canavese, Emanuele Cesena, Rachid Ouchary, Marco Pedicini, Luca Roversi:
Light combinators for finite fields arithmetic. Sci. Comput. Program. 111: 365-394 (2015) - Luca Paolini, Mauro Piccolo, Luca Roversi:
A Certified Study of a Reversible Programming Language. TYPES 2015: 7:1-7:21 - Luca Paolini, Mauro Piccolo, Luca Roversi:
A Class of Reversible Primitive Recursive Functions. ICTCS 2015: 227-242
skipping 29 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2025-01-21 10:34 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint