Modular Construction of Fixed Point Combinators and Clocked Boehm Trees
Joerg Endrullis, Dimitri Hendriks, Jan Willem Klop

TL;DR
This paper develops a modular framework for constructing fixed point combinators in lambda-calculus and introduces clocked Boehm trees to distinguish between them, advancing the analysis of their structure and uniqueness.
Contribution
It generalizes fixed point combinator construction methods and introduces clocked Boehm trees for finer discrimination of lambda-terms beyond traditional techniques.
Findings
Generated infinitely many new fixed point combinators
Developed clocked Boehm trees for enhanced term discrimination
Proved the beta-inconvertibility of newly constructed combinators
Abstract
Fixed point combinators (and their generalization: looping combinators) are classic notions belonging to the heart of lambda-calculus and logic. We start with an exploration of the structure of fixed point combinators (fpc's), vastly generalizing the well-known fact that if Y is an fpc, Y(SI) is again an fpc, generating the Boehm sequence of fpc's. Using the infinitary lambda-calculus we devise infinitely many other generation schemes for fpc's. In this way we find schemes and building blocks to construct new fpc's in a modular way. Having created a plethora of new fixed point combinators, the task is to prove that they are indeed new. That is, we have to prove their beta-inconvertibility. Known techniques via Boehm Trees do not apply, because all fpc's have the same Boehm Tree (BT). Therefore, we employ `clocked BT's', with annotations that convey information of the tempo in which…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · semigroups and automata theory · Formal Methods in Verification
