This gets to the heart of the problem for all type systems supporting deduction. Haskell is slightly better, but at a certain level of abstraction a function type can’t be separated from its implementation. https://brevzin.github.io/c++/2018/10/20/concepts-declarations/ …
-
-
My view after 20 years of floundering on type systems is that type deduction is as hopelessly unscalable as automated theorem proving, and that a language should expose functional logic constructs so programmers can write constraints naturally.
Show this threadThanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
To my understanding Haskell can *slowly* deduce from the *right* as well of the *left* side of an expression. Whereas C++ can only infer from the *right*. I am not entirely sure if referential transparency is a requirement for this or are there any other ways?
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
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.