Combinators in Array Languages
Details
- External ID
- 49790937
- Source
- HN
- Company
- —
- Product
- Combinators in Array Languages
- Website domain
- softwarewrighter.com
- Launched
- Sept. 21, 2026
- Cohort
- —
- Upvotes
- 11
- Upvotes percentile
- 0.6220095693779905
- Tags
- —
- Fetched at
- Sept. 25, 2026, 5:02 p.m.
- Updated at
- Sept. 25, 2026, 5:02 p.m.
Description
Raymond Smullyan’s "To Mock a Mockingbird" book's aviary of combinator birds implemented in APL-derived languages and the problem implementing the Sage bird (Fixed Point or Y combinator) in an eagerly evaluated language.Newer APLs support lazy evaluation. My eager language has a workaround for this. The Z combinator is the standard strict-language fix: wrap the self-application in one extra function layer (λv. x x v), so the recursion is a value (a delayed call) rather than an executing expression. sw-MLPL expresses that delay as a named partial — z_step/z_recur/applicative_sage — because the language has no anonymous lambdas.Z has no Smullyan name (and no zebra in the aviary, despite the letter). The book predates and ignores the strictness problem, so it has no applicative-order variant. "Z combinator" is programmer folklore for the eta-expanded Y
Enrichment
- Theme
- scientific computing and deep tech tools
- Vertical
- Education
- Function
- Content generation
- Audience
- Developer
- AI stance
- Not AI
- Project type
- Hobby / open-source project
- Normalized one-liner
- reference and guide for combinators in array languages
- Manually corrected
- False
Could you build this?
No This is specialized theoretical computer science and language design research focusing on combinator calculus and fixed-point semantics within array-oriented programming paradigms.
What it would actually take: This project requires deep expertise in functional programming theory, lambda calculus, combinatory logic (Smullyan's SKI/B/C/W/Y birds), and interpreter internals of APL/BQN/J array languages. Implementing fixed-point combinators in eager evaluation requires designing special evaluation strategies, trampolining, or custom primitive AST rewriting rules within the language compiler.
Discussion
No comments on this launch.
Competitors
Other products that read as similar to this one — 28 launches clear the similarity bar, closest 8 shown.
Attention rank: #14 of 29 (itself plus its competitors, highest first — normalized so YC and Product Hunt are compared fairly).
Launched 313 days after the earliest competitor.
- Prela · hn · 2026-06-15 · 6 upvotes · similarity 0.40
- Scheme-langserver · hn · 2026-02-24 · 52 upvotes · similarity 0.39
- Coderive · hn · 2025-12-22 · 8 upvotes · similarity 0.39
- AttaLambda: a language where types and data are made of untyped lambdas · hn · 2026-09-14 · 44 upvotes · similarity 0.39
- Prela · hn · 2026-06-01 · 73 upvotes · similarity 0.38
- Salt · hn · 2026-07-01 · 44 upvotes · similarity 0.37
- zkGolf · hn · 2026-07-02 · 69 upvotes · similarity 0.36
- ChaosTree · hn · 2026-09-14 · 9 upvotes · similarity 0.36
Other launches for this product
- No other launches for this product.
Same idea, different domain
Nobody's really built a content generation tool for Government yet.