Effective Longest and Infinite Reduction Paths in Untyped λ-Calculi (1996)

by Morten Heine Sørensen
Venue:In Proceedings of the 21st International Colloquium on Trees and Algebra in Programming (CAAP’96) (Lecture Notes in Computer Science