*Top picks:*
Jasper Van der Jeugt <http://jaspervdj.be/posts/2015-02-24-lru-cache.html>
shows how you can write an intuitive, obviously correct LRU cache perfectly
polymorphic in both the key and value types of the cache lookup
function. (Reddit

Core is broken! Well, no, ticket 9858
<https://ghc.haskell.org/trac/ghc/ticket/9858> reported previously is still
open, and it's about translating an exotic species of Haskell into Core.
But Javran Cheng <https://ghc.haskell.org/trac/ghc/ticket/10121> found out
that the documented specification of Core's operational semantics is

Neil Mitchell
removes the error-prone wart of withSocketsDo
in Windows network programming. Moving in for the kill is the triple combo
of evaluate, NOINLINE, and unsafePerformIO. (Reddit discussion.)

Can you write a sorting algorithm? Can you write a fancy sorting algorithm?
Can you write a sorting algorithm so fancy it hides a subtle bug? Can you
write a sorting algorithm so fancy that it hides a bug so subtle
that it evades even QuickCheck because the smallest testcase is 2^49 big?
But the good news is that QuickCheck doesn't see any regression in the
bugfix. (Hacker News discussion.)

The consequence of misspelling pragmas
<https://ghc.haskell.org/trac/ghc/ticket/10106>, Or: when stumped on a
compile error, turn on -Werror to see if you aren't missing something

*Quote of the week:*garry__cairns
<https://twitter.com/garry__cairns/status/571087073739976704>: The trouble
with learning #haskell is the more I expose myself to it the more I dislike
what I have to work with to pay the bills.

*Repo of the week: *Kalium <https://github.com/int-index/kalium>: Turn
Pascal <https://int-index.github.io/kalium/examples.html> into Haskell

-- Kim-Ee
Haskell mailing list

Reply via email to