Adolfo Piperno's publications
A.Piperno, A compositive abstraction algorithm for combinatory logic,
Theory and Practice of Software Development (TAPSOFT
87), LNCS 250, 1987.
C.Böhm, A.Piperno, Surjectivity for finite sets of combinators
by weak reduction,
Computer Science Logic'87 (CSL 87), LNCS 329, 1987.
C.Böhm, A.Piperno, Characterizing X-separability and one side
invertibility inlbW-calculus,
3rd IEEE symposium on Logic in Computer Science (LICS
88), 1988.
C.Böhm, A.Piperno, E.Tronci, Solving equations in Lambda-calculus,
Logic Colloquium'88, North-Holland, 1988.
A.Piperno, Abstraction problems in Combinatory Logic: a compositive
approach,
Theoretical Computer Science 66, 1989.
A.Piperno, E.Tronci, Regular systems of equations inl-calculus,
International Journal on Foundations of Computer Science
1(3),
1990.
U.de'Liguoro, A.Piperno, R.Statman, Retracts in simply typedlbh-calculus,
7th IEEE symposium on Logic in Computer Science (LICS
92), 1992.
P.Crescenzi, G.Di Battista, A.Piperno, A Note on Optimal Area Algorithms
for Upward Drawings of Binary Trees,
Computational Geometry: theory and applications 2,
1992.
U.de'Liguoro, A.Piperno, Must preorder in non-deterministic untypedl-calculus
(Extended Abstract),
17th Colloquium on Trees in Algebra and Programming (CAAP
92), LNCS 581, 1992.
M.Dezani-Ciancaglini, U.de'Liguoro, A.Piperno, Filter Models for
a Parallel and Non-deterministicl-calculus,
Mathematical Foundations of Computer Science (MFCS 93),
LNCS 711, 1993.
A. Piperno, S.Ronchi della Rocca, Type Inference and Extensionality,
9th IEEE symposium on Logic in Computer Science, (LICS
94), 1994.
C.Böhm, A.Piperno, S.Guerrini, l-definition
of Function(al)s by Normal Forms,
European Symposium on Programming, (ESOP 94), 1994.
A.Piperno, S.Ronchi della Rocca, Type Inference and Extensionality,
9th IEEE symposium on Logic in Computer Science (LICS
94), 1994.
M.Dezani-Ciancaglini, U.de'Liguoro, A.Piperno, Fully Abstract Logical
Semantics for Concurrentl-calculus,
Theoretical Aspects of Computer Science (TACS 94), LNCS
789, 1994.
P.Crescenzi, A.Piperno, Optimal-area upward drawings of AVL trees
(extended abstract),
Dimacs workshop on Graph Drawing (GD94), LNCS 894, 1994.
U. de' Liguoro, A.Piperno, Non-deterministic extensions of
untypedl-calculus,
Information and Computation 122(2), 1995.
R.Di Cosmo, A.Piperno, Expanding Extensional Polymorphism,
2nd International Conference on Typed Lambda Calculus
and Applications (TLCA 95), 1995.
A.Piperno, Normalization and Extensionality,
10th IEEE symposium on Logic in Computer Science (LICS
95), 1995.
M.Dezani-Ciancaglini, U.de'Liguoro, A.Piperno, Filter Models for
Conjunctive-Disjunctivel-calculi,
Theoretical Computer Science 170, 1996.
P.Crescenzi, A.Piperno, P.Penna, Optimal Area Upward Drawings of
AVL Trees,
Computational Geometry: theory and applications 8,
1997.
M.Dezani-Ciancaglini, U.de'Liguoro, A.Piperno, A Filter Model for
Concurrentl-calculus,
SIAM Journal on Computing 27(5), 1998.
A.Piperno, An
Algebraic View of the Böhm-out Technique
Theoretical Computer Science 212, 1999.
Z.Khasidashvili, A.Piperno, Normalization
of Typable terms by Superdevelopments
Computer Science Logic'98 (CSL 98), LNCS 1584, 1999.
A.Bucciarelli, S.De Lorenzis, A.Piperno, I.Salvo, Some Computational
Properties of Intersection Types,
14th IEEE symposium on Logic in Computer Science (LICS
99), 1999.
Other publications
A.Piperno, Il gioco del filetto a tre pedine,
I Convegno internazionale "Scienza e Gioco", Sansoni Editore,
1985.
A.Piperno, E.Tronci, Regular systems of equations in lambda-calculus
(preliminary version),
III Convegno Italiano di Informatica Teorica, World Scientific,
1989.
R.De Nicola, A.Piperno, Semantica
Operazionale e Denotazionale dei Linguaggi di Programmazione,
Città Studi Edizioni, UTET Libreria, 1999.