I propose a function which returns 3 if β is an int and the function parameter otherwise.

]]>“Proof. The listener interested in long and boring proofs may consult Kleene, S. “Mathematical Logic”. QED.” 🙂 ]]>

So then i:∀α(α → α) ⊢ i:α → α says: if i is a function α → α for all types α, then we can say that i could be a function α → α for any particular type α.

I remember this kind of “so simple it hurts” stuff from taking logic courses.

]]>This isn’t a complete sentence.

]]>Martin Gardner being dead too, who else will provide logic puzzles now? (No, Professor Layton does not really count.) ]]>