Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Adolfo Piperno
2010 – today
- 2013
[i2]
2000 – 2009
- 2008
- [i1]Adolfo Piperno: Search Space Contraction in Canonical Labeling of Graphs (Preliminary Version). CoRR abs/0804.4881 (2008)
- 2003
- [j11]Antonio Bucciarelli, Adolfo Piperno, Ivano Salvo: Intersection Types and lambda-Definability. Mathematical Structures in Computer Science 13(1): 15-53 (2003)
- [j10]Erich Grädel, Joseph Y. Halpern, Radha Jagadeesan, Adolfo Piperno: LICS 2001 special issue. ACM Trans. Comput. Log. 4(3): 295 (2003)
- 2002
- [c15]Richard Kennaway, Zurab Khasidashvili, Adolfo Piperno: Static Analysis of Modularity of beta-Reduction in the Hyperbalanced lambda-Calculus. RTA 2002: 51-65
- 2000
- [j9]Zurab Khasidashvili, Adolfo Piperno: A syntactical analysis of normalization. J. Log. Comput. 10(3): 381-410 (2000)
1990 – 1999
- 1999
- [j8]Adolfo Piperno: An Algebraic View of the Böhm-Out Technique. Theor. Comput. Sci. 212(1-2): 233-246 (1999)
- [c14]Antonio Bucciarelli, Silvia De Lorenzis, Adolfo Piperno, Ivano Salvo: Some Computational Properties of Intersection Types. LICS 1999: 109-118
- 1998
- [j7]Pierluigi Crescenzi, Paolo Penna, Adolfo Piperno: Linear area upward drawings of AVL trees. Comput. Geom. 9(1-2): 25-42 (1998)
- [j6]Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro, Adolfo Piperno: A Filter Model for Concurrent lambda-Calculus. SIAM J. Comput. 27(5): 1376-1419 (1998)
- [c13]Zurab Khasidashvili, Adolfo Piperno: Normalization of Typable Terms by Superdevelopments. CSL 1998: 260-282
- 1996
- [j5]Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro, Adolfo Piperno: Filter Models for Conjunctive-Disjunctive lambda-Calculi. Theor. Comput. Sci. 170(1-2): 83-128 (1996)
- 1995
- [j4]Ugo de'Liguoro, Adolfo Piperno: Non Deterministic Extensions of Untyped Lambda-Calculus. Inf. Comput. 122(2): 149-177 (1995)
- [c12]
- [c11]
- 1994
- [c10]Corrado Böhm, Adolfo Piperno, Stefano Guerrini: Lambda-Definition of Function(al)s by Normal Forms. ESOP 1994: 135-149
- [c9]Pierluigi Crescenzi, Adolfo Piperno: Optimal-Area Upward Drawings of AVL Trees. Graph Drawing 1994: 307-317
- [c8]
- [c7]Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro, Adolfo Piperno: Fully Abstract Semantics for Concurrent Lambda-calculus. TACS 1994: 16-35
- 1993
- [c6]Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro, Adolfo Piperno: Filter Models for a Parallel and Non Deterministic Lambda-Calculus. MFCS 1993: 403-412
- 1992
- [j3]Pierluigi Crescenzi, Giuseppe Di Battista, Adolfo Piperno: A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees. Comput. Geom. 2: 187-200 (1992)
- [c5]Ugo de'Liguoro, Adolfo Piperno: Must Preorder in Non-Deterministic Untyped Lambda-Calculus. CAAP 1992: 203-220
- [c4]Ugo de'Liguoro, Adolfo Piperno, Richard Statman: Retracts in simply typed lambda-beta-eta-calculus. LICS 1992: 461-469
- 1990
- [j2]Adolfo Piperno, Enrico Tronci: Regular Systems in lambda-Calculus. Int. J. Found. Comput. Sci. 1(3): 325-340 (1990)
1980 – 1989
- 1989
- [j1]Adolfo Piperno: Abstraction Problems in Combinatory Logic a Compositive Approach. Theor. Comput. Sci. 66(1): 27-43 (1989)
- 1988
- [c3]Corrado Böhm, Adolfo Piperno: Characterizing X-Separability and One-Side Invertibility in lambda-beta-Omega-Calculus. LICS 1988: 91-101
- 1987
- [c2]Corrado Böhm, Adolfo Piperno: Surjectivity for Finite Sets of Combinators by Weak Reduction. CSL 1987: 27-43
- [c1]Adolfo Piperno: A Compositive Abstraction Algorithm for Combinatory Logic. TAPSOFT, Vol.2 1987: 39-51
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-02 23:18 CET by the dblp team