|
Formal Methods in Computing (Most of the papers antecedent to 1995 are not included in the list) |
|||
| FRAMES NO FRAME | ||||
| Luca Roversi | |
|---|---|
| Personal Home Page Type-Hierarchical Overview | |
| Chronological Overview | |
| 2020 | |
| Matos, Paolini and Roversi | "On the Expressivity of Total Reversible Programming Languages" In proceedings. |
| Matos, Paolini and Roversi | "The fixed point problem of a simple reversible language" Article. |
| Paolini, Piccolo and Roversi | "A class of Recursive Permutations which is Primitive Recursive complete" Article. |
| 2019 | |
| Paolini, Roversi and Zorzi | "Quantum Programming Made Easy" In proceedings. |
| 2018 | |
| Paolini, Piccolo and Roversi | "A Certified Study of a Reversible Programming Language" In proceedings: LIPIcs. |
| Paolini, Piccolo and Roversi | "On a Class of Reversible Primitive Recursive Functions and Its Turing-Complete Extensions" Article: New Generation Computing. |
| Paolini, Roversi and Zorzi | "Quantum programming made easy" In proceedings. |
| 2016 | |
| Paolini, Piccolo and Roversi | "A Class of Reversible Primitive Recursive Functions" Article: Electronic Notes in Theoretical Computer Science. |
| Paolini, Piccolo and Roversi | "A Class of Reversible Primitive Recursive Functions" Article. |
| Roversi | "A deep inference system with a self-dual binder which is complete for linear lambda calculus" Article. |
| 2015 | |
| Canavese, Cesena, Ouchary, Pedicini and Roversi | "Light combinators for finite fields arithmetic " Article. |
| Paolini, Piccolo and Roversi | "Big and Small-step Operational Semantics of the Reversible Programming Language Janus" Technical report. |
| 2014 | |
| Canavese, Cesena, Ouchary, Pedicini and Roversi | "Can a light typing discipline be compatible with an efficient implementation of finite fields inversion?" In proceedings. |
| Roversi | "A deep inference system with a self-dual binder which is complete for linear lambda calculus" Article. |
| 2012 | |
| Cesena, Pedicini and Roversi | "Typing a Core Binary-Field Arithmetic in a Light Logic" In proceedings. |
| Pimentel, Ronchi Della Rocca and Roversi | "Intersection Types from a proof-theoretic perspective" Article. |
| Roversi | "Communication, and concurrency with logic-based restriction inside a calculus of structures" Article. |
| Roversi | "Extending a system in the calculus of structures with a self-dual quantifier" Article. |
| 2011 | |
| Roversi | "Linear Lambda Calculus and Deep Inference" In proceedings. |
| 2010 | |
| Cordero, Ghignone, Lanfranco, Leonardi, Meo, Montani and Roversi | "BIOBITS: A Study on Candidatus Glomeribacter Gigasporarum with a Data Warehouse" Book part. |
| Roversi and Vercelli | "A structural and local criterion for polynomial time computations" In proceedings. |
| Roversi | "Linear lambda calculus with explicit substitutions as proof-search in Deep Inference" Unpublished. |
| Roversi and Vercelli | "Safe Recursion on Notation into a Light Logic by Levels" In proceedings. |
| 2009 | |
| Dal Lago, Roversi and Vercelli | "Taming Modal Impredicativity: Superlazy Reduction" In proceedings. |
| Gaboardi, Roversi and Vercelli | "A by-level analysis of Multiplicative Exponential Linear Logic" In proceedings. |
| Roversi and Vercelli | "Some Complexity and Expressiveness results on Multimodal and Stratified Proof-nets" In proceedings. |
| 2008 | |
| Pimentel, Ronchi Della Rocca and Roversi | "Intersection Types from a proof-theoretic perspective" Unpublished. |
| Roversi | "Weak Affine Light Typing is complete with respect to Safe Recursion on Notation" Technical report. |
| 2007 | |
| Roversi | "Weak Affine Light Typing: Intensional expressivity, Polytime soundness and completeness" Technical report. |
| 2005 | |
| Baldoni, Baroglio, De Marchis, Demo, Martelli, Perroteau and Roversi | "Esperienze di E-learning all'interno della Facoltà di Scienze Matematiche, Fisiche e Naturali dell'Università di Torino" In proceedings. |
| Baldoni, Baroglio, Grandi and Roversi | "Live! I-Learn @ Home" In proceedings. |
| Pimentel, Ronchi Della Rocca and Roversi | "Intersection Types: a proof-theoretical approach" In proceedings. |
| 2004 | |
| Dal Lago, Martini and Roversi | "Higer-Order Linear Ramified Recurrence" In proceedings. |
| 2002 | |
| Asperti and Roversi | "Intuitionistic Light Affine Logic" Article. |
| 2001 | |
| Restivo, Ronchi Della Rocca and Roversi | "Theoretical Computer Science - 7th Italian Conference (ICTCS 2001)" Book. |
| Ronchi Della Rocca and Roversi | "Intersection Logic" In proceedings. |
| 2000 | |
| Roversi | "Light Affine Logic as a Programming Language: a First Contribution " Article. |
| 1999 | |
| Pravato, Ronchi Della Rocca and Roversi | "The call by value -calculus: a semantic investigation" Article. |
| Roversi | "A P-Time Completeness Proof for Light Logics" In proceedings. |
| 1998 | |
| Roversi | "A Polymorphic Language which is Typable and Poly-step" In proceedings. |
| Roversi | "Concrete Syntax for Intuitionistic Light Affine Logic with Polymorphic Type Assignment" In proceedings. |
| 1997 | |
| Ronchi Della Rocca and Roversi | "Lambda calculus and Intuitionistic Linear Logic" Article. |
| 1996 | |
| Roversi | "a Type-Free Resource-Aware -Calculus" In proceedings. |
| 1995 | |
| Pravato and Roversi | " considered both as a paradigmatic language and as a meta-language" In proceedings. |
| Roversi | "Semantics of lambda-calculi designed from Intuitionistic linear logic" PhD thesis. |
| 1992 | |
| Roversi | "A compiler from Curry-typed -terms to linear--terms" In proceedings. |
|
Formal Methods in Computing (Most of the papers antecedent to 1995 are not included in the list) |
|||
| FRAMES NO FRAME | ||||
This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)