perform eta-expansion of quantifier bodies in Sledgehammer translation when needed + transform elim rules later;
it's a mistake to transform the elim rules too early because then we lose some info, e.g. "no_atp" attributes
1 (* Title: HOL/Tools/Nitpick/nitpick_util.ML
2 Author: Jasmin Blanchette, TU Muenchen
3 Copyright 2008, 2009, 2010
5 General-purpose functions used by the Nitpick modules.
8 signature NITPICK_UTIL =
10 type styp = string * typ
11 datatype polarity = Pos | Neg | Neut
13 exception ARG of string * string
14 exception BAD of string * string
15 exception TOO_SMALL of string * string
16 exception TOO_LARGE of string * string
17 exception NOT_SUPPORTED of string
18 exception SAME of unit
20 val nitpick_prefix : string
21 val curry3 : ('a * 'b * 'c -> 'd) -> 'a -> 'b -> 'c -> 'd
22 val pairf : ('a -> 'b) -> ('a -> 'c) -> 'a -> 'b * 'c
23 val pair_from_fun : (bool -> 'a) -> 'a * 'a
24 val fun_from_pair : 'a * 'a -> bool -> 'a
25 val int_from_bool : bool -> int
26 val nat_minus : int -> int -> int
27 val reasonable_power : int -> int -> int
28 val exact_log : int -> int -> int
29 val exact_root : int -> int -> int
30 val offset_list : int list -> int list
31 val index_seq : int -> int -> int list
32 val filter_indices : int list -> 'a list -> 'a list
33 val filter_out_indices : int list -> 'a list -> 'a list
34 val fold1 : ('a -> 'a -> 'a) -> 'a list -> 'a
35 val replicate_list : int -> 'a list -> 'a list
36 val n_fold_cartesian_product : 'a list list -> 'a list list
37 val all_distinct_unordered_pairs_of : ''a list -> (''a * ''a) list
38 val nth_combination : (int * int) list -> int -> int list
39 val all_combinations : (int * int) list -> int list list
40 val all_permutations : 'a list -> 'a list list
41 val batch_list : int -> 'a list -> 'a list list
42 val chunk_list_unevenly : int list -> 'a list -> 'a list list
43 val map3 : ('a -> 'b -> 'c -> 'd) -> 'a list -> 'b list -> 'c list -> 'd list
45 ('a * 'a -> bool) -> ('a option * 'b) list -> 'a -> 'b option
47 (''a * ''a -> bool) -> (''a option * 'b) list -> ''a -> 'b option
48 val is_substring_of : string -> string -> bool
49 val plural_s : int -> string
50 val plural_s_for_list : 'a list -> string
51 val serial_commas : string -> string list -> string list
52 val pretty_serial_commas : string -> Pretty.T list -> Pretty.T list
53 val parse_bool_option : bool -> string -> string -> bool option
54 val parse_time_option : string -> string -> Time.time option
55 val nat_subscript : int -> string
56 val flip_polarity : polarity -> polarity
61 val simple_string_of_typ : typ -> string
62 val is_real_constr : theory -> string * typ -> bool
64 Datatype_Aux.descr -> (Datatype_Aux.dtyp * typ) list -> Datatype_Aux.dtyp
66 val is_of_class_const : theory -> string * typ -> bool
67 val get_class_def : theory -> string -> (string * term) option
68 val monomorphic_term : Type.tyenv -> term -> term
69 val specialize_type : theory -> string * typ -> term -> term
70 val varify_type : Proof.context -> typ -> typ
71 val eta_expand : typ list -> term -> int -> term
72 val time_limit : Time.time option -> ('a -> 'b) -> 'a -> 'b
73 val DETERM_TIMEOUT : Time.time option -> tactic -> tactic
74 val setmp_show_all_types : ('a -> 'b) -> 'a -> 'b
76 val pstrs : string -> Pretty.T list
77 val unyxml : string -> string
78 val pretty_maybe_quote : Pretty.T -> Pretty.T
79 val hashw : word * word -> word
80 val hashw_string : string * word -> word
83 structure Nitpick_Util : NITPICK_UTIL =
86 type styp = string * typ
88 datatype polarity = Pos | Neg | Neut
90 exception ARG of string * string
91 exception BAD of string * string
92 exception TOO_SMALL of string * string
93 exception TOO_LARGE of string * string
94 exception NOT_SUPPORTED of string
95 exception SAME of unit
97 val nitpick_prefix = "Nitpick."
99 fun curry3 f = fn x => fn y => fn z => f (x, y, z)
101 fun pairf f g x = (f x, g x)
103 fun pair_from_fun f = (f false, f true)
104 fun fun_from_pair (f, t) b = if b then t else f
106 fun int_from_bool b = if b then 1 else 0
107 fun nat_minus i j = if i > j then i - j else 0
109 val max_exponent = 16384
111 fun reasonable_power _ 0 = 1
112 | reasonable_power a 1 = a
113 | reasonable_power 0 _ = 0
114 | reasonable_power 1 _ = 1
115 | reasonable_power a b =
117 raise ARG ("Nitpick_Util.reasonable_power",
118 "negative exponent (" ^ signed_string_of_int b ^ ")")
119 else if b > max_exponent then
120 raise TOO_LARGE ("Nitpick_Util.reasonable_power",
121 "too large exponent (" ^ signed_string_of_int b ^ ")")
123 let val c = reasonable_power a (b div 2) in
124 c * c * reasonable_power a (b mod 2)
129 val r = Math.ln (Real.fromInt n) / Math.ln (Real.fromInt m) |> Real.round
131 if reasonable_power m r = n then
134 raise ARG ("Nitpick_Util.exact_log",
135 commas (map signed_string_of_int [m, n]))
139 let val r = Math.pow (Real.fromInt n, 1.0 / (Real.fromInt m)) |> Real.round in
140 if reasonable_power r m = n then
143 raise ARG ("Nitpick_Util.exact_root",
144 commas (map signed_string_of_int [m, n]))
147 fun fold1 f = foldl1 (uncurry f)
149 fun replicate_list 0 _ = []
150 | replicate_list n xs = xs @ replicate_list (n - 1) xs
152 fun offset_list ns = rev (tl (fold (fn x => fn xs => (x + hd xs) :: xs) ns [0]))
153 fun index_seq j0 n = if j0 < 0 then j0 downto j0 - n + 1 else j0 upto j0 + n - 1
155 fun filter_indices js xs =
158 | aux i (j :: js) (x :: xs) =
159 if i = j then x :: aux (i + 1) js xs else aux (i + 1) (j :: js) xs
160 | aux _ _ _ = raise ARG ("Nitpick_Util.filter_indices",
161 "indices unordered or out of range")
163 fun filter_out_indices js xs =
166 | aux i (j :: js) (x :: xs) =
167 if i = j then aux (i + 1) js xs else x :: aux (i + 1) (j :: js) xs
168 | aux _ _ _ = raise ARG ("Nitpick_Util.filter_out_indices",
169 "indices unordered or out of range")
172 fun cartesian_product [] _ = []
173 | cartesian_product (x :: xs) yss =
174 map (cons x) yss @ cartesian_product xs yss
175 fun n_fold_cartesian_product xss = fold_rev cartesian_product xss [[]]
176 fun all_distinct_unordered_pairs_of [] = []
177 | all_distinct_unordered_pairs_of (x :: xs) =
178 map (pair x) xs @ all_distinct_unordered_pairs_of xs
180 val nth_combination =
182 fun aux [] n = ([], n)
183 | aux ((k, j0) :: xs) n =
184 let val (js, n) = aux xs n in ((n mod k) + j0 :: js, n div k) end
187 val all_combinations = n_fold_cartesian_product o map (uncurry index_seq o swap)
189 fun all_permutations [] = [[]]
190 | all_permutations xs =
191 maps (fn j => map (cons (nth xs j)) (all_permutations (nth_drop j xs)))
192 (index_seq 0 (length xs))
194 fun batch_list _ [] = []
196 if length xs <= k then [xs]
197 else List.take (xs, k) :: batch_list k (List.drop (xs, k))
199 fun chunk_list_unevenly _ [] = []
200 | chunk_list_unevenly [] ys = map single ys
201 | chunk_list_unevenly (k :: ks) ys =
202 let val (ys1, ys2) = chop k ys in ys1 :: chunk_list_unevenly ks ys2 end
204 fun map3 _ [] [] [] = []
205 | map3 f (x :: xs) (y :: ys) (z :: zs) = f x y z :: map3 f xs ys zs
206 | map3 _ _ _ _ = raise UnequalLengths
208 fun double_lookup eq ps key =
209 case AList.lookup (fn (SOME x, SOME y) => eq (x, y) | _ => false) ps
212 | NONE => ps |> find_first (is_none o fst) |> Option.map snd
213 fun triple_lookup _ [(NONE, z)] _ = SOME z
214 | triple_lookup eq ps key =
215 case AList.lookup (op =) ps (SOME key) of
217 | NONE => double_lookup eq ps key
219 fun is_substring_of needle stack =
220 not (Substring.isEmpty (snd (Substring.position needle
221 (Substring.full stack))))
223 val plural_s = Sledgehammer_Util.plural_s
224 fun plural_s_for_list xs = plural_s (length xs)
226 val serial_commas = Sledgehammer_Util.serial_commas
228 fun pretty_serial_commas _ [] = []
229 | pretty_serial_commas _ [p] = [p]
230 | pretty_serial_commas conj [p1, p2] =
231 [p1, Pretty.brk 1, Pretty.str conj, Pretty.brk 1, p2]
232 | pretty_serial_commas conj [p1, p2, p3] =
233 [p1, Pretty.str ",", Pretty.brk 1, p2, Pretty.str ",", Pretty.brk 1,
234 Pretty.str conj, Pretty.brk 1, p3]
235 | pretty_serial_commas conj (p :: ps) =
236 p :: Pretty.str "," :: Pretty.brk 1 :: pretty_serial_commas conj ps
238 val parse_bool_option = Sledgehammer_Util.parse_bool_option
239 val parse_time_option = Sledgehammer_Util.parse_time_option
241 val i_subscript = implode o map (prefix "\<^isub>") o explode
242 fun be_subscript s = "\<^bsub>" ^ s ^ "\<^esub>"
243 fun nat_subscript n =
244 let val s = signed_string_of_int n in
245 if print_mode_active Symbol.xsymbolsN then
246 (* cheap trick to ensure proper alphanumeric ordering for one- and
248 (if n <= 9 then be_subscript else i_subscript) s
253 fun flip_polarity Pos = Neg
254 | flip_polarity Neg = Pos
255 | flip_polarity Neut = Neut
257 val prop_T = @{typ prop}
258 val bool_T = @{typ bool}
259 val nat_T = @{typ nat}
260 val int_T = @{typ int}
262 val simple_string_of_typ = Refute.string_of_typ
263 val is_real_constr = Refute.is_IDT_constructor
264 val typ_of_dtyp = Refute.typ_of_dtyp
265 val is_of_class_const = Refute.is_const_of_class
266 val get_class_def = Refute.get_classdef
267 val monomorphic_term = Sledgehammer_Util.monomorphic_term
268 val specialize_type = Sledgehammer_Util.specialize_type
270 fun varify_type ctxt T =
271 Variable.polymorphic_types ctxt [Const (@{const_name undefined}, T)]
272 |> snd |> the_single |> dest_Const |> snd
274 val eta_expand = Sledgehammer_Util.eta_expand
276 fun time_limit NONE = I
277 | time_limit (SOME delay) = TimeLimit.timeLimit delay
279 fun DETERM_TIMEOUT delay tac st =
280 Seq.of_list (the_list (time_limit delay (fn () => SINGLE tac st) ()))
282 fun setmp_show_all_types f =
283 setmp_CRITICAL show_all_types
284 (!show_types orelse !show_sorts orelse !show_all_types) f
288 val pstrs = Pretty.breaks o map Pretty.str o space_explode " "
290 val unyxml = Sledgehammer_Util.unyxml
292 val maybe_quote = Sledgehammer_Util.maybe_quote
293 fun pretty_maybe_quote pretty =
294 let val s = Pretty.str_of pretty in
295 if maybe_quote s = s then pretty else Pretty.enum "" "\"" "\"" [pretty]
298 (* This hash function is recommended in Compilers: Principles, Techniques, and
299 Tools, by Aho, Sethi, and Ullman. The "hashpjw" function, which they
300 particularly recommend, triggers a bug in versions of Poly/ML up to 4.2.0. *)
301 fun hashw (u, w) = Word.+ (u, Word.* (0w65599, w))
302 fun hashw_char (c, w) = hashw (Word.fromInt (Char.ord c), w)
303 fun hashw_string (s:string, w) = CharVector.foldl hashw_char w s