Re: Storing data and code in a Db with LISP-like interface

From: x <x_at_not-exists.org>
Date: Mon, 8 May 2006 15:07:49 +0300
Message-ID: <e3nj3n$5j0$2_at_emma.aioe.org>


"Dmitry A. Kazakov" <mailbox_at_dmitry-kazakov.de> wrote in message news:1dgwbbeaif4m$.1819jq8lq2tsj.dlg_at_40tude.net...
> On 5 May 2006 04:18:44 -0700, vc wrote:
>
> > Dmitry A. Kazakov wrote:
> > [...]
> >>But ADTs have far less problems with set theory as the application
> >> domain than RM. Trivial examples are:
> >>
> >> 1. Power set operation
> >> 2. Set complement in an infinite universal set
> >> 3. Infinite sets modeled by finite classes of equivalences
> >
> > The paragraph above does make any obvious sense. Could you elaborate ?
>
> Above are set operations. Take SQL, and create power set of a table
column,
> row, table, set of tables. Can you create Z in RM? Use the standard
> procedure to create first 100 naturals:

T ( C )



1
2
3

R=(select C from T union select Null as C from dummy) S=R x R x R x ....x R x .... :-) Received on Mon May 08 2006 - 14:07:49 CEST

Original text of this message