Viewing profile — sgreben

Purely mechanically. Just writing down the problem statement we get: \exists f,g: \forall a,b: (f(b)=a) | (g(a)=b) where f,g are the guesses and a,b are the flips. Each guess is a …

I'm not proposing this as a solution to the expression problem (which has actual solutions, as noted in the other comments [0] and elsewhere [1]). It is, however, an extremely simp…

Sum types + exhaustiveness checking already do this, right? For this example: type animal = Cat | Dog type action = Sound | Eat | Attack let cat_sound () = printf "meow" let cat_at…