W3C home > Mailing lists > Public > w3c-rdfcore-wg@w3.org > September 2002

RE: Datatyping - abstract syntax - test case

From: Jeremy Carroll <jjc@hplb.hpl.hp.com>
Date: Thu, 12 Sep 2002 19:42:31 +0200
To: "\"Patrick Stickler\" <patrick.stickler@nokia.com>" <w3c-rdfcore-wg@w3.org>, <bwm@hplb.hpl.hp.com>
Message-ID: <BHEGLCKMOHGLGNOKPGHDCECCCAAA.jjc@hpl.hp.com>


> Sure, but you and Patrick might like to get on the phone and sort out
> precisely where you have an issue.

I am of the view this is a minor disagreement, where both sides have a case.
Hence best resolved by a straw poll or something like that.

Patrick you could try phoning me before the telecon tomorrow (also in the
morning).

I am now in Pisa at:
+39 050 315 2032
>
> BTW, I note that your proposal would mean that the abstract syntax would
> have an alphabet that included the reals, i.e. is not countable.  Such
> things sometimes matter to mathematicians, no doubt because their proofs
> rely on countability.  I trust we are all right on that score?
>
> Shooting in the dark
> Brian
>
>
> >I think the test case would suffice as input.
> >
> >
> >Jeremy
>
>
Received on Thursday, 12 September 2002 13:42:36 EDT

This archive was generated by hypermail pre-2.1.9 : Wednesday, 3 September 2003 09:50:59 EDT