Re:Higher-kinded bounded polymorphism in OCaml
by nerdponx on Sunday July 28, 2024 @10:02PM
(#41097428)
It's tractable in practice. That's what the Idris (2) language does, for example.
Re:Higher-kinded bounded polymorphism in OCaml
by dunham on Monday July 29, 2024 @01:36PM
(#41102159)
If anyone is interested in how this works, I've found András Kovács' "Elaboration Zoo" to be a good tutorial: https://github.com/AndrasKovacs/elaboration-zoo
It incrementally covers normalization by evaluation, bidirectional typechecking, basic pattern unification, implicit insertion (which relies on unification), and then more sophisticated variants on pattern unification.
I wonder how much this is a problem in practice, aside from the type-checker taking too long.