Probably I overdid the real part.I was thinking of examples such as ASTs (such as the Haskell one), trees and imagining more fancy things, maybe L-systems and fractal processing. I will have a look at the Haskell sources and the previous papers from Tim Sheard.
Cheers, hugo On Sun, Oct 26, 2008 at 6:07 PM, Niklas Broberg <[EMAIL PROTECTED]>wrote: > > Think of any "real" programming language out there. For example, in many > > languages statements may contain expressions, and expressions in turn may > > contain statements (in Java through anonymous inner classes, for > example). > > ... and as an example of this you could have a look at the > haskell-src(-exts) package that encodes the Haskell syntax as an AST. > For example there are expressions containing statements (e.g. the > do-expression) and statements containing expressions (obviously). > > Cheers, > > /Niklas > -- www.di.uminho.pt/~hpacheco
_______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
