News for hackers. Stuff that matters.
Re:Higher-kinded bounded polymorphism in OCaml by munchler on Monday July 29, 2024 @10:14AM (#41100637)
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?
Re:Higher-kinded bounded polymorphism in OCaml by octachron on Monday July 29, 2024 @10:25AM (#41100726)
The variable "x" would be a list in this case. This the GADT (Generalized Abstract Data Types) syntax, where the type of the whole union can depend on the discriminated union case. Thus

      List_name: 'a list -> ('a, list_name) app
reads: for any value "x" of type "'a list", "List_name x" constructs a value of type "('a, list_name) app". In this case, it is the the "list_name" tag part of the type which is dependent on the union case.
Re:Higher-kinded bounded polymorphism in OCaml by munchler on Monday July 29, 2024 @10:28AM (#41100752)
Thank you, that makes sense. Sadly, F# doesn't support GADT's yet.
Re:Higher-kinded bounded polymorphism in OCaml by Neynt on Monday July 29, 2024 @10:26AM (#41100729)
x is a list. This is OCaml’s GADT syntax: https://dev.realworldocaml.org/gadts.html