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

[Brian Hulley]

Brian Hulley wrote:
> Anyway to get to my point, though all this sounds great, I'm
> wondering how to construct an arbitrary graph of Fudgets just from a
> fixed set of combinators, such that each Fudget (node in the graph)
> is only mentioned once in the expression. To simplify the question,
> assume we have the following data structure to describe the desired
> graph:
>    data LinkDesc a
>        = Series a a
>        | Broadcast a [a]
>        | Merge [a] a
>
>    type GraphDesc a = [LinkDesc a]

The above is more complicated than necessary. The problem can be captured 
by:

    type GraphDesc a = [(a,a)]

Brian.
-- 
http://www.metamilk.com