W3C home > Mailing lists > Public > www-ql@w3.org > October to December 2003

Re: namespace node implementation

From: Per Bothner <per@bothner.com>
Date: Tue, 21 Oct 2003 14:13:26 -0700
Message-ID: <3F95A176.5080908@bothner.com>
To: Per Bothner <per@bothner.com>
Cc: www-ql@w3.org

I've been asked to provide a legal disclaimer before I "start posting 
code and algorithm."

I have not looked at how other implementations handle namespace nodes. 
(I assume ones that support XPath 1.0 need to do something very 
different.)  Thus to the extent it is original it is my own "invention." 
  It is my belief that no other individual or corporation has any rights 
to my inventions in this field.

Unless I or someone else points out a flaw, I intend to implement this 
algorithm in Qexo.  That implementation will be copyrighted myself, 
available under the Kawa triple-license, one of whose options in the GNU 
GPL.

The GPL forbids requiring a royalty in exchange for GPL'd code, though 
it does not explicitly prohibit using patented algorithms.  I.e. it 
appears to be allowable to license a patent such that a royalty might be 
required for non-GPL'd implementations, as long as no royalty is 
required for GPL'd implementations.

However, I have no budget for or desire to patent this particular 
"invention", or refinements thereof.  If I should do so, I agree to 
license this invention on "Royalty-Free terms [as defined by the W3C] to 
all implementors of the XML-Query family of specifications, whether or 
not they are members of W3C."
-- 
	--Per Bothner
per@bothner.com   http://per.bothner.com/
Received on Tuesday, 21 October 2003 17:13:28 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 6 January 2015 20:17:16 UTC