[Haskell-cafe] Fair diagonals
Martijn van Steenbergen
martijn at van.steenbergen.nl
Fri Nov 6 05:31:01 EST 2009
Luke Palmer wrote:
> On Fri, Nov 6, 2009 at 3:06 AM, Martijn van Steenbergen
> <martijn at van.steenbergen.nl> wrote:
>> "(...) Likewise, a breadth-first search of a data structure can fall short
>> if it has an infinitely branching node. Omega addresses this problem by
>> using a "diagonal" traversal that gracefully dissolves such data."
>> However, I can't verify this:
>>> runOmega . mapM each $ map (:) [1..]
>>> *** Exception: stack overflow
>> Or maybe I misunderstood Omega's documentation.
> You are asking for the impossible.
Oh, and I realise now that this has been mentioned two times before
already in this thread. *hangs head in shame*
Are there examples of infinitely branching nodes where it is possible to
give some output? Otherwise I'm not sure what the documentation is saying.
More information about the Haskell-Cafe