On Friday, September 4, 2015 at 1:34:38 AM UTC-4, Linh Chi Nguyen wrote:
> Wow as much as i appreciate and try to see through all the answers, i have to
> confess that i'm a first year Phd student in economics. So writing macro is
> too far for me now.
>
> I'd just process with struct.. And see
Wow as much as i appreciate and try to see through all the answers, i have to
confess that i'm a first year Phd student in economics. So writing macro is too
far for me now.
I'd just process with struct.. And see how expensive it is for my agent based
model. Hopefully i can show you the code so
This a fantastic! Thank you for the access to old versions of Racket.
Robby
On Thu, Sep 3, 2015 at 6:29 PM, Jack Firth wrote:
>> Perhaps you could provide your Dockerfile etc. on Github so others could
>> look into it and maybe give some hints.
>
> I've got them up at https://github.com/jackfirt
> Perhaps you could provide your Dockerfile etc. on Github so others could
> look into it and maybe give some hints.
I've got them up at https://github.com/jackfirth/racket-docker, and they're on
Docker Hub as https://hub.docker.com/r/jackfirth/racket/. Currently the images
are built off Debian
On Thursday, September 3, 2015 at 10:29:33 AM UTC-4, Linh Chi Nguyen wrote:
> Dear All,
> I'm a complete newbie in racket and need help in coding finite state
> machine/automata. Please pardon any of my ignorance.
>
> Thanks to this post of Tim Thornton, I see a very good way to code FSM:
> http:
On Sep 3, 2015, at 11:44, Konrad Hinsen wrote:
> Hi everyone,
>
> Here's another plea for help from the macro experts. I am trying to
> write a macro whose expansion contains another macro, more precisely a
> let-syntax form. My full example is attached below. In the first part,
> I use a let-sy
On Thursday, September 3, 2015 at 12:27:01 PM UTC-4, Jens Axel Søgaard wrote:
> [...]
>
> For this task places will be the perfect choice.
>
> [...]
Great - thanks for the advice. I'll create a non-parallel version first as a
baseline, and then a version with places. Once I have some code to s
Hi everyone,
Here's another plea for help from the macro experts. I am trying to
write a macro whose expansion contains another macro, more precisely a
let-syntax form. My full example is attached below. In the first part,
I use a let-syntax directly. In the second part, I use a macro that
generat
Hi Brian,
For this task places will be the perfect choice.
Two reasons:
i) each place can work a on its own board (and there is no need for
shared data)
[at least if you are not using transposition tables]
ii) the amount of data needed to start a task from a given board is only a
few by
On Monday, August 31, 2015 at 1:27:42 PM UTC-4, Brian Adkins wrote:
> I'm writing a Reversi/Othello game engine in Racket as a learning exercise.
> Since my macbook pro has 4 cores and 8 hardware threads, I'd like to see what
> sort of speedup I can get by parallelizing it.
>
> I read through ch
On 03/09/2015 16:34, Neil Van Dyke wrote:
If your FSM are defined at compile-time, you can write a macro (in
`syntax-rules` or `syntax-case`) that transforms FSMs defined in your
FSM macro language to efficient Racket code.
Even with a macro, there are a few popular ways to do it, but I
suggest
If your FSM are defined at compile-time, you can write a macro (in
`syntax-rules` or `syntax-case`) that transforms FSMs defined in your
FSM macro language to efficient Racket code.
Even with a macro, there are a few popular ways to do it, but I suggest
trying to make your state transitions be
On 03/09/2015 16:29, Linh Chi Nguyen wrote:
Dear All,
I'm a complete newbie in racket and need help in coding finite state
machine/automata. Please pardon any of my ignorance.
Thanks to this post of Tim Thornton, I see a very good way to code FSM:
http://timthornton.net/blog/id/538fa6f2f09a16
Dear All,
I'm a complete newbie in racket and need help in coding finite state
machine/automata. Please pardon any of my ignorance.
Thanks to this post of Tim Thornton, I see a very good way to code FSM:
http://timthornton.net/blog/id/538fa6f2f09a16ba0674813d
I'd summarise it as following:
A fin
At Thu, 3 Sep 2015 11:12:50 +0100, Tim Brown wrote:
> On 28/08/15 20:02, Matthew Flatt wrote:
> > I think the sandbox is relevant because `sandbox-memory-limit` remains
> > in effect (even though you're disabling the per-evaluation limit by
> > setting `sandbox-eval-limits`). A sandbox memory limit
Jens Axel Søgaard writes:
> Here are two variations:
...
Alexander D. Knauth writes:
> To make it look a little less messy, here's what I would do for stuff like
> this:
...
Matthias Felleisen writes:
> I think you want either this:
...
Ryan Culpepper writes:
> Here's one more solution
On 28/08/15 20:02, Matthew Flatt wrote:
> I think the sandbox is relevant because `sandbox-memory-limit` remains
> in effect (even though you're disabling the per-evaluation limit by
> setting `sandbox-eval-limits`). A sandbox memory limit triggers memory
> accounting in the GC. I see that memory a
Am 03.09.2015 um 08:07 schrieb Jack Firth:
> I've attempted to compile from source in an alpine image, but with no
> success. There's a bit too much arcane magic there for me to figure out how
> to do that.
>
Perhaps you could provide your Dockerfile etc. on Github so others could
look into it
Am 03.09.2015 um 07:19 schrieb Rickard Andersson:
> I've previously tried to minimize the build without any success, so if
> you can make a base image using only busybox or alpine linux without any
> problems that'd obviously be preferable.
I would welcome that as well. I was doing some experiment
19 matches
Mail list logo
