Jani Jaakkola [jjaakkol@xxxxxxxxxxxxxx] wrote:

>This just follows from the fact that DSSSL-style language is
>Turing complete. Therefore any computing problem that can be
>solved with a computer can also be solved with the style language.
>Transformations are just one class of computing problems.

Yes, of course, this is one possible official answer, but the intention 
of my question was more down to earth, to learn if somebody had
been occupied to demonstrate that the SGML flow objects 
approach in Jade is (e.g., Turing) complete.

In Paul's enthusiastic argument, (presumably due to my level
of awareness) I failed to see the distinction between the style 
language as in ISO/IEC 10743 and as implemented by Jade.

Best regards,

--
Jacques Deseyne <jdeseyne@xxxxxxxxx>


 XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list