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 l-terms that have the same Böhm trees, up to (possibly infinite) h-equivalence, are operationally equivalent. It is also used to prove a conjecture of R. Kerth : Every unsolvable l-term has a decoration. This syntactical result is motivated by (and gives the solution to) a semantical problem.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.