The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrea Asperti: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andrea Asperti, Cecilia Giovanetti, Andrea Naletto
    The Bologna Optimal Higher-Order Machine. [Citation Graph (1, 0)][DBLP]
    J. Funct. Program., 1996, v:6, n:6, pp:763-810 [Journal]
  2. Andrea Asperti, Giuseppe Longo
    Relating Type-Structures: Partial Variations on a Theme of Friedman and Statman. [Citation Graph (0, 0)][DBLP]
    CAAP, 1986, pp:266-287 [Conf]
  3. Andrea Asperti, Agata Ciabattoni
    Effective Applicative Structures. [Citation Graph (0, 0)][DBLP]
    Category Theory and Computer Science, 1995, pp:81-95 [Conf]
  4. Andrea Asperti, Luca Padovani, Claudio Sacerdoti Coen, Irene Schena
    XML, Stylesheets and the Re-mathematization of Formal Content. [Citation Graph (0, 0)][DBLP]
    Extreme Markup Languages®, 2001, pp:- [Conf]
  5. Andrea Asperti, Cosimo Laneve
    Interaction Systems. [Citation Graph (0, 0)][DBLP]
    HOA, 1993, pp:1-19 [Conf]
  6. Andrea Asperti, Cosimo Laneve
    On the Dynamics of Sharing Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:259-269 [Conf]
  7. Andrea Asperti, Simone Martini
    Projections Instead of Variables: A Category Theoretic Interpretation of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1989, pp:337-352 [Conf]
  8. Andrea Asperti, Bernd Wegner
    MOWGLI - An Approach to Machine-Understandable Representation of the Mathematical Information in Digital Documents. [Citation Graph (0, 0)][DBLP]
    Electronic Information and Communication in Mathematics, 2002, pp:14-23 [Conf]
  9. Andrea Asperti
    Category Theory: Basic notions and general philosophy. [Citation Graph (0, 0)][DBLP]
    JFPLC, 1994, pp:307-108 [Conf]
  10. Andrea Asperti, Giovanna M. Dore
    Yet Another Correctness Criterion for Multiplicative Linear Logic with MIX. [Citation Graph (0, 0)][DBLP]
    LFCS, 1994, pp:34-46 [Conf]
  11. Andrea Asperti
    Light Affine Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:300-308 [Conf]
  12. Andrea Asperti, Vincent Danos, Cosimo Laneve, Laurent Regnier
    Paths in the lambda-calculus [Citation Graph (0, 0)][DBLP]
    LICS, 1994, pp:426-436 [Conf]
  13. Andrea Asperti, Herman Geuvers, Iris Loeb, Lionel Elie Mamane, Claudio Sacerdoti Coen
    An Interactive Algebra Course with Formalised Proofs and Definitions. [Citation Graph (0, 0)][DBLP]
    MKM, 2005, pp:315-329 [Conf]
  14. Andrea Asperti, Matteo Selmi
    Efficient Retrieval of Mathematical Statements. [Citation Graph (0, 0)][DBLP]
    MKM, 2004, pp:17-31 [Conf]
  15. Andrea Asperti
    Integrating Strict and Lazy Evaluation: The lambda-sl-Calculus. [Citation Graph (0, 0)][DBLP]
    PLILP, 1990, pp:238-254 [Conf]
  16. Andrea Asperti
    Optimal Reduction of Functional Expressions. [Citation Graph (0, 0)][DBLP]
    PLILP/ALP, 1998, pp:427-428 [Conf]
  17. Andrea Asperti
    On the Complexity of Beta-Reduction. [Citation Graph (0, 0)][DBLP]
    POPL, 1996, pp:110-118 [Conf]
  18. Andrea Asperti, Paolo Coppola, Simone Martini
    (Optimal) Duplication is not Elementary Recursive. [Citation Graph (0, 0)][DBLP]
    POPL, 2000, pp:96-107 [Conf]
  19. Andrea Asperti, Gian Luigi Ferrari, Roberto Gorrieri
    Implicative Formulae in the ``Proofs as Computations'' Analogy. [Citation Graph (0, 0)][DBLP]
    POPL, 1990, pp:59-71 [Conf]
  20. Andrea Asperti, Harry G. Mairson
    Parallel Beta Reduction is not Elementary Recursive. [Citation Graph (0, 0)][DBLP]
    POPL, 1998, pp:303-315 [Conf]
  21. Andrea Corradini, Andrea Asperti
    A Categorial Model for Logic Programs: Indexed Monoidal Categories. [Citation Graph (0, 0)][DBLP]
    REX Workshop, 1992, pp:110-137 [Conf]
  22. Andrea Asperti
    deltao!Epsilon = 1 - Optimizing Optimal lambda-Calculus Implementations. [Citation Graph (0, 0)][DBLP]
    RTA, 1995, pp:102-116 [Conf]
  23. Andrea Asperti, Cosimo Laneve
    Paths, Computations and Labels in the Lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:152-167 [Conf]
  24. Andrea Asperti, Cosimo Laneve
    The Family Relation in Interaction Systems. [Citation Graph (0, 0)][DBLP]
    TACS, 1994, pp:366-384 [Conf]
  25. Andrea Asperti, Cosimo Laneve
    Optimal Reductions in Interaction Systems. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:485-500 [Conf]
  26. Andrea Asperti, Cosimo Laneve
    Comparing Lambda-calculus translations in Sharing Graphs. [Citation Graph (0, 0)][DBLP]
    TLCA, 1995, pp:1-15 [Conf]
  27. Andrea Asperti, Luca Padovani, Claudio Sacerdoti Coen, Irene Schena
    HELM and the Semantic Math-Web. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2001, pp:59-74 [Conf]
  28. Andrea Asperti, Ferruccio Guidi, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli
    A Content Based Mathematical Search Engine: Whelp. [Citation Graph (0, 0)][DBLP]
    TYPES, 2004, pp:17-32 [Conf]
  29. Andrea Asperti, Juliusz Chroboczek
    Safe Operators: Brackets Closed Forever Optimizing Optimal lambda-Calculus Implementations. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1997, v:8, n:6, pp:437-468 [Journal]
  30. Andrea Asperti, Luca Padovani, Claudio Sacerdoti Coen, Ferruccio Guidi, Irene Schena
    Mathematical Knowledge Management in HELM. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2003, v:38, n:1-3, pp:27-46 [Journal]
  31. 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]
  32. Andrea Asperti
    Linear Logic, Comonads and Optimal Reduction. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1995, v:22, n:1/2, pp:3-22 [Journal]
  33. Andrea Asperti
    Stability and Computability in Coherent Domains [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:86, n:2, pp:115-139 [Journal]
  34. Andrea Asperti, Paolo Coppola, Simone Martini
    (Optimal) duplication is not elementary recursive. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:193, n:1, pp:21-56 [Journal]
  35. Andrea Asperti, Harry G. Mairson
    Parallel Beta Reduction Is Not Elementary Recursive. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:170, n:1, pp:49-80 [Journal]
  36. Andrea Asperti, Simone Martini
    Categorical Models of Polymorphism [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:99, n:1, pp:1-79 [Journal]
  37. Andrea Asperti
    A Categorical Understanding of Environment Machines. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1992, v:2, n:1, pp:23-59 [Journal]
  38. Andrea Asperti, Agata Ciabattoni
    A Sufficient Condition for Completability of Partial Combinatory Algebras. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1997, v:62, n:4, pp:1209-1214 [Journal]
  39. Andrea Asperti
    Causal Dependencies in Multiplicative Linear Logic with MIX. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1995, v:5, n:3, pp:351-380 [Journal]
  40. Andrea Asperti, Cosimo Laneve
    Interaction Systems I: The Theory of Optimal Reductions. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1994, v:4, n:4, pp:457-504 [Journal]
  41. Andrea Asperti, Cosimo Laneve
    Paths, Computations and Labels in the lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:142, n:2, pp:277-297 [Journal]
  42. Andrea Asperti, Cosimo Laneve
    Interaction Systems II: The Practice of Optimal Reductions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:159, n:2, pp:191-244 [Journal]
  43. 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]
  44. Andrea Asperti, Enrico Tassi
    Higher order Proof Reconstruction from Paramodulation-Based Refutations: The Unit Equality Case. [Citation Graph (0, 0)][DBLP]
    Calculemus/MKM, 2007, pp:146-160 [Conf]
  45. Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli
    Crafting a Proof Assistant. [Citation Graph (0, 0)][DBLP]
    TYPES, 2006, pp:18-32 [Conf]
  46. Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli
    User Interaction with the Matita Proof Assistant. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2007, v:39, n:2, pp:109-139 [Journal]

  47. Smart Matching. [Citation Graph (, )][DBLP]


  48. Some Considerations on the Usability of Interactive Provers. [Citation Graph (, )][DBLP]


  49. The intensional content of Rice's theorem. [Citation Graph (, )][DBLP]


  50. Hints in Unification. [Citation Graph (, )][DBLP]


  51. About the Formalization of Some Results by Chebyshev in Number Theory. [Citation Graph (, )][DBLP]


  52. Smart matching [Citation Graph (, )][DBLP]


  53. An Interactive Driver for Goal-directed Proof Strategies. [Citation Graph (, )][DBLP]


Search in 0.031secs, Finished in 0.034secs
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