So am I eligible for some kind of reinventing the wheel award at Rackcon
2012?
On Thu, May 24, 2012 at 1:53 PM, Eli Barzilay wrote:
A relevant side-comment is that this is a popular way for implementing
tail-calls:
http://en.wikipedia.org/wiki/Tail_call#Through_trampolining
20 minutes a
A relevant side-comment is that this is a popular way for implementing
tail-calls:
http://en.wikipedia.org/wiki/Tail_call#Through_trampolining
20 minutes ago, Galler wrote:
> Y, that's closer to what I had in mind.
>
>
> On Thu, May 24, 2012 at 1:18 PM, Eli Barzilay wrote:
>
> > Just now,
Y, that's closer to what I had in mind.
On Thu, May 24, 2012 at 1:18 PM, Eli Barzilay wrote:
Just now, Galler wrote:
Eli,
I fully agree with you that any FSM is equivalent to functional
composition and can be implemented in the manner you show.
However , in the way you've implemented the
Just now, Galler wrote:
> Eli,
>
> I fully agree with you that any FSM is equivalent to functional
> composition and can be implemented in the manner you show.
>
> However , in the way you've implemented the signal-handlers
>
> (define (B i)
> > (if (= 0 (get i))
> > (begin (pri
Eli,
I fully agree with you that any FSM is equivalent to functional
composition and can be implemented in the manner you show.
However , in the way you've implemented the signal-handlers
(define (B i)
(if (= 0 (get i))
(begin (printf "~s)" (sub1 i))
(next A i))
On May 24, 2012, at 11:59 AM, Eli Barzilay wrote:
> More than a week ago, Galler wrote:
>> This code was generated in response to the user who sought to
>> implement run-length encoding of a bit-vector on Sunday night.
>> [...]
>> Its a good 10 second answer to "what can you do with composable co
More than a week ago, Galler wrote:
> This code was generated in response to the user who sought to
> implement run-length encoding of a bit-vector on Sunday night.
> [...]
> Its a good 10 second answer to "what can you do with composable control"
> that would be impossible in its absence?
Note th
Marjin,
my attempt at an answer:
Yes, just the two-state machine is presented, but could be used for
larger FSMs.
And, yes, that would be the webserver that is provided with racket.
In what way is this solution impossible without it?
I represent the solution provides the following feature
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi Zack,
On 15-05-12 18:56, Galler wrote:
> This code was generated in response to the user who sought to
> implement run-length encoding of a bit-vector on Sunday night.
>
> I didn't post this to the board b/c there's a much easier way to
> solve pr
This code was generated in response to the user who sought to implement
run-length encoding of a bit-vector on Sunday night.
I didn't post this to the board b/c there's a much easier way to solve
problem using regular expressions, which Eli B. demonstrated.
But, the (infinite-k-pump) function st
10 matches
Mail list logo
