←back to thread

Anonymous recursive functions in Racket

(github.com)
88 points azhenley | 1 comments | 04 Sep 25 00:39 UTC | HN request time: 0s | source
Show context
maplant ◴[06 Sep 25 22:14 UTC] No.45153371[source]▶
This 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)

replies(3): >>45153752 #>>45153767 #>>45154218 #
valorzard ◴[06 Sep 25 23:10 UTC] No.45153752[source]▶
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

[0] https://github.com/mattwparas/steel

replies(1): >>45153891 #
1. maplant ◴[06 Sep 25 23:37 UTC] No.45153891[source]▶
I’m hoping by the end of the year. All of the “difficult” things are finished (control flow, syntax transformers, call/cc, dynamic wind, exceptions, libraries, etc) and it’s just a matter of filling missing base library functions. If there’s something in particular that you need you’re welcome to file and issue or post a message on the discord and I’ll prioritize it.

That being said, Steel is excellent and I highly recommend it if you just need R5RS with syntax transformers