Doing music is a hard low level problem, a concurrency problem and is also an
interesting problem for intelligent and behavioural computation.
If it's true that Haskell can do its best on the second and third aspect, the
undertaking seems to wrap with foreing interface one of the many good C
li
Sara,
I've used extensively HaXml and the tool DtdToHaskell to do xml processing.
HaXml marshalls/demarshalls xml data and DtdToHaskell creates the "data"
statements to handle xml in haskell fashion.
I learnt how to write a palatable DTD for the delicate DtdToHaskell, but in
your case I guess y
Yeah! I've been struggling on concatMap for a noon and now here is the solution
I've been unable to find.
Thank you very much
Enrico
> -Messaggio originale-
> Da: J. Garrett Morris [mailto:[EMAIL PROTECTED]
> Inviato: lunedì 19 settembre 2005 15.26
> A: Santoemm
Hello,
I can't find the right recursive function to get a list of all the possible
paths of a multi-way tree like this:
data Tree= Node String [Tree]
root = Node "root" [x, y]
x= Node "x"[x1, x2]
x1 = Node "x1" []
x2 = Node "x2" [x21, x22]
x21 = Node "x21" []
Hello,
is there any group or person working on this topic in Haskell?
I'm massaging some code for an autonomous agent, and I'd like to share ideas.
Enrico
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/h