[Home] [By Thread] [By Date] [Recent Entries]
Dan Shoutis wrote: > ... > Additionally, I'd like to let anyone who is interested know that I'm in > the process of building a (toy) relax-ng subtype checker: given two > simple-syntax grammars a and b, it can check that all instances matched > by a will also be matched by b (that is, a <= b). > ... Can you tell more about how your "regular hedge grammar subtype prover" works? You might be interested in this paper: http://www.brics.dk/~amoeller/papers/xactschemas/abstract.html (in particular the last part of Section 6) which also discusses these issues. /Anders
|

Cart



