Anonymous recursive functions in Racket
github.com
Anonymous recursive functions in Racket
1–10 of 65 posts
Re: Anonymous recursive functions in Racket
#2A relevant article to the domain name of this site.
Re: Anonymous recursive functions in Racket
#3I would rather use a loop so I can debug it.
Re: Anonymous recursive functions in Racket
#4I would rather use a loop so I can debug it.
Tail-recursive functions in Racket are optimized down to essentially for loops.
Re: Anonymous recursive functions in Racket
#5A relevant article to the domain name of this site.
If you look at the code, you'll be (unpleasantly) surprised, I think. The author does not seem to have known what Y combinator is.
Re: Anonymous recursive functions in Racket
#6Re: Anonymous recursive functions in Racket
#7This isn't specific to racket, any implementation of R6RS scheme should fully support this, although the define-syntax form is slightly different.
I checked this with my R6RS implementation and it works just as you would expect (https://github.com/maplant/scheme-rs)
Re: Anonymous recursive functions in Racket
#8Re: Anonymous recursive functions in Racket
#9This isn't specific to racket, any implementation of R6RS scheme should fully support this, although the define-syntax form is slightly different. I checked this with my R6RS implementation and it works just as you would expect ( https://github.com/maplant/scheme-rs )
How close are you to getting a "full" implementation of R6RS?
I've been thinking of picking either your project or Steel[0] for a Rust Scheme thing
Re: Anonymous recursive functions in Racket
#10This isn't specific to racket, any implementation of R6RS scheme should fully support this, although the define-syntax form is slightly different. I checked this with my R6RS implementation and it works just as you would expect ( https://github.com/maplant/scheme-rs )
[deleted]