[racket-users] benchmarks game

Hi, I got interested into The Computer Language Benchmarks Game. The binary-trees benchmark is different between the BC (parallel) and CS (single threaded) versions. On trying to execute the parallel version on RacketCS with the expected commands (`raco make binarytrees`, and then `racket

[racket-users] garbage collection

I'm in a very small programming operation, and I am trying to get my co-workers to try out Racket, or at least tolerate some of the tools being written in Racket. One of them has a very simple decision tree that he uses to evaluate programming languages: "does it have a garbage collector?", if

Re: [racket-users] garbage collection

It depends a lot on what you mean by a “Lisp-y” language. I’m certainly not going to disagree with the sentiments expressed in the stack overflow post that Dan Prager posted… after all, I wrote the top-posted one! You’re asking a question about persuading a co-worker, though. In my opinion, the

Re: [racket-users] garbage collection

> is it possible to run modern Lisp-y languages without a garbage collector? Is it even smart to try? This seems to cover it ... https://stackoverflow.com/questions/16240183/not-using-garbage-collector-in-scheme-lisp-implementation Dan -- You received this message because you are subscribed

Re: [racket-users] benchmarks game

Hi, Can you say more about which version of Racket you're running and on what platform? Thanks! Matthew At Sun, 25 Oct 2020 03:47:39 -0700 (PDT), Raoul Schorer wrote: > > Hi, > > I got interested into The Computer Language Benchmarks Game. > > The binary-trees benchmark is different between

Re: [racket-users] garbage collection

On Sun, Oct 25, 2020 at 04:41:41PM -0400, 'John Clements' via Racket Users wrote: > It depends a lot on what you mean by a “Lisp-y” language. I’m certainly not > going to disagree with the sentiments expressed in the stack overflow post > that Dan Prager posted… after all, I wrote the