- From: Henry S. Thompson <ht@inf.ed.ac.uk>
- Date: Tue, 04 Aug 2009 15:31:50 +0100
- To: public-xml-processing-model-wg@w3.org
- Message-ID: <f5beirrwsyx.fsf@hildegard.inf.ed.ac.uk>
Further to previous correspondence about p:import and step-name conflict detection, here's a proposed rewrite for the appendix which gives an informal algorithm for checking for problems/handling imports in general. Note that unlike the previous one, it's essentially specified bottom-up, in terms of _exports_, because when I tried to implement it that's what worked most easily (I wrote a Scheme implementation of the algorithm before I defined it). I'm particularly interested on feedback on the form of the exposition: rather then do it in pseudo-code as the original has, with lots of variables and processes which all take two arguments and return two values, I've tried to do it at a more abstract level. ht
-- Henry S. Thompson, School of Informatics, University of Edinburgh Half-time member of W3C Team 10 Crichton Street, Edinburgh EH8 9AB, SCOTLAND -- (44) 131 650-4440 Fax: (44) 131 651-1426, e-mail: ht@inf.ed.ac.uk URL: http://www.ltg.ed.ac.uk/~ht/ [mail really from me _always_ has this .sig -- mail without it is forged spam]
Attachments
- text/html attachment: xproc step name conflict detection
Received on Tuesday, 4 August 2009 14:32:34 UTC