W3C home > Mailing lists > Public > public-rdf-dawg@w3.org > July to September 2004

Re: Limited complexity requirement?

From: Steve Harris <S.W.Harris@ecs.soton.ac.uk>
Date: Thu, 15 Jul 2004 16:03:12 +0100
To: public-rdf-dawg@w3.org
Message-ID: <20040715150311.GE2544@login.ecs.soton.ac.uk>

On Thu, Jul 15, 2004 at 07:54:29 -0700, Dan Connolly wrote:
> 
> While thinking about xquery-based designs, I realized I have been 
> assuming the following requirement. What do other folks think?
> 
> 3.X Limited complexity
> 
> Less expressive languages are easier to implement, deploy, secure, and 
> optimize (cf the Principle of Least Poser in an essay on design 
> principles for the Web[1]). Since a large and interesting class of 
> applications can be addressed with query languages that are less 
> expressive than programming languages, this design should not involve a 
> turning-complete query evaluator. The halting problem must not be 
> expressible in this query language design.

Seems good to me.

- Steve
Received on Thursday, 15 July 2004 11:05:22 GMT

This archive was generated by hypermail 2.3.1 : Tuesday, 26 March 2013 16:15:20 GMT