StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

USWill Ness
text
AboutMe
copied!<p><a href="http://en.wikipedia.org/wiki/Analysis_of_algorithms#Empirical_orders_of_growth" rel="nofollow noreferrer"> O Gℎ, <em>!</em></a></p> <p>YOUR LANGUAGE IS NOT high-level ENOUGH </p> <p><a href="http://stackoverflow.com/questions/2211990/how-to-implement-an-efficient-infinite-generator-of-prime-numbers-in-python/10733621#10733621"><code>primes =</code></a><a href="http://stackoverflow.com/questions/12559788/parallel-algorithms-for-generating-prime-numbers-possibly-using-hadoops-map-re/12563800#12563800"><code>[2..] \</code></a><a href="http://stackoverflow.com/questions/622/most-efficient-code-for-the-first-10000-prime-numbers/10302076#10302076"><code>[[p², p²+p..] | p <- primes]</code></a> </p> <p><a href="http://stackoverflow.com/questions/11234632/monads-with-join-instead-of-bind/11249714#11249714"><code>((g<=<f)=<<) = (g=<<) . (f=<<) = join . (g<$>) . join . (f<$>)</code></a></p> <p><a href="https://stackoverflow.com/questions/34545818/is-monad-bind-operator-closer-to-function-composition-chaining-or-functi/34561605#34561605"><code>(<$>) :: (a -> b) -> f a -> f b ; (<*>) :: f (a -> b) -> f a -> f b ; (=<<) :: (a -> m b) -> m a -> m b ; ($) :: (a -> b) -> a -> b</code></a> </p> <blockquote> <p>in a <strong><em>declarative</em></strong> language,<br/> <code>length(a) == 0</code> is <em>the same</em> as <code>null(a)</code>, <br/> and <code>[y | x <- [1..], y <- []]</code> is just <code>[]</code>.</p> </blockquote> <p><a href="http://stackoverflow.com/questions/34888245/alan-kays-eval-apply-einstein-moment/34910496#34910496"><code>apply (FUNARG lambda env) xs a = apply lambda xs env</code></a></p> <p><a href="http://stackoverflow.com/questions/10843563/conda-condi-conde-condu/10848902#10848902"><code>(g ~~>! h) f x = case g x of [] -> f x; (y:_) -> h y</code></a> </p> <p><a href="http://stackoverflow.com/questions/12480291/new-state-of-the-art-in-unlimited-generation-of-hamming-sequence/12482897#12482897"><code>1:foldr (\n s->fix (merge s.(n:).map (n*))) [] [2,3,5]</code></a></p> <p><a href="http://stackoverflow.com/questions/29992904/enumerate-factors-of-a-number-directly-in-ascending-order-without-sorting/29997557#29997557"><code>ordfactors = foldr g [1] . reverse . primePowers where</code></a></p> <p><a href="http://stackoverflow.com/questions/10126285/generating-integers-in-ascending-order-using-a-set-of-prime-numbers/10160054#10160054"><code>slice hi w = (c, sortBy (compare `on` fst) b) where</code></a></p> <hr> <p><a href="http://stackoverflow.com/questions/20622945/how-to-do-a-powerset-in-drracket/20623487#20623487">What's in a powerset? A set's subsets...</a></p> <hr> <p><a href="http://stackoverflow.com/questions/9050725/call-cc-implementation/9068928#9068928"><code>(define (call/cc-cps proc k) (proc k k))</code></a></p> <p><code>(define (list . xs) xs)</code></p> <hr> <p><a href="https://stackoverflow.com/questions/39438091/how-monads-are-considered-pure/39647091#39647091">How Monads are considered Pure?</a></p> <p><em><a href="https://stackoverflow.com/questions/44117197/why-does-haskells-bind-function-take-a-function-from-non-monadic-to-monadic/44118041#44118041">Monads are EDSLs</a>:</em><br> <code>do { [1,2,3] ; [4,5] } => do { x <- [1,2,3] ; do { y <- [4,5] ; return y }} => {for x in [1,2,3] : {for y in [4,5] : {yield y}}} => [4,5,4,5,4,5]</code></p>

Querying!

Guidance

An individual column

Larger individual text columns get their own page to allow for proper reading.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload