default search action
Adolfo Piperno
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [c17]Daniele Gorla
, Ivano Salvo, Adolfo Piperno:
Conflict vs Causality in Event Structures. EXPRESS/SOS 2019: 86-101 - 2018
- [c16]Adolfo Piperno:
Isomorphism Test for Digraphs with Weighted Edges. SEA 2018: 30:1-30:13 - 2017
- [j13]Stefano Guerrini, Henk Barendrengt, Adolfo Piperno:
Computing with lambda-terms: A special issue dedicated to Corrado Böhm for his 90th birthday. Math. Struct. Comput. Sci. 27(5): 557-559 (2017) - 2014
- [j12]Brendan D. McKay
Practical graph isomorphism, II. J. Symb. Comput. 60: 94-112 (2014) - 2013
- [i2]Brendan D. McKay, Adolfo Piperno:
Practical graph isomorphism, II. CoRR abs/1301.1493 (2013)
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. Math. Struct. Comput. Sci. 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
Linear area upward drawings of AVL trees. Comput. Geom. 9(1-2): 25-42 (1998) - [j6]Mariangiola Dezani-Ciancaglini
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
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]Adolfo Piperno:
Normalization and Extensionality (Extended Abstract). LICS 1995: 300-310 - [c11]Roberto Di Cosmo, Adolfo Piperno:
Expanding Extensional Polymorphism. TLCA 1995: 139-153 - 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
Optimal-Area Upward Drawings of AVL Trees. GD 1994: 307-317 - [c8]Adolfo Piperno, Simona Ronchi Della Rocca:
Type Inference and Extensionality. LICS 1994: 196-205 - [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
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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: