Re: Requirements for update languages?
Date: 14 Nov 2002 10:22:36 +0100
Mikito Harakiri wrote:
>However, not everything is perfect in the relation world. The next
>exercise would be trying defining aggregate in the *pure* relational
>terms. A recent posting shows how unnatural defining simple
>ariphmetics facts in the relational terms is:
Actually I think Paul was more asking the question whether everything can be done in pure FOL (or HOL, higher-order logics), and frankly I think the answer is yes. It is correct that doing aggregation is not trivial but also not mind-bogglingly difficult either, although it's a lot easier in HOL than in FOL.
- Jan Hidders