- From: Elliotte Harold <elharo@metalab.unc.edu>
- Date: Wed, 08 Feb 2006 08:04:04 -0500
- To: Dan Connolly <connolly@w3.org>
- CC: "Bullard, Claude L (Len)" <len.bullard@intergraph.com>, "'Henry S. Thompson'" <ht@inf.ed.ac.uk>, noah_mendelsohn@us.ibm.com, Vincent.Quint@inrialpes.fr, www-tag@w3.org
Dan Connolly wrote: > Schematron is turing-complete, as I understand. DTDs are not. Schematron is not Turing complete. It has no loops or recursion. remember it is based on XPath (not Turing complete) rather than XSLT (Turing complete). It is often implemented in XSLT, but it does not provide full access to XSLT from the Schematron language itself. -- Elliotte Rusty Harold elharo@metalab.unc.edu 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
Received on Wednesday, 8 February 2006 13:04:15 UTC