Re: [Chicken-users] big prime number

Peter Bex writes: > Now, the good news is that I also ran the program under CHICKEN 5 and > it took just under 17 seconds to complete. Most likely this is because > the whole thing can be done completely inline, without any CPS calls, > which means a lot less allocation,

Re: [Chicken-users] Scraping the REPL?

Thank you, Dan for the warning. Matt, about script: that sounds like it might be perfect for me. I do use Linux, as it is good for LaTeX. Sorry for my confusion; I'll check it out. Regards, Jim -- "Does not the Captain seek your advice, sir?" "Not

Re: [Chicken-users] Scraping the REPL?

Word of warning: Babel seems to be hard-coded for Guile only; there are several open bugs regarding Babel and Geiser regarding, for instance, it breaking with Chicken. -Dan Alex Charlton writes: > Hi James, > > The best thing that I've found for creating "living"

Re: [Chicken-users] big prime number

On Sun, Jan 24, 2016 at 03:25:04PM -0500, Claude Marinier wrote: > Bonjour, Hello Claude, > Here is the program (minus timing code). > > (use numbers) > (define big-prime (- (expt 2 74207281) 1)) > (define big-print-str (number->string big-prime)) > (define outport (open-output-file

[Chicken-users] big prime number

Bonjour, Spurred by the recent excitement about a new largest prime number (1), I wanted to see how long it would take to just write the number. So I wrote a simple program and added timing to produce the following. claude@hibou:~/Programming/scheme$ ./big-prime time to compute big prime : 1.074