[Haskell-cafe] Functional GUI combinators for arbitrary graphs of components?

Taral taralx at gmail.com
Sat Dec 2 02:34:16 EST 2006

On 12/1/06, Brian Hulley <brianh at metamilk.com> wrote:
> This problem is so general (ie converting a cyclic graph into an expression
> tree such that each node appears no more than once) that I'm sure someone
> somewhere must already have determined whether or not there can be a
> solution, though I don't know where to look or what to search for.

I suggest you check the Functional Graph Library (FGL). It's shipped
as part of GHC.

Taral <taralx at gmail.com>
"You can't prove anything."
    -- Gödel's Incompetence Theorem

More information about the Haskell-Cafe mailing list