I personally think this structure is the 'cleanest' yet, and I think it can be clearly described and easily understood. It is not as expressive as some of the other schemes, but Frank seems content with it, and I don't expect that we'll come across much harder cases than American Law Style. I would have no problems introducing this in CSL.
(whether or not we truly need "nand"/"anynot" as a value for the "match" attribute seems like a separate issue to me. Frank, please let us know if you come across cases where it would be useful) Rintze ------------------------------------------------------------------------------ Learn Graph Databases - Download FREE O'Reilly Book "Graph Databases" is the definitive new guide to graph databases and their applications. This 200-page book is written by three acclaimed leaders in the field. The early access version is available now. Download your free book today! http://p.sf.net/sfu/neotech_d2d_may _______________________________________________ xbiblio-devel mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/xbiblio-devel
