icen

16 ms·

121.
by icen 10y ago
There are a million monad tutorials for Haskell (and, with respect to their use in Haskell, it's probably better to learn them from there). I think that a good one is "You Could Have Invented Monads!". This[1] is a good paper
122.
by icen 10y ago
You'd get pretty far just by whitelisting arxiv, .edu, .ac.uk, etc.
123.
by icen 10y ago
In Idris, there are functions `believe_me` and `really_believe_me`, which assert things to the compiler. They're generally only used for FFI code, or for extremely tedious proofs. If you wanted to prove that a list was sorted, you&#x27
124.
by icen 10y ago
Nothing; it would return a partially applied function that waits for a proof that `x < y` before continuing. (Trying to use that function as an integer would be a type error). The key here is that `add` is not a function `Nat -> Nat
125.
by icen 10y ago
You can just write something like foo x = case x of pattern1 -> ...
126.
by icen 10y ago
An expressive and ergonomic type system goes a very long way into codifying that intent. For example, it's quite obvious what the intent of this Idris function is: `f : Vect n (Vect m a) -> Vect m (Vect n a)` (where `Vect` is the ty
127.
by icen 10y ago
Here is RMS' piece on nonfree javascript: https://www.gnu.org/philosophy/javascript-trap
128.
by icen 10y ago
For a western analogue, try the BBC's spaghetti plantations.
129.
by icen 10y ago
It's not like that first factorial function is actually any worse than the usual Haskell one: fac = \n -> product [1..n] The recursive one is also much the same as a Haskell one, but Q is hardly built around idiomatic recur
130.
by icen 10y ago
This[1] would be the one, right? http://kparc.com/q4/readme.txt
131.
by icen 10y ago
You should add Screencheat to your list. Amazing fun.
132.
by icen 10y ago
I use `!rustn` because it's more convenient than actually loading my local copy of the rust documentation.
133.
by icen 10y ago
The same reason you have pensions now, despite guaranteed state pensions. Whilst $10K is probably liveable, in some places, if you own a house, it's likely not going to be terribly comfortable.
134.
by icen 11y ago
It just means to bind a variable: let x : u32 = 0; In Haskell, it's used for temporary definitions, or pure definitions in do blocks: let f = \x -> x + 1 in f 2
135.
by icen 11y ago
When you go to vote, are you only ever concerned about the mechanical action to place a cross in a box? There's quite a lot more to politics, and politics in democracy, than just the act of voting.
136.
by icen 11y ago
Munkres is very good. If you're after algebraic topology, Hatcher is also good (and freely available online).