| 2008 |
| 15 | EE | Luca Roversi:
Weak Affine Light Typing is complete with respect to Safe Recursion on Notation
CoRR abs/0804.0660: (2008) |
| 14 | EE | Ugo Dal Lago,
Luca Roversi,
Luca Vercelli:
Taming Modal Impredicativity: Superlazy Reduction
CoRR abs/0810.2891: (2008) |
| 2007 |
| 13 | EE | Luca Roversi:
Weak Affine Light Typing: Polytime intensional expressivity, soundness and completeness
CoRR abs/0712.4222: (2007) |
| 2003 |
| 12 | EE | Ugo Dal Lago,
Simone Martini,
Luca Roversi:
Higher-Order Linear Ramified Recurrence.
TYPES 2003: 178-193 |
| 2002 |
| 11 | EE | Andrea Asperti,
Luca Roversi:
Intuitionistic Light Affine Logic.
ACM Trans. Comput. Log. 3(1): 137-175 (2002) |
| 2001 |
| 10 | | Antonio Restivo,
Simona Ronchi Della Rocca,
Luca Roversi:
Theoretical Computer Science, 7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001, Proceedings
Springer 2001 |
| 9 | EE | Simona Ronchi Della Rocca,
Luca Roversi:
Intersection Logic.
CSL 2001: 414-428 |
| 2000 |
| 8 | EE | Andrea Asperti,
Luca Roversi:
Light Affine Logic (Proof Nets, Programming Notation, P-Time Correctness and Completeness)
CoRR cs.LO/0006010: (2000) |
| 7 | | Luca Roversi:
Light Affine Logic as a Programming Language: A First Contribution.
Int. J. Found. Comput. Sci. 11(1): 113-152 (2000) |
| 1999 |
| 6 | | Luca Roversi:
A P-Time Completeness Proof for Light Logics.
CSL 1999: 469-483 |
| 5 | | Alberto Pravato,
Simona Ronchi Della Rocca,
Luca Roversi:
The call-by-value [lambda]-calculus: a semantic investigation.
Mathematical Structures in Computer Science 9(5): 617-650 (1999) |
| 1998 |
| 4 | EE | Luca Roversi:
A Polymorphic Language Which Is Typable and Poly-step.
ASIAN 1998: 43-60 |
| 1997 |
| 3 | | Simona Ronchi Della Rocca,
Luca Roversi:
Lambda Calculus and Intuitionistic Linear Logic.
Studia Logica 59(3): 417-448 (1997) |
| 1996 |
| 2 | | Luca Roversi:
A Type-Free Resource-Aware Lambda-Calculus.
CSL 1996: 399-413 |
| 1995 |
| 1 | | Alberto Pravato,
Simona Ronchi Della Rocca,
Luca Roversi:
Categorical semantics of the call-by-value lambda-calculus.
TLCA 1995: 381-396 |