Re: deductive databases
From: Jan Hidders <jan.hidders_at_REMOVETHIS.pandora.be>
Date: Thu, 12 May 2005 22:38:21 GMT
Message-ID: <xVQge.89347$4x.5404810_at_phobos.telenet-ops.be>
Date: Thu, 12 May 2005 22:38:21 GMT
Message-ID: <xVQge.89347$4x.5404810_at_phobos.telenet-ops.be>
alex goldman wrote:
> While people who responded seem to disagree on whether SQL has recursion,
> what about functors?
>
> For example, can you express something like this with SQL?
>
> for_any X Y : car(cons(X, Y), X)
That depends on what you mean by "can express". Since SQL is a query language in which you formulate queries over tables it can only formulate queries over tables and not over functors. So in that sense the answer is "no" but that observation is about as interesting as the fact that SQL also cannot make coffee. If you reformulate it as a statement about tables by, for example, modeling car as a binary table and cons as a ternary table then you *can* express this and for that you don't even need recursion.
- Jan Hidders