W3C home > Mailing lists > Public > www-tag@w3.org > February 2006

Re: Principle of Least Power (was Re: Agenda of 7 February 2006 T AG teleconference)

From: Elliotte Harold <elharo@metalab.unc.edu>
Date: Wed, 08 Feb 2006 08:04:04 -0500
Message-ID: <43E9EC44.9010205@metalab.unc.edu>
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!
Received on Wednesday, 8 February 2006 13:04:15 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 7 January 2015 15:32:48 UTC