Re:When Haskell Is Not faster than C
by pohl on Tuesday January 22, 2013 @05:56AM
(#5096519)
I'm not sure I follow you. Is the pattern-matching in Haskell somehow not 'core' enough? Both qsort examples linked in this thread use pattern matching.
[ Parent
| on HN ]
Re:When Haskell Is Not faster than C
by dschiptsov on Tuesday January 22, 2013 @12:58PM
(#5098495)
All I'm trying to say that Erlang syntax is much more intuitive and readable, being derived from Prolog.
I honestly can't see why should I use Haskell (except for being so clever) when I have Erlang, or at least one real advantage.
well, let's look.
map f (h:t) = f h:map f t
map f [] = []
member x (h:t) = x == h || member x t
member _ [] = False
I think the only difference is that you can't match for equality directly in the pattern.