[XSL-LIST Mailing List Archive Home] [By Thread] [By Date]

Re: [xsl] following-sibling and xsl:sort

Subject: Re: [xsl] following-sibling and xsl:sort
From: Elliotte Harold <elharo@xxxxxxxxxxxxxxx>
Date: Fri, 29 Apr 2005 18:57:02 -0400

Michael Kay wrote:

Me too. Turing completeness is not the same as closure over the data model.
To take an obvious example, there is no way of creating a result tree that
contains an unparsed entity, even though the data model allows unparsed
entities to exist.

Closure only implies that you never create anything not in the set; not that you can create everything in the set.

--
Elliotte Rusty Harold  elharo@xxxxxxxxxxxxxxx
XML in a Nutshell 3rd Edition Just Published!
http://www.cafeconleche.org/books/xian3/
http://www.amazon.com/exec/obidos/ISBN=0596007647/cafeaulaitA/ref=nosim

Current Thread
RE: [xsl] following-sibling and xsl:sort, (continued) Wendell Piez - 29 Apr 2005 22:48:51 -0000 Dimitre Novatchev - 30 Apr 2005 00:13:15 -0000 Message not available Dimitre Novatchev - 30 Apr 2005 01:27:57 -0000 David Carlisle - 29 Apr 2005 22:49:50 -0000 Elliotte Harold - 29 Apr 2005 22:57:25 -0000 <= Michael Kay - 30 Apr 2005 13:07:39 -0000

<- Previous	Index	Next ->
Re: [xsl] following-sibling and xsl, David Carlisle	Thread	RE: [xsl] following-sibling and xsl, Michael Kay
Re: [xsl] following-sibling and xsl, David Carlisle	Date	Re: [xsl] following-sibling and xsl, Dimitre Novatchev
	Month

© 2002-2008 SyncRO Soft Ltd. All rights reserved.
                                             | Sitemap | Privacy Policy 
 This website was created & generated with
                                             <oXygen/> XML Editor


	Keywords xml