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

Re: Limited complexity requirement?

From: Enrico Franconi <franconi@inf.unibz.it>
Date: Thu, 15 Jul 2004 17:09:22 +0200
Message-Id: <F3E91D41-D670-11D8-B6D8-000A9575BDDE@inf.unibz.it>
To: RDF Data Access Working Group <public-rdf-dawg@w3.org>

On 15 Jul 2004, at 16:54, 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.

I agree.

Enrico Franconi                  - franconi@inf.unibz.it
Free University of Bozen-Bolzano - http://www.inf.unibz.it/~franconi/
Faculty of Computer Science      - Phone: (+39) 0471-016-120
I-39100 Bozen-Bolzano BZ, Italy  - Fax:   (+39) 0471-016-129
Received on Thursday, 15 July 2004 11:10:36 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 7 January 2015 15:00:44 UTC