@EyalL It seems to be quite fundamental to me. The concept X is usable if "not X" is also demonstrable. Is it any other way?
-
-
@dibblego why false? Haskell has semi dependent fp with vals/kinds/sorts. Agda has full dependent types without hard coded "levels" -
@EyalL Everything you just said is true, and completely unrelated to the functional programming thesis. - Show replies
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.