John Porter wrote:
>
> we should also support recursive data structures,
> as in some functional languages. E.g. (pseudocode):
>
> define foo as {
> short a;
> foo b; # exists at first only "in potential".
> long c;
> };
>
how deep would it go? C allows you to have
struct foo {
short a;
foo *b;
long c;
};
because all pointers are the same size. I suppose these functional
languages hide the implementation, allowing vivication and automatic
dereferencing of the enclosed type as needed, transparently to the
programmer.
--
David Nicol 816.235.1187 [EMAIL PROTECTED]
Yum, sidewalk eggs!
