[plt-scheme] append!?

There's a template library for this kind of thing by Yannis. I think
you have to still list out the free variables in the closure, and
that's the only thing extra.

Robby

On 10/22/07, Matthias Felleisen <matthias at ccs.neu.edu> wrote:
> Use C++ just enough to get closure objects and overload apply. --
> Matthias
>
>
>
> On Oct 22, 2007, at 11:48 AM, Eli Barzilay wrote:
>
> > On Oct 22, Robby Findler wrote:
> >> Or trampolines? But gcc has a tail-call optimization, I thought.
> >
> > It has some limited support -- IIRC, only recursion, not even mutual
> > recursion, and definitely not arbitrary never-return calls.
> >
> >
> >> As far as closures go, I agree that it won't really be closures,
> >> which is why I wondered if that disqualified this way of writing
> >> it. But it seems reasonably close.
> >
> > I have some dim memory of similar things -- they were far from what
> > you get in a functional language.
> >
> > --
> >           ((lambda (x) (x x)) (lambda (x) (x x)))          Eli
> > Barzilay:
> >                   http://www.barzilay.org/                 Maze is
> > Life!
> > _________________________________________________
> >   For list-related administrative tasks:
> >   http://list.cs.brown.edu/mailman/listinfo/plt-scheme
>
>