Subject: Re: XSL Theory From: "Jon Smirl" <jonsmirl@xxxxxxxxxxxx> Date: Fri, 10 Mar 2000 15:49:36 -0500 |
Turing machines deal with infinite, input of all patterns. An XSL sheet with schema restricted input subset is a much different problem. Even thought the input can be infinite in size its pattern is severely restricted to being hierarchical and repetitive. For example you can't write a schema that describes the sequence of digits in PI. XSL is very similar to the comp sci problem of theorem proving and Prolog. Jon Smirl jonsmirl@xxxxxxxxxxxx XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: XSL Theory, Steve Schafer | Thread | Re: XSL Theory, Steve Schafer |
Re: XSL Theory, David Carlisle | Date | Re: xsl:key, David_Marston |
Month |