So it’s based on a universal combinator like Iota? | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		LudwigNagasena on Dec 10, 2024 \| parent \| context \| favorite \| on: Tree Calculus So it’s based on a universal combinator like Iota?

Jtsummers on Dec 10, 2024 | [–]

Yes. And the author is Johannes Bader who wrote about that one as well:

https://lambada.pages.dev

https://johannes-bader.com

tromp on Dec 10, 2024 | [–]

No, it's based on K and S, as is clear from the two rules

    (t (t) a)     b       -> a           (1)
    (t (t a) b)   c       -> (a c) (b c) (2)

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact