[XML-DEV Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message]

Re: RE: An elegant implementation of an XML graph traversal

• From: Michael Kay <mike@saxonica.com>
• To: xml-dev@lists.xml.org
• Date: Sun, 09 Oct 2011 00:10:35 +0100

On 08/10/2011 21:35, Costello, Roger L. wrote:
> Hi Folks,
>
> As I examine Martin's solution to the problem of traversing an XML graph, it occurs to me that it may be possible to abstract his particular implementation to a declarative (inductive) definition.
It would be more usual to do this the other way around - to start from 
the inductive definition and move to the implementation.

The inductive definition, of course, does not need to worry about 
looping or termination. That's something programmers have difficulty 
grasping. Once you escape from the mindset of telling computers how to 
implement things, infinite sets pose no particular problem.

Michael Kay
Saxonica

• References:
  • RE: An elegant implementation of an XML graph traversal
    • From: "Costello, Roger L." <costello@mitre.org>