Fold and Scan
The Array Cast
The Problem With the Fixed Point Algorithm in K and Q
There are no primitives that can keep going forever in BQ. There's nothing that takes a variable amount of time depending on what argument it gets. So, be careful it has repeat, but it's only ever a fixed number of times. What an awesome rabbit hole. I feel like I've dropped through something. Sounds like so that there was, there was like fixed point scans in there, which I think they've been referred to. Does that make K and Q the only languages that have those two?
00:00
Transcript
Play full episode
Remember Everything You Learn from Podcasts
Save insights instantly, chat with episodes, and build lasting knowledge - all powered by AI.
