> -----Original Message-----
> From: Peter Hancock [mailto:[EMAIL PROTECTED]]
> Sent: 28 April 2000 10:23
> To: [EMAIL PROTECTED]
> Cc: [EMAIL PROTECTED]
> Subject: Re: doubly linked list
>
>
> >>>>> "Jan" == Jan Kort <[EMAIL PROTECTED]> writes:
>
> > Anyway, a doubly linked list could be defined like this:
>
> That was very interesting. It seems to generalise to put
> back-pointers and other context info in a variety of data
> structures. This seems a pretty performance-enhancing thing to do.
>
> It is reminiscent of Richard Bird's paper on cyclic structures.
>
> Peter
>
I quite like the idea too but the thought of updating such a structure gives
me a headache.
Saying that ... this might encourage greater use of higher order fns rather
than
explicit recursion.
