![]() | ![]() |
| 2012 | ||
|---|---|---|
| 67 | Andrea Asperti, Ferruccio Guidi: Type systems for dummies. TLDI 2012: 79-90 | |
| 66 | Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi: A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions Logical Methods in Computer Science 8(1): (2012) | |
| 2011 | ||
| 65 | Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi: The Matita Interactive Theorem Prover. CADE 2011: 64-69 | |
| 64 | Andrea Asperti, Maria Emilia Maietti, Claudio Sacerdoti Coen, Giovanni Sambin, Silvio Valentini: Formalization of Formal Topology by Means of the Interactive Theorem Prover Matita. Calculemus/MKM 2011: 278-280 | |
| 63 | Andrea Asperti, Jeremy Avigad: Zen and the art of formalisation. Mathematical Structures in Computer Science 21(4): 679-682 (2011) | |
| 62 | R. Armadio, Andrea Asperti, Nicholas Ayache, B. Campbell, D. Mulligan, R. Pollack, Yann Régis-Gianas, Claudio Sacerdoti Coen, I. Stark: Certified Complexity. Procedia CS 7: 175-177 (2011) | |
| 2010 | ||
| 61 | Andrea Asperti, Claudio Sacerdoti Coen: Some Considerations on the Usability of Interactive Provers. AISC/MKM/Calculemus 2010: 147-156 | |
| 60 | Andrea Asperti, Enrico Tassi: Smart Matching. AISC/MKM/Calculemus 2010: 263-277 | |
| 59 | Andrea Asperti, Enrico Tassi: Smart matching CoRR abs/1005.0349: (2010) | |
| 58 | Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi: Regular Expressions, au point CoRR abs/1010.2604: (2010) | |
| 2009 | ||
| 57 | Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi: Hints in Unification. TPHOLs 2009: 84-98 | |
| 56 | Andrea Asperti, Enrico Tassi: Superposition as a logical glue TYPES 2009: 1-15 | |
| 55 | Andrea Asperti, Enrico Tassi: An Interactive Driver for Goal-directed Proof Strategies. Electr. Notes Theor. Comput. Sci. 226: 89-105 (2009) | |
| 54 | Roberto M. Amadio, Giuseppe Castagna, Andrea Asperti: Preface. Inf. Comput. 207(5): 543-544 (2009) | |
| 53 | Andrea Asperti, Herman Geuvers, Raja Natarajan: Social processes, program verification and all that. Mathematical Structures in Computer Science 19(5): 877-896 (2009) | |
| 52 | Andrea Asperti, Nadia Busi: Mobile Petri nets. Mathematical Structures in Computer Science 19(6): 1265-1278 (2009) | |
| 2008 | ||
| 51 | Andrea Asperti: The intensional content of Rice's theorem. POPL 2008: 113-119 | |
| 50 | Andrea Asperti, Wilmer Ricciotti: About the Formalization of Some Results by Chebyshev in Number Theory. TYPES 2008: 19-31 | |
| 2007 | ||
| 49 | Andrea Asperti, Enrico Tassi: Higher order Proof Reconstruction from Paramodulation-Based Refutations: The Unit Equality Case. Calculemus/MKM 2007: 146-160 | |
| 48 | Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli: User Interaction with the Matita Proof Assistant. J. Autom. Reasoning 39(2): 109-139 (2007) | |
| 2006 | ||
| 47 | Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli: Crafting a Proof Assistant. TYPES 2006: 18-32 | |
| 2005 | ||
| 46 | Andrea Asperti, Herman Geuvers, Iris Loeb, Lionel Elie Mamane, Claudio Sacerdoti Coen: An Interactive Algebra Course with Formalised Proofs and Definitions. MKM 2005: 315-329 | |
| 2004 | ||
| 45 | Andrea Asperti, Grzegorz Bancerek, Andrzej Trybulec: Mathematical Knowledge Management, Third International Conference, MKM 2004, Bialowieza, Poland, September 19-21, 2004, Proceedings Springer 2004 | |
| 44 | Andrea Asperti, Matteo Selmi: Efficient Retrieval of Mathematical Statements. MKM 2004: 17-31 | |
| 43 | Andrea Asperti, Ferruccio Guidi, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli: A Content Based Mathematical Search Engine: Whelp. TYPES 2004: 17-32 | |
| 42 | Andrea Asperti, Paolo Coppola, Simone Martini: (Optimal) duplication is not elementary recursive. Inf. Comput. 193(1): 21-56 (2004) | |
| 2003 | ||
| 41 | Andrea Asperti, Bruno Buchberger, James H. Davenport: Mathematical Knowledge Management, Second International Conference, MKM 2003, Bertinoro, Italy, February 16-18, 2003, Proceedings Springer 2003 | |
| 40 | Andrea Asperti, Luca Padovani, Claudio Sacerdoti Coen, Ferruccio Guidi, Irene Schena: Mathematical Knowledge Management in HELM. Ann. Math. Artif. Intell. 38(1-3): 27-46 (2003) | |
| 2002 | ||
| 39 | Andrea Asperti, Bernd Wegner: MOWGLI - An Approach to Machine-Understandable Representation of the Mathematical Information in Digital Documents. Electronic Information and Communication in Mathematics 2002: 14-23 | |
| 38 | Andrea Asperti, Luca Roversi: Intuitionistic Light Affine Logic. ACM Trans. Comput. Log. 3(1): 137-175 (2002) | |
| 2001 | ||
| 37 | Andrea Asperti, Luca Padovani, Claudio Sacerdoti Coen, Irene Schena: XML, Stylesheets and the Re-mathematization of Formal Content. Extreme Markup Languages® 2001 | |
| 36 | Andrea Asperti, Luca Padovani, Claudio Sacerdoti Coen, Irene Schena: HELM and the Semantic Math-Web. TPHOLs 2001: 59-74 | |
| 35 | Andrea Asperti, Harry G. Mairson: Parallel Beta Reduction Is Not Elementary Recursive. Inf. Comput. 170(1): 49-80 (2001) | |
| 2000 | ||
| 34 | Andrea Asperti, Paolo Coppola, Simone Martini: (Optimal) Duplication is not Elementary Recursive. POPL 2000: 96-107 | |
| 33 | Andrea Asperti, Luca Roversi: Light Affine Logic (Proof Nets, Programming Notation, P-Time Correctness and Completeness) CoRR cs.LO/0006010: (2000) | |
| 1998 | ||
| 32 | Andrea Asperti: Light Affine Logic. LICS 1998: 300-308 | |
| 31 | Andrea Asperti: Optimal Reduction of Functional Expressions. PLILP/ALP 1998: 427-428 | |
| 30 | Andrea Asperti, Harry G. Mairson: Parallel Beta Reduction is not Elementary Recursive. POPL 1998: 303-315 | |
| 1997 | ||
| 29 | Andrea Asperti, Cosimo Laneve: On the Dynamics of Sharing Graphs. ICALP 1997: 259-269 | |
| 28 | Andrea Asperti, Juliusz Chroboczek: Safe Operators: Brackets Closed Forever Optimizing Optimal lambda-Calculus Implementations - Optimizing Optimal lambda-Calculus Implementations. Appl. Algebra Eng. Commun. Comput. 8(6): 437-468 (1997) | |
| 27 | Andrea Asperti, Agata Ciabattoni: A Sufficient Condition for Completability of Partial Combinatory Algebras. J. Symb. Log. 62(4): 1209-1214 (1997) | |
| 1996 | ||
| 26 | Andrea Asperti: On the Complexity of Beta-Reduction. POPL 1996: 110-118 | |
| 25 | Andrea Asperti, Cecilia Giovanetti, Andrea Naletto: The Bologna Optimal Higher-Order Machine. J. Funct. Program. 6(6): 763-810 (1996) | |
| 24 | Andrea Asperti, Cosimo Laneve: Interaction Systems II: The Practice of Optimal Reductions. Theor. Comput. Sci. 159(2): 191-244 (1996) | |
| 1995 | ||
| 23 | Andrea Asperti, Agata Ciabattoni: Effective Applicative Structures. Category Theory and Computer Science 1995: 81-95 | |
| 22 | Andrea Asperti: deltao!Epsilon = 1 - Optimizing Optimal lambda-Calculus Implementations. RTA 1995: 102-116 | |
| 21 | Andrea Asperti, Cosimo Laneve: Comparing Lambda-calculus translations in Sharing Graphs. TLCA 1995: 1-15 | |
| 20 | Andrea Asperti: Linear Logic, Comonads and Optimal Reduction. Fundam. Inform. 22(1/2): 3-22 (1995) | |
| 19 | Andrea Asperti: Causal Dependencies in Multiplicative Linear Logic with MIX. Mathematical Structures in Computer Science 5(3): 351-380 (1995) | |
| 18 | Andrea Asperti, Cosimo Laneve: Paths, Computations and Labels in the lambda-Calculus. Theor. Comput. Sci. 142(2): 277-297 (1995) | |
| 1994 | ||
| 17 | Andrea Asperti: Category Theory: Basic notions and general philosophy. JFPLC 1994: 307-108 | |
| 16 | Andrea Asperti, Giovanna M. Dore: Yet Another Correctness Criterion for Multiplicative Linear Logic with MIX. LFCS 1994: 34-46 | |
| 15 | Andrea Asperti, Vincent Danos, Cosimo Laneve, Laurent Regnier: Paths in the lambda-calculus LICS 1994: 426-436 | |
| 14 | Andrea Asperti, Cosimo Laneve: The Family Relation in Interaction Systems. TACS 1994: 366-384 | |
| 13 | Andrea Asperti, Cosimo Laneve: Interaction Systems I: The Theory of Optimal Reductions. Mathematical Structures in Computer Science 4(4): 457-504 (1994) | |
| 1993 | ||
| 12 | Andrea Asperti, Cosimo Laneve: Interaction Systems. HOA 1993: 1-19 | |
| 11 | Andrea Asperti, Cosimo Laneve: Paths, Computations and Labels in the Lambda-Calculus. RTA 1993: 152-167 | |
| 10 | Andrea Asperti, Cosimo Laneve: Optimal Reductions in Interaction Systems. TAPSOFT 1993: 485-500 | |
| 1992 | ||
| 9 | Andrea Corradini, Andrea Asperti: A Categorial Model for Logic Programs: Indexed Monoidal Categories. REX Workshop 1992: 110-137 | |
| 8 | Andrea Asperti, Simone Martini: Categorical Models of Polymorphism Inf. Comput. 99(1): 1-79 (1992) | |
| 7 | Andrea Asperti: A Categorical Understanding of Environment Machines. J. Funct. Program. 2(1): 23-59 (1992) | |
| 1991 | ||
| 6 | Andrea Asperti, Giuseppe Longo: Categories, types and structures - an introduction to category theory for the working computer scientist. MIT Press 1991: I-XI, 1-306 | |
| 1990 | ||
| 5 | Andrea Asperti: Integrating Strict and Lazy Evaluation: The lambda-sl-Calculus. PLILP 1990: 238-254 | |
| 4 | Andrea Asperti, Gian Luigi Ferrari, Roberto Gorrieri: Implicative Formulae in the ``Proofs as Computations'' Analogy. POPL 1990: 59-71 | |
| 3 | Andrea Asperti: Stability and Computability in Coherent Domains Inf. Comput. 86(2): 115-139 (1990) | |
| 1989 | ||
| 2 | Andrea Asperti, Simone Martini: Projections Instead of Variables: A Category Theoretic Interpretation of Logic Programs. ICLP 1989: 337-352 | |
| 1986 | ||
| 1 | Andrea Asperti, Giuseppe Longo: Relating Type-Structures: Partial Variations on a Theme of Friedman and Statman. CAAP 1986: 266-287 | |
Colors in the list of coauthors
Last update Sat May 26 04:23:17 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page