> > > If you want to do a formal proof, you might want to use simplified notions of > XML documents and path expressions.
It seems to be a long-standing tradition that computer scientists, when asked to prove a difficult conjecture C, respond by giving a proof for a simplified conjecture C'. While this might lead to progress in the long run, and enables them to get papers published in the academic literature, it is totally useless to practical engineeers who want to know whether they can safely rely on C. Michael Kay Saxonica _______________________________________________ [email protected] http://x-query.com/mailman/listinfo/talk
