3 ms·
I have re-implemented rackets for loops using named let in a way that allows me to almost reach feature parity in a weekend [0]. I could implement python's list
by bjoli 8y ago
I have re-implemented rackets for loops using named let in a way that allows me to almost reach feature parity in a weekend [0]. I could implement python's list comprehensions the same way without much fuss.
I can't imagine having to do the same using an already existing looping construct with it's own edge cases and subtle semantics.
[0]: I didn't think about post-guards when I started, and adding them now would mean having to do some restructuring of the quite hairy emitting macro, which I won't do since I don't see the use case for post guards for anything else than making in-value a bit more elegant