| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Re: RM and abstract syntax trees
paul c wrote:
> Bob Badour wrote:
>
>> paul c wrote:
>>
>> ...
>>
>>> Here's my favourite nested relation, although I admit it's probably
>>> useless in practice. It's a recursive one. Sorry I don't have much
>>> mastery of conventional syntax, what I mean here is something like R:
>>> <attribute list> where <attribute list> is a set of attribute name,
>>> attribute type pairs and typeof is swiped from C-language:
>>>
>>> R: (A typeof R)
>>>
>>> I don't know how to display a value for R but I guess it could have
>>> either no tuples or one tuple.
>>
>>
>> It could have any number of tuples. See formalism under "philosophy of
>> mathematics".
>>
>> Example values are:
>> zero tuples:
>> {}
>>
>> one tuple:
>> {{}}
>> {{{}}}
>> {{{{}}}}
>> {{{},{{}}}}
>> ...
>>
>> two tuples:
>> {{},{{}}}
>> {{{}},{{{}}}}
>> {{},{{{}}}}
>> ...
>>
>> three tuples:
>> {{},{{}},{{},{{}}}}
>> {{},{{}},{{{}}}}
>> ...
>>
>> four tuples:
>> {{},{{}},{{},{{}}},{{},{{}},{{},{{}}}}}
>> etc.
>>
>> ...
{ 0, {} }
{ 1, {} }
{ 2, {} }
{ 3, { -1, { 3, {} } } }
Received on Tue Oct 30 2007 - 19:45:11 CDT
![]() |
![]() |