Re: [Caml-list] Recursive fixed polymorphic variants

[Leo White <lpw25@cam.ac.uk>]

> let rec f = function `B x -> g x | `A -> ()
> and g = function `B x -> f x | `A -> ();;
>
> # f (M.b (M.a ()))
> - : unit = ()
>
> This gives f (and g) the inferred type ([< `A | `B of [< `A | `B of 'a
> ] ] as 'a) -> unit.
>
> I was under the impression I should be able to describe using the type
> variable syntax in function type, but I was unable to.

Note that you can use polymorphic recursion to give f a very similar
type that also works for this particular example:

  # let rec f : 'a. ([< `A | `B of ([< `A | `B of 'b ] as 'b) ] as 'a) -> unit = 
      function `B x -> f x | `A -> ();;
    val f : [< `A | `B of [< `A | `B of 'a ] as 'a ] -> unit = <fun>
  # f (M.b (M.a ()));;
  - : unit = ()

Regards,

Leo