Re: following-sibling and xsl:sort

Play the video

Subject: Re: 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: 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: following-sibling and xsl, David Carlisle	Thread	RE: following-sibling and xsl, Michael Kay
Re: following-sibling and xsl, David Carlisle	Date	Re: following-sibling and xsl, Dimitre Novatchev
	Month

PURCHASE STYLUS STUDIO ONLINE TODAY!

Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!

Download The World's Best XML IDE!

Accelerate XML development with our award-winning XML IDE - Download a free trial today!

Subscribe in XML format

RSS 2.0
Atom 0.3

XML Editor - Download a 15 Day Free Trial Now >

See What's New in Stylus Studio >

Buy Stylus Studio - XML Editor - Now >