Travelled to:1 × Czech Republic
1 × Denmark
1 × France
1 × Germany
1 × Italy
2 × USA
3 × United Kingdom
Collaborated with:C.Böhm ∅ Z.Khasidashvili R.D.Cosmo S.R.D.Rocca R.Kennaway S.Guerrini U.de'Liguoro R.Statman A.Bucciarelli S.D.Lorenzis I.Salvo
Talks about:extension (3) calculus (3) normal (3) type (3) reduct (2) superdevelop (1) hyperbalanc (1) combinatori (1) polymorph (1) intersect (1)
Person: Adolfo Piperno
DBLP: Piperno:Adolfo
Contributed to:
2002
1999
19981995
1995
19941994199219881987
1987Wrote 11 papers:
- RTA-2002-KennawayKP #composition #static analysis #λ-calculus
- Static Analysis of Modularity of β-Reduction in the Hyperbalanced λ-Calculus (RK, ZK, AP), pp. 51–65.
- LICS-1999-BucciarelliLPS
- Some Computational Properties of Intersection Types (AB, SDL, AP, IS), pp. 109–118.
- CSL-1998-KhasidashviliP #normalisation
- Normalization of Typable Terms by Superdevelopments (ZK, AP), pp. 260–282.
- LICS-1995-Piperno #normalisation
- Normalization and Extensionality (AP), pp. 300–310.
- TLCA-1995-CosmoP #morphism #polymorphism
- Expanding Extensional Polymorphism (RDC, AP), pp. 139–153.
- ESOP-1994-BohmPG #normalisation
- λ-Definition of Function(al)s by Normal Forms (CB, AP, SG), pp. 135–149.
- LICS-1994-PipernoR #type inference
- Type Inference and Extensionality (AP, SRDR), pp. 196–205.
- LICS-1992-LiguoroPS #λ-calculus
- Retracts in simply typed λβη-calculus (Ud, AP, RS), pp. 461–469.
- LICS-1988-BohmP #calculus
- Characterizing X-Separability and One-Side Invertibility in λ-β-Ω-Calculus (CB, AP), pp. 91–101.
- CSL-1987-BohmP #combinator #finite #reduction #set
- Surjectivity for Finite Sets of Combinators by Weak Reduction (CB, AP), pp. 27–43.
- CFLP-1987-Piperno #abstraction #algorithm #combinator #logic
- A Compositive Abstraction Algorithm for Combinatory Logic (AP), pp. 39–51.