Taral wrote:
On 12/1/06, Brian Hulley [EMAIL PROTECTED] 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,
Hi,
I've been looking at the Fudgets research
(http://www.cs.chalmers.se/ComputingScience/Research/Functional/Fudgets/ )
as an example of a purely functional gui.
Afaiu a brief summary is that a Fudget can represent a GUI widget or some
other object, which can have some internal state, and
On 12/1/06, Brian Hulley [EMAIL PROTECTED] 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
