Re:Tree Calculus
by js8 on Tuesday December 10, 2024 @07:27AM
(#42376212)
Oh, OK! I think it would be interesting to know to which universal combinator (or lambda expression) is the 't' related to.
[ Parent
| on HN ]
Re:Tree Calculus
by chriswarbo on Tuesday December 10, 2024 @01:09PM
(#42379458)
Reduction rules (1) and (2) correspond to those of K and S, respectively. Reduction rule (3) corresponds to the elimination form for a Scott-encoding of a datatype like `X = Leaf | Stem X | Fork X X`. The cases of rule (3) are essentially parsing the argument into one of these three forms, and dispatching on the result.