author | bulwahn |
Thu, 21 Oct 2010 19:13:07 +0200 | |
changeset 40049 | 75d9f57123d6 |
parent 40048 | f3a46d524101 |
child 40051 | b6acda4d1c29 |
permissions | -rw-r--r-- |
33265 | 1 |
(* Title: HOL/Tools/Predicate_Compile/predicate_compile_aux.ML |
2 |
Author: Lukas Bulwahn, TU Muenchen |
|
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
3 |
|
33265 | 4 |
Auxilary functions for predicate compiler. |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
5 |
*) |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
6 |
|
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
7 |
signature PREDICATE_COMPILE_AUX = |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
8 |
sig |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
9 |
(* general functions *) |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
10 |
val apfst3 : ('a -> 'd) -> 'a * 'b * 'c -> 'd * 'b * 'c |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
11 |
val apsnd3 : ('b -> 'd) -> 'a * 'b * 'c -> 'a * 'd * 'c |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
12 |
val aptrd3 : ('c -> 'd) -> 'a * 'b * 'c -> 'a * 'b * 'd |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
13 |
val find_indices : ('a -> bool) -> 'a list -> int list |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
14 |
val assert : bool -> unit |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
15 |
(* mode *) |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
16 |
datatype mode = Bool | Input | Output | Pair of mode * mode | Fun of mode * mode |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
17 |
val eq_mode : mode * mode -> bool |
39311 | 18 |
val mode_ord: mode * mode -> order |
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
19 |
val list_fun_mode : mode list -> mode |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
20 |
val strip_fun_mode : mode -> mode list |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
21 |
val dest_fun_mode : mode -> mode list |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
22 |
val dest_tuple_mode : mode -> mode list |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
23 |
val all_modes_of_typ : typ -> mode list |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
24 |
val all_smodes_of_typ : typ -> mode list |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
25 |
val fold_map_aterms_prodT : ('a -> 'a -> 'a) -> (typ -> 'b -> 'a * 'b) -> typ -> 'b -> 'a * 'b |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
26 |
val map_filter_prod : (term -> term option) -> term -> term option |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
27 |
val replace_ho_args : mode -> term list -> term list -> term list |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
28 |
val ho_arg_modes_of : mode -> mode list |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
29 |
val ho_argsT_of : mode -> typ list -> typ list |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
30 |
val ho_args_of : mode -> term list -> term list |
39299
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
31 |
val ho_args_of_typ : typ -> term list -> term list |
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
32 |
val ho_argsT_of_typ : typ list -> typ list |
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
33 |
val split_map_mode : (mode -> term -> term option * term option) |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
34 |
-> mode -> term list -> term list * term list |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
35 |
val split_map_modeT : (mode -> typ -> typ option * typ option) |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
36 |
-> mode -> typ list -> typ list * typ list |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
37 |
val split_mode : mode -> term list -> term list * term list |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
38 |
val split_modeT' : mode -> typ list -> typ list * typ list |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
39 |
val string_of_mode : mode -> string |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
40 |
val ascii_string_of_mode : mode -> string |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
41 |
(* premises *) |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
42 |
datatype indprem = Prem of term | Negprem of term | Sidecond of term |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
43 |
| Generator of (string * typ) |
36251
5fd5d732a4ea
only add relevant predicates to the list of extra modes
bulwahn
parents:
36248
diff
changeset
|
44 |
val dest_indprem : indprem -> term |
36254 | 45 |
val map_indprem : (term -> term) -> indprem -> indprem |
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
46 |
(* general syntactic functions *) |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
47 |
val conjuncts : term -> term list |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
48 |
val is_equationlike : thm -> bool |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
49 |
val is_pred_equation : thm -> bool |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
50 |
val is_intro : string -> thm -> bool |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
51 |
val is_predT : typ -> bool |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
52 |
val is_constrt : theory -> term -> bool |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
53 |
val is_constr : Proof.context -> string -> bool |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
54 |
val focus_ex : term -> Name.context -> ((string * typ) list * term) * Name.context |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
55 |
val strip_all : term -> (string * typ) list * term |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
56 |
(* introduction rule combinators *) |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
57 |
val map_atoms : (term -> term) -> term -> term |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
58 |
val fold_atoms : (term -> 'a -> 'a) -> term -> 'a -> 'a |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
59 |
val fold_map_atoms : (term -> 'a -> term * 'a) -> term -> 'a -> term * 'a |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
60 |
val maps_premises : (term -> term list) -> term -> term |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
61 |
val map_concl : (term -> term) -> term -> term |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
62 |
val map_term : theory -> (term -> term) -> thm -> thm |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
63 |
(* split theorems of case expressions *) |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
64 |
val prepare_split_thm : Proof.context -> thm -> thm |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
65 |
val find_split_thm : theory -> term -> thm option |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
66 |
(* datastructures and setup for generic compilation *) |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
67 |
datatype compilation_funs = CompilationFuns of { |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
68 |
mk_predT : typ -> typ, |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
69 |
dest_predT : typ -> typ, |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
70 |
mk_bot : typ -> term, |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
71 |
mk_single : term -> term, |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
72 |
mk_bind : term * term -> term, |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
73 |
mk_sup : term * term -> term, |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
74 |
mk_if : term -> term, |
36049
0ce5b7a5c2fd
adding iterate_upto interface in compilations and iterate_upto functions in Isabelle theories for arithmetic setup of the predicate compiler
bulwahn
parents:
36047
diff
changeset
|
75 |
mk_iterate_upto : typ -> term * term * term -> term, |
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
76 |
mk_not : term -> term, |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
77 |
mk_map : typ -> typ -> term -> term -> term |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
78 |
}; |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
79 |
val mk_predT : compilation_funs -> typ -> typ |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
80 |
val dest_predT : compilation_funs -> typ -> typ |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
81 |
val mk_bot : compilation_funs -> typ -> term |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
82 |
val mk_single : compilation_funs -> term -> term |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
83 |
val mk_bind : compilation_funs -> term * term -> term |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
84 |
val mk_sup : compilation_funs -> term * term -> term |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
85 |
val mk_if : compilation_funs -> term -> term |
36049
0ce5b7a5c2fd
adding iterate_upto interface in compilations and iterate_upto functions in Isabelle theories for arithmetic setup of the predicate compiler
bulwahn
parents:
36047
diff
changeset
|
86 |
val mk_iterate_upto : compilation_funs -> typ -> term * term * term -> term |
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
87 |
val mk_not : compilation_funs -> term -> term |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
88 |
val mk_map : compilation_funs -> typ -> typ -> term -> term -> term |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
89 |
val funT_of : compilation_funs -> mode -> typ -> typ |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
90 |
(* Different compilations *) |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
91 |
datatype compilation = Pred | Depth_Limited | Random | Depth_Limited_Random | DSeq | Annotated |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
92 |
| Pos_Random_DSeq | Neg_Random_DSeq | New_Pos_Random_DSeq | New_Neg_Random_DSeq |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
93 |
val negative_compilation_of : compilation -> compilation |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
94 |
val compilation_for_polarity : bool -> compilation -> compilation |
40049
75d9f57123d6
adding decreasing bind and non-decreasing bind; depth-limited and depth-unlimited compilation possible
bulwahn
parents:
40048
diff
changeset
|
95 |
val is_depth_limited_compilation : compilation -> bool |
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
96 |
val string_of_compilation : compilation -> string |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
97 |
val compilation_names : (string * compilation) list |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
98 |
val non_random_compilations : compilation list |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
99 |
val random_compilations : compilation list |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
100 |
(* Different options for compiler *) |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
101 |
datatype options = Options of { |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
102 |
expected_modes : (string * mode list) option, |
39382
c797f3ab2ae1
proposed modes for code_pred now supports modes for mutual predicates
bulwahn
parents:
39312
diff
changeset
|
103 |
proposed_modes : (string * mode list) list, |
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
104 |
proposed_names : ((string * mode) * string) list, |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
105 |
show_steps : bool, |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
106 |
show_proof_trace : bool, |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
107 |
show_intermediate_results : bool, |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
108 |
show_mode_inference : bool, |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
109 |
show_modes : bool, |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
110 |
show_compilation : bool, |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
111 |
show_caught_failures : bool, |
39383
ddfafa97da2f
adding option show_invalid_clauses for a more detailed message when modes are not inferred
bulwahn
parents:
39382
diff
changeset
|
112 |
show_invalid_clauses : bool, |
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
113 |
skip_proof : bool, |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
114 |
no_topmost_reordering : bool, |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
115 |
function_flattening : bool, |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
116 |
fail_safe_function_flattening : bool, |
36248
9ed1a37de465
added option for specialisation to the predicate compiler
bulwahn
parents:
36246
diff
changeset
|
117 |
specialise : bool, |
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
118 |
no_higher_order_predicate : string list, |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
119 |
inductify : bool, |
36254 | 120 |
detect_switches : bool, |
40048
f3a46d524101
adding option smart_depth_limiting to predicate compiler
bulwahn
parents:
39802
diff
changeset
|
121 |
smart_depth_limiting : bool, |
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
122 |
compilation : compilation |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
123 |
}; |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
124 |
val expected_modes : options -> (string * mode list) option |
39382
c797f3ab2ae1
proposed modes for code_pred now supports modes for mutual predicates
bulwahn
parents:
39312
diff
changeset
|
125 |
val proposed_modes : options -> string -> mode list option |
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
126 |
val proposed_names : options -> string -> mode -> string option |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
127 |
val show_steps : options -> bool |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
128 |
val show_proof_trace : options -> bool |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
129 |
val show_intermediate_results : options -> bool |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
130 |
val show_mode_inference : options -> bool |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
131 |
val show_modes : options -> bool |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
132 |
val show_compilation : options -> bool |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
133 |
val show_caught_failures : options -> bool |
39383
ddfafa97da2f
adding option show_invalid_clauses for a more detailed message when modes are not inferred
bulwahn
parents:
39382
diff
changeset
|
134 |
val show_invalid_clauses : options -> bool |
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
135 |
val skip_proof : options -> bool |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
136 |
val no_topmost_reordering : options -> bool |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
137 |
val function_flattening : options -> bool |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
138 |
val fail_safe_function_flattening : options -> bool |
36248
9ed1a37de465
added option for specialisation to the predicate compiler
bulwahn
parents:
36246
diff
changeset
|
139 |
val specialise : options -> bool |
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
140 |
val no_higher_order_predicate : options -> string list |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
141 |
val is_inductify : options -> bool |
36254 | 142 |
val detect_switches : options -> bool |
40048
f3a46d524101
adding option smart_depth_limiting to predicate compiler
bulwahn
parents:
39802
diff
changeset
|
143 |
val smart_depth_limiting : options -> bool |
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
144 |
val compilation : options -> compilation |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
145 |
val default_options : options |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
146 |
val bool_options : string list |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
147 |
val print_step : options -> string -> unit |
39657
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
148 |
(* conversions *) |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
149 |
val imp_prems_conv : conv -> conv |
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
150 |
(* simple transformations *) |
39787
a44f6b11cdc4
adding splitting of conjuncts in assumptions as forward rule on theorems; replacing term transformation for splitting conjuncts by theorem transformation; removing obsolete functions; tuned
bulwahn
parents:
39658
diff
changeset
|
151 |
val split_conjuncts_in_assms : Proof.context -> thm -> thm |
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
152 |
val expand_tuples : theory -> thm -> thm |
39802
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
153 |
val case_betapply : theory -> term -> term |
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
154 |
val eta_contract_ho_arguments : theory -> thm -> thm |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
155 |
val remove_equalities : theory -> thm -> thm |
36246
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
156 |
val remove_pointless_clauses : thm -> thm list |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
157 |
val peephole_optimisation : theory -> thm -> thm option |
39541
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
158 |
val define_quickcheck_predicate : |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
159 |
term -> theory -> (((string * typ) * (string * typ) list) * thm) * theory |
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
160 |
end; |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
161 |
|
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
162 |
structure Predicate_Compile_Aux : PREDICATE_COMPILE_AUX = |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
163 |
struct |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
164 |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
165 |
(* general functions *) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
166 |
|
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
167 |
fun apfst3 f (x, y, z) = (f x, y, z) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
168 |
fun apsnd3 f (x, y, z) = (x, f y, z) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
169 |
fun aptrd3 f (x, y, z) = (x, y, f z) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
170 |
|
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
171 |
fun comb_option f (SOME x1, SOME x2) = SOME (f (x1, x2)) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
172 |
| comb_option f (NONE, SOME x2) = SOME x2 |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
173 |
| comb_option f (SOME x1, NONE) = SOME x1 |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
174 |
| comb_option f (NONE, NONE) = NONE |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
175 |
|
35885
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
176 |
fun map2_optional f (x :: xs) (y :: ys) = f x (SOME y) :: (map2_optional f xs ys) |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
177 |
| map2_optional f (x :: xs) [] = (f x NONE) :: (map2_optional f xs []) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
178 |
| map2_optional f [] [] = [] |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
179 |
|
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
180 |
fun find_indices f xs = |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
181 |
map_filter (fn (i, true) => SOME i | (i, false) => NONE) (map_index (apsnd f) xs) |
33328
1d93dd8a02c9
moved datatype mode and string functions to the auxillary structure
bulwahn
parents:
33327
diff
changeset
|
182 |
|
35885
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
183 |
fun assert check = if check then () else raise Fail "Assertion failed!" |
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
184 |
|
33328
1d93dd8a02c9
moved datatype mode and string functions to the auxillary structure
bulwahn
parents:
33327
diff
changeset
|
185 |
(* mode *) |
1d93dd8a02c9
moved datatype mode and string functions to the auxillary structure
bulwahn
parents:
33327
diff
changeset
|
186 |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
187 |
datatype mode = Bool | Input | Output | Pair of mode * mode | Fun of mode * mode |
33619
d93a3cb55068
first steps towards a new mode datastructure; new syntax for mode annotations and new output of modes
bulwahn
parents:
33473
diff
changeset
|
188 |
|
33623
4ec42d38224f
changed modes to expected_modes; added UNION to code_pred_inlining; fixed some examples; tuned
bulwahn
parents:
33620
diff
changeset
|
189 |
(* equality of instantiatedness with respect to equivalences: |
4ec42d38224f
changed modes to expected_modes; added UNION to code_pred_inlining; fixed some examples; tuned
bulwahn
parents:
33620
diff
changeset
|
190 |
Pair Input Input == Input and Pair Output Output == Output *) |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
191 |
fun eq_mode (Fun (m1, m2), Fun (m3, m4)) = eq_mode (m1, m3) andalso eq_mode (m2, m4) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
192 |
| eq_mode (Pair (m1, m2), Pair (m3, m4)) = eq_mode (m1, m3) andalso eq_mode (m2, m4) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
193 |
| eq_mode (Pair (m1, m2), Input) = eq_mode (m1, Input) andalso eq_mode (m2, Input) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
194 |
| eq_mode (Pair (m1, m2), Output) = eq_mode (m1, Output) andalso eq_mode (m2, Output) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
195 |
| eq_mode (Input, Pair (m1, m2)) = eq_mode (Input, m1) andalso eq_mode (Input, m2) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
196 |
| eq_mode (Output, Pair (m1, m2)) = eq_mode (Output, m1) andalso eq_mode (Output, m2) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
197 |
| eq_mode (Input, Input) = true |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
198 |
| eq_mode (Output, Output) = true |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
199 |
| eq_mode (Bool, Bool) = true |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
200 |
| eq_mode _ = false |
33623
4ec42d38224f
changed modes to expected_modes; added UNION to code_pred_inlining; fixed some examples; tuned
bulwahn
parents:
33620
diff
changeset
|
201 |
|
39311 | 202 |
fun mode_ord (Input, Output) = LESS |
203 |
| mode_ord (Output, Input) = GREATER |
|
204 |
| mode_ord (Input, Input) = EQUAL |
|
205 |
| mode_ord (Output, Output) = EQUAL |
|
206 |
| mode_ord (Bool, Bool) = EQUAL |
|
207 |
| mode_ord (Pair (m1, m2), Pair (m3, m4)) = prod_ord mode_ord mode_ord ((m1, m2), (m3, m4)) |
|
208 |
| mode_ord (Fun (m1, m2), Fun (m3, m4)) = prod_ord mode_ord mode_ord ((m1, m2), (m3, m4)) |
|
209 |
||
36035
d82682936c52
adding registration of functions in the function flattening
bulwahn
parents:
36032
diff
changeset
|
210 |
fun list_fun_mode [] = Bool |
d82682936c52
adding registration of functions in the function flattening
bulwahn
parents:
36032
diff
changeset
|
211 |
| list_fun_mode (m :: ms) = Fun (m, list_fun_mode ms) |
d82682936c52
adding registration of functions in the function flattening
bulwahn
parents:
36032
diff
changeset
|
212 |
|
33619
d93a3cb55068
first steps towards a new mode datastructure; new syntax for mode annotations and new output of modes
bulwahn
parents:
33473
diff
changeset
|
213 |
(* name: binder_modes? *) |
d93a3cb55068
first steps towards a new mode datastructure; new syntax for mode annotations and new output of modes
bulwahn
parents:
33473
diff
changeset
|
214 |
fun strip_fun_mode (Fun (mode, mode')) = mode :: strip_fun_mode mode' |
d93a3cb55068
first steps towards a new mode datastructure; new syntax for mode annotations and new output of modes
bulwahn
parents:
33473
diff
changeset
|
215 |
| strip_fun_mode Bool = [] |
35885
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
216 |
| strip_fun_mode _ = raise Fail "Bad mode for strip_fun_mode" |
33619
d93a3cb55068
first steps towards a new mode datastructure; new syntax for mode annotations and new output of modes
bulwahn
parents:
33473
diff
changeset
|
217 |
|
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
218 |
(* name: strip_fun_mode? *) |
33619
d93a3cb55068
first steps towards a new mode datastructure; new syntax for mode annotations and new output of modes
bulwahn
parents:
33473
diff
changeset
|
219 |
fun dest_fun_mode (Fun (mode, mode')) = mode :: dest_fun_mode mode' |
d93a3cb55068
first steps towards a new mode datastructure; new syntax for mode annotations and new output of modes
bulwahn
parents:
33473
diff
changeset
|
220 |
| dest_fun_mode mode = [mode] |
d93a3cb55068
first steps towards a new mode datastructure; new syntax for mode annotations and new output of modes
bulwahn
parents:
33473
diff
changeset
|
221 |
|
d93a3cb55068
first steps towards a new mode datastructure; new syntax for mode annotations and new output of modes
bulwahn
parents:
33473
diff
changeset
|
222 |
fun dest_tuple_mode (Pair (mode, mode')) = mode :: dest_tuple_mode mode' |
d93a3cb55068
first steps towards a new mode datastructure; new syntax for mode annotations and new output of modes
bulwahn
parents:
33473
diff
changeset
|
223 |
| dest_tuple_mode _ = [] |
d93a3cb55068
first steps towards a new mode datastructure; new syntax for mode annotations and new output of modes
bulwahn
parents:
33473
diff
changeset
|
224 |
|
35324
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
225 |
fun all_modes_of_typ' (T as Type ("fun", _)) = |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
226 |
let |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
227 |
val (S, U) = strip_type T |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
228 |
in |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
229 |
if U = HOLogic.boolT then |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
230 |
fold_rev (fn m1 => fn m2 => map_product (curry Fun) m1 m2) |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
231 |
(map all_modes_of_typ' S) [Bool] |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
232 |
else |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
233 |
[Input, Output] |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
234 |
end |
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37391
diff
changeset
|
235 |
| all_modes_of_typ' (Type (@{type_name Product_Type.prod}, [T1, T2])) = |
35324
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
236 |
map_product (curry Pair) (all_modes_of_typ' T1) (all_modes_of_typ' T2) |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
237 |
| all_modes_of_typ' _ = [Input, Output] |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
238 |
|
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
239 |
fun all_modes_of_typ (T as Type ("fun", _)) = |
35885
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
240 |
let |
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
241 |
val (S, U) = strip_type T |
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
242 |
in |
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
243 |
if U = @{typ bool} then |
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
244 |
fold_rev (fn m1 => fn m2 => map_product (curry Fun) m1 m2) |
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
245 |
(map all_modes_of_typ' S) [Bool] |
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
246 |
else |
39192
f302ed18f42f
raising an exception instead of guessing some reasonable behaviour for this function
bulwahn
parents:
38864
diff
changeset
|
247 |
raise Fail "Invocation of all_modes_of_typ with a non-predicate type" |
35885
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
248 |
end |
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
249 |
| all_modes_of_typ @{typ bool} = [Bool] |
39192
f302ed18f42f
raising an exception instead of guessing some reasonable behaviour for this function
bulwahn
parents:
38864
diff
changeset
|
250 |
| all_modes_of_typ T = |
f302ed18f42f
raising an exception instead of guessing some reasonable behaviour for this function
bulwahn
parents:
38864
diff
changeset
|
251 |
raise Fail "Invocation of all_modes_of_typ with a non-predicate type" |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
252 |
|
35324
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
253 |
fun all_smodes_of_typ (T as Type ("fun", _)) = |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
254 |
let |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
255 |
val (S, U) = strip_type T |
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37391
diff
changeset
|
256 |
fun all_smodes (Type (@{type_name Product_Type.prod}, [T1, T2])) = |
35324
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
257 |
map_product (curry Pair) (all_smodes T1) (all_smodes T2) |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
258 |
| all_smodes _ = [Input, Output] |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
259 |
in |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
260 |
if U = HOLogic.boolT then |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
261 |
fold_rev (fn m1 => fn m2 => map_product (curry Fun) m1 m2) (map all_smodes S) [Bool] |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
262 |
else |
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
263 |
raise Fail "invalid type for predicate" |
35324
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
264 |
end |
35885
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
265 |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
266 |
fun ho_arg_modes_of mode = |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
267 |
let |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
268 |
fun ho_arg_mode (m as Fun _) = [m] |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
269 |
| ho_arg_mode (Pair (m1, m2)) = ho_arg_mode m1 @ ho_arg_mode m2 |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
270 |
| ho_arg_mode _ = [] |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
271 |
in |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
272 |
maps ho_arg_mode (strip_fun_mode mode) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
273 |
end |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
274 |
|
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
275 |
fun ho_args_of mode ts = |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
276 |
let |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
277 |
fun ho_arg (Fun _) (SOME t) = [t] |
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
278 |
| ho_arg (Fun _) NONE = raise Fail "mode and term do not match" |
35885
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
279 |
| ho_arg (Pair (m1, m2)) (SOME (Const (@{const_name Pair}, _) $ t1 $ t2)) = |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
280 |
ho_arg m1 (SOME t1) @ ho_arg m2 (SOME t2) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
281 |
| ho_arg (Pair (m1, m2)) NONE = ho_arg m1 NONE @ ho_arg m2 NONE |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
282 |
| ho_arg _ _ = [] |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
283 |
in |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
284 |
flat (map2_optional ho_arg (strip_fun_mode mode) ts) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
285 |
end |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
286 |
|
39299
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
287 |
fun ho_args_of_typ T ts = |
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
288 |
let |
39312
968c33be5c96
handling function types more carefully than in e98a06145530
bulwahn
parents:
39311
diff
changeset
|
289 |
fun ho_arg (T as Type("fun", [_,_])) (SOME t) = if body_type T = @{typ bool} then [t] else [] |
39299
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
290 |
| ho_arg (Type("fun", [_,_])) NONE = raise Fail "mode and term do not match" |
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
291 |
| ho_arg (Type(@{type_name "Product_Type.prod"}, [T1, T2])) |
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
292 |
(SOME (Const (@{const_name Pair}, _) $ t1 $ t2)) = |
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
293 |
ho_arg T1 (SOME t1) @ ho_arg T2 (SOME t2) |
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
294 |
| ho_arg (Type(@{type_name "Product_Type.prod"}, [T1, T2])) NONE = |
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
295 |
ho_arg T1 NONE @ ho_arg T2 NONE |
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
296 |
| ho_arg _ _ = [] |
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
297 |
in |
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
298 |
flat (map2_optional ho_arg (binder_types T) ts) |
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
299 |
end |
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
300 |
|
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
301 |
fun ho_argsT_of_typ Ts = |
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
302 |
let |
39312
968c33be5c96
handling function types more carefully than in e98a06145530
bulwahn
parents:
39311
diff
changeset
|
303 |
fun ho_arg (T as Type("fun", [_,_])) = if body_type T = @{typ bool} then [T] else [] |
39299
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
304 |
| ho_arg (Type(@{type_name "Product_Type.prod"}, [T1, T2])) = |
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
305 |
ho_arg T1 @ ho_arg T2 |
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
306 |
| ho_arg _ = [] |
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
307 |
in |
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
308 |
maps ho_arg Ts |
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
309 |
end |
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
310 |
|
e98a06145530
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn
parents:
39192
diff
changeset
|
311 |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
312 |
(* temporary function should be replaced by unsplit_input or so? *) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
313 |
fun replace_ho_args mode hoargs ts = |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
314 |
let |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
315 |
fun replace (Fun _, _) (arg' :: hoargs') = (arg', hoargs') |
37391 | 316 |
| replace (Pair (m1, m2), Const (@{const_name Pair}, T) $ t1 $ t2) hoargs = |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
317 |
let |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
318 |
val (t1', hoargs') = replace (m1, t1) hoargs |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
319 |
val (t2', hoargs'') = replace (m2, t2) hoargs' |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
320 |
in |
37391 | 321 |
(Const (@{const_name Pair}, T) $ t1' $ t2', hoargs'') |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
322 |
end |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
323 |
| replace (_, t) hoargs = (t, hoargs) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
324 |
in |
35885
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
325 |
fst (fold_map replace (strip_fun_mode mode ~~ ts) hoargs) |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
326 |
end |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
327 |
|
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
328 |
fun ho_argsT_of mode Ts = |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
329 |
let |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
330 |
fun ho_arg (Fun _) T = [T] |
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37391
diff
changeset
|
331 |
| ho_arg (Pair (m1, m2)) (Type (@{type_name Product_Type.prod}, [T1, T2])) = ho_arg m1 T1 @ ho_arg m2 T2 |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
332 |
| ho_arg _ _ = [] |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
333 |
in |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
334 |
flat (map2 ho_arg (strip_fun_mode mode) Ts) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
335 |
end |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
336 |
|
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
337 |
(* splits mode and maps function to higher-order argument types *) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
338 |
fun split_map_mode f mode ts = |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
339 |
let |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
340 |
fun split_arg_mode' (m as Fun _) t = f m t |
37391 | 341 |
| split_arg_mode' (Pair (m1, m2)) (Const (@{const_name Pair}, _) $ t1 $ t2) = |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
342 |
let |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
343 |
val (i1, o1) = split_arg_mode' m1 t1 |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
344 |
val (i2, o2) = split_arg_mode' m2 t2 |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
345 |
in |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
346 |
(comb_option HOLogic.mk_prod (i1, i2), comb_option HOLogic.mk_prod (o1, o2)) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
347 |
end |
35324
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
348 |
| split_arg_mode' m t = |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
349 |
if eq_mode (m, Input) then (SOME t, NONE) |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
350 |
else if eq_mode (m, Output) then (NONE, SOME t) |
35885
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
351 |
else raise Fail "split_map_mode: mode and term do not match" |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
352 |
in |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
353 |
(pairself (map_filter I) o split_list) (map2 split_arg_mode' (strip_fun_mode mode) ts) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
354 |
end |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
355 |
|
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
356 |
(* splits mode and maps function to higher-order argument types *) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
357 |
fun split_map_modeT f mode Ts = |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
358 |
let |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
359 |
fun split_arg_mode' (m as Fun _) T = f m T |
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37391
diff
changeset
|
360 |
| split_arg_mode' (Pair (m1, m2)) (Type (@{type_name Product_Type.prod}, [T1, T2])) = |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
361 |
let |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
362 |
val (i1, o1) = split_arg_mode' m1 T1 |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
363 |
val (i2, o2) = split_arg_mode' m2 T2 |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
364 |
in |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
365 |
(comb_option HOLogic.mk_prodT (i1, i2), comb_option HOLogic.mk_prodT (o1, o2)) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
366 |
end |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
367 |
| split_arg_mode' Input T = (SOME T, NONE) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
368 |
| split_arg_mode' Output T = (NONE, SOME T) |
35885
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
369 |
| split_arg_mode' _ _ = raise Fail "split_modeT': mode and type do not match" |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
370 |
in |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
371 |
(pairself (map_filter I) o split_list) (map2 split_arg_mode' (strip_fun_mode mode) Ts) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
372 |
end |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
373 |
|
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
374 |
fun split_mode mode ts = split_map_mode (fn _ => fn _ => (NONE, NONE)) mode ts |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
375 |
|
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37391
diff
changeset
|
376 |
fun fold_map_aterms_prodT comb f (Type (@{type_name Product_Type.prod}, [T1, T2])) s = |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
377 |
let |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
378 |
val (x1, s') = fold_map_aterms_prodT comb f T1 s |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
379 |
val (x2, s'') = fold_map_aterms_prodT comb f T2 s' |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
380 |
in |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
381 |
(comb x1 x2, s'') |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
382 |
end |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
383 |
| fold_map_aterms_prodT comb f T s = f T s |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
384 |
|
37391 | 385 |
fun map_filter_prod f (Const (@{const_name Pair}, _) $ t1 $ t2) = |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
386 |
comb_option HOLogic.mk_prod (map_filter_prod f t1, map_filter_prod f t2) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
387 |
| map_filter_prod f t = f t |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
388 |
|
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
389 |
(* obviously, split_mode' and split_modeT' do not match? where does that cause problems? *) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
390 |
|
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
391 |
fun split_modeT' mode Ts = |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
392 |
let |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
393 |
fun split_arg_mode' (Fun _) T = ([], []) |
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37391
diff
changeset
|
394 |
| split_arg_mode' (Pair (m1, m2)) (Type (@{type_name Product_Type.prod}, [T1, T2])) = |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
395 |
let |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
396 |
val (i1, o1) = split_arg_mode' m1 T1 |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
397 |
val (i2, o2) = split_arg_mode' m2 T2 |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
398 |
in |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
399 |
(i1 @ i2, o1 @ o2) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
400 |
end |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
401 |
| split_arg_mode' Input T = ([T], []) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
402 |
| split_arg_mode' Output T = ([], [T]) |
35885
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
403 |
| split_arg_mode' _ _ = raise Fail "split_modeT': mode and type do not match" |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
404 |
in |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
405 |
(pairself flat o split_list) (map2 split_arg_mode' (strip_fun_mode mode) Ts) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
406 |
end |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
407 |
|
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
408 |
fun string_of_mode mode = |
33619
d93a3cb55068
first steps towards a new mode datastructure; new syntax for mode annotations and new output of modes
bulwahn
parents:
33473
diff
changeset
|
409 |
let |
d93a3cb55068
first steps towards a new mode datastructure; new syntax for mode annotations and new output of modes
bulwahn
parents:
33473
diff
changeset
|
410 |
fun string_of_mode1 Input = "i" |
d93a3cb55068
first steps towards a new mode datastructure; new syntax for mode annotations and new output of modes
bulwahn
parents:
33473
diff
changeset
|
411 |
| string_of_mode1 Output = "o" |
d93a3cb55068
first steps towards a new mode datastructure; new syntax for mode annotations and new output of modes
bulwahn
parents:
33473
diff
changeset
|
412 |
| string_of_mode1 Bool = "bool" |
d93a3cb55068
first steps towards a new mode datastructure; new syntax for mode annotations and new output of modes
bulwahn
parents:
33473
diff
changeset
|
413 |
| string_of_mode1 mode = "(" ^ (string_of_mode3 mode) ^ ")" |
33626
42f69386943a
new names for predicate functions in the predicate compiler
bulwahn
parents:
33623
diff
changeset
|
414 |
and string_of_mode2 (Pair (m1, m2)) = string_of_mode3 m1 ^ " * " ^ string_of_mode2 m2 |
33619
d93a3cb55068
first steps towards a new mode datastructure; new syntax for mode annotations and new output of modes
bulwahn
parents:
33473
diff
changeset
|
415 |
| string_of_mode2 mode = string_of_mode1 mode |
d93a3cb55068
first steps towards a new mode datastructure; new syntax for mode annotations and new output of modes
bulwahn
parents:
33473
diff
changeset
|
416 |
and string_of_mode3 (Fun (m1, m2)) = string_of_mode2 m1 ^ " => " ^ string_of_mode3 m2 |
d93a3cb55068
first steps towards a new mode datastructure; new syntax for mode annotations and new output of modes
bulwahn
parents:
33473
diff
changeset
|
417 |
| string_of_mode3 mode = string_of_mode2 mode |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
418 |
in string_of_mode3 mode end |
33619
d93a3cb55068
first steps towards a new mode datastructure; new syntax for mode annotations and new output of modes
bulwahn
parents:
33473
diff
changeset
|
419 |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
420 |
fun ascii_string_of_mode mode' = |
33626
42f69386943a
new names for predicate functions in the predicate compiler
bulwahn
parents:
33623
diff
changeset
|
421 |
let |
42f69386943a
new names for predicate functions in the predicate compiler
bulwahn
parents:
33623
diff
changeset
|
422 |
fun ascii_string_of_mode' Input = "i" |
42f69386943a
new names for predicate functions in the predicate compiler
bulwahn
parents:
33623
diff
changeset
|
423 |
| ascii_string_of_mode' Output = "o" |
42f69386943a
new names for predicate functions in the predicate compiler
bulwahn
parents:
33623
diff
changeset
|
424 |
| ascii_string_of_mode' Bool = "b" |
42f69386943a
new names for predicate functions in the predicate compiler
bulwahn
parents:
33623
diff
changeset
|
425 |
| ascii_string_of_mode' (Pair (m1, m2)) = |
42f69386943a
new names for predicate functions in the predicate compiler
bulwahn
parents:
33623
diff
changeset
|
426 |
"P" ^ ascii_string_of_mode' m1 ^ ascii_string_of_mode'_Pair m2 |
42f69386943a
new names for predicate functions in the predicate compiler
bulwahn
parents:
33623
diff
changeset
|
427 |
| ascii_string_of_mode' (Fun (m1, m2)) = |
42f69386943a
new names for predicate functions in the predicate compiler
bulwahn
parents:
33623
diff
changeset
|
428 |
"F" ^ ascii_string_of_mode' m1 ^ ascii_string_of_mode'_Fun m2 ^ "B" |
42f69386943a
new names for predicate functions in the predicate compiler
bulwahn
parents:
33623
diff
changeset
|
429 |
and ascii_string_of_mode'_Fun (Fun (m1, m2)) = |
42f69386943a
new names for predicate functions in the predicate compiler
bulwahn
parents:
33623
diff
changeset
|
430 |
ascii_string_of_mode' m1 ^ (if m2 = Bool then "" else "_" ^ ascii_string_of_mode'_Fun m2) |
42f69386943a
new names for predicate functions in the predicate compiler
bulwahn
parents:
33623
diff
changeset
|
431 |
| ascii_string_of_mode'_Fun Bool = "B" |
42f69386943a
new names for predicate functions in the predicate compiler
bulwahn
parents:
33623
diff
changeset
|
432 |
| ascii_string_of_mode'_Fun m = ascii_string_of_mode' m |
42f69386943a
new names for predicate functions in the predicate compiler
bulwahn
parents:
33623
diff
changeset
|
433 |
and ascii_string_of_mode'_Pair (Pair (m1, m2)) = |
42f69386943a
new names for predicate functions in the predicate compiler
bulwahn
parents:
33623
diff
changeset
|
434 |
ascii_string_of_mode' m1 ^ ascii_string_of_mode'_Pair m2 |
42f69386943a
new names for predicate functions in the predicate compiler
bulwahn
parents:
33623
diff
changeset
|
435 |
| ascii_string_of_mode'_Pair m = ascii_string_of_mode' m |
42f69386943a
new names for predicate functions in the predicate compiler
bulwahn
parents:
33623
diff
changeset
|
436 |
in ascii_string_of_mode'_Fun mode' end |
42f69386943a
new names for predicate functions in the predicate compiler
bulwahn
parents:
33623
diff
changeset
|
437 |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
438 |
(* premises *) |
33619
d93a3cb55068
first steps towards a new mode datastructure; new syntax for mode annotations and new output of modes
bulwahn
parents:
33473
diff
changeset
|
439 |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
440 |
datatype indprem = Prem of term | Negprem of term | Sidecond of term |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
441 |
| Generator of (string * typ); |
33619
d93a3cb55068
first steps towards a new mode datastructure; new syntax for mode annotations and new output of modes
bulwahn
parents:
33473
diff
changeset
|
442 |
|
36251
5fd5d732a4ea
only add relevant predicates to the list of extra modes
bulwahn
parents:
36248
diff
changeset
|
443 |
fun dest_indprem (Prem t) = t |
5fd5d732a4ea
only add relevant predicates to the list of extra modes
bulwahn
parents:
36248
diff
changeset
|
444 |
| dest_indprem (Negprem t) = t |
5fd5d732a4ea
only add relevant predicates to the list of extra modes
bulwahn
parents:
36248
diff
changeset
|
445 |
| dest_indprem (Sidecond t) = t |
5fd5d732a4ea
only add relevant predicates to the list of extra modes
bulwahn
parents:
36248
diff
changeset
|
446 |
| dest_indprem (Generator _) = raise Fail "cannot destruct generator" |
5fd5d732a4ea
only add relevant predicates to the list of extra modes
bulwahn
parents:
36248
diff
changeset
|
447 |
|
36254 | 448 |
fun map_indprem f (Prem t) = Prem (f t) |
449 |
| map_indprem f (Negprem t) = Negprem (f t) |
|
450 |
| map_indprem f (Sidecond t) = Sidecond (f t) |
|
451 |
| map_indprem f (Generator (v, T)) = Generator (dest_Free (f (Free (v, T)))) |
|
452 |
||
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
453 |
(* general syntactic functions *) |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
454 |
|
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
455 |
(*Like dest_conj, but flattens conjunctions however nested*) |
38795
848be46708dc
formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents:
38558
diff
changeset
|
456 |
fun conjuncts_aux (Const (@{const_name HOL.conj}, _) $ t $ t') conjs = conjuncts_aux t (conjuncts_aux t' conjs) |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
457 |
| conjuncts_aux t conjs = t::conjs; |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
458 |
|
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
459 |
fun conjuncts t = conjuncts_aux t []; |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
460 |
|
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
461 |
fun is_equationlike_term (Const ("==", _) $ _ $ _) = true |
38864
4abe644fcea5
formerly unnamed infix equality now named HOL.eq
haftmann
parents:
38795
diff
changeset
|
462 |
| is_equationlike_term (Const (@{const_name Trueprop}, _) $ (Const (@{const_name HOL.eq}, _) $ _ $ _)) = true |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
463 |
| is_equationlike_term _ = false |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
464 |
|
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
465 |
val is_equationlike = is_equationlike_term o prop_of |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
466 |
|
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
467 |
fun is_pred_equation_term (Const ("==", _) $ u $ v) = |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
468 |
(fastype_of u = @{typ bool}) andalso (fastype_of v = @{typ bool}) |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
469 |
| is_pred_equation_term _ = false |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
470 |
|
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
471 |
val is_pred_equation = is_pred_equation_term o prop_of |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
472 |
|
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
473 |
fun is_intro_term constname t = |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
474 |
the_default false (try (fn t => case fst (strip_comb (HOLogic.dest_Trueprop (Logic.strip_imp_concl t))) of |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
475 |
Const (c, _) => c = constname |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
476 |
| _ => false) t) |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
477 |
|
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
478 |
fun is_intro constname t = is_intro_term constname (prop_of t) |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
479 |
|
38552 | 480 |
fun is_pred thy constname = (body_type (Sign.the_const_type thy constname) = HOLogic.boolT); |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
481 |
|
35885
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
482 |
fun is_predT (T as Type("fun", [_, _])) = (snd (strip_type T) = @{typ bool}) |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
483 |
| is_predT _ = false |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
484 |
|
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
485 |
(*** check if a term contains only constructor functions ***) |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
486 |
(* TODO: another copy in the core! *) |
33623
4ec42d38224f
changed modes to expected_modes; added UNION to code_pred_inlining; fixed some examples; tuned
bulwahn
parents:
33620
diff
changeset
|
487 |
(* FIXME: constructor terms are supposed to be seen in the way the code generator |
4ec42d38224f
changed modes to expected_modes; added UNION to code_pred_inlining; fixed some examples; tuned
bulwahn
parents:
33620
diff
changeset
|
488 |
sees constructors.*) |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
489 |
fun is_constrt thy = |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
490 |
let |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
491 |
val cnstrs = flat (maps |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
492 |
(map (fn (_, (Tname, _, cs)) => map (apsnd (rpair Tname o length)) cs) o #descr o snd) |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
493 |
(Symtab.dest (Datatype.get_all thy))); |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
494 |
fun check t = (case strip_comb t of |
36032
dfd30b5b4e73
adding specialisation of predicates to the predicate compiler
bulwahn
parents:
36029
diff
changeset
|
495 |
(Var _, []) => true |
dfd30b5b4e73
adding specialisation of predicates to the predicate compiler
bulwahn
parents:
36029
diff
changeset
|
496 |
| (Free _, []) => true |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
497 |
| (Const (s, T), ts) => (case (AList.lookup (op =) cnstrs s, body_type T) of |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
498 |
(SOME (i, Tname), Type (Tname', _)) => length ts = i andalso Tname = Tname' andalso forall check ts |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
499 |
| _ => false) |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
500 |
| _ => false) |
36032
dfd30b5b4e73
adding specialisation of predicates to the predicate compiler
bulwahn
parents:
36029
diff
changeset
|
501 |
in check end; |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
502 |
|
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
503 |
fun is_funtype (Type ("fun", [_, _])) = true |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
504 |
| is_funtype _ = false; |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
505 |
|
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
506 |
fun is_Type (Type _) = true |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
507 |
| is_Type _ = false |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
508 |
|
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
509 |
(* returns true if t is an application of an datatype constructor *) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
510 |
(* which then consequently would be splitted *) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
511 |
(* else false *) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
512 |
(* |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
513 |
fun is_constructor thy t = |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
514 |
if (is_Type (fastype_of t)) then |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
515 |
(case DatatypePackage.get_datatype thy ((fst o dest_Type o fastype_of) t) of |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
516 |
NONE => false |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
517 |
| SOME info => (let |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
518 |
val constr_consts = maps (fn (_, (_, _, constrs)) => map fst constrs) (#descr info) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
519 |
val (c, _) = strip_comb t |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
520 |
in (case c of |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
521 |
Const (name, _) => name mem_string constr_consts |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
522 |
| _ => false) end)) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
523 |
else false |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
524 |
*) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
525 |
|
35891
3122bdd95275
contextifying the compilation of the predicate compiler
bulwahn
parents:
35885
diff
changeset
|
526 |
val is_constr = Code.is_constr o ProofContext.theory_of; |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
527 |
|
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
528 |
fun strip_all t = (Term.strip_all_vars t, Term.strip_all_body t) |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
529 |
|
38558 | 530 |
fun strip_ex (Const (@{const_name Ex}, _) $ Abs (x, T, t)) = |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
531 |
let |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
532 |
val (xTs, t') = strip_ex t |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
533 |
in |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
534 |
((x, T) :: xTs, t') |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
535 |
end |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
536 |
| strip_ex t = ([], t) |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
537 |
|
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
538 |
fun focus_ex t nctxt = |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
539 |
let |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
540 |
val ((xs, Ts), t') = apfst split_list (strip_ex t) |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
541 |
val (xs', nctxt') = Name.variants xs nctxt; |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
542 |
val ps' = xs' ~~ Ts; |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
543 |
val vs = map Free ps'; |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
544 |
val t'' = Term.subst_bounds (rev vs, t'); |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
545 |
in ((ps', t''), nctxt') end; |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
546 |
|
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
547 |
(* introduction rule combinators *) |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
548 |
|
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
549 |
fun map_atoms f intro = |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
550 |
let |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
551 |
val (literals, head) = Logic.strip_horn intro |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
552 |
fun appl t = (case t of |
35885
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
553 |
(@{term Not} $ t') => HOLogic.mk_not (f t') |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
554 |
| _ => f t) |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
555 |
in |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
556 |
Logic.list_implies |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
557 |
(map (HOLogic.mk_Trueprop o appl o HOLogic.dest_Trueprop) literals, head) |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
558 |
end |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
559 |
|
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
560 |
fun fold_atoms f intro s = |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
561 |
let |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
562 |
val (literals, head) = Logic.strip_horn intro |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
563 |
fun appl t s = (case t of |
35885
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
564 |
(@{term Not} $ t') => f t' s |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
565 |
| _ => f t s) |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
566 |
in fold appl (map HOLogic.dest_Trueprop literals) s end |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
567 |
|
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
568 |
fun fold_map_atoms f intro s = |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
569 |
let |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
570 |
val (literals, head) = Logic.strip_horn intro |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
571 |
fun appl t s = (case t of |
35885
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
572 |
(@{term Not} $ t') => apfst HOLogic.mk_not (f t' s) |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
573 |
| _ => f t s) |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
574 |
val (literals', s') = fold_map appl (map HOLogic.dest_Trueprop literals) s |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
575 |
in |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
576 |
(Logic.list_implies (map HOLogic.mk_Trueprop literals', head), s') |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
577 |
end; |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
578 |
|
36246
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
579 |
fun map_premises f intro = |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
580 |
let |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
581 |
val (premises, head) = Logic.strip_horn intro |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
582 |
in |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
583 |
Logic.list_implies (map f premises, head) |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
584 |
end |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
585 |
|
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
586 |
fun map_filter_premises f intro = |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
587 |
let |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
588 |
val (premises, head) = Logic.strip_horn intro |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
589 |
in |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
590 |
Logic.list_implies (map_filter f premises, head) |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
591 |
end |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
592 |
|
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
593 |
fun maps_premises f intro = |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
594 |
let |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
595 |
val (premises, head) = Logic.strip_horn intro |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
596 |
in |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
597 |
Logic.list_implies (maps f premises, head) |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
598 |
end |
35324
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
599 |
|
35875 | 600 |
fun map_concl f intro = |
601 |
let |
|
602 |
val (premises, head) = Logic.strip_horn intro |
|
603 |
in |
|
604 |
Logic.list_implies (premises, f head) |
|
605 |
end |
|
606 |
||
607 |
(* combinators to apply a function to all basic parts of nested products *) |
|
608 |
||
37391 | 609 |
fun map_products f (Const (@{const_name Pair}, T) $ t1 $ t2) = |
610 |
Const (@{const_name Pair}, T) $ map_products f t1 $ map_products f t2 |
|
35875 | 611 |
| map_products f t = f t |
35324
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
612 |
|
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
613 |
(* split theorems of case expressions *) |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
614 |
|
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
615 |
fun prepare_split_thm ctxt split_thm = |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
616 |
(split_thm RS @{thm iffD2}) |
35624 | 617 |
|> Local_Defs.unfold ctxt [@{thm atomize_conjL[symmetric]}, |
35324
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
618 |
@{thm atomize_all[symmetric]}, @{thm atomize_imp[symmetric]}] |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
619 |
|
36029
a790b94e090c
removing fishing for split thm in the predicate compiler
bulwahn
parents:
36022
diff
changeset
|
620 |
fun find_split_thm thy (Const (name, T)) = Option.map #split (Datatype_Data.info_of_case thy name) |
a790b94e090c
removing fishing for split thm in the predicate compiler
bulwahn
parents:
36022
diff
changeset
|
621 |
| find_split_thm thy _ = NONE |
35324
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
622 |
|
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
623 |
(* lifting term operations to theorems *) |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
624 |
|
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
625 |
fun map_term thy f th = |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
626 |
Skip_Proof.make_thm thy (f (prop_of th)) |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
627 |
|
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
628 |
(* |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
629 |
fun equals_conv lhs_cv rhs_cv ct = |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
630 |
case Thm.term_of ct of |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
631 |
Const ("==", _) $ _ $ _ => Conv.arg_conv cv ct |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
632 |
| _ => error "equals_conv" |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
633 |
*) |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
634 |
|
36038
385f706eff24
generalized alternative functions to alternative compilation to handle arithmetic functions better
bulwahn
parents:
36035
diff
changeset
|
635 |
(* Different compilations *) |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
636 |
|
35881
aa412e08bfee
adding depth_limited_random compilation to predicate compiler
bulwahn
parents:
35880
diff
changeset
|
637 |
datatype compilation = Pred | Depth_Limited | Random | Depth_Limited_Random | DSeq | Annotated |
36018 | 638 |
| Pos_Random_DSeq | Neg_Random_DSeq | New_Pos_Random_DSeq | New_Neg_Random_DSeq |
35324
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
639 |
|
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
640 |
fun negative_compilation_of Pos_Random_DSeq = Neg_Random_DSeq |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
641 |
| negative_compilation_of Neg_Random_DSeq = Pos_Random_DSeq |
36018 | 642 |
| negative_compilation_of New_Pos_Random_DSeq = New_Neg_Random_DSeq |
643 |
| negative_compilation_of New_Neg_Random_DSeq = New_Pos_Random_DSeq |
|
35324
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
644 |
| negative_compilation_of c = c |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
645 |
|
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
646 |
fun compilation_for_polarity false Pos_Random_DSeq = Neg_Random_DSeq |
36018 | 647 |
| compilation_for_polarity false New_Pos_Random_DSeq = New_Neg_Random_DSeq |
35324
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
648 |
| compilation_for_polarity _ c = c |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
649 |
|
40049
75d9f57123d6
adding decreasing bind and non-decreasing bind; depth-limited and depth-unlimited compilation possible
bulwahn
parents:
40048
diff
changeset
|
650 |
fun is_depth_limited_compilation c = |
75d9f57123d6
adding decreasing bind and non-decreasing bind; depth-limited and depth-unlimited compilation possible
bulwahn
parents:
40048
diff
changeset
|
651 |
(c = New_Pos_Random_DSeq) orelse (c = New_Neg_Random_DSeq) |
75d9f57123d6
adding decreasing bind and non-decreasing bind; depth-limited and depth-unlimited compilation possible
bulwahn
parents:
40048
diff
changeset
|
652 |
|
35885
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
653 |
fun string_of_compilation c = |
7b39120a1494
some improvements thanks to Makarius source code review
bulwahn
parents:
35881
diff
changeset
|
654 |
case c of |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
655 |
Pred => "" |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
656 |
| Random => "random" |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
657 |
| Depth_Limited => "depth limited" |
35881
aa412e08bfee
adding depth_limited_random compilation to predicate compiler
bulwahn
parents:
35880
diff
changeset
|
658 |
| Depth_Limited_Random => "depth limited random" |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
659 |
| DSeq => "dseq" |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
660 |
| Annotated => "annotated" |
35324
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
661 |
| Pos_Random_DSeq => "pos_random dseq" |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
662 |
| Neg_Random_DSeq => "neg_random_dseq" |
36018 | 663 |
| New_Pos_Random_DSeq => "new_pos_random dseq" |
664 |
| New_Neg_Random_DSeq => "new_neg_random_dseq" |
|
36038
385f706eff24
generalized alternative functions to alternative compilation to handle arithmetic functions better
bulwahn
parents:
36035
diff
changeset
|
665 |
|
36018 | 666 |
val compilation_names = [("pred", Pred), |
667 |
("random", Random), |
|
668 |
("depth_limited", Depth_Limited), |
|
669 |
("depth_limited_random", Depth_Limited_Random), |
|
670 |
(*("annotated", Annotated),*) |
|
671 |
("dseq", DSeq), ("random_dseq", Pos_Random_DSeq), |
|
672 |
("new_random_dseq", New_Pos_Random_DSeq)] |
|
36038
385f706eff24
generalized alternative functions to alternative compilation to handle arithmetic functions better
bulwahn
parents:
36035
diff
changeset
|
673 |
|
385f706eff24
generalized alternative functions to alternative compilation to handle arithmetic functions better
bulwahn
parents:
36035
diff
changeset
|
674 |
val non_random_compilations = [Pred, Depth_Limited, DSeq, Annotated] |
385f706eff24
generalized alternative functions to alternative compilation to handle arithmetic functions better
bulwahn
parents:
36035
diff
changeset
|
675 |
|
385f706eff24
generalized alternative functions to alternative compilation to handle arithmetic functions better
bulwahn
parents:
36035
diff
changeset
|
676 |
|
385f706eff24
generalized alternative functions to alternative compilation to handle arithmetic functions better
bulwahn
parents:
36035
diff
changeset
|
677 |
val random_compilations = [Random, Depth_Limited_Random, |
385f706eff24
generalized alternative functions to alternative compilation to handle arithmetic functions better
bulwahn
parents:
36035
diff
changeset
|
678 |
Pos_Random_DSeq, Neg_Random_DSeq, New_Pos_Random_DSeq, New_Neg_Random_DSeq] |
385f706eff24
generalized alternative functions to alternative compilation to handle arithmetic functions better
bulwahn
parents:
36035
diff
changeset
|
679 |
|
36046
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
680 |
(* datastructures and setup for generic compilation *) |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
681 |
|
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
682 |
datatype compilation_funs = CompilationFuns of { |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
683 |
mk_predT : typ -> typ, |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
684 |
dest_predT : typ -> typ, |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
685 |
mk_bot : typ -> term, |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
686 |
mk_single : term -> term, |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
687 |
mk_bind : term * term -> term, |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
688 |
mk_sup : term * term -> term, |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
689 |
mk_if : term -> term, |
36049
0ce5b7a5c2fd
adding iterate_upto interface in compilations and iterate_upto functions in Isabelle theories for arithmetic setup of the predicate compiler
bulwahn
parents:
36047
diff
changeset
|
690 |
mk_iterate_upto : typ -> term * term * term -> term, |
36046
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
691 |
mk_not : term -> term, |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
692 |
mk_map : typ -> typ -> term -> term -> term |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
693 |
}; |
36038
385f706eff24
generalized alternative functions to alternative compilation to handle arithmetic functions better
bulwahn
parents:
36035
diff
changeset
|
694 |
|
36046
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
695 |
fun mk_predT (CompilationFuns funs) = #mk_predT funs |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
696 |
fun dest_predT (CompilationFuns funs) = #dest_predT funs |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
697 |
fun mk_bot (CompilationFuns funs) = #mk_bot funs |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
698 |
fun mk_single (CompilationFuns funs) = #mk_single funs |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
699 |
fun mk_bind (CompilationFuns funs) = #mk_bind funs |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
700 |
fun mk_sup (CompilationFuns funs) = #mk_sup funs |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
701 |
fun mk_if (CompilationFuns funs) = #mk_if funs |
36049
0ce5b7a5c2fd
adding iterate_upto interface in compilations and iterate_upto functions in Isabelle theories for arithmetic setup of the predicate compiler
bulwahn
parents:
36047
diff
changeset
|
702 |
fun mk_iterate_upto (CompilationFuns funs) = #mk_iterate_upto funs |
36046
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
703 |
fun mk_not (CompilationFuns funs) = #mk_not funs |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
704 |
fun mk_map (CompilationFuns funs) = #mk_map funs |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
705 |
|
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
706 |
(** function types and names of different compilations **) |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
707 |
|
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
708 |
fun funT_of compfuns mode T = |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
709 |
let |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
710 |
val Ts = binder_types T |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
711 |
val (inTs, outTs) = split_map_modeT (fn m => fn T => (SOME (funT_of compfuns m T), NONE)) mode Ts |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
712 |
in |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
713 |
inTs ---> (mk_predT compfuns (HOLogic.mk_tupleT outTs)) |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
714 |
end; |
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
715 |
|
c3946372f556
putting compilation setup of predicate compiler in a separate file
bulwahn
parents:
36038
diff
changeset
|
716 |
(* Different options for compiler *) |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
717 |
|
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
718 |
datatype options = Options of { |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
719 |
expected_modes : (string * mode list) option, |
39382
c797f3ab2ae1
proposed modes for code_pred now supports modes for mutual predicates
bulwahn
parents:
39312
diff
changeset
|
720 |
proposed_modes : (string * mode list) list, |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
721 |
proposed_names : ((string * mode) * string) list, |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
722 |
show_steps : bool, |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
723 |
show_proof_trace : bool, |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
724 |
show_intermediate_results : bool, |
33251 | 725 |
show_mode_inference : bool, |
726 |
show_modes : bool, |
|
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
727 |
show_compilation : bool, |
35324
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
728 |
show_caught_failures : bool, |
39383
ddfafa97da2f
adding option show_invalid_clauses for a more detailed message when modes are not inferred
bulwahn
parents:
39382
diff
changeset
|
729 |
show_invalid_clauses : bool, |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
730 |
skip_proof : bool, |
35324
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
731 |
no_topmost_reordering : bool, |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
732 |
function_flattening : bool, |
36248
9ed1a37de465
added option for specialisation to the predicate compiler
bulwahn
parents:
36246
diff
changeset
|
733 |
specialise : bool, |
35324
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
734 |
fail_safe_function_flattening : bool, |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
735 |
no_higher_order_predicate : string list, |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
736 |
inductify : bool, |
36254 | 737 |
detect_switches : bool, |
40048
f3a46d524101
adding option smart_depth_limiting to predicate compiler
bulwahn
parents:
39802
diff
changeset
|
738 |
smart_depth_limiting : bool, |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
739 |
compilation : compilation |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
740 |
}; |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
741 |
|
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
742 |
fun expected_modes (Options opt) = #expected_modes opt |
39382
c797f3ab2ae1
proposed modes for code_pred now supports modes for mutual predicates
bulwahn
parents:
39312
diff
changeset
|
743 |
fun proposed_modes (Options opt) = AList.lookup (op =) (#proposed_modes opt) |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
744 |
fun proposed_names (Options opt) name mode = AList.lookup (eq_pair (op =) eq_mode) |
33623
4ec42d38224f
changed modes to expected_modes; added UNION to code_pred_inlining; fixed some examples; tuned
bulwahn
parents:
33620
diff
changeset
|
745 |
(#proposed_names opt) (name, mode) |
33620
b6bf2dc5aed7
added interface of user proposals for names of generated constants
bulwahn
parents:
33619
diff
changeset
|
746 |
|
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
747 |
fun show_steps (Options opt) = #show_steps opt |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
748 |
fun show_intermediate_results (Options opt) = #show_intermediate_results opt |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
749 |
fun show_proof_trace (Options opt) = #show_proof_trace opt |
33251 | 750 |
fun show_modes (Options opt) = #show_modes opt |
751 |
fun show_mode_inference (Options opt) = #show_mode_inference opt |
|
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
752 |
fun show_compilation (Options opt) = #show_compilation opt |
35324
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
753 |
fun show_caught_failures (Options opt) = #show_caught_failures opt |
39383
ddfafa97da2f
adding option show_invalid_clauses for a more detailed message when modes are not inferred
bulwahn
parents:
39382
diff
changeset
|
754 |
fun show_invalid_clauses (Options opt) = #show_invalid_clauses opt |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
755 |
fun skip_proof (Options opt) = #skip_proof opt |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
756 |
|
35324
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
757 |
fun function_flattening (Options opt) = #function_flattening opt |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
758 |
fun fail_safe_function_flattening (Options opt) = #fail_safe_function_flattening opt |
36248
9ed1a37de465
added option for specialisation to the predicate compiler
bulwahn
parents:
36246
diff
changeset
|
759 |
fun specialise (Options opt) = #specialise opt |
35324
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
760 |
fun no_topmost_reordering (Options opt) = #no_topmost_reordering opt |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
761 |
fun no_higher_order_predicate (Options opt) = #no_higher_order_predicate opt |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
762 |
|
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
763 |
fun is_inductify (Options opt) = #inductify opt |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
764 |
|
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
765 |
fun compilation (Options opt) = #compilation opt |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
766 |
|
36254 | 767 |
fun detect_switches (Options opt) = #detect_switches opt |
768 |
||
40048
f3a46d524101
adding option smart_depth_limiting to predicate compiler
bulwahn
parents:
39802
diff
changeset
|
769 |
fun smart_depth_limiting (Options opt) = #smart_depth_limiting opt |
f3a46d524101
adding option smart_depth_limiting to predicate compiler
bulwahn
parents:
39802
diff
changeset
|
770 |
|
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
771 |
val default_options = Options { |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
772 |
expected_modes = NONE, |
39382
c797f3ab2ae1
proposed modes for code_pred now supports modes for mutual predicates
bulwahn
parents:
39312
diff
changeset
|
773 |
proposed_modes = [], |
33623
4ec42d38224f
changed modes to expected_modes; added UNION to code_pred_inlining; fixed some examples; tuned
bulwahn
parents:
33620
diff
changeset
|
774 |
proposed_names = [], |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
775 |
show_steps = false, |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
776 |
show_intermediate_results = false, |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
777 |
show_proof_trace = false, |
33251 | 778 |
show_modes = false, |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
779 |
show_mode_inference = false, |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
780 |
show_compilation = false, |
35324
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
781 |
show_caught_failures = false, |
39383
ddfafa97da2f
adding option show_invalid_clauses for a more detailed message when modes are not inferred
bulwahn
parents:
39382
diff
changeset
|
782 |
show_invalid_clauses = false, |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
783 |
skip_proof = true, |
35324
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
784 |
no_topmost_reordering = false, |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
785 |
function_flattening = false, |
36248
9ed1a37de465
added option for specialisation to the predicate compiler
bulwahn
parents:
36246
diff
changeset
|
786 |
specialise = false, |
35324
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
787 |
fail_safe_function_flattening = false, |
c9f428269b38
adopting mutabelle and quickcheck to return timing information; exporting make_case_combs in datatype package for predicate compiler; adding Spec_Rules declaration for tail recursive functions; improving the predicate compiler and function flattening
bulwahn
parents:
35224
diff
changeset
|
788 |
no_higher_order_predicate = [], |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
789 |
inductify = false, |
36254 | 790 |
detect_switches = true, |
40048
f3a46d524101
adding option smart_depth_limiting to predicate compiler
bulwahn
parents:
39802
diff
changeset
|
791 |
smart_depth_limiting = false, |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
792 |
compilation = Pred |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
793 |
} |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
794 |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
795 |
val bool_options = ["show_steps", "show_intermediate_results", "show_proof_trace", "show_modes", |
39383
ddfafa97da2f
adding option show_invalid_clauses for a more detailed message when modes are not inferred
bulwahn
parents:
39382
diff
changeset
|
796 |
"show_mode_inference", "show_compilation", "show_invalid_clauses", "skip_proof", "inductify", |
40048
f3a46d524101
adding option smart_depth_limiting to predicate compiler
bulwahn
parents:
39802
diff
changeset
|
797 |
"no_function_flattening", "detect_switches", "specialise", "no_topmost_reordering", |
f3a46d524101
adding option smart_depth_limiting to predicate compiler
bulwahn
parents:
39802
diff
changeset
|
798 |
"smart_depth_limiting"] |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
33752
diff
changeset
|
799 |
|
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
800 |
fun print_step options s = |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
801 |
if show_steps options then tracing s else () |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
802 |
|
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
803 |
(* simple transformations *) |
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
804 |
|
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
805 |
(** tuple processing **) |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
806 |
|
39657
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
807 |
fun rewrite_args [] (pats, intro_t, ctxt) = (pats, intro_t, ctxt) |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
808 |
| rewrite_args (arg::args) (pats, intro_t, ctxt) = |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
809 |
(case HOLogic.strip_tupleT (fastype_of arg) of |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
810 |
(Ts as _ :: _ :: _) => |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
811 |
let |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
812 |
fun rewrite_arg' (Const (@{const_name Pair}, _) $ _ $ t2, Type (@{type_name Product_Type.prod}, [_, T2])) |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
813 |
(args, (pats, intro_t, ctxt)) = rewrite_arg' (t2, T2) (args, (pats, intro_t, ctxt)) |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
814 |
| rewrite_arg' (t, Type (@{type_name Product_Type.prod}, [T1, T2])) (args, (pats, intro_t, ctxt)) = |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
815 |
let |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
816 |
val thy = ProofContext.theory_of ctxt |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
817 |
val ([x, y], ctxt') = Variable.variant_fixes ["x", "y"] ctxt |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
818 |
val pat = (t, HOLogic.mk_prod (Free (x, T1), Free (y, T2))) |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
819 |
val intro_t' = Pattern.rewrite_term thy [pat] [] intro_t |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
820 |
val args' = map (Pattern.rewrite_term thy [pat] []) args |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
821 |
in |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
822 |
rewrite_arg' (Free (y, T2), T2) (args', (pat::pats, intro_t', ctxt')) |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
823 |
end |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
824 |
| rewrite_arg' _ (args, (pats, intro_t, ctxt)) = (args, (pats, intro_t, ctxt)) |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
825 |
val (args', (pats, intro_t', ctxt')) = rewrite_arg' (arg, fastype_of arg) |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
826 |
(args, (pats, intro_t, ctxt)) |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
827 |
in |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
828 |
rewrite_args args' (pats, intro_t', ctxt') |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
829 |
end |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
830 |
| _ => rewrite_args args (pats, intro_t, ctxt)) |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
831 |
|
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
832 |
fun rewrite_prem atom = |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
833 |
let |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
834 |
val (_, args) = strip_comb atom |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
835 |
in rewrite_args args end |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
836 |
|
39787
a44f6b11cdc4
adding splitting of conjuncts in assumptions as forward rule on theorems; replacing term transformation for splitting conjuncts by theorem transformation; removing obsolete functions; tuned
bulwahn
parents:
39658
diff
changeset
|
837 |
fun split_conjuncts_in_assms ctxt th = |
a44f6b11cdc4
adding splitting of conjuncts in assumptions as forward rule on theorems; replacing term transformation for splitting conjuncts by theorem transformation; removing obsolete functions; tuned
bulwahn
parents:
39658
diff
changeset
|
838 |
let |
a44f6b11cdc4
adding splitting of conjuncts in assumptions as forward rule on theorems; replacing term transformation for splitting conjuncts by theorem transformation; removing obsolete functions; tuned
bulwahn
parents:
39658
diff
changeset
|
839 |
val ((_, [fixed_th]), ctxt') = Variable.import false [th] ctxt |
a44f6b11cdc4
adding splitting of conjuncts in assumptions as forward rule on theorems; replacing term transformation for splitting conjuncts by theorem transformation; removing obsolete functions; tuned
bulwahn
parents:
39658
diff
changeset
|
840 |
fun split_conjs i nprems th = |
a44f6b11cdc4
adding splitting of conjuncts in assumptions as forward rule on theorems; replacing term transformation for splitting conjuncts by theorem transformation; removing obsolete functions; tuned
bulwahn
parents:
39658
diff
changeset
|
841 |
if i > nprems then th |
a44f6b11cdc4
adding splitting of conjuncts in assumptions as forward rule on theorems; replacing term transformation for splitting conjuncts by theorem transformation; removing obsolete functions; tuned
bulwahn
parents:
39658
diff
changeset
|
842 |
else |
a44f6b11cdc4
adding splitting of conjuncts in assumptions as forward rule on theorems; replacing term transformation for splitting conjuncts by theorem transformation; removing obsolete functions; tuned
bulwahn
parents:
39658
diff
changeset
|
843 |
case try Drule.RSN (@{thm conjI}, (i, th)) of |
a44f6b11cdc4
adding splitting of conjuncts in assumptions as forward rule on theorems; replacing term transformation for splitting conjuncts by theorem transformation; removing obsolete functions; tuned
bulwahn
parents:
39658
diff
changeset
|
844 |
SOME th' => split_conjs i (nprems+1) th' |
a44f6b11cdc4
adding splitting of conjuncts in assumptions as forward rule on theorems; replacing term transformation for splitting conjuncts by theorem transformation; removing obsolete functions; tuned
bulwahn
parents:
39658
diff
changeset
|
845 |
| NONE => split_conjs (i+1) nprems th |
a44f6b11cdc4
adding splitting of conjuncts in assumptions as forward rule on theorems; replacing term transformation for splitting conjuncts by theorem transformation; removing obsolete functions; tuned
bulwahn
parents:
39658
diff
changeset
|
846 |
in |
a44f6b11cdc4
adding splitting of conjuncts in assumptions as forward rule on theorems; replacing term transformation for splitting conjuncts by theorem transformation; removing obsolete functions; tuned
bulwahn
parents:
39658
diff
changeset
|
847 |
singleton (Variable.export ctxt' ctxt) (split_conjs 1 (Thm.nprems_of fixed_th) fixed_th) |
a44f6b11cdc4
adding splitting of conjuncts in assumptions as forward rule on theorems; replacing term transformation for splitting conjuncts by theorem transformation; removing obsolete functions; tuned
bulwahn
parents:
39658
diff
changeset
|
848 |
end |
a44f6b11cdc4
adding splitting of conjuncts in assumptions as forward rule on theorems; replacing term transformation for splitting conjuncts by theorem transformation; removing obsolete functions; tuned
bulwahn
parents:
39658
diff
changeset
|
849 |
|
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
850 |
fun expand_tuples thy intro = |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
851 |
let |
36610
bafd82950e24
renamed ProofContext.init to ProofContext.init_global to emphasize that this is not the real thing;
wenzelm
parents:
36254
diff
changeset
|
852 |
val ctxt = ProofContext.init_global thy |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
853 |
val (((T_insts, t_insts), [intro']), ctxt1) = Variable.import false [intro] ctxt |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
854 |
val intro_t = prop_of intro' |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
855 |
val concl = Logic.strip_imp_concl intro_t |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
856 |
val (p, args) = strip_comb (HOLogic.dest_Trueprop concl) |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
857 |
val (pats', intro_t', ctxt2) = rewrite_args args ([], intro_t, ctxt1) |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
858 |
val (pats', intro_t', ctxt3) = |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
859 |
fold_atoms rewrite_prem intro_t' (pats', intro_t', ctxt2) |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
860 |
fun rewrite_pat (ct1, ct2) = |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
861 |
(ct1, cterm_of thy (Pattern.rewrite_term thy pats' [] (term_of ct2))) |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
862 |
val t_insts' = map rewrite_pat t_insts |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
863 |
val intro'' = Thm.instantiate (T_insts, t_insts') intro |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
864 |
val [intro'''] = Variable.export ctxt3 ctxt [intro''] |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
865 |
val intro'''' = Simplifier.full_simplify |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
866 |
(HOL_basic_ss addsimps [@{thm fst_conv}, @{thm snd_conv}, @{thm Pair_eq}]) |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
867 |
intro''' |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
868 |
(* splitting conjunctions introduced by Pair_eq*) |
39787
a44f6b11cdc4
adding splitting of conjuncts in assumptions as forward rule on theorems; replacing term transformation for splitting conjuncts by theorem transformation; removing obsolete functions; tuned
bulwahn
parents:
39658
diff
changeset
|
869 |
val intro''''' = split_conjuncts_in_assms ctxt intro'''' |
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
870 |
in |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
871 |
intro''''' |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
872 |
end |
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
873 |
|
39802
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
874 |
(** making case distributivity rules **) |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
875 |
(*** this should be part of the datatype package ***) |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
876 |
|
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
877 |
fun datatype_names_of_case_name thy case_name = |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
878 |
map (#1 o #2) (#descr (the (Datatype_Data.info_of_case thy case_name))) |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
879 |
|
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
880 |
fun make_case_distribs new_type_names descr sorts thy = |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
881 |
let |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
882 |
val case_combs = Datatype_Prop.make_case_combs new_type_names descr sorts thy "f"; |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
883 |
fun make comb = |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
884 |
let |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
885 |
val Type ("fun", [T, T']) = fastype_of comb; |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
886 |
val (Const (case_name, _), fs) = strip_comb comb |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
887 |
val used = Term.add_tfree_names comb [] |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
888 |
val U = TFree (Name.variant used "'t", HOLogic.typeS) |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
889 |
val x = Free ("x", T) |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
890 |
val f = Free ("f", T' --> U) |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
891 |
fun apply_f f' = |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
892 |
let |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
893 |
val Ts = binder_types (fastype_of f') |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
894 |
val bs = map Bound ((length Ts - 1) downto 0) |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
895 |
in |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
896 |
fold (curry absdummy) (rev Ts) (f $ (list_comb (f', bs))) |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
897 |
end |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
898 |
val fs' = map apply_f fs |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
899 |
val case_c' = Const (case_name, (map fastype_of fs') @ [T] ---> U) |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
900 |
in |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
901 |
HOLogic.mk_eq (f $ (comb $ x), list_comb (case_c', fs') $ x) |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
902 |
end |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
903 |
in |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
904 |
map make case_combs |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
905 |
end |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
906 |
|
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
907 |
fun case_rewrites thy Tcon = |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
908 |
let |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
909 |
val info = Datatype.the_info thy Tcon |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
910 |
val descr = #descr info |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
911 |
val sorts = #sorts info |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
912 |
val typ_names = the_default [Tcon] (#alt_names info) |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
913 |
in |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
914 |
map (Drule.export_without_context o Skip_Proof.make_thm thy o HOLogic.mk_Trueprop) |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
915 |
(make_case_distribs typ_names [descr] sorts thy) |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
916 |
end |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
917 |
|
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
918 |
fun instantiated_case_rewrites thy Tcon = |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
919 |
let |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
920 |
val rew_ths = case_rewrites thy Tcon |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
921 |
val ctxt = ProofContext.init_global thy |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
922 |
fun instantiate th = |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
923 |
let |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
924 |
val f = (fst (strip_comb (fst (HOLogic.dest_eq (HOLogic.dest_Trueprop (prop_of th)))))) |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
925 |
val Type ("fun", [uninst_T, uninst_T']) = fastype_of f |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
926 |
val ([tname, tname', uname, yname], ctxt') = Variable.add_fixes ["'t", "'t'", "'u", "y"] ctxt |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
927 |
val T = TFree (tname, HOLogic.typeS) |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
928 |
val T' = TFree (tname', HOLogic.typeS) |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
929 |
val U = TFree (uname, HOLogic.typeS) |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
930 |
val y = Free (yname, U) |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
931 |
val f' = absdummy (U --> T', Bound 0 $ y) |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
932 |
val th' = Thm.certify_instantiate |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
933 |
([(dest_TVar uninst_T, U --> T'), (dest_TVar uninst_T', T')], |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
934 |
[((fst (dest_Var f), (U --> T') --> T'), f')]) th |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
935 |
val [th'] = Variable.export ctxt' ctxt [th'] |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
936 |
in |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
937 |
th' |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
938 |
end |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
939 |
in |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
940 |
map instantiate rew_ths |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
941 |
end |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
942 |
|
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
943 |
fun case_betapply thy t = |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
944 |
let |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
945 |
val case_name = fst (dest_Const (fst (strip_comb t))) |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
946 |
val Tcons = datatype_names_of_case_name thy case_name |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
947 |
val ths = maps (instantiated_case_rewrites thy) Tcons |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
948 |
in |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
949 |
MetaSimplifier.rewrite_term thy |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
950 |
(map (fn th => th RS @{thm eq_reflection}) ths) [] t |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
951 |
end |
7cadad6a18cc
applying case beta reduction to case term before matching in predicate compile function flattening; moving case beta reduction function to Predicate_Compile_Aux
bulwahn
parents:
39787
diff
changeset
|
952 |
|
39657
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
953 |
(*** conversions ***) |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
954 |
|
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
955 |
fun imp_prems_conv cv ct = |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
956 |
case Thm.term_of ct of |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
957 |
Const ("==>", _) $ _ $ _ => Conv.combination_conv (Conv.arg_conv cv) (imp_prems_conv cv) ct |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
958 |
| _ => Conv.all_conv ct |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
959 |
|
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
960 |
fun all_params_conv cv ctxt ct = |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
961 |
if Logic.is_all (Thm.term_of ct) |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
962 |
then Conv.arg_conv (Conv.abs_conv (all_params_conv cv o #2) ctxt) ct |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
963 |
else cv ctxt ct; |
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39541
diff
changeset
|
964 |
|
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
965 |
(** eta contract higher-order arguments **) |
35875 | 966 |
|
967 |
fun eta_contract_ho_arguments thy intro = |
|
968 |
let |
|
969 |
fun f atom = list_comb (apsnd ((map o map_products) Envir.eta_contract) (strip_comb atom)) |
|
970 |
in |
|
971 |
map_term thy (map_concl f o map_atoms f) intro |
|
972 |
end |
|
973 |
||
36047
f8297ebb21a7
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn
parents:
36046
diff
changeset
|
974 |
(** remove equalities **) |
36022
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
975 |
|
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
976 |
fun remove_equalities thy intro = |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
977 |
let |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
978 |
fun remove_eqs intro_t = |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
979 |
let |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
980 |
val (prems, concl) = Logic.strip_horn intro_t |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
981 |
fun remove_eq (prems, concl) = |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
982 |
let |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
983 |
fun removable_eq prem = |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
984 |
case try (HOLogic.dest_eq o HOLogic.dest_Trueprop) prem of |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
985 |
SOME (lhs, rhs) => (case lhs of |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
986 |
Var _ => true |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
987 |
| _ => (case rhs of Var _ => true | _ => false)) |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
988 |
| NONE => false |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
989 |
in |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
990 |
case find_first removable_eq prems of |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
991 |
NONE => (prems, concl) |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
992 |
| SOME eq => |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
993 |
let |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
994 |
val (lhs, rhs) = HOLogic.dest_eq (HOLogic.dest_Trueprop eq) |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
995 |
val prems' = remove (op =) eq prems |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
996 |
val subst = (case lhs of |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
997 |
(v as Var _) => |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
998 |
(fn t => if t = v then rhs else t) |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
999 |
| _ => (case rhs of |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
1000 |
(v as Var _) => (fn t => if t = v then lhs else t))) |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
1001 |
in |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
1002 |
remove_eq (map (map_aterms subst) prems', map_aterms subst concl) |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
1003 |
end |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
1004 |
end |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
1005 |
in |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
1006 |
Logic.list_implies (remove_eq (prems, concl)) |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
1007 |
end |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
1008 |
in |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
1009 |
map_term thy remove_eqs intro |
c0fa8499e366
removing simple equalities in introduction rules in the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
1010 |
end |
35875 | 1011 |
|
36246
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
1012 |
(* Some last processing *) |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
1013 |
|
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
1014 |
fun remove_pointless_clauses intro = |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
1015 |
if Logic.strip_imp_prems (prop_of intro) = [@{prop "False"}] then |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
1016 |
[] |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
1017 |
else [intro] |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
1018 |
|
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
1019 |
(* some peephole optimisations *) |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
1020 |
|
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
1021 |
fun peephole_optimisation thy intro = |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
1022 |
let |
36610
bafd82950e24
renamed ProofContext.init to ProofContext.init_global to emphasize that this is not the real thing;
wenzelm
parents:
36254
diff
changeset
|
1023 |
val process = |
bafd82950e24
renamed ProofContext.init to ProofContext.init_global to emphasize that this is not the real thing;
wenzelm
parents:
36254
diff
changeset
|
1024 |
MetaSimplifier.rewrite_rule (Predicate_Compile_Simps.get (ProofContext.init_global thy)) |
36246
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
1025 |
fun process_False intro_t = |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
1026 |
if member (op =) (Logic.strip_imp_prems intro_t) @{prop "False"} then NONE else SOME intro_t |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
1027 |
fun process_True intro_t = |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
1028 |
map_filter_premises (fn p => if p = @{prop True} then NONE else SOME p) intro_t |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
1029 |
in |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
1030 |
Option.map (Skip_Proof.make_thm thy) |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
1031 |
(process_False (process_True (prop_of (process intro)))) |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
1032 |
end |
43fecedff8cf
added peephole optimisations to the predicate compiler; added structure Predicate_Compile_Simps for peephole optimisations
bulwahn
parents:
36049
diff
changeset
|
1033 |
|
39541
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1034 |
(* defining a quickcheck predicate *) |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1035 |
|
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1036 |
fun strip_imp_prems (Const(@{const_name HOL.implies}, _) $ A $ B) = A :: strip_imp_prems B |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1037 |
| strip_imp_prems _ = []; |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1038 |
|
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1039 |
fun strip_imp_concl (Const(@{const_name HOL.implies}, _) $ A $ B) = strip_imp_concl B |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1040 |
| strip_imp_concl A = A : term; |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1041 |
|
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1042 |
fun strip_horn A = (strip_imp_prems A, strip_imp_concl A); |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1043 |
|
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1044 |
fun define_quickcheck_predicate t thy = |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1045 |
let |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1046 |
val (vs, t') = strip_abs t |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1047 |
val vs' = Variable.variant_frees (ProofContext.init_global thy) [] vs |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1048 |
val t'' = subst_bounds (map Free (rev vs'), t') |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1049 |
val (prems, concl) = strip_horn t'' |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1050 |
val constname = "quickcheck" |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1051 |
val full_constname = Sign.full_bname thy constname |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1052 |
val constT = map snd vs' ---> @{typ bool} |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1053 |
val thy1 = Sign.add_consts_i [(Binding.name constname, constT, NoSyn)] thy |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1054 |
val const = Const (full_constname, constT) |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1055 |
val t = Logic.list_implies |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1056 |
(map HOLogic.mk_Trueprop (prems @ [HOLogic.mk_not concl]), |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1057 |
HOLogic.mk_Trueprop (list_comb (const, map Free vs'))) |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1058 |
val tac = fn _ => Skip_Proof.cheat_tac thy1 |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1059 |
val intro = Goal.prove (ProofContext.init_global thy1) (map fst vs') [] t tac |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1060 |
in |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1061 |
((((full_constname, constT), vs'), intro), thy1) |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1062 |
end |
6605c1e87c7f
removing clone in code_prolog and predicate_compile_quickcheck
bulwahn
parents:
39383
diff
changeset
|
1063 |
|
33250
5c2af18a3237
including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
bulwahn
parents:
diff
changeset
|
1064 |
end; |