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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
|
(************************************************************************)
(* 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: coqlib.mli,v 1.5.2.3 2005/01/21 17:14:10 herbelin Exp $ i*)
(*i*)
open Names
open Libnames
open Nametab
open Term
open Pattern
(*i*)
(*s This module collects the global references, constructions and
patterns of the standard library used in ocaml files *)
(*s Some utilities, the first argument is used for error messages.
Must be used lazyly. s*)
val gen_reference : string->string list -> string -> global_reference
val gen_constant : string->string list -> string -> constr
(* Search in several modules (not prefixed by "Coq") *)
val gen_constant_in_modules : string->string list list-> string -> constr
val arith_modules : string list list
val zarith_base_modules : string list list
val init_modules : string list list
(*s Global references *)
(* Modules *)
val logic_module : dir_path
val logic_type_module : dir_path
(* Natural numbers *)
val glob_nat : global_reference
val path_of_O : constructor
val path_of_S : constructor
val glob_O : global_reference
val glob_S : global_reference
(* Equality *)
val glob_eq : global_reference
val glob_eqT : global_reference
(*s Constructions and patterns related to Coq initial state are unknown
at compile time. Therefore, we can only provide methods to build
them at runtime. This is the purpose of the [constr delayed] and
[constr_pattern delayed] types. Objects of this time needs to be
applied to [()] to get the actual constr or pattern at runtime *)
type 'a delayed = unit -> 'a
(*s For Equality tactics *)
type coq_sigma_data = {
proj1 : constr;
proj2 : constr;
elim : constr;
intro : constr;
typ : constr }
val build_sigma_set : coq_sigma_data delayed
val build_sigma_type : coq_sigma_data delayed
type coq_leibniz_eq_data = {
eq : constr;
refl : constr;
ind : constr;
rrec : constr option;
rect : constr option;
congr: constr;
sym : constr }
val build_coq_eq_data : coq_leibniz_eq_data delayed
val build_coq_eqT_data : coq_leibniz_eq_data delayed
val build_coq_idT_data : coq_leibniz_eq_data delayed
val build_coq_eq : constr delayed (* = [(build_coq_eq_data()).eq] *)
val build_coq_f_equal2 : constr delayed
val build_coq_eqT : constr delayed
val build_coq_sym_eqT : constr delayed
(* Empty Type *)
val build_coq_EmptyT : constr delayed
(* Unit Type and its unique inhabitant *)
val build_coq_UnitT : constr delayed
val build_coq_IT : constr delayed
(* Specif *)
val build_coq_sumbool : constr delayed
(*s Connectives *)
(* The False proposition *)
val build_coq_False : constr delayed
(* The True proposition and its unique proof *)
val build_coq_True : constr delayed
val build_coq_I : constr delayed
(* Negation *)
val build_coq_not : constr delayed
(* Conjunction *)
val build_coq_and : constr delayed
(* Disjunction *)
val build_coq_or : constr delayed
(* Existential quantifier *)
val build_coq_ex : constr delayed
val coq_eq_ref : global_reference lazy_t
val coq_eqT_ref : global_reference lazy_t
val coq_idT_ref : global_reference lazy_t
val coq_existS_ref : global_reference lazy_t
val coq_existT_ref : global_reference lazy_t
val coq_not_ref : global_reference lazy_t
val coq_False_ref : global_reference lazy_t
val coq_sumbool_ref : global_reference lazy_t
val coq_sig_ref : global_reference lazy_t
|
