author | haftmann |
Thu, 04 Jun 2009 15:28:59 +0200 | |
changeset 31456 | 55edadbd43d5 |
parent 31205 | 98370b26c2ce |
child 31463 | c5681ed50eab |
permissions | -rw-r--r-- |
923 | 1 |
(* Title: HOL/hologic.ML |
2 |
Author: Lawrence C Paulson and Markus Wenzel |
|
3 |
||
4 |
Abstract syntax operations for HOL. |
|
5 |
*) |
|
6 |
||
7 |
signature HOLOGIC = |
|
8 |
sig |
|
12338
de0f4a63baa5
renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents:
11818
diff
changeset
|
9 |
val typeS: sort |
de0f4a63baa5
renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents:
11818
diff
changeset
|
10 |
val typeT: typ |
8275 | 11 |
val boolN: string |
923 | 12 |
val boolT: typ |
30450 | 13 |
val Trueprop: term |
14 |
val mk_Trueprop: term -> term |
|
15 |
val dest_Trueprop: term -> term |
|
21829
016eff9c5699
simplified mk/dest_numeral (cf. mk/dest_binum of 1.65);
wenzelm
parents:
21820
diff
changeset
|
16 |
val true_const: term |
7073 | 17 |
val false_const: term |
923 | 18 |
val mk_setT: typ -> typ |
19 |
val dest_setT: typ -> typ |
|
30450 | 20 |
val Collect_const: typ -> term |
21 |
val mk_Collect: string * typ * term -> term |
|
22 |
val mk_mem: term * term -> term |
|
23 |
val dest_mem: term -> term * term |
|
24 |
val mk_set: typ -> term list -> term |
|
25 |
val dest_set: term -> term list |
|
26 |
val mk_UNIV: typ -> term |
|
23555
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
27 |
val conj_intr: thm -> thm -> thm |
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
28 |
val conj_elim: thm -> thm * thm |
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
29 |
val conj_elims: thm -> thm list |
923 | 30 |
val conj: term |
31 |
val disj: term |
|
32 |
val imp: term |
|
8429 | 33 |
val Not: term |
7690 | 34 |
val mk_conj: term * term -> term |
35 |
val mk_disj: term * term -> term |
|
36 |
val mk_imp: term * term -> term |
|
16835 | 37 |
val mk_not: term -> term |
15151 | 38 |
val dest_conj: term -> term list |
15945 | 39 |
val dest_disj: term -> term list |
24958 | 40 |
val disjuncts: term -> term list |
4571 | 41 |
val dest_imp: term -> term * term |
15151 | 42 |
val dest_not: term -> term |
923 | 43 |
val eq_const: typ -> term |
21829
016eff9c5699
simplified mk/dest_numeral (cf. mk/dest_binum of 1.65);
wenzelm
parents:
21820
diff
changeset
|
44 |
val mk_eq: term * term -> term |
016eff9c5699
simplified mk/dest_numeral (cf. mk/dest_binum of 1.65);
wenzelm
parents:
21820
diff
changeset
|
45 |
val dest_eq: term -> term * term |
923 | 46 |
val all_const: typ -> term |
21829
016eff9c5699
simplified mk/dest_numeral (cf. mk/dest_binum of 1.65);
wenzelm
parents:
21820
diff
changeset
|
47 |
val mk_all: string * typ * term -> term |
016eff9c5699
simplified mk/dest_numeral (cf. mk/dest_binum of 1.65);
wenzelm
parents:
21820
diff
changeset
|
48 |
val list_all: (string * typ) list * term -> term |
923 | 49 |
val exists_const: typ -> term |
21829
016eff9c5699
simplified mk/dest_numeral (cf. mk/dest_binum of 1.65);
wenzelm
parents:
21820
diff
changeset
|
50 |
val mk_exists: string * typ * term -> term |
15945 | 51 |
val choice_const: typ -> term |
21829
016eff9c5699
simplified mk/dest_numeral (cf. mk/dest_binum of 1.65);
wenzelm
parents:
21820
diff
changeset
|
52 |
val class_eq: string |
2510 | 53 |
val mk_binop: string -> term * term -> term |
54 |
val mk_binrel: string -> term * term -> term |
|
55 |
val dest_bin: string -> typ -> term -> term * term |
|
4571 | 56 |
val unitT: typ |
9362 | 57 |
val is_unitT: typ -> bool |
4571 | 58 |
val unit: term |
59 |
val is_unit: term -> bool |
|
60 |
val mk_prodT: typ * typ -> typ |
|
61 |
val dest_prodT: typ -> typ * typ |
|
14048 | 62 |
val pair_const: typ -> typ -> term |
4571 | 63 |
val mk_prod: term * term -> term |
64 |
val dest_prod: term -> term * term |
|
65 |
val mk_fst: term -> term |
|
66 |
val mk_snd: term -> term |
|
21829
016eff9c5699
simplified mk/dest_numeral (cf. mk/dest_binum of 1.65);
wenzelm
parents:
21820
diff
changeset
|
67 |
val split_const: typ * typ * typ -> term |
18285 | 68 |
val mk_split: term -> term |
5096
84b00be693b4
Moved most of the Prod_Syntax - stuff to HOLogic.
berghofe
parents:
4571
diff
changeset
|
69 |
val prodT_factors: typ -> typ list |
84b00be693b4
Moved most of the Prod_Syntax - stuff to HOLogic.
berghofe
parents:
4571
diff
changeset
|
70 |
val mk_tuple: typ -> term list -> term |
23745 | 71 |
val dest_tuple: term -> term list |
72 |
val ap_split: typ -> typ -> term -> term |
|
73 |
val prod_factors: term -> int list list |
|
74 |
val dest_tuple': int list list -> term -> term list |
|
75 |
val prodT_factors': int list list -> typ -> typ list |
|
76 |
val ap_split': int list list -> typ -> typ -> term -> term |
|
77 |
val mk_tuple': int list list -> typ -> term list -> term |
|
78 |
val mk_tupleT: int list list -> typ list -> typ |
|
79 |
val strip_split: term -> term * typ list * int list list |
|
5207 | 80 |
val natT: typ |
81 |
val zero: term |
|
82 |
val is_zero: term -> bool |
|
83 |
val mk_Suc: term -> term |
|
84 |
val dest_Suc: term -> term |
|
21621 | 85 |
val Suc_zero: term |
24630
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
23745
diff
changeset
|
86 |
val mk_nat: int -> term |
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
23745
diff
changeset
|
87 |
val dest_nat: term -> int |
22994 | 88 |
val class_size: string |
89 |
val size_const: typ -> term |
|
31205
98370b26c2ce
String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents:
31183
diff
changeset
|
90 |
val code_numeralT: typ |
21829
016eff9c5699
simplified mk/dest_numeral (cf. mk/dest_binum of 1.65);
wenzelm
parents:
21820
diff
changeset
|
91 |
val intT: typ |
7073 | 92 |
val pls_const: term |
93 |
val min_const: term |
|
26086
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26036
diff
changeset
|
94 |
val bit0_const: term |
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26036
diff
changeset
|
95 |
val bit1_const: term |
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26036
diff
changeset
|
96 |
val mk_bit: int -> term |
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26036
diff
changeset
|
97 |
val dest_bit: term -> int |
24630
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
23745
diff
changeset
|
98 |
val mk_numeral: int -> term |
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
23745
diff
changeset
|
99 |
val dest_numeral: term -> int |
21829
016eff9c5699
simplified mk/dest_numeral (cf. mk/dest_binum of 1.65);
wenzelm
parents:
21820
diff
changeset
|
100 |
val number_of_const: typ -> term |
23269 | 101 |
val add_numerals: term -> (term * typ) list -> (term * typ) list |
24630
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
23745
diff
changeset
|
102 |
val mk_number: typ -> int -> term |
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
23745
diff
changeset
|
103 |
val dest_number: term -> typ * int |
21778
66440bf72cdc
binary numerals: restricted to actual abstract syntax;
wenzelm
parents:
21755
diff
changeset
|
104 |
val realT: typ |
21755 | 105 |
val nibbleT: typ |
106 |
val mk_nibble: int -> term |
|
107 |
val dest_nibble: term -> int |
|
108 |
val charT: typ |
|
109 |
val mk_char: int -> term |
|
110 |
val dest_char: term -> int |
|
21829
016eff9c5699
simplified mk/dest_numeral (cf. mk/dest_binum of 1.65);
wenzelm
parents:
21820
diff
changeset
|
111 |
val listT: typ -> typ |
25887 | 112 |
val nil_const: typ -> term |
113 |
val cons_const: typ -> term |
|
21829
016eff9c5699
simplified mk/dest_numeral (cf. mk/dest_binum of 1.65);
wenzelm
parents:
21820
diff
changeset
|
114 |
val mk_list: typ -> term list -> term |
016eff9c5699
simplified mk/dest_numeral (cf. mk/dest_binum of 1.65);
wenzelm
parents:
21820
diff
changeset
|
115 |
val dest_list: term -> term list |
21778
66440bf72cdc
binary numerals: restricted to actual abstract syntax;
wenzelm
parents:
21755
diff
changeset
|
116 |
val stringT: typ |
21820
2f2b6a965ccc
introduced mk/dest_numeral/number for mk/dest_binum etc.
haftmann
parents:
21788
diff
changeset
|
117 |
val mk_string: string -> term |
2f2b6a965ccc
introduced mk/dest_numeral/number for mk/dest_binum etc.
haftmann
parents:
21788
diff
changeset
|
118 |
val dest_string: term -> string |
31205
98370b26c2ce
String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents:
31183
diff
changeset
|
119 |
val literalT: typ |
98370b26c2ce
String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents:
31183
diff
changeset
|
120 |
val mk_literal: string -> term |
98370b26c2ce
String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents:
31183
diff
changeset
|
121 |
val dest_literal: term -> string |
31135 | 122 |
val mk_typerep: typ -> term |
123 |
val mk_term_of: typ -> term -> term |
|
124 |
val reflect_term: term -> term |
|
31183 | 125 |
val mk_return: typ -> typ -> term -> term |
126 |
val mk_ST: ((term * typ) * (string * typ) option) list -> term -> typ -> typ option * typ -> term |
|
923 | 127 |
end; |
128 |
||
129 |
structure HOLogic: HOLOGIC = |
|
130 |
struct |
|
131 |
||
12338
de0f4a63baa5
renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents:
11818
diff
changeset
|
132 |
(* HOL syntax *) |
923 | 133 |
|
12338
de0f4a63baa5
renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents:
11818
diff
changeset
|
134 |
val typeS: sort = ["HOL.type"]; |
de0f4a63baa5
renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents:
11818
diff
changeset
|
135 |
val typeT = TypeInfer.anyT typeS; |
de0f4a63baa5
renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents:
11818
diff
changeset
|
136 |
|
923 | 137 |
|
2510 | 138 |
(* bool and set *) |
923 | 139 |
|
8275 | 140 |
val boolN = "bool"; |
141 |
val boolT = Type (boolN, []); |
|
923 | 142 |
|
9856 | 143 |
val true_const = Const ("True", boolT); |
144 |
val false_const = Const ("False", boolT); |
|
7073 | 145 |
|
26804
e2b1e6868c2f
Adapted functions mk_setT and dest_setT to encoding of sets as predicates.
berghofe
parents:
26086
diff
changeset
|
146 |
fun mk_setT T = T --> boolT; |
923 | 147 |
|
26804
e2b1e6868c2f
Adapted functions mk_setT and dest_setT to encoding of sets as predicates.
berghofe
parents:
26086
diff
changeset
|
148 |
fun dest_setT (Type ("fun", [T, Type ("bool", [])])) = T |
3794 | 149 |
| dest_setT T = raise TYPE ("dest_setT: set type expected", [T], []); |
923 | 150 |
|
30450 | 151 |
fun mk_set T ts = |
152 |
let |
|
153 |
val sT = mk_setT T; |
|
30453 | 154 |
val empty = Const ("Set.empty", sT); |
31456 | 155 |
fun insert t u = Const ("Set.insert", T --> sT --> sT) $ t $ u; |
30450 | 156 |
in fold_rev insert ts empty end; |
157 |
||
158 |
fun mk_UNIV T = Const ("Set.UNIV", mk_setT T); |
|
159 |
||
31456 | 160 |
fun dest_set (Const ("Set.empty", _)) = [] |
161 |
| dest_set (Const ("Set.insert", _) $ t $ u) = t :: dest_set u |
|
30450 | 162 |
| dest_set t = raise TERM ("dest_set", [t]); |
163 |
||
164 |
fun Collect_const T = Const ("Collect", (T --> boolT) --> mk_setT T); |
|
165 |
fun mk_Collect (a, T, t) = Collect_const T $ absfree (a, T, t); |
|
166 |
||
167 |
fun mk_mem (x, A) = |
|
168 |
let val setT = fastype_of A in |
|
169 |
Const ("op :", dest_setT setT --> setT --> boolT) $ x $ A |
|
170 |
end; |
|
171 |
||
172 |
fun dest_mem (Const ("op :", _) $ x $ A) = (x, A) |
|
173 |
| dest_mem t = raise TERM ("dest_mem", [t]); |
|
174 |
||
8275 | 175 |
|
7073 | 176 |
(* logic *) |
923 | 177 |
|
178 |
val Trueprop = Const ("Trueprop", boolT --> propT); |
|
179 |
||
180 |
fun mk_Trueprop P = Trueprop $ P; |
|
181 |
||
182 |
fun dest_Trueprop (Const ("Trueprop", _) $ P) = P |
|
3794 | 183 |
| dest_Trueprop t = raise TERM ("dest_Trueprop", [t]); |
923 | 184 |
|
23555
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
185 |
fun conj_intr thP thQ = |
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
186 |
let |
23576
1ffe739e5ee0
removed dest_cTrueprop (cf. ObjectLogic.dest_judgment);
wenzelm
parents:
23566
diff
changeset
|
187 |
val (P, Q) = pairself (ObjectLogic.dest_judgment o Thm.cprop_of) (thP, thQ) |
23555
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
188 |
handle CTERM (msg, _) => raise THM (msg, 0, [thP, thQ]); |
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
189 |
val inst = Thm.instantiate ([], [(@{cpat "?P::bool"}, P), (@{cpat "?Q::bool"}, Q)]); |
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
190 |
in Drule.implies_elim_list (inst @{thm conjI}) [thP, thQ] end; |
923 | 191 |
|
23555
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
192 |
fun conj_elim thPQ = |
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
193 |
let |
23576
1ffe739e5ee0
removed dest_cTrueprop (cf. ObjectLogic.dest_judgment);
wenzelm
parents:
23566
diff
changeset
|
194 |
val (P, Q) = Thm.dest_binop (ObjectLogic.dest_judgment (Thm.cprop_of thPQ)) |
23555
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
195 |
handle CTERM (msg, _) => raise THM (msg, 0, [thPQ]); |
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
196 |
val inst = Thm.instantiate ([], [(@{cpat "?P::bool"}, P), (@{cpat "?Q::bool"}, Q)]); |
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
197 |
val thP = Thm.implies_elim (inst @{thm conjunct1}) thPQ; |
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
198 |
val thQ = Thm.implies_elim (inst @{thm conjunct2}) thPQ; |
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
199 |
in (thP, thQ) end; |
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
200 |
|
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
201 |
fun conj_elims th = |
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
202 |
let val (th1, th2) = conj_elim th |
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
203 |
in conj_elims th1 @ conj_elims th2 end handle THM _ => [th]; |
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
204 |
|
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
205 |
val conj = @{term "op &"} |
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
206 |
and disj = @{term "op |"} |
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
207 |
and imp = @{term "op -->"} |
16e5fd18905c
assume basic HOL context for compilation (antiquotations);
wenzelm
parents:
23297
diff
changeset
|
208 |
and Not = @{term "Not"}; |
923 | 209 |
|
7690 | 210 |
fun mk_conj (t1, t2) = conj $ t1 $ t2 |
211 |
and mk_disj (t1, t2) = disj $ t1 $ t2 |
|
16835 | 212 |
and mk_imp (t1, t2) = imp $ t1 $ t2 |
213 |
and mk_not t = Not $ t; |
|
7690 | 214 |
|
15151 | 215 |
fun dest_conj (Const ("op &", _) $ t $ t') = t :: dest_conj t' |
216 |
| dest_conj t = [t]; |
|
217 |
||
15945 | 218 |
fun dest_disj (Const ("op |", _) $ t $ t') = t :: dest_disj t' |
219 |
| dest_disj t = [t]; |
|
220 |
||
24958 | 221 |
(*Like dest_disj, but flattens disjunctions however nested*) |
222 |
fun disjuncts_aux (Const ("op |", _) $ t $ t') disjs = disjuncts_aux t (disjuncts_aux t' disjs) |
|
223 |
| disjuncts_aux t disjs = t::disjs; |
|
224 |
||
225 |
fun disjuncts t = disjuncts_aux t []; |
|
226 |
||
4466
305390f23734
Better equality handling in Blast_tac, usingd a new variant of hyp_subst_tac
paulson
parents:
4294
diff
changeset
|
227 |
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
|
228 |
| 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
|
229 |
|
15151 | 230 |
fun dest_not (Const ("Not", _) $ t) = t |
231 |
| dest_not t = raise TERM ("dest_not", [t]); |
|
8302 | 232 |
|
923 | 233 |
fun eq_const T = Const ("op =", [T, T] ---> boolT); |
234 |
fun mk_eq (t, u) = eq_const (fastype_of t) $ t $ u; |
|
235 |
||
6031 | 236 |
fun dest_eq (Const ("op =", _) $ lhs $ rhs) = (lhs, rhs) |
237 |
| dest_eq t = raise TERM ("dest_eq", [t]) |
|
238 |
||
923 | 239 |
fun all_const T = Const ("All", [T --> boolT] ---> boolT); |
240 |
fun mk_all (x, T, P) = all_const T $ absfree (x, T, P); |
|
21173
663a7b39894c
removed is_Trueprop (use can dest_Trueprop'' instead);
wenzelm
parents:
21078
diff
changeset
|
241 |
fun list_all (xs, t) = fold_rev (fn (x, T) => fn P => all_const T $ Abs (x, T, P)) xs t; |
923 | 242 |
|
243 |
fun exists_const T = Const ("Ex", [T --> boolT] ---> boolT); |
|
244 |
fun mk_exists (x, T, P) = exists_const T $ absfree (x, T, P); |
|
245 |
||
21755 | 246 |
fun choice_const T = Const("Hilbert_Choice.Eps", (T --> boolT) --> T); |
15945 | 247 |
|
23247 | 248 |
val class_eq = "HOL.eq"; |
21045 | 249 |
|
923 | 250 |
|
13743
f8f9393be64c
Fixed bug in simpdata.ML that prevented the use of congruence rules from a
ballarin
parents:
13640
diff
changeset
|
251 |
(* binary operations and relations *) |
2510 | 252 |
|
253 |
fun mk_binop c (t, u) = |
|
254 |
let val T = fastype_of t in |
|
255 |
Const (c, [T, T] ---> T) $ t $ u |
|
256 |
end; |
|
257 |
||
258 |
fun mk_binrel c (t, u) = |
|
259 |
let val T = fastype_of t in |
|
260 |
Const (c, [T, T] ---> boolT) $ t $ u |
|
261 |
end; |
|
262 |
||
14387
e96d5c42c4b0
Polymorphic treatment of binary arithmetic using axclasses
paulson
parents:
14103
diff
changeset
|
263 |
(*destruct the application of a binary operator. The dummyT case is a crude |
e96d5c42c4b0
Polymorphic treatment of binary arithmetic using axclasses
paulson
parents:
14103
diff
changeset
|
264 |
way of handling polymorphic operators.*) |
2510 | 265 |
fun dest_bin c T (tm as Const (c', Type ("fun", [T', _])) $ t $ u) = |
14387
e96d5c42c4b0
Polymorphic treatment of binary arithmetic using axclasses
paulson
parents:
14103
diff
changeset
|
266 |
if c = c' andalso (T=T' orelse T=dummyT) then (t, u) |
3794 | 267 |
else raise TERM ("dest_bin " ^ c, [tm]) |
268 |
| dest_bin c _ tm = raise TERM ("dest_bin " ^ c, [tm]); |
|
2510 | 269 |
|
270 |
||
4571 | 271 |
(* unit *) |
272 |
||
11604 | 273 |
val unitT = Type ("Product_Type.unit", []); |
4571 | 274 |
|
11604 | 275 |
fun is_unitT (Type ("Product_Type.unit", [])) = true |
9362 | 276 |
| is_unitT _ = false; |
277 |
||
11604 | 278 |
val unit = Const ("Product_Type.Unity", unitT); |
4571 | 279 |
|
11604 | 280 |
fun is_unit (Const ("Product_Type.Unity", _)) = true |
4571 | 281 |
| is_unit _ = false; |
282 |
||
283 |
||
284 |
(* prod *) |
|
285 |
||
286 |
fun mk_prodT (T1, T2) = Type ("*", [T1, T2]); |
|
287 |
||
288 |
fun dest_prodT (Type ("*", [T1, T2])) = (T1, T2) |
|
289 |
| dest_prodT T = raise TYPE ("dest_prodT", [T], []); |
|
290 |
||
14048 | 291 |
fun pair_const T1 T2 = Const ("Pair", [T1, T2] ---> mk_prodT (T1, T2)); |
292 |
||
4571 | 293 |
fun mk_prod (t1, t2) = |
294 |
let val T1 = fastype_of t1 and T2 = fastype_of t2 in |
|
14048 | 295 |
pair_const T1 T2 $ t1 $ t2 |
4571 | 296 |
end; |
297 |
||
298 |
fun dest_prod (Const ("Pair", _) $ t1 $ t2) = (t1, t2) |
|
299 |
| dest_prod t = raise TERM ("dest_prod", [t]); |
|
300 |
||
301 |
fun mk_fst p = |
|
302 |
let val pT = fastype_of p in |
|
303 |
Const ("fst", pT --> fst (dest_prodT pT)) $ p |
|
304 |
end; |
|
305 |
||
306 |
fun mk_snd p = |
|
307 |
let val pT = fastype_of p in |
|
308 |
Const ("snd", pT --> snd (dest_prodT pT)) $ p |
|
309 |
end; |
|
310 |
||
18285 | 311 |
fun split_const (A, B, C) = |
312 |
Const ("split", (A --> B --> C) --> mk_prodT (A, B) --> C); |
|
313 |
||
314 |
fun mk_split t = |
|
315 |
(case Term.fastype_of t of |
|
316 |
T as (Type ("fun", [A, Type ("fun", [B, C])])) => |
|
317 |
Const ("split", T --> mk_prodT (A, B) --> C) $ t |
|
318 |
| _ => raise TERM ("mk_split: bad body type", [t])); |
|
319 |
||
5096
84b00be693b4
Moved most of the Prod_Syntax - stuff to HOLogic.
berghofe
parents:
4571
diff
changeset
|
320 |
(*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
|
321 |
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
|
322 |
| prodT_factors T = [T]; |
84b00be693b4
Moved most of the Prod_Syntax - stuff to HOLogic.
berghofe
parents:
4571
diff
changeset
|
323 |
|
84b00be693b4
Moved most of the Prod_Syntax - stuff to HOLogic.
berghofe
parents:
4571
diff
changeset
|
324 |
(*Makes a nested tuple from a list, following the product type structure*) |
16971 | 325 |
fun mk_tuple (Type ("*", [T1, T2])) tms = |
326 |
mk_prod (mk_tuple T1 tms, |
|
15570 | 327 |
mk_tuple T2 (Library.drop (length (prodT_factors T1), tms))) |
5096
84b00be693b4
Moved most of the Prod_Syntax - stuff to HOLogic.
berghofe
parents:
4571
diff
changeset
|
328 |
| mk_tuple T (t::_) = t; |
4571 | 329 |
|
23745 | 330 |
fun dest_tuple (Const ("Pair", _) $ t $ u) = dest_tuple t @ dest_tuple u |
331 |
| dest_tuple t = [t]; |
|
332 |
||
333 |
(*In ap_split S T u, term u expects separate arguments for the factors of S, |
|
334 |
with result type T. The call creates a new term expecting one argument |
|
335 |
of type S.*) |
|
336 |
fun ap_split T T3 u = |
|
337 |
let |
|
338 |
fun ap (T :: Ts) = |
|
339 |
(case T of |
|
340 |
Type ("*", [T1, T2]) => |
|
341 |
split_const (T1, T2, Ts ---> T3) $ ap (T1 :: T2 :: Ts) |
|
342 |
| _ => Abs ("x", T, ap Ts)) |
|
343 |
| ap [] = |
|
344 |
let val k = length (prodT_factors T) |
|
345 |
in list_comb (incr_boundvars k u, map Bound (k - 1 downto 0)) end |
|
346 |
in ap [T] end; |
|
347 |
||
348 |
||
25172 | 349 |
(* operations on tuples with specific arities *) |
350 |
(* |
|
351 |
an "arity" of a tuple is a list of lists of integers |
|
352 |
("factors"), denoting paths to subterms that are pairs |
|
353 |
*) |
|
23745 | 354 |
|
355 |
fun prod_err s = raise TERM (s ^ ": inconsistent use of products", []); |
|
356 |
||
357 |
fun prod_factors t = |
|
358 |
let |
|
359 |
fun factors p (Const ("Pair", _) $ t $ u) = |
|
360 |
p :: factors (1::p) t @ factors (2::p) u |
|
361 |
| factors p _ = [] |
|
362 |
in factors [] t end; |
|
363 |
||
364 |
fun dest_tuple' ps = |
|
365 |
let |
|
366 |
fun dest p t = if p mem ps then (case t of |
|
367 |
Const ("Pair", _) $ t $ u => |
|
368 |
dest (1::p) t @ dest (2::p) u |
|
369 |
| _ => prod_err "dest_tuple'") else [t] |
|
370 |
in dest [] end; |
|
371 |
||
372 |
fun prodT_factors' ps = |
|
373 |
let |
|
374 |
fun factors p T = if p mem ps then (case T of |
|
375 |
Type ("*", [T1, T2]) => |
|
376 |
factors (1::p) T1 @ factors (2::p) T2 |
|
377 |
| _ => prod_err "prodT_factors'") else [T] |
|
378 |
in factors [] end; |
|
379 |
||
380 |
(*In ap_split' ps S T u, term u expects separate arguments for the factors of S, |
|
381 |
with result type T. The call creates a new term expecting one argument |
|
382 |
of type S.*) |
|
383 |
fun ap_split' ps T T3 u = |
|
384 |
let |
|
385 |
fun ap ((p, T) :: pTs) = |
|
386 |
if p mem ps then (case T of |
|
387 |
Type ("*", [T1, T2]) => |
|
388 |
split_const (T1, T2, map snd pTs ---> T3) $ |
|
389 |
ap ((1::p, T1) :: (2::p, T2) :: pTs) |
|
390 |
| _ => prod_err "ap_split'") |
|
391 |
else Abs ("x", T, ap pTs) |
|
392 |
| ap [] = |
|
393 |
let val k = length ps |
|
394 |
in list_comb (incr_boundvars (k + 1) u, map Bound (k downto 0)) end |
|
395 |
in ap [([], T)] end; |
|
396 |
||
397 |
fun mk_tuple' ps = |
|
398 |
let |
|
399 |
fun mk p T ts = |
|
400 |
if p mem ps then (case T of |
|
401 |
Type ("*", [T1, T2]) => |
|
402 |
let |
|
403 |
val (t, ts') = mk (1::p) T1 ts; |
|
404 |
val (u, ts'') = mk (2::p) T2 ts' |
|
405 |
in (pair_const T1 T2 $ t $ u, ts'') end |
|
406 |
| _ => prod_err "mk_tuple'") |
|
407 |
else (hd ts, tl ts) |
|
408 |
in fst oo mk [] end; |
|
409 |
||
410 |
fun mk_tupleT ps = |
|
411 |
let |
|
412 |
fun mk p Ts = |
|
413 |
if p mem ps then |
|
414 |
let |
|
415 |
val (T, Ts') = mk (1::p) Ts; |
|
416 |
val (U, Ts'') = mk (2::p) Ts' |
|
417 |
in (mk_prodT (T, U), Ts'') end |
|
418 |
else (hd Ts, tl Ts) |
|
419 |
in fst o mk [] end; |
|
420 |
||
421 |
fun strip_split t = |
|
422 |
let |
|
423 |
fun strip [] qs Ts t = (t, Ts, qs) |
|
424 |
| strip (p :: ps) qs Ts (Const ("split", _) $ t) = |
|
425 |
strip ((1 :: p) :: (2 :: p) :: ps) (p :: qs) Ts t |
|
426 |
| strip (p :: ps) qs Ts (Abs (s, T, t)) = strip ps qs (T :: Ts) t |
|
427 |
| strip (p :: ps) qs Ts t = strip ps qs |
|
428 |
(hd (binder_types (fastype_of1 (Ts, t))) :: Ts) |
|
429 |
(incr_boundvars 1 t $ Bound 0) |
|
430 |
in strip [[]] [] [] t end; |
|
431 |
||
5207 | 432 |
|
433 |
(* nat *) |
|
434 |
||
435 |
val natT = Type ("nat", []); |
|
436 |
||
22994 | 437 |
val zero = Const ("HOL.zero_class.zero", natT); |
5207 | 438 |
|
22994 | 439 |
fun is_zero (Const ("HOL.zero_class.zero", _)) = true |
5207 | 440 |
| is_zero _ = false; |
441 |
||
442 |
fun mk_Suc t = Const ("Suc", natT --> natT) $ t; |
|
443 |
||
444 |
fun dest_Suc (Const ("Suc", _) $ t) = t |
|
445 |
| dest_Suc t = raise TERM ("dest_Suc", [t]); |
|
446 |
||
21621 | 447 |
val Suc_zero = mk_Suc zero; |
448 |
||
24630
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
23745
diff
changeset
|
449 |
fun mk_nat n = |
22994 | 450 |
let |
451 |
fun mk 0 = zero |
|
23297 | 452 |
| mk n = mk_Suc (mk (n - 1)); |
23576
1ffe739e5ee0
removed dest_cTrueprop (cf. ObjectLogic.dest_judgment);
wenzelm
parents:
23566
diff
changeset
|
453 |
in if n < 0 then raise TERM ("mk_nat: negative number", []) else mk n end; |
5207 | 454 |
|
24630
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
23745
diff
changeset
|
455 |
fun dest_nat (Const ("HOL.zero_class.zero", _)) = 0 |
23297 | 456 |
| dest_nat (Const ("Suc", _) $ t) = dest_nat t + 1 |
5207 | 457 |
| dest_nat t = raise TERM ("dest_nat", [t]); |
458 |
||
22994 | 459 |
val class_size = "Nat.size"; |
460 |
||
461 |
fun size_const T = Const ("Nat.size_class.size", T --> natT); |
|
462 |
||
5207 | 463 |
|
31205
98370b26c2ce
String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents:
31183
diff
changeset
|
464 |
(* code numeral *) |
26036 | 465 |
|
31205
98370b26c2ce
String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents:
31183
diff
changeset
|
466 |
val code_numeralT = Type ("Code_Numeral.code_numeral", []); |
26036 | 467 |
|
468 |
||
21778
66440bf72cdc
binary numerals: restricted to actual abstract syntax;
wenzelm
parents:
21755
diff
changeset
|
469 |
(* binary numerals and int -- non-unique representation due to leading zeros/ones! *) |
66440bf72cdc
binary numerals: restricted to actual abstract syntax;
wenzelm
parents:
21755
diff
changeset
|
470 |
|
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25887
diff
changeset
|
471 |
val intT = Type ("Int.int", []); |
21778
66440bf72cdc
binary numerals: restricted to actual abstract syntax;
wenzelm
parents:
21755
diff
changeset
|
472 |
|
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25887
diff
changeset
|
473 |
val pls_const = Const ("Int.Pls", intT) |
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25887
diff
changeset
|
474 |
and min_const = Const ("Int.Min", intT) |
26086
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26036
diff
changeset
|
475 |
and bit0_const = Const ("Int.Bit0", intT --> intT) |
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26036
diff
changeset
|
476 |
and bit1_const = Const ("Int.Bit1", intT --> intT); |
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26036
diff
changeset
|
477 |
|
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26036
diff
changeset
|
478 |
fun mk_bit 0 = bit0_const |
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26036
diff
changeset
|
479 |
| mk_bit 1 = bit1_const |
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26036
diff
changeset
|
480 |
| mk_bit _ = raise TERM ("mk_bit", []); |
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26036
diff
changeset
|
481 |
|
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26036
diff
changeset
|
482 |
fun dest_bit (Const ("Int.Bit0", _)) = 0 |
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26036
diff
changeset
|
483 |
| dest_bit (Const ("Int.Bit1", _)) = 1 |
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26036
diff
changeset
|
484 |
| dest_bit t = raise TERM ("dest_bit", [t]); |
8768 | 485 |
|
21829
016eff9c5699
simplified mk/dest_numeral (cf. mk/dest_binum of 1.65);
wenzelm
parents:
21820
diff
changeset
|
486 |
fun mk_numeral 0 = pls_const |
016eff9c5699
simplified mk/dest_numeral (cf. mk/dest_binum of 1.65);
wenzelm
parents:
21820
diff
changeset
|
487 |
| mk_numeral ~1 = min_const |
016eff9c5699
simplified mk/dest_numeral (cf. mk/dest_binum of 1.65);
wenzelm
parents:
21820
diff
changeset
|
488 |
| mk_numeral i = |
24630
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
23745
diff
changeset
|
489 |
let val (q, r) = Integer.div_mod i 2; |
26086
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26036
diff
changeset
|
490 |
in mk_bit r $ mk_numeral q end; |
13755 | 491 |
|
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25887
diff
changeset
|
492 |
fun dest_numeral (Const ("Int.Pls", _)) = 0 |
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25887
diff
changeset
|
493 |
| dest_numeral (Const ("Int.Min", _)) = ~1 |
26086
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26036
diff
changeset
|
494 |
| dest_numeral (Const ("Int.Bit0", _) $ bs) = 2 * dest_numeral bs |
3c243098b64a
New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
huffman
parents:
26036
diff
changeset
|
495 |
| dest_numeral (Const ("Int.Bit1", _) $ bs) = 2 * dest_numeral bs + 1 |
21829
016eff9c5699
simplified mk/dest_numeral (cf. mk/dest_binum of 1.65);
wenzelm
parents:
21820
diff
changeset
|
496 |
| dest_numeral t = raise TERM ("dest_numeral", [t]); |
13755 | 497 |
|
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25887
diff
changeset
|
498 |
fun number_of_const T = Const ("Int.number_class.number_of", intT --> T); |
21820
2f2b6a965ccc
introduced mk/dest_numeral/number for mk/dest_binum etc.
haftmann
parents:
21788
diff
changeset
|
499 |
|
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25887
diff
changeset
|
500 |
fun add_numerals (Const ("Int.number_class.number_of", Type (_, [_, T])) $ t) = cons (t, T) |
23269 | 501 |
| add_numerals (t $ u) = add_numerals t #> add_numerals u |
502 |
| add_numerals (Abs (_, _, t)) = add_numerals t |
|
503 |
| add_numerals _ = I; |
|
22391 | 504 |
|
22994 | 505 |
fun mk_number T 0 = Const ("HOL.zero_class.zero", T) |
506 |
| mk_number T 1 = Const ("HOL.one_class.one", T) |
|
21820
2f2b6a965ccc
introduced mk/dest_numeral/number for mk/dest_binum etc.
haftmann
parents:
21788
diff
changeset
|
507 |
| mk_number T i = number_of_const T $ mk_numeral i; |
2f2b6a965ccc
introduced mk/dest_numeral/number for mk/dest_binum etc.
haftmann
parents:
21788
diff
changeset
|
508 |
|
22994 | 509 |
fun dest_number (Const ("HOL.zero_class.zero", T)) = (T, 0) |
510 |
| dest_number (Const ("HOL.one_class.one", T)) = (T, 1) |
|
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25887
diff
changeset
|
511 |
| dest_number (Const ("Int.number_class.number_of", Type ("fun", [_, T])) $ t) = |
22994 | 512 |
(T, dest_numeral t) |
21820
2f2b6a965ccc
introduced mk/dest_numeral/number for mk/dest_binum etc.
haftmann
parents:
21788
diff
changeset
|
513 |
| dest_number t = raise TERM ("dest_number", [t]); |
13755 | 514 |
|
21829
016eff9c5699
simplified mk/dest_numeral (cf. mk/dest_binum of 1.65);
wenzelm
parents:
21820
diff
changeset
|
515 |
|
13755 | 516 |
(* real *) |
517 |
||
16971 | 518 |
val realT = Type ("RealDef.real", []); |
13755 | 519 |
|
520 |
||
21755 | 521 |
(* list *) |
21455 | 522 |
|
21755 | 523 |
fun listT T = Type ("List.list", [T]); |
21455 | 524 |
|
25887 | 525 |
fun nil_const T = Const ("List.list.Nil", listT T); |
526 |
||
527 |
fun cons_const T = |
|
528 |
let val lT = listT T |
|
529 |
in Const ("List.list.Cons", T --> lT --> lT) end; |
|
530 |
||
21755 | 531 |
fun mk_list T ts = |
21455 | 532 |
let |
21755 | 533 |
val lT = listT T; |
534 |
val Nil = Const ("List.list.Nil", lT); |
|
535 |
fun Cons t u = Const ("List.list.Cons", T --> lT --> lT) $ t $ u; |
|
536 |
in fold_rev Cons ts Nil end; |
|
537 |
||
538 |
fun dest_list (Const ("List.list.Nil", _)) = [] |
|
539 |
| dest_list (Const ("List.list.Cons", _) $ t $ u) = t :: dest_list u |
|
540 |
| dest_list t = raise TERM ("dest_list", [t]); |
|
21455 | 541 |
|
542 |
||
31048
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
543 |
(* nibble *) |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
544 |
|
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
545 |
val nibbleT = Type ("String.nibble", []); |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
546 |
|
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
547 |
fun mk_nibble n = |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
548 |
let val s = |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
549 |
if 0 <= n andalso n <= 9 then chr (n + ord "0") |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
550 |
else if 10 <= n andalso n <= 15 then chr (n + ord "A" - 10) |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
551 |
else raise TERM ("mk_nibble", []) |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
552 |
in Const ("String.nibble.Nibble" ^ s, nibbleT) end; |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
553 |
|
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
554 |
fun dest_nibble t = |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
555 |
let fun err () = raise TERM ("dest_nibble", [t]) in |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
556 |
(case try (unprefix "String.nibble.Nibble" o fst o Term.dest_Const) t of |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
557 |
NONE => err () |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
558 |
| SOME c => |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
559 |
if size c <> 1 then err () |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
560 |
else if "0" <= c andalso c <= "9" then ord c - ord "0" |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
561 |
else if "A" <= c andalso c <= "F" then ord c - ord "A" + 10 |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
562 |
else err ()) |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
563 |
end; |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
564 |
|
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
565 |
|
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
566 |
(* char *) |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
567 |
|
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
568 |
val charT = Type ("String.char", []); |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
569 |
|
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
570 |
fun mk_char n = |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
571 |
if 0 <= n andalso n <= 255 then |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
572 |
Const ("String.char.Char", nibbleT --> nibbleT --> charT) $ |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
573 |
mk_nibble (n div 16) $ mk_nibble (n mod 16) |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
574 |
else raise TERM ("mk_char", []); |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
575 |
|
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
576 |
fun dest_char (Const ("String.char.Char", _) $ t $ u) = |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
577 |
dest_nibble t * 16 + dest_nibble u |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
578 |
| dest_char t = raise TERM ("dest_char", [t]); |
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
579 |
|
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
580 |
|
21455 | 581 |
(* string *) |
582 |
||
31048
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
583 |
val stringT = Type ("String.string", []); |
21455 | 584 |
|
21755 | 585 |
val mk_string = mk_list charT o map (mk_char o ord) o explode; |
586 |
val dest_string = implode o map (chr o dest_char) o dest_list; |
|
21455 | 587 |
|
31048
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
588 |
|
31205
98370b26c2ce
String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents:
31183
diff
changeset
|
589 |
(* literal *) |
31048
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
590 |
|
31205
98370b26c2ce
String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents:
31183
diff
changeset
|
591 |
val literalT = Type ("String.literal", []); |
31048
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
592 |
|
31205
98370b26c2ce
String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents:
31183
diff
changeset
|
593 |
fun mk_literal s = Const ("String.literal.STR", stringT --> literalT) |
31048
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
594 |
$ mk_string s; |
31205
98370b26c2ce
String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents:
31183
diff
changeset
|
595 |
fun dest_literal (Const ("String.literal.STR", _) $ t) = |
31048
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
596 |
dest_string t |
31205
98370b26c2ce
String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents:
31183
diff
changeset
|
597 |
| dest_literal t = raise TERM ("dest_literal", [t]); |
31048
ac146fc38b51
refined HOL string theories and corresponding ML fragments
haftmann
parents:
30453
diff
changeset
|
598 |
|
31135 | 599 |
|
600 |
(* typerep and term *) |
|
601 |
||
602 |
val typerepT = Type ("Typerep.typerep", []); |
|
603 |
||
604 |
fun mk_typerep T = Const ("Typerep.typerep_class.typerep", |
|
605 |
Term.itselfT T --> typerepT) $ Logic.mk_type T; |
|
606 |
||
607 |
val termT = Type ("Code_Eval.term", []); |
|
608 |
||
609 |
fun mk_term_of T t = Const ("Code_Eval.term_of_class.term_of", T --> termT) $ t; |
|
610 |
||
611 |
fun reflect_term (Const (c, T)) = |
|
31205
98370b26c2ce
String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents:
31183
diff
changeset
|
612 |
Const ("Code_Eval.Const", literalT --> typerepT --> termT) |
98370b26c2ce
String.literal replaces message_string, code_numeral replaces (code_)index
haftmann
parents:
31183
diff
changeset
|
613 |
$ mk_literal c $ mk_typerep T |
31135 | 614 |
| reflect_term (t1 $ t2) = |
615 |
Const ("Code_Eval.App", termT --> termT --> termT) |
|
616 |
$ reflect_term t1 $ reflect_term t2 |
|
31183 | 617 |
| reflect_term (Abs (v, _, t)) = Abs (v, termT, reflect_term t) |
618 |
| reflect_term t = t; |
|
619 |
||
620 |
||
621 |
(* open state monads *) |
|
622 |
||
623 |
fun mk_return T U x = pair_const T U $ x; |
|
624 |
||
625 |
fun mk_ST clauses t U (someT, V) = |
|
626 |
let |
|
627 |
val R = case someT of SOME T => mk_prodT (T, V) | NONE => V |
|
628 |
fun mk_clause ((t, U), SOME (v, T)) (t', U') = |
|
629 |
(Const ("Product_Type.scomp", (U --> mk_prodT (T, U')) --> (T --> U' --> R) --> U --> R) |
|
630 |
$ t $ lambda (Free (v, T)) t', U) |
|
631 |
| mk_clause ((t, U), NONE) (t', U') = |
|
632 |
(Const ("Product_Type.fcomp", (U --> U') --> (U' --> R) --> U --> R) |
|
633 |
$ t $ t', U) |
|
634 |
in fold_rev mk_clause clauses (t, U) |> fst end; |
|
31135 | 635 |
|
923 | 636 |
end; |