The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Luca Roversi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Luca Roversi
    A Polymorphic Language Which Is Typable and Poly-step. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1998, pp:43-60 [Conf]
  2. Simona Ronchi Della Rocca, Luca Roversi
    Intersection Logic. [Citation Graph (0, 0)][DBLP]
    CSL, 2001, pp:414-428 [Conf]
  3. Luca Roversi
    A Type-Free Resource-Aware Lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    CSL, 1996, pp:399-413 [Conf]
  4. Luca Roversi
    A P-Time Completeness Proof for Light Logics. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:469-483 [Conf]
  5. 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]
  6. Ugo Dal Lago, Simone Martini, Luca Roversi
    Higher-Order Linear Ramified Recurrence. [Citation Graph (0, 0)][DBLP]
    TYPES, 2003, pp:178-193 [Conf]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]

  12. Taming Modal Impredicativity: Superlazy Reduction. [Citation Graph (, )][DBLP]


  13. A By-Level Analysis of Multiplicative Exponential Linear Logic. [Citation Graph (, )][DBLP]


  14. Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets. [Citation Graph (, )][DBLP]


  15. Weak Affine Light Typing: Polytime intensional expressivity, soundness and completeness [Citation Graph (, )][DBLP]


  16. Weak Affine Light Typing is complete with respect to Safe Recursion on Notation [Citation Graph (, )][DBLP]


  17. Taming Modal Impredicativity: Superlazy Reduction [Citation Graph (, )][DBLP]


  18. Safe Recursion on Notation into a Light Logic by Levels [Citation Graph (, )][DBLP]


Search in 0.059secs, Finished in 0.060secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002