Journals

[1]

Armando B. Matos, Luca Paolini, and Luca Roversi. The fixed point problem of a simple reversible language. Theoretical Computer Science, 813:143 -- 154, 2020. [ bib | DOI | http ]

[2]

Luca Paolini, Mauro Piccolo, and Luca Roversi. A class of recursive permutations which is primitive recursive complete. Theoretical Computer Science, 813:218 -- 233, 2020. [ bib | DOI | http ]

[3]

Gianluca Curzi Luca Roversi. A type-assignment of linear erasure and duplication. THEORETICAL COMPUTER SCIENCE, 837:26--53, 2020. [ bib | DOI | http ]

[4]

L. Paolini, M. Piccolo, and L. Roversi. A class of recursive permutations which is primitive recursive complete. THEORETICAL COMPUTER SCIENCE, 813:218--233, 2020. [ bib | DOI | http ]

[5]

Matos Armando, Paolini Luca, and Roversi Luca. The fixed point problem of a simple reversible language. THEORETICAL COMPUTER SCIENCE, 813:143--154, 2020. [ bib | DOI | http ]

[6]

Luca Paolini, Mauro Piccolo, and Luca Roversi. On a class of reversible primitive recursive functions and its turing-complete extensions. New Generation Computing, 36(3):233--256, July 2018. [ bib | DOI | http ]

[7]

Luca Roversi. A deep inference system with a self-dual binder which is complete for linear lambda calculus. Journal of Logic and Computation, 26(2):677--698, 2016. Preliminary version at https://arxiv.org/abs/1212.4483. [ bib | DOI | http ]

[8]

Luca Paolini, Mauro Piccolo, and Luca Roversi. A class of reversible primitive recursive functions. Electronic Notes in Theoretical Computer Science, 322(18605):227--242, 2016. [ bib | DOI | http ]

[9]

Daniele Canavese, Emanuele Cesena, Rachid Ouchary, Marco Pedicini, and Luca Roversi. Light combinators for finite fields arithmetic. Science of Computer Programming, 111(3):365 --- 394, November 2015. [ bib | DOI | .pdf ]

[10]

Elaine Pimentel, Simonetta Ronchi Della Rocca, and Luca Roversi. Intersection Types from a Proof-theoretic Perspective. Fundamenta Informaticae, 121(1-4):253---274, December 2012. [ bib | .pdf ]

[11]

Andrea Asperti and Luca Roversi. Intuitionistic light affine logic. ACM Trans. Comput. Logic, 3(1):137--175, January 2002. [ bib | DOI | .pdf ]

[12]

Luca Roversi. Light affine logic as a programming language: a first contribution. International Journal of Foundations of Computer Science, 11(1):113 --- 152, March 2000. [ bib | .pdf ]

[13]

Alberto Pravato, Simonetta Ronchi della Rocca, and Luca Roversi. The call by value λ-calculus: a semantic investigation. Mathematical Structures in Computer Science, 9(5):617 --- 650, 1999. [ bib | .pdf ]

[14]

Simonetta Ronchi Della Rocca and Luca Roversi. Lambda calculus and intuitionistic linear logic. Studia Logica, 59(3), 1997. [ bib | .pdf ]