author | blanchet |
Thu, 05 Nov 2009 19:06:35 +0100 | |
changeset 33581 | e1e77265fb1d |
parent 33580 | 45c33e97cb86 |
child 33583 | b5e0909cd5ea |
permissions | -rw-r--r-- |
33192 | 1 |
(* Title: HOL/Nitpick/Tools/nitpick_hol.ML |
2 |
Author: Jasmin Blanchette, TU Muenchen |
|
3 |
Copyright 2008, 2009 |
|
4 |
||
5 |
Auxiliary HOL-related functions used by Nitpick. |
|
6 |
*) |
|
7 |
||
8 |
signature NITPICK_HOL = |
|
9 |
sig |
|
10 |
type const_table = term list Symtab.table |
|
11 |
type special_fun = (styp * int list * term list) * styp |
|
12 |
type unrolled = styp * styp |
|
13 |
type wf_cache = (styp * (bool * bool)) list |
|
14 |
||
15 |
type extended_context = { |
|
16 |
thy: theory, |
|
17 |
ctxt: Proof.context, |
|
18 |
max_bisim_depth: int, |
|
19 |
boxes: (typ option * bool option) list, |
|
20 |
wfs: (styp option * bool option) list, |
|
21 |
user_axioms: bool option, |
|
22 |
debug: bool, |
|
23 |
destroy_constrs: bool, |
|
24 |
specialize: bool, |
|
25 |
skolemize: bool, |
|
26 |
star_linear_preds: bool, |
|
27 |
uncurry: bool, |
|
28 |
fast_descrs: bool, |
|
29 |
tac_timeout: Time.time option, |
|
30 |
evals: term list, |
|
31 |
case_names: (string * int) list, |
|
32 |
def_table: const_table, |
|
33 |
nondef_table: const_table, |
|
34 |
user_nondefs: term list, |
|
35 |
simp_table: const_table Unsynchronized.ref, |
|
36 |
psimp_table: const_table, |
|
37 |
intro_table: const_table, |
|
38 |
ground_thm_table: term list Inttab.table, |
|
39 |
ersatz_table: (string * string) list, |
|
40 |
skolems: (string * string list) list Unsynchronized.ref, |
|
41 |
special_funs: special_fun list Unsynchronized.ref, |
|
42 |
unrolled_preds: unrolled list Unsynchronized.ref, |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
43 |
wf_cache: wf_cache Unsynchronized.ref, |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
44 |
constr_cache: (typ * styp list) list Unsynchronized.ref} |
33192 | 45 |
|
46 |
val name_sep : string |
|
47 |
val numeral_prefix : string |
|
48 |
val skolem_prefix : string |
|
49 |
val eval_prefix : string |
|
50 |
val original_name : string -> string |
|
51 |
val unbox_type : typ -> typ |
|
52 |
val string_for_type : Proof.context -> typ -> string |
|
53 |
val prefix_name : string -> string -> string |
|
54 |
val short_name : string -> string |
|
55 |
val short_const_name : string -> string |
|
56 |
val shorten_const_names_in_term : term -> term |
|
57 |
val type_match : theory -> typ * typ -> bool |
|
58 |
val const_match : theory -> styp * styp -> bool |
|
59 |
val term_match : theory -> term * term -> bool |
|
60 |
val is_TFree : typ -> bool |
|
61 |
val is_higher_order_type : typ -> bool |
|
62 |
val is_fun_type : typ -> bool |
|
63 |
val is_set_type : typ -> bool |
|
64 |
val is_pair_type : typ -> bool |
|
65 |
val is_lfp_iterator_type : typ -> bool |
|
66 |
val is_gfp_iterator_type : typ -> bool |
|
67 |
val is_fp_iterator_type : typ -> bool |
|
68 |
val is_boolean_type : typ -> bool |
|
69 |
val is_integer_type : typ -> bool |
|
70 |
val is_record_type : typ -> bool |
|
71 |
val is_number_type : theory -> typ -> bool |
|
72 |
val const_for_iterator_type : typ -> styp |
|
73 |
val nth_range_type : int -> typ -> typ |
|
74 |
val num_factors_in_type : typ -> int |
|
75 |
val num_binder_types : typ -> int |
|
76 |
val curried_binder_types : typ -> typ list |
|
77 |
val mk_flat_tuple : typ -> term list -> term |
|
78 |
val dest_n_tuple : int -> term -> term list |
|
79 |
val instantiate_type : theory -> typ -> typ -> typ -> typ |
|
80 |
val is_codatatype : theory -> typ -> bool |
|
81 |
val is_pure_typedef : theory -> typ -> bool |
|
82 |
val is_univ_typedef : theory -> typ -> bool |
|
83 |
val is_datatype : theory -> typ -> bool |
|
84 |
val is_record_constr : styp -> bool |
|
85 |
val is_record_get : theory -> styp -> bool |
|
86 |
val is_record_update : theory -> styp -> bool |
|
87 |
val is_abs_fun : theory -> styp -> bool |
|
88 |
val is_rep_fun : theory -> styp -> bool |
|
89 |
val is_constr : theory -> styp -> bool |
|
33581
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
90 |
val is_stale_constr : theory -> styp -> bool |
33192 | 91 |
val is_sel : string -> bool |
92 |
val discr_for_constr : styp -> styp |
|
93 |
val num_sels_for_constr_type : typ -> int |
|
94 |
val nth_sel_name_for_constr_name : string -> int -> string |
|
95 |
val nth_sel_for_constr : styp -> int -> styp |
|
96 |
val boxed_nth_sel_for_constr : extended_context -> styp -> int -> styp |
|
97 |
val sel_no_from_name : string -> int |
|
98 |
val eta_expand : typ list -> term -> int -> term |
|
99 |
val extensionalize : term -> term |
|
100 |
val distinctness_formula : typ -> term list -> term |
|
101 |
val register_frac_type : string -> (string * string) list -> theory -> theory |
|
102 |
val unregister_frac_type : string -> theory -> theory |
|
103 |
val register_codatatype : typ -> string -> styp list -> theory -> theory |
|
104 |
val unregister_codatatype : typ -> theory -> theory |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
105 |
val datatype_constrs : extended_context -> typ -> styp list |
33192 | 106 |
val boxed_datatype_constrs : extended_context -> typ -> styp list |
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
107 |
val num_datatype_constrs : extended_context -> typ -> int |
33192 | 108 |
val constr_name_for_sel_like : string -> string |
109 |
val boxed_constr_for_sel : extended_context -> styp -> styp |
|
110 |
val card_of_type : (typ * int) list -> typ -> int |
|
111 |
val bounded_card_of_type : int -> int -> (typ * int) list -> typ -> int |
|
112 |
val bounded_precise_card_of_type : |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
113 |
extended_context -> int -> int -> (typ * int) list -> typ -> int |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
114 |
val is_finite_type : extended_context -> typ -> bool |
33192 | 115 |
val all_axioms_of : theory -> term list * term list * term list |
116 |
val arity_of_built_in_const : bool -> styp -> int option |
|
117 |
val is_built_in_const : bool -> styp -> bool |
|
118 |
val case_const_names : theory -> (string * int) list |
|
119 |
val const_def_table : Proof.context -> term list -> const_table |
|
120 |
val const_nondef_table : term list -> const_table |
|
121 |
val const_simp_table : Proof.context -> const_table |
|
122 |
val const_psimp_table : Proof.context -> const_table |
|
123 |
val inductive_intro_table : Proof.context -> const_table -> const_table |
|
124 |
val ground_theorem_table : theory -> term list Inttab.table |
|
125 |
val ersatz_table : theory -> (string * string) list |
|
126 |
val def_of_const : theory -> const_table -> styp -> term option |
|
127 |
val is_inductive_pred : extended_context -> styp -> bool |
|
128 |
val is_constr_pattern_lhs : theory -> term -> bool |
|
129 |
val is_constr_pattern_formula : theory -> term -> bool |
|
33556
cba22e2999d5
renamed Nitpick option "coalesce_type_vars" to "merge_type_vars" (shorter) and cleaned up old hacks that are no longer necessary
blanchet
parents:
33232
diff
changeset
|
130 |
val merge_type_vars_in_terms : term list -> term list |
33192 | 131 |
val ground_types_in_type : extended_context -> typ -> typ list |
132 |
val ground_types_in_terms : extended_context -> term list -> typ list |
|
133 |
val format_type : int list -> int list -> typ -> typ |
|
134 |
val format_term_type : |
|
135 |
theory -> const_table -> (term option * int list) list -> term -> typ |
|
136 |
val user_friendly_const : |
|
137 |
extended_context -> string * string -> (term option * int list) list |
|
138 |
-> styp -> term * typ |
|
139 |
val assign_operator_for_const : styp -> string |
|
140 |
val preprocess_term : |
|
141 |
extended_context -> term -> ((term list * term list) * (bool * bool)) * term |
|
142 |
end; |
|
143 |
||
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
144 |
structure Nitpick_HOL : NITPICK_HOL = |
33192 | 145 |
struct |
146 |
||
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
147 |
open Nitpick_Util |
33192 | 148 |
|
149 |
type const_table = term list Symtab.table |
|
150 |
type special_fun = (styp * int list * term list) * styp |
|
151 |
type unrolled = styp * styp |
|
152 |
type wf_cache = (styp * (bool * bool)) list |
|
153 |
||
154 |
type extended_context = { |
|
155 |
thy: theory, |
|
156 |
ctxt: Proof.context, |
|
157 |
max_bisim_depth: int, |
|
158 |
boxes: (typ option * bool option) list, |
|
159 |
wfs: (styp option * bool option) list, |
|
160 |
user_axioms: bool option, |
|
161 |
debug: bool, |
|
162 |
destroy_constrs: bool, |
|
163 |
specialize: bool, |
|
164 |
skolemize: bool, |
|
165 |
star_linear_preds: bool, |
|
166 |
uncurry: bool, |
|
167 |
fast_descrs: bool, |
|
168 |
tac_timeout: Time.time option, |
|
169 |
evals: term list, |
|
170 |
case_names: (string * int) list, |
|
171 |
def_table: const_table, |
|
172 |
nondef_table: const_table, |
|
173 |
user_nondefs: term list, |
|
174 |
simp_table: const_table Unsynchronized.ref, |
|
175 |
psimp_table: const_table, |
|
176 |
intro_table: const_table, |
|
177 |
ground_thm_table: term list Inttab.table, |
|
178 |
ersatz_table: (string * string) list, |
|
179 |
skolems: (string * string list) list Unsynchronized.ref, |
|
180 |
special_funs: special_fun list Unsynchronized.ref, |
|
181 |
unrolled_preds: unrolled list Unsynchronized.ref, |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
182 |
wf_cache: wf_cache Unsynchronized.ref, |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
183 |
constr_cache: (typ * styp list) list Unsynchronized.ref} |
33192 | 184 |
|
185 |
structure TheoryData = TheoryDataFun( |
|
186 |
type T = {frac_types: (string * (string * string) list) list, |
|
187 |
codatatypes: (string * (string * styp list)) list} |
|
188 |
val empty = {frac_types = [], codatatypes = []} |
|
189 |
val copy = I |
|
190 |
val extend = I |
|
191 |
fun merge _ ({frac_types = fs1, codatatypes = cs1}, |
|
192 |
{frac_types = fs2, codatatypes = cs2}) = |
|
193 |
{frac_types = AList.merge (op =) (op =) (fs1, fs2), |
|
194 |
codatatypes = AList.merge (op =) (op =) (cs1, cs2)}) |
|
195 |
||
196 |
(* term * term -> term *) |
|
197 |
fun s_conj (t1, @{const True}) = t1 |
|
198 |
| s_conj (@{const True}, t2) = t2 |
|
199 |
| s_conj (t1, t2) = if @{const False} mem [t1, t2] then @{const False} |
|
200 |
else HOLogic.mk_conj (t1, t2) |
|
201 |
fun s_disj (t1, @{const False}) = t1 |
|
202 |
| s_disj (@{const False}, t2) = t2 |
|
203 |
| s_disj (t1, t2) = if @{const True} mem [t1, t2] then @{const True} |
|
204 |
else HOLogic.mk_disj (t1, t2) |
|
205 |
(* term -> term -> term *) |
|
206 |
fun mk_exists v t = |
|
207 |
HOLogic.exists_const (fastype_of v) $ lambda v (incr_boundvars 1 t) |
|
208 |
||
209 |
(* term -> term -> term list *) |
|
210 |
fun strip_connective conn_t (t as (t0 $ t1 $ t2)) = |
|
211 |
if t0 = conn_t then strip_connective t0 t2 @ strip_connective t0 t1 else [t] |
|
212 |
| strip_connective _ t = [t] |
|
213 |
(* term -> term list * term *) |
|
214 |
fun strip_any_connective (t as (t0 $ t1 $ t2)) = |
|
215 |
if t0 mem [@{const "op &"}, @{const "op |"}] then |
|
216 |
(strip_connective t0 t, t0) |
|
217 |
else |
|
218 |
([t], @{const Not}) |
|
219 |
| strip_any_connective t = ([t], @{const Not}) |
|
220 |
(* term -> term list *) |
|
221 |
val conjuncts = strip_connective @{const "op &"} |
|
222 |
val disjuncts = strip_connective @{const "op |"} |
|
223 |
||
224 |
val name_sep = "$" |
|
225 |
val numeral_prefix = nitpick_prefix ^ "num" ^ name_sep |
|
226 |
val sel_prefix = nitpick_prefix ^ "sel" |
|
227 |
val discr_prefix = nitpick_prefix ^ "is" ^ name_sep |
|
228 |
val set_prefix = nitpick_prefix ^ "set" ^ name_sep |
|
229 |
val lfp_iterator_prefix = nitpick_prefix ^ "lfpit" ^ name_sep |
|
230 |
val gfp_iterator_prefix = nitpick_prefix ^ "gfpit" ^ name_sep |
|
231 |
val nwf_prefix = nitpick_prefix ^ "nwf" ^ name_sep |
|
232 |
val unrolled_prefix = nitpick_prefix ^ "unroll" ^ name_sep |
|
233 |
val base_prefix = nitpick_prefix ^ "base" ^ name_sep |
|
234 |
val step_prefix = nitpick_prefix ^ "step" ^ name_sep |
|
235 |
val ubfp_prefix = nitpick_prefix ^ "ubfp" ^ name_sep |
|
236 |
val lbfp_prefix = nitpick_prefix ^ "lbfp" ^ name_sep |
|
237 |
val skolem_prefix = nitpick_prefix ^ "sk" |
|
238 |
val special_prefix = nitpick_prefix ^ "sp" |
|
239 |
val uncurry_prefix = nitpick_prefix ^ "unc" |
|
240 |
val eval_prefix = nitpick_prefix ^ "eval" |
|
241 |
val bound_var_prefix = "b" |
|
242 |
val cong_var_prefix = "c" |
|
243 |
val iter_var_prefix = "i" |
|
244 |
val val_var_prefix = nitpick_prefix ^ "v" |
|
245 |
val arg_var_prefix = "x" |
|
246 |
||
247 |
(* int -> string *) |
|
248 |
fun sel_prefix_for j = sel_prefix ^ string_of_int j ^ name_sep |
|
249 |
fun special_prefix_for j = special_prefix ^ string_of_int j ^ name_sep |
|
250 |
(* int -> int -> string *) |
|
251 |
fun skolem_prefix_for k j = |
|
252 |
skolem_prefix ^ string_of_int k ^ "@" ^ string_of_int j ^ name_sep |
|
253 |
fun uncurry_prefix_for k j = |
|
254 |
uncurry_prefix ^ string_of_int k ^ "@" ^ string_of_int j ^ name_sep |
|
255 |
||
256 |
(* string -> string * string *) |
|
257 |
val strip_first_name_sep = |
|
258 |
Substring.full #> Substring.position name_sep ##> Substring.triml 1 |
|
259 |
#> pairself Substring.string |
|
260 |
(* string -> string *) |
|
261 |
fun original_name s = |
|
262 |
if String.isPrefix nitpick_prefix s then |
|
263 |
case strip_first_name_sep s of (s1, "") => s1 | (_, s2) => original_name s2 |
|
264 |
else |
|
265 |
s |
|
266 |
val after_name_sep = snd o strip_first_name_sep |
|
267 |
||
268 |
(* When you add constants to these lists, make sure to handle them in |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
269 |
"Nitpick_Nut.nut_from_term", and perhaps in "Nitpick_Mono.consider_term" as |
33192 | 270 |
well. *) |
271 |
val built_in_consts = |
|
272 |
[(@{const_name all}, 1), |
|
273 |
(@{const_name "=="}, 2), |
|
274 |
(@{const_name "==>"}, 2), |
|
275 |
(@{const_name Pure.conjunction}, 2), |
|
276 |
(@{const_name Trueprop}, 1), |
|
277 |
(@{const_name Not}, 1), |
|
278 |
(@{const_name False}, 0), |
|
279 |
(@{const_name True}, 0), |
|
280 |
(@{const_name All}, 1), |
|
281 |
(@{const_name Ex}, 1), |
|
282 |
(@{const_name "op ="}, 2), |
|
283 |
(@{const_name "op &"}, 2), |
|
284 |
(@{const_name "op |"}, 2), |
|
285 |
(@{const_name "op -->"}, 2), |
|
286 |
(@{const_name If}, 3), |
|
287 |
(@{const_name Let}, 2), |
|
288 |
(@{const_name Unity}, 0), |
|
289 |
(@{const_name Pair}, 2), |
|
290 |
(@{const_name fst}, 1), |
|
291 |
(@{const_name snd}, 1), |
|
292 |
(@{const_name Id}, 0), |
|
293 |
(@{const_name insert}, 2), |
|
294 |
(@{const_name converse}, 1), |
|
295 |
(@{const_name trancl}, 1), |
|
296 |
(@{const_name rel_comp}, 2), |
|
297 |
(@{const_name image}, 2), |
|
298 |
(@{const_name Suc}, 0), |
|
299 |
(@{const_name finite}, 1), |
|
300 |
(@{const_name nat}, 0), |
|
301 |
(@{const_name zero_nat_inst.zero_nat}, 0), |
|
302 |
(@{const_name one_nat_inst.one_nat}, 0), |
|
303 |
(@{const_name plus_nat_inst.plus_nat}, 0), |
|
304 |
(@{const_name minus_nat_inst.minus_nat}, 0), |
|
305 |
(@{const_name times_nat_inst.times_nat}, 0), |
|
306 |
(@{const_name div_nat_inst.div_nat}, 0), |
|
307 |
(@{const_name div_nat_inst.mod_nat}, 0), |
|
308 |
(@{const_name ord_nat_inst.less_nat}, 2), |
|
309 |
(@{const_name ord_nat_inst.less_eq_nat}, 2), |
|
310 |
(@{const_name nat_gcd}, 0), |
|
311 |
(@{const_name nat_lcm}, 0), |
|
312 |
(@{const_name zero_int_inst.zero_int}, 0), |
|
313 |
(@{const_name one_int_inst.one_int}, 0), |
|
314 |
(@{const_name plus_int_inst.plus_int}, 0), |
|
315 |
(@{const_name minus_int_inst.minus_int}, 0), |
|
316 |
(@{const_name times_int_inst.times_int}, 0), |
|
317 |
(@{const_name div_int_inst.div_int}, 0), |
|
318 |
(@{const_name div_int_inst.mod_int}, 0), |
|
33571 | 319 |
(@{const_name uminus_int_inst.uminus_int}, 0), |
33192 | 320 |
(@{const_name ord_int_inst.less_int}, 2), |
321 |
(@{const_name ord_int_inst.less_eq_int}, 2), |
|
322 |
(@{const_name Tha}, 1), |
|
323 |
(@{const_name Frac}, 0), |
|
324 |
(@{const_name norm_frac}, 0)] |
|
325 |
val built_in_descr_consts = |
|
326 |
[(@{const_name The}, 1), |
|
327 |
(@{const_name Eps}, 1)] |
|
328 |
val built_in_typed_consts = |
|
329 |
[((@{const_name of_nat}, nat_T --> int_T), 0)] |
|
330 |
val built_in_set_consts = |
|
331 |
[(@{const_name lower_semilattice_fun_inst.inf_fun}, 2), |
|
332 |
(@{const_name upper_semilattice_fun_inst.sup_fun}, 2), |
|
333 |
(@{const_name minus_fun_inst.minus_fun}, 2), |
|
334 |
(@{const_name ord_fun_inst.less_eq_fun}, 2)] |
|
335 |
||
336 |
(* typ -> typ *) |
|
337 |
fun unbox_type (Type (@{type_name fun_box}, Ts)) = |
|
338 |
Type ("fun", map unbox_type Ts) |
|
339 |
| unbox_type (Type (@{type_name pair_box}, Ts)) = |
|
340 |
Type ("*", map unbox_type Ts) |
|
341 |
| unbox_type (Type (s, Ts)) = Type (s, map unbox_type Ts) |
|
342 |
| unbox_type T = T |
|
343 |
(* Proof.context -> typ -> string *) |
|
344 |
fun string_for_type ctxt = Syntax.string_of_typ ctxt o unbox_type |
|
345 |
||
346 |
(* string -> string -> string *) |
|
347 |
val prefix_name = Long_Name.qualify o Long_Name.base_name |
|
348 |
(* string -> string *) |
|
349 |
fun short_name s = List.last (space_explode "." s) handle List.Empty => "" |
|
350 |
(* string -> term -> term *) |
|
351 |
val prefix_abs_vars = Term.map_abs_vars o prefix_name |
|
352 |
(* term -> term *) |
|
353 |
val shorten_abs_vars = Term.map_abs_vars short_name |
|
354 |
(* string -> string *) |
|
355 |
fun short_const_name s = |
|
356 |
case space_explode name_sep s of |
|
357 |
[_] => s |> String.isPrefix nitpick_prefix s ? unprefix nitpick_prefix |
|
358 |
| ss => map short_name ss |> space_implode "_" |
|
359 |
(* term -> term *) |
|
360 |
val shorten_const_names_in_term = |
|
361 |
map_aterms (fn Const (s, T) => Const (short_const_name s, T) | t => t) |
|
362 |
||
363 |
(* theory -> typ * typ -> bool *) |
|
364 |
fun type_match thy (T1, T2) = |
|
365 |
(Sign.typ_match thy (T2, T1) Vartab.empty; true) |
|
366 |
handle Type.TYPE_MATCH => false |
|
367 |
(* theory -> styp * styp -> bool *) |
|
368 |
fun const_match thy ((s1, T1), (s2, T2)) = |
|
369 |
s1 = s2 andalso type_match thy (T1, T2) |
|
370 |
(* theory -> term * term -> bool *) |
|
371 |
fun term_match thy (Const x1, Const x2) = const_match thy (x1, x2) |
|
372 |
| term_match thy (Free (s1, T1), Free (s2, T2)) = |
|
373 |
const_match thy ((short_name s1, T1), (short_name s2, T2)) |
|
374 |
| term_match thy (t1, t2) = t1 aconv t2 |
|
375 |
||
376 |
(* typ -> bool *) |
|
377 |
fun is_TFree (TFree _) = true |
|
378 |
| is_TFree _ = false |
|
379 |
fun is_higher_order_type (Type ("fun", _)) = true |
|
380 |
| is_higher_order_type (Type (_, Ts)) = exists is_higher_order_type Ts |
|
381 |
| is_higher_order_type _ = false |
|
382 |
fun is_fun_type (Type ("fun", _)) = true |
|
383 |
| is_fun_type _ = false |
|
384 |
fun is_set_type (Type ("fun", [_, @{typ bool}])) = true |
|
385 |
| is_set_type _ = false |
|
386 |
fun is_pair_type (Type ("*", _)) = true |
|
387 |
| is_pair_type _ = false |
|
388 |
fun is_lfp_iterator_type (Type (s, _)) = String.isPrefix lfp_iterator_prefix s |
|
389 |
| is_lfp_iterator_type _ = false |
|
390 |
fun is_gfp_iterator_type (Type (s, _)) = String.isPrefix gfp_iterator_prefix s |
|
391 |
| is_gfp_iterator_type _ = false |
|
392 |
val is_fp_iterator_type = is_lfp_iterator_type orf is_gfp_iterator_type |
|
393 |
val is_boolean_type = equal prop_T orf equal bool_T |
|
394 |
val is_integer_type = |
|
395 |
member (op =) [nat_T, int_T, @{typ bisim_iterator}] orf is_fp_iterator_type |
|
396 |
val is_record_type = not o null o Record.dest_recTs |
|
397 |
(* theory -> typ -> bool *) |
|
398 |
fun is_frac_type thy (Type (s, [])) = |
|
399 |
not (null (these (AList.lookup (op =) (#frac_types (TheoryData.get thy)) |
|
400 |
s))) |
|
401 |
| is_frac_type _ _ = false |
|
402 |
fun is_number_type thy = is_integer_type orf is_frac_type thy |
|
403 |
||
404 |
(* bool -> styp -> typ *) |
|
405 |
fun iterator_type_for_const gfp (s, T) = |
|
406 |
Type ((if gfp then gfp_iterator_prefix else lfp_iterator_prefix) ^ s, |
|
407 |
binder_types T) |
|
408 |
(* typ -> styp *) |
|
409 |
fun const_for_iterator_type (Type (s, Ts)) = (after_name_sep s, Ts ---> bool_T) |
|
410 |
| const_for_iterator_type T = |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
411 |
raise TYPE ("Nitpick_HOL.const_for_iterator_type", [T], []) |
33192 | 412 |
|
413 |
(* int -> typ -> typ * typ *) |
|
414 |
fun strip_n_binders 0 T = ([], T) |
|
415 |
| strip_n_binders n (Type ("fun", [T1, T2])) = |
|
416 |
strip_n_binders (n - 1) T2 |>> cons T1 |
|
417 |
| strip_n_binders n (Type (@{type_name fun_box}, Ts)) = |
|
418 |
strip_n_binders n (Type ("fun", Ts)) |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
419 |
| strip_n_binders _ T = raise TYPE ("Nitpick_HOL.strip_n_binders", [T], []) |
33192 | 420 |
(* typ -> typ *) |
421 |
val nth_range_type = snd oo strip_n_binders |
|
422 |
||
423 |
(* typ -> int *) |
|
424 |
fun num_factors_in_type (Type ("*", [T1, T2])) = |
|
425 |
fold (Integer.add o num_factors_in_type) [T1, T2] 0 |
|
426 |
| num_factors_in_type _ = 1 |
|
427 |
fun num_binder_types (Type ("fun", [_, T2])) = 1 + num_binder_types T2 |
|
428 |
| num_binder_types _ = 0 |
|
429 |
(* typ -> typ list *) |
|
430 |
val curried_binder_types = maps HOLogic.flatten_tupleT o binder_types |
|
431 |
fun maybe_curried_binder_types T = |
|
432 |
(if is_pair_type (body_type T) then binder_types else curried_binder_types) T |
|
433 |
||
434 |
(* typ -> term list -> term *) |
|
435 |
fun mk_flat_tuple _ [t] = t |
|
436 |
| mk_flat_tuple (Type ("*", [T1, T2])) (t :: ts) = |
|
437 |
HOLogic.pair_const T1 T2 $ t $ (mk_flat_tuple T2 ts) |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
438 |
| mk_flat_tuple T ts = raise TYPE ("Nitpick_HOL.mk_flat_tuple", [T], ts) |
33192 | 439 |
(* int -> term -> term list *) |
440 |
fun dest_n_tuple 1 t = [t] |
|
441 |
| dest_n_tuple n t = HOLogic.dest_prod t ||> dest_n_tuple (n - 1) |> op :: |
|
442 |
||
443 |
(* int -> typ -> typ list *) |
|
444 |
fun dest_n_tuple_type 1 T = [T] |
|
445 |
| dest_n_tuple_type n (Type (_, [T1, T2])) = |
|
446 |
T1 :: dest_n_tuple_type (n - 1) T2 |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
447 |
| dest_n_tuple_type _ T = |
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
448 |
raise TYPE ("Nitpick_HOL.dest_n_tuple_type", [T], []) |
33192 | 449 |
|
450 |
(* (typ * typ) list -> typ -> typ *) |
|
451 |
fun typ_subst [] T = T |
|
452 |
| typ_subst ps T = |
|
453 |
let |
|
454 |
(* typ -> typ *) |
|
455 |
fun subst T = |
|
456 |
case AList.lookup (op =) ps T of |
|
457 |
SOME T' => T' |
|
458 |
| NONE => case T of Type (s, Ts) => Type (s, map subst Ts) | _ => T |
|
459 |
in subst T end |
|
460 |
||
461 |
(* theory -> typ -> typ -> typ -> typ *) |
|
462 |
fun instantiate_type thy T1 T1' T2 = |
|
463 |
Same.commit (Envir.subst_type_same |
|
464 |
(Sign.typ_match thy (Logic.varifyT T1, T1') Vartab.empty)) |
|
465 |
(Logic.varifyT T2) |
|
466 |
handle Type.TYPE_MATCH => |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
467 |
raise TYPE ("Nitpick_HOL.instantiate_type", [T1, T1'], []) |
33192 | 468 |
|
469 |
(* theory -> typ -> typ -> styp *) |
|
470 |
fun repair_constr_type thy body_T' T = |
|
471 |
instantiate_type thy (body_type T) body_T' T |
|
472 |
||
473 |
(* string -> (string * string) list -> theory -> theory *) |
|
474 |
fun register_frac_type frac_s ersaetze thy = |
|
475 |
let |
|
476 |
val {frac_types, codatatypes} = TheoryData.get thy |
|
477 |
val frac_types = AList.update (op =) (frac_s, ersaetze) frac_types |
|
478 |
in TheoryData.put {frac_types = frac_types, codatatypes = codatatypes} thy end |
|
479 |
(* string -> theory -> theory *) |
|
480 |
fun unregister_frac_type frac_s = register_frac_type frac_s [] |
|
481 |
||
482 |
(* typ -> string -> styp list -> theory -> theory *) |
|
483 |
fun register_codatatype co_T case_name constr_xs thy = |
|
484 |
let |
|
485 |
val {frac_types, codatatypes} = TheoryData.get thy |
|
486 |
val constr_xs = map (apsnd (repair_constr_type thy co_T)) constr_xs |
|
487 |
val (co_s, co_Ts) = dest_Type co_T |
|
488 |
val _ = |
|
489 |
if forall is_TFree co_Ts andalso not (has_duplicates (op =) co_Ts) then () |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
490 |
else raise TYPE ("Nitpick_HOL.register_codatatype", [co_T], []) |
33192 | 491 |
val codatatypes = AList.update (op =) (co_s, (case_name, constr_xs)) |
492 |
codatatypes |
|
493 |
in TheoryData.put {frac_types = frac_types, codatatypes = codatatypes} thy end |
|
494 |
(* typ -> theory -> theory *) |
|
495 |
fun unregister_codatatype co_T = register_codatatype co_T "" [] |
|
496 |
||
497 |
type typedef_info = |
|
498 |
{rep_type: typ, abs_type: typ, Rep_name: string, Abs_name: string, |
|
499 |
set_def: thm option, prop_of_Rep: thm, set_name: string, |
|
500 |
Rep_inverse: thm option} |
|
501 |
||
502 |
(* theory -> string -> typedef_info *) |
|
503 |
fun typedef_info thy s = |
|
504 |
if is_frac_type thy (Type (s, [])) then |
|
505 |
SOME {abs_type = Type (s, []), rep_type = @{typ "int * int"}, |
|
506 |
Abs_name = @{const_name Abs_Frac}, Rep_name = @{const_name Rep_Frac}, |
|
507 |
set_def = NONE, prop_of_Rep = @{prop "Rep_Frac x \<in> Frac"} |
|
508 |
|> Logic.varify, |
|
509 |
set_name = @{const_name Frac}, Rep_inverse = NONE} |
|
510 |
else case Typedef.get_info thy s of |
|
511 |
SOME {abs_type, rep_type, Abs_name, Rep_name, set_def, Rep, Rep_inverse, |
|
512 |
...} => |
|
513 |
SOME {abs_type = abs_type, rep_type = rep_type, Abs_name = Abs_name, |
|
514 |
Rep_name = Rep_name, set_def = set_def, prop_of_Rep = prop_of Rep, |
|
515 |
set_name = set_prefix ^ s, Rep_inverse = SOME Rep_inverse} |
|
516 |
| NONE => NONE |
|
517 |
||
518 |
(* string -> bool *) |
|
519 |
fun is_basic_datatype s = |
|
520 |
s mem [@{type_name "*"}, @{type_name bool}, @{type_name unit}, |
|
521 |
@{type_name nat}, @{type_name int}] |
|
522 |
(* theory -> string -> bool *) |
|
523 |
val is_typedef = is_some oo typedef_info |
|
524 |
val is_real_datatype = is_some oo Datatype.get_info |
|
525 |
(* theory -> typ -> bool *) |
|
526 |
fun is_codatatype thy (T as Type (s, _)) = |
|
527 |
not (null (AList.lookup (op =) (#codatatypes (TheoryData.get thy)) s |
|
528 |
|> Option.map snd |> these)) |
|
529 |
| is_codatatype _ _ = false |
|
530 |
fun is_pure_typedef thy (T as Type (s, _)) = |
|
531 |
is_typedef thy s andalso |
|
532 |
not (is_real_datatype thy s orelse is_codatatype thy T |
|
533 |
orelse is_record_type T orelse is_integer_type T) |
|
534 |
| is_pure_typedef _ _ = false |
|
535 |
fun is_univ_typedef thy (Type (s, _)) = |
|
536 |
(case typedef_info thy s of |
|
537 |
SOME {set_def, prop_of_Rep, ...} => |
|
538 |
(case set_def of |
|
539 |
SOME thm => |
|
540 |
try (fst o dest_Const o snd o Logic.dest_equals o prop_of) thm |
|
541 |
| NONE => |
|
542 |
try (fst o dest_Const o snd o HOLogic.dest_mem |
|
543 |
o HOLogic.dest_Trueprop) prop_of_Rep) = SOME @{const_name UNIV} |
|
544 |
| NONE => false) |
|
545 |
| is_univ_typedef _ _ = false |
|
546 |
fun is_datatype thy (T as Type (s, _)) = |
|
547 |
(is_typedef thy s orelse is_codatatype thy T orelse T = @{typ ind}) |
|
548 |
andalso not (is_basic_datatype s) |
|
549 |
| is_datatype _ _ = false |
|
550 |
||
551 |
(* theory -> typ -> (string * typ) list * (string * typ) *) |
|
552 |
fun all_record_fields thy T = |
|
553 |
let val (recs, more) = Record.get_extT_fields thy T in |
|
554 |
recs @ more :: all_record_fields thy (snd more) |
|
555 |
end |
|
556 |
handle TYPE _ => [] |
|
557 |
(* styp -> bool *) |
|
558 |
fun is_record_constr (x as (s, T)) = |
|
559 |
String.isSuffix Record.extN s andalso |
|
560 |
let val dataT = body_type T in |
|
561 |
is_record_type dataT andalso |
|
562 |
s = unsuffix Record.ext_typeN (fst (dest_Type dataT)) ^ Record.extN |
|
563 |
end |
|
564 |
(* theory -> typ -> int *) |
|
565 |
val num_record_fields = Integer.add 1 o length o fst oo Record.get_extT_fields |
|
566 |
(* theory -> string -> typ -> int *) |
|
567 |
fun no_of_record_field thy s T1 = |
|
568 |
find_index (equal s o fst) (Record.get_extT_fields thy T1 ||> single |> op @) |
|
569 |
(* theory -> styp -> bool *) |
|
570 |
fun is_record_get thy (s, Type ("fun", [T1, _])) = |
|
571 |
exists (equal s o fst) (all_record_fields thy T1) |
|
572 |
| is_record_get _ _ = false |
|
573 |
fun is_record_update thy (s, T) = |
|
574 |
String.isSuffix Record.updateN s andalso |
|
575 |
exists (equal (unsuffix Record.updateN s) o fst) |
|
576 |
(all_record_fields thy (body_type T)) |
|
577 |
handle TYPE _ => false |
|
578 |
fun is_abs_fun thy (s, Type ("fun", [_, Type (s', _)])) = |
|
579 |
(case typedef_info thy s' of |
|
580 |
SOME {Abs_name, ...} => s = Abs_name |
|
581 |
| NONE => false) |
|
582 |
| is_abs_fun _ _ = false |
|
583 |
fun is_rep_fun thy (s, Type ("fun", [Type (s', _), _])) = |
|
584 |
(case typedef_info thy s' of |
|
585 |
SOME {Rep_name, ...} => s = Rep_name |
|
586 |
| NONE => false) |
|
587 |
| is_rep_fun _ _ = false |
|
588 |
||
589 |
(* theory -> styp -> styp *) |
|
590 |
fun mate_of_rep_fun thy (x as (_, Type ("fun", [T1 as Type (s', _), T2]))) = |
|
591 |
(case typedef_info thy s' of |
|
592 |
SOME {Abs_name, ...} => (Abs_name, Type ("fun", [T2, T1])) |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
593 |
| NONE => raise TERM ("Nitpick_HOL.mate_of_rep_fun", [Const x])) |
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
594 |
| mate_of_rep_fun _ x = raise TERM ("Nitpick_HOL.mate_of_rep_fun", [Const x]) |
33192 | 595 |
|
596 |
(* theory -> styp -> bool *) |
|
597 |
fun is_coconstr thy (s, T) = |
|
598 |
let |
|
599 |
val {codatatypes, ...} = TheoryData.get thy |
|
600 |
val co_T = body_type T |
|
601 |
val co_s = dest_Type co_T |> fst |
|
602 |
in |
|
603 |
exists (fn (s', T') => s = s' andalso repair_constr_type thy co_T T' = T) |
|
604 |
(AList.lookup (op =) codatatypes co_s |> Option.map snd |> these) |
|
605 |
end |
|
606 |
handle TYPE ("dest_Type", _, _) => false |
|
607 |
fun is_constr_like thy (s, T) = |
|
608 |
s mem [@{const_name FunBox}, @{const_name PairBox}] orelse |
|
609 |
let val (x as (s, T)) = (s, unbox_type T) in |
|
610 |
Refute.is_IDT_constructor thy x orelse is_record_constr x |
|
611 |
orelse (is_abs_fun thy x andalso is_pure_typedef thy (range_type T)) |
|
612 |
orelse s mem [@{const_name Zero_Rep}, @{const_name Suc_Rep}] |
|
613 |
orelse x = (@{const_name zero_nat_inst.zero_nat}, nat_T) |
|
614 |
orelse is_coconstr thy x |
|
615 |
end |
|
33581
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
616 |
fun is_stale_constr thy (x as (_, T)) = |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
617 |
is_codatatype thy (body_type T) andalso is_constr_like thy x |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
618 |
andalso not (is_coconstr thy x) |
33192 | 619 |
fun is_constr thy (x as (_, T)) = |
620 |
is_constr_like thy x |
|
621 |
andalso not (is_basic_datatype (fst (dest_Type (body_type T)))) |
|
33581
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
622 |
andalso not (is_stale_constr thy x) |
33192 | 623 |
(* string -> bool *) |
624 |
val is_sel = String.isPrefix discr_prefix orf String.isPrefix sel_prefix |
|
625 |
val is_sel_like_and_no_discr = |
|
626 |
String.isPrefix sel_prefix |
|
627 |
orf (member (op =) [@{const_name fst}, @{const_name snd}]) |
|
628 |
||
629 |
datatype boxability = |
|
630 |
InConstr | InSel | InExpr | InPair | InFunLHS | InFunRHS1 | InFunRHS2 |
|
631 |
||
632 |
(* boxability -> boxability *) |
|
633 |
fun in_fun_lhs_for InConstr = InSel |
|
634 |
| in_fun_lhs_for _ = InFunLHS |
|
635 |
fun in_fun_rhs_for InConstr = InConstr |
|
636 |
| in_fun_rhs_for InSel = InSel |
|
637 |
| in_fun_rhs_for InFunRHS1 = InFunRHS2 |
|
638 |
| in_fun_rhs_for _ = InFunRHS1 |
|
639 |
||
640 |
(* extended_context -> boxability -> typ -> bool *) |
|
641 |
fun is_boxing_worth_it (ext_ctxt : extended_context) boxy T = |
|
642 |
case T of |
|
643 |
Type ("fun", _) => |
|
644 |
boxy mem [InPair, InFunLHS] andalso not (is_boolean_type (body_type T)) |
|
645 |
| Type ("*", Ts) => |
|
646 |
boxy mem [InPair, InFunRHS1, InFunRHS2] |
|
647 |
orelse (boxy mem [InExpr, InFunLHS] |
|
648 |
andalso exists (is_boxing_worth_it ext_ctxt InPair) |
|
649 |
(map (box_type ext_ctxt InPair) Ts)) |
|
650 |
| _ => false |
|
651 |
(* extended_context -> boxability -> string * typ list -> string *) |
|
652 |
and should_box_type (ext_ctxt as {thy, boxes, ...}) boxy (z as (s, Ts)) = |
|
653 |
case triple_lookup (type_match thy) boxes (Type z) of |
|
654 |
SOME (SOME box_me) => box_me |
|
655 |
| _ => is_boxing_worth_it ext_ctxt boxy (Type z) |
|
656 |
(* extended_context -> boxability -> typ -> typ *) |
|
657 |
and box_type ext_ctxt boxy T = |
|
658 |
case T of |
|
659 |
Type (z as ("fun", [T1, T2])) => |
|
660 |
if not (boxy mem [InConstr, InSel]) |
|
661 |
andalso should_box_type ext_ctxt boxy z then |
|
662 |
Type (@{type_name fun_box}, |
|
663 |
[box_type ext_ctxt InFunLHS T1, box_type ext_ctxt InFunRHS1 T2]) |
|
664 |
else |
|
665 |
box_type ext_ctxt (in_fun_lhs_for boxy) T1 |
|
666 |
--> box_type ext_ctxt (in_fun_rhs_for boxy) T2 |
|
667 |
| Type (z as ("*", Ts)) => |
|
668 |
if should_box_type ext_ctxt boxy z then |
|
669 |
Type (@{type_name pair_box}, map (box_type ext_ctxt InSel) Ts) |
|
670 |
else |
|
671 |
Type ("*", map (box_type ext_ctxt |
|
672 |
(if boxy mem [InConstr, InSel] then boxy |
|
673 |
else InPair)) Ts) |
|
674 |
| _ => T |
|
675 |
||
676 |
(* styp -> styp *) |
|
677 |
fun discr_for_constr (s, T) = (discr_prefix ^ s, body_type T --> bool_T) |
|
678 |
||
679 |
(* typ -> int *) |
|
680 |
fun num_sels_for_constr_type T = length (maybe_curried_binder_types T) |
|
681 |
(* string -> int -> string *) |
|
682 |
fun nth_sel_name_for_constr_name s n = |
|
683 |
if s = @{const_name Pair} then |
|
684 |
if n = 0 then @{const_name fst} else @{const_name snd} |
|
685 |
else |
|
686 |
sel_prefix_for n ^ s |
|
687 |
(* styp -> int -> styp *) |
|
688 |
fun nth_sel_for_constr x ~1 = discr_for_constr x |
|
689 |
| nth_sel_for_constr (s, T) n = |
|
690 |
(nth_sel_name_for_constr_name s n, |
|
691 |
body_type T --> nth (maybe_curried_binder_types T) n) |
|
692 |
(* extended_context -> styp -> int -> styp *) |
|
693 |
fun boxed_nth_sel_for_constr ext_ctxt = |
|
694 |
apsnd (box_type ext_ctxt InSel) oo nth_sel_for_constr |
|
695 |
||
696 |
(* string -> int *) |
|
697 |
fun sel_no_from_name s = |
|
698 |
if String.isPrefix discr_prefix s then |
|
699 |
~1 |
|
700 |
else if String.isPrefix sel_prefix s then |
|
701 |
s |> unprefix sel_prefix |> Int.fromString |> the |
|
702 |
else if s = @{const_name snd} then |
|
703 |
1 |
|
704 |
else |
|
705 |
0 |
|
706 |
||
707 |
(* typ list -> term -> int -> term *) |
|
708 |
fun eta_expand _ t 0 = t |
|
709 |
| eta_expand Ts (Abs (s, T, t')) n = |
|
710 |
Abs (s, T, eta_expand (T :: Ts) t' (n - 1)) |
|
711 |
| eta_expand Ts t n = |
|
712 |
fold_rev (curry3 Abs ("x\<^isub>\<eta>" ^ nat_subscript n)) |
|
713 |
(List.take (binder_types (fastype_of1 (Ts, t)), n)) |
|
714 |
(list_comb (incr_boundvars n t, map Bound (n - 1 downto 0))) |
|
715 |
||
716 |
(* term -> term *) |
|
717 |
fun extensionalize t = |
|
718 |
case t of |
|
719 |
(t0 as @{const Trueprop}) $ t1 => t0 $ extensionalize t1 |
|
720 |
| Const (@{const_name "op ="}, _) $ t1 $ Abs (s, T, t2) => |
|
721 |
let val v = Var ((s, maxidx_of_term t + 1), T) in |
|
722 |
extensionalize (HOLogic.mk_eq (t1 $ v, subst_bound (v, t2))) |
|
723 |
end |
|
724 |
| _ => t |
|
725 |
||
726 |
(* typ -> term list -> term *) |
|
727 |
fun distinctness_formula T = |
|
728 |
all_distinct_unordered_pairs_of |
|
729 |
#> map (fn (t1, t2) => @{const Not} $ (HOLogic.eq_const T $ t1 $ t2)) |
|
730 |
#> List.foldr (s_conj o swap) @{const True} |
|
731 |
||
732 |
(* typ -> term *) |
|
733 |
fun zero_const T = Const (@{const_name zero_nat_inst.zero_nat}, T) |
|
734 |
fun suc_const T = Const (@{const_name Suc}, T --> T) |
|
735 |
||
736 |
(* theory -> typ -> styp list *) |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
737 |
fun uncached_datatype_constrs thy (T as Type (s, Ts)) = |
33581
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
738 |
(case AList.lookup (op =) (#codatatypes (TheoryData.get thy)) s of |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
739 |
SOME (_, xs' as (_ :: _)) => |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
740 |
map (apsnd (repair_constr_type thy T)) xs' |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
741 |
| _ => |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
742 |
if is_datatype thy T then |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
743 |
case Datatype.get_info thy s of |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
744 |
SOME {index, descr, ...} => |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
745 |
let |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
746 |
val (_, dtyps, constrs) = AList.lookup (op =) descr index |> the |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
747 |
in |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
748 |
map (fn (s', Us) => |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
749 |
(s', map (Refute.typ_of_dtyp descr (dtyps ~~ Ts)) Us |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
750 |
---> T)) constrs |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
751 |
end |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
752 |
| NONE => |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
753 |
if is_record_type T then |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
754 |
let |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
755 |
val s' = unsuffix Record.ext_typeN s ^ Record.extN |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
756 |
val T' = (Record.get_extT_fields thy T |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
757 |
|> apsnd single |> uncurry append |> map snd) ---> T |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
758 |
in [(s', T')] end |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
759 |
else case typedef_info thy s of |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
760 |
SOME {abs_type, rep_type, Abs_name, ...} => |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
761 |
[(Abs_name, instantiate_type thy abs_type T rep_type --> T)] |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
762 |
| NONE => |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
763 |
if T = @{typ ind} then |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
764 |
[dest_Const @{const Zero_Rep}, dest_Const @{const Suc_Rep}] |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
765 |
else |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
766 |
[] |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
767 |
else |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
768 |
[]) |
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
769 |
| uncached_datatype_constrs _ _ = [] |
33192 | 770 |
(* extended_context -> typ -> styp list *) |
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
771 |
fun datatype_constrs (ext_ctxt as {thy, constr_cache, ...} : extended_context) |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
772 |
T = |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
773 |
case AList.lookup (op =) (!constr_cache) T of |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
774 |
SOME xs => xs |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
775 |
| NONE => |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
776 |
let val xs = uncached_datatype_constrs thy T in |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
777 |
(Unsynchronized.change constr_cache (cons (T, xs)); xs) |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
778 |
end |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
779 |
fun boxed_datatype_constrs ext_ctxt = |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
780 |
map (apsnd (box_type ext_ctxt InConstr)) o datatype_constrs ext_ctxt |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
781 |
(* extended_context -> typ -> int *) |
33192 | 782 |
val num_datatype_constrs = length oo datatype_constrs |
783 |
||
784 |
(* string -> string *) |
|
785 |
fun constr_name_for_sel_like @{const_name fst} = @{const_name Pair} |
|
786 |
| constr_name_for_sel_like @{const_name snd} = @{const_name Pair} |
|
787 |
| constr_name_for_sel_like s' = original_name s' |
|
788 |
(* extended_context -> styp -> styp *) |
|
789 |
fun boxed_constr_for_sel ext_ctxt (s', T') = |
|
790 |
let val s = constr_name_for_sel_like s' in |
|
791 |
AList.lookup (op =) (boxed_datatype_constrs ext_ctxt (domain_type T')) s |
|
792 |
|> the |> pair s |
|
793 |
end |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
794 |
(* extended_context -> styp -> term *) |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
795 |
fun discr_term_for_constr ext_ctxt (x as (s, T)) = |
33192 | 796 |
let val dataT = body_type T in |
797 |
if s = @{const_name Suc} then |
|
798 |
Abs (Name.uu, dataT, |
|
799 |
@{const Not} $ HOLogic.mk_eq (zero_const dataT, Bound 0)) |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
800 |
else if num_datatype_constrs ext_ctxt dataT >= 2 then |
33192 | 801 |
Const (discr_for_constr x) |
802 |
else |
|
803 |
Abs (Name.uu, dataT, @{const True}) |
|
804 |
end |
|
805 |
||
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
806 |
(* extended_context -> styp -> term -> term *) |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
807 |
fun discriminate_value (ext_ctxt as {thy, ...}) (x as (_, T)) t = |
33192 | 808 |
case strip_comb t of |
809 |
(Const x', args) => |
|
810 |
if x = x' then @{const True} |
|
811 |
else if is_constr_like thy x' then @{const False} |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
812 |
else betapply (discr_term_for_constr ext_ctxt x, t) |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
813 |
| _ => betapply (discr_term_for_constr ext_ctxt x, t) |
33192 | 814 |
|
815 |
(* styp -> term -> term *) |
|
816 |
fun nth_arg_sel_term_for_constr (x as (s, T)) n = |
|
817 |
let val (arg_Ts, dataT) = strip_type T in |
|
818 |
if dataT = nat_T then |
|
819 |
@{term "%n::nat. minus_nat_inst.minus_nat n one_nat_inst.one_nat"} |
|
820 |
else if is_pair_type dataT then |
|
821 |
Const (nth_sel_for_constr x n) |
|
822 |
else |
|
823 |
let |
|
824 |
(* int -> typ -> int * term *) |
|
825 |
fun aux m (Type ("*", [T1, T2])) = |
|
826 |
let |
|
827 |
val (m, t1) = aux m T1 |
|
828 |
val (m, t2) = aux m T2 |
|
829 |
in (m, HOLogic.mk_prod (t1, t2)) end |
|
830 |
| aux m T = |
|
831 |
(m + 1, Const (nth_sel_name_for_constr_name s m, dataT --> T) |
|
832 |
$ Bound 0) |
|
833 |
val m = fold (Integer.add o num_factors_in_type) |
|
834 |
(List.take (arg_Ts, n)) 0 |
|
835 |
in Abs ("x", dataT, aux m (nth arg_Ts n) |> snd) end |
|
836 |
end |
|
837 |
(* theory -> styp -> term -> int -> typ -> term *) |
|
838 |
fun select_nth_constr_arg thy x t n res_T = |
|
839 |
case strip_comb t of |
|
840 |
(Const x', args) => |
|
841 |
if x = x' then nth args n |
|
842 |
else if is_constr_like thy x' then Const (@{const_name unknown}, res_T) |
|
843 |
else betapply (nth_arg_sel_term_for_constr x n, t) |
|
844 |
| _ => betapply (nth_arg_sel_term_for_constr x n, t) |
|
845 |
||
846 |
(* theory -> styp -> term list -> term *) |
|
847 |
fun construct_value _ x [] = Const x |
|
848 |
| construct_value thy (x as (s, _)) args = |
|
849 |
let val args = map Envir.eta_contract args in |
|
850 |
case hd args of |
|
851 |
Const (x' as (s', _)) $ t => |
|
852 |
if is_sel_like_and_no_discr s' andalso constr_name_for_sel_like s' = s |
|
853 |
andalso forall (fn (n, t') => |
|
854 |
select_nth_constr_arg thy x t n dummyT = t') |
|
855 |
(index_seq 0 (length args) ~~ args) then |
|
856 |
t |
|
857 |
else |
|
858 |
list_comb (Const x, args) |
|
859 |
| _ => list_comb (Const x, args) |
|
860 |
end |
|
861 |
||
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
862 |
(* extended_context -> typ -> term -> term *) |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
863 |
fun constr_expand (ext_ctxt as {thy, ...}) T t = |
33192 | 864 |
(case head_of t of |
865 |
Const x => if is_constr_like thy x then t else raise SAME () |
|
866 |
| _ => raise SAME ()) |
|
867 |
handle SAME () => |
|
868 |
let |
|
869 |
val x' as (_, T') = |
|
870 |
if is_pair_type T then |
|
871 |
let val (T1, T2) = HOLogic.dest_prodT T in |
|
872 |
(@{const_name Pair}, [T1, T2] ---> T) |
|
873 |
end |
|
874 |
else |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
875 |
datatype_constrs ext_ctxt T |> the_single |
33192 | 876 |
val arg_Ts = binder_types T' |
877 |
in |
|
878 |
list_comb (Const x', map2 (select_nth_constr_arg thy x' t) |
|
879 |
(index_seq 0 (length arg_Ts)) arg_Ts) |
|
880 |
end |
|
881 |
||
882 |
(* (typ * int) list -> typ -> int *) |
|
883 |
fun card_of_type asgns (Type ("fun", [T1, T2])) = |
|
884 |
reasonable_power (card_of_type asgns T2) (card_of_type asgns T1) |
|
885 |
| card_of_type asgns (Type ("*", [T1, T2])) = |
|
886 |
card_of_type asgns T1 * card_of_type asgns T2 |
|
887 |
| card_of_type _ (Type (@{type_name itself}, _)) = 1 |
|
888 |
| card_of_type _ @{typ prop} = 2 |
|
889 |
| card_of_type _ @{typ bool} = 2 |
|
890 |
| card_of_type _ @{typ unit} = 1 |
|
891 |
| card_of_type asgns T = |
|
892 |
case AList.lookup (op =) asgns T of |
|
893 |
SOME k => k |
|
894 |
| NONE => if T = @{typ bisim_iterator} then 0 |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
895 |
else raise TYPE ("Nitpick_HOL.card_of_type", [T], []) |
33192 | 896 |
(* int -> (typ * int) list -> typ -> int *) |
897 |
fun bounded_card_of_type max default_card asgns (Type ("fun", [T1, T2])) = |
|
898 |
let |
|
899 |
val k1 = bounded_card_of_type max default_card asgns T1 |
|
900 |
val k2 = bounded_card_of_type max default_card asgns T2 |
|
901 |
in |
|
902 |
if k1 = max orelse k2 = max then max |
|
903 |
else Int.min (max, reasonable_power k2 k1) |
|
904 |
end |
|
905 |
| bounded_card_of_type max default_card asgns (Type ("*", [T1, T2])) = |
|
906 |
let |
|
907 |
val k1 = bounded_card_of_type max default_card asgns T1 |
|
908 |
val k2 = bounded_card_of_type max default_card asgns T2 |
|
909 |
in if k1 = max orelse k2 = max then max else Int.min (max, k1 * k2) end |
|
910 |
| bounded_card_of_type max default_card asgns T = |
|
911 |
Int.min (max, if default_card = ~1 then |
|
912 |
card_of_type asgns T |
|
913 |
else |
|
914 |
card_of_type asgns T |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
915 |
handle TYPE ("Nitpick_HOL.card_of_type", _, _) => |
33192 | 916 |
default_card) |
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
917 |
(* extended_context -> int -> (typ * int) list -> typ -> int *) |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
918 |
fun bounded_precise_card_of_type ext_ctxt max default_card asgns T = |
33192 | 919 |
let |
920 |
(* typ list -> typ -> int *) |
|
921 |
fun aux avoid T = |
|
922 |
(if T mem avoid then |
|
923 |
0 |
|
924 |
else case T of |
|
925 |
Type ("fun", [T1, T2]) => |
|
926 |
let |
|
927 |
val k1 = aux avoid T1 |
|
928 |
val k2 = aux avoid T2 |
|
929 |
in |
|
930 |
if k1 = 0 orelse k2 = 0 then 0 |
|
931 |
else if k1 >= max orelse k2 >= max then max |
|
932 |
else Int.min (max, reasonable_power k2 k1) |
|
933 |
end |
|
934 |
| Type ("*", [T1, T2]) => |
|
935 |
let |
|
936 |
val k1 = aux avoid T1 |
|
937 |
val k2 = aux avoid T2 |
|
938 |
in |
|
939 |
if k1 = 0 orelse k2 = 0 then 0 |
|
940 |
else if k1 >= max orelse k2 >= max then max |
|
941 |
else Int.min (max, k1 * k2) |
|
942 |
end |
|
943 |
| Type (@{type_name itself}, _) => 1 |
|
944 |
| @{typ prop} => 2 |
|
945 |
| @{typ bool} => 2 |
|
946 |
| @{typ unit} => 1 |
|
947 |
| Type _ => |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
948 |
(case datatype_constrs ext_ctxt T of |
33192 | 949 |
[] => if is_integer_type T then 0 else raise SAME () |
950 |
| constrs => |
|
951 |
let |
|
952 |
val constr_cards = |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
953 |
datatype_constrs ext_ctxt T |
33192 | 954 |
|> map (Integer.prod o map (aux (T :: avoid)) o binder_types |
955 |
o snd) |
|
956 |
in |
|
957 |
if exists (equal 0) constr_cards then 0 |
|
958 |
else Integer.sum constr_cards |
|
959 |
end) |
|
960 |
| _ => raise SAME ()) |
|
961 |
handle SAME () => AList.lookup (op =) asgns T |> the_default default_card |
|
962 |
in Int.min (max, aux [] T) end |
|
963 |
||
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
964 |
(* extended_context -> typ -> bool *) |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
965 |
fun is_finite_type ext_ctxt = |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
966 |
not_equal 0 o bounded_precise_card_of_type ext_ctxt 1 2 [] |
33192 | 967 |
|
968 |
(* term -> bool *) |
|
969 |
fun is_ground_term (t1 $ t2) = is_ground_term t1 andalso is_ground_term t2 |
|
970 |
| is_ground_term (Const _) = true |
|
971 |
| is_ground_term _ = false |
|
972 |
||
973 |
(* term -> word -> word *) |
|
974 |
fun hashw_term (t1 $ t2) = Polyhash.hashw (hashw_term t1, hashw_term t2) |
|
975 |
| hashw_term (Const (s, _)) = Polyhash.hashw_string (s, 0w0) |
|
976 |
| hashw_term _ = 0w0 |
|
977 |
(* term -> int *) |
|
978 |
val hash_term = Word.toInt o hashw_term |
|
979 |
||
980 |
(* term list -> (indexname * typ) list *) |
|
981 |
fun special_bounds ts = |
|
982 |
fold Term.add_vars ts [] |> sort (TermOrd.fast_indexname_ord o pairself fst) |
|
983 |
||
984 |
(* indexname * typ -> term -> term *) |
|
985 |
fun abs_var ((s, j), T) body = Abs (s, T, abstract_over (Var ((s, j), T), body)) |
|
986 |
||
33571 | 987 |
(* theory -> string -> bool *) |
988 |
fun is_funky_typedef_name thy s = |
|
989 |
s mem [@{type_name unit}, @{type_name "*"}, @{type_name "+"}, |
|
990 |
@{type_name int}] |
|
991 |
orelse is_frac_type thy (Type (s, [])) |
|
992 |
(* theory -> term -> bool *) |
|
993 |
fun is_funky_typedef thy (Type (s, _)) = is_funky_typedef_name thy s |
|
994 |
| is_funky_typedef _ _ = false |
|
33192 | 995 |
(* term -> bool *) |
996 |
fun is_arity_type_axiom (Const (@{const_name HOL.type_class}, _) |
|
997 |
$ Const (@{const_name TYPE}, _)) = true |
|
998 |
| is_arity_type_axiom _ = false |
|
999 |
(* theory -> bool -> term -> bool *) |
|
33197
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1000 |
fun is_typedef_axiom thy boring (@{const "==>"} $ _ $ t2) = |
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1001 |
is_typedef_axiom thy boring t2 |
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1002 |
| is_typedef_axiom thy boring |
33192 | 1003 |
(@{const Trueprop} $ (Const (@{const_name Typedef.type_definition}, _) |
33197
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1004 |
$ Const (_, Type ("fun", [Type (s, _), _])) $ Const _ $ _)) = |
33571 | 1005 |
boring <> is_funky_typedef_name thy s andalso is_typedef thy s |
33192 | 1006 |
| is_typedef_axiom _ _ _ = false |
1007 |
||
1008 |
(* Distinguishes between (1) constant definition axioms, (2) type arity and |
|
1009 |
typedef axioms, and (3) other axioms, and returns the pair ((1), (3)). |
|
1010 |
Typedef axioms are uninteresting to Nitpick, because it can retrieve them |
|
1011 |
using "typedef_info". *) |
|
1012 |
(* theory -> (string * term) list -> string list -> term list * term list *) |
|
1013 |
fun partition_axioms_by_definitionality thy axioms def_names = |
|
1014 |
let |
|
1015 |
val axioms = sort (fast_string_ord o pairself fst) axioms |
|
1016 |
val defs = OrdList.inter (fast_string_ord o apsnd fst) def_names axioms |
|
1017 |
val nondefs = |
|
1018 |
OrdList.subtract (fast_string_ord o apsnd fst) def_names axioms |
|
1019 |
|> filter_out ((is_arity_type_axiom orf is_typedef_axiom thy true) o snd) |
|
1020 |
in pairself (map snd) (defs, nondefs) end |
|
1021 |
||
33197
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1022 |
(* Ideally we would check against "Complex_Main", not "Refute", but any theory |
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1023 |
will do as long as it contains all the "axioms" and "axiomatization" |
33192 | 1024 |
commands. *) |
1025 |
(* theory -> bool *) |
|
1026 |
fun is_built_in_theory thy = Theory.subthy (thy, @{theory Refute}) |
|
1027 |
||
1028 |
(* term -> bool *) |
|
1029 |
val is_plain_definition = |
|
1030 |
let |
|
1031 |
(* term -> bool *) |
|
1032 |
fun do_lhs t1 = |
|
1033 |
case strip_comb t1 of |
|
1034 |
(Const _, args) => forall is_Var args |
|
1035 |
andalso not (has_duplicates (op =) args) |
|
1036 |
| _ => false |
|
1037 |
fun do_eq (Const (@{const_name "=="}, _) $ t1 $ _) = do_lhs t1 |
|
1038 |
| do_eq (@{const Trueprop} $ (Const (@{const_name "op ="}, _) $ t1 $ _)) = |
|
1039 |
do_lhs t1 |
|
1040 |
| do_eq _ = false |
|
1041 |
in do_eq end |
|
1042 |
||
1043 |
(* theory -> term list * term list * term list *) |
|
1044 |
fun all_axioms_of thy = |
|
1045 |
let |
|
1046 |
(* theory list -> term list *) |
|
1047 |
val axioms_of_thys = maps Thm.axioms_of #> map (apsnd prop_of) |
|
1048 |
val specs = Defs.all_specifications_of (Theory.defs_of thy) |
|
33197
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1049 |
val def_names = specs |> maps snd |> filter #is_def |> map #name |
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1050 |
|> OrdList.make fast_string_ord |
33192 | 1051 |
val thys = thy :: Theory.ancestors_of thy |
1052 |
val (built_in_thys, user_thys) = List.partition is_built_in_theory thys |
|
1053 |
val built_in_axioms = axioms_of_thys built_in_thys |
|
1054 |
val user_axioms = axioms_of_thys user_thys |
|
1055 |
val (built_in_defs, built_in_nondefs) = |
|
1056 |
partition_axioms_by_definitionality thy built_in_axioms def_names |
|
33197
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1057 |
||> filter (is_typedef_axiom thy false) |
33192 | 1058 |
val (user_defs, user_nondefs) = |
1059 |
partition_axioms_by_definitionality thy user_axioms def_names |
|
33197
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1060 |
val (built_in_nondefs, user_nondefs) = |
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1061 |
List.partition (is_typedef_axiom thy false) user_nondefs |
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1062 |
|>> append built_in_nondefs |
33556
cba22e2999d5
renamed Nitpick option "coalesce_type_vars" to "merge_type_vars" (shorter) and cleaned up old hacks that are no longer necessary
blanchet
parents:
33232
diff
changeset
|
1063 |
val defs = (thy |> PureThy.all_thms_of |
33192 | 1064 |
|> filter (equal Thm.definitionK o Thm.get_kind o snd) |
1065 |
|> map (prop_of o snd) |> filter is_plain_definition) @ |
|
1066 |
user_defs @ built_in_defs |
|
1067 |
in (defs, built_in_nondefs, user_nondefs) end |
|
1068 |
||
1069 |
(* bool -> styp -> int option *) |
|
1070 |
fun arity_of_built_in_const fast_descrs (s, T) = |
|
1071 |
if s = @{const_name If} then |
|
1072 |
if nth_range_type 3 T = @{typ bool} then NONE else SOME 3 |
|
1073 |
else case AList.lookup (op =) |
|
1074 |
(built_in_consts |
|
1075 |
|> fast_descrs ? append built_in_descr_consts) s of |
|
1076 |
SOME n => SOME n |
|
1077 |
| NONE => |
|
1078 |
case AList.lookup (op =) built_in_typed_consts (s, T) of |
|
1079 |
SOME n => SOME n |
|
1080 |
| NONE => |
|
1081 |
if is_fun_type T andalso is_set_type (domain_type T) then |
|
1082 |
AList.lookup (op =) built_in_set_consts s |
|
1083 |
else |
|
1084 |
NONE |
|
1085 |
(* bool -> styp -> bool *) |
|
1086 |
val is_built_in_const = is_some oo arity_of_built_in_const |
|
1087 |
||
1088 |
(* This function is designed to work for both real definition axioms and |
|
1089 |
simplification rules (equational specifications). *) |
|
1090 |
(* term -> term *) |
|
1091 |
fun term_under_def t = |
|
1092 |
case t of |
|
1093 |
@{const "==>"} $ _ $ t2 => term_under_def t2 |
|
1094 |
| Const (@{const_name "=="}, _) $ t1 $ _ => term_under_def t1 |
|
1095 |
| @{const Trueprop} $ t1 => term_under_def t1 |
|
1096 |
| Const (@{const_name "op ="}, _) $ t1 $ _ => term_under_def t1 |
|
1097 |
| Abs (_, _, t') => term_under_def t' |
|
1098 |
| t1 $ _ => term_under_def t1 |
|
1099 |
| _ => t |
|
1100 |
||
1101 |
(* Here we crucially rely on "Refute.specialize_type" performing a preorder |
|
1102 |
traversal of the term, without which the wrong occurrence of a constant could |
|
1103 |
be matched in the face of overloading. *) |
|
1104 |
(* theory -> bool -> const_table -> styp -> term list *) |
|
1105 |
fun def_props_for_const thy fast_descrs table (x as (s, _)) = |
|
1106 |
if is_built_in_const fast_descrs x then |
|
1107 |
[] |
|
1108 |
else |
|
1109 |
these (Symtab.lookup table s) |
|
1110 |
|> map_filter (try (Refute.specialize_type thy x)) |
|
1111 |
|> filter (equal (Const x) o term_under_def) |
|
1112 |
||
1113 |
(* term -> term *) |
|
1114 |
fun normalized_rhs_of thy t = |
|
1115 |
let |
|
1116 |
(* term -> term *) |
|
1117 |
fun aux (v as Var _) t = lambda v t |
|
1118 |
| aux (c as Const (@{const_name TYPE}, T)) t = lambda c t |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
1119 |
| aux _ _ = raise TERM ("Nitpick_HOL.normalized_rhs_of", [t]) |
33192 | 1120 |
val (lhs, rhs) = |
1121 |
case t of |
|
1122 |
Const (@{const_name "=="}, _) $ t1 $ t2 => (t1, t2) |
|
1123 |
| @{const Trueprop} $ (Const (@{const_name "op ="}, _) $ t1 $ t2) => |
|
1124 |
(t1, t2) |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
1125 |
| _ => raise TERM ("Nitpick_HOL.normalized_rhs_of", [t]) |
33192 | 1126 |
val args = strip_comb lhs |> snd |
1127 |
in fold_rev aux args rhs end |
|
1128 |
||
1129 |
(* theory -> const_table -> styp -> term option *) |
|
1130 |
fun def_of_const thy table (x as (s, _)) = |
|
1131 |
if is_built_in_const false x orelse original_name s <> s then |
|
1132 |
NONE |
|
1133 |
else |
|
1134 |
x |> def_props_for_const thy false table |> List.last |
|
1135 |
|> normalized_rhs_of thy |> prefix_abs_vars s |> SOME |
|
1136 |
handle List.Empty => NONE |
|
1137 |
||
1138 |
datatype fixpoint_kind = Lfp | Gfp | NoFp |
|
1139 |
||
1140 |
(* term -> fixpoint_kind *) |
|
1141 |
fun fixpoint_kind_of_rhs (Abs (_, _, t)) = fixpoint_kind_of_rhs t |
|
1142 |
| fixpoint_kind_of_rhs (Const (@{const_name lfp}, _) $ Abs _) = Lfp |
|
1143 |
| fixpoint_kind_of_rhs (Const (@{const_name gfp}, _) $ Abs _) = Gfp |
|
1144 |
| fixpoint_kind_of_rhs _ = NoFp |
|
1145 |
||
1146 |
(* theory -> const_table -> term -> bool *) |
|
1147 |
fun is_mutually_inductive_pred_def thy table t = |
|
1148 |
let |
|
1149 |
(* term -> bool *) |
|
1150 |
fun is_good_arg (Bound _) = true |
|
1151 |
| is_good_arg (Const (s, _)) = |
|
1152 |
s mem [@{const_name True}, @{const_name False}, @{const_name undefined}] |
|
1153 |
| is_good_arg _ = false |
|
1154 |
in |
|
1155 |
case t |> strip_abs_body |> strip_comb of |
|
1156 |
(Const x, ts as (_ :: _)) => |
|
1157 |
(case def_of_const thy table x of |
|
1158 |
SOME t' => fixpoint_kind_of_rhs t' <> NoFp andalso forall is_good_arg ts |
|
1159 |
| NONE => false) |
|
1160 |
| _ => false |
|
1161 |
end |
|
1162 |
(* theory -> const_table -> term -> term *) |
|
1163 |
fun unfold_mutually_inductive_preds thy table = |
|
1164 |
map_aterms (fn t as Const x => |
|
1165 |
(case def_of_const thy table x of |
|
1166 |
SOME t' => |
|
1167 |
let val t' = Envir.eta_contract t' in |
|
1168 |
if is_mutually_inductive_pred_def thy table t' then t' |
|
1169 |
else t |
|
1170 |
end |
|
1171 |
| NONE => t) |
|
1172 |
| t => t) |
|
1173 |
||
1174 |
(* term -> string * term *) |
|
1175 |
fun pair_for_prop t = |
|
1176 |
case term_under_def t of |
|
1177 |
Const (s, _) => (s, t) |
|
1178 |
| Free _ => raise NOT_SUPPORTED "local definitions" |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
1179 |
| t' => raise TERM ("Nitpick_HOL.pair_for_prop", [t, t']) |
33192 | 1180 |
|
1181 |
(* (Proof.context -> term list) -> Proof.context -> const_table *) |
|
1182 |
fun table_for get ctxt = |
|
1183 |
get ctxt |> map pair_for_prop |> AList.group (op =) |> Symtab.make |
|
1184 |
||
1185 |
(* theory -> (string * int) list *) |
|
1186 |
fun case_const_names thy = |
|
1187 |
Symtab.fold (fn (dtype_s, {index, descr, case_name, ...}) => |
|
1188 |
if is_basic_datatype dtype_s then |
|
1189 |
I |
|
1190 |
else |
|
1191 |
cons (case_name, AList.lookup (op =) descr index |
|
1192 |
|> the |> #3 |> length)) |
|
1193 |
(Datatype.get_all thy) [] @ |
|
1194 |
map (apsnd length o snd) (#codatatypes (TheoryData.get thy)) |
|
1195 |
||
1196 |
(* Proof.context -> term list -> const_table *) |
|
1197 |
fun const_def_table ctxt ts = |
|
1198 |
table_for (map prop_of o Nitpick_Defs.get) ctxt |
|
1199 |
|> fold (fn (s, t) => Symtab.map_default (s, []) (cons t)) |
|
1200 |
(map pair_for_prop ts) |
|
1201 |
(* term list -> const_table *) |
|
1202 |
fun const_nondef_table ts = |
|
1203 |
fold (fn t => append (map (fn s => (s, t)) (Term.add_const_names t []))) ts [] |
|
1204 |
|> AList.group (op =) |> Symtab.make |
|
1205 |
(* Proof.context -> const_table *) |
|
1206 |
val const_simp_table = table_for (map prop_of o Nitpick_Simps.get) |
|
1207 |
val const_psimp_table = table_for (map prop_of o Nitpick_Psimps.get) |
|
1208 |
(* Proof.context -> const_table -> const_table *) |
|
1209 |
fun inductive_intro_table ctxt def_table = |
|
1210 |
table_for (map (unfold_mutually_inductive_preds (ProofContext.theory_of ctxt) |
|
1211 |
def_table o prop_of) |
|
1212 |
o Nitpick_Intros.get) ctxt |
|
1213 |
(* theory -> term list Inttab.table *) |
|
1214 |
fun ground_theorem_table thy = |
|
1215 |
fold ((fn @{const Trueprop} $ t1 => |
|
1216 |
is_ground_term t1 ? Inttab.map_default (hash_term t1, []) (cons t1) |
|
1217 |
| _ => I) o prop_of o snd) (PureThy.all_thms_of thy) Inttab.empty |
|
1218 |
||
1219 |
val basic_ersatz_table = |
|
1220 |
[(@{const_name prod_case}, @{const_name split}), |
|
1221 |
(@{const_name card}, @{const_name card'}), |
|
1222 |
(@{const_name setsum}, @{const_name setsum'}), |
|
1223 |
(@{const_name fold_graph}, @{const_name fold_graph'}), |
|
1224 |
(@{const_name wf}, @{const_name wf'}), |
|
1225 |
(@{const_name wf_wfrec}, @{const_name wf_wfrec'}), |
|
1226 |
(@{const_name wfrec}, @{const_name wfrec'})] |
|
1227 |
||
1228 |
(* theory -> (string * string) list *) |
|
1229 |
fun ersatz_table thy = |
|
1230 |
fold (append o snd) (#frac_types (TheoryData.get thy)) basic_ersatz_table |
|
1231 |
||
1232 |
(* const_table Unsynchronized.ref -> string -> term list -> unit *) |
|
1233 |
fun add_simps simp_table s eqs = |
|
1234 |
Unsynchronized.change simp_table |
|
1235 |
(Symtab.update (s, eqs @ these (Symtab.lookup (!simp_table) s))) |
|
1236 |
||
1237 |
(* Similar to "Refute.specialize_type" but returns all matches rather than only |
|
1238 |
the first (preorder) match. *) |
|
1239 |
(* theory -> styp -> term -> term list *) |
|
33197
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1240 |
fun multi_specialize_type thy slack (x as (s, T)) t = |
33192 | 1241 |
let |
1242 |
(* term -> (typ * term) list -> (typ * term) list *) |
|
1243 |
fun aux (Const (s', T')) ys = |
|
1244 |
if s = s' then |
|
33197
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1245 |
ys |> (if AList.defined (op =) ys T' then |
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1246 |
I |
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1247 |
else |
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1248 |
cons (T', Refute.monomorphic_term |
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1249 |
(Sign.typ_match thy (T', T) Vartab.empty) t) |
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1250 |
handle Type.TYPE_MATCH => I |
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1251 |
| Refute.REFUTE _ => |
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1252 |
if slack then |
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1253 |
I |
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1254 |
else |
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1255 |
raise NOT_SUPPORTED ("too much polymorphism in \ |
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1256 |
\axiom involving " ^ quote s)) |
33192 | 1257 |
else |
1258 |
ys |
|
1259 |
| aux _ ys = ys |
|
1260 |
in map snd (fold_aterms aux t []) end |
|
1261 |
||
33197
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1262 |
(* theory -> bool -> const_table -> styp -> term list *) |
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1263 |
fun nondef_props_for_const thy slack table (x as (s, _)) = |
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1264 |
these (Symtab.lookup table s) |> maps (multi_specialize_type thy slack x) |
33192 | 1265 |
|
1266 |
(* theory -> styp list -> term list *) |
|
1267 |
fun optimized_typedef_axioms thy (abs_s, abs_Ts) = |
|
1268 |
let val abs_T = Type (abs_s, abs_Ts) in |
|
1269 |
if is_univ_typedef thy abs_T then |
|
1270 |
[] |
|
1271 |
else case typedef_info thy abs_s of |
|
1272 |
SOME {abs_type, rep_type, Abs_name, Rep_name, prop_of_Rep, set_name, |
|
1273 |
...} => |
|
1274 |
let |
|
1275 |
val rep_T = instantiate_type thy abs_type abs_T rep_type |
|
1276 |
val rep_t = Const (Rep_name, abs_T --> rep_T) |
|
1277 |
val set_t = Const (set_name, rep_T --> bool_T) |
|
1278 |
val set_t' = |
|
1279 |
prop_of_Rep |> HOLogic.dest_Trueprop |
|
1280 |
|> Refute.specialize_type thy (dest_Const rep_t) |
|
1281 |
|> HOLogic.dest_mem |> snd |
|
1282 |
in |
|
1283 |
[HOLogic.all_const abs_T |
|
1284 |
$ Abs (Name.uu, abs_T, set_t $ (rep_t $ Bound 0))] |
|
1285 |
|> set_t <> set_t' ? cons (HOLogic.mk_eq (set_t, set_t')) |
|
1286 |
|> map HOLogic.mk_Trueprop |
|
1287 |
end |
|
1288 |
| NONE => [] |
|
1289 |
end |
|
1290 |
(* theory -> styp -> term *) |
|
1291 |
fun inverse_axiom_for_rep_fun thy (x as (_, T)) = |
|
1292 |
typedef_info thy (fst (dest_Type (domain_type T))) |
|
1293 |
|> the |> #Rep_inverse |> the |> prop_of |> Refute.specialize_type thy x |
|
1294 |
||
1295 |
(* theory -> int * styp -> term *) |
|
1296 |
fun constr_case_body thy (j, (x as (_, T))) = |
|
1297 |
let val arg_Ts = binder_types T in |
|
1298 |
list_comb (Bound j, map2 (select_nth_constr_arg thy x (Bound 0)) |
|
1299 |
(index_seq 0 (length arg_Ts)) arg_Ts) |
|
1300 |
end |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1301 |
(* extended_context -> typ -> int * styp -> term -> term *) |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1302 |
fun add_constr_case (ext_ctxt as {thy, ...}) res_T (j, x) res_t = |
33192 | 1303 |
Const (@{const_name If}, [bool_T, res_T, res_T] ---> res_T) |
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1304 |
$ discriminate_value ext_ctxt x (Bound 0) $ constr_case_body thy (j, x) |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1305 |
$ res_t |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1306 |
(* extended_context -> typ -> typ -> term *) |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1307 |
fun optimized_case_def (ext_ctxt as {thy, ...}) dataT res_T = |
33192 | 1308 |
let |
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1309 |
val xs = datatype_constrs ext_ctxt dataT |
33192 | 1310 |
val func_Ts = map ((fn T => binder_types T ---> res_T) o snd) xs |
1311 |
val (xs', x) = split_last xs |
|
1312 |
in |
|
1313 |
constr_case_body thy (1, x) |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1314 |
|> fold_rev (add_constr_case ext_ctxt res_T) (length xs downto 2 ~~ xs') |
33192 | 1315 |
|> fold_rev (curry absdummy) (func_Ts @ [dataT]) |
1316 |
end |
|
1317 |
||
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1318 |
(* extended_context -> string -> typ -> typ -> term -> term *) |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1319 |
fun optimized_record_get (ext_ctxt as {thy, ...}) s rec_T res_T t = |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1320 |
let val constr_x = the_single (datatype_constrs ext_ctxt rec_T) in |
33192 | 1321 |
case no_of_record_field thy s rec_T of |
1322 |
~1 => (case rec_T of |
|
1323 |
Type (_, Ts as _ :: _) => |
|
1324 |
let |
|
1325 |
val rec_T' = List.last Ts |
|
1326 |
val j = num_record_fields thy rec_T - 1 |
|
1327 |
in |
|
1328 |
select_nth_constr_arg thy constr_x t j res_T |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1329 |
|> optimized_record_get ext_ctxt s rec_T' res_T |
33192 | 1330 |
end |
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
1331 |
| _ => raise TYPE ("Nitpick_HOL.optimized_record_get", [rec_T], |
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
1332 |
[])) |
33192 | 1333 |
| j => select_nth_constr_arg thy constr_x t j res_T |
1334 |
end |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1335 |
(* extended_context -> string -> typ -> term -> term -> term *) |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1336 |
fun optimized_record_update (ext_ctxt as {thy, ...}) s rec_T fun_t rec_t = |
33192 | 1337 |
let |
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1338 |
val constr_x as (_, constr_T) = the_single (datatype_constrs ext_ctxt rec_T) |
33192 | 1339 |
val Ts = binder_types constr_T |
1340 |
val n = length Ts |
|
1341 |
val special_j = no_of_record_field thy s rec_T |
|
1342 |
val ts = map2 (fn j => fn T => |
|
1343 |
let |
|
1344 |
val t = select_nth_constr_arg thy constr_x rec_t j T |
|
1345 |
in |
|
1346 |
if j = special_j then |
|
1347 |
betapply (fun_t, t) |
|
1348 |
else if j = n - 1 andalso special_j = ~1 then |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1349 |
optimized_record_update ext_ctxt s |
33192 | 1350 |
(rec_T |> dest_Type |> snd |> List.last) fun_t t |
1351 |
else |
|
1352 |
t |
|
1353 |
end) (index_seq 0 n) Ts |
|
1354 |
in list_comb (Const constr_x, ts) end |
|
1355 |
||
1356 |
(* Constants "c" whose definition is of the form "c == c'", where "c'" is also a |
|
1357 |
constant, are said to be trivial. For those, we ignore the simplification |
|
1358 |
rules and use the definition instead, to ensure that built-in symbols like |
|
1359 |
"ord_nat_inst.less_eq_nat" are picked up correctly. *) |
|
1360 |
(* theory -> const_table -> styp -> bool *) |
|
1361 |
fun has_trivial_definition thy table x = |
|
1362 |
case def_of_const thy table x of SOME (Const _) => true | _ => false |
|
1363 |
||
1364 |
(* theory -> const_table -> string * typ -> fixpoint_kind *) |
|
1365 |
fun fixpoint_kind_of_const thy table x = |
|
1366 |
if is_built_in_const false x then |
|
1367 |
NoFp |
|
1368 |
else |
|
1369 |
fixpoint_kind_of_rhs (the (def_of_const thy table x)) |
|
1370 |
handle Option.Option => NoFp |
|
1371 |
||
1372 |
(* extended_context -> styp -> bool *) |
|
1373 |
fun is_real_inductive_pred ({thy, fast_descrs, def_table, intro_table, ...} |
|
1374 |
: extended_context) x = |
|
1375 |
not (null (def_props_for_const thy fast_descrs intro_table x)) |
|
1376 |
andalso fixpoint_kind_of_const thy def_table x <> NoFp |
|
1377 |
fun is_real_equational_fun ({thy, fast_descrs, simp_table, psimp_table, ...} |
|
1378 |
: extended_context) x = |
|
1379 |
exists (fn table => not (null (def_props_for_const thy fast_descrs table x))) |
|
1380 |
[!simp_table, psimp_table] |
|
1381 |
fun is_inductive_pred ext_ctxt = |
|
1382 |
is_real_inductive_pred ext_ctxt andf (not o is_real_equational_fun ext_ctxt) |
|
1383 |
fun is_equational_fun (ext_ctxt as {thy, def_table, ...}) = |
|
1384 |
(is_real_equational_fun ext_ctxt orf is_real_inductive_pred ext_ctxt |
|
1385 |
orf (String.isPrefix ubfp_prefix orf String.isPrefix lbfp_prefix) o fst) |
|
1386 |
andf (not o has_trivial_definition thy def_table) |
|
1387 |
||
1388 |
(* term * term -> term *) |
|
1389 |
fun s_betapply (Const (@{const_name If}, _) $ @{const True} $ t, _) = t |
|
1390 |
| s_betapply (Const (@{const_name If}, _) $ @{const False} $ _, t) = t |
|
1391 |
| s_betapply p = betapply p |
|
1392 |
(* term * term list -> term *) |
|
1393 |
val s_betapplys = Library.foldl s_betapply |
|
1394 |
||
1395 |
(* term -> term *) |
|
1396 |
fun lhs_of_equation t = |
|
1397 |
case t of |
|
1398 |
Const (@{const_name all}, _) $ Abs (_, _, t1) => lhs_of_equation t1 |
|
1399 |
| Const (@{const_name "=="}, _) $ t1 $ _ => SOME t1 |
|
1400 |
| @{const "==>"} $ _ $ t2 => lhs_of_equation t2 |
|
1401 |
| @{const Trueprop} $ t1 => lhs_of_equation t1 |
|
1402 |
| Const (@{const_name All}, _) $ Abs (_, _, t1) => lhs_of_equation t1 |
|
1403 |
| Const (@{const_name "op ="}, _) $ t1 $ _ => SOME t1 |
|
1404 |
| @{const "op -->"} $ _ $ t2 => lhs_of_equation t2 |
|
1405 |
| _ => NONE |
|
1406 |
(* theory -> term -> bool *) |
|
1407 |
fun is_constr_pattern _ (Bound _) = true |
|
1408 |
| is_constr_pattern thy t = |
|
1409 |
case strip_comb t of |
|
1410 |
(Const (x as (s, _)), args) => |
|
1411 |
is_constr_like thy x andalso forall (is_constr_pattern thy) args |
|
1412 |
| _ => false |
|
1413 |
fun is_constr_pattern_lhs thy t = |
|
1414 |
forall (is_constr_pattern thy) (snd (strip_comb t)) |
|
1415 |
fun is_constr_pattern_formula thy t = |
|
1416 |
case lhs_of_equation t of |
|
1417 |
SOME t' => is_constr_pattern_lhs thy t' |
|
1418 |
| NONE => false |
|
1419 |
||
1420 |
val unfold_max_depth = 63 |
|
1421 |
val axioms_max_depth = 63 |
|
1422 |
||
1423 |
(* extended_context -> term -> term *) |
|
1424 |
fun unfold_defs_in_term (ext_ctxt as {thy, destroy_constrs, fast_descrs, |
|
1425 |
case_names, def_table, ground_thm_table, |
|
1426 |
ersatz_table, ...}) = |
|
1427 |
let |
|
1428 |
(* int -> typ list -> term -> term *) |
|
1429 |
fun do_term depth Ts t = |
|
1430 |
case t of |
|
1431 |
(t0 as Const (@{const_name Int.number_class.number_of}, |
|
1432 |
Type ("fun", [_, ran_T]))) $ t1 => |
|
1433 |
((if is_number_type thy ran_T then |
|
1434 |
let |
|
1435 |
val j = t1 |> HOLogic.dest_numeral |
|
1436 |
|> ran_T <> int_T ? curry Int.max 0 |
|
1437 |
val s = numeral_prefix ^ signed_string_of_int j |
|
1438 |
in |
|
1439 |
if is_integer_type ran_T then |
|
1440 |
Const (s, ran_T) |
|
1441 |
else |
|
1442 |
do_term depth Ts (Const (@{const_name of_int}, int_T --> ran_T) |
|
1443 |
$ Const (s, int_T)) |
|
1444 |
end |
|
1445 |
handle TERM _ => raise SAME () |
|
1446 |
else |
|
1447 |
raise SAME ()) |
|
1448 |
handle SAME () => betapply (do_term depth Ts t0, do_term depth Ts t1)) |
|
1449 |
| Const (@{const_name refl_on}, T) $ Const (@{const_name UNIV}, _) $ t2 => |
|
1450 |
do_const depth Ts t (@{const_name refl'}, range_type T) [t2] |
|
1451 |
| (t0 as Const (x as (@{const_name Sigma}, T))) $ t1 |
|
1452 |
$ (t2 as Abs (_, _, t2')) => |
|
1453 |
betapplys (t0 |> loose_bvar1 (t2', 0) ? do_term depth Ts, |
|
1454 |
map (do_term depth Ts) [t1, t2]) |
|
1455 |
| Const (x as (@{const_name distinct}, |
|
1456 |
Type ("fun", [Type (@{type_name list}, [T']), _]))) |
|
1457 |
$ (t1 as _ $ _) => |
|
1458 |
(t1 |> HOLogic.dest_list |> distinctness_formula T' |
|
1459 |
handle TERM _ => do_const depth Ts t x [t1]) |
|
1460 |
| (t0 as Const (x as (@{const_name If}, _))) $ t1 $ t2 $ t3 => |
|
1461 |
if is_ground_term t1 |
|
1462 |
andalso exists (Pattern.matches thy o rpair t1) |
|
1463 |
(Inttab.lookup_list ground_thm_table |
|
1464 |
(hash_term t1)) then |
|
1465 |
do_term depth Ts t2 |
|
1466 |
else |
|
1467 |
do_const depth Ts t x [t1, t2, t3] |
|
1468 |
| Const x $ t1 $ t2 $ t3 => do_const depth Ts t x [t1, t2, t3] |
|
1469 |
| Const x $ t1 $ t2 => do_const depth Ts t x [t1, t2] |
|
1470 |
| Const x $ t1 => do_const depth Ts t x [t1] |
|
1471 |
| Const x => do_const depth Ts t x [] |
|
1472 |
| t1 $ t2 => betapply (do_term depth Ts t1, do_term depth Ts t2) |
|
1473 |
| Free _ => t |
|
1474 |
| Var _ => t |
|
1475 |
| Bound _ => t |
|
1476 |
| Abs (s, T, body) => Abs (s, T, do_term depth (T :: Ts) body) |
|
1477 |
(* int -> typ list -> styp -> term list -> int -> typ -> term * term list *) |
|
1478 |
and select_nth_constr_arg_with_args _ _ (x as (_, T)) [] n res_T = |
|
1479 |
(Abs (Name.uu, body_type T, |
|
1480 |
select_nth_constr_arg thy x (Bound 0) n res_T), []) |
|
1481 |
| select_nth_constr_arg_with_args depth Ts x (t :: ts) n res_T = |
|
1482 |
(select_nth_constr_arg thy x (do_term depth Ts t) n res_T, ts) |
|
1483 |
(* int -> typ list -> term -> styp -> term list -> term *) |
|
1484 |
and do_const depth Ts t (x as (s, T)) ts = |
|
1485 |
case AList.lookup (op =) ersatz_table s of |
|
1486 |
SOME s' => |
|
1487 |
do_const (depth + 1) Ts (list_comb (Const (s', T), ts)) (s', T) ts |
|
1488 |
| NONE => |
|
1489 |
let |
|
1490 |
val (const, ts) = |
|
1491 |
if is_built_in_const fast_descrs x then |
|
1492 |
if s = @{const_name finite} then |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1493 |
if is_finite_type ext_ctxt (domain_type T) then |
33192 | 1494 |
(Abs ("A", domain_type T, @{const True}), ts) |
1495 |
else case ts of |
|
1496 |
[Const (@{const_name UNIV}, _)] => (@{const False}, []) |
|
1497 |
| _ => (Const x, ts) |
|
1498 |
else |
|
1499 |
(Const x, ts) |
|
1500 |
else case AList.lookup (op =) case_names s of |
|
1501 |
SOME n => |
|
1502 |
let |
|
1503 |
val (dataT, res_T) = nth_range_type n T |
|
1504 |
|> domain_type pairf range_type |
|
1505 |
in |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1506 |
(optimized_case_def ext_ctxt dataT res_T |
33192 | 1507 |
|> do_term (depth + 1) Ts, ts) |
1508 |
end |
|
1509 |
| _ => |
|
1510 |
if is_constr thy x then |
|
1511 |
(Const x, ts) |
|
33581
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
1512 |
else if is_stale_constr thy x then |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
1513 |
raise NOT_SUPPORTED ("(non-co-)constructors of codatatypes \ |
e1e77265fb1d
added possibility to register datatypes as codatatypes in Nitpick;
blanchet
parents:
33580
diff
changeset
|
1514 |
\(\"" ^ s ^ "\")") |
33192 | 1515 |
else if is_record_get thy x then |
1516 |
case length ts of |
|
1517 |
0 => (do_term depth Ts (eta_expand Ts t 1), []) |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1518 |
| _ => (optimized_record_get ext_ctxt s (domain_type T) |
33192 | 1519 |
(range_type T) (hd ts), tl ts) |
1520 |
else if is_record_update thy x then |
|
1521 |
case length ts of |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1522 |
2 => (optimized_record_update ext_ctxt |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1523 |
(unsuffix Record.updateN s) (nth_range_type 2 T) |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1524 |
(do_term depth Ts (hd ts)) |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1525 |
(do_term depth Ts (nth ts 1)), []) |
33192 | 1526 |
| n => (do_term depth Ts (eta_expand Ts t (2 - n)), []) |
1527 |
else if is_rep_fun thy x then |
|
1528 |
let val x' = mate_of_rep_fun thy x in |
|
1529 |
if is_constr thy x' then |
|
1530 |
select_nth_constr_arg_with_args depth Ts x' ts 0 |
|
1531 |
(range_type T) |
|
1532 |
else |
|
1533 |
(Const x, ts) |
|
1534 |
end |
|
1535 |
else if is_equational_fun ext_ctxt x then |
|
1536 |
(Const x, ts) |
|
1537 |
else case def_of_const thy def_table x of |
|
1538 |
SOME def => |
|
1539 |
if depth > unfold_max_depth then |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
1540 |
raise LIMIT ("Nitpick_HOL.unfold_defs_in_term", |
33192 | 1541 |
"too many nested definitions (" ^ |
1542 |
string_of_int depth ^ ") while expanding " ^ |
|
1543 |
quote s) |
|
1544 |
else if s = @{const_name wfrec'} then |
|
1545 |
(do_term (depth + 1) Ts (betapplys (def, ts)), []) |
|
1546 |
else |
|
1547 |
(do_term (depth + 1) Ts def, ts) |
|
1548 |
| NONE => (Const x, ts) |
|
1549 |
in s_betapplys (const, map (do_term depth Ts) ts) |> Envir.beta_norm end |
|
1550 |
in do_term 0 [] end |
|
1551 |
||
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1552 |
(* extended_context -> typ -> term list *) |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1553 |
fun codatatype_bisim_axioms (ext_ctxt as {thy, ...}) T = |
33192 | 1554 |
let |
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1555 |
val xs = datatype_constrs ext_ctxt T |
33192 | 1556 |
val set_T = T --> bool_T |
1557 |
val iter_T = @{typ bisim_iterator} |
|
1558 |
val bisim_const = Const (@{const_name bisim}, [iter_T, T, T] ---> bool_T) |
|
1559 |
val bisim_max = @{const bisim_iterator_max} |
|
1560 |
val n_var = Var (("n", 0), iter_T) |
|
1561 |
val n_var_minus_1 = |
|
1562 |
Const (@{const_name Tha}, (iter_T --> bool_T) --> iter_T) |
|
1563 |
$ Abs ("m", iter_T, HOLogic.eq_const iter_T |
|
1564 |
$ (suc_const iter_T $ Bound 0) $ n_var) |
|
1565 |
val x_var = Var (("x", 0), T) |
|
1566 |
val y_var = Var (("y", 0), T) |
|
1567 |
(* styp -> int -> typ -> term *) |
|
1568 |
fun nth_sub_bisim x n nth_T = |
|
1569 |
(if is_codatatype thy nth_T then bisim_const $ n_var_minus_1 |
|
1570 |
else HOLogic.eq_const nth_T) |
|
1571 |
$ select_nth_constr_arg thy x x_var n nth_T |
|
1572 |
$ select_nth_constr_arg thy x y_var n nth_T |
|
1573 |
(* styp -> term *) |
|
1574 |
fun case_func (x as (_, T)) = |
|
1575 |
let |
|
1576 |
val arg_Ts = binder_types T |
|
1577 |
val core_t = |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1578 |
discriminate_value ext_ctxt x y_var :: |
33192 | 1579 |
map2 (nth_sub_bisim x) (index_seq 0 (length arg_Ts)) arg_Ts |
1580 |
|> foldr1 s_conj |
|
1581 |
in List.foldr absdummy core_t arg_Ts end |
|
1582 |
in |
|
1583 |
[HOLogic.eq_const bool_T $ (bisim_const $ n_var $ x_var $ y_var) |
|
1584 |
$ (@{term "op |"} $ (HOLogic.eq_const iter_T $ n_var $ zero_const iter_T) |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1585 |
$ (betapplys (optimized_case_def ext_ctxt T bool_T, |
33192 | 1586 |
map case_func xs @ [x_var]))), |
1587 |
HOLogic.eq_const set_T $ (bisim_const $ bisim_max $ x_var) |
|
1588 |
$ (Const (@{const_name insert}, [T, set_T] ---> set_T) |
|
1589 |
$ x_var $ Const (@{const_name bot_fun_inst.bot_fun}, set_T))] |
|
1590 |
|> map HOLogic.mk_Trueprop |
|
1591 |
end |
|
1592 |
||
1593 |
exception NO_TRIPLE of unit |
|
1594 |
||
1595 |
(* theory -> styp -> term -> term list * term list * term *) |
|
1596 |
fun triple_for_intro_rule thy x t = |
|
1597 |
let |
|
1598 |
val prems = Logic.strip_imp_prems t |> map (ObjectLogic.atomize_term thy) |
|
1599 |
val concl = Logic.strip_imp_concl t |> ObjectLogic.atomize_term thy |
|
1600 |
val (main, side) = List.partition (exists_Const (equal x)) prems |
|
1601 |
(* term -> bool *) |
|
1602 |
val is_good_head = equal (Const x) o head_of |
|
1603 |
in |
|
1604 |
if forall is_good_head main then (side, main, concl) else raise NO_TRIPLE () |
|
1605 |
end |
|
1606 |
||
1607 |
(* term -> term *) |
|
1608 |
val tuple_for_args = HOLogic.mk_tuple o snd o strip_comb |
|
1609 |
||
1610 |
(* indexname * typ -> term list -> term -> term -> term *) |
|
1611 |
fun wf_constraint_for rel side concl main = |
|
1612 |
let |
|
1613 |
val core = HOLogic.mk_mem (HOLogic.mk_prod (tuple_for_args main, |
|
1614 |
tuple_for_args concl), Var rel) |
|
1615 |
val t = List.foldl HOLogic.mk_imp core side |
|
1616 |
val vars = filter (not_equal rel) (Term.add_vars t []) |
|
1617 |
in |
|
1618 |
Library.foldl (fn (t', ((x, j), T)) => |
|
1619 |
HOLogic.all_const T |
|
1620 |
$ Abs (x, T, abstract_over (Var ((x, j), T), t'))) |
|
1621 |
(t, vars) |
|
1622 |
end |
|
1623 |
||
1624 |
(* indexname * typ -> term list * term list * term -> term *) |
|
1625 |
fun wf_constraint_for_triple rel (side, main, concl) = |
|
1626 |
map (wf_constraint_for rel side concl) main |> foldr1 s_conj |
|
1627 |
||
1628 |
(* Proof.context -> Time.time option -> thm |
|
1629 |
-> (Proof.context -> tactic -> tactic) -> bool *) |
|
1630 |
fun terminates_by ctxt timeout goal tac = |
|
1631 |
can (SINGLE (Classical.safe_tac (claset_of ctxt)) #> the |
|
1632 |
#> SINGLE (DETERM_TIMEOUT timeout |
|
1633 |
(tac ctxt (auto_tac (clasimpset_of ctxt)))) |
|
1634 |
#> the #> Goal.finish ctxt) goal |
|
1635 |
||
33557
107f3df799f6
clean Nitpick's wellfoundedness cache once in a while, to avoid potential memory leak
blanchet
parents:
33556
diff
changeset
|
1636 |
val max_cached_wfs = 100 |
33192 | 1637 |
val cached_timeout = Unsynchronized.ref (SOME Time.zeroTime) |
1638 |
val cached_wf_props : (term * bool) list Unsynchronized.ref = |
|
1639 |
Unsynchronized.ref [] |
|
1640 |
||
33351 | 1641 |
val termination_tacs = [Lexicographic_Order.lex_order_tac true, |
33192 | 1642 |
ScnpReconstruct.sizechange_tac] |
1643 |
||
1644 |
(* extended_context -> const_table -> styp -> bool *) |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1645 |
fun uncached_is_well_founded_inductive_pred |
33192 | 1646 |
({thy, ctxt, debug, fast_descrs, tac_timeout, intro_table, ...} |
1647 |
: extended_context) (x as (_, T)) = |
|
1648 |
case def_props_for_const thy fast_descrs intro_table x of |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1649 |
[] => raise TERM ("Nitpick_HOL.uncached_is_well_founded_inductive", |
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
1650 |
[Const x]) |
33192 | 1651 |
| intro_ts => |
1652 |
(case map (triple_for_intro_rule thy x) intro_ts |
|
1653 |
|> filter_out (null o #2) of |
|
1654 |
[] => true |
|
1655 |
| triples => |
|
1656 |
let |
|
1657 |
val binders_T = HOLogic.mk_tupleT (binder_types T) |
|
1658 |
val rel_T = HOLogic.mk_prodT (binders_T, binders_T) --> bool_T |
|
1659 |
val j = List.foldl Int.max 0 (map maxidx_of_term intro_ts) + 1 |
|
1660 |
val rel = (("R", j), rel_T) |
|
1661 |
val prop = Const (@{const_name wf}, rel_T --> bool_T) $ Var rel :: |
|
1662 |
map (wf_constraint_for_triple rel) triples |
|
1663 |
|> foldr1 s_conj |> HOLogic.mk_Trueprop |
|
1664 |
val _ = if debug then |
|
1665 |
priority ("Wellfoundedness goal: " ^ |
|
1666 |
Syntax.string_of_term ctxt prop ^ ".") |
|
1667 |
else |
|
1668 |
() |
|
1669 |
in |
|
33557
107f3df799f6
clean Nitpick's wellfoundedness cache once in a while, to avoid potential memory leak
blanchet
parents:
33556
diff
changeset
|
1670 |
if tac_timeout = (!cached_timeout) |
107f3df799f6
clean Nitpick's wellfoundedness cache once in a while, to avoid potential memory leak
blanchet
parents:
33556
diff
changeset
|
1671 |
andalso length (!cached_wf_props) < max_cached_wfs then |
107f3df799f6
clean Nitpick's wellfoundedness cache once in a while, to avoid potential memory leak
blanchet
parents:
33556
diff
changeset
|
1672 |
() |
107f3df799f6
clean Nitpick's wellfoundedness cache once in a while, to avoid potential memory leak
blanchet
parents:
33556
diff
changeset
|
1673 |
else |
107f3df799f6
clean Nitpick's wellfoundedness cache once in a while, to avoid potential memory leak
blanchet
parents:
33556
diff
changeset
|
1674 |
(cached_wf_props := []; cached_timeout := tac_timeout); |
33192 | 1675 |
case AList.lookup (op =) (!cached_wf_props) prop of |
1676 |
SOME wf => wf |
|
1677 |
| NONE => |
|
1678 |
let |
|
1679 |
val goal = prop |> cterm_of thy |> Goal.init |
|
1680 |
val wf = silence (exists (terminates_by ctxt tac_timeout goal)) |
|
1681 |
termination_tacs |
|
1682 |
in Unsynchronized.change cached_wf_props (cons (prop, wf)); wf end |
|
1683 |
end) |
|
1684 |
handle List.Empty => false |
|
1685 |
| NO_TRIPLE () => false |
|
1686 |
||
1687 |
(* The type constraint below is a workaround for a Poly/ML bug. *) |
|
1688 |
||
1689 |
(* extended_context -> styp -> bool *) |
|
1690 |
fun is_well_founded_inductive_pred |
|
1691 |
(ext_ctxt as {thy, wfs, def_table, wf_cache, ...} : extended_context) |
|
1692 |
(x as (s, _)) = |
|
1693 |
case triple_lookup (const_match thy) wfs x of |
|
1694 |
SOME (SOME b) => b |
|
33197
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
1695 |
| _ => s mem [@{const_name Nats}, @{const_name fold_graph'}] |
33192 | 1696 |
orelse case AList.lookup (op =) (!wf_cache) x of |
1697 |
SOME (_, wf) => wf |
|
1698 |
| NONE => |
|
1699 |
let |
|
1700 |
val gfp = (fixpoint_kind_of_const thy def_table x = Gfp) |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
1701 |
val wf = uncached_is_well_founded_inductive_pred ext_ctxt x |
33192 | 1702 |
in |
1703 |
Unsynchronized.change wf_cache (cons (x, (gfp, wf))); wf |
|
1704 |
end |
|
1705 |
||
1706 |
(* typ list -> typ -> typ -> term -> term *) |
|
1707 |
fun ap_curry [_] _ _ t = t |
|
1708 |
| ap_curry arg_Ts tuple_T body_T t = |
|
1709 |
let val n = length arg_Ts in |
|
1710 |
list_abs (map (pair "c") arg_Ts, |
|
1711 |
incr_boundvars n t |
|
1712 |
$ mk_flat_tuple tuple_T (map Bound (n - 1 downto 0))) |
|
1713 |
end |
|
1714 |
||
1715 |
(* int -> term -> int *) |
|
1716 |
fun num_occs_of_bound_in_term j (t1 $ t2) = |
|
1717 |
op + (pairself (num_occs_of_bound_in_term j) (t1, t2)) |
|
1718 |
| num_occs_of_bound_in_term j (Abs (s, T, t')) = |
|
1719 |
num_occs_of_bound_in_term (j + 1) t' |
|
1720 |
| num_occs_of_bound_in_term j (Bound j') = if j' = j then 1 else 0 |
|
1721 |
| num_occs_of_bound_in_term _ _ = 0 |
|
1722 |
||
1723 |
(* term -> bool *) |
|
1724 |
val is_linear_inductive_pred_def = |
|
1725 |
let |
|
1726 |
(* int -> term -> bool *) |
|
1727 |
fun do_disjunct j (Const (@{const_name Ex}, _) $ Abs (_, _, t2)) = |
|
1728 |
do_disjunct (j + 1) t2 |
|
1729 |
| do_disjunct j t = |
|
1730 |
case num_occs_of_bound_in_term j t of |
|
1731 |
0 => true |
|
1732 |
| 1 => exists (equal (Bound j) o head_of) (conjuncts t) |
|
1733 |
| _ => false |
|
1734 |
(* term -> bool *) |
|
1735 |
fun do_lfp_def (Const (@{const_name lfp}, _) $ t2) = |
|
1736 |
let val (xs, body) = strip_abs t2 in |
|
1737 |
case length xs of |
|
1738 |
1 => false |
|
1739 |
| n => forall (do_disjunct (n - 1)) (disjuncts body) |
|
1740 |
end |
|
1741 |
| do_lfp_def _ = false |
|
1742 |
in do_lfp_def o strip_abs_body end |
|
1743 |
||
1744 |
(* typ -> typ -> term -> term *) |
|
1745 |
fun ap_split tuple_T = |
|
1746 |
HOLogic.mk_psplits (HOLogic.flat_tupleT_paths tuple_T) tuple_T |
|
1747 |
||
1748 |
(* term -> term * term *) |
|
1749 |
val linear_pred_base_and_step_rhss = |
|
1750 |
let |
|
1751 |
(* term -> term *) |
|
1752 |
fun aux (Const (@{const_name lfp}, _) $ t2) = |
|
1753 |
let |
|
1754 |
val (xs, body) = strip_abs t2 |
|
1755 |
val arg_Ts = map snd (tl xs) |
|
1756 |
val tuple_T = HOLogic.mk_tupleT arg_Ts |
|
1757 |
val j = length arg_Ts |
|
1758 |
(* int -> term -> term *) |
|
1759 |
fun repair_rec j (Const (@{const_name Ex}, T1) $ Abs (s2, T2, t2')) = |
|
1760 |
Const (@{const_name Ex}, T1) |
|
1761 |
$ Abs (s2, T2, repair_rec (j + 1) t2') |
|
1762 |
| repair_rec j (@{const "op &"} $ t1 $ t2) = |
|
1763 |
@{const "op &"} $ repair_rec j t1 $ repair_rec j t2 |
|
1764 |
| repair_rec j t = |
|
1765 |
let val (head, args) = strip_comb t in |
|
1766 |
if head = Bound j then |
|
1767 |
HOLogic.eq_const tuple_T $ Bound j |
|
1768 |
$ mk_flat_tuple tuple_T args |
|
1769 |
else |
|
1770 |
t |
|
1771 |
end |
|
1772 |
val (nonrecs, recs) = |
|
1773 |
List.partition (equal 0 o num_occs_of_bound_in_term j) |
|
1774 |
(disjuncts body) |
|
1775 |
val base_body = nonrecs |> List.foldl s_disj @{const False} |
|
1776 |
val step_body = recs |> map (repair_rec j) |
|
1777 |
|> List.foldl s_disj @{const False} |
|
1778 |
in |
|
1779 |
(list_abs (tl xs, incr_bv (~1, j, base_body)) |
|
1780 |
|> ap_split tuple_T bool_T, |
|
1781 |
Abs ("y", tuple_T, list_abs (tl xs, step_body) |
|
1782 |
|> ap_split tuple_T bool_T)) |
|
1783 |
end |
|
1784 |
| aux t = |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
1785 |
raise TERM ("Nitpick_HOL.linear_pred_base_and_step_rhss.aux", [t]) |
33192 | 1786 |
in aux end |
1787 |
||
1788 |
(* extended_context -> styp -> term -> term *) |
|
1789 |
fun closed_linear_pred_const (ext_ctxt as {simp_table, ...}) (x as (s, T)) def = |
|
1790 |
let |
|
1791 |
val j = maxidx_of_term def + 1 |
|
1792 |
val (outer, fp_app) = strip_abs def |
|
1793 |
val outer_bounds = map Bound (length outer - 1 downto 0) |
|
1794 |
val outer_vars = map (fn (s, T) => Var ((s, j), T)) outer |
|
1795 |
val fp_app = subst_bounds (rev outer_vars, fp_app) |
|
1796 |
val (outer_Ts, rest_T) = strip_n_binders (length outer) T |
|
1797 |
val tuple_arg_Ts = strip_type rest_T |> fst |
|
1798 |
val tuple_T = HOLogic.mk_tupleT tuple_arg_Ts |
|
1799 |
val set_T = tuple_T --> bool_T |
|
1800 |
val curried_T = tuple_T --> set_T |
|
1801 |
val uncurried_T = Type ("*", [tuple_T, tuple_T]) --> bool_T |
|
1802 |
val (base_rhs, step_rhs) = linear_pred_base_and_step_rhss fp_app |
|
1803 |
val base_x as (base_s, _) = (base_prefix ^ s, outer_Ts ---> set_T) |
|
1804 |
val base_eq = HOLogic.mk_eq (list_comb (Const base_x, outer_vars), base_rhs) |
|
1805 |
|> HOLogic.mk_Trueprop |
|
1806 |
val _ = add_simps simp_table base_s [base_eq] |
|
1807 |
val step_x as (step_s, _) = (step_prefix ^ s, outer_Ts ---> curried_T) |
|
1808 |
val step_eq = HOLogic.mk_eq (list_comb (Const step_x, outer_vars), step_rhs) |
|
1809 |
|> HOLogic.mk_Trueprop |
|
1810 |
val _ = add_simps simp_table step_s [step_eq] |
|
1811 |
in |
|
1812 |
list_abs (outer, |
|
1813 |
Const (@{const_name Image}, uncurried_T --> set_T --> set_T) |
|
1814 |
$ (Const (@{const_name rtrancl}, uncurried_T --> uncurried_T) |
|
1815 |
$ (Const (@{const_name split}, curried_T --> uncurried_T) |
|
1816 |
$ list_comb (Const step_x, outer_bounds))) |
|
1817 |
$ list_comb (Const base_x, outer_bounds) |
|
1818 |
|> ap_curry tuple_arg_Ts tuple_T bool_T) |
|
1819 |
|> unfold_defs_in_term ext_ctxt |
|
1820 |
end |
|
1821 |
||
1822 |
(* extended_context -> bool -> styp -> term *) |
|
1823 |
fun unrolled_inductive_pred_const (ext_ctxt as {thy, star_linear_preds, |
|
1824 |
def_table, simp_table, ...}) |
|
1825 |
gfp (x as (s, T)) = |
|
1826 |
let |
|
1827 |
val iter_T = iterator_type_for_const gfp x |
|
1828 |
val x' as (s', _) = (unrolled_prefix ^ s, iter_T --> T) |
|
1829 |
val unrolled_const = Const x' $ zero_const iter_T |
|
1830 |
val def = the (def_of_const thy def_table x) |
|
1831 |
in |
|
1832 |
if is_equational_fun ext_ctxt x' then |
|
1833 |
unrolled_const (* already done *) |
|
1834 |
else if not gfp andalso is_linear_inductive_pred_def def |
|
1835 |
andalso star_linear_preds then |
|
1836 |
closed_linear_pred_const ext_ctxt x def |
|
1837 |
else |
|
1838 |
let |
|
1839 |
val j = maxidx_of_term def + 1 |
|
1840 |
val (outer, fp_app) = strip_abs def |
|
1841 |
val outer_bounds = map Bound (length outer - 1 downto 0) |
|
1842 |
val cur = Var ((iter_var_prefix, j + 1), iter_T) |
|
1843 |
val next = suc_const iter_T $ cur |
|
1844 |
val rhs = case fp_app of |
|
1845 |
Const _ $ t => |
|
1846 |
betapply (t, list_comb (Const x', next :: outer_bounds)) |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
1847 |
| _ => raise TERM ("Nitpick_HOL.unrolled_inductive_pred_\ |
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
1848 |
\const", [fp_app]) |
33192 | 1849 |
val (inner, naked_rhs) = strip_abs rhs |
1850 |
val all = outer @ inner |
|
1851 |
val bounds = map Bound (length all - 1 downto 0) |
|
1852 |
val vars = map (fn (s, T) => Var ((s, j), T)) all |
|
1853 |
val eq = HOLogic.mk_eq (list_comb (Const x', cur :: bounds), naked_rhs) |
|
1854 |
|> HOLogic.mk_Trueprop |> curry subst_bounds (rev vars) |
|
1855 |
val _ = add_simps simp_table s' [eq] |
|
1856 |
in unrolled_const end |
|
1857 |
end |
|
1858 |
||
1859 |
(* extended_context -> styp -> term *) |
|
1860 |
fun raw_inductive_pred_axiom ({thy, def_table, ...} : extended_context) x = |
|
1861 |
let |
|
1862 |
val def = the (def_of_const thy def_table x) |
|
1863 |
val (outer, fp_app) = strip_abs def |
|
1864 |
val outer_bounds = map Bound (length outer - 1 downto 0) |
|
1865 |
val rhs = case fp_app of |
|
1866 |
Const _ $ t => betapply (t, list_comb (Const x, outer_bounds)) |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
1867 |
| _ => raise TERM ("Nitpick_HOL.raw_inductive_pred_axiom", |
33192 | 1868 |
[fp_app]) |
1869 |
val (inner, naked_rhs) = strip_abs rhs |
|
1870 |
val all = outer @ inner |
|
1871 |
val bounds = map Bound (length all - 1 downto 0) |
|
1872 |
val j = maxidx_of_term def + 1 |
|
1873 |
val vars = map (fn (s, T) => Var ((s, j), T)) all |
|
1874 |
in |
|
1875 |
HOLogic.mk_eq (list_comb (Const x, bounds), naked_rhs) |
|
1876 |
|> HOLogic.mk_Trueprop |> curry subst_bounds (rev vars) |
|
1877 |
end |
|
1878 |
fun inductive_pred_axiom ext_ctxt (x as (s, T)) = |
|
1879 |
if String.isPrefix ubfp_prefix s orelse String.isPrefix lbfp_prefix s then |
|
1880 |
let val x' = (after_name_sep s, T) in |
|
1881 |
raw_inductive_pred_axiom ext_ctxt x' |> subst_atomic [(Const x', Const x)] |
|
1882 |
end |
|
1883 |
else |
|
1884 |
raw_inductive_pred_axiom ext_ctxt x |
|
1885 |
||
1886 |
(* extended_context -> styp -> term list *) |
|
1887 |
fun raw_equational_fun_axioms (ext_ctxt as {thy, fast_descrs, simp_table, |
|
1888 |
psimp_table, ...}) (x as (s, _)) = |
|
33556
cba22e2999d5
renamed Nitpick option "coalesce_type_vars" to "merge_type_vars" (shorter) and cleaned up old hacks that are no longer necessary
blanchet
parents:
33232
diff
changeset
|
1889 |
case def_props_for_const thy fast_descrs (!simp_table) x of |
33192 | 1890 |
[] => (case def_props_for_const thy fast_descrs psimp_table x of |
1891 |
[] => [inductive_pred_axiom ext_ctxt x] |
|
1892 |
| psimps => psimps) |
|
1893 |
| simps => simps |
|
1894 |
||
1895 |
val equational_fun_axioms = map extensionalize oo raw_equational_fun_axioms |
|
1896 |
||
1897 |
(* term list -> term list *) |
|
33556
cba22e2999d5
renamed Nitpick option "coalesce_type_vars" to "merge_type_vars" (shorter) and cleaned up old hacks that are no longer necessary
blanchet
parents:
33232
diff
changeset
|
1898 |
fun merge_type_vars_in_terms ts = |
33192 | 1899 |
let |
1900 |
(* typ -> (sort * string) list -> (sort * string) list *) |
|
1901 |
fun add_type (TFree (s, S)) table = |
|
1902 |
(case AList.lookup (op =) table S of |
|
1903 |
SOME s' => |
|
1904 |
if string_ord (s', s) = LESS then AList.update (op =) (S, s') table |
|
1905 |
else table |
|
1906 |
| NONE => (S, s) :: table) |
|
1907 |
| add_type _ table = table |
|
1908 |
val table = fold (fold_types (fold_atyps add_type)) ts [] |
|
1909 |
(* typ -> typ *) |
|
1910 |
fun coalesce (TFree (s, S)) = TFree (AList.lookup (op =) table S |> the, S) |
|
1911 |
| coalesce T = T |
|
1912 |
in map (map_types (map_atyps coalesce)) ts end |
|
1913 |
||
1914 |
(* extended_context -> typ -> typ list -> typ list *) |
|
1915 |
fun add_ground_types ext_ctxt T accum = |
|
1916 |
case T of |
|
1917 |
Type ("fun", Ts) => fold (add_ground_types ext_ctxt) Ts accum |
|
1918 |
| Type ("*", Ts) => fold (add_ground_types ext_ctxt) Ts accum |
|
1919 |
| Type (@{type_name itself}, [T1]) => add_ground_types ext_ctxt T1 accum |
|
1920 |
| Type (_, Ts) => |
|
1921 |
if T mem @{typ prop} :: @{typ bool} :: @{typ unit} :: accum then |
|
1922 |
accum |
|
1923 |
else |
|
1924 |
T :: accum |
|
1925 |
|> fold (add_ground_types ext_ctxt) |
|
1926 |
(case boxed_datatype_constrs ext_ctxt T of |
|
1927 |
[] => Ts |
|
1928 |
| xs => map snd xs) |
|
1929 |
| _ => insert (op =) T accum |
|
1930 |
(* extended_context -> typ -> typ list *) |
|
1931 |
fun ground_types_in_type ext_ctxt T = add_ground_types ext_ctxt T [] |
|
1932 |
(* extended_context -> term list -> typ list *) |
|
1933 |
fun ground_types_in_terms ext_ctxt ts = |
|
1934 |
fold (fold_types (add_ground_types ext_ctxt)) ts [] |
|
1935 |
||
1936 |
(* typ list -> int -> term -> bool *) |
|
1937 |
fun has_heavy_bounds_or_vars Ts level t = |
|
1938 |
let |
|
1939 |
(* typ list -> bool *) |
|
1940 |
fun aux [] = false |
|
1941 |
| aux [T] = is_fun_type T orelse is_pair_type T |
|
1942 |
| aux _ = true |
|
1943 |
in aux (map snd (Term.add_vars t []) @ map (nth Ts) (loose_bnos t)) end |
|
1944 |
||
1945 |
(* typ list -> int -> int -> int -> term -> term *) |
|
1946 |
fun fresh_value_var Ts k n j t = |
|
1947 |
Var ((val_var_prefix ^ nat_subscript (n - j), k), fastype_of1 (Ts, t)) |
|
1948 |
||
1949 |
(* theory -> typ list -> bool -> int -> int -> term -> term list -> term list |
|
1950 |
-> term * term list *) |
|
1951 |
fun pull_out_constr_comb thy Ts relax k level t args seen = |
|
1952 |
let val t_comb = list_comb (t, args) in |
|
1953 |
case t of |
|
1954 |
Const x => |
|
1955 |
if not relax andalso is_constr thy x |
|
1956 |
andalso not (is_fun_type (fastype_of1 (Ts, t_comb))) |
|
1957 |
andalso has_heavy_bounds_or_vars Ts level t_comb |
|
1958 |
andalso not (loose_bvar (t_comb, level)) then |
|
1959 |
let |
|
1960 |
val (j, seen) = case find_index (equal t_comb) seen of |
|
1961 |
~1 => (0, t_comb :: seen) |
|
1962 |
| j => (j, seen) |
|
1963 |
in (fresh_value_var Ts k (length seen) j t_comb, seen) end |
|
1964 |
else |
|
1965 |
(t_comb, seen) |
|
1966 |
| _ => (t_comb, seen) |
|
1967 |
end |
|
1968 |
||
1969 |
(* (term -> term) -> typ list -> int -> term list -> term list *) |
|
1970 |
fun equations_for_pulled_out_constrs mk_eq Ts k seen = |
|
1971 |
let val n = length seen in |
|
1972 |
map2 (fn j => fn t => mk_eq (fresh_value_var Ts k n j t, t)) |
|
1973 |
(index_seq 0 n) seen |
|
1974 |
end |
|
1975 |
||
1976 |
(* theory -> bool -> term -> term *) |
|
1977 |
fun pull_out_universal_constrs thy def t = |
|
1978 |
let |
|
1979 |
val k = maxidx_of_term t + 1 |
|
1980 |
(* typ list -> bool -> term -> term list -> term list -> term * term list *) |
|
1981 |
fun do_term Ts def t args seen = |
|
1982 |
case t of |
|
1983 |
(t0 as Const (@{const_name "=="}, _)) $ t1 $ t2 => |
|
1984 |
do_eq_or_imp Ts def t0 t1 t2 seen |
|
1985 |
| (t0 as @{const "==>"}) $ t1 $ t2 => do_eq_or_imp Ts def t0 t1 t2 seen |
|
1986 |
| (t0 as Const (@{const_name "op ="}, _)) $ t1 $ t2 => |
|
1987 |
do_eq_or_imp Ts def t0 t1 t2 seen |
|
1988 |
| (t0 as @{const "op -->"}) $ t1 $ t2 => do_eq_or_imp Ts def t0 t1 t2 seen |
|
1989 |
| Abs (s, T, t') => |
|
1990 |
let val (t', seen) = do_term (T :: Ts) def t' [] seen in |
|
1991 |
(list_comb (Abs (s, T, t'), args), seen) |
|
1992 |
end |
|
1993 |
| t1 $ t2 => |
|
1994 |
let val (t2, seen) = do_term Ts def t2 [] seen in |
|
1995 |
do_term Ts def t1 (t2 :: args) seen |
|
1996 |
end |
|
1997 |
| _ => pull_out_constr_comb thy Ts def k 0 t args seen |
|
1998 |
(* typ list -> bool -> term -> term -> term -> term list |
|
1999 |
-> term * term list *) |
|
2000 |
and do_eq_or_imp Ts def t0 t1 t2 seen = |
|
2001 |
let |
|
2002 |
val (t2, seen) = do_term Ts def t2 [] seen |
|
2003 |
val (t1, seen) = do_term Ts false t1 [] seen |
|
2004 |
in (t0 $ t1 $ t2, seen) end |
|
2005 |
val (concl, seen) = do_term [] def t [] [] |
|
2006 |
in |
|
2007 |
Logic.list_implies (equations_for_pulled_out_constrs Logic.mk_equals [] k |
|
2008 |
seen, concl) |
|
2009 |
end |
|
2010 |
||
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
2011 |
(* extended_context -> bool -> term -> term *) |
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
2012 |
fun destroy_pulled_out_constrs (ext_ctxt as {thy, ...}) axiom t = |
33192 | 2013 |
let |
2014 |
(* styp -> int *) |
|
2015 |
val num_occs_of_var = |
|
2016 |
fold_aterms (fn Var z => (fn f => fn z' => f z' |> z = z' ? Integer.add 1) |
|
2017 |
| _ => I) t (K 0) |
|
2018 |
(* bool -> term -> term *) |
|
2019 |
fun aux careful ((t0 as Const (@{const_name "=="}, _)) $ t1 $ t2) = |
|
2020 |
aux_eq careful true t0 t1 t2 |
|
2021 |
| aux careful ((t0 as @{const "==>"}) $ t1 $ t2) = |
|
2022 |
t0 $ aux false t1 $ aux careful t2 |
|
2023 |
| aux careful ((t0 as Const (@{const_name "op ="}, _)) $ t1 $ t2) = |
|
2024 |
aux_eq careful true t0 t1 t2 |
|
2025 |
| aux careful ((t0 as @{const "op -->"}) $ t1 $ t2) = |
|
2026 |
t0 $ aux false t1 $ aux careful t2 |
|
2027 |
| aux careful (Abs (s, T, t')) = Abs (s, T, aux careful t') |
|
2028 |
| aux careful (t1 $ t2) = aux careful t1 $ aux careful t2 |
|
2029 |
| aux _ t = t |
|
2030 |
(* bool -> bool -> term -> term -> term -> term *) |
|
2031 |
and aux_eq careful pass1 t0 t1 t2 = |
|
2032 |
(if careful then |
|
2033 |
raise SAME () |
|
2034 |
else if axiom andalso is_Var t2 |
|
2035 |
andalso num_occs_of_var (dest_Var t2) = 1 then |
|
2036 |
@{const True} |
|
2037 |
else case strip_comb t2 of |
|
2038 |
(Const (x as (s, T)), args) => |
|
2039 |
let val arg_Ts = binder_types T in |
|
2040 |
if length arg_Ts = length args |
|
2041 |
andalso (is_constr thy x orelse s mem [@{const_name Pair}] |
|
2042 |
orelse x = dest_Const @{const Suc}) |
|
2043 |
andalso (not careful orelse not (is_Var t1) |
|
2044 |
orelse String.isPrefix val_var_prefix |
|
2045 |
(fst (fst (dest_Var t1)))) then |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
2046 |
discriminate_value ext_ctxt x t1 :: |
33192 | 2047 |
map3 (sel_eq x t1) (index_seq 0 (length args)) arg_Ts args |
2048 |
|> foldr1 s_conj |
|
2049 |
|> body_type (type_of t0) = prop_T ? HOLogic.mk_Trueprop |
|
2050 |
else |
|
2051 |
raise SAME () |
|
2052 |
end |
|
2053 |
| _ => raise SAME ()) |
|
2054 |
handle SAME () => if pass1 then aux_eq careful false t0 t2 t1 |
|
2055 |
else t0 $ aux false t2 $ aux false t1 |
|
2056 |
(* styp -> term -> int -> typ -> term -> term *) |
|
2057 |
and sel_eq x t n nth_T nth_t = |
|
2058 |
HOLogic.eq_const nth_T $ nth_t $ select_nth_constr_arg thy x t n nth_T |
|
2059 |
|> aux false |
|
2060 |
in aux axiom t end |
|
2061 |
||
2062 |
(* theory -> term -> term *) |
|
2063 |
fun simplify_constrs_and_sels thy t = |
|
2064 |
let |
|
2065 |
(* term -> int -> term *) |
|
2066 |
fun is_nth_sel_on t' n (Const (s, _) $ t) = |
|
2067 |
(t = t' andalso is_sel_like_and_no_discr s |
|
2068 |
andalso sel_no_from_name s = n) |
|
2069 |
| is_nth_sel_on _ _ _ = false |
|
2070 |
(* term -> term list -> term *) |
|
2071 |
fun do_term (Const (@{const_name Rep_Frac}, _) |
|
2072 |
$ (Const (@{const_name Abs_Frac}, _) $ t1)) [] = do_term t1 [] |
|
2073 |
| do_term (Const (@{const_name Abs_Frac}, _) |
|
2074 |
$ (Const (@{const_name Rep_Frac}, _) $ t1)) [] = do_term t1 [] |
|
2075 |
| do_term (t1 $ t2) args = do_term t1 (do_term t2 [] :: args) |
|
2076 |
| do_term (t as Const (x as (s, T))) (args as _ :: _) = |
|
2077 |
((if is_constr_like thy x then |
|
2078 |
if length args = num_binder_types T then |
|
2079 |
case hd args of |
|
2080 |
Const (x' as (_, T')) $ t' => |
|
2081 |
if domain_type T' = body_type T |
|
2082 |
andalso forall (uncurry (is_nth_sel_on t')) |
|
2083 |
(index_seq 0 (length args) ~~ args) then |
|
2084 |
t' |
|
2085 |
else |
|
2086 |
raise SAME () |
|
2087 |
| _ => raise SAME () |
|
2088 |
else |
|
2089 |
raise SAME () |
|
2090 |
else if is_sel_like_and_no_discr s then |
|
2091 |
case strip_comb (hd args) of |
|
2092 |
(Const (x' as (s', T')), ts') => |
|
2093 |
if is_constr_like thy x' |
|
2094 |
andalso constr_name_for_sel_like s = s' |
|
2095 |
andalso not (exists is_pair_type (binder_types T')) then |
|
2096 |
list_comb (nth ts' (sel_no_from_name s), tl args) |
|
2097 |
else |
|
2098 |
raise SAME () |
|
2099 |
| _ => raise SAME () |
|
2100 |
else |
|
2101 |
raise SAME ()) |
|
2102 |
handle SAME () => betapplys (t, args)) |
|
2103 |
| do_term (Abs (s, T, t')) args = |
|
2104 |
betapplys (Abs (s, T, do_term t' []), args) |
|
2105 |
| do_term t args = betapplys (t, args) |
|
2106 |
in do_term t [] end |
|
2107 |
||
2108 |
(* term -> term *) |
|
2109 |
fun curry_assms (@{const "==>"} $ (@{const Trueprop} |
|
2110 |
$ (@{const "op &"} $ t1 $ t2)) $ t3) = |
|
2111 |
curry_assms (Logic.list_implies ([t1, t2] |> map HOLogic.mk_Trueprop, t3)) |
|
2112 |
| curry_assms (@{const "==>"} $ t1 $ t2) = |
|
2113 |
@{const "==>"} $ curry_assms t1 $ curry_assms t2 |
|
2114 |
| curry_assms t = t |
|
2115 |
||
2116 |
(* term -> term *) |
|
2117 |
val destroy_universal_equalities = |
|
2118 |
let |
|
2119 |
(* term list -> (indexname * typ) list -> term -> term *) |
|
2120 |
fun aux prems zs t = |
|
2121 |
case t of |
|
2122 |
@{const "==>"} $ t1 $ t2 => aux_implies prems zs t1 t2 |
|
2123 |
| _ => Logic.list_implies (rev prems, t) |
|
2124 |
(* term list -> (indexname * typ) list -> term -> term -> term *) |
|
2125 |
and aux_implies prems zs t1 t2 = |
|
2126 |
case t1 of |
|
2127 |
Const (@{const_name "=="}, _) $ Var z $ t' => aux_eq prems zs z t' t1 t2 |
|
2128 |
| @{const Trueprop} $ (Const (@{const_name "op ="}, _) $ Var z $ t') => |
|
2129 |
aux_eq prems zs z t' t1 t2 |
|
2130 |
| @{const Trueprop} $ (Const (@{const_name "op ="}, _) $ t' $ Var z) => |
|
2131 |
aux_eq prems zs z t' t1 t2 |
|
2132 |
| _ => aux (t1 :: prems) (Term.add_vars t1 zs) t2 |
|
2133 |
(* term list -> (indexname * typ) list -> indexname * typ -> term -> term |
|
2134 |
-> term -> term *) |
|
2135 |
and aux_eq prems zs z t' t1 t2 = |
|
2136 |
if not (z mem zs) andalso not (exists_subterm (equal (Var z)) t') then |
|
2137 |
aux prems zs (subst_free [(Var z, t')] t2) |
|
2138 |
else |
|
2139 |
aux (t1 :: prems) (Term.add_vars t1 zs) t2 |
|
2140 |
in aux [] [] end |
|
2141 |
||
2142 |
(* theory -> term -> term *) |
|
2143 |
fun pull_out_existential_constrs thy t = |
|
2144 |
let |
|
2145 |
val k = maxidx_of_term t + 1 |
|
2146 |
(* typ list -> int -> term -> term list -> term list -> term * term list *) |
|
2147 |
fun aux Ts num_exists t args seen = |
|
2148 |
case t of |
|
2149 |
(t0 as Const (@{const_name Ex}, _)) $ Abs (s1, T1, t1) => |
|
2150 |
let |
|
2151 |
val (t1, seen') = aux (T1 :: Ts) (num_exists + 1) t1 [] [] |
|
2152 |
val n = length seen' |
|
2153 |
(* unit -> term list *) |
|
2154 |
fun vars () = map2 (fresh_value_var Ts k n) (index_seq 0 n) seen' |
|
2155 |
in |
|
2156 |
(equations_for_pulled_out_constrs HOLogic.mk_eq Ts k seen' |
|
2157 |
|> List.foldl s_conj t1 |> fold mk_exists (vars ()) |
|
2158 |
|> curry3 Abs s1 T1 |> curry (op $) t0, seen) |
|
2159 |
end |
|
2160 |
| t1 $ t2 => |
|
2161 |
let val (t2, seen) = aux Ts num_exists t2 [] seen in |
|
2162 |
aux Ts num_exists t1 (t2 :: args) seen |
|
2163 |
end |
|
2164 |
| Abs (s, T, t') => |
|
2165 |
let |
|
2166 |
val (t', seen) = aux (T :: Ts) 0 t' [] (map (incr_boundvars 1) seen) |
|
2167 |
in (list_comb (Abs (s, T, t'), args), map (incr_boundvars ~1) seen) end |
|
2168 |
| _ => |
|
2169 |
if num_exists > 0 then |
|
2170 |
pull_out_constr_comb thy Ts false k num_exists t args seen |
|
2171 |
else |
|
2172 |
(list_comb (t, args), seen) |
|
2173 |
in aux [] 0 t [] [] |> fst end |
|
2174 |
||
2175 |
(* theory -> int -> term list -> term list -> (term * term list) option *) |
|
2176 |
fun find_bound_assign _ _ _ [] = NONE |
|
2177 |
| find_bound_assign thy j seen (t :: ts) = |
|
2178 |
let |
|
2179 |
(* bool -> term -> term -> (term * term list) option *) |
|
2180 |
fun aux pass1 t1 t2 = |
|
2181 |
(if loose_bvar1 (t2, j) then |
|
2182 |
if pass1 then aux false t2 t1 else raise SAME () |
|
2183 |
else case t1 of |
|
2184 |
Bound j' => if j' = j then SOME (t2, ts @ seen) else raise SAME () |
|
2185 |
| Const (s, Type ("fun", [T1, T2])) $ Bound j' => |
|
2186 |
if j' = j andalso s = sel_prefix_for 0 ^ @{const_name FunBox} then |
|
2187 |
SOME (construct_value thy (@{const_name FunBox}, T2 --> T1) [t2], |
|
2188 |
ts @ seen) |
|
2189 |
else |
|
2190 |
raise SAME () |
|
2191 |
| _ => raise SAME ()) |
|
2192 |
handle SAME () => find_bound_assign thy j (t :: seen) ts |
|
2193 |
in |
|
2194 |
case t of |
|
2195 |
Const (@{const_name "op ="}, _) $ t1 $ t2 => aux true t1 t2 |
|
2196 |
| _ => find_bound_assign thy j (t :: seen) ts |
|
2197 |
end |
|
2198 |
||
2199 |
(* int -> term -> term -> term *) |
|
2200 |
fun subst_one_bound j arg t = |
|
2201 |
let |
|
2202 |
fun aux (Bound i, lev) = |
|
2203 |
if i < lev then raise SAME () |
|
2204 |
else if i = lev then incr_boundvars (lev - j) arg |
|
2205 |
else Bound (i - 1) |
|
2206 |
| aux (Abs (a, T, body), lev) = Abs (a, T, aux (body, lev + 1)) |
|
2207 |
| aux (f $ t, lev) = |
|
2208 |
(aux (f, lev) $ (aux (t, lev) handle SAME () => t) |
|
2209 |
handle SAME () => f $ aux (t, lev)) |
|
2210 |
| aux _ = raise SAME () |
|
2211 |
in aux (t, j) handle SAME () => t end |
|
2212 |
||
2213 |
(* theory -> term -> term *) |
|
2214 |
fun destroy_existential_equalities thy = |
|
2215 |
let |
|
2216 |
(* string list -> typ list -> term list -> term *) |
|
2217 |
fun kill [] [] ts = foldr1 s_conj ts |
|
2218 |
| kill (s :: ss) (T :: Ts) ts = |
|
2219 |
(case find_bound_assign thy (length ss) [] ts of |
|
2220 |
SOME (_, []) => @{const True} |
|
2221 |
| SOME (arg_t, ts) => |
|
2222 |
kill ss Ts (map (subst_one_bound (length ss) |
|
2223 |
(incr_bv (~1, length ss + 1, arg_t))) ts) |
|
2224 |
| NONE => |
|
2225 |
Const (@{const_name Ex}, (T --> bool_T) --> bool_T) |
|
2226 |
$ Abs (s, T, kill ss Ts ts)) |
|
2227 |
| kill _ _ _ = raise UnequalLengths |
|
2228 |
(* string list -> typ list -> term -> term *) |
|
2229 |
fun gather ss Ts ((t0 as Const (@{const_name Ex}, _)) $ Abs (s1, T1, t1)) = |
|
2230 |
gather (ss @ [s1]) (Ts @ [T1]) t1 |
|
2231 |
| gather [] [] (Abs (s, T, t1)) = Abs (s, T, gather [] [] t1) |
|
2232 |
| gather [] [] (t1 $ t2) = gather [] [] t1 $ gather [] [] t2 |
|
2233 |
| gather [] [] t = t |
|
2234 |
| gather ss Ts t = kill ss Ts (conjuncts (gather [] [] t)) |
|
2235 |
in gather [] [] end |
|
2236 |
||
2237 |
(* term -> term *) |
|
2238 |
fun distribute_quantifiers t = |
|
2239 |
case t of |
|
2240 |
(t0 as Const (@{const_name All}, T0)) $ Abs (s, T1, t1) => |
|
2241 |
(case t1 of |
|
2242 |
(t10 as @{const "op &"}) $ t11 $ t12 => |
|
2243 |
t10 $ distribute_quantifiers (t0 $ Abs (s, T1, t11)) |
|
2244 |
$ distribute_quantifiers (t0 $ Abs (s, T1, t12)) |
|
2245 |
| (t10 as @{const Not}) $ t11 => |
|
2246 |
t10 $ distribute_quantifiers (Const (@{const_name Ex}, T0) |
|
2247 |
$ Abs (s, T1, t11)) |
|
2248 |
| t1 => |
|
2249 |
if not (loose_bvar1 (t1, 0)) then |
|
2250 |
distribute_quantifiers (incr_boundvars ~1 t1) |
|
2251 |
else |
|
2252 |
t0 $ Abs (s, T1, distribute_quantifiers t1)) |
|
2253 |
| (t0 as Const (@{const_name Ex}, T0)) $ Abs (s, T1, t1) => |
|
2254 |
(case distribute_quantifiers t1 of |
|
2255 |
(t10 as @{const "op |"}) $ t11 $ t12 => |
|
2256 |
t10 $ distribute_quantifiers (t0 $ Abs (s, T1, t11)) |
|
2257 |
$ distribute_quantifiers (t0 $ Abs (s, T1, t12)) |
|
2258 |
| (t10 as @{const "op -->"}) $ t11 $ t12 => |
|
2259 |
t10 $ distribute_quantifiers (Const (@{const_name All}, T0) |
|
2260 |
$ Abs (s, T1, t11)) |
|
2261 |
$ distribute_quantifiers (t0 $ Abs (s, T1, t12)) |
|
2262 |
| (t10 as @{const Not}) $ t11 => |
|
2263 |
t10 $ distribute_quantifiers (Const (@{const_name All}, T0) |
|
2264 |
$ Abs (s, T1, t11)) |
|
2265 |
| t1 => |
|
2266 |
if not (loose_bvar1 (t1, 0)) then |
|
2267 |
distribute_quantifiers (incr_boundvars ~1 t1) |
|
2268 |
else |
|
2269 |
t0 $ Abs (s, T1, distribute_quantifiers t1)) |
|
2270 |
| t1 $ t2 => distribute_quantifiers t1 $ distribute_quantifiers t2 |
|
2271 |
| Abs (s, T, t') => Abs (s, T, distribute_quantifiers t') |
|
2272 |
| _ => t |
|
2273 |
||
2274 |
(* int -> int -> (int -> int) -> term -> term *) |
|
2275 |
fun renumber_bounds j n f t = |
|
2276 |
case t of |
|
2277 |
t1 $ t2 => renumber_bounds j n f t1 $ renumber_bounds j n f t2 |
|
2278 |
| Abs (s, T, t') => Abs (s, T, renumber_bounds (j + 1) n f t') |
|
2279 |
| Bound j' => |
|
2280 |
Bound (if j' >= j andalso j' < j + n then f (j' - j) + j else j') |
|
2281 |
| _ => t |
|
2282 |
||
2283 |
val quantifier_cluster_max_size = 8 |
|
2284 |
||
2285 |
(* theory -> term -> term *) |
|
2286 |
fun push_quantifiers_inward thy = |
|
2287 |
let |
|
2288 |
(* string -> string list -> typ list -> term -> term *) |
|
2289 |
fun aux quant_s ss Ts t = |
|
2290 |
(case t of |
|
2291 |
(t0 as Const (s0, _)) $ Abs (s1, T1, t1 as _ $ _) => |
|
2292 |
if s0 = quant_s andalso length Ts < quantifier_cluster_max_size then |
|
2293 |
aux s0 (s1 :: ss) (T1 :: Ts) t1 |
|
2294 |
else if quant_s = "" |
|
2295 |
andalso s0 mem [@{const_name All}, @{const_name Ex}] then |
|
2296 |
aux s0 [s1] [T1] t1 |
|
2297 |
else |
|
2298 |
raise SAME () |
|
2299 |
| _ => raise SAME ()) |
|
2300 |
handle SAME () => |
|
2301 |
case t of |
|
2302 |
t1 $ t2 => |
|
2303 |
if quant_s = "" then |
|
2304 |
aux "" [] [] t1 $ aux "" [] [] t2 |
|
2305 |
else |
|
2306 |
let |
|
2307 |
val typical_card = 4 |
|
2308 |
(* ('a -> ''b list) -> 'a list -> ''b list *) |
|
2309 |
fun big_union proj ps = |
|
2310 |
fold (fold (insert (op =)) o proj) ps [] |
|
2311 |
val (ts, connective) = strip_any_connective t |
|
2312 |
val T_costs = |
|
2313 |
map (bounded_card_of_type 65536 typical_card []) Ts |
|
2314 |
val t_costs = map size_of_term ts |
|
2315 |
val num_Ts = length Ts |
|
2316 |
(* int -> int *) |
|
2317 |
val flip = curry (op -) (num_Ts - 1) |
|
2318 |
val t_boundss = map (map flip o loose_bnos) ts |
|
2319 |
(* (int list * int) list -> int list -> int *) |
|
2320 |
fun cost boundss_cum_costs [] = |
|
2321 |
map snd boundss_cum_costs |> Integer.sum |
|
2322 |
| cost boundss_cum_costs (j :: js) = |
|
2323 |
let |
|
2324 |
val (yeas, nays) = |
|
2325 |
List.partition (fn (bounds, _) => j mem bounds) |
|
2326 |
boundss_cum_costs |
|
2327 |
val yeas_bounds = big_union fst yeas |
|
2328 |
val yeas_cost = Integer.sum (map snd yeas) |
|
2329 |
* nth T_costs j |
|
2330 |
in cost ((yeas_bounds, yeas_cost) :: nays) js end |
|
2331 |
val js = all_permutations (index_seq 0 num_Ts) |
|
2332 |
|> map (`(cost (t_boundss ~~ t_costs))) |
|
2333 |
|> sort (int_ord o pairself fst) |> hd |> snd |
|
2334 |
val back_js = map (fn j => find_index (equal j) js) |
|
2335 |
(index_seq 0 num_Ts) |
|
2336 |
val ts = map (renumber_bounds 0 num_Ts (nth back_js o flip)) |
|
2337 |
ts |
|
2338 |
(* (term * int list) list -> term *) |
|
2339 |
fun mk_connection [] = |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
2340 |
raise ARG ("Nitpick_HOL.push_quantifiers_inward.aux.\ |
33192 | 2341 |
\mk_connection", "") |
2342 |
| mk_connection ts_cum_bounds = |
|
2343 |
ts_cum_bounds |> map fst |
|
2344 |
|> foldr1 (fn (t1, t2) => connective $ t1 $ t2) |
|
2345 |
(* (term * int list) list -> int list -> term *) |
|
2346 |
fun build ts_cum_bounds [] = ts_cum_bounds |> mk_connection |
|
2347 |
| build ts_cum_bounds (j :: js) = |
|
2348 |
let |
|
2349 |
val (yeas, nays) = |
|
2350 |
List.partition (fn (_, bounds) => j mem bounds) |
|
2351 |
ts_cum_bounds |
|
2352 |
||> map (apfst (incr_boundvars ~1)) |
|
2353 |
in |
|
2354 |
if null yeas then |
|
2355 |
build nays js |
|
2356 |
else |
|
2357 |
let val T = nth Ts (flip j) in |
|
2358 |
build ((Const (quant_s, (T --> bool_T) --> bool_T) |
|
2359 |
$ Abs (nth ss (flip j), T, |
|
2360 |
mk_connection yeas), |
|
2361 |
big_union snd yeas) :: nays) js |
|
2362 |
end |
|
2363 |
end |
|
2364 |
in build (ts ~~ t_boundss) js end |
|
2365 |
| Abs (s, T, t') => Abs (s, T, aux "" [] [] t') |
|
2366 |
| _ => t |
|
2367 |
in aux "" [] [] end |
|
2368 |
||
2369 |
(* polarity -> string -> bool *) |
|
2370 |
fun is_positive_existential polar quant_s = |
|
2371 |
(polar = Pos andalso quant_s = @{const_name Ex}) |
|
2372 |
orelse (polar = Neg andalso quant_s <> @{const_name Ex}) |
|
2373 |
||
2374 |
(* extended_context -> int -> term -> term *) |
|
2375 |
fun skolemize_term_and_more (ext_ctxt as {thy, def_table, skolems, ...}) |
|
2376 |
skolem_depth = |
|
2377 |
let |
|
2378 |
(* int list -> int list *) |
|
2379 |
val incrs = map (Integer.add 1) |
|
2380 |
(* string list -> typ list -> int list -> int -> polarity -> term -> term *) |
|
2381 |
fun aux ss Ts js depth polar t = |
|
2382 |
let |
|
2383 |
(* string -> typ -> string -> typ -> term -> term *) |
|
2384 |
fun do_quantifier quant_s quant_T abs_s abs_T t = |
|
2385 |
if not (loose_bvar1 (t, 0)) then |
|
2386 |
aux ss Ts js depth polar (incr_boundvars ~1 t) |
|
2387 |
else if depth <= skolem_depth |
|
2388 |
andalso is_positive_existential polar quant_s then |
|
2389 |
let |
|
2390 |
val j = length (!skolems) + 1 |
|
2391 |
val sko_s = skolem_prefix_for (length js) j ^ abs_s |
|
2392 |
val _ = Unsynchronized.change skolems (cons (sko_s, ss)) |
|
2393 |
val sko_t = list_comb (Const (sko_s, rev Ts ---> abs_T), |
|
2394 |
map Bound (rev js)) |
|
2395 |
val abs_t = Abs (abs_s, abs_T, aux ss Ts (incrs js) depth polar t) |
|
2396 |
in |
|
2397 |
if null js then betapply (abs_t, sko_t) |
|
2398 |
else Const (@{const_name Let}, abs_T --> quant_T) $ sko_t $ abs_t |
|
2399 |
end |
|
2400 |
else |
|
2401 |
Const (quant_s, quant_T) |
|
2402 |
$ Abs (abs_s, abs_T, |
|
2403 |
if is_higher_order_type abs_T then |
|
2404 |
t |
|
2405 |
else |
|
2406 |
aux (abs_s :: ss) (abs_T :: Ts) (0 :: incrs js) |
|
2407 |
(depth + 1) polar t) |
|
2408 |
in |
|
2409 |
case t of |
|
2410 |
Const (s0 as @{const_name all}, T0) $ Abs (s1, T1, t1) => |
|
2411 |
do_quantifier s0 T0 s1 T1 t1 |
|
2412 |
| @{const "==>"} $ t1 $ t2 => |
|
2413 |
@{const "==>"} $ aux ss Ts js depth (flip_polarity polar) t1 |
|
2414 |
$ aux ss Ts js depth polar t2 |
|
2415 |
| @{const Pure.conjunction} $ t1 $ t2 => |
|
2416 |
@{const Pure.conjunction} $ aux ss Ts js depth polar t1 |
|
2417 |
$ aux ss Ts js depth polar t2 |
|
2418 |
| @{const Trueprop} $ t1 => |
|
2419 |
@{const Trueprop} $ aux ss Ts js depth polar t1 |
|
2420 |
| @{const Not} $ t1 => |
|
2421 |
@{const Not} $ aux ss Ts js depth (flip_polarity polar) t1 |
|
2422 |
| Const (s0 as @{const_name All}, T0) $ Abs (s1, T1, t1) => |
|
2423 |
do_quantifier s0 T0 s1 T1 t1 |
|
2424 |
| Const (s0 as @{const_name Ex}, T0) $ Abs (s1, T1, t1) => |
|
2425 |
do_quantifier s0 T0 s1 T1 t1 |
|
2426 |
| @{const "op &"} $ t1 $ t2 => |
|
2427 |
@{const "op &"} $ aux ss Ts js depth polar t1 |
|
2428 |
$ aux ss Ts js depth polar t2 |
|
2429 |
| @{const "op |"} $ t1 $ t2 => |
|
2430 |
@{const "op |"} $ aux ss Ts js depth polar t1 |
|
2431 |
$ aux ss Ts js depth polar t2 |
|
2432 |
| @{const "op -->"} $ t1 $ t2 => |
|
2433 |
@{const "op -->"} $ aux ss Ts js depth (flip_polarity polar) t1 |
|
2434 |
$ aux ss Ts js depth polar t2 |
|
2435 |
| (t0 as Const (@{const_name Let}, T0)) $ t1 $ t2 => |
|
2436 |
t0 $ t1 $ aux ss Ts js depth polar t2 |
|
2437 |
| Const (x as (s, T)) => |
|
2438 |
if is_inductive_pred ext_ctxt x |
|
2439 |
andalso not (is_well_founded_inductive_pred ext_ctxt x) then |
|
2440 |
let |
|
2441 |
val gfp = (fixpoint_kind_of_const thy def_table x = Gfp) |
|
2442 |
val (pref, connective, set_oper) = |
|
2443 |
if gfp then |
|
2444 |
(lbfp_prefix, |
|
2445 |
@{const "op |"}, |
|
2446 |
@{const_name upper_semilattice_fun_inst.sup_fun}) |
|
2447 |
else |
|
2448 |
(ubfp_prefix, |
|
2449 |
@{const "op &"}, |
|
2450 |
@{const_name lower_semilattice_fun_inst.inf_fun}) |
|
2451 |
(* unit -> term *) |
|
2452 |
fun pos () = unrolled_inductive_pred_const ext_ctxt gfp x |
|
2453 |
|> aux ss Ts js depth polar |
|
2454 |
fun neg () = Const (pref ^ s, T) |
|
2455 |
in |
|
2456 |
(case polar |> gfp ? flip_polarity of |
|
2457 |
Pos => pos () |
|
2458 |
| Neg => neg () |
|
2459 |
| Neut => |
|
2460 |
if is_fun_type T then |
|
2461 |
let |
|
2462 |
val ((trunk_arg_Ts, rump_arg_T), body_T) = |
|
2463 |
T |> strip_type |>> split_last |
|
2464 |
val set_T = rump_arg_T --> body_T |
|
2465 |
(* (unit -> term) -> term *) |
|
2466 |
fun app f = |
|
2467 |
list_comb (f (), |
|
2468 |
map Bound (length trunk_arg_Ts - 1 downto 0)) |
|
2469 |
in |
|
2470 |
List.foldl absdummy |
|
2471 |
(Const (set_oper, [set_T, set_T] ---> set_T) |
|
2472 |
$ app pos $ app neg) trunk_arg_Ts |
|
2473 |
end |
|
2474 |
else |
|
2475 |
connective $ pos () $ neg ()) |
|
2476 |
end |
|
2477 |
else |
|
2478 |
Const x |
|
2479 |
| t1 $ t2 => |
|
2480 |
betapply (aux ss Ts [] (skolem_depth + 1) polar t1, |
|
2481 |
aux ss Ts [] depth Neut t2) |
|
2482 |
| Abs (s, T, t1) => Abs (s, T, aux ss Ts (incrs js) depth polar t1) |
|
2483 |
| _ => t |
|
2484 |
end |
|
2485 |
in aux [] [] [] 0 Pos end |
|
2486 |
||
2487 |
(* extended_context -> styp -> (int * term option) list *) |
|
2488 |
fun static_args_in_term ({ersatz_table, ...} : extended_context) x t = |
|
2489 |
let |
|
2490 |
(* term -> term list -> term list -> term list list *) |
|
2491 |
fun fun_calls (Abs (_, _, t)) _ = fun_calls t [] |
|
2492 |
| fun_calls (t1 $ t2) args = fun_calls t2 [] #> fun_calls t1 (t2 :: args) |
|
2493 |
| fun_calls t args = |
|
2494 |
(case t of |
|
2495 |
Const (x' as (s', T')) => |
|
2496 |
x = x' orelse (case AList.lookup (op =) ersatz_table s' of |
|
2497 |
SOME s'' => x = (s'', T') |
|
2498 |
| NONE => false) |
|
2499 |
| _ => false) ? cons args |
|
2500 |
(* term list list -> term list list -> term list -> term list list *) |
|
2501 |
fun call_sets [] [] vs = [vs] |
|
2502 |
| call_sets [] uss vs = vs :: call_sets uss [] [] |
|
2503 |
| call_sets ([] :: _) _ _ = [] |
|
2504 |
| call_sets ((t :: ts) :: tss) uss vs = |
|
2505 |
OrdList.insert TermOrd.term_ord t vs |> call_sets tss (ts :: uss) |
|
2506 |
val sets = call_sets (fun_calls t [] []) [] [] |
|
2507 |
val indexed_sets = sets ~~ (index_seq 0 (length sets)) |
|
2508 |
in |
|
2509 |
fold_rev (fn (set, j) => |
|
2510 |
case set of |
|
2511 |
[Var _] => AList.lookup (op =) indexed_sets set = SOME j |
|
2512 |
? cons (j, NONE) |
|
2513 |
| [t as Const _] => cons (j, SOME t) |
|
2514 |
| [t as Free _] => cons (j, SOME t) |
|
2515 |
| _ => I) indexed_sets [] |
|
2516 |
end |
|
2517 |
(* extended_context -> styp -> term list -> (int * term option) list *) |
|
2518 |
fun static_args_in_terms ext_ctxt x = |
|
2519 |
map (static_args_in_term ext_ctxt x) |
|
2520 |
#> fold1 (OrdList.inter (prod_ord int_ord (option_ord TermOrd.term_ord))) |
|
2521 |
||
2522 |
(* term -> term list *) |
|
2523 |
fun params_in_equation (@{const "==>"} $ _ $ t2) = params_in_equation t2 |
|
2524 |
| params_in_equation (@{const Trueprop} $ t1) = params_in_equation t1 |
|
2525 |
| params_in_equation (Const (@{const_name "op ="}, _) $ t1 $ _) = |
|
2526 |
snd (strip_comb t1) |
|
2527 |
| params_in_equation _ = [] |
|
2528 |
||
2529 |
(* styp -> styp -> int list -> term list -> term list -> term -> term *) |
|
2530 |
fun specialize_fun_axiom x x' fixed_js fixed_args extra_args t = |
|
2531 |
let |
|
2532 |
val k = fold Integer.max (map maxidx_of_term (fixed_args @ extra_args)) 0 |
|
2533 |
+ 1 |
|
2534 |
val t = map_aterms (fn Var ((s, i), T) => Var ((s, k + i), T) | t' => t') t |
|
2535 |
val fixed_params = filter_indices fixed_js (params_in_equation t) |
|
2536 |
(* term list -> term -> term *) |
|
2537 |
fun aux args (Abs (s, T, t)) = list_comb (Abs (s, T, aux [] t), args) |
|
2538 |
| aux args (t1 $ t2) = aux (aux [] t2 :: args) t1 |
|
2539 |
| aux args t = |
|
2540 |
if t = Const x then |
|
2541 |
list_comb (Const x', extra_args @ filter_out_indices fixed_js args) |
|
2542 |
else |
|
2543 |
let val j = find_index (equal t) fixed_params in |
|
2544 |
list_comb (if j >= 0 then nth fixed_args j else t, args) |
|
2545 |
end |
|
2546 |
in aux [] t end |
|
2547 |
||
2548 |
(* typ list -> term -> bool *) |
|
2549 |
fun is_eligible_arg Ts t = |
|
2550 |
let val bad_Ts = map snd (Term.add_vars t []) @ map (nth Ts) (loose_bnos t) in |
|
2551 |
null bad_Ts |
|
2552 |
orelse (is_higher_order_type (fastype_of1 (Ts, t)) |
|
2553 |
andalso forall (not o is_higher_order_type) bad_Ts) |
|
2554 |
end |
|
2555 |
||
2556 |
(* (int * term option) list -> (int * term) list -> int list *) |
|
2557 |
fun overlapping_indices [] _ = [] |
|
2558 |
| overlapping_indices _ [] = [] |
|
2559 |
| overlapping_indices (ps1 as (j1, t1) :: ps1') (ps2 as (j2, t2) :: ps2') = |
|
2560 |
if j1 < j2 then overlapping_indices ps1' ps2 |
|
2561 |
else if j1 > j2 then overlapping_indices ps1 ps2' |
|
2562 |
else overlapping_indices ps1' ps2' |> the_default t2 t1 = t2 ? cons j1 |
|
2563 |
||
2564 |
val special_depth = 20 |
|
2565 |
||
2566 |
(* extended_context -> int -> term -> term *) |
|
2567 |
fun specialize_consts_in_term (ext_ctxt as {thy, specialize, simp_table, |
|
2568 |
special_funs, ...}) depth t = |
|
2569 |
if not specialize orelse depth > special_depth then |
|
2570 |
t |
|
2571 |
else |
|
2572 |
let |
|
2573 |
val blacklist = if depth = 0 then [] |
|
2574 |
else case term_under_def t of Const x => [x] | _ => [] |
|
2575 |
(* term list -> typ list -> term -> term *) |
|
2576 |
fun aux args Ts (Const (x as (s, T))) = |
|
2577 |
((if not (x mem blacklist) andalso not (null args) |
|
2578 |
andalso not (String.isPrefix special_prefix s) |
|
2579 |
andalso is_equational_fun ext_ctxt x then |
|
2580 |
let |
|
2581 |
val eligible_args = filter (is_eligible_arg Ts o snd) |
|
2582 |
(index_seq 0 (length args) ~~ args) |
|
2583 |
val _ = not (null eligible_args) orelse raise SAME () |
|
2584 |
val old_axs = equational_fun_axioms ext_ctxt x |
|
2585 |
|> map (destroy_existential_equalities thy) |
|
2586 |
val static_params = static_args_in_terms ext_ctxt x old_axs |
|
2587 |
val fixed_js = overlapping_indices static_params eligible_args |
|
2588 |
val _ = not (null fixed_js) orelse raise SAME () |
|
2589 |
val fixed_args = filter_indices fixed_js args |
|
2590 |
val vars = fold Term.add_vars fixed_args [] |
|
2591 |
|> sort (TermOrd.fast_indexname_ord o pairself fst) |
|
2592 |
val bound_js = fold (fn t => fn js => add_loose_bnos (t, 0, js)) |
|
2593 |
fixed_args [] |
|
2594 |
|> sort int_ord |
|
2595 |
val live_args = filter_out_indices fixed_js args |
|
2596 |
val extra_args = map Var vars @ map Bound bound_js @ live_args |
|
2597 |
val extra_Ts = map snd vars @ filter_indices bound_js Ts |
|
2598 |
val k = maxidx_of_term t + 1 |
|
2599 |
(* int -> term *) |
|
2600 |
fun var_for_bound_no j = |
|
2601 |
Var ((bound_var_prefix ^ |
|
2602 |
nat_subscript (find_index (equal j) bound_js + 1), k), |
|
2603 |
nth Ts j) |
|
2604 |
val fixed_args_in_axiom = |
|
2605 |
map (curry subst_bounds |
|
2606 |
(map var_for_bound_no (index_seq 0 (length Ts)))) |
|
2607 |
fixed_args |
|
2608 |
in |
|
2609 |
case AList.lookup (op =) (!special_funs) |
|
2610 |
(x, fixed_js, fixed_args_in_axiom) of |
|
2611 |
SOME x' => list_comb (Const x', extra_args) |
|
2612 |
| NONE => |
|
2613 |
let |
|
2614 |
val extra_args_in_axiom = |
|
2615 |
map Var vars @ map var_for_bound_no bound_js |
|
2616 |
val x' as (s', _) = |
|
2617 |
(special_prefix_for (length (!special_funs) + 1) ^ s, |
|
2618 |
extra_Ts @ filter_out_indices fixed_js (binder_types T) |
|
2619 |
---> body_type T) |
|
2620 |
val new_axs = |
|
2621 |
map (specialize_fun_axiom x x' fixed_js |
|
2622 |
fixed_args_in_axiom extra_args_in_axiom) old_axs |
|
2623 |
val _ = |
|
2624 |
Unsynchronized.change special_funs |
|
2625 |
(cons ((x, fixed_js, fixed_args_in_axiom), x')) |
|
2626 |
val _ = add_simps simp_table s' new_axs |
|
2627 |
in list_comb (Const x', extra_args) end |
|
2628 |
end |
|
2629 |
else |
|
2630 |
raise SAME ()) |
|
2631 |
handle SAME () => list_comb (Const x, args)) |
|
2632 |
| aux args Ts (Abs (s, T, t)) = |
|
2633 |
list_comb (Abs (s, T, aux [] (T :: Ts) t), args) |
|
2634 |
| aux args Ts (t1 $ t2) = aux (aux [] Ts t2 :: args) Ts t1 |
|
2635 |
| aux args _ t = list_comb (t, args) |
|
2636 |
in aux [] [] t end |
|
2637 |
||
2638 |
(* theory -> term -> int Termtab.tab -> int Termtab.tab *) |
|
2639 |
fun add_to_uncurry_table thy t = |
|
2640 |
let |
|
2641 |
(* term -> term list -> int Termtab.tab -> int Termtab.tab *) |
|
2642 |
fun aux (t1 $ t2) args table = |
|
2643 |
let val table = aux t2 [] table in aux t1 (t2 :: args) table end |
|
2644 |
| aux (Abs (_, _, t')) _ table = aux t' [] table |
|
2645 |
| aux (t as Const (x as (s, _))) args table = |
|
2646 |
if is_built_in_const false x orelse is_constr_like thy x orelse is_sel s |
|
2647 |
orelse s = @{const_name Sigma} then |
|
2648 |
table |
|
2649 |
else |
|
2650 |
Termtab.map_default (t, 65536) (curry Int.min (length args)) table |
|
2651 |
| aux _ _ table = table |
|
2652 |
in aux t [] end |
|
2653 |
||
2654 |
(* int Termtab.tab term -> term *) |
|
2655 |
fun uncurry_term table t = |
|
2656 |
let |
|
2657 |
(* term -> term list -> term *) |
|
2658 |
fun aux (t1 $ t2) args = aux t1 (aux t2 [] :: args) |
|
2659 |
| aux (Abs (s, T, t')) args = betapplys (Abs (s, T, aux t' []), args) |
|
2660 |
| aux (t as Const (s, T)) args = |
|
2661 |
(case Termtab.lookup table t of |
|
2662 |
SOME n => |
|
2663 |
if n >= 2 then |
|
2664 |
let |
|
2665 |
val (arg_Ts, rest_T) = strip_n_binders n T |
|
2666 |
val j = |
|
2667 |
if hd arg_Ts = @{typ bisim_iterator} |
|
2668 |
orelse is_fp_iterator_type (hd arg_Ts) then |
|
2669 |
1 |
|
2670 |
else case find_index (not_equal bool_T) arg_Ts of |
|
2671 |
~1 => n |
|
2672 |
| j => j |
|
2673 |
val ((before_args, tuple_args), after_args) = |
|
2674 |
args |> chop n |>> chop j |
|
2675 |
val ((before_arg_Ts, tuple_arg_Ts), rest_T) = |
|
2676 |
T |> strip_n_binders n |>> chop j |
|
2677 |
val tuple_T = HOLogic.mk_tupleT tuple_arg_Ts |
|
2678 |
in |
|
2679 |
if n - j < 2 then |
|
2680 |
betapplys (t, args) |
|
2681 |
else |
|
2682 |
betapplys (Const (uncurry_prefix_for (n - j) j ^ s, |
|
2683 |
before_arg_Ts ---> tuple_T --> rest_T), |
|
2684 |
before_args @ [mk_flat_tuple tuple_T tuple_args] @ |
|
2685 |
after_args) |
|
2686 |
end |
|
2687 |
else |
|
2688 |
betapplys (t, args) |
|
2689 |
| NONE => betapplys (t, args)) |
|
2690 |
| aux t args = betapplys (t, args) |
|
2691 |
in aux t [] end |
|
2692 |
||
2693 |
(* (term -> term) -> int -> term -> term *) |
|
2694 |
fun coerce_bound_no f j t = |
|
2695 |
case t of |
|
2696 |
t1 $ t2 => coerce_bound_no f j t1 $ coerce_bound_no f j t2 |
|
2697 |
| Abs (s, T, t') => Abs (s, T, coerce_bound_no f (j + 1) t') |
|
2698 |
| Bound j' => if j' = j then f t else t |
|
2699 |
| _ => t |
|
2700 |
||
2701 |
(* extended_context -> bool -> term -> term *) |
|
2702 |
fun box_fun_and_pair_in_term (ext_ctxt as {thy, fast_descrs, ...}) def orig_t = |
|
2703 |
let |
|
2704 |
(* typ -> typ *) |
|
2705 |
fun box_relational_operator_type (Type ("fun", Ts)) = |
|
2706 |
Type ("fun", map box_relational_operator_type Ts) |
|
2707 |
| box_relational_operator_type (Type ("*", Ts)) = |
|
2708 |
Type ("*", map (box_type ext_ctxt InPair) Ts) |
|
2709 |
| box_relational_operator_type T = T |
|
2710 |
(* typ -> typ -> term -> term *) |
|
2711 |
fun coerce_bound_0_in_term new_T old_T = |
|
2712 |
old_T <> new_T ? coerce_bound_no (coerce_term [new_T] old_T new_T) 0 |
|
2713 |
(* typ list -> typ -> term -> term *) |
|
2714 |
and coerce_term Ts new_T old_T t = |
|
2715 |
if old_T = new_T then |
|
2716 |
t |
|
2717 |
else |
|
2718 |
case (new_T, old_T) of |
|
2719 |
(Type (new_s, new_Ts as [new_T1, new_T2]), |
|
2720 |
Type ("fun", [old_T1, old_T2])) => |
|
2721 |
(case eta_expand Ts t 1 of |
|
2722 |
Abs (s, _, t') => |
|
2723 |
Abs (s, new_T1, |
|
2724 |
t' |> coerce_bound_0_in_term new_T1 old_T1 |
|
2725 |
|> coerce_term (new_T1 :: Ts) new_T2 old_T2) |
|
2726 |
|> Envir.eta_contract |
|
2727 |
|> new_s <> "fun" |
|
2728 |
? construct_value thy (@{const_name FunBox}, |
|
2729 |
Type ("fun", new_Ts) --> new_T) o single |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
2730 |
| t' => raise TERM ("Nitpick_HOL.box_fun_and_pair_in_term.\ |
33192 | 2731 |
\coerce_term", [t'])) |
2732 |
| (Type (new_s, new_Ts as [new_T1, new_T2]), |
|
2733 |
Type (old_s, old_Ts as [old_T1, old_T2])) => |
|
2734 |
if old_s mem [@{type_name fun_box}, @{type_name pair_box}, "*"] then |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
2735 |
case constr_expand ext_ctxt old_T t of |
33192 | 2736 |
Const (@{const_name FunBox}, _) $ t1 => |
2737 |
if new_s = "fun" then |
|
2738 |
coerce_term Ts new_T (Type ("fun", old_Ts)) t1 |
|
2739 |
else |
|
2740 |
construct_value thy |
|
2741 |
(@{const_name FunBox}, Type ("fun", new_Ts) --> new_T) |
|
2742 |
[coerce_term Ts (Type ("fun", new_Ts)) |
|
2743 |
(Type ("fun", old_Ts)) t1] |
|
2744 |
| Const _ $ t1 $ t2 => |
|
2745 |
construct_value thy |
|
2746 |
(if new_s = "*" then @{const_name Pair} |
|
2747 |
else @{const_name PairBox}, new_Ts ---> new_T) |
|
2748 |
[coerce_term Ts new_T1 old_T1 t1, |
|
2749 |
coerce_term Ts new_T2 old_T2 t2] |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
2750 |
| t' => raise TERM ("Nitpick_HOL.box_fun_and_pair_in_term.\ |
33192 | 2751 |
\coerce_term", [t']) |
2752 |
else |
|
2753 |
raise TYPE ("coerce_term", [new_T, old_T], [t]) |
|
2754 |
| _ => raise TYPE ("coerce_term", [new_T, old_T], [t]) |
|
2755 |
(* indexname * typ -> typ * term -> typ option list -> typ option list *) |
|
2756 |
fun add_boxed_types_for_var (z as (_, T)) (T', t') = |
|
2757 |
case t' of |
|
2758 |
Var z' => z' = z ? insert (op =) T' |
|
2759 |
| Const (@{const_name Pair}, _) $ t1 $ t2 => |
|
2760 |
(case T' of |
|
2761 |
Type (_, [T1, T2]) => |
|
2762 |
fold (add_boxed_types_for_var z) [(T1, t1), (T2, t2)] |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
2763 |
| _ => raise TYPE ("Nitpick_HOL.box_fun_and_pair_in_term.\ |
33192 | 2764 |
\add_boxed_types_for_var", [T'], [])) |
2765 |
| _ => exists_subterm (equal (Var z)) t' ? insert (op =) T |
|
2766 |
(* typ list -> typ list -> term -> indexname * typ -> typ *) |
|
2767 |
fun box_var_in_def new_Ts old_Ts t (z as (_, T)) = |
|
2768 |
case t of |
|
2769 |
@{const Trueprop} $ t1 => box_var_in_def new_Ts old_Ts t1 z |
|
2770 |
| Const (s0, _) $ t1 $ _ => |
|
2771 |
if s0 mem [@{const_name "=="}, @{const_name "op ="}] then |
|
2772 |
let |
|
2773 |
val (t', args) = strip_comb t1 |
|
2774 |
val T' = fastype_of1 (new_Ts, do_term new_Ts old_Ts Neut t') |
|
2775 |
in |
|
2776 |
case fold (add_boxed_types_for_var z) |
|
2777 |
(fst (strip_n_binders (length args) T') ~~ args) [] of |
|
2778 |
[T''] => T'' |
|
2779 |
| _ => T |
|
2780 |
end |
|
2781 |
else |
|
2782 |
T |
|
2783 |
| _ => T |
|
2784 |
(* typ list -> typ list -> polarity -> string -> typ -> string -> typ |
|
2785 |
-> term -> term *) |
|
2786 |
and do_quantifier new_Ts old_Ts polar quant_s quant_T abs_s abs_T t = |
|
2787 |
let |
|
2788 |
val abs_T' = |
|
2789 |
if polar = Neut orelse is_positive_existential polar quant_s then |
|
2790 |
box_type ext_ctxt InFunLHS abs_T |
|
2791 |
else |
|
2792 |
abs_T |
|
2793 |
val body_T = body_type quant_T |
|
2794 |
in |
|
2795 |
Const (quant_s, (abs_T' --> body_T) --> body_T) |
|
2796 |
$ Abs (abs_s, abs_T', |
|
2797 |
t |> do_term (abs_T' :: new_Ts) (abs_T :: old_Ts) polar) |
|
2798 |
end |
|
2799 |
(* typ list -> typ list -> string -> typ -> term -> term -> term *) |
|
2800 |
and do_equals new_Ts old_Ts s0 T0 t1 t2 = |
|
2801 |
let |
|
2802 |
val (t1, t2) = pairself (do_term new_Ts old_Ts Neut) (t1, t2) |
|
2803 |
val (T1, T2) = pairself (curry fastype_of1 new_Ts) (t1, t2) |
|
2804 |
val T = [T1, T2] |> sort TermOrd.typ_ord |> List.last |
|
2805 |
in |
|
2806 |
list_comb (Const (s0, [T, T] ---> body_type T0), |
|
2807 |
map2 (coerce_term new_Ts T) [T1, T2] [t1, t2]) |
|
2808 |
end |
|
2809 |
(* string -> typ -> term *) |
|
2810 |
and do_description_operator s T = |
|
2811 |
let val T1 = box_type ext_ctxt InFunLHS (range_type T) in |
|
2812 |
Const (s, (T1 --> bool_T) --> T1) |
|
2813 |
end |
|
2814 |
(* typ list -> typ list -> polarity -> term -> term *) |
|
2815 |
and do_term new_Ts old_Ts polar t = |
|
2816 |
case t of |
|
2817 |
Const (s0 as @{const_name all}, T0) $ Abs (s1, T1, t1) => |
|
2818 |
do_quantifier new_Ts old_Ts polar s0 T0 s1 T1 t1 |
|
2819 |
| Const (s0 as @{const_name "=="}, T0) $ t1 $ t2 => |
|
2820 |
do_equals new_Ts old_Ts s0 T0 t1 t2 |
|
2821 |
| @{const "==>"} $ t1 $ t2 => |
|
2822 |
@{const "==>"} $ do_term new_Ts old_Ts (flip_polarity polar) t1 |
|
2823 |
$ do_term new_Ts old_Ts polar t2 |
|
2824 |
| @{const Pure.conjunction} $ t1 $ t2 => |
|
2825 |
@{const Pure.conjunction} $ do_term new_Ts old_Ts polar t1 |
|
2826 |
$ do_term new_Ts old_Ts polar t2 |
|
2827 |
| @{const Trueprop} $ t1 => |
|
2828 |
@{const Trueprop} $ do_term new_Ts old_Ts polar t1 |
|
2829 |
| @{const Not} $ t1 => |
|
2830 |
@{const Not} $ do_term new_Ts old_Ts (flip_polarity polar) t1 |
|
2831 |
| Const (s0 as @{const_name All}, T0) $ Abs (s1, T1, t1) => |
|
2832 |
do_quantifier new_Ts old_Ts polar s0 T0 s1 T1 t1 |
|
2833 |
| Const (s0 as @{const_name Ex}, T0) $ Abs (s1, T1, t1) => |
|
2834 |
do_quantifier new_Ts old_Ts polar s0 T0 s1 T1 t1 |
|
2835 |
| Const (s0 as @{const_name "op ="}, T0) $ t1 $ t2 => |
|
2836 |
do_equals new_Ts old_Ts s0 T0 t1 t2 |
|
2837 |
| @{const "op &"} $ t1 $ t2 => |
|
2838 |
@{const "op &"} $ do_term new_Ts old_Ts polar t1 |
|
2839 |
$ do_term new_Ts old_Ts polar t2 |
|
2840 |
| @{const "op |"} $ t1 $ t2 => |
|
2841 |
@{const "op |"} $ do_term new_Ts old_Ts polar t1 |
|
2842 |
$ do_term new_Ts old_Ts polar t2 |
|
2843 |
| @{const "op -->"} $ t1 $ t2 => |
|
2844 |
@{const "op -->"} $ do_term new_Ts old_Ts (flip_polarity polar) t1 |
|
2845 |
$ do_term new_Ts old_Ts polar t2 |
|
2846 |
| Const (s as @{const_name The}, T) => do_description_operator s T |
|
2847 |
| Const (s as @{const_name Eps}, T) => do_description_operator s T |
|
2848 |
| Const (s as @{const_name Tha}, T) => do_description_operator s T |
|
2849 |
| Const (x as (s, T)) => |
|
2850 |
Const (s, if s mem [@{const_name converse}, @{const_name trancl}] then |
|
2851 |
box_relational_operator_type T |
|
2852 |
else if is_built_in_const fast_descrs x |
|
2853 |
orelse s = @{const_name Sigma} then |
|
2854 |
T |
|
2855 |
else if is_constr_like thy x then |
|
2856 |
box_type ext_ctxt InConstr T |
|
2857 |
else if is_sel s orelse is_rep_fun thy x then |
|
2858 |
box_type ext_ctxt InSel T |
|
2859 |
else |
|
2860 |
box_type ext_ctxt InExpr T) |
|
2861 |
| t1 $ Abs (s, T, t2') => |
|
2862 |
let |
|
2863 |
val t1 = do_term new_Ts old_Ts Neut t1 |
|
2864 |
val T1 = fastype_of1 (new_Ts, t1) |
|
2865 |
val (s1, Ts1) = dest_Type T1 |
|
2866 |
val T' = hd (snd (dest_Type (hd Ts1))) |
|
2867 |
val t2 = Abs (s, T', do_term (T' :: new_Ts) (T :: old_Ts) Neut t2') |
|
2868 |
val T2 = fastype_of1 (new_Ts, t2) |
|
2869 |
val t2 = coerce_term new_Ts (hd Ts1) T2 t2 |
|
2870 |
in |
|
2871 |
betapply (if s1 = "fun" then |
|
2872 |
t1 |
|
2873 |
else |
|
2874 |
select_nth_constr_arg thy |
|
2875 |
(@{const_name FunBox}, Type ("fun", Ts1) --> T1) t1 0 |
|
2876 |
(Type ("fun", Ts1)), t2) |
|
2877 |
end |
|
2878 |
| t1 $ t2 => |
|
2879 |
let |
|
2880 |
val t1 = do_term new_Ts old_Ts Neut t1 |
|
2881 |
val T1 = fastype_of1 (new_Ts, t1) |
|
2882 |
val (s1, Ts1) = dest_Type T1 |
|
2883 |
val t2 = do_term new_Ts old_Ts Neut t2 |
|
2884 |
val T2 = fastype_of1 (new_Ts, t2) |
|
2885 |
val t2 = coerce_term new_Ts (hd Ts1) T2 t2 |
|
2886 |
in |
|
2887 |
betapply (if s1 = "fun" then |
|
2888 |
t1 |
|
2889 |
else |
|
2890 |
select_nth_constr_arg thy |
|
2891 |
(@{const_name FunBox}, Type ("fun", Ts1) --> T1) t1 0 |
|
2892 |
(Type ("fun", Ts1)), t2) |
|
2893 |
end |
|
2894 |
| Free (s, T) => Free (s, box_type ext_ctxt InExpr T) |
|
2895 |
| Var (z as (x, T)) => |
|
2896 |
Var (x, if def then box_var_in_def new_Ts old_Ts orig_t z |
|
2897 |
else box_type ext_ctxt InExpr T) |
|
2898 |
| Bound _ => t |
|
2899 |
| Abs (s, T, t') => |
|
2900 |
Abs (s, T, do_term (T :: new_Ts) (T :: old_Ts) Neut t') |
|
2901 |
in do_term [] [] Pos orig_t end |
|
2902 |
||
2903 |
(* int -> term -> term *) |
|
2904 |
fun eval_axiom_for_term j t = |
|
2905 |
Logic.mk_equals (Const (eval_prefix ^ string_of_int j, fastype_of t), t) |
|
2906 |
||
2907 |
(* extended_context -> styp -> bool *) |
|
2908 |
fun is_equational_fun_surely_complete ext_ctxt x = |
|
2909 |
case raw_equational_fun_axioms ext_ctxt x of |
|
2910 |
[@{const Trueprop} $ (Const (@{const_name "op ="}, _) $ t1 $ _)] => |
|
2911 |
strip_comb t1 |> snd |> forall is_Var |
|
2912 |
| _ => false |
|
2913 |
||
2914 |
type special = int list * term list * styp |
|
2915 |
||
2916 |
(* styp -> special -> special -> term *) |
|
2917 |
fun special_congruence_axiom (s, T) (js1, ts1, x1) (js2, ts2, x2) = |
|
2918 |
let |
|
2919 |
val (bounds1, bounds2) = pairself (map Var o special_bounds) (ts1, ts2) |
|
2920 |
val Ts = binder_types T |
|
2921 |
val max_j = fold (fold (curry Int.max)) [js1, js2] ~1 |
|
2922 |
val (eqs, (args1, args2)) = |
|
2923 |
fold (fn j => case pairself (fn ps => AList.lookup (op =) ps j) |
|
2924 |
(js1 ~~ ts1, js2 ~~ ts2) of |
|
2925 |
(SOME t1, SOME t2) => apfst (cons (t1, t2)) |
|
2926 |
| (SOME t1, NONE) => apsnd (apsnd (cons t1)) |
|
2927 |
| (NONE, SOME t2) => apsnd (apfst (cons t2)) |
|
2928 |
| (NONE, NONE) => |
|
2929 |
let val v = Var ((cong_var_prefix ^ nat_subscript j, 0), |
|
2930 |
nth Ts j) in |
|
2931 |
apsnd (pairself (cons v)) |
|
2932 |
end) (max_j downto 0) ([], ([], [])) |
|
2933 |
in |
|
2934 |
Logic.list_implies (eqs |> filter_out (op =) |> distinct (op =) |
|
2935 |
|> map Logic.mk_equals, |
|
2936 |
Logic.mk_equals (list_comb (Const x1, bounds1 @ args1), |
|
2937 |
list_comb (Const x2, bounds2 @ args2))) |
|
2938 |
|> Refute.close_form |
|
2939 |
end |
|
2940 |
||
2941 |
(* extended_context -> styp list -> term list *) |
|
2942 |
fun special_congruence_axioms (ext_ctxt as {special_funs, ...}) xs = |
|
2943 |
let |
|
2944 |
val groups = |
|
2945 |
!special_funs |
|
2946 |
|> map (fn ((x, js, ts), x') => (x, (js, ts, x'))) |
|
2947 |
|> AList.group (op =) |
|
2948 |
|> filter_out (is_equational_fun_surely_complete ext_ctxt o fst) |
|
2949 |
|> map (fn (x, zs) => (x, zs |> (x mem xs) ? cons ([], [], x))) |
|
2950 |
(* special -> int *) |
|
2951 |
fun generality (js, _, _) = ~(length js) |
|
2952 |
(* special -> special -> bool *) |
|
2953 |
fun is_more_specific (j1, t1, x1) (j2, t2, x2) = |
|
2954 |
x1 <> x2 andalso OrdList.subset (prod_ord int_ord TermOrd.term_ord) |
|
2955 |
(j2 ~~ t2, j1 ~~ t1) |
|
2956 |
(* styp -> special list -> special list -> special list -> term list |
|
2957 |
-> term list *) |
|
2958 |
fun do_pass_1 _ [] [_] [_] = I |
|
2959 |
| do_pass_1 x skipped _ [] = do_pass_2 x skipped |
|
2960 |
| do_pass_1 x skipped all (z :: zs) = |
|
2961 |
case filter (is_more_specific z) all |
|
2962 |
|> sort (int_ord o pairself generality) of |
|
2963 |
[] => do_pass_1 x (z :: skipped) all zs |
|
2964 |
| (z' :: _) => cons (special_congruence_axiom x z z') |
|
2965 |
#> do_pass_1 x skipped all zs |
|
2966 |
(* styp -> special list -> term list -> term list *) |
|
2967 |
and do_pass_2 _ [] = I |
|
2968 |
| do_pass_2 x (z :: zs) = |
|
2969 |
fold (cons o special_congruence_axiom x z) zs #> do_pass_2 x zs |
|
2970 |
in fold (fn (x, zs) => do_pass_1 x [] zs zs) groups [] end |
|
2971 |
||
2972 |
(* term -> bool *) |
|
2973 |
val is_trivial_equation = the_default false o try (op aconv o Logic.dest_equals) |
|
2974 |
||
2975 |
(* 'a Symtab.table -> 'a list *) |
|
2976 |
fun all_table_entries table = Symtab.fold (append o snd) table [] |
|
2977 |
(* const_table -> string -> const_table *) |
|
2978 |
fun extra_table table s = Symtab.make [(s, all_table_entries table)] |
|
2979 |
||
2980 |
(* extended_context -> term -> (term list * term list) * (bool * bool) *) |
|
2981 |
fun axioms_for_term |
|
2982 |
(ext_ctxt as {thy, max_bisim_depth, user_axioms, fast_descrs, evals, |
|
2983 |
def_table, nondef_table, user_nondefs, ...}) t = |
|
2984 |
let |
|
2985 |
type accumulator = styp list * (term list * term list) |
|
2986 |
(* (term list * term list -> term list) |
|
2987 |
-> ((term list -> term list) -> term list * term list |
|
2988 |
-> term list * term list) |
|
2989 |
-> int -> term -> accumulator -> accumulator *) |
|
2990 |
fun add_axiom get app depth t (accum as (xs, axs)) = |
|
2991 |
let |
|
2992 |
val t = t |> unfold_defs_in_term ext_ctxt |
|
2993 |
|> skolemize_term_and_more ext_ctxt ~1 |
|
2994 |
in |
|
2995 |
if is_trivial_equation t then |
|
2996 |
accum |
|
2997 |
else |
|
2998 |
let val t' = t |> specialize_consts_in_term ext_ctxt depth in |
|
2999 |
if exists (member (op aconv) (get axs)) [t, t'] then accum |
|
3000 |
else add_axioms_for_term (depth + 1) t' (xs, app (cons t') axs) |
|
3001 |
end |
|
3002 |
end |
|
3003 |
(* int -> term -> accumulator -> accumulator *) |
|
3004 |
and add_nondef_axiom depth = add_axiom snd apsnd depth |
|
3005 |
and add_def_axiom depth t = |
|
3006 |
(if head_of t = @{const "==>"} then add_nondef_axiom |
|
3007 |
else add_axiom fst apfst) depth t |
|
3008 |
(* int -> term -> accumulator -> accumulator *) |
|
3009 |
and add_axioms_for_term depth t (accum as (xs, axs)) = |
|
3010 |
case t of |
|
3011 |
t1 $ t2 => accum |> fold (add_axioms_for_term depth) [t1, t2] |
|
3012 |
| Const (x as (s, T)) => |
|
3013 |
(if x mem xs orelse is_built_in_const fast_descrs x then |
|
3014 |
accum |
|
3015 |
else |
|
3016 |
let val accum as (xs, _) = (x :: xs, axs) in |
|
3017 |
if depth > axioms_max_depth then |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
3018 |
raise LIMIT ("Nitpick_HOL.axioms_for_term.add_axioms_for_term", |
33192 | 3019 |
"too many nested axioms (" ^ string_of_int depth ^ |
3020 |
")") |
|
3021 |
else if Refute.is_const_of_class thy x then |
|
3022 |
let |
|
3023 |
val class = Logic.class_of_const s |
|
3024 |
val of_class = Logic.mk_of_class (TVar (("'a", 0), [class]), |
|
3025 |
class) |
|
3026 |
val ax1 = try (Refute.specialize_type thy x) of_class |
|
3027 |
val ax2 = Option.map (Refute.specialize_type thy x o snd) |
|
3028 |
(Refute.get_classdef thy class) |
|
3029 |
in fold (add_def_axiom depth) (map_filter I [ax1, ax2]) accum end |
|
3030 |
else if is_constr thy x then |
|
3031 |
accum |
|
3032 |
else if is_equational_fun ext_ctxt x then |
|
3033 |
fold (add_def_axiom depth) (equational_fun_axioms ext_ctxt x) |
|
3034 |
accum |
|
3035 |
else if is_abs_fun thy x then |
|
3036 |
accum |> fold (add_nondef_axiom depth) |
|
33197
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
3037 |
(nondef_props_for_const thy false nondef_table x) |
33571 | 3038 |
|> is_funky_typedef thy (range_type T) |
3039 |
? fold (add_def_axiom depth) |
|
3040 |
(nondef_props_for_const thy true |
|
33192 | 3041 |
(extra_table def_table s) x) |
3042 |
else if is_rep_fun thy x then |
|
3043 |
accum |> fold (add_nondef_axiom depth) |
|
33197
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
3044 |
(nondef_props_for_const thy false nondef_table x) |
33571 | 3045 |
|> is_funky_typedef thy (range_type T) |
3046 |
? fold (add_def_axiom depth) |
|
3047 |
(nondef_props_for_const thy true |
|
33192 | 3048 |
(extra_table def_table s) x) |
3049 |
|> add_axioms_for_term depth |
|
3050 |
(Const (mate_of_rep_fun thy x)) |
|
3051 |
|> add_def_axiom depth (inverse_axiom_for_rep_fun thy x) |
|
3052 |
else |
|
3053 |
accum |> user_axioms <> SOME false |
|
3054 |
? fold (add_nondef_axiom depth) |
|
33197
de6285ebcc05
continuation of Nitpick's integration into Isabelle;
blanchet
parents:
33192
diff
changeset
|
3055 |
(nondef_props_for_const thy false nondef_table x) |
33192 | 3056 |
end) |
3057 |
|> add_axioms_for_type depth T |
|
3058 |
| Free (_, T) => add_axioms_for_type depth T accum |
|
3059 |
| Var (_, T) => add_axioms_for_type depth T accum |
|
3060 |
| Bound _ => accum |
|
3061 |
| Abs (_, T, t) => accum |> add_axioms_for_term depth t |
|
3062 |
|> add_axioms_for_type depth T |
|
3063 |
(* int -> typ -> accumulator -> accumulator *) |
|
3064 |
and add_axioms_for_type depth T = |
|
3065 |
case T of |
|
3066 |
Type ("fun", Ts) => fold (add_axioms_for_type depth) Ts |
|
3067 |
| Type ("*", Ts) => fold (add_axioms_for_type depth) Ts |
|
3068 |
| @{typ prop} => I |
|
3069 |
| @{typ bool} => I |
|
3070 |
| @{typ unit} => I |
|
3071 |
| TFree (_, S) => add_axioms_for_sort depth T S |
|
3072 |
| TVar (_, S) => add_axioms_for_sort depth T S |
|
3073 |
| Type (z as (_, Ts)) => |
|
3074 |
fold (add_axioms_for_type depth) Ts |
|
3075 |
#> (if is_pure_typedef thy T then |
|
3076 |
fold (add_def_axiom depth) (optimized_typedef_axioms thy z) |
|
3077 |
else if max_bisim_depth >= 0 andalso is_codatatype thy T then |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
3078 |
fold (add_def_axiom depth) (codatatype_bisim_axioms ext_ctxt T) |
33192 | 3079 |
else |
3080 |
I) |
|
3081 |
(* int -> typ -> sort -> accumulator -> accumulator *) |
|
3082 |
and add_axioms_for_sort depth T S = |
|
3083 |
let |
|
3084 |
val supers = Sign.complete_sort thy S |
|
3085 |
val class_axioms = |
|
3086 |
maps (fn class => map prop_of (AxClass.get_info thy class |> #axioms |
|
3087 |
handle ERROR _ => [])) supers |
|
3088 |
val monomorphic_class_axioms = |
|
3089 |
map (fn t => case Term.add_tvars t [] of |
|
3090 |
[] => t |
|
3091 |
| [(x, S)] => |
|
3092 |
Refute.monomorphic_term (Vartab.make [(x, (S, T))]) t |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
3093 |
| _ => raise TERM ("Nitpick_HOL.axioms_for_term.\ |
33192 | 3094 |
\add_axioms_for_sort", [t])) |
3095 |
class_axioms |
|
3096 |
in fold (add_nondef_axiom depth) monomorphic_class_axioms end |
|
3097 |
val (mono_user_nondefs, poly_user_nondefs) = |
|
3098 |
List.partition (null o Term.hidden_polymorphism) user_nondefs |
|
3099 |
val eval_axioms = map2 eval_axiom_for_term (index_seq 0 (length evals)) |
|
3100 |
evals |
|
3101 |
val (xs, (defs, nondefs)) = |
|
3102 |
([], ([], [])) |> add_axioms_for_term 1 t |
|
3103 |
|> fold_rev (add_def_axiom 1) eval_axioms |
|
3104 |
|> user_axioms = SOME true |
|
3105 |
? fold (add_nondef_axiom 1) mono_user_nondefs |
|
3106 |
val defs = defs @ special_congruence_axioms ext_ctxt xs |
|
3107 |
in |
|
3108 |
((defs, nondefs), (user_axioms = SOME true orelse null mono_user_nondefs, |
|
3109 |
null poly_user_nondefs)) |
|
3110 |
end |
|
3111 |
||
3112 |
(* theory -> const_table -> styp -> int list *) |
|
3113 |
fun const_format thy def_table (x as (s, T)) = |
|
3114 |
if String.isPrefix unrolled_prefix s then |
|
3115 |
const_format thy def_table (original_name s, range_type T) |
|
3116 |
else if String.isPrefix skolem_prefix s then |
|
3117 |
let |
|
3118 |
val k = unprefix skolem_prefix s |
|
3119 |
|> strip_first_name_sep |> fst |> space_explode "@" |
|
3120 |
|> hd |> Int.fromString |> the |
|
3121 |
in [k, num_binder_types T - k] end |
|
3122 |
else if original_name s <> s then |
|
3123 |
[num_binder_types T] |
|
3124 |
else case def_of_const thy def_table x of |
|
3125 |
SOME t' => if fixpoint_kind_of_rhs t' <> NoFp then |
|
3126 |
let val k = length (strip_abs_vars t') in |
|
3127 |
[k, num_binder_types T - k] |
|
3128 |
end |
|
3129 |
else |
|
3130 |
[num_binder_types T] |
|
3131 |
| NONE => [num_binder_types T] |
|
3132 |
(* int list -> int list -> int list *) |
|
3133 |
fun intersect_formats _ [] = [] |
|
3134 |
| intersect_formats [] _ = [] |
|
3135 |
| intersect_formats ks1 ks2 = |
|
3136 |
let val ((ks1', k1), (ks2', k2)) = pairself split_last (ks1, ks2) in |
|
3137 |
intersect_formats (ks1' @ (if k1 > k2 then [k1 - k2] else [])) |
|
3138 |
(ks2' @ (if k2 > k1 then [k2 - k1] else [])) @ |
|
3139 |
[Int.min (k1, k2)] |
|
3140 |
end |
|
3141 |
||
3142 |
(* theory -> const_table -> (term option * int list) list -> term -> int list *) |
|
3143 |
fun lookup_format thy def_table formats t = |
|
3144 |
case AList.lookup (fn (SOME x, SOME y) => |
|
3145 |
(term_match thy) (x, y) | _ => false) |
|
3146 |
formats (SOME t) of |
|
3147 |
SOME format => format |
|
3148 |
| NONE => let val format = the (AList.lookup (op =) formats NONE) in |
|
3149 |
case t of |
|
3150 |
Const x => intersect_formats format |
|
3151 |
(const_format thy def_table x) |
|
3152 |
| _ => format |
|
3153 |
end |
|
3154 |
||
3155 |
(* int list -> int list -> typ -> typ *) |
|
3156 |
fun format_type default_format format T = |
|
3157 |
let |
|
3158 |
val T = unbox_type T |
|
3159 |
val format = format |> filter (curry (op <) 0) |
|
3160 |
in |
|
3161 |
if forall (equal 1) format then |
|
3162 |
T |
|
3163 |
else |
|
3164 |
let |
|
3165 |
val (binder_Ts, body_T) = strip_type T |
|
3166 |
val batched = |
|
3167 |
binder_Ts |
|
3168 |
|> map (format_type default_format default_format) |
|
3169 |
|> rev |> chunk_list_unevenly (rev format) |
|
3170 |
|> map (HOLogic.mk_tupleT o rev) |
|
3171 |
in List.foldl (op -->) body_T batched end |
|
3172 |
end |
|
3173 |
(* theory -> const_table -> (term option * int list) list -> term -> typ *) |
|
3174 |
fun format_term_type thy def_table formats t = |
|
3175 |
format_type (the (AList.lookup (op =) formats NONE)) |
|
3176 |
(lookup_format thy def_table formats t) (fastype_of t) |
|
3177 |
||
3178 |
(* int list -> int -> int list -> int list *) |
|
3179 |
fun repair_special_format js m format = |
|
3180 |
m - 1 downto 0 |> chunk_list_unevenly (rev format) |
|
3181 |
|> map (rev o filter_out (member (op =) js)) |
|
3182 |
|> filter_out null |> map length |> rev |
|
3183 |
||
3184 |
(* extended_context -> string * string -> (term option * int list) list |
|
3185 |
-> styp -> term * typ *) |
|
3186 |
fun user_friendly_const ({thy, evals, def_table, skolems, special_funs, ...} |
|
3187 |
: extended_context) (base_name, step_name) formats = |
|
3188 |
let |
|
3189 |
val default_format = the (AList.lookup (op =) formats NONE) |
|
3190 |
(* styp -> term * typ *) |
|
3191 |
fun do_const (x as (s, T)) = |
|
3192 |
(if String.isPrefix special_prefix s then |
|
3193 |
let |
|
3194 |
(* term -> term *) |
|
3195 |
val do_term = map_aterms (fn Const x => fst (do_const x) | t' => t') |
|
3196 |
val (x' as (_, T'), js, ts) = |
|
3197 |
AList.find (op =) (!special_funs) (s, unbox_type T) |> the_single |
|
3198 |
val max_j = List.last js |
|
3199 |
val Ts = List.take (binder_types T', max_j + 1) |
|
3200 |
val missing_js = filter_out (member (op =) js) (0 upto max_j) |
|
3201 |
val missing_Ts = filter_indices missing_js Ts |
|
3202 |
(* int -> indexname *) |
|
3203 |
fun nth_missing_var n = |
|
3204 |
((arg_var_prefix ^ nat_subscript (n + 1), 0), nth missing_Ts n) |
|
3205 |
val missing_vars = map nth_missing_var (0 upto length missing_js - 1) |
|
3206 |
val vars = special_bounds ts @ missing_vars |
|
3207 |
val ts' = map2 (fn T => fn j => |
|
3208 |
case AList.lookup (op =) (js ~~ ts) j of |
|
3209 |
SOME t => do_term t |
|
3210 |
| NONE => |
|
3211 |
Var (nth missing_vars |
|
3212 |
(find_index (equal j) missing_js))) |
|
3213 |
Ts (0 upto max_j) |
|
3214 |
val t = do_const x' |> fst |
|
3215 |
val format = |
|
3216 |
case AList.lookup (fn (SOME t1, SOME t2) => term_match thy (t1, t2) |
|
3217 |
| _ => false) formats (SOME t) of |
|
3218 |
SOME format => |
|
3219 |
repair_special_format js (num_binder_types T') format |
|
3220 |
| NONE => |
|
3221 |
const_format thy def_table x' |
|
3222 |
|> repair_special_format js (num_binder_types T') |
|
3223 |
|> intersect_formats default_format |
|
3224 |
in |
|
3225 |
(list_comb (t, ts') |> fold_rev abs_var vars, |
|
3226 |
format_type default_format format T) |
|
3227 |
end |
|
3228 |
else if String.isPrefix uncurry_prefix s then |
|
3229 |
let |
|
3230 |
val (ss, s') = unprefix uncurry_prefix s |
|
3231 |
|> strip_first_name_sep |>> space_explode "@" |
|
3232 |
in |
|
3233 |
if String.isPrefix step_prefix s' then |
|
3234 |
do_const (s', T) |
|
3235 |
else |
|
3236 |
let |
|
3237 |
val k = the (Int.fromString (hd ss)) |
|
3238 |
val j = the (Int.fromString (List.last ss)) |
|
3239 |
val (before_Ts, (tuple_T, rest_T)) = |
|
3240 |
strip_n_binders j T ||> (strip_n_binders 1 #>> hd) |
|
3241 |
val T' = before_Ts ---> dest_n_tuple_type k tuple_T ---> rest_T |
|
3242 |
in do_const (s', T') end |
|
3243 |
end |
|
3244 |
else if String.isPrefix unrolled_prefix s then |
|
3245 |
let val t = Const (original_name s, range_type T) in |
|
3246 |
(lambda (Free (iter_var_prefix, nat_T)) t, |
|
3247 |
format_type default_format |
|
3248 |
(lookup_format thy def_table formats t) T) |
|
3249 |
end |
|
3250 |
else if String.isPrefix base_prefix s then |
|
3251 |
(Const (base_name, T --> T) $ Const (unprefix base_prefix s, T), |
|
3252 |
format_type default_format default_format T) |
|
3253 |
else if String.isPrefix step_prefix s then |
|
3254 |
(Const (step_name, T --> T) $ Const (unprefix step_prefix s, T), |
|
3255 |
format_type default_format default_format T) |
|
3256 |
else if String.isPrefix skolem_prefix s then |
|
3257 |
let |
|
3258 |
val ss = the (AList.lookup (op =) (!skolems) s) |
|
3259 |
val (Ts, Ts') = chop (length ss) (binder_types T) |
|
3260 |
val frees = map Free (ss ~~ Ts) |
|
3261 |
val s' = original_name s |
|
3262 |
in |
|
3263 |
(fold lambda frees (Const (s', Ts' ---> T)), |
|
3264 |
format_type default_format |
|
3265 |
(lookup_format thy def_table formats (Const x)) T) |
|
3266 |
end |
|
3267 |
else if String.isPrefix eval_prefix s then |
|
3268 |
let |
|
3269 |
val t = nth evals (the (Int.fromString (unprefix eval_prefix s))) |
|
3270 |
in (t, format_term_type thy def_table formats t) end |
|
3271 |
else if s = @{const_name undefined_fast_The} then |
|
3272 |
(Const (nitpick_prefix ^ "The fallback", T), |
|
3273 |
format_type default_format |
|
3274 |
(lookup_format thy def_table formats |
|
3275 |
(Const (@{const_name The}, (T --> bool_T) --> T))) T) |
|
3276 |
else if s = @{const_name undefined_fast_Eps} then |
|
3277 |
(Const (nitpick_prefix ^ "Eps fallback", T), |
|
3278 |
format_type default_format |
|
3279 |
(lookup_format thy def_table formats |
|
3280 |
(Const (@{const_name Eps}, (T --> bool_T) --> T))) T) |
|
3281 |
else |
|
3282 |
let val t = Const (original_name s, T) in |
|
3283 |
(t, format_term_type thy def_table formats t) |
|
3284 |
end) |
|
3285 |
|>> map_types (typ_subst [(@{typ bisim_iterator}, nat_T)] o unbox_type) |
|
3286 |
|>> shorten_const_names_in_term |>> shorten_abs_vars |
|
3287 |
in do_const end |
|
3288 |
||
3289 |
(* styp -> string *) |
|
3290 |
fun assign_operator_for_const (s, T) = |
|
3291 |
if String.isPrefix ubfp_prefix s then |
|
3292 |
if is_fun_type T then "\<subseteq>" else "\<le>" |
|
3293 |
else if String.isPrefix lbfp_prefix s then |
|
3294 |
if is_fun_type T then "\<supseteq>" else "\<ge>" |
|
3295 |
else if original_name s <> s then |
|
3296 |
assign_operator_for_const (after_name_sep s, T) |
|
3297 |
else |
|
3298 |
"=" |
|
3299 |
||
3300 |
(* extended_context -> term |
|
3301 |
-> ((term list * term list) * (bool * bool)) * term *) |
|
3302 |
fun preprocess_term (ext_ctxt as {thy, destroy_constrs, boxes, skolemize, |
|
3303 |
uncurry, ...}) t = |
|
3304 |
let |
|
3305 |
val skolem_depth = if skolemize then 4 else ~1 |
|
3306 |
val (((def_ts, nondef_ts), (got_all_mono_user_axioms, no_poly_user_axioms)), |
|
3307 |
core_t) = t |> unfold_defs_in_term ext_ctxt |
|
3308 |
|> Refute.close_form |
|
3309 |
|> skolemize_term_and_more ext_ctxt skolem_depth |
|
3310 |
|> specialize_consts_in_term ext_ctxt 0 |
|
3311 |
|> `(axioms_for_term ext_ctxt) |
|
3312 |
val maybe_box = exists (not_equal (SOME false) o snd) boxes |
|
3313 |
val table = |
|
3314 |
Termtab.empty |> uncurry |
|
3315 |
? fold (add_to_uncurry_table thy) (core_t :: def_ts @ nondef_ts) |
|
3316 |
(* bool -> bool -> term -> term *) |
|
3317 |
fun do_rest def core = |
|
3318 |
uncurry ? uncurry_term table |
|
3319 |
#> maybe_box ? box_fun_and_pair_in_term ext_ctxt def |
|
3320 |
#> destroy_constrs ? (pull_out_universal_constrs thy def |
|
3321 |
#> pull_out_existential_constrs thy |
|
33580
45c33e97cb86
added datatype constructor cache in Nitpick (to speed up the scope enumeration) and never test more than 4096 scopes
blanchet
parents:
33578
diff
changeset
|
3322 |
#> destroy_pulled_out_constrs ext_ctxt def) |
33192 | 3323 |
#> curry_assms |
3324 |
#> destroy_universal_equalities |
|
3325 |
#> destroy_existential_equalities thy |
|
3326 |
#> simplify_constrs_and_sels thy |
|
3327 |
#> distribute_quantifiers |
|
3328 |
#> push_quantifiers_inward thy |
|
3329 |
#> not core ? Refute.close_form |
|
3330 |
#> shorten_abs_vars |
|
3331 |
in |
|
3332 |
(((map (do_rest true false) def_ts, map (do_rest false false) nondef_ts), |
|
3333 |
(got_all_mono_user_axioms, no_poly_user_axioms)), |
|
3334 |
do_rest false true core_t) |
|
3335 |
end |
|
3336 |
||
3337 |
end; |