>
> PS You also mentioned sedna. I'm guessing you might also be frustrated
> with relation databases? I am also tired of writing ORMs and am using the
> move to Racket as a good chance to move to different ways of storing
> data, I've found that Riak http://wiki.basho.com/ works well, and its the
>
It is often used to represent a function that applies on a term, or an
expression.
[ t ] means the function [] applied to t.
In those papers, it often represent a CPS transform.
Like [ x ] = \ k . k x would mean "the cps transform of 'x' is '\ k .
k x' , or cps(x) = \ k . k x.
Using [ _ ] is
> But you could also break the tail-call discipline of CPS and translate [shift
> e] as \k. (k [e](\x.x))
> Or you can use our 'abstract' continuations to manipulate a stack of
> continuations directly.
What are your 'abstract' continuations? Sounds very interesting.
I think your solution is perfectly sensible.
shift/reset needs two CPS transformations. Then you have two
continuations : one local (up to the next reset), one global
(from the next reset to the toplevel). The global one is usually
called the meta-continuation, and often denoted m.
I think this i
On Tue, Nov 15, 2011 at 8:14 PM, Grant Rettke wrote:
>
> That is like eval but for talking to objects?
>
More like looking up an interned symbol from a namespace.
(A very limited form of eval...)
Best,
Nicolas.
_
For list-related administrative
Dear all,
Is there a function to send to a class with a dynamic symbol instead of a
static one?
As in (send 'method-name)
send seems to reduce to find-method/who, but this function is not exported.
Best regards,
Nicolas.
_
For list-related
It works. Thank you very much.
On Sun, Nov 13, 2011 at 1:40 PM, Chris wrote:
> +1 on this. I know other REPLs (at least python) do the same, but I think
> behaving like a command line would be more natural to most people.
> Ctrl+Enter to evaluate, Enter to line break would be nice too.
>
>
I like Dr Racket very much, but I have a small problem that might be easy
to solve:
When hitting return in the middle of a line, in the REPL, in does not
evaluate the line but adds a line break.
I think this might be the right behaviour but I would like to have a way to
send the s-expr to evaluat
The new master version got rid of my memory leak.
Thank you so much for the quick patch.
Best,
Nicolas.
_
For list-related administrative tasks:
http://lists.racket-lang.org/listinfo/users
Thank you very much.
If I can help in any way, please ask.
Best regards,
Nicolas.
_
For list-related administrative tasks:
http://lists.racket-lang.org/listinfo/users
Dear all,
Following on my memory leak problem, I managed to minimise my program.
And I still don't understand why it leaks.
Here is a minimised example:
(define prompt1 (make-continuation-prompt-tag 'p1))
(define prompt2 (make-continuation-prompt-tag 'p2))
(define (capture-and-abort prompt-tag)
I am still struggling a bit.
Is there a way to profile/snapshot/inspect memory?
What is the canonical way to find a memory leak in a Racket program?
Best regards,
Nicolas.
_
For list-related administrative tasks:
http://lists.racket-lang.org/l
Thank you so much for the very quick answer.
Best,
Nicolas.
_
For list-related administrative tasks:
http://lists.racket-lang.org/listinfo/users
Dear all,
I am struggling to find the origin of a memory leak in a small program I
wrote.
In order to help me searching, I would like to know a few details on the
implementation of Racket.
1)
(define (f x y)
(lambda () x))
(define g (f 2 veryBigObject) )
Can I be sure that g does not retain
expanded.
> Jos
>
> --
> *From:* users-boun...@racket-lang.org [mailto:
> users-boun...@racket-lang.org] *On Behalf Of *nicolas.o...@gmail.com
> *Sent:* viernes, 14 de octubre de 2011 21:40
> *To:* users@racket-lang.org
> *Subject:* [racket] begi
Dear all,
I don't understand this behaviour:
> (define k #f)
> (begin (let/cc out (set! k out)) 5)
5
> (k #f)
#f
> (let () (let/cc out (set! k out)) 5)
5
> (k #f)
5
Does begin something special regarding continuation?
Best regards,
Nicolas.
_
100, "nicolas.o...@gmail.com" wrote:
> > I am trying to write a small implementation of Protocol Buffers (
> > http://code.google.com/p/protobuf/ ) and I have difficulties
> > with bit manipulations, especially to transform a negative integer into a
> > series of byte
Dear all,
I am trying to write a small implementation of Protocol Buffers (
http://code.google.com/p/protobuf/ ) and I have difficulties
with bit manipulations, especially to transform a negative integer into a
series of bytes and back.
I can not find an implementation of a non-arithmetic shift
18 matches
Mail list logo
