Discriminating Lambda-Terms Using Clocked Boehm Trees

As observed by Intrigila, there are hardly techniques available in the lambda-calculus to prove that two lambda-terms are not beta-convertible. Techniques employing the usual Boehm Trees are inadequate when we deal with terms having the same Boehm Tree (BT). This is the case in particular for fixed point combinators, as they all have the same BT. Another interesting equation, whose consideration was suggested by Scott, is BY = BYS, an equation valid in the classical model P-omega of lambda-calculus, and hence valid with respect to BT-equality but nevertheless the terms are beta-inconvertible. To prove such beta-inconvertibilities, we employ clocked' BT's, with annotations that convey information of the tempo in which the data in the BT are produced. Boehm Trees are thus enriched with an intrinsic clock behaviour, leading to a refined discrimination method for lambda-terms. The corresponding equality is strictly intermediate between beta-convertibility and Boehm Tree equality, the equality in the model P-omega. An analogous approach pertains to Levy-Longo and Berarducci Trees. Our refined Boehm Trees find in particular an application in beta-discriminating fixed point combinators (fpc's). It turns out that Scott's equation BY = BYS is the key to unlocking a plethora of fpc's, generated by a variety of production schemes of which the simplest was found by Boehm, stating that new fpc's are obtained by postfixing the term SI, also known as Smullyan's Owl. We prove that all these newly generated fpc's are indeed new, by considering their clocked BT's. Even so, not all pairs of new fpc's can be discriminated this way. For that purpose we increase the discrimination power by a precision of the clock notion that we call atomic clock'.

💡 Research Summary

The paper addresses a long‑standing difficulty in the λ‑calculus: proving that two λ‑terms are not β‑convertible when their Böhm trees (BTs) coincide. Classical BTs are infinite normal‑form representations that distinguish terms only when the trees differ; however, many important terms—most notably fixed‑point combinators (fpc’s) and the equation BY = BYS identified by Scott—share the same BT (λf.f ω). Consequently, BT‑based techniques cannot certify β‑inequivalence in these cases.

To overcome this limitation the authors enrich BTs with a temporal annotation they call a “clock”. The clock records, for each node of the tree, the number of head‑reduction steps (i.e., β‑reductions that eliminate the outermost redex) that have been performed before that node becomes visible. In effect, the clock measures the “tempo” at which the infinite tree is generated. Two terms may have identical underlying BTs but different clock annotations; such a discrepancy guarantees that the terms are not β‑convertible.

Two central theorems formalize the discriminating power of clocked BTs. Theorem 4.6 states that if every reduct of a term M has a clock that is at least as fast as (i.e., not slower than) the clock of any reduct of N, then M and N cannot be β‑equivalent. Theorem 4.11 refines this for “simple” terms—terms whose reduction to a BT does not duplicate redexes (a class that includes all fpc’s generated by the schemes studied). For a simple term M it suffices that the clock of N never eventually outruns the clock of M; otherwise β‑inequivalence follows.

The paper then applies this methodology to the systematic generation of new fixed‑point combinators. It is well‑known that the combinator δ = SI (Smullyan’s Owl) satisfies Y δ = Y for any fpc Y, and that repeatedly postfixing δ yields the “Böhm sequence” Y₀, Y₀ δ, Y₀ δ δ, … . The authors generalize this by introducing arbitrary “fpc‑generating vectors” P₁…Pₙ and proving that if Y is an fpc then Y P₁…Pₙ is again an fpc. By computing the clocked BTs of these generated combinators they show that each new term has a distinct clock profile, establishing that the sequence contains no duplicates and that all members are β‑inequivalent to one another.

Nevertheless, some pairs of generated fpc’s share the same clock profile. To resolve these residual ambiguities the authors introduce a finer notion called the “atomic clock”. Instead of merely counting head‑reduction steps, an atomic clock records the exact positions (paths in the tree) where each head reduction occurs. This richer information distinguishes terms whose ordinary clocks coincide, thereby extending the discriminating power to all known fpc’s produced by the presented schemes.

The authors also discuss how the clocked approach transfers to other infinitary semantics: Levy‑Longo trees (LLT) and Berarducci trees (BeT). By annotating these trees with the same temporal data, one obtains intermediate equivalences between β‑convertibility and the corresponding model equalities, mirroring the situation for BTs.

Several concrete applications illustrate the technique. In Section 5 the authors answer a question of Plotkin concerning the existence of an fpc Y satisfying Y (λz.f z z) =β Y (λx.Y (λy.f x y)), showing that no such Y exists via clock analysis. Section 6 presents clock calculations for three distinct combinatory‑logic enumerators, again demonstrating β‑inequivalence despite identical BTs. The final sections outline extensions, open problems (e.g., generalizing Statman‑Intrigila equations to arbitrary fpc’s), and future research directions such as automating atomic‑clock extraction.

In summary, the paper introduces a novel, intermediate semantic layer—clocked Böhm trees—that captures the dynamics of tree construction. This layer yields a robust method for proving β‑inequivalence in situations where traditional Böhm‑tree techniques fail, particularly for fixed‑point combinators and related equations. The refinement to atomic clocks further strengthens the method, making it capable of distinguishing even the most subtle cases. The work thus bridges a gap between β‑convertibility and model‑based equality, offering both theoretical insight and practical tools for λ‑calculus research.