On Saturday 08 July 2006 12:25 pm, David Roundy wrote:
> Hi all,
>
> I'm wanting to create a data structure to hold a directed acyclic
> graph (which will have patches represented by edges), and haven't yet
> been able to figure out a nice representation. I'd like one that can
> be reasoned with r
David Roundy wrote:
Hi all,
I'm wanting to create a data structure to hold a directed acyclic
graph (which will have patches represented by edges), and haven't yet
been able to figure out a nice representation. I'd like one that can
be reasoned with recursively, or as closely to recursively as
On 7/8/06, David Roundy <[EMAIL PROTECTED]> wrote:
Hi all,
I'm wanting to create a data structure to hold a directed acyclic
graph (which will have patches represented by edges), and haven't yet
been able to figure out a nice representation. I'd like one that can
be reasoned with recursively, o
Hi all,
I'm wanting to create a data structure to hold a directed acyclic
graph (which will have patches represented by edges), and haven't yet
been able to figure out a nice representation. I'd like one that can
be reasoned with recursively, or as closely to recursively as
possible. The problem
On 7/5/06, John Goerzen <[EMAIL PROTECTED]> wrote:
On 2006-07-05, Duncan Coutts <[EMAIL PROTECTED]> wrote:
> evaluate is for just that purpose.
>
> evaluate (length input)
>
>
> from the docs:
>
>
http://haskell.org/ghc/docs/latest/html/libraries/base/Control-Exception.html#v%3Aevaluate
That lo
