[xquery-talk] XQuery static typing algorithms?

[Bas de Bakker]

Maybe you can find something useful here:

http://www-db.informatik.uni-tuebingen.de/research/pathfinder/publications

In particular the article "Subtyping For Regular Tree Types : a
JAVA-based Implementation".

Regards,
Bas de Bakker

-----Original Message-----
From: Per Bothner <per at bothner.com>
To: talk at x-query.com
Subject: [xquery-talk] XQuery static typing algorithms?
Date: Sun, 23 Nov 2008 10:45:34 -0800

Is there somewhere a reasonably accessible description of the
tree algorithms needed for XQuery static typing?  I.e. reasonably
readable code (assuming I can study it without legal IP concerns)
or an article?  The Formal Semantics references the 262-page TATA book,
which is more than I'm willing to deal with.

(Not that I have any immediate plans to implement more than
ad hoc static typing for XQuery, but at least it would be nice
to have a road-map, so anything I do is compatible with a real
solution.  Though if the algorithms aren't too complicated, maybe
I'll be inspired ...)