On Tue, 2013-04-09 at 21:48 +0100, David Sheets wrote:
> [...]
> I don't see how one could encode, e.g.,
> SK calculus in XML's entity resolution semantics.
>
> Can you set XML parsers into infinite loops via entity resolution?
> Afaik, entities cannot be self-referential and support no
> parameterization...
Correct; for Turing-completeness you generally need some sort of
conditional test, and we don't really have that.
You could implement an entity resolver that ran XSLT :-) but that's
cheating.
--
Liam Quin - XML Activity Lead, W3C, http://www.w3.org/People/Quin/
Pictures from old books: http://fromoldbooks.org/
Ankh: irc.sorcery.net irc.gnome.org freenode/#xml
