2006/3/15, Duncan Coutts <[EMAIL PROTECTED]>:
> On Wed, 2006-03-15 at 17:21 +0100, Sebastian Sylvan wrote:
> > On 3/15/06, minh thu <[EMAIL PROTECTED]> wrote:
> > > hi everybody,
> > >
> > > i have to implement some data structure which is usually implemented
> > > with pointers in imperative langu
On Wed, 2006-03-15 at 17:21 +0100, Sebastian Sylvan wrote:
> On 3/15/06, minh thu <[EMAIL PROTECTED]> wrote:
> > hi everybody,
> >
> > i have to implement some data structure which is usually implemented
> > with pointers in imperative languages (can think of it as a double
> > linked list).
> >
>
You could check out the data structures in Edison, a library of myriad
functional data structures. It may already have implemented a sequence
data structure with the desired features:
http://www.eecs.tufts.edu/~rdocki01/docs/edison/index.html
homepage:
http://www.eecs.tufts.edu/~rdocki01/ediso
On 3/15/06, Sebastian Sylvan <[EMAIL PROTECTED]> wrote:
> On 3/15/06, minh thu <[EMAIL PROTECTED]> wrote:
> > hi everybody,
> >
> > i have to implement some data structure which is usually implemented
> > with pointers in imperative languages (can think of it as a double
> > linked list).
> >
> > i
On 3/15/06, minh thu <[EMAIL PROTECTED]> wrote:
> hi everybody,
>
> i have to implement some data structure which is usually implemented
> with pointers in imperative languages (can think of it as a double
> linked list).
>
> i'd like to know how i have to do that.
>
> is there any standard way of
hi everybody,
i have to implement some data structure which is usually implemented
with pointers in imperative languages (can think of it as a double
linked list).
i'd like to know how i have to do that.
is there any standard way of converting pointer-based data structure
into an inductively-def
