author | wenzelm |
Sun, 12 Nov 2000 14:49:37 +0100 | |
changeset 10458 | df4e182c0fcd |
parent 10384 | a499b9ce2ffe |
child 10693 | 9e4a0e84d0d6 |
permissions | -rw-r--r-- |
923 | 1 |
(* Title: HOL/hologic.ML |
2 |
ID: $Id$ |
|
3 |
Author: Lawrence C Paulson and Markus Wenzel |
|
4 |
||
5 |
Abstract syntax operations for HOL. |
|
6 |
*) |
|
7 |
||
8 |
signature HOLOGIC = |
|
9 |
sig |
|
10 |
val termC: class |
|
11 |
val termS: sort |
|
8100 | 12 |
val termT: typ |
8275 | 13 |
val boolN: string |
923 | 14 |
val boolT: typ |
7073 | 15 |
val false_const: term |
16 |
val true_const: term |
|
9856 | 17 |
val not_const: term |
923 | 18 |
val mk_setT: typ -> typ |
19 |
val dest_setT: typ -> typ |
|
20 |
val mk_Trueprop: term -> term |
|
21 |
val dest_Trueprop: term -> term |
|
22 |
val conj: term |
|
23 |
val disj: term |
|
24 |
val imp: term |
|
8429 | 25 |
val Not: term |
7690 | 26 |
val mk_conj: term * term -> term |
27 |
val mk_disj: term * term -> term |
|
28 |
val mk_imp: term * term -> term |
|
4571 | 29 |
val dest_imp: term -> term * term |
8302 | 30 |
val dest_conj: term -> term list |
923 | 31 |
val eq_const: typ -> term |
32 |
val all_const: typ -> term |
|
33 |
val exists_const: typ -> term |
|
34 |
val Collect_const: typ -> term |
|
35 |
val mk_eq: term * term -> term |
|
6031 | 36 |
val dest_eq: term -> term * term |
923 | 37 |
val mk_all: string * typ * term -> term |
38 |
val mk_exists: string * typ * term -> term |
|
39 |
val mk_Collect: string * typ * term -> term |
|
40 |
val mk_mem: term * term -> term |
|
6380 | 41 |
val dest_mem: term -> term * term |
2510 | 42 |
val mk_binop: string -> term * term -> term |
43 |
val mk_binrel: string -> term * term -> term |
|
44 |
val dest_bin: string -> typ -> term -> term * term |
|
4571 | 45 |
val unitT: typ |
9362 | 46 |
val is_unitT: typ -> bool |
4571 | 47 |
val unit: term |
48 |
val is_unit: term -> bool |
|
49 |
val mk_prodT: typ * typ -> typ |
|
50 |
val dest_prodT: typ -> typ * typ |
|
51 |
val mk_prod: term * term -> term |
|
52 |
val dest_prod: term -> term * term |
|
53 |
val mk_fst: term -> term |
|
54 |
val mk_snd: term -> term |
|
5096
84b00be693b4
Moved most of the Prod_Syntax - stuff to HOLogic.
berghofe
parents:
4571
diff
changeset
|
55 |
val prodT_factors: typ -> typ list |
84b00be693b4
Moved most of the Prod_Syntax - stuff to HOLogic.
berghofe
parents:
4571
diff
changeset
|
56 |
val split_const: typ * typ * typ -> term |
84b00be693b4
Moved most of the Prod_Syntax - stuff to HOLogic.
berghofe
parents:
4571
diff
changeset
|
57 |
val mk_tuple: typ -> term list -> term |
5207 | 58 |
val natT: typ |
59 |
val zero: term |
|
60 |
val is_zero: term -> bool |
|
61 |
val mk_Suc: term -> term |
|
62 |
val dest_Suc: term -> term |
|
63 |
val mk_nat: int -> term |
|
64 |
val dest_nat: term -> int |
|
7073 | 65 |
val intT: typ |
7163 | 66 |
val realT: typ |
7073 | 67 |
val binT: typ |
68 |
val pls_const: term |
|
69 |
val min_const: term |
|
70 |
val bit_const: term |
|
8768 | 71 |
val number_of_const: typ -> term |
7548
9e29a3af64ab
ROOT: Integ/bin_simprocs.ML now loaded in Integ/Bin.ML
nipkow
parents:
7163
diff
changeset
|
72 |
val int_of: int list -> int |
9e29a3af64ab
ROOT: Integ/bin_simprocs.ML now loaded in Integ/Bin.ML
nipkow
parents:
7163
diff
changeset
|
73 |
val dest_binum: term -> int |
923 | 74 |
end; |
75 |
||
2510 | 76 |
|
923 | 77 |
structure HOLogic: HOLOGIC = |
78 |
struct |
|
79 |
||
2510 | 80 |
(* basics *) |
923 | 81 |
|
82 |
val termC: class = "term"; |
|
83 |
val termS: sort = [termC]; |
|
8100 | 84 |
val termT = TypeInfer.anyT termS; |
923 | 85 |
|
86 |
||
2510 | 87 |
(* bool and set *) |
923 | 88 |
|
8275 | 89 |
val boolN = "bool"; |
90 |
val boolT = Type (boolN, []); |
|
923 | 91 |
|
9856 | 92 |
val true_const = Const ("True", boolT); |
93 |
val false_const = Const ("False", boolT); |
|
94 |
val not_const = Const ("Not", boolT --> boolT); |
|
7073 | 95 |
|
923 | 96 |
fun mk_setT T = Type ("set", [T]); |
97 |
||
98 |
fun dest_setT (Type ("set", [T])) = T |
|
3794 | 99 |
| dest_setT T = raise TYPE ("dest_setT: set type expected", [T], []); |
923 | 100 |
|
8275 | 101 |
|
7073 | 102 |
(* logic *) |
923 | 103 |
|
104 |
val Trueprop = Const ("Trueprop", boolT --> propT); |
|
105 |
||
106 |
fun mk_Trueprop P = Trueprop $ P; |
|
107 |
||
108 |
fun dest_Trueprop (Const ("Trueprop", _) $ P) = P |
|
3794 | 109 |
| dest_Trueprop t = raise TERM ("dest_Trueprop", [t]); |
923 | 110 |
|
111 |
||
112 |
val conj = Const ("op &", [boolT, boolT] ---> boolT) |
|
113 |
and disj = Const ("op |", [boolT, boolT] ---> boolT) |
|
8429 | 114 |
and imp = Const ("op -->", [boolT, boolT] ---> boolT) |
115 |
and Not = Const ("Not", boolT --> boolT); |
|
923 | 116 |
|
7690 | 117 |
fun mk_conj (t1, t2) = conj $ t1 $ t2 |
118 |
and mk_disj (t1, t2) = disj $ t1 $ t2 |
|
119 |
and mk_imp (t1, t2) = imp $ t1 $ t2; |
|
120 |
||
4466
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4294
diff
changeset
|
121 |
fun dest_imp (Const("op -->",_) $ A $ B) = (A, B) |
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4294
diff
changeset
|
122 |
| dest_imp t = raise TERM ("dest_imp", [t]); |
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4294
diff
changeset
|
123 |
|
8302 | 124 |
fun dest_conj (Const ("op &", _) $ t $ t') = t :: dest_conj t' |
125 |
| dest_conj t = [t]; |
|
126 |
||
923 | 127 |
fun eq_const T = Const ("op =", [T, T] ---> boolT); |
128 |
fun mk_eq (t, u) = eq_const (fastype_of t) $ t $ u; |
|
129 |
||
6031 | 130 |
fun dest_eq (Const ("op =", _) $ lhs $ rhs) = (lhs, rhs) |
131 |
| dest_eq t = raise TERM ("dest_eq", [t]) |
|
132 |
||
923 | 133 |
fun all_const T = Const ("All", [T --> boolT] ---> boolT); |
134 |
fun mk_all (x, T, P) = all_const T $ absfree (x, T, P); |
|
135 |
||
136 |
fun exists_const T = Const ("Ex", [T --> boolT] ---> boolT); |
|
137 |
fun mk_exists (x, T, P) = exists_const T $ absfree (x, T, P); |
|
138 |
||
139 |
fun Collect_const T = Const ("Collect", [T --> boolT] ---> mk_setT T); |
|
140 |
fun mk_Collect (a, T, t) = Collect_const T $ absfree (a, T, t); |
|
141 |
||
142 |
fun mk_mem (x, A) = |
|
143 |
let val setT = fastype_of A in |
|
144 |
Const ("op :", [dest_setT setT, setT] ---> boolT) $ x $ A |
|
145 |
end; |
|
146 |
||
6380 | 147 |
fun dest_mem (Const ("op :", _) $ x $ A) = (x, A) |
148 |
| dest_mem t = raise TERM ("dest_mem", [t]); |
|
149 |
||
923 | 150 |
|
2510 | 151 |
(* binary oprations and relations *) |
152 |
||
153 |
fun mk_binop c (t, u) = |
|
154 |
let val T = fastype_of t in |
|
155 |
Const (c, [T, T] ---> T) $ t $ u |
|
156 |
end; |
|
157 |
||
158 |
fun mk_binrel c (t, u) = |
|
159 |
let val T = fastype_of t in |
|
160 |
Const (c, [T, T] ---> boolT) $ t $ u |
|
161 |
end; |
|
162 |
||
163 |
fun dest_bin c T (tm as Const (c', Type ("fun", [T', _])) $ t $ u) = |
|
164 |
if c = c' andalso T = T' then (t, u) |
|
3794 | 165 |
else raise TERM ("dest_bin " ^ c, [tm]) |
166 |
| dest_bin c _ tm = raise TERM ("dest_bin " ^ c, [tm]); |
|
2510 | 167 |
|
168 |
||
4571 | 169 |
(* unit *) |
170 |
||
171 |
val unitT = Type ("unit", []); |
|
172 |
||
9362 | 173 |
fun is_unitT (Type ("unit", [])) = true |
174 |
| is_unitT _ = false; |
|
175 |
||
4571 | 176 |
val unit = Const ("()", unitT); |
177 |
||
178 |
fun is_unit (Const ("()", _)) = true |
|
179 |
| is_unit _ = false; |
|
180 |
||
181 |
||
182 |
(* prod *) |
|
183 |
||
184 |
fun mk_prodT (T1, T2) = Type ("*", [T1, T2]); |
|
185 |
||
186 |
fun dest_prodT (Type ("*", [T1, T2])) = (T1, T2) |
|
187 |
| dest_prodT T = raise TYPE ("dest_prodT", [T], []); |
|
188 |
||
189 |
fun mk_prod (t1, t2) = |
|
190 |
let val T1 = fastype_of t1 and T2 = fastype_of t2 in |
|
191 |
Const ("Pair", [T1, T2] ---> mk_prodT (T1, T2)) $ t1 $ t2 |
|
192 |
end; |
|
193 |
||
194 |
fun dest_prod (Const ("Pair", _) $ t1 $ t2) = (t1, t2) |
|
195 |
| dest_prod t = raise TERM ("dest_prod", [t]); |
|
196 |
||
197 |
fun mk_fst p = |
|
198 |
let val pT = fastype_of p in |
|
199 |
Const ("fst", pT --> fst (dest_prodT pT)) $ p |
|
200 |
end; |
|
201 |
||
202 |
fun mk_snd p = |
|
203 |
let val pT = fastype_of p in |
|
204 |
Const ("snd", pT --> snd (dest_prodT pT)) $ p |
|
205 |
end; |
|
206 |
||
5096
84b00be693b4
Moved most of the Prod_Syntax - stuff to HOLogic.
berghofe
parents:
4571
diff
changeset
|
207 |
(*Maps the type T1 * ... * Tn to [T1, ..., Tn], however nested*) |
84b00be693b4
Moved most of the Prod_Syntax - stuff to HOLogic.
berghofe
parents:
4571
diff
changeset
|
208 |
fun prodT_factors (Type ("*", [T1, T2])) = prodT_factors T1 @ prodT_factors T2 |
84b00be693b4
Moved most of the Prod_Syntax - stuff to HOLogic.
berghofe
parents:
4571
diff
changeset
|
209 |
| prodT_factors T = [T]; |
84b00be693b4
Moved most of the Prod_Syntax - stuff to HOLogic.
berghofe
parents:
4571
diff
changeset
|
210 |
|
84b00be693b4
Moved most of the Prod_Syntax - stuff to HOLogic.
berghofe
parents:
4571
diff
changeset
|
211 |
fun split_const (Ta, Tb, Tc) = |
84b00be693b4
Moved most of the Prod_Syntax - stuff to HOLogic.
berghofe
parents:
4571
diff
changeset
|
212 |
Const ("split", [[Ta, Tb] ---> Tc, mk_prodT (Ta, Tb)] ---> Tc); |
84b00be693b4
Moved most of the Prod_Syntax - stuff to HOLogic.
berghofe
parents:
4571
diff
changeset
|
213 |
|
84b00be693b4
Moved most of the Prod_Syntax - stuff to HOLogic.
berghofe
parents:
4571
diff
changeset
|
214 |
(*Makes a nested tuple from a list, following the product type structure*) |
84b00be693b4
Moved most of the Prod_Syntax - stuff to HOLogic.
berghofe
parents:
4571
diff
changeset
|
215 |
fun mk_tuple (Type ("*", [T1, T2])) tms = |
84b00be693b4
Moved most of the Prod_Syntax - stuff to HOLogic.
berghofe
parents:
4571
diff
changeset
|
216 |
mk_prod (mk_tuple T1 tms, |
84b00be693b4
Moved most of the Prod_Syntax - stuff to HOLogic.
berghofe
parents:
4571
diff
changeset
|
217 |
mk_tuple T2 (drop (length (prodT_factors T1), tms))) |
84b00be693b4
Moved most of the Prod_Syntax - stuff to HOLogic.
berghofe
parents:
4571
diff
changeset
|
218 |
| mk_tuple T (t::_) = t; |
4571 | 219 |
|
5207 | 220 |
|
221 |
||
9362 | 222 |
(* proper tuples *) |
223 |
||
224 |
local (*currently unused*) |
|
225 |
||
226 |
fun mk_tupleT Ts = foldr mk_prodT (Ts, unitT); |
|
227 |
||
228 |
fun dest_tupleT (Type ("unit", [])) = [] |
|
229 |
| dest_tupleT (Type ("*", [T, U])) = T :: dest_tupleT U |
|
230 |
| dest_tupleT T = raise TYPE ("dest_tupleT", [T], []); |
|
231 |
||
232 |
fun mk_tuple ts = foldr mk_prod (ts, unit); |
|
233 |
||
234 |
fun dest_tuple (Const ("()", _)) = [] |
|
235 |
| dest_tuple (Const ("Pair", _) $ t $ u) = t :: dest_tuple u |
|
236 |
| dest_tuple t = raise TERM ("dest_tuple", [t]); |
|
237 |
||
238 |
in val _ = unit end; |
|
239 |
||
240 |
||
5207 | 241 |
(* nat *) |
242 |
||
243 |
val natT = Type ("nat", []); |
|
244 |
||
245 |
val zero = Const ("0", natT); |
|
246 |
||
247 |
fun is_zero (Const ("0", _)) = true |
|
248 |
| is_zero _ = false; |
|
249 |
||
250 |
fun mk_Suc t = Const ("Suc", natT --> natT) $ t; |
|
251 |
||
252 |
fun dest_Suc (Const ("Suc", _) $ t) = t |
|
253 |
| dest_Suc t = raise TERM ("dest_Suc", [t]); |
|
254 |
||
255 |
fun mk_nat 0 = zero |
|
256 |
| mk_nat n = mk_Suc (mk_nat (n - 1)); |
|
257 |
||
258 |
fun dest_nat (Const ("0", _)) = 0 |
|
259 |
| dest_nat (Const ("Suc", _) $ t) = dest_nat t + 1 |
|
260 |
| dest_nat t = raise TERM ("dest_nat", [t]); |
|
261 |
||
262 |
||
7073 | 263 |
val intT = Type ("IntDef.int", []); |
264 |
||
7163 | 265 |
val realT = Type("RealDef.real",[]); |
266 |
||
7073 | 267 |
|
268 |
(* binary numerals *) |
|
269 |
||
270 |
val binT = Type ("Numeral.bin", []); |
|
271 |
||
272 |
val pls_const = Const ("Numeral.bin.Pls", binT) |
|
273 |
and min_const = Const ("Numeral.bin.Min", binT) |
|
8768 | 274 |
and bit_const = Const ("Numeral.bin.Bit", [binT, boolT] ---> binT); |
275 |
||
276 |
fun number_of_const T = Const ("Numeral.number_of", binT --> T); |
|
8739 | 277 |
|
7073 | 278 |
|
7548
9e29a3af64ab
ROOT: Integ/bin_simprocs.ML now loaded in Integ/Bin.ML
nipkow
parents:
7163
diff
changeset
|
279 |
fun int_of [] = 0 |
9e29a3af64ab
ROOT: Integ/bin_simprocs.ML now loaded in Integ/Bin.ML
nipkow
parents:
7163
diff
changeset
|
280 |
| int_of (b :: bs) = b + 2 * int_of bs; |
9e29a3af64ab
ROOT: Integ/bin_simprocs.ML now loaded in Integ/Bin.ML
nipkow
parents:
7163
diff
changeset
|
281 |
|
9e29a3af64ab
ROOT: Integ/bin_simprocs.ML now loaded in Integ/Bin.ML
nipkow
parents:
7163
diff
changeset
|
282 |
fun dest_bit (Const ("False", _)) = 0 |
9e29a3af64ab
ROOT: Integ/bin_simprocs.ML now loaded in Integ/Bin.ML
nipkow
parents:
7163
diff
changeset
|
283 |
| dest_bit (Const ("True", _)) = 1 |
9e29a3af64ab
ROOT: Integ/bin_simprocs.ML now loaded in Integ/Bin.ML
nipkow
parents:
7163
diff
changeset
|
284 |
| dest_bit t = raise TERM("dest_bit", [t]); |
9e29a3af64ab
ROOT: Integ/bin_simprocs.ML now loaded in Integ/Bin.ML
nipkow
parents:
7163
diff
changeset
|
285 |
|
9e29a3af64ab
ROOT: Integ/bin_simprocs.ML now loaded in Integ/Bin.ML
nipkow
parents:
7163
diff
changeset
|
286 |
fun bin_of (Const ("Numeral.bin.Pls", _)) = [] |
9e29a3af64ab
ROOT: Integ/bin_simprocs.ML now loaded in Integ/Bin.ML
nipkow
parents:
7163
diff
changeset
|
287 |
| bin_of (Const ("Numeral.bin.Min", _)) = [~1] |
9e29a3af64ab
ROOT: Integ/bin_simprocs.ML now loaded in Integ/Bin.ML
nipkow
parents:
7163
diff
changeset
|
288 |
| bin_of (Const ("Numeral.bin.Bit", _) $ bs $ b) = dest_bit b :: bin_of bs |
9e29a3af64ab
ROOT: Integ/bin_simprocs.ML now loaded in Integ/Bin.ML
nipkow
parents:
7163
diff
changeset
|
289 |
| bin_of t = raise TERM("bin_of", [t]); |
9e29a3af64ab
ROOT: Integ/bin_simprocs.ML now loaded in Integ/Bin.ML
nipkow
parents:
7163
diff
changeset
|
290 |
|
9e29a3af64ab
ROOT: Integ/bin_simprocs.ML now loaded in Integ/Bin.ML
nipkow
parents:
7163
diff
changeset
|
291 |
val dest_binum = int_of o bin_of; |
9e29a3af64ab
ROOT: Integ/bin_simprocs.ML now loaded in Integ/Bin.ML
nipkow
parents:
7163
diff
changeset
|
292 |
|
923 | 293 |
end; |