dblp.uni-trier.dewww.uni-trier.de

Andrea Asperti Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
53EEAndrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi: Hints in Unification. TPHOLs 2009: 84-98
52EEAndrea Asperti, Enrico Tassi: An Interactive Driver for Goal-directed Proof Strategies. Electr. Notes Theor. Comput. Sci. 226: 89-105 (2009)
51EERoberto M. Amadio, Giuseppe Castagna, Andrea Asperti: Preface. Inf. Comput. 207(5): 543-544 (2009)
2008
50EEAndrea Asperti: The intensional content of Rice's theorem. POPL 2008: 113-119
49EEAndrea Asperti, Wilmer Ricciotti: About the Formalization of Some Results by Chebyshev in Number Theory. TYPES 2008: 19-31
2007
48EEAndrea Asperti, Enrico Tassi: Higher order Proof Reconstruction from Paramodulation-Based Refutations: The Unit Equality Case. Calculemus/MKM 2007: 146-160
47EEAndrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli: User Interaction with the Matita Proof Assistant. J. Autom. Reasoning 39(2): 109-139 (2007)
2006
46EEAndrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli: Crafting a Proof Assistant. TYPES 2006: 18-32
2005
45EEAndrea 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
44 Andrea Asperti, Grzegorz Bancerek, Andrzej Trybulec: Mathematical Knowledge Management, Third International Conference, MKM 2004, Bialowieza, Poland, September 19-21, 2004, Proceedings Springer 2004
43EEAndrea Asperti, Matteo Selmi: Efficient Retrieval of Mathematical Statements. MKM 2004: 17-31
42EEAndrea Asperti, Ferruccio Guidi, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli: A Content Based Mathematical Search Engine: Whelp. TYPES 2004: 17-32
41EEAndrea Asperti, Paolo Coppola, Simone Martini: (Optimal) duplication is not elementary recursive. Inf. Comput. 193(1): 21-56 (2004)
2003
40 Andrea Asperti, Bruno Buchberger, James H. Davenport: Mathematical Knowledge Management, Second International Conference, MKM 2003, Bertinoro, Italy, February 16-18, 2003, Proceedings Springer 2003
39 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
38EEAndrea 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
37EEAndrea Asperti, Luca Roversi: Intuitionistic Light Affine Logic. ACM Trans. Comput. Log. 3(1): 137-175 (2002)
2001
36EEAndrea Asperti, Luca Padovani, Claudio Sacerdoti Coen, Irene Schena: XML, Stylesheets and the Re-mathematization of Formal Content. Extreme Markup Languages® 2001
35EEAndrea Asperti, Luca Padovani, Claudio Sacerdoti Coen, Irene Schena: HELM and the Semantic Math-Web. TPHOLs 2001: 59-74
34 Andrea Asperti, Harry G. Mairson: Parallel Beta Reduction Is Not Elementary Recursive. Inf. Comput. 170(1): 49-80 (2001)
2000
33EEAndrea Asperti, Paolo Coppola, Simone Martini: (Optimal) Duplication is not Elementary Recursive. POPL 2000: 96-107
32EEAndrea Asperti, Luca Roversi: Light Affine Logic (Proof Nets, Programming Notation, P-Time Correctness and Completeness) CoRR cs.LO/0006010: (2000)
1998
31 Andrea Asperti: Light Affine Logic. LICS 1998: 300-308
30EEAndrea Asperti: Optimal Reduction of Functional Expressions. PLILP/ALP 1998: 427-428
29EEAndrea Asperti, Harry G. Mairson: Parallel Beta Reduction is not Elementary Recursive. POPL 1998: 303-315
1997
28EEAndrea Asperti, Cosimo Laneve: On the Dynamics of Sharing Graphs. ICALP 1997: 259-269
27EEAndrea Asperti, Juliusz Chroboczek: Safe Operators: Brackets Closed Forever Optimizing Optimal lambda-Calculus Implementations. Appl. Algebra Eng. Commun. Comput. 8(6): 437-468 (1997)
26 Andrea Asperti, Agata Ciabattoni: A Sufficient Condition for Completability of Partial Combinatory Algebras. J. Symb. Log. 62(4): 1209-1214 (1997)
1996
25EEAndrea Asperti: On the Complexity of Beta-Reduction. POPL 1996: 110-118
24 Andrea Asperti, Cecilia Giovanetti, Andrea Naletto: The Bologna Optimal Higher-Order Machine. J. Funct. Program. 6(6): 763-810 (1996)
23EEAndrea Asperti, Cosimo Laneve: Interaction Systems II: The Practice of Optimal Reductions. Theor. Comput. Sci. 159(2): 191-244 (1996)
1995
22 Andrea Asperti, Agata Ciabattoni: Effective Applicative Structures. Category Theory and Computer Science 1995: 81-95
21EEAndrea Asperti: deltao!Epsilon = 1 - Optimizing Optimal lambda-Calculus Implementations. RTA 1995: 102-116
20 Andrea Asperti, Cosimo Laneve: Comparing Lambda-calculus translations in Sharing Graphs. TLCA 1995: 1-15
19 Andrea Asperti: Linear Logic, Comonads and Optimal Reduction. Fundam. Inform. 22(1/2): 3-22 (1995)
18 Andrea Asperti: Causal Dependencies in Multiplicative Linear Logic with MIX. Mathematical Structures in Computer Science 5(3): 351-380 (1995)
17EEAndrea Asperti, Cosimo Laneve: Paths, Computations and Labels in the lambda-Calculus. Theor. Comput. Sci. 142(2): 277-297 (1995)
1994
16 Andrea Asperti: Category Theory: Basic notions and general philosophy. JFPLC 1994: 307-108
15 Andrea Asperti, Giovanna M. Dore: Yet Another Correctness Criterion for Multiplicative Linear Logic with MIX. LFCS 1994: 34-46
14 Andrea Asperti, Vincent Danos, Cosimo Laneve, Laurent Regnier: Paths in the lambda-calculus LICS 1994: 426-436
13 Andrea Asperti, Cosimo Laneve: The Family Relation in Interaction Systems. TACS 1994: 366-384
12 Andrea Asperti, Cosimo Laneve: Interaction Systems I: The Theory of Optimal Reductions. Mathematical Structures in Computer Science 4(4): 457-504 (1994)
1993
11 Andrea Asperti, Cosimo Laneve: Interaction Systems. HOA 1993: 1-19
10EEAndrea Asperti, Cosimo Laneve: Paths, Computations and Labels in the Lambda-Calculus. RTA 1993: 152-167
9EEAndrea Asperti, Cosimo Laneve: Optimal Reductions in Interaction Systems. TAPSOFT 1993: 485-500
1992
8EEAndrea Corradini, Andrea Asperti: A Categorial Model for Logic Programs: Indexed Monoidal Categories. REX Workshop 1992: 110-137
7 Andrea Asperti, Simone Martini: Categorical Models of Polymorphism Inf. Comput. 99(1): 1-79 (1992)
6 Andrea Asperti: A Categorical Understanding of Environment Machines. J. Funct. Program. 2(1): 23-59 (1992)
1990
5EEAndrea 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
1EEAndrea Asperti, Giuseppe Longo: Relating Type-Structures: Partial Variations on a Theme of Friedman and Statman. CAAP 1986: 266-287

Coauthor Index

1Roberto M. Amadio [51]
2Grzegorz Bancerek [44]
3Bruno Buchberger [40]
4Giuseppe Castagna [51]
5Juliusz Chroboczek [27]
6Agata Ciabattoni [22] [26]
7Claudio Sacerdoti Coen [35] [36] [39] [42] [45] [46] [47] [53]
8Paolo Coppola [33] [41]
9Andrea Corradini [8]
10Vincent Danos [14]
11James H. Davenport [40]
12Giovanna M. Dore [15]
13Gian Luigi Ferrari (GianLuigi Ferrari) [4]
14Herman Geuvers [45]
15Cecilia Giovanetti [24]
16Roberto Gorrieri [4]
17Ferruccio Guidi [39] [42]
18Cosimo Laneve [9] [10] [11] [12] [13] [14] [17] [20] [23] [28]
19Iris Loeb [45]
20Giuseppe Longo [1]
21Harry G. Mairson [29] [34]
22Lionel Elie Mamane [45]
23Simone Martini [2] [7] [33] [41]
24Andrea Naletto [24]
25Luca Padovani [35] [36] [39]
26Laurent Regnier [14]
27Wilmer Ricciotti [49] [53]
28Luca Roversi [32] [37]
29Irene Schena [35] [36] [39]
30Matteo Selmi [43]
31Enrico Tassi [42] [46] [47] [48] [52] [53]
32Andrzej Trybulec [44]
33Bernd Wegner [38]
34Stefano Zacchiroli [42] [46] [47]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)