W3C home > Mailing lists > Public > xml-dist-app@w3.org > September 2002

Re: Issue 302: Graph edges that do not terminate

From: Marc Hadley <marc.hadley@sun.com>
Date: Tue, 10 Sep 2002 16:23:06 -0400
Cc: Jacek Kopecky <jacek@systinet.com>, Martin Gudgin <mgudgin@microsoft.com>, XMLP Dist App <xml-dist-app@w3.org>
To: noah_mendelsohn@us.ibm.com
Message-Id: <1DB83CCE-C4FB-11D6-88EC-0003937568DC@sun.com>

On Tuesday, Sep 10, 2002, at 16:06 US/Eastern, 
noah_mendelsohn@us.ibm.com wrote:

> I agree with everything you wrote regarding RPC and encodings that run
> into headers.

>   I was only responding to your original suggestion that in
> the case of RPC, there could be at most one root. My interpretation is:
> "yes" insofar as you do know where to start decoding the method name 
> and
> arguments, but "no" in the sense that a header could in principle
> introduce another sourceless edge into the node (I.e. typically the
> struct) that holds the arguments.  I agree this is more or less 
> harmless,
> but in this sense there can be more than one root, I think.


Marc Hadley <marc.hadley@sun.com>
XML Technology Center, Sun Microsystems.
Received on Tuesday, 10 September 2002 16:23:40 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 23:11:52 UTC