Show HN: Combinators in Array Languages

Automated excerpt

Lark = λf. (λx. f (x x)) (λx. f (x x)) That last line is the Y combinator in its classical form, and it satisfies exactly the recursive equation: Y f = f (Y f). The classical Sage, applied to anything, diverges immediately: constructing (λx. f (x x)) (λx. f (x x)) demands x x before f is ever called, which demands x x, forever. demo-combinators/src/fixed_points. mlpl therefore defines the classical Sage as call(:u:bluebird, :u:mockingbird, :u:lark) and deliberately never forces it. docs/derived-combinators. md records this as a stopping point, not an oversight.

Selected automatically from source text; not independently written or fact-checked. Read the original for full context.