Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
g__
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
15 ms
·
1.
▲
by
g__
15y ago
Functor typeclass in Haskell models category-theoretic endofunctor rather well.
2.
▲
by
g__
16y ago
DON'T start functional programming with monads. Familiarize with currying, pattern matching, how to create data types in Haskell, using recursion instead of loops, higher order functions, list comprehensions, type classes, polymorphism in H
3.
▲
by
g__
16y ago
What does the following mean, on http://www.google.cn/landing/cnexp/indexd.html ? 我们已移至 google.com.hk 请收藏我们的新网址
4.
▲
by
g__
16y ago
GHC 6.6 is almost 4 years old, please upgrade. ( http://hackage.haskell.org/platform/ )
5.
▲
by
g__
16y ago
And it's extremely fast: $ pv /dev/zero > /dev/null 18.6GB 0:00:05 [3.76GB/s] [ <=> ]
6.
▲
Wikileaks is back
(wikileaks.org)
2 points
by
g__
16y ago
|
0 comments
7.
▲
by
g__
16y ago
Iterators sometimes require restructuring, as in http://www.chiark.greenend.org.uk/~sgtatham/coroutines.html In Haskell they don't - you might write this "producer-consumer" composing a function that produces a stream with a function that
8.
▲
by
g__
16y ago
Under assumption P=NP, a polynomial algorithm is already known (!): http://en.wikipedia.org/wiki/P_%3D_NP_problem#Polynomial-tim... The problem is: will humanity find a feasible algorithm?
9.
▲
Online math videos
(mathoverflow.net)
1 points
by
g__
17y ago
|
0 comments
10.
▲
by
g__
17y ago
I have mixed feelings. http://stackoverflow.com/questions/184118/what-programming-b... http://www.amazon.com/review/R1W0YZZWT53Y9M/ref=cm_cr_rdp_pe...
11.
▲
by
g__
17y ago
You'd have to determine if a program halts. Unless you restrict to non-Turing-complete language, this is undecidable.
12.
▲
by
g__
17y ago
This answer is also correct in another way :) http://threesixty360.wordpress.com/2008/04/30/1-2-4-8-what-c...
13.
▲
by
g__
17y ago
I Was also an Illegal E-Mail Spammer for 5 Years. I got Caught. AMA http://www.reddit.com/r/IAmA/comments/9ebku/
14.
▲
by
g__
17y ago
Simple version of B-T in 1D: http://www.math.ucla.edu/~tao/resource/general/121.1.00s/tar...
15.
▲
by
g__
17y ago
and $ map can be shortened to all in many places. I'd use pointless style more: row = (!!) The function valid has a lot of repetition, maybe the repeating part can be abstracted of? Instead of length possible > 0, you can use not $ null
16.
▲
Puzzles
(wiki.xkcd.com)
3 points
by
g__
17y ago
|
0 comments
17.
▲
by
g__
17y ago
Another nice collection: http://www.reddit.com/r/programming/comments/9220o/ask_progg...
18.
▲
by
g__
17y ago
http://news.ycombinator.com/item?id=825589