The SCEAS System
| |||||||

## Search the dblp DataBase
Luca Roversi:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Luca Roversi
**A Polymorphic Language Which Is Typable and Poly-step.**[Citation Graph (0, 0)][DBLP] ASIAN, 1998, pp:43-60 [Conf] - Simona Ronchi Della Rocca, Luca Roversi
**Intersection Logic.**[Citation Graph (0, 0)][DBLP] CSL, 2001, pp:414-428 [Conf] - Luca Roversi
**A Type-Free Resource-Aware Lambda-Calculus.**[Citation Graph (0, 0)][DBLP] CSL, 1996, pp:399-413 [Conf] - Luca Roversi
**A P-Time Completeness Proof for Light Logics.**[Citation Graph (0, 0)][DBLP] CSL, 1999, pp:469-483 [Conf] - Alberto Pravato, Simona Ronchi Della Rocca, Luca Roversi
**Categorical semantics of the call-by-value lambda-calculus.**[Citation Graph (0, 0)][DBLP] TLCA, 1995, pp:381-396 [Conf] - Ugo Dal Lago, Simone Martini, Luca Roversi
**Higher-Order Linear Ramified Recurrence.**[Citation Graph (0, 0)][DBLP] TYPES, 2003, pp:178-193 [Conf] - Andrea Asperti, Luca Roversi
**Light Affine Logic (Proof Nets, Programming Notation, P-Time Correctness and Completeness)**[Citation Graph (0, 0)][DBLP] CoRR, 2000, v:0, n:, pp:- [Journal] - Luca Roversi
**Light Affine Logic as a Programming Language: A First Contribution.**[Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2000, v:11, n:1, pp:113-152 [Journal] - Alberto Pravato, Simona Ronchi Della Rocca, Luca Roversi
**The call-by-value [lambda]-calculus: a semantic investigation.**[Citation Graph (0, 0)][DBLP] Mathematical Structures in Computer Science, 1999, v:9, n:5, pp:617-650 [Journal] - Simona Ronchi Della Rocca, Luca Roversi
**Lambda Calculus and Intuitionistic Linear Logic.**[Citation Graph (0, 0)][DBLP] Studia Logica, 1997, v:59, n:3, pp:417-448 [Journal] - Andrea Asperti, Luca Roversi
**Intuitionistic Light Affine Logic.**[Citation Graph (0, 0)][DBLP] ACM Trans. Comput. Log., 2002, v:3, n:1, pp:137-175 [Journal] **Taming Modal Impredicativity: Superlazy Reduction.**[Citation Graph (, )][DBLP]**A By-Level Analysis of Multiplicative Exponential Linear Logic.**[Citation Graph (, )][DBLP]**Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets.**[Citation Graph (, )][DBLP]**Weak Affine Light Typing: Polytime intensional expressivity, soundness and completeness**[Citation Graph (, )][DBLP]**Weak Affine Light Typing is complete with respect to Safe Recursion on Notation**[Citation Graph (, )][DBLP]**Taming Modal Impredicativity: Superlazy Reduction**[Citation Graph (, )][DBLP]**Safe Recursion on Notation into a Light Logic by Levels**[Citation Graph (, )][DBLP]
Search in 0.059secs, Finished in 0.060secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |