semigroupoid

I understood this as a reference to US states in the midwest (maybe Texas?), not to Europe or the UK. In fact, in most of Europe an eighteen-year-old wouldn't be allowed to purchase a gun, much less carry it around.

That is not correct anymore. At least in Germany, House of Cards is indeed on Netflix.

Even if Merkel had made such a promise (which she didn't), she does not get to decide who becomes a member of the EU. The human rights situation in Turkey makes it impossible for them to join the EU.

The article introducing Paxos was first published in 1989.

For me, one of Scala's most important features is its type system, which you aren't able to get in JavaScript (I know about flow and TypeScript, but they don't even come close in terms of features).

> "if it compiles it works" I think this wasn't meant literally. I think it rather means that a program that type-checks is at least more likely to work than a dynamically typed one. I think this is far from verification.

> Haskell's claim to fame and the justification for its learning curve is verification (both formal and informal).

I think Haskell's claim to fame is being a pure language (and maybe its laziness). I don't know what languages you had in mind, but Haskell's learning curve is usually also related to people not being familiar with functional programming as a paradigm.

Sorry, but I don't really get why you are comparing Haskell and the model checkers you listed. Haskell is a programming language and is not meant to be a formal verification tool.

I recommend Wadler's very readable paper "Monads for functional programming" (http://homepages.inf.ed.ac.uk/wadler/papers/marktoberdorf/ba...) which defines exactly what Monads in the context of functional programming are and how they help with IO, State etc.

Thank you for such a great work and especially for making it available for free! For anyone interested, I can also recommend trying out Sage! There is also this free book (http://abstract.pugetsound.edu/sage-aata.html) on Abstract Algebra which includes Sage exercises. The most prominent application of number theory in computer science is probably cryptography. I can highly recommend "An Introduction to Mathematical Cryptography" by Hoffstein, Pipher and Silverman in that area.

I thought he meant France. Anyway, the correct link to the Swiss page was already posted.

EU citizens have the right to move to and work in any country within the EU. See here: http://ec.europa.eu/social/main.jsp?catId=457

The first time opening a terminal window also takes longer on my machine, but only a second or two not longer.

I use oh-my-zsh on ArchLinux with termite. Starts instantly and is as fast as stock bash. I suppose that this is mainly an OS X issue.

The definition of functor in category theory is from 1945 while most of today's mainstream programming languages are much younger than that. The people who wrote those definitions for C++, C#... simply ignored the existing terminology.

Of course compiling successfully does not imply a correct program with the desired behavior. Nobody claims that GHC is able to verify the behavioral correctness of your program and it also can't tell you if your function actually sorts a list or if it does not. However, if you claim in your definition of "sort" that it takes a list and returns a list, then GHC can verify if that is actually true. That is the power of types. They are no magic things that write correct programs for you.

On OS X the window manager is built-in and not really customizable. That's also the reason why you need extra tools on OS X to get something like i3 or xmonad.