W3C home > Mailing lists > Public > public-sparql-dev@w3.org > October to December 2014

Re: typing and overflow

From: Steve Harris <swh@ecs.soton.ac.uk>
Date: Wed, 29 Oct 2014 22:36:41 +0000
Message-ID: <EMEW3|ac467431277bbe6ffd43a58f25c7af85q9SMb003swh|ecs.soton.ac.uk|999A5C92-BFE6-41E8-BA75-A78C018B8696@ecs.soton.ac.uk>
Cc: "public-sparql-dev@w3.org" <public-sparql-dev@w3.org>, Arthur Keen <arthur.keen@sparqlcity.com>
To: John Yates <john.yates@sparqlcity.com>
Section 17.3 of the 1.1 query spec (sorry, can't link directly to it, on my phone, but open the spec and search for "promotion") says that it does type promotion (inherited from XPath F&O), and links to the description at http://www.w3.org/TR/xpath20/#promotion

> On 28 Oct 2014, at 11:59, John Yates <john.yates@sparqlcity.com> wrote:
> Coming from the world of statically typed languages I am trying figure out whether SPARQL specifies a model of type determination within expressions.  C and C++ have a set of integral promotions and a rule that - in the absence of a prototype - float gets promoted to double.  Those rules then imply the boundaries at which overflow checking occurs.
> Does SPARQL have anything analogous?  Does SPARQL acknowledge overflow?  Where would I find such notions specified?
> /john
> SPARQLcity reshapes the world of big data.
> Immediately gain knowledge from NoSQL databases.
Received on Wednesday, 29 October 2014 22:37:28 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 6 January 2015 20:15:52 UTC