Hi Josh, do as done myself: learn both, Chez Scheme and Racket, you will
not regret it.
For Chez Scheme there is the book of Dybvig online, along with other
documentation, and for racket I suggest you "Realm of Racket".
One thing want to tell you: with chez scheme I calculate with recursion
1,000,000! (one million factorial).
Try this with chez scheme:
(define fact
(lambda (n)
(cond ((= n 0) 1)
(else (* n (fact (- n 1)))))))
Then give 1000000.
Racket will do too, but chez scheme is more fast.
A nice day for you
Francesco
Il giorno giovedì 23 maggio 2019 19:09:55 UTC+2, Josh Rubin ha scritto:
> I am just starting to learn Racket. Thank you, all Racket developers.
> I read about the concept of using the Chez Scheme runtime system to
> "host" Racket, so I looked into Chez, and found an interesting paper.
>
> The Development of Chez Scheme by R. Kent Dybvig
> https://www.cs.indiana.edu/%7Edyb/pubs/hocs.pdf
>
> I like its discussion of Scheme implementation issues. I also enjoyed
> reading about the author's evolution as a designer.
>
>
> --
> Josh Rubin
> jlr...@gmail.com <javascript:>
>
>
>
--
You received this message because you are subscribed to the Google Groups
"Racket Users" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to racket-users+unsubscr...@googlegroups.com.
To view this discussion on the web visit
https://groups.google.com/d/msgid/racket-users/362d8c02-86da-4285-ad47-ac83f024e6a3%40googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
