[mercury-users] Interesting Challenge

[Peter Ross]

On Mon, Sep 18, 2000 at 08:29:58AM -0700, Ralph Becket wrote:
> If you're having a slow afternoon, you might like to look at
> Chris Okasaki's breadth-first tree numbering problem, described
> in "Breadth First Numbering..." at
> http://www.cs.columbia.edu/~cdo/papers.html
> 
> There seem to be three main approaches; curiously, I came up 
> with the one employed by the Haskell programmers, but they
> were exploiting laziness.  I'd be interested to see (a) what
> solutions other people come up with (without peeking first)
> and (b) whether Mercury programmers also show the same bias
> as the functional programmers (read the paper - it's only a
> few pages long).
> 
Without giving anything away, my first inclination was to go with the
solution as presented by Osaki, as that is how I think about traversing
a tree breadth first.

Pete
--------------------------------------------------------------------------
mercury-users mailing list
post:  mercury-users at cs.mu.oz.au
administrative address: owner-mercury-users at cs.mu.oz.au
unsubscribe: Address: mercury-users-request at cs.mu.oz.au Message: unsubscribe
subscribe:   Address: mercury-users-request at cs.mu.oz.au Message: subscribe
--------------------------------------------------------------------------