Univ.UnivConstraint
type kind = AcyclicGraph.constraint_type =
| Lt
| Le
| Eq
val compare_kind : kind -> kind -> int
val pr_kind : kind -> Pp.t
type t = Level.t * kind * Level.t