[plt-scheme] Recursion, graphics, and combinators

It doesn't really do anything with L systems, per se.

Robby

At Thu, 29 Jan 2004 08:49:27 -0500, Matthias Felleisen wrote:
>   For list-related administrative tasks:
>   http://list.cs.brown.edu/mailman/listinfo/plt-scheme
> 
> The best we have are the functional turtles that
> Robby design a few years back. -- Matthias
> 
> 
> On Jan 29, 2004, at 5:45 AM, Noel Welsh wrote:
> 
> >   For list-related administrative tasks:
> >   http://list.cs.brown.edu/mailman/listinfo/plt-scheme
> >
> > Hi all,
> >
> > I've recently become interested in generating
> > recursive graphics and in particular Lindenmayer
> > Systems (L-systems).  Most of this work uses turtle
> > graphics, which are imperative in nature and so lack
> > compositionality.  Is anyone aware of functional
> > approaches to these tasks?
> >
> > (See many pretty pictures off
> > http://www.cpsc.ucalgary.ca/Research/bmv/vmm/plates.html
> > for what some people do with L-systems)
> >
> > TIA,
> > Noel
> >
> > =====
> > Email: noelwelsh <at> yahoo <dot> com
> > Jabber: noelw <at> jabber <dot> org
> >
> > __________________________________
> > Do you Yahoo!?
> > Yahoo! SiteBuilder - Free web site building tool. Try it!
> > http://webhosting.yahoo.com/ps/sb/
> 
>