On Aug 14, 2015, at 7:02 AM, Klaus Ostermann <klaus...@gmail.com> wrote:
> Robby, I think what I want is simple to say: > > If I have a Racket program and manually CPS-transform and then > defunctionalize it, I would be able to compare and analyze continuations (and > normal procedures, for that matter). > > I want to be able to do the same without CPS-transforming and > defunctionalizing by hand, and I was hoping that there is some way to do that > in terms of the continuation machinery in Racket. > > -- > You received this message because you are subscribed to the Google Groups > "Racket Users" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to racket-users+unsubscr...@googlegroups.com. > For more options, visit https://groups.google.com/d/optout. You may wish to peruse Continuations from Generalized Stack Inspection http://www.ccs.neu.edu/racket/pubs/#icfp05-pcmkf It expands on Jay and Robby's suggestion and also explains how to get similar things implemented with pre-processors in C#, say. In the end, though, Robby's question is most pertinent. When you discuss equality, you must settle on some notion of comparison. [[ This is why most talk about referential transparency is such unscientific mumbo-jumbo. ]] You clearly have an intensional one in mind. But then the question is (1) how grey is your cat? and (2) how do you paint the cat grey? The second question is answered by the above paper. The first one is one for philosophers. -- Matthias -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
