#Racket has its own #looping construct (time (for ([j 100000]) (for/sum ([i 10001]) i))) at the same speed as named let.
To use #SRFI 42 for #looping in #Racket you (require srfi/42). Then you can (list-ec (: i 5) (* i i)) and get a list of squares, but it takes twice as long as it should.
The most widely supported #looping construct in #Scheme is #SRFI 42.
on 02023-09-01The R7RS work-in-progress proposal for a #looping macro for #Scheme.
on 02023-09-01Taylor Campbell’s foof-loop proposal for a #looping macro for #Scheme.
on 02023-09-01Olin Shivers’s apparently unimplemented proposal from ICFP 02005 of a #looping macro for #Scheme. Seems a lot like Haskell do-notation.
on 02023-09-01