kaveh.shahbazian:
Will Haskell become another pet for Microsoft?
No. This question doesn't even make sense.
are many issues around licensing GHC as you'v seen in this mailing
list and I think Haskell already HAS some big problems that prevent
others to use it confidently.)
Haskell is in
Thanks Don
I sense the truth in your words. But I expect a more technical view of
point. I need it for presenting to other peoples i.e. to whom wanted
fom me an overview of Haskell/Using It/Licensing/Libraries/Communities
to be provided (BOSS!).
___
kaveh.shahbazian:
Thanks Don
I sense the truth in your words. But I expect a more technical view of
point. I need it for presenting to other peoples i.e. to whom wanted
fom me an overview of Haskell/Using It/Licensing/Libraries/Communities
to be provided (BOSS!).
Ok.
Overview,
Ross Paterson wrote:
How embarrassing. Still, your code is quite subtle. As penance, here's
my explanation, separating the main idea from the knot-tying.
The ingredients are a map type with an insertion function
[...]
insert :: Ord k = k - a - Map k a - Map k a
with a partial
On Sep 13, 2006, at 3:37 AM, Einar Karttunen wrote:
Hello
Is there an elegant way of traversing a directed graph in STM?
type Node nt et = TVar (NodeT nt et)
type Edge et= TVar et
data NodeT nt et = NodeT nt [(Node nt et, Edge et)]
type MyGraph = Node String Int
When implementing a
On Thu, Sep 14, 2006 at 07:51:59PM +0200, Bertram Felgenhauer wrote:
It's a result of thinking about lazy evaluation, and
especially lazy patterns (and let bindings) for some time. A wiki article
that helped me a lot to understand these is
http://www.haskell.org/hawiki/TyingTheKnot
I'd
On 9/17/06, Jan-Willem Maessen [EMAIL PROTECTED] wrote:
On Sep 13, 2006, at 3:37 AM, Einar Karttunen wrote:
Hello
Is there an elegant way of traversing a directed graph in STM?
type Node nt et = TVar (NodeT nt et)
type Edge et= TVar et
data NodeT nt et = NodeT nt [(Node nt et,
ross:
On Thu, Sep 14, 2006 at 07:51:59PM +0200, Bertram Felgenhauer wrote:
It's a result of thinking about lazy evaluation, and
especially lazy patterns (and let bindings) for some time. A wiki article
that helped me a lot to understand these is
