Higher-kinded bounded polymorphism in OCaml (2021)

by tinyspacewizardon 7/28/2024, 9:40:47 PM with 4 comments
  • by skulkon 7/29/2024, 1:09:30 AM

    > Thus, with type aliases, the type equality problem becomes the higher-order unification problem, which is not decidable.

    I wonder how much this is a problem in practice, aside from the type-checker taking too long.

  • by munchleron 7/29/2024, 2:14:49 PM

    I'm more familiar with F#, so I got stuck at this line:

        type ('a,'b) app += List_name : 'a list -> ('a,list_name) app
    I understand that app is an extensible type and this line adds a union case called List_name to the type, but the signature of List_name confuses me. If I write (List_name x) is x a list or a function?

  • by tempodoxon 7/30/2024, 5:03:45 PM

    This article is pure gold. Rarely is this stuff explained so well.

  • by buzzin__on 7/29/2024, 12:45:23 AM

    [flagged]