Why Not Tail Recursion?
The article discusses the limitations of recursion in the Futhark programming language. Futhark does not support recursive functions due to its focus on generating efficient code for GPUs. Instead, it offers a looping construct that mimics tail recursion without using stack space.
- ▪Futhark is a parallel programming language that does not allow recursive functions.
- ▪The language prioritizes generating efficient code for restricted targets like GPUs, where recursion can be inefficient.
- ▪Futhark provides a dedicated syntax for sequential looping that avoids stack usage.
Hacker News (Newest) files mainly under programming. We currently carry 5,306 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | Futhark-lang |
| Canonical URL | https://futhark-lang.org/blog/2026-01-20-why-not-tail-recursion.html |
| Publication time | Wed, 20 May 2026 19:01:30 +0000 |
| Retrieval time | 2026-05-20T19:05:02.971Z |
| Last seen | 2026-05-20T19:05:06.586Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | liGP8adb-8Qp |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
Why not tail recursion? Posted on January 20, 2026 by Troels Henriksen This post was inspired by this discussion on /r/ProgrammingLanguages. Futhark is unusual among functional programming languages in not allowing functions to be recursive. This is to some extent justified by Futhark being a parallel language, and recursive looping being an intrinsically sequential operation, and therefore less crucial. However, most nontrivial parallel algorithms still involve some amount of sequential looping, and so this capability cannot be left out entirely. The reason Futhark still does not allow recursive functions is due to our goal of generating code for restricted targets, most notably GPUs, where recursion is at best inefficient and often impossible, due to restrictions on stack usage.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Futhark-lang.
Discussion
0 commentsMore from Futhark-lang
