Haskell is very simple. Everything is composed of Functads which are themselves a Tormund of Gurmoids, usually defined over the Devons. All you have to do is stick one Devon inside a Tormund and it yields Reverse Functads (Actually Functoids) you use to generate Unbound Gurmoids.
-
-
I wish some smart person would do the work for me and say “yup, all nonsense” and then I wouldn’t have to think about it again.
-
The whole idea that formal logic saves the day, that we'll model everything as types which are propositions, smacks of not learning from history, namely the symbol grounding problems encountered in the first wave of AI and the cognitive revolution.
- 1 more reply
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.