W3C home > Mailing lists > Public > public-iri@w3.org > March 2004

Re: Character-by-Character Distinct IRI-> Char-by-char equivalent URI (issue #IRIURIcharequiv-20)

From: Roy T. Fielding <fielding@gbiv.com>
Date: Thu, 25 Mar 2004 14:26:23 -0800
Cc: "Williams, Stuart" <skw@hp.com>, "Ian B. Jacobs" <ij@w3.org>, public-iri@w3.org
To: Martin Duerst <duerst@w3.org>
Message-Id: <72E69064-7EAB-11D8-9128-000393753936@gbiv.com>

> For example http://www.example.org/ (1) and HTTP://www.example.org (2).
> The URI spec says that these are equivalent, but they identify
> two different namespaces, and they identify two different nodes
> in an RDF graph.

No they don't.  The result of processing them with namespaces may
be disjunct name sets, and the result of processing them with
RDF may be bifurcated graphs, but what they identify is the same
regardless of the processing rules of any technology other than
the URI scheme's name assignment algorithm.  Any other technology
is implicitly licensed to join those sets or those graphs if they
wish to spend the effort to do so -- RDF and xmlns specifications
merely define the processing rules for minimal conformance, not
equivalence of resources.

Received on Thursday, 25 March 2004 17:27:16 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 6 January 2015 20:39:38 UTC