sw-MLPL - Y Combinators in an Eager Array Language
Show HN: Combinators in Array Languages
sw-MLPL demonstrates how to implement the Sage bird (Y combinator) in an eager array language, solving recursion without named functions. The post explains the classical Y combinator's divergence in strict evaluation and presents the applicative Sage (Z combinator) as a practical fix. It includes runnable examples like factorial and fibonacci, showing how to achieve anonymous recursion while preserving the language's eager semantics. The project bridges APL lineage with combinator logic, offering a live demo and GitHub lessons for developers interested in functional programming and array languages.
Feed it a factorial 'body' that takes its own recursion as an argument, and the Sage hands that body back to itself, fully armed — recursion without a name, no assignment, no def.