Subject: RE: XSL Theory From: Kay Michael <Michael.Kay@xxxxxxx> Date: Fri, 10 Mar 2000 19:05:01 -0000 |
> >There is probably a sub-set of XML where the transformations > should be provable. > This is just a specific instance of a more general problem: proving > the correctness of computer programs. I suspect if you take the problem the other way round, and try to prove incorrectness, you will make a lot more progress. I would think there are a large number of cases where, given a schema to which the source document must conform, and a stylesheet, I can prove quite easily that the result will NOT always conform to a given result schema. That sounds like a worthwhile thing to do. Mike Kay XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: XSL Theory, Christopher R. Maden | Thread | Re: XSL Theory, Steve Schafer |
Re: XSL Theory, Steve Schafer | Date | [JOB] Senior XML/XSL Java Developer, Peter Bryant |
Month |