[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: CPS in Parrot (was: A plea for a new old language)

Vadim, thanks for the links.  Dan, thanks for the great explanations!

Two points:

"And, just to top it off, someone (no, I don't know who, so this might be
 CS Legend) once proved that you can build any control structure you can
 think of with continuations."

Anyone know more about this?  Sounds like it would be a paper worth

Also, Dan doesn't mention segmented stack architectures that are
essentially a linked list of stacklets of finite size.  With this you can
avoid most of the overhead of both stack copying (on the one hand) and
heap-allocated individual frames (on the other hand).  PLT scheme uses this
system.  There is a paper on this, but I can't find it right now.


> Date: Tue, 05 Aug 2003 16:32:05 -0400
> From: Vadim Nasardinov <el-vadimo@comcast.net>
> First of all, your quoting made it look like I was the one who said it. 
>  I didn't.  That quote is from Dan's blog 
> (http://www.sidhe.org/~dan/blog/archives/000226.html).
> Second of all, his (trivially googlable) explanation of CPS is here:
> http://www.sidhe.org/~dan/blog/archives/000185.html
> There's also some related stuff here and here:
> http://www.sidhe.org/~dan/blog/archives/000156.html
> http://www.sidhe.org/~dan/blog/archives/000157.html
> Steve Dekorte wrote:
> >
> > On Tuesday, August 5, 2003, at 6:46 AM, Vadim Nasardinov wrote:
> >
> >> The fear about scaring people
> >> off with them is gone as well--I understand them, I know how to
> >> explain them to people quickly and reasonably simply, and in a way
> >> that can deal with the knee-jerk fear often associated with
> >> them.
> >
> >
> > I'd love to hear your explanation.