[Haskell-cafe] Re: Efficient parallel regular expressions

using strings (inside a program) to represent structured data is wrong (*). of course you need strings for interfacing the "outside" world, but the microsecond they get on the inside, they should be tokenized and parsed away into something useful (= an abstract syntax tree). (*) corollary: using strings to represent regular expressions is also wrong...