On 16-Dec-2003, [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote: > G'day all. > > Quoting John Meacham <[EMAIL PROTECTED]>: > > > Imagine I have a data structure like so: > > > > data E = EAp E E | ELam Int E | ELetRec [(Int,E)] E | EVar Int > > > > now, I want to annotate every occurence of E with some pass specific > > information, such as free variables or levels for lambda lifting. > > http://haskell.org/hawiki/DecoratingStructures > http://haskell.org/hawiki/IndirectComposite
Unless I missed something, none of those solve all the problems that Meacham is trying to solve (numbers 1 and 2 in his original mail). -- Fergus Henderson <[EMAIL PROTECTED]> | "I have always known that the pursuit The University of Melbourne | of excellence is a lethal habit" WWW: <http://www.cs.mu.oz.au/~fjh> | -- the last words of T. S. Garp. _______________________________________________ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
