Name:
Anonymous
2013-03-09 21:42
I am very sad and angered by your subtle assumption of Haskell being a toy language.
Apologise or forward an argument.
Name:
Anonymous
2013-03-09 22:01
Damn, Shor's algorithm is slow.
Name:
Anonymous
2013-03-09 22:20
>>2
Pardon me, Haskell is a broken toy language.
Name:
Anonymous
2013-03-09 22:25
>>2
"Toy languages" is used in the same way Cudder uses "toy CPUs" in contrast to x86. Haskell can do things that toy languages can't.
Name:
Anonymous
2013-03-09 22:26
>>5
user of an unnecessarily convoluted and statically-typed language
Name:
Anonymous
2013-03-09 22:27
>>7
Haskell for theoretical work.
C for practical work.
And lisp for laughing at how fucking shitty it is.
Name:
Anonymous
2013-03-09 22:31
>>8
You have insulted a language I very much like!
Name:
Anonymous
2013-03-09 23:12
Prelude QIO.Qio QIO.Shor> mapM_ (\n -> do { p <- eval $ factor n; print (n, p) }) [2..6]
(2,(2,2))
(3,(1,3))
(4,(2,2))
(5,(1,1))
(6,(2,2))
(4.81 secs, 4823486476 bytes)
Prelude Control.Monad Math.Seive.Factor> mapM_ (print . ap (,) (factor $ sieve 6)) [2..6]
(2,[(2,1)])
(3,[(3,1)])
(4,[(2,2)])
(5,[(5,1)])
(6,[(2,1),(3,1)])
(0.02 secs, 1566240 bytes)
Prelude Control.Monad Tools> mapM_ (print . ap (,) factor) [2..6]
(2,[2])
(3,[3])
(4,[2,2])
(5,[5])
(6,[3,2])
(0.00 secs, 1040032 bytes)
Name:
Anonymous
2013-03-09 23:57
Y'know guise, there are some real people who do real work with this stuff.
...it's all NSA spook crap, but it's real work.
Name:
Anonymous
2013-03-10 0:46
spook? that means nigger you know
Name:
Anonymous
2013-03-10 10:31
It's unfortunate Haskell is so prone to dependency hell.
Name:
Anonymous
2013-03-10 14:16
>>18
simply fix the mtl and base during build to a reasonable value with -constraint and there is no problem anymore.
Name:
Anonymous
2013-03-10 19:03