Re: [Caml-list] Not a variant??

[Jacques Garrigue <garrigue@math.nagoya-u.ac.jp>]

From: Jacques Carette <carette@mcmaster.ca>

> The function f1 below works fine -- so type d is seen to be a variant type.
> However, f2 does not compile because type c is *not* a variant type. 
> 
> However, if one looks at O'Caml's output for type c, it visually looks 
> like a variant, while that of d does not.  This is highly confusing.
> 
> This looks like a bug to me -- both c and d should be recognized as 
> variant types.
> 
> Jacques
> 
> type a = [`A ]
> type b = [`B ]
> type 'a c = 'a
>     constraint 'a = [< a | b]
>     ;;

The message is maybe not clear enough: for pattern-matching and
inheritance, you need an "exact" variant type, i.e. a type whose lower
and upper bounds are identical. This is clearly not the case for
c. The standard workaround is to write:

type c0 = [a | b]
type 'a c = 'a constraint 'a = [< c0]

Jacques Garrigue