Lambda-calculus, types and models
Lambda-calculus, types and models
A syntactical proof of the operational equivalence of two &lgr;-terms
Theoretical Computer Science
Domains and lambda-calculi
Every Unsolvable lambda Term has a Decoration
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
(Semi)-separability of Finite Sets of Terms in Scott's D_infty-Models of the lambda-Calculus
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Theoretical Computer Science - Algebraic methods in language processing
| Hi-index | 0.00 |
This paper develops a general technique to analyze the head reduction of a term in a context. This technique is used to give a direct proof of the theorem of Hyland and Wadsworth : two λ-terms that have the same Böhm trees, up to (possibly infinite) η-equivalence, are operationally equivalent. It is also used to prove a conjecture of R. Kerth : Every unsolvable λ-term has a decoration. This syntactical result is motivated by (and gives the solution to) a semantical problem.