blob: 668e99a01171b229d4d38878e75aed0303329cff (
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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
|
(************************************************************************)
(* v * The Coq Proof Assistant / The Coq Development Team *)
(* <O___,, * CNRS-Ecole Polytechnique-INRIA Futurs-Universite Paris Sud *)
(* \VV/ **************************************************************)
(* // * This file is distributed under the terms of the *)
(* * GNU Lesser General Public License Version 2.1 *)
(************************************************************************)
(*i $Id: univ.mli 11301 2008-08-04 19:41:18Z herbelin $ i*)
(* Universes. *)
type universe
(* The universes hierarchy: Type 0- = Prop <= Type 0 = Set <= Type 1 <= ... *)
(* Typing of universes: Type 0-, Type 0 : Type 1; Type i : Type (i+1) if i>0 *)
val type0m_univ : universe (* image of Prop in the universes hierarchy *)
val type0_univ : universe (* image of Set in the universes hierarchy *)
val type1_univ : universe (* the universe of the type of Prop/Set *)
val make_univ : Names.dir_path * int -> universe
val is_type0_univ : universe -> bool
val is_type0m_univ : universe -> bool
val is_univ_variable : universe -> bool
(* The type of a universe *)
val super : universe -> universe
(* The max of 2 universes *)
val sup : universe -> universe -> universe
(*s Graphs of universes. *)
type universes
type check_function = universes -> universe -> universe -> bool
val check_geq : check_function
val check_eq : check_function
(* The empty graph of universes *)
val initial_universes : universes
(*s Constraints. *)
module Constraint : Set.S
type constraints = Constraint.t
type constraint_function = universe -> universe -> constraints -> constraints
val enforce_geq : constraint_function
val enforce_eq : constraint_function
(*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. *)
type order_request = Lt | Le | Eq
exception UniverseInconsistency of order_request * universe * universe
val merge_constraints : constraints -> universes -> universes
(*s Support for sort-polymorphic inductive types *)
val fresh_local_univ : unit -> universe
val solve_constraints_system : universe option array -> universe array ->
universe array
val subst_large_constraint : universe -> universe -> universe -> universe
val subst_large_constraints :
(universe * universe) list -> universe -> universe
val no_upper_constraints : universe -> constraints -> bool
(*s Pretty-printing of universes. *)
val pr_uni : universe -> Pp.std_ppcmds
val pr_universes : universes -> Pp.std_ppcmds
val pr_constraints : constraints -> Pp.std_ppcmds
(*s Dumping to a file *)
val dump_universes : out_channel -> universes -> unit
val hcons1_univ : universe -> universe
|
