From: Philippe Verdy (verdy_p@wanadoo.fr)
Date: Sun Oct 14 2007 - 20:45:23 CDT
Hans Aberg wrote:
> Envoyé : dimanche 14 octobre 2007 21:54
> À : verdy_p@wanadoo.fr
> Cc : 'Mark Davis'; 'Unicode List'
> Objet : Re: FYI: Regex paper for UTC
>
> On 14 Oct 2007, at 20:15, Philippe Verdy wrote:
>
> > The intent is not to find all matches, but having the possibility
> > of finding
> > them all;
>
> This can be done using Haskell style lazy evaluation, similar to a
> Prolog query style.
I know that because I've implemented it (without Haskell and without lazy
evaluation, the specification should not limit the choice of implementation
languages), but this still does not reply the initial question; how are
matches expected to be ordered in the result set?
Of course I could rewrite everything with Haskell or some other FP language,
including in Lisp with lambda-calculus. This will not give any reply to the
initial question, even though it will give a strong mathematical proof of
the concept (a proof verified by the language itself).
This archive was generated by hypermail 2.1.5 : Sun Oct 14 2007 - 20:47:42 CDT