Dependent-type friends: Haskell would like induction-recursion. We thought we could infer the dependencies. But it turns out our algorithm is wrong. Is this why #agda lost `mutual`? Is there any kind of proof that this inference is impossible? cc @dregntael @edwinbrady
-
-
I suppose the main problem in Haskell is its various open structures (classes, type families), where you don’t have a natural order on the definitions. (I’m sorry, I don’t know Idris, but I don’t think there is anything open like that in Agda.)
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.