blob: 2460ff15e825f8761b97536b7d00046aa37a5e2a (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
|
(*i $Id$ i*)
(*i*)
open Names
(*i*)
(* Universes. *)
type universe
val dummy_univ : universe
val implicit_univ : universe
val prop_univ : universe
val prop_univ_univ : universe
val prop_univ_univ_univ : universe
val set_module : dir_path -> unit
val new_univ : unit -> universe
(*s Graphs of universes. *)
type universes
val initial_universes : universes
(*s Constraints. *)
type constraint_type = Gt | Geq | Eq
type univ_constraint = universe * constraint_type * universe
module Constraint : Set.S with type elt = univ_constraint
type constraints = Constraint.t
type constraint_function = universe -> universe -> constraints -> constraints
val enforce_gt : constraint_function
val enforce_geq : constraint_function
val enforce_eq : constraint_function
val super : universe -> universe * constraints
val super_super : universe -> universe * universe * constraints
val sup : universe -> universe -> universes -> universe * constraints
(*s Merge of constraints in a universes graph.
The function [merge_constraints] merges a set of constraints in a given
universes graph. It raises the exception [UniverseInconsistency] if the
constraints are not satisfiable. *)
exception UniverseInconsistency
val merge_constraints : constraints -> universes -> universes
(*s Pretty-printing of universes. *)
val pr_uni : universe -> Pp.std_ppcmds
val pr_universes : universes -> Pp.std_ppcmds
|