Re: repeating groups
Date: 21 Feb 2006 10:13:41 -0800
> Marshall Spight wrote:
> > It should be more like stating theorems, and having the compiler
> > prove them or disprove them.
> That is the prolog way.
Yes; prolog is quite an interesting thing to study. At one point I played with the idea of using prolog-style backtracking as the solution to the transitive closure problem with RM. The ancestor query and descendant query are both trivial in prolog, and amazingly declarative.
These days I instead think of backtracking/search as something you want in a library, rather than in the language.
Marshall Received on Tue Feb 21 2006 - 19:13:41 CET