That's one of the ideas behind transducers:
https://github.com/matthiasn/talk-transcripts/blob/master/Hi...
And they work! It's not stream fusion, but the composed functions being applied to whatever container or stream of values are applied per-value, so (map (comp xf1 xf2)) applied to [1 2 3] applies (xf2 (xf1 1)), (xf2 (xf1 2)), and so on, with similar allocation savings to stream fusion.
In The Rust Platformmatthiasn
talk-transcripts
Languages & Compilers2014–2026
matthiasn / talk-transcripts
talk-transcripts
Transcripts of Clojure-related talks
69Distinct people
102Mentions
3Explicit recommenders
3.1KGitHub stars
What to know before exploring
What it is
Transcripts of Clojure-related talks
GitHub
Where it is used
No documented product use was verified in the last source check.
What people are saying
This is tangentially related to Puzzles-vs-Problems in Rich Hickey's Effective Programs > Eventually I got back to scheduling and again wrote a new kind of scheduling system in…
ndr used a recommendation phrase. 3 indexed comments match. This is a phrase match, not a verdict.
No classified warning is attached to this page. Read the discussions before treating silence as approval.
Also in these discussions
No other repository is repeatedly linked in the same discussions.
This week on Hacker News
Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 7:56:55 PM UTC.
No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.
Mentions over time
HN mentions by year102 dated mentions
Observed mentions: 2014-10-30 13:16:39 UTC to 2026-09-04 09:57:52 UTC.
* An incomplete calendar period is marked with an outlined bar. Its count is not directly comparable with a full period.
Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.
View mention counts and date ranges
| Period | Start (UTC) | End (exclusive, UTC) | Mentions | Submissions | Comments |
|---|---|---|---|---|---|
| 2014 | 2014-01-01 00:00:00 UTC | 2015-01-01 00:00:00 UTC | 2 | 1 | 1 |
| 2015 | 2015-01-01 00:00:00 UTC | 2016-01-01 00:00:00 UTC | 4 | 1 | 3 |
| 2016 | 2016-01-01 00:00:00 UTC | 2017-01-01 00:00:00 UTC | 5 | 2 | 3 |
| 2017 | 2017-01-01 00:00:00 UTC | 2018-01-01 00:00:00 UTC | 13 | 2 | 11 |
| 2018 | 2018-01-01 00:00:00 UTC | 2019-01-01 00:00:00 UTC | 11 | 9 | 2 |
| 2019 | 2019-01-01 00:00:00 UTC | 2020-01-01 00:00:00 UTC | 12 | 5 | 7 |
| 2020 | 2020-01-01 00:00:00 UTC | 2021-01-01 00:00:00 UTC | 11 | 1 | 10 |
| 2021 | 2021-01-01 00:00:00 UTC | 2022-01-01 00:00:00 UTC | 8 | 2 | 6 |
| 2022 | 2022-01-01 00:00:00 UTC | 2023-01-01 00:00:00 UTC | 5 | 0 | 5 |
| 2023 | 2023-01-01 00:00:00 UTC | 2024-01-01 00:00:00 UTC | 13 | 1 | 12 |
| 2024 | 2024-01-01 00:00:00 UTC | 2025-01-01 00:00:00 UTC | 8 | 0 | 8 |
| 2025 | 2025-01-01 00:00:00 UTC | 2026-01-01 00:00:00 UTC | 4 | 1 | 3 |
| 2026 (partial) | 2026-01-01 00:00:00 UTC | 2027-01-01 00:00:00 UTC | 6 | 2 | 4 |
From the project README
An excerpt from the repository, fetched Nov 13, 2026.
Read the project’s introduction
talk-transcripts
This is a compilation of transcripts of talks that I find interesting. I learn better when I read something rather than hearing it, and I have a hunch that I'm not the only one who feels that way. So I thought I'd make the talks more accessible to anyone for whom listening to the talks might not be the most viable or simply not the most preferred option.
Please, if you read any of the transcripts and find that a URL is mentioned in the talk and you go look it up, can you submit a pull request turning that into an actual link in the transcript? It is really simple, just click on the pencil button above the document and turn the mention in the text into a markdown-style link like this: **[blah.com or whatever was in the transcript](http://blah.com)**. Thanks, you're making the transcripts more useful.
For more information on this project, please read this blog post.
Read the full README on GitHubWhat Hacker News says
5 sourcesYes, it's still homoiconic.
I think vectors for argument lists is mainly a usability affordance. Which gives you aesthetics for free. (If you happen to find it more aesthetic.)
> Common LISP and Scheme are not simple in this sense, in their use of parens because the use of parentheses in those languages is overloaded. Parens wrap calls. They wrap grouping. They wrap data structures. And that overloading is a form of complexity by the definition I gave you. (https://github.com/matthiasn/talk-transcripts/blob/master/Hi...)
Elsewhere, he critiques Clojure's use of vectors for argument lists. Because a vector implies order, so every caller must put arguments in the right order. (To decomplect, you'd use maps instead of vectors. But vectors win you brevity. Many notice that with longer argument lists, maps increasingly become more attractive t
Read the rest
han long argument lists.)
Transcripts of Clojure-related talks
1 points · Open discussionStep Away from the Computer or Hammock-Driven Development by Rich Hickey (2010)
5 points · Open discussionI looked it up, it's this talk, which indeed is the first one about Clojure, and it's philosophical foundations:
https://github.com/matthiasn/talk-transcripts/blob/master/Hi... (slides)
http://www.infoq.com/presentations/Are-We-There-Yet-Rich-Hic... (recording)
The opening lines are:
> So I’m going to talk about time today. In particular, how we treat time in object-oriented languages generally and maybe how we fail to. So I’m trying to provoke you today to just reconsider some fundamental things that I just think we get so entrenched with what we do every day, we fail to step back and look at what exactly are we doing.
Whoever downvoted my previous comment does not know their Clojure, that's for sure.
In Study of non-programmers' solutions to programming problems [pdf]