Adolfo Piperno

According to our database1, Adolfo Piperno authored at least 31 papers between 1987 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Conflict vs Causality in Event Structures.
Proceedings of the Proceedings Combined 26th International Workshop on Expressiveness in Concurrency and 16th Workshop on Structural Operational Semantics, 2019

2018
Isomorphism Test for Digraphs with Weighted Edges.
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

2017
Computing with lambda-terms: A special issue dedicated to Corrado Böhm for his 90th birthday.
Math. Struct. Comput. Sci., 2017

2014
Practical graph isomorphism, II.
J. Symb. Comput., 2014

2008
Search Space Contraction in Canonical Labeling of Graphs (Preliminary Version)
CoRR, 2008

2003
LICS 2001 special issue.
ACM Trans. Comput. Log., 2003

Intersection Types and lambda-Definability.
Math. Struct. Comput. Sci., 2003

2002
Static Analysis of Modularity of beta-Reduction in the Hyperbalanced lambda-Calculus.
Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

2000
A syntactical analysis of normalization.
J. Log. Comput., 2000

1999
An Algebraic View of the Böhm-Out Technique.
Theor. Comput. Sci., 1999

Some Computational Properties of Intersection Types.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

1998
A Filter Model for Concurrent lambda-Calculus.
SIAM J. Comput., 1998

Linear area upward drawings of AVL trees.
Comput. Geom., 1998

Normalization of Typable Terms by Superdevelopments.
Proceedings of the Computer Science Logic, 12th International Workshop, 1998

1996
Filter Models for Conjunctive-Disjunctive lambda-Calculi.
Theor. Comput. Sci., 1996

1995
Non Deterministic Extensions of Untyped Lambda-Calculus.
Inf. Comput., 1995

Expanding Extensional Polymorphism.
Proceedings of the Typed Lambda Calculi and Applications, 1995

Normalization and Extensionality (Extended Abstract)
Proceedings of the Proceedings, 1995

1994
Fully Abstract Semantics for Concurrent Lambda-calculus.
Proceedings of the Theoretical Aspects of Computer Software, 1994

Type Inference and Extensionality
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

Optimal-Area Upward Drawings of AVL Trees.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

Lambda-Definition of Function(al)s by Normal Forms.
Proceedings of the Programming Languages and Systems, 1994

1993
Filter Models for a Parallel and Non Deterministic Lambda-Calculus.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992
A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees.
Comput. Geom., 1992

Retracts in simply typed lambda-beta-eta-calculus
Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

Must Preorder in Non-Deterministic Untyped Lambda-Calculus.
Proceedings of the CAAP '92, 1992

1990
Regular Systems in lambda-Calculus.
Int. J. Found. Comput. Sci., 1990

1989
Abstraction Problems in Combinatory Logic a Compositive Approach.
Theor. Comput. Sci., 1989

1988
Characterizing X-Separability and One-Side Invertibility in lambda-beta-Omega-Calculus
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

1987
A Compositive Abstraction Algorithm for Combinatory Logic.
Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

Surjectivity for Finite Sets of Combinators by Weak Reduction.
Proceedings of the CSL '87, 1987


  Loading...