[Haskell-cafe] Re: Efficient parallel regular expressions

Jonathan Cast jonathanccast at fastmail.fm
Tue Nov 4 12:29:26 EST 2008

On Tue, 2008-11-04 at 18:26 +0100, Achim Schneider wrote:
> Martijn van Steenbergen <martijn at van.steenbergen.nl> wrote:
> > Does anyone have any experience with this? What's the best way to
> > achieve this?
> > 
> For anything remotely connected to parsing, always use parsec. 
> I'd not be surprised if the beast is touring complete in itself...

This is an interesting question: what would constitute
Turing-completeness for an EDSL, independently of the host language?


More information about the Haskell-Cafe mailing list