author | wenzelm |
Fri, 25 Sep 2015 20:37:59 +0200 | |
changeset 61268 | abe08fb15a12 |
parent 61125 | 4c68426800de |
child 61424 | c3658c18b7bc |
permissions | -rw-r--r-- |
33265 | 1 |
(* Title: HOL/Tools/Predicate_Compile/predicate_compile_core.ML |
2 |
Author: Lukas Bulwahn, TU Muenchen |
|
32667 | 3 |
|
33265 | 4 |
A compiler from predicates specified by intro/elim rules to equations. |
32667 | 5 |
*) |
6 |
||
7 |
signature PREDICATE_COMPILE_CORE = |
|
8 |
sig |
|
50057 | 9 |
type seed = Random_Engine.seed |
36048 | 10 |
type mode = Predicate_Compile_Aux.mode |
11 |
type options = Predicate_Compile_Aux.options |
|
12 |
type compilation = Predicate_Compile_Aux.compilation |
|
13 |
type compilation_funs = Predicate_Compile_Aux.compilation_funs |
|
55437 | 14 |
|
36048 | 15 |
val code_pred : options -> string -> Proof.context -> Proof.state |
16 |
val code_pred_cmd : options -> string -> Proof.context -> Proof.state |
|
55437 | 17 |
val values_cmd : string list -> mode option list option -> |
18 |
((string option * bool) * (compilation * int list)) -> int -> string -> Toplevel.state -> unit |
|
40053
3fa49ea76cbb
using a signature in core_data and moving some more functions to core_data
bulwahn
parents:
40052
diff
changeset
|
19 |
|
42141
2c255ba8f299
changing values_timeout from a static option to a dynamic option as required for testing with SML/NJ
bulwahn
parents:
42094
diff
changeset
|
20 |
val values_timeout : real Config.T |
55437 | 21 |
|
37007
116670499530
changing operations for accessing data to work with contexts
bulwahn
parents:
37006
diff
changeset
|
22 |
val print_stored_rules : Proof.context -> unit |
37003
a393a588b82e
moving towards working with proof contexts in the predicate compiler
bulwahn
parents:
37002
diff
changeset
|
23 |
val print_all_modes : compilation -> Proof.context -> unit |
39388
fdbb2c55ffc2
replaced ML_Context.evaluate by ML_Context.value -- using context data instead of bare metal references
haftmann
parents:
39310
diff
changeset
|
24 |
|
fdbb2c55ffc2
replaced ML_Context.evaluate by ML_Context.value -- using context data instead of bare metal references
haftmann
parents:
39310
diff
changeset
|
25 |
val put_pred_result : (unit -> term Predicate.pred) -> Proof.context -> Proof.context |
50057 | 26 |
val put_pred_random_result : (unit -> seed -> term Predicate.pred * seed) -> |
39388
fdbb2c55ffc2
replaced ML_Context.evaluate by ML_Context.value -- using context data instead of bare metal references
haftmann
parents:
39310
diff
changeset
|
27 |
Proof.context -> Proof.context |
51126
df86080de4cb
reform of predicate compiler / quickcheck theories:
haftmann
parents:
50057
diff
changeset
|
28 |
val put_dseq_result : (unit -> term Limited_Sequence.dseq) -> Proof.context -> Proof.context |
55437 | 29 |
val put_dseq_random_result : |
30 |
(unit -> Code_Numeral.natural -> Code_Numeral.natural -> seed -> |
|
31 |
term Limited_Sequence.dseq * seed) -> |
|
39388
fdbb2c55ffc2
replaced ML_Context.evaluate by ML_Context.value -- using context data instead of bare metal references
haftmann
parents:
39310
diff
changeset
|
32 |
Proof.context -> Proof.context |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
33 |
val put_new_dseq_result : (unit -> Code_Numeral.natural -> term Lazy_Sequence.lazy_sequence) -> |
40102
a9e4e94b3022
restructuring values command and adding generator compilation
bulwahn
parents:
40053
diff
changeset
|
34 |
Proof.context -> Proof.context |
39388
fdbb2c55ffc2
replaced ML_Context.evaluate by ML_Context.value -- using context data instead of bare metal references
haftmann
parents:
39310
diff
changeset
|
35 |
val put_lseq_random_result : |
55437 | 36 |
(unit -> Code_Numeral.natural -> Code_Numeral.natural -> seed -> Code_Numeral.natural -> |
37 |
term Lazy_Sequence.lazy_sequence) -> |
|
39388
fdbb2c55ffc2
replaced ML_Context.evaluate by ML_Context.value -- using context data instead of bare metal references
haftmann
parents:
39310
diff
changeset
|
38 |
Proof.context -> Proof.context |
fdbb2c55ffc2
replaced ML_Context.evaluate by ML_Context.value -- using context data instead of bare metal references
haftmann
parents:
39310
diff
changeset
|
39 |
val put_lseq_random_stats_result : |
55437 | 40 |
(unit -> Code_Numeral.natural -> Code_Numeral.natural -> seed -> Code_Numeral.natural -> |
41 |
(term * Code_Numeral.natural) Lazy_Sequence.lazy_sequence) -> |
|
39388
fdbb2c55ffc2
replaced ML_Context.evaluate by ML_Context.value -- using context data instead of bare metal references
haftmann
parents:
39310
diff
changeset
|
42 |
Proof.context -> Proof.context |
fdbb2c55ffc2
replaced ML_Context.evaluate by ML_Context.value -- using context data instead of bare metal references
haftmann
parents:
39310
diff
changeset
|
43 |
|
33628 | 44 |
val code_pred_intro_attrib : attribute |
55437 | 45 |
(* used by Quickcheck_Generator *) |
32667 | 46 |
(* temporary for testing of the compilation *) |
36048 | 47 |
val add_equations : options -> string list -> theory -> theory |
48 |
val add_depth_limited_random_equations : options -> string list -> theory -> theory |
|
49 |
val add_random_dseq_equations : options -> string list -> theory -> theory |
|
50 |
val add_new_random_dseq_equations : options -> string list -> theory -> theory |
|
40103 | 51 |
val add_generator_dseq_equations : options -> string list -> theory -> theory |
45450 | 52 |
val add_generator_cps_equations : options -> string list -> theory -> theory |
33473
3b275a0bf18c
adding tracing function for evaluated code; annotated compilation in the predicate compiler
bulwahn
parents:
33377
diff
changeset
|
53 |
val mk_tracing : string -> term -> term |
39310
17ef4415b17c
removing obsolete argument in prepare_intrs; passing context instead of theory in prepare_intrs
bulwahn
parents:
39299
diff
changeset
|
54 |
val prepare_intrs : options -> Proof.context -> string list -> thm list -> |
38957
2eb265efa1b0
exporting mode analysis for use in prolog generation
bulwahn
parents:
38864
diff
changeset
|
55 |
((string * typ) list * string list * string list * (string * mode list) list * |
2eb265efa1b0
exporting mode analysis for use in prolog generation
bulwahn
parents:
38864
diff
changeset
|
56 |
(string * (Term.term list * Predicate_Compile_Aux.indprem list) list) list) |
39761
c2a76ec6e2d9
renaming use_random to use_generators in the predicate compiler
bulwahn
parents:
39760
diff
changeset
|
57 |
type mode_analysis_options = |
c2a76ec6e2d9
renaming use_random to use_generators in the predicate compiler
bulwahn
parents:
39760
diff
changeset
|
58 |
{use_generators : bool, |
c2a76ec6e2d9
renaming use_random to use_generators in the predicate compiler
bulwahn
parents:
39760
diff
changeset
|
59 |
reorder_premises : bool, |
55437 | 60 |
infer_pos_and_neg_modes : bool} |
38957
2eb265efa1b0
exporting mode analysis for use in prolog generation
bulwahn
parents:
38864
diff
changeset
|
61 |
datatype mode_derivation = Mode_App of mode_derivation * mode_derivation | Context of mode |
39310
17ef4415b17c
removing obsolete argument in prepare_intrs; passing context instead of theory in prepare_intrs
bulwahn
parents:
39299
diff
changeset
|
62 |
| Mode_Pair of mode_derivation * mode_derivation | Term of mode |
39461
0ed0f015d140
adding mode inference to prolog compilation; separate between (ad-hoc) code modifications and system_configuration; adapting quickcheck
bulwahn
parents:
39403
diff
changeset
|
63 |
val head_mode_of : mode_derivation -> mode |
38957
2eb265efa1b0
exporting mode analysis for use in prolog generation
bulwahn
parents:
38864
diff
changeset
|
64 |
type moded_clause = term list * (Predicate_Compile_Aux.indprem * mode_derivation) list |
2eb265efa1b0
exporting mode analysis for use in prolog generation
bulwahn
parents:
38864
diff
changeset
|
65 |
type 'a pred_mode_table = (string * ((bool * mode) * 'a) list) list |
2eb265efa1b0
exporting mode analysis for use in prolog generation
bulwahn
parents:
38864
diff
changeset
|
66 |
|
32667 | 67 |
end; |
68 |
||
69 |
structure Predicate_Compile_Core : PREDICATE_COMPILE_CORE = |
|
70 |
struct |
|
71 |
||
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
72 |
type random_seed = Random_Engine.seed |
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
73 |
|
32668
b2de45007537
added first prototype of the extended predicate compiler
bulwahn
parents:
32667
diff
changeset
|
74 |
open Predicate_Compile_Aux; |
40052
ea46574ca815
splitting large core file into core_data, mode_inference and predicate_compile_proof
bulwahn
parents:
40051
diff
changeset
|
75 |
open Mode_Inference; |
ea46574ca815
splitting large core file into core_data, mode_inference and predicate_compile_proof
bulwahn
parents:
40051
diff
changeset
|
76 |
open Predicate_Compile_Proof; |
33108
9d9afd478016
added test for higher-order function inductification; added debug messages
bulwahn
parents:
33106
diff
changeset
|
77 |
|
50057 | 78 |
type seed = Random_Engine.seed; |
79 |
||
80 |
||
32667 | 81 |
(** fundamentals **) |
82 |
||
83 |
(* syntactic operations *) |
|
84 |
||
85 |
fun mk_eq (x, xs) = |
|
86 |
let fun mk_eqs _ [] = [] |
|
87 |
| mk_eqs a (b::cs) = |
|
88 |
HOLogic.mk_eq (Free (a, fastype_of b), b) :: mk_eqs a cs |
|
89 |
in mk_eqs x xs end; |
|
90 |
||
33473
3b275a0bf18c
adding tracing function for evaluated code; annotated compilation in the predicate compiler
bulwahn
parents:
33377
diff
changeset
|
91 |
fun mk_tracing s t = |
3b275a0bf18c
adding tracing function for evaluated code; annotated compilation in the predicate compiler
bulwahn
parents:
33377
diff
changeset
|
92 |
Const(@{const_name Code_Evaluation.tracing}, |
3b275a0bf18c
adding tracing function for evaluated code; annotated compilation in the predicate compiler
bulwahn
parents:
33377
diff
changeset
|
93 |
@{typ String.literal} --> (fastype_of t) --> (fastype_of t)) $ (HOLogic.mk_literal s) $ t |
3b275a0bf18c
adding tracing function for evaluated code; annotated compilation in the predicate compiler
bulwahn
parents:
33377
diff
changeset
|
94 |
|
55437 | 95 |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
96 |
(* representation of inferred clauses with modes *) |
32667 | 97 |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
98 |
type moded_clause = term list * (indprem * mode_derivation) list |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
99 |
|
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:
35267
diff
changeset
|
100 |
type 'a pred_mode_table = (string * ((bool * mode) * 'a) list) list |
32667 | 101 |
|
55437 | 102 |
|
32667 | 103 |
(* diagnostic display functions *) |
104 |
||
37004 | 105 |
fun print_modes options modes = |
33251 | 106 |
if show_modes options then |
33326
7d0288d90535
improved handling of alternative rules; added test cases for alternative rules; normalized tracing in the predicate compiler
bulwahn
parents:
33268
diff
changeset
|
107 |
tracing ("Inferred modes:\n" ^ |
33251 | 108 |
cat_lines (map (fn (s, ms) => s ^ ": " ^ commas (map |
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:
35267
diff
changeset
|
109 |
(fn (p, m) => string_of_mode m ^ (if p then "pos" else "neg")) ms)) modes)) |
33251 | 110 |
else () |
32667 | 111 |
|
37004 | 112 |
fun print_pred_mode_table string_of_entry pred_mode_table = |
32667 | 113 |
let |
50056 | 114 |
fun print_mode pred ((_, mode), entry) = "mode : " ^ 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:
33526
diff
changeset
|
115 |
^ string_of_entry pred mode entry |
32667 | 116 |
fun print_pred (pred, modes) = |
117 |
"predicate " ^ pred ^ ": " ^ cat_lines (map (print_mode pred) modes) |
|
33326
7d0288d90535
improved handling of alternative rules; added test cases for alternative rules; normalized tracing in the predicate compiler
bulwahn
parents:
33268
diff
changeset
|
118 |
val _ = tracing (cat_lines (map print_pred pred_mode_table)) |
32667 | 119 |
in () end; |
120 |
||
37005
842a73dc6d0e
changing compilation to work only with contexts; adapting quickcheck
bulwahn
parents:
37004
diff
changeset
|
121 |
fun print_compiled_terms options ctxt = |
33139
9c01ee6f8ee9
added skip_proof option; playing with compilation of depth-limited predicates
bulwahn
parents:
33138
diff
changeset
|
122 |
if show_compilation options then |
37005
842a73dc6d0e
changing compilation to work only with contexts; adapting quickcheck
bulwahn
parents:
37004
diff
changeset
|
123 |
print_pred_mode_table (fn _ => fn _ => Syntax.string_of_term ctxt) |
33139
9c01ee6f8ee9
added skip_proof option; playing with compilation of depth-limited predicates
bulwahn
parents:
33138
diff
changeset
|
124 |
else K () |
9c01ee6f8ee9
added skip_proof option; playing with compilation of depth-limited predicates
bulwahn
parents:
33138
diff
changeset
|
125 |
|
37007
116670499530
changing operations for accessing data to work with contexts
bulwahn
parents:
37006
diff
changeset
|
126 |
fun print_stored_rules ctxt = |
32667 | 127 |
let |
61114 | 128 |
val preds = Graph.keys (Core_Data.PredData.get (Proof_Context.theory_of ctxt)) |
129 |
fun print pred () = |
|
130 |
let |
|
131 |
val _ = writeln ("predicate: " ^ pred) |
|
132 |
val _ = writeln ("introrules: ") |
|
61268 | 133 |
val _ = fold (fn thm => fn _ => writeln (Thm.string_of_thm ctxt thm)) |
61114 | 134 |
(rev (Core_Data.intros_of ctxt pred)) () |
135 |
in |
|
136 |
if Core_Data.has_elim ctxt pred then |
|
61268 | 137 |
writeln ("elimrule: " ^ Thm.string_of_thm ctxt (Core_Data.the_elim_of ctxt pred)) |
61114 | 138 |
else |
139 |
writeln ("no elimrule defined") |
|
140 |
end |
|
32667 | 141 |
in |
142 |
fold print preds () |
|
143 |
end; |
|
144 |
||
37003
a393a588b82e
moving towards working with proof contexts in the predicate compiler
bulwahn
parents:
37002
diff
changeset
|
145 |
fun print_all_modes compilation ctxt = |
32667 | 146 |
let |
147 |
val _ = writeln ("Inferred modes:") |
|
148 |
fun print (pred, modes) u = |
|
149 |
let |
|
150 |
val _ = writeln ("predicate: " ^ pred) |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
151 |
val _ = writeln ("modes: " ^ (commas (map string_of_mode modes))) |
33619
d93a3cb55068
first steps towards a new mode datastructure; new syntax for mode annotations and new output of modes
bulwahn
parents:
33526
diff
changeset
|
152 |
in u end |
32667 | 153 |
in |
61114 | 154 |
fold print (Core_Data.all_modes_of compilation ctxt) () |
32667 | 155 |
end |
33129
3085da75ed54
changed import_intros to handle parameters differently; changed handling of higher-order function compilation; reverted MicroJava change; tuned
bulwahn
parents:
33128
diff
changeset
|
156 |
|
33132
07efd452a698
moved argument expected_modes into options; improved mode check to only check mode of the named predicate
bulwahn
parents:
33131
diff
changeset
|
157 |
(* validity checks *) |
07efd452a698
moved argument expected_modes into options; improved mode check to only check mode of the named predicate
bulwahn
parents:
33131
diff
changeset
|
158 |
|
50056 | 159 |
fun check_expected_modes options _ modes = |
55437 | 160 |
(case expected_modes options of |
161 |
SOME (s, ms) => |
|
162 |
(case AList.lookup (op =) modes s of |
|
163 |
SOME modes => |
|
164 |
let |
|
165 |
val modes' = map snd modes |
|
166 |
in |
|
167 |
if not (eq_set eq_mode (ms, modes')) then |
|
168 |
error ("expected modes were not inferred:\n" |
|
169 |
^ " inferred modes for " ^ s ^ ": " ^ commas (map string_of_mode modes') ^ "\n" |
|
170 |
^ " expected modes for " ^ s ^ ": " ^ commas (map string_of_mode ms)) |
|
171 |
else () |
|
172 |
end |
|
173 |
| NONE => ()) |
|
174 |
| NONE => ()) |
|
33752
9aa8e961f850
adopting proposed_modes; adding a new dimension of complexity for nicer error messages; tuned
bulwahn
parents:
33671
diff
changeset
|
175 |
|
40138 | 176 |
fun check_proposed_modes options preds modes errors = |
55437 | 177 |
map (fn (s, _) => |
178 |
case proposed_modes options s of |
|
179 |
SOME ms => |
|
180 |
(case AList.lookup (op =) modes s of |
|
181 |
SOME inferred_ms => |
|
182 |
let |
|
183 |
val preds_without_modes = map fst (filter (null o snd) modes) |
|
184 |
val modes' = map snd inferred_ms |
|
185 |
in |
|
186 |
if not (eq_set eq_mode (ms, modes')) then |
|
187 |
error ("expected modes were not inferred:\n" |
|
188 |
^ " inferred modes for " ^ s ^ ": " ^ commas (map string_of_mode modes') ^ "\n" |
|
189 |
^ " expected modes for " ^ s ^ ": " ^ commas (map string_of_mode ms) ^ "\n" |
|
190 |
^ (if show_invalid_clauses options then |
|
191 |
("For the following clauses, the following modes could not be inferred: " ^ "\n" |
|
192 |
^ cat_lines errors) else "") ^ |
|
193 |
(if not (null preds_without_modes) then |
|
194 |
"\n" ^ "No mode inferred for the predicates " ^ commas preds_without_modes |
|
195 |
else "")) |
|
196 |
else () |
|
197 |
end |
|
198 |
| NONE => ()) |
|
199 |
| NONE => ()) preds |
|
33132
07efd452a698
moved argument expected_modes into options; improved mode check to only check mode of the named predicate
bulwahn
parents:
33131
diff
changeset
|
200 |
|
39651
2e06dad03dd3
adding check if user-given modes match type of predicates; removed useless function expand_tuples_elim
bulwahn
parents:
39649
diff
changeset
|
201 |
fun check_matches_type ctxt predname T ms = |
2e06dad03dd3
adding check if user-given modes match type of predicates; removed useless function expand_tuples_elim
bulwahn
parents:
39649
diff
changeset
|
202 |
let |
50056 | 203 |
fun check (Fun (m1, m2)) (Type("fun", [T1,T2])) = check m1 T1 andalso check m2 T2 |
204 |
| check m (Type("fun", _)) = (m = Input orelse m = Output) |
|
39651
2e06dad03dd3
adding check if user-given modes match type of predicates; removed useless function expand_tuples_elim
bulwahn
parents:
39649
diff
changeset
|
205 |
| check (Pair (m1, m2)) (Type (@{type_name Product_Type.prod}, [T1, T2])) = |
55437 | 206 |
check m1 T1 andalso check m2 T2 |
50056 | 207 |
| check Input _ = true |
208 |
| check Output _ = true |
|
39651
2e06dad03dd3
adding check if user-given modes match type of predicates; removed useless function expand_tuples_elim
bulwahn
parents:
39649
diff
changeset
|
209 |
| check Bool @{typ bool} = true |
2e06dad03dd3
adding check if user-given modes match type of predicates; removed useless function expand_tuples_elim
bulwahn
parents:
39649
diff
changeset
|
210 |
| check _ _ = false |
39763
03f95582ef63
weakening check for higher-order relations, but adding check for consistent modes
bulwahn
parents:
39762
diff
changeset
|
211 |
fun check_consistent_modes ms = |
50056 | 212 |
if forall (fn Fun _ => true | _ => false) ms then |
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58823
diff
changeset
|
213 |
apply2 check_consistent_modes (split_list (map (fn Fun (m1, m2) => (m1, m2)) ms)) |
55437 | 214 |
|> (fn (res1, res2) => res1 andalso res2) |
39763
03f95582ef63
weakening check for higher-order relations, but adding check for consistent modes
bulwahn
parents:
39762
diff
changeset
|
215 |
else if forall (fn Input => true | Output => true | Pair _ => true | _ => false) ms then |
03f95582ef63
weakening check for higher-order relations, but adding check for consistent modes
bulwahn
parents:
39762
diff
changeset
|
216 |
true |
03f95582ef63
weakening check for higher-order relations, but adding check for consistent modes
bulwahn
parents:
39762
diff
changeset
|
217 |
else if forall (fn Bool => true | _ => false) ms then |
03f95582ef63
weakening check for higher-order relations, but adding check for consistent modes
bulwahn
parents:
39762
diff
changeset
|
218 |
true |
03f95582ef63
weakening check for higher-order relations, but adding check for consistent modes
bulwahn
parents:
39762
diff
changeset
|
219 |
else |
03f95582ef63
weakening check for higher-order relations, but adding check for consistent modes
bulwahn
parents:
39762
diff
changeset
|
220 |
false |
55437 | 221 |
val _ = |
222 |
map (fn mode => |
|
39763
03f95582ef63
weakening check for higher-order relations, but adding check for consistent modes
bulwahn
parents:
39762
diff
changeset
|
223 |
if length (strip_fun_mode mode) = length (binder_types T) |
03f95582ef63
weakening check for higher-order relations, but adding check for consistent modes
bulwahn
parents:
39762
diff
changeset
|
224 |
andalso (forall (uncurry check) (strip_fun_mode mode ~~ binder_types T)) then () |
55437 | 225 |
else |
226 |
error (string_of_mode mode ^ " is not a valid mode for " ^ |
|
227 |
Syntax.string_of_typ ctxt T ^ " at predicate " ^ predname)) ms |
|
39763
03f95582ef63
weakening check for higher-order relations, but adding check for consistent modes
bulwahn
parents:
39762
diff
changeset
|
228 |
val _ = |
55437 | 229 |
if check_consistent_modes ms then () |
230 |
else |
|
231 |
error (commas (map string_of_mode ms) ^ " are inconsistent modes for predicate " ^ predname) |
|
39651
2e06dad03dd3
adding check if user-given modes match type of predicates; removed useless function expand_tuples_elim
bulwahn
parents:
39649
diff
changeset
|
232 |
in |
2e06dad03dd3
adding check if user-given modes match type of predicates; removed useless function expand_tuples_elim
bulwahn
parents:
39649
diff
changeset
|
233 |
ms |
2e06dad03dd3
adding check if user-given modes match type of predicates; removed useless function expand_tuples_elim
bulwahn
parents:
39649
diff
changeset
|
234 |
end |
2e06dad03dd3
adding check if user-given modes match type of predicates; removed useless function expand_tuples_elim
bulwahn
parents:
39649
diff
changeset
|
235 |
|
55437 | 236 |
|
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
237 |
(* compilation modifiers *) |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
238 |
|
55437 | 239 |
structure Comp_Mod = (* FIXME proper signature *) |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
240 |
struct |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
241 |
|
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
242 |
datatype comp_modifiers = Comp_Modifiers of |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
243 |
{ |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
244 |
compilation : compilation, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
245 |
function_name_prefix : string, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
246 |
compfuns : compilation_funs, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
247 |
mk_random : typ -> term list -> term, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
248 |
modify_funT : typ -> typ, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
249 |
additional_arguments : string list -> term list, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
250 |
wrap_compilation : compilation_funs -> string -> typ -> mode -> term list -> term -> term, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
251 |
transform_additional_arguments : indprem -> term list -> term list |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
252 |
} |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
253 |
|
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
254 |
fun dest_comp_modifiers (Comp_Modifiers c) = c |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
255 |
|
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
256 |
val compilation = #compilation o dest_comp_modifiers |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
257 |
val function_name_prefix = #function_name_prefix o dest_comp_modifiers |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
258 |
val compfuns = #compfuns o dest_comp_modifiers |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
259 |
|
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
260 |
val mk_random = #mk_random o dest_comp_modifiers |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
261 |
val funT_of' = funT_of o compfuns |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
262 |
val modify_funT = #modify_funT o dest_comp_modifiers |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
263 |
fun funT_of comp mode = modify_funT comp o funT_of' comp mode |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
264 |
|
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
265 |
val additional_arguments = #additional_arguments o dest_comp_modifiers |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
266 |
val wrap_compilation = #wrap_compilation o dest_comp_modifiers |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
267 |
val transform_additional_arguments = #transform_additional_arguments o dest_comp_modifiers |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
268 |
|
40049
75d9f57123d6
adding decreasing bind and non-decreasing bind; depth-limited and depth-unlimited compilation possible
bulwahn
parents:
39785
diff
changeset
|
269 |
fun set_compfuns compfuns' (Comp_Modifiers {compilation, function_name_prefix, compfuns, mk_random, |
75d9f57123d6
adding decreasing bind and non-decreasing bind; depth-limited and depth-unlimited compilation possible
bulwahn
parents:
39785
diff
changeset
|
270 |
modify_funT, additional_arguments, wrap_compilation, transform_additional_arguments}) = |
75d9f57123d6
adding decreasing bind and non-decreasing bind; depth-limited and depth-unlimited compilation possible
bulwahn
parents:
39785
diff
changeset
|
271 |
(Comp_Modifiers {compilation = compilation, function_name_prefix = function_name_prefix, |
75d9f57123d6
adding decreasing bind and non-decreasing bind; depth-limited and depth-unlimited compilation possible
bulwahn
parents:
39785
diff
changeset
|
272 |
compfuns = compfuns', mk_random = mk_random, modify_funT = modify_funT, |
75d9f57123d6
adding decreasing bind and non-decreasing bind; depth-limited and depth-unlimited compilation possible
bulwahn
parents:
39785
diff
changeset
|
273 |
additional_arguments = additional_arguments, wrap_compilation = wrap_compilation, |
75d9f57123d6
adding decreasing bind and non-decreasing bind; depth-limited and depth-unlimited compilation possible
bulwahn
parents:
39785
diff
changeset
|
274 |
transform_additional_arguments = transform_additional_arguments}) |
75d9f57123d6
adding decreasing bind and non-decreasing bind; depth-limited and depth-unlimited compilation possible
bulwahn
parents:
39785
diff
changeset
|
275 |
|
55437 | 276 |
end |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
277 |
|
40051
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
278 |
fun unlimited_compfuns_of true New_Pos_Random_DSeq = |
55437 | 279 |
New_Pos_Random_Sequence_CompFuns.depth_unlimited_compfuns |
40051
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
280 |
| unlimited_compfuns_of false New_Pos_Random_DSeq = |
55437 | 281 |
New_Neg_Random_Sequence_CompFuns.depth_unlimited_compfuns |
40051
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
282 |
| unlimited_compfuns_of true Pos_Generator_DSeq = |
55437 | 283 |
New_Pos_DSequence_CompFuns.depth_unlimited_compfuns |
40051
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
284 |
| unlimited_compfuns_of false Pos_Generator_DSeq = |
55437 | 285 |
New_Neg_DSequence_CompFuns.depth_unlimited_compfuns |
40051
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
286 |
| unlimited_compfuns_of _ c = |
55437 | 287 |
raise Fail ("No unlimited compfuns for compilation " ^ string_of_compilation c) |
40051
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
288 |
|
40049
75d9f57123d6
adding decreasing bind and non-decreasing bind; depth-limited and depth-unlimited compilation possible
bulwahn
parents:
39785
diff
changeset
|
289 |
fun limited_compfuns_of true Predicate_Compile_Aux.New_Pos_Random_DSeq = |
55437 | 290 |
New_Pos_Random_Sequence_CompFuns.depth_limited_compfuns |
40049
75d9f57123d6
adding decreasing bind and non-decreasing bind; depth-limited and depth-unlimited compilation possible
bulwahn
parents:
39785
diff
changeset
|
291 |
| limited_compfuns_of false Predicate_Compile_Aux.New_Pos_Random_DSeq = |
55437 | 292 |
New_Neg_Random_Sequence_CompFuns.depth_limited_compfuns |
40051
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
293 |
| limited_compfuns_of true Pos_Generator_DSeq = |
55437 | 294 |
New_Pos_DSequence_CompFuns.depth_limited_compfuns |
40051
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
295 |
| limited_compfuns_of false Pos_Generator_DSeq = |
55437 | 296 |
New_Neg_DSequence_CompFuns.depth_limited_compfuns |
40051
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
297 |
| limited_compfuns_of _ c = |
55437 | 298 |
raise Fail ("No limited compfuns for compilation " ^ string_of_compilation c) |
40049
75d9f57123d6
adding decreasing bind and non-decreasing bind; depth-limited and depth-unlimited compilation possible
bulwahn
parents:
39785
diff
changeset
|
299 |
|
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
300 |
val depth_limited_comp_modifiers = Comp_Mod.Comp_Modifiers |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
301 |
{ |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
302 |
compilation = Depth_Limited, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
303 |
function_name_prefix = "depth_limited_", |
45450 | 304 |
compfuns = Predicate_Comp_Funs.compfuns, |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
305 |
mk_random = (fn _ => error "no random generation"), |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
306 |
additional_arguments = fn names => |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
307 |
let |
43324
2b47822868e4
discontinued Name.variant to emphasize that this is old-style / indirect;
wenzelm
parents:
43253
diff
changeset
|
308 |
val depth_name = singleton (Name.variant_list names) "depth" |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
309 |
in [Free (depth_name, @{typ natural})] end, |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
310 |
modify_funT = (fn T => let val (Ts, U) = strip_type T |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
311 |
val Ts' = [@{typ natural}] in (Ts @ Ts') ---> U end), |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
312 |
wrap_compilation = |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
313 |
fn compfuns => fn s => fn T => fn mode => fn additional_arguments => fn compilation => |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
314 |
let |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
315 |
val [depth] = additional_arguments |
40139 | 316 |
val (_, Ts) = split_modeT mode (binder_types T) |
45461
130c90bb80b4
using more conventional names for monad plus operations
bulwahn
parents:
45452
diff
changeset
|
317 |
val T' = mk_monadT compfuns (HOLogic.mk_tupleT Ts) |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
318 |
val if_const = Const (@{const_name "If"}, @{typ bool} --> T' --> T' --> T') |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
319 |
in |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
320 |
if_const $ HOLogic.mk_eq (depth, @{term "0 :: natural"}) |
45461
130c90bb80b4
using more conventional names for monad plus operations
bulwahn
parents:
45452
diff
changeset
|
321 |
$ mk_empty compfuns (dest_monadT compfuns T') |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
322 |
$ compilation |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
323 |
end, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
324 |
transform_additional_arguments = |
50056 | 325 |
fn _ => fn additional_arguments => |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
326 |
let |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
327 |
val [depth] = additional_arguments |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
328 |
val depth' = |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
329 |
Const (@{const_name Groups.minus}, @{typ "natural => natural => natural"}) |
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
330 |
$ depth $ Const (@{const_name Groups.one}, @{typ "natural"}) |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
331 |
in [depth'] end |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
332 |
} |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
333 |
|
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
334 |
val random_comp_modifiers = Comp_Mod.Comp_Modifiers |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
335 |
{ |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
336 |
compilation = Random, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
337 |
function_name_prefix = "random_", |
45450 | 338 |
compfuns = Predicate_Comp_Funs.compfuns, |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
339 |
mk_random = (fn T => fn additional_arguments => |
51126
df86080de4cb
reform of predicate compiler / quickcheck theories:
haftmann
parents:
50057
diff
changeset
|
340 |
list_comb (Const(@{const_name Random_Pred.iter}, |
55437 | 341 |
[@{typ natural}, @{typ natural}, @{typ Random.seed}] ---> |
45461
130c90bb80b4
using more conventional names for monad plus operations
bulwahn
parents:
45452
diff
changeset
|
342 |
Predicate_Comp_Funs.mk_monadT T), additional_arguments)), |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
343 |
modify_funT = (fn T => |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
344 |
let |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
345 |
val (Ts, U) = strip_type T |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
346 |
val Ts' = [@{typ natural}, @{typ natural}, @{typ Random.seed}] |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
347 |
in (Ts @ Ts') ---> U end), |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
348 |
additional_arguments = (fn names => |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
349 |
let |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
350 |
val [nrandom, size, seed] = Name.variant_list names ["nrandom", "size", "seed"] |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
351 |
in |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
352 |
[Free (nrandom, @{typ natural}), Free (size, @{typ natural}), |
51126
df86080de4cb
reform of predicate compiler / quickcheck theories:
haftmann
parents:
50057
diff
changeset
|
353 |
Free (seed, @{typ Random.seed})] |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
354 |
end), |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
355 |
wrap_compilation = K (K (K (K (K I)))) |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
356 |
: (compilation_funs -> string -> typ -> mode -> term list -> term -> term), |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
357 |
transform_additional_arguments = K I : (indprem -> term list -> term list) |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
358 |
} |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
359 |
|
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
360 |
val depth_limited_random_comp_modifiers = Comp_Mod.Comp_Modifiers |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
361 |
{ |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
362 |
compilation = Depth_Limited_Random, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
363 |
function_name_prefix = "depth_limited_random_", |
45450 | 364 |
compfuns = Predicate_Comp_Funs.compfuns, |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
365 |
mk_random = (fn T => fn additional_arguments => |
51126
df86080de4cb
reform of predicate compiler / quickcheck theories:
haftmann
parents:
50057
diff
changeset
|
366 |
list_comb (Const(@{const_name Random_Pred.iter}, |
55437 | 367 |
[@{typ natural}, @{typ natural}, @{typ Random.seed}] ---> |
45461
130c90bb80b4
using more conventional names for monad plus operations
bulwahn
parents:
45452
diff
changeset
|
368 |
Predicate_Comp_Funs.mk_monadT T), tl additional_arguments)), |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
369 |
modify_funT = (fn T => |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
370 |
let |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
371 |
val (Ts, U) = strip_type T |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
372 |
val Ts' = [@{typ natural}, @{typ natural}, @{typ natural}, |
51126
df86080de4cb
reform of predicate compiler / quickcheck theories:
haftmann
parents:
50057
diff
changeset
|
373 |
@{typ Random.seed}] |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
374 |
in (Ts @ Ts') ---> U end), |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
375 |
additional_arguments = (fn names => |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
376 |
let |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
377 |
val [depth, nrandom, size, seed] = Name.variant_list names ["depth", "nrandom", "size", "seed"] |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
378 |
in |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
379 |
[Free (depth, @{typ natural}), Free (nrandom, @{typ natural}), |
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
380 |
Free (size, @{typ natural}), Free (seed, @{typ Random.seed})] |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
381 |
end), |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
382 |
wrap_compilation = |
50056 | 383 |
fn compfuns => fn _ => fn T => fn mode => fn additional_arguments => fn compilation => |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
384 |
let |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
385 |
val depth = hd (additional_arguments) |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
386 |
val (_, Ts) = split_map_modeT (fn m => fn T => (SOME (funT_of compfuns m T), NONE)) |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
387 |
mode (binder_types T) |
45461
130c90bb80b4
using more conventional names for monad plus operations
bulwahn
parents:
45452
diff
changeset
|
388 |
val T' = mk_monadT compfuns (HOLogic.mk_tupleT Ts) |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
389 |
val if_const = Const (@{const_name "If"}, @{typ bool} --> T' --> T' --> T') |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
390 |
in |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
391 |
if_const $ HOLogic.mk_eq (depth, @{term "0 :: natural"}) |
45461
130c90bb80b4
using more conventional names for monad plus operations
bulwahn
parents:
45452
diff
changeset
|
392 |
$ mk_empty compfuns (dest_monadT compfuns T') |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
393 |
$ compilation |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
394 |
end, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
395 |
transform_additional_arguments = |
50056 | 396 |
fn _ => fn additional_arguments => |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
397 |
let |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
398 |
val [depth, nrandom, size, seed] = additional_arguments |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
399 |
val depth' = |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
400 |
Const (@{const_name Groups.minus}, @{typ "natural => natural => natural"}) |
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
401 |
$ depth $ Const (@{const_name Groups.one}, @{typ "natural"}) |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
402 |
in [depth', nrandom, size, seed] end |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
403 |
} |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
404 |
|
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
405 |
val predicate_comp_modifiers = Comp_Mod.Comp_Modifiers |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
406 |
{ |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
407 |
compilation = Pred, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
408 |
function_name_prefix = "", |
45450 | 409 |
compfuns = Predicate_Comp_Funs.compfuns, |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
410 |
mk_random = (fn _ => error "no random generation"), |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
411 |
modify_funT = I, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
412 |
additional_arguments = K [], |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
413 |
wrap_compilation = K (K (K (K (K I)))) |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
414 |
: (compilation_funs -> string -> typ -> mode -> term list -> term -> term), |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
415 |
transform_additional_arguments = K I : (indprem -> term list -> term list) |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
416 |
} |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
417 |
|
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
418 |
val dseq_comp_modifiers = Comp_Mod.Comp_Modifiers |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
419 |
{ |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
420 |
compilation = DSeq, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
421 |
function_name_prefix = "dseq_", |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
422 |
compfuns = DSequence_CompFuns.compfuns, |
40051
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
423 |
mk_random = (fn _ => error "no random generation in dseq"), |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
424 |
modify_funT = I, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
425 |
additional_arguments = K [], |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
426 |
wrap_compilation = K (K (K (K (K I)))) |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
427 |
: (compilation_funs -> string -> typ -> mode -> term list -> term -> term), |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
428 |
transform_additional_arguments = K I : (indprem -> term list -> term list) |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
429 |
} |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
430 |
|
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
431 |
val pos_random_dseq_comp_modifiers = Comp_Mod.Comp_Modifiers |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
432 |
{ |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
433 |
compilation = Pos_Random_DSeq, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
434 |
function_name_prefix = "random_dseq_", |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
435 |
compfuns = Random_Sequence_CompFuns.compfuns, |
50056 | 436 |
mk_random = (fn T => fn _ => |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
437 |
let |
51126
df86080de4cb
reform of predicate compiler / quickcheck theories:
haftmann
parents:
50057
diff
changeset
|
438 |
val random = Const (@{const_name Quickcheck_Random.random}, |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
439 |
@{typ natural} --> @{typ Random.seed} --> |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
440 |
HOLogic.mk_prodT (HOLogic.mk_prodT (T, @{typ "unit => term"}), @{typ Random.seed})) |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
441 |
in |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
442 |
Const (@{const_name Random_Sequence.Random}, (@{typ natural} --> @{typ Random.seed} --> |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
443 |
HOLogic.mk_prodT (HOLogic.mk_prodT (T, @{typ "unit => term"}), @{typ Random.seed})) --> |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
444 |
Random_Sequence_CompFuns.mk_random_dseqT T) $ random |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
445 |
end), |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
446 |
|
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
447 |
modify_funT = I, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
448 |
additional_arguments = K [], |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
449 |
wrap_compilation = K (K (K (K (K I)))) |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
450 |
: (compilation_funs -> string -> typ -> mode -> term list -> term -> term), |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
451 |
transform_additional_arguments = K I : (indprem -> term list -> term list) |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
452 |
} |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
453 |
|
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
454 |
val neg_random_dseq_comp_modifiers = Comp_Mod.Comp_Modifiers |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
455 |
{ |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
456 |
compilation = Neg_Random_DSeq, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
457 |
function_name_prefix = "random_dseq_neg_", |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
458 |
compfuns = Random_Sequence_CompFuns.compfuns, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
459 |
mk_random = (fn _ => error "no random generation"), |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
460 |
modify_funT = I, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
461 |
additional_arguments = K [], |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
462 |
wrap_compilation = K (K (K (K (K I)))) |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
463 |
: (compilation_funs -> string -> typ -> mode -> term list -> term -> term), |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
464 |
transform_additional_arguments = K I : (indprem -> term list -> term list) |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
465 |
} |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
466 |
|
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
467 |
|
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
468 |
val new_pos_random_dseq_comp_modifiers = Comp_Mod.Comp_Modifiers |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
469 |
{ |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
470 |
compilation = New_Pos_Random_DSeq, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
471 |
function_name_prefix = "new_random_dseq_", |
40049
75d9f57123d6
adding decreasing bind and non-decreasing bind; depth-limited and depth-unlimited compilation possible
bulwahn
parents:
39785
diff
changeset
|
472 |
compfuns = New_Pos_Random_Sequence_CompFuns.depth_limited_compfuns, |
50056 | 473 |
mk_random = (fn T => fn _ => |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
474 |
let |
51126
df86080de4cb
reform of predicate compiler / quickcheck theories:
haftmann
parents:
50057
diff
changeset
|
475 |
val random = Const (@{const_name Quickcheck_Random.random}, |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
476 |
@{typ natural} --> @{typ Random.seed} --> |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
477 |
HOLogic.mk_prodT (HOLogic.mk_prodT (T, @{typ "unit => term"}), @{typ Random.seed})) |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
478 |
in |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
479 |
Const (@{const_name Random_Sequence.pos_Random}, (@{typ natural} --> @{typ Random.seed} --> |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
480 |
HOLogic.mk_prodT (HOLogic.mk_prodT (T, @{typ "unit => term"}), @{typ Random.seed})) --> |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
481 |
New_Pos_Random_Sequence_CompFuns.mk_pos_random_dseqT T) $ random |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
482 |
end), |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
483 |
modify_funT = I, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
484 |
additional_arguments = K [], |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
485 |
wrap_compilation = K (K (K (K (K I)))) |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
486 |
: (compilation_funs -> string -> typ -> mode -> term list -> term -> term), |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
487 |
transform_additional_arguments = K I : (indprem -> term list -> term list) |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
488 |
} |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
489 |
|
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
490 |
val new_neg_random_dseq_comp_modifiers = Comp_Mod.Comp_Modifiers |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
491 |
{ |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
492 |
compilation = New_Neg_Random_DSeq, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
493 |
function_name_prefix = "new_random_dseq_neg_", |
40049
75d9f57123d6
adding decreasing bind and non-decreasing bind; depth-limited and depth-unlimited compilation possible
bulwahn
parents:
39785
diff
changeset
|
494 |
compfuns = New_Neg_Random_Sequence_CompFuns.depth_limited_compfuns, |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
495 |
mk_random = (fn _ => error "no random generation"), |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
496 |
modify_funT = I, |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
497 |
additional_arguments = K [], |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
498 |
wrap_compilation = K (K (K (K (K I)))) |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
499 |
: (compilation_funs -> string -> typ -> mode -> term list -> term -> term), |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
500 |
transform_additional_arguments = K I : (indprem -> term list -> term list) |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
501 |
} |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
502 |
|
40051
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
503 |
val pos_generator_dseq_comp_modifiers = Comp_Mod.Comp_Modifiers |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
504 |
{ |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
505 |
compilation = Pos_Generator_DSeq, |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
506 |
function_name_prefix = "generator_dseq_", |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
507 |
compfuns = New_Pos_DSequence_CompFuns.depth_limited_compfuns, |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
508 |
mk_random = |
50056 | 509 |
(fn T => fn _ => |
45214 | 510 |
Const (@{const_name "Lazy_Sequence.small_lazy_class.small_lazy"}, |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
511 |
@{typ "natural"} --> Type (@{type_name "Lazy_Sequence.lazy_sequence"}, [T]))), |
40051
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
512 |
modify_funT = I, |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
513 |
additional_arguments = K [], |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
514 |
wrap_compilation = K (K (K (K (K I)))) |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
515 |
: (compilation_funs -> string -> typ -> mode -> term list -> term -> term), |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
516 |
transform_additional_arguments = K I : (indprem -> term list -> term list) |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
517 |
} |
55437 | 518 |
|
40051
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
519 |
val neg_generator_dseq_comp_modifiers = Comp_Mod.Comp_Modifiers |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
520 |
{ |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
521 |
compilation = Neg_Generator_DSeq, |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
522 |
function_name_prefix = "generator_dseq_neg_", |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
523 |
compfuns = New_Neg_DSequence_CompFuns.depth_limited_compfuns, |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
524 |
mk_random = (fn _ => error "no random generation"), |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
525 |
modify_funT = I, |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
526 |
additional_arguments = K [], |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
527 |
wrap_compilation = K (K (K (K (K I)))) |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
528 |
: (compilation_funs -> string -> typ -> mode -> term list -> term -> term), |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
529 |
transform_additional_arguments = K I : (indprem -> term list -> term list) |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
530 |
} |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
531 |
|
45450 | 532 |
val pos_generator_cps_comp_modifiers = Comp_Mod.Comp_Modifiers |
533 |
{ |
|
534 |
compilation = Pos_Generator_CPS, |
|
535 |
function_name_prefix = "generator_cps_pos_", |
|
536 |
compfuns = Pos_Bounded_CPS_Comp_Funs.compfuns, |
|
537 |
mk_random = |
|
50056 | 538 |
(fn T => fn _ => |
45450 | 539 |
Const (@{const_name "Quickcheck_Exhaustive.exhaustive"}, |
45750
17100f4ce0b5
adding genuine flag to predicate_compile_quickcheck and prolog_quickcheck (cf. 5e46c225370e);
bulwahn
parents:
45592
diff
changeset
|
540 |
(T --> @{typ "(bool * term list) option"}) --> |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
541 |
@{typ "natural => (bool * term list) option"})), |
45450 | 542 |
modify_funT = I, |
543 |
additional_arguments = K [], |
|
544 |
wrap_compilation = K (K (K (K (K I)))) |
|
545 |
: (compilation_funs -> string -> typ -> mode -> term list -> term -> term), |
|
546 |
transform_additional_arguments = K I : (indprem -> term list -> term list) |
|
55437 | 547 |
} |
45450 | 548 |
|
549 |
val neg_generator_cps_comp_modifiers = Comp_Mod.Comp_Modifiers |
|
550 |
{ |
|
551 |
compilation = Neg_Generator_CPS, |
|
552 |
function_name_prefix = "generator_cps_neg_", |
|
553 |
compfuns = Neg_Bounded_CPS_Comp_Funs.compfuns, |
|
554 |
mk_random = (fn _ => error "No enumerators"), |
|
555 |
modify_funT = I, |
|
556 |
additional_arguments = K [], |
|
557 |
wrap_compilation = K (K (K (K (K I)))) |
|
558 |
: (compilation_funs -> string -> typ -> mode -> term list -> term -> term), |
|
559 |
transform_additional_arguments = K I : (indprem -> term list -> term list) |
|
560 |
} |
|
55437 | 561 |
|
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
562 |
fun negative_comp_modifiers_of comp_modifiers = |
55437 | 563 |
(case Comp_Mod.compilation comp_modifiers of |
564 |
Pos_Random_DSeq => neg_random_dseq_comp_modifiers |
|
565 |
| Neg_Random_DSeq => pos_random_dseq_comp_modifiers |
|
566 |
| New_Pos_Random_DSeq => new_neg_random_dseq_comp_modifiers |
|
567 |
| New_Neg_Random_DSeq => new_pos_random_dseq_comp_modifiers |
|
568 |
| Pos_Generator_DSeq => neg_generator_dseq_comp_modifiers |
|
569 |
| Neg_Generator_DSeq => pos_generator_dseq_comp_modifiers |
|
570 |
| Pos_Generator_CPS => neg_generator_cps_comp_modifiers |
|
571 |
| Neg_Generator_CPS => pos_generator_cps_comp_modifiers |
|
572 |
| _ => comp_modifiers) |
|
573 |
||
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
574 |
|
32667 | 575 |
(* term construction *) |
576 |
||
55437 | 577 |
fun mk_v (names, vs) s T = |
578 |
(case AList.lookup (op =) vs s of |
|
579 |
NONE => (Free (s, T), (names, (s, [])::vs)) |
|
580 |
| SOME xs => |
|
581 |
let |
|
582 |
val s' = singleton (Name.variant_list names) s; |
|
583 |
val v = Free (s', T) |
|
584 |
in |
|
585 |
(v, (s'::names, AList.update (op =) (s, v::xs) vs)) |
|
586 |
end); |
|
32667 | 587 |
|
588 |
fun distinct_v (Free (s, T)) nvs = mk_v nvs s T |
|
589 |
| distinct_v (t $ u) nvs = |
|
590 |
let |
|
591 |
val (t', nvs') = distinct_v t nvs; |
|
592 |
val (u', nvs'') = distinct_v u nvs'; |
|
593 |
in (t' $ u', nvs'') end |
|
594 |
| distinct_v x nvs = (x, nvs); |
|
595 |
||
33147
180dc60bd88c
improving the compilation with higher-order arguments in the predicate compiler
bulwahn
parents:
33146
diff
changeset
|
596 |
|
39648
655307cb8489
rewriting function mk_Eval_of in predicate compiler
bulwahn
parents:
39557
diff
changeset
|
597 |
(** specific rpred functions -- move them to the correct place in this file *) |
50056 | 598 |
fun mk_Eval_of (P as (Free _), T) mode = |
44241 | 599 |
let |
600 |
fun mk_bounds (Type (@{type_name Product_Type.prod}, [T1, T2])) i = |
|
601 |
let |
|
55437 | 602 |
val (bs2, i') = mk_bounds T2 i |
44241 | 603 |
val (bs1, i'') = mk_bounds T1 i' |
604 |
in |
|
605 |
(HOLogic.pair_const T1 T2 $ bs1 $ bs2, i'' + 1) |
|
606 |
end |
|
50056 | 607 |
| mk_bounds _ i = (Bound i, i + 1) |
44241 | 608 |
fun mk_prod ((t1, T1), (t2, T2)) = (HOLogic.pair_const T1 T2 $ t1 $ t2, HOLogic.mk_prodT (T1, T2)) |
609 |
fun mk_tuple [] = (HOLogic.unit, HOLogic.unitT) |
|
610 |
| mk_tuple tTs = foldr1 mk_prod tTs |
|
611 |
fun mk_split_abs (T as Type (@{type_name Product_Type.prod}, [T1, T2])) t = |
|
612 |
absdummy T |
|
613 |
(HOLogic.split_const (T1, T2, @{typ bool}) $ (mk_split_abs T1 (mk_split_abs T2 t))) |
|
614 |
| mk_split_abs T t = absdummy T t |
|
615 |
val args = rev (fst (fold_map mk_bounds (rev (binder_types T)) 0)) |
|
616 |
val (inargs, outargs) = split_mode mode args |
|
50056 | 617 |
val (_, outTs) = split_map_modeT (fn _ => fn T => (SOME T, NONE)) mode (binder_types T) |
45450 | 618 |
val inner_term = Predicate_Comp_Funs.mk_Eval (list_comb (P, inargs), fst (mk_tuple (outargs ~~ outTs))) |
44241 | 619 |
in |
620 |
fold_rev mk_split_abs (binder_types T) inner_term |
|
621 |
end |
|
33147
180dc60bd88c
improving the compilation with higher-order arguments in the predicate compiler
bulwahn
parents:
33146
diff
changeset
|
622 |
|
55437 | 623 |
fun compile_arg compilation_modifiers _ _ param_modes arg = |
33147
180dc60bd88c
improving the compilation with higher-order arguments in the predicate compiler
bulwahn
parents:
33146
diff
changeset
|
624 |
let |
180dc60bd88c
improving the compilation with higher-order arguments in the predicate compiler
bulwahn
parents:
33146
diff
changeset
|
625 |
fun map_params (t as Free (f, T)) = |
55437 | 626 |
(case (AList.lookup (op =) param_modes f) of |
627 |
SOME mode => |
|
628 |
let |
|
629 |
val T' = Comp_Mod.funT_of compilation_modifiers mode T |
|
630 |
in |
|
631 |
mk_Eval_of (Free (f, T'), T) mode |
|
632 |
end |
|
633 |
| NONE => t) |
|
33147
180dc60bd88c
improving the compilation with higher-order arguments in the predicate compiler
bulwahn
parents:
33146
diff
changeset
|
634 |
| map_params t = t |
39648
655307cb8489
rewriting function mk_Eval_of in predicate compiler
bulwahn
parents:
39557
diff
changeset
|
635 |
in |
655307cb8489
rewriting function mk_Eval_of in predicate compiler
bulwahn
parents:
39557
diff
changeset
|
636 |
map_aterms map_params arg |
655307cb8489
rewriting function mk_Eval_of in predicate compiler
bulwahn
parents:
39557
diff
changeset
|
637 |
end |
33147
180dc60bd88c
improving the compilation with higher-order arguments in the predicate compiler
bulwahn
parents:
33146
diff
changeset
|
638 |
|
39648
655307cb8489
rewriting function mk_Eval_of in predicate compiler
bulwahn
parents:
39557
diff
changeset
|
639 |
fun compile_match compilation_modifiers additional_arguments ctxt param_modes |
655307cb8489
rewriting function mk_Eval_of in predicate compiler
bulwahn
parents:
39557
diff
changeset
|
640 |
eqs eqs' out_ts success_t = |
32667 | 641 |
let |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
642 |
val compfuns = Comp_Mod.compfuns compilation_modifiers |
32667 | 643 |
val eqs'' = maps mk_eq eqs @ eqs' |
33147
180dc60bd88c
improving the compilation with higher-order arguments in the predicate compiler
bulwahn
parents:
33146
diff
changeset
|
644 |
val eqs'' = |
39648
655307cb8489
rewriting function mk_Eval_of in predicate compiler
bulwahn
parents:
39557
diff
changeset
|
645 |
map (compile_arg compilation_modifiers additional_arguments ctxt param_modes) eqs'' |
32667 | 646 |
val names = fold Term.add_free_names (success_t :: eqs'' @ out_ts) []; |
43324
2b47822868e4
discontinued Name.variant to emphasize that this is old-style / indirect;
wenzelm
parents:
43253
diff
changeset
|
647 |
val name = singleton (Name.variant_list names) "x"; |
2b47822868e4
discontinued Name.variant to emphasize that this is old-style / indirect;
wenzelm
parents:
43253
diff
changeset
|
648 |
val name' = singleton (Name.variant_list (name :: names)) "y"; |
33148
0808f7d0d0d7
removed tuple functions from the predicate compiler
bulwahn
parents:
33147
diff
changeset
|
649 |
val T = HOLogic.mk_tupleT (map fastype_of out_ts); |
32667 | 650 |
val U = fastype_of success_t; |
45461
130c90bb80b4
using more conventional names for monad plus operations
bulwahn
parents:
45452
diff
changeset
|
651 |
val U' = dest_monadT compfuns U; |
32667 | 652 |
val v = Free (name, T); |
653 |
val v' = Free (name', T); |
|
654 |
in |
|
51673
4dfa00e264d8
separate data used for case translation from the datatype package
traytel
parents:
51672
diff
changeset
|
655 |
lambda v (Case_Translation.make_case ctxt Case_Translation.Quiet Name.context v |
33148
0808f7d0d0d7
removed tuple functions from the predicate compiler
bulwahn
parents:
33147
diff
changeset
|
656 |
[(HOLogic.mk_tuple out_ts, |
32667 | 657 |
if null eqs'' then success_t |
658 |
else Const (@{const_name HOL.If}, HOLogic.boolT --> U --> U --> U) $ |
|
659 |
foldr1 HOLogic.mk_conj eqs'' $ success_t $ |
|
45461
130c90bb80b4
using more conventional names for monad plus operations
bulwahn
parents:
45452
diff
changeset
|
660 |
mk_empty compfuns U'), |
130c90bb80b4
using more conventional names for monad plus operations
bulwahn
parents:
45452
diff
changeset
|
661 |
(v', mk_empty compfuns U')]) |
32667 | 662 |
end; |
663 |
||
39648
655307cb8489
rewriting function mk_Eval_of in predicate compiler
bulwahn
parents:
39557
diff
changeset
|
664 |
fun compile_expr compilation_modifiers ctxt (t, deriv) param_modes additional_arguments = |
32667 | 665 |
let |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
666 |
val compfuns = Comp_Mod.compfuns compilation_modifiers |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
667 |
fun expr_of (t, deriv) = |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
668 |
(case (t, deriv) of |
55437 | 669 |
(t, Term Input) => |
670 |
SOME (compile_arg compilation_modifiers additional_arguments ctxt param_modes t) |
|
50056 | 671 |
| (_, Term Output) => NONE |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
672 |
| (Const (name, T), Context mode) => |
61114 | 673 |
(case Core_Data.alternative_compilation_of ctxt name mode of |
55437 | 674 |
SOME alt_comp => SOME (alt_comp compfuns T) |
675 |
| NONE => |
|
61114 | 676 |
SOME (Const (Core_Data.function_name_of (Comp_Mod.compilation compilation_modifiers) |
55437 | 677 |
ctxt name mode, |
678 |
Comp_Mod.funT_of compilation_modifiers mode T))) |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
679 |
| (Free (s, T), Context m) => |
55437 | 680 |
(case (AList.lookup (op =) param_modes s) of |
681 |
SOME _ => SOME (Free (s, Comp_Mod.funT_of compilation_modifiers m T)) |
|
682 |
| NONE => |
|
683 |
let |
|
684 |
val bs = map (pair "x") (binder_types (fastype_of t)) |
|
685 |
val bounds = map Bound (rev (0 upto (length bs) - 1)) |
|
686 |
in SOME (fold_rev Term.abs bs (mk_if compfuns (list_comb (t, bounds)))) end) |
|
50056 | 687 |
| (t, Context _) => |
55437 | 688 |
let |
689 |
val bs = map (pair "x") (binder_types (fastype_of t)) |
|
690 |
val bounds = map Bound (rev (0 upto (length bs) - 1)) |
|
691 |
in SOME (fold_rev Term.abs bs (mk_if compfuns (list_comb (t, bounds)))) end |
|
37391 | 692 |
| (Const (@{const_name Pair}, _) $ t1 $ t2, Mode_Pair (d1, d2)) => |
55437 | 693 |
(case (expr_of (t1, d1), expr_of (t2, d2)) of |
694 |
(NONE, NONE) => NONE |
|
695 |
| (NONE, SOME t) => SOME t |
|
696 |
| (SOME t, NONE) => SOME t |
|
697 |
| (SOME t1, SOME t2) => SOME (HOLogic.mk_prod (t1, t2))) |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
698 |
| (t1 $ t2, Mode_App (deriv1, deriv2)) => |
55437 | 699 |
(case (expr_of (t1, deriv1), expr_of (t2, deriv2)) of |
700 |
(SOME t, NONE) => SOME t |
|
701 |
| (SOME t, SOME u) => SOME (t $ u) |
|
702 |
| _ => error "something went wrong here!")) |
|
32667 | 703 |
in |
35879
99818df5b8f5
reviving the classical depth-limited computation in the predicate compiler
bulwahn
parents:
35845
diff
changeset
|
704 |
list_comb (the (expr_of (t, deriv)), additional_arguments) |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
705 |
end |
33145 | 706 |
|
39648
655307cb8489
rewriting function mk_Eval_of in predicate compiler
bulwahn
parents:
39557
diff
changeset
|
707 |
fun compile_clause compilation_modifiers ctxt all_vs param_modes additional_arguments |
655307cb8489
rewriting function mk_Eval_of in predicate compiler
bulwahn
parents:
39557
diff
changeset
|
708 |
inp (in_ts, out_ts) moded_ps = |
32667 | 709 |
let |
36019
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
710 |
val compfuns = Comp_Mod.compfuns compilation_modifiers |
64bbbd858c39
generalizing the compilation process of the predicate compiler
bulwahn
parents:
36018
diff
changeset
|
711 |
val compile_match = compile_match compilation_modifiers |
39648
655307cb8489
rewriting function mk_Eval_of in predicate compiler
bulwahn
parents:
39557
diff
changeset
|
712 |
additional_arguments ctxt param_modes |
32667 | 713 |
val (in_ts', (all_vs', eqs)) = |
35891
3122bdd95275
contextifying the compilation of the predicate compiler
bulwahn
parents:
35889
diff
changeset
|
714 |
fold_map (collect_non_invertible_subterms ctxt) in_ts (all_vs, []); |
32667 | 715 |
fun compile_prems out_ts' vs names [] = |
716 |
let |
|
717 |
val (out_ts'', (names', eqs')) = |
|
35891
3122bdd95275
contextifying the compilation of the predicate compiler
bulwahn
parents:
35889
diff
changeset
|
718 |
fold_map (collect_non_invertible_subterms ctxt) out_ts' (names, []); |
50056 | 719 |
val (out_ts''', (_, constr_vs)) = fold_map distinct_v |
32667 | 720 |
out_ts'' (names', map (rpair []) vs); |
39762
02fb709ab3cb
handling higher-order relations in output terms; improving proof procedure; added test case
bulwahn
parents:
39761
diff
changeset
|
721 |
val processed_out_ts = map (compile_arg compilation_modifiers additional_arguments |
02fb709ab3cb
handling higher-order relations in output terms; improving proof procedure; added test case
bulwahn
parents:
39761
diff
changeset
|
722 |
ctxt param_modes) out_ts |
32667 | 723 |
in |
33147
180dc60bd88c
improving the compilation with higher-order arguments in the predicate compiler
bulwahn
parents:
33146
diff
changeset
|
724 |
compile_match constr_vs (eqs @ eqs') out_ts''' |
39762
02fb709ab3cb
handling higher-order relations in output terms; improving proof procedure; added test case
bulwahn
parents:
39761
diff
changeset
|
725 |
(mk_single compfuns (HOLogic.mk_tuple processed_out_ts)) |
32667 | 726 |
end |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
727 |
| compile_prems out_ts vs names ((p, deriv) :: ps) = |
32667 | 728 |
let |
729 |
val vs' = distinct (op =) (flat (vs :: map term_vs out_ts)); |
|
730 |
val (out_ts', (names', eqs)) = |
|
35891
3122bdd95275
contextifying the compilation of the predicate compiler
bulwahn
parents:
35889
diff
changeset
|
731 |
fold_map (collect_non_invertible_subterms ctxt) out_ts (names, []) |
32667 | 732 |
val (out_ts'', (names'', constr_vs')) = fold_map distinct_v |
733 |
out_ts' ((names', map (rpair []) vs)) |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
734 |
val mode = head_mode_of deriv |
33143
730a2e8a6ec6
modularized the compilation in the predicate compiler
bulwahn
parents:
33141
diff
changeset
|
735 |
val additional_arguments' = |
33330
d6eb7f19bfc6
encapsulating records with datatype constructors and adding type annotations to make SML/NJ happy
bulwahn
parents:
33328
diff
changeset
|
736 |
Comp_Mod.transform_additional_arguments compilation_modifiers p additional_arguments |
55437 | 737 |
val (compiled_clause, rest) = |
738 |
(case p of |
|
739 |
Prem t => |
|
740 |
let |
|
741 |
val u = |
|
742 |
compile_expr compilation_modifiers ctxt (t, deriv) |
|
743 |
param_modes additional_arguments' |
|
744 |
val (_, out_ts''') = split_mode mode (snd (strip_comb t)) |
|
745 |
val rest = compile_prems out_ts''' vs' names'' ps |
|
746 |
in |
|
747 |
(u, rest) |
|
748 |
end |
|
749 |
| Negprem t => |
|
750 |
let |
|
751 |
val neg_compilation_modifiers = |
|
752 |
negative_comp_modifiers_of compilation_modifiers |
|
753 |
val u = |
|
754 |
mk_not compfuns |
|
755 |
(compile_expr neg_compilation_modifiers ctxt (t, deriv) |
|
756 |
param_modes additional_arguments') |
|
757 |
val (_, out_ts''') = split_mode mode (snd (strip_comb t)) |
|
758 |
val rest = compile_prems out_ts''' vs' names'' ps |
|
759 |
in |
|
760 |
(u, rest) |
|
761 |
end |
|
762 |
| Sidecond t => |
|
763 |
let |
|
764 |
val t = compile_arg compilation_modifiers additional_arguments |
|
765 |
ctxt param_modes t |
|
766 |
val rest = compile_prems [] vs' names'' ps; |
|
767 |
in |
|
768 |
(mk_if compfuns t, rest) |
|
769 |
end |
|
770 |
| Generator (v, T) => |
|
771 |
let |
|
772 |
val u = Comp_Mod.mk_random compilation_modifiers T additional_arguments |
|
773 |
val rest = compile_prems [Free (v, T)] vs' names'' ps; |
|
774 |
in |
|
775 |
(u, rest) |
|
776 |
end) |
|
32667 | 777 |
in |
33147
180dc60bd88c
improving the compilation with higher-order arguments in the predicate compiler
bulwahn
parents:
33146
diff
changeset
|
778 |
compile_match constr_vs' eqs out_ts'' |
32667 | 779 |
(mk_bind compfuns (compiled_clause, rest)) |
780 |
end |
|
55437 | 781 |
val prem_t = compile_prems in_ts' (map fst param_modes) all_vs' moded_ps |
32667 | 782 |
in |
783 |
mk_bind compfuns (mk_single compfuns inp, prem_t) |
|
784 |
end |
|
785 |
||
55437 | 786 |
|
36254 | 787 |
(* switch detection *) |
788 |
||
789 |
(** argument position of an inductive predicates and the executable functions **) |
|
790 |
||
791 |
type position = int * int list |
|
792 |
||
793 |
fun input_positions_pair Input = [[]] |
|
794 |
| input_positions_pair Output = [] |
|
795 |
| input_positions_pair (Fun _) = [] |
|
796 |
| input_positions_pair (Pair (m1, m2)) = |
|
55437 | 797 |
map (cons 1) (input_positions_pair m1) @ map (cons 2) (input_positions_pair m2) |
36254 | 798 |
|
55437 | 799 |
fun input_positions_of_mode mode = |
800 |
flat |
|
801 |
(map_index |
|
802 |
(fn (i, Input) => [(i, [])] |
|
803 |
| (_, Output) => [] |
|
804 |
| (_, Fun _) => [] |
|
805 |
| (i, m as Pair _) => map (pair i) (input_positions_pair m)) |
|
806 |
(Predicate_Compile_Aux.strip_fun_mode mode)) |
|
36254 | 807 |
|
50056 | 808 |
fun argument_position_pair _ [] = [] |
36254 | 809 |
| argument_position_pair (Pair (Fun _, m2)) (2 :: is) = argument_position_pair m2 is |
810 |
| argument_position_pair (Pair (m1, m2)) (i :: is) = |
|
55437 | 811 |
(if eq_mode (m1, Output) andalso i = 2 then |
812 |
argument_position_pair m2 is |
|
813 |
else if eq_mode (m2, Output) andalso i = 1 then |
|
814 |
argument_position_pair m1 is |
|
815 |
else (i :: argument_position_pair (if i = 1 then m1 else m2) is)) |
|
36254 | 816 |
|
817 |
fun argument_position_of mode (i, is) = |
|
818 |
(i - (length (filter (fn Output => true | Fun _ => true | _ => false) |
|
819 |
(List.take (strip_fun_mode mode, i)))), |
|
820 |
argument_position_pair (nth (strip_fun_mode mode) i) is) |
|
821 |
||
822 |
fun nth_pair [] t = t |
|
823 |
| nth_pair (1 :: is) (Const (@{const_name Pair}, _) $ t1 $ _) = nth_pair is t1 |
|
824 |
| nth_pair (2 :: is) (Const (@{const_name Pair}, _) $ _ $ t2) = nth_pair is t2 |
|
825 |
| nth_pair _ _ = raise Fail "unexpected input for nth_tuple" |
|
826 |
||
55437 | 827 |
|
36254 | 828 |
(** switch detection analysis **) |
829 |
||
50056 | 830 |
fun find_switch_test ctxt (i, is) (ts, _) = |
36254 | 831 |
let |
832 |
val t = nth_pair is (nth ts i) |
|
833 |
val T = fastype_of t |
|
834 |
in |
|
55437 | 835 |
(case T of |
36254 | 836 |
TFree _ => NONE |
837 |
| Type (Tcon, _) => |
|
55440 | 838 |
(case Ctr_Sugar.ctr_sugar_of ctxt Tcon of |
55437 | 839 |
NONE => NONE |
55440 | 840 |
| SOME {ctrs, ...} => |
55437 | 841 |
(case strip_comb t of |
842 |
(Var _, []) => NONE |
|
843 |
| (Free _, []) => NONE |
|
55440 | 844 |
| (Const (c, T), _) => |
845 |
if AList.defined (op =) (map_filter (try dest_Const) ctrs) c |
|
846 |
then SOME (c, T) else NONE))) |
|
36254 | 847 |
end |
848 |
||
37005
842a73dc6d0e
changing compilation to work only with contexts; adapting quickcheck
bulwahn
parents:
37004
diff
changeset
|
849 |
fun partition_clause ctxt pos moded_clauses = |
36254 | 850 |
let |
851 |
fun insert_list eq (key, value) = AList.map_default eq (key, []) (cons value) |
|
852 |
fun find_switch_test' moded_clause (cases, left) = |
|
55437 | 853 |
(case find_switch_test ctxt pos moded_clause of |
36254 | 854 |
SOME (c, T) => (insert_list (op =) ((c, T), moded_clause) cases, left) |
55437 | 855 |
| NONE => (cases, moded_clause :: left)) |
36254 | 856 |
in |
857 |
fold find_switch_test' moded_clauses ([], []) |
|
858 |
end |
|
859 |
||
860 |
datatype switch_tree = |
|
861 |
Atom of moded_clause list | Node of (position * ((string * typ) * switch_tree) list) * switch_tree |
|
862 |
||
37005
842a73dc6d0e
changing compilation to work only with contexts; adapting quickcheck
bulwahn
parents:
37004
diff
changeset
|
863 |
fun mk_switch_tree ctxt mode moded_clauses = |
36254 | 864 |
let |
865 |
fun select_best_switch moded_clauses input_position best_switch = |
|
866 |
let |
|
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58823
diff
changeset
|
867 |
val ord = option_ord (rev_order o int_ord o (apply2 (length o snd o snd))) |
37005
842a73dc6d0e
changing compilation to work only with contexts; adapting quickcheck
bulwahn
parents:
37004
diff
changeset
|
868 |
val partition = partition_clause ctxt input_position moded_clauses |
36254 | 869 |
val switch = if (length (fst partition) > 1) then SOME (input_position, partition) else NONE |
870 |
in |
|
55437 | 871 |
(case ord (switch, best_switch) of |
872 |
LESS => best_switch |
|
873 |
| EQUAL => best_switch |
|
874 |
| GREATER => switch) |
|
36254 | 875 |
end |
876 |
fun detect_switches moded_clauses = |
|
55437 | 877 |
(case fold (select_best_switch moded_clauses) (input_positions_of_mode mode) NONE of |
36254 | 878 |
SOME (best_pos, (switched_on, left_clauses)) => |
879 |
Node ((best_pos, map (apsnd detect_switches) switched_on), |
|
880 |
detect_switches left_clauses) |
|
55437 | 881 |
| NONE => Atom moded_clauses) |
36254 | 882 |
in |
883 |
detect_switches moded_clauses |
|
884 |
end |
|
885 |
||
55437 | 886 |
|
36254 | 887 |
(** compilation of detected switches **) |
888 |
||
889 |
fun destruct_constructor_pattern (pat, obj) = |
|
890 |
(case strip_comb pat of |
|
55437 | 891 |
(Free _, []) => cons (pat, obj) |
36254 | 892 |
| (Const (c, T), pat_args) => |
55437 | 893 |
(case strip_comb obj of |
894 |
(Const (c', T'), obj_args) => |
|
895 |
(if c = c' andalso T = T' then |
|
896 |
fold destruct_constructor_pattern (pat_args ~~ obj_args) |
|
897 |
else raise Fail "pattern and object mismatch") |
|
898 |
| _ => raise Fail "unexpected object") |
|
36254 | 899 |
| _ => raise Fail "unexpected pattern") |
900 |
||
39648
655307cb8489
rewriting function mk_Eval_of in predicate compiler
bulwahn
parents:
39557
diff
changeset
|
901 |
fun compile_switch compilation_modifiers ctxt all_vs param_modes additional_arguments mode |
36254 | 902 |
in_ts' outTs switch_tree = |
903 |
let |
|
904 |
val compfuns = Comp_Mod.compfuns compilation_modifiers |
|
42361 | 905 |
val thy = Proof_Context.theory_of ctxt |
36254 | 906 |
fun compile_switch_tree _ _ (Atom []) = NONE |
907 |
| compile_switch_tree all_vs ctxt_eqs (Atom moded_clauses) = |
|
908 |
let |
|
909 |
val in_ts' = map (Pattern.rewrite_term thy ctxt_eqs []) in_ts' |
|
910 |
fun compile_clause' (ts, moded_ps) = |
|
911 |
let |
|
912 |
val (ts, out_ts) = split_mode mode ts |
|
913 |
val subst = fold destruct_constructor_pattern (in_ts' ~~ ts) [] |
|
914 |
val (fsubst, pat') = List.partition (fn (_, Free _) => true | _ => false) subst |
|
915 |
val moded_ps' = (map o apfst o map_indprem) |
|
916 |
(Pattern.rewrite_term thy (map swap fsubst) []) moded_ps |
|
917 |
val inp = HOLogic.mk_tuple (map fst pat') |
|
918 |
val in_ts' = map (Pattern.rewrite_term thy (map swap fsubst) []) (map snd pat') |
|
919 |
val out_ts' = map (Pattern.rewrite_term thy (map swap fsubst) []) out_ts |
|
920 |
in |
|
39648
655307cb8489
rewriting function mk_Eval_of in predicate compiler
bulwahn
parents:
39557
diff
changeset
|
921 |
compile_clause compilation_modifiers ctxt all_vs param_modes additional_arguments |
655307cb8489
rewriting function mk_Eval_of in predicate compiler
bulwahn
parents:
39557
diff
changeset
|
922 |
inp (in_ts', out_ts') moded_ps' |
36254 | 923 |
end |
45461
130c90bb80b4
using more conventional names for monad plus operations
bulwahn
parents:
45452
diff
changeset
|
924 |
in SOME (foldr1 (mk_plus compfuns) (map compile_clause' moded_clauses)) end |
36254 | 925 |
| compile_switch_tree all_vs ctxt_eqs (Node ((position, switched_clauses), left_clauses)) = |
926 |
let |
|
927 |
val (i, is) = argument_position_of mode position |
|
928 |
val inp_var = nth_pair is (nth in_ts' i) |
|
43324
2b47822868e4
discontinued Name.variant to emphasize that this is old-style / indirect;
wenzelm
parents:
43253
diff
changeset
|
929 |
val x = singleton (Name.variant_list all_vs) "x" |
36254 | 930 |
val xt = Free (x, fastype_of inp_var) |
931 |
fun compile_single_case ((c, T), switched) = |
|
932 |
let |
|
933 |
val Ts = binder_types T |
|
934 |
val argnames = Name.variant_list (x :: all_vs) |
|
935 |
(map (fn i => "c" ^ string_of_int i) (1 upto length Ts)) |
|
936 |
val args = map2 (curry Free) argnames Ts |
|
937 |
val pattern = list_comb (Const (c, T), args) |
|
938 |
val ctxt_eqs' = (inp_var, pattern) :: ctxt_eqs |
|
45461
130c90bb80b4
using more conventional names for monad plus operations
bulwahn
parents:
45452
diff
changeset
|
939 |
val compilation = the_default (mk_empty compfuns (HOLogic.mk_tupleT outTs)) |
36254 | 940 |
(compile_switch_tree (argnames @ x :: all_vs) ctxt_eqs' switched) |
941 |
in |
|
942 |
(pattern, compilation) |
|
943 |
end |
|
51673
4dfa00e264d8
separate data used for case translation from the datatype package
traytel
parents:
51672
diff
changeset
|
944 |
val switch = Case_Translation.make_case ctxt Case_Translation.Quiet Name.context inp_var |
36254 | 945 |
((map compile_single_case switched_clauses) @ |
45461
130c90bb80b4
using more conventional names for monad plus operations
bulwahn
parents:
45452
diff
changeset
|
946 |
[(xt, mk_empty compfuns (HOLogic.mk_tupleT outTs))]) |
36254 | 947 |
in |
55437 | 948 |
(case compile_switch_tree all_vs ctxt_eqs left_clauses of |
36254 | 949 |
NONE => SOME switch |
55437 | 950 |
| SOME left_comp => SOME (mk_plus compfuns (switch, left_comp))) |
36254 | 951 |
end |
952 |
in |
|
953 |
compile_switch_tree all_vs [] switch_tree |
|
954 |
end |
|
955 |
||
55437 | 956 |
|
36254 | 957 |
(* compilation of predicates *) |
958 |
||
37005
842a73dc6d0e
changing compilation to work only with contexts; adapting quickcheck
bulwahn
parents:
37004
diff
changeset
|
959 |
fun compile_pred options compilation_modifiers ctxt all_vs param_vs s T (pol, mode) moded_cls = |
32667 | 960 |
let |
55437 | 961 |
val is_terminating = false (* FIXME: requires an termination analysis *) |
40049
75d9f57123d6
adding decreasing bind and non-decreasing bind; depth-limited and depth-unlimited compilation possible
bulwahn
parents:
39785
diff
changeset
|
962 |
val compilation_modifiers = |
75d9f57123d6
adding decreasing bind and non-decreasing bind; depth-limited and depth-unlimited compilation possible
bulwahn
parents:
39785
diff
changeset
|
963 |
(if pol then compilation_modifiers else |
75d9f57123d6
adding decreasing bind and non-decreasing bind; depth-limited and depth-unlimited compilation possible
bulwahn
parents:
39785
diff
changeset
|
964 |
negative_comp_modifiers_of compilation_modifiers) |
75d9f57123d6
adding decreasing bind and non-decreasing bind; depth-limited and depth-unlimited compilation possible
bulwahn
parents:
39785
diff
changeset
|
965 |
|> (if is_depth_limited_compilation (Comp_Mod.compilation compilation_modifiers) then |
75d9f57123d6
adding decreasing bind and non-decreasing bind; depth-limited and depth-unlimited compilation possible
bulwahn
parents:
39785
diff
changeset
|
966 |
(if is_terminating then |
55437 | 967 |
(Comp_Mod.set_compfuns |
968 |
(unlimited_compfuns_of pol (Comp_Mod.compilation compilation_modifiers))) |
|
969 |
else |
|
970 |
(Comp_Mod.set_compfuns |
|
971 |
(limited_compfuns_of pol (Comp_Mod.compilation compilation_modifiers)))) |
|
972 |
else I) |
|
973 |
val additional_arguments = |
|
974 |
Comp_Mod.additional_arguments compilation_modifiers (all_vs @ param_vs) |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
975 |
val compfuns = Comp_Mod.compfuns compilation_modifiers |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
976 |
fun is_param_type (T as Type ("fun",[_ , T'])) = |
55437 | 977 |
is_some (try (dest_monadT compfuns) T) orelse is_param_type T' |
45461
130c90bb80b4
using more conventional names for monad plus operations
bulwahn
parents:
45452
diff
changeset
|
978 |
| is_param_type T = is_some (try (dest_monadT compfuns) T) |
55437 | 979 |
val (inpTs, outTs) = |
980 |
split_map_modeT (fn m => fn T => (SOME (funT_of compfuns m T), NONE)) mode |
|
981 |
(binder_types T) |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
982 |
val funT = Comp_Mod.funT_of compilation_modifiers mode T |
55437 | 983 |
val (in_ts, _) = |
984 |
fold_map (fold_map_aterms_prodT (curry HOLogic.mk_prod) |
|
985 |
(fn T => fn (param_vs, names) => |
|
986 |
if is_param_type T then |
|
987 |
(Free (hd param_vs, T), (tl param_vs, names)) |
|
988 |
else |
|
989 |
let |
|
990 |
val new = singleton (Name.variant_list names) "x" |
|
991 |
in (Free (new, T), (param_vs, new :: names)) end)) inpTs |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
992 |
(param_vs, (all_vs @ param_vs)) |
55437 | 993 |
val in_ts' = |
994 |
map_filter (map_filter_prod |
|
995 |
(fn t as Free (x, _) => |
|
996 |
if member (op =) param_vs x then NONE else SOME t | t => SOME t)) in_ts |
|
39648
655307cb8489
rewriting function mk_Eval_of in predicate compiler
bulwahn
parents:
39557
diff
changeset
|
997 |
val param_modes = param_vs ~~ ho_arg_modes_of mode |
36254 | 998 |
val compilation = |
999 |
if detect_switches options then |
|
45461
130c90bb80b4
using more conventional names for monad plus operations
bulwahn
parents:
45452
diff
changeset
|
1000 |
the_default (mk_empty compfuns (HOLogic.mk_tupleT outTs)) |
39648
655307cb8489
rewriting function mk_Eval_of in predicate compiler
bulwahn
parents:
39557
diff
changeset
|
1001 |
(compile_switch compilation_modifiers ctxt all_vs param_modes additional_arguments mode |
655307cb8489
rewriting function mk_Eval_of in predicate compiler
bulwahn
parents:
39557
diff
changeset
|
1002 |
in_ts' outTs (mk_switch_tree ctxt mode moded_cls)) |
36254 | 1003 |
else |
1004 |
let |
|
1005 |
val cl_ts = |
|
55437 | 1006 |
map (fn (ts, moded_prems) => |
39648
655307cb8489
rewriting function mk_Eval_of in predicate compiler
bulwahn
parents:
39557
diff
changeset
|
1007 |
compile_clause compilation_modifiers ctxt all_vs param_modes additional_arguments |
55437 | 1008 |
(HOLogic.mk_tuple in_ts') (split_mode mode ts) moded_prems) moded_cls |
36254 | 1009 |
in |
1010 |
Comp_Mod.wrap_compilation compilation_modifiers compfuns s T mode additional_arguments |
|
1011 |
(if null cl_ts then |
|
45461
130c90bb80b4
using more conventional names for monad plus operations
bulwahn
parents:
45452
diff
changeset
|
1012 |
mk_empty compfuns (HOLogic.mk_tupleT outTs) |
36254 | 1013 |
else |
45461
130c90bb80b4
using more conventional names for monad plus operations
bulwahn
parents:
45452
diff
changeset
|
1014 |
foldr1 (mk_plus compfuns) cl_ts) |
36254 | 1015 |
end |
33143
730a2e8a6ec6
modularized the compilation in the predicate compiler
bulwahn
parents:
33141
diff
changeset
|
1016 |
val fun_const = |
61114 | 1017 |
Const (Core_Data.function_name_of (Comp_Mod.compilation compilation_modifiers) ctxt s mode, funT) |
32667 | 1018 |
in |
33143
730a2e8a6ec6
modularized the compilation in the predicate compiler
bulwahn
parents:
33141
diff
changeset
|
1019 |
HOLogic.mk_Trueprop |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1020 |
(HOLogic.mk_eq (list_comb (fun_const, in_ts @ additional_arguments), compilation)) |
55437 | 1021 |
end |
1022 |
||
33143
730a2e8a6ec6
modularized the compilation in the predicate compiler
bulwahn
parents:
33141
diff
changeset
|
1023 |
|
32667 | 1024 |
(* Definition of executable functions and their intro and elim rules *) |
1025 |
||
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61114
diff
changeset
|
1026 |
fun strip_split_abs (Const (@{const_name uncurry}, _) $ t) = strip_split_abs t |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1027 |
| strip_split_abs (Abs (_, _, t)) = strip_split_abs t |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1028 |
| strip_split_abs t = t |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1029 |
|
37678
0040bafffdef
"prod" and "sum" replace "*" and "+" respectively
haftmann
parents:
37591
diff
changeset
|
1030 |
fun mk_args is_eval (m as Pair (m1, m2), T as Type (@{type_name Product_Type.prod}, [T1, T2])) names = |
55437 | 1031 |
if eq_mode (m, Input) orelse eq_mode (m, Output) then |
1032 |
let |
|
1033 |
val x = singleton (Name.variant_list names) "x" |
|
1034 |
in |
|
1035 |
(Free (x, T), x :: names) |
|
1036 |
end |
|
1037 |
else |
|
1038 |
let |
|
1039 |
val (t1, names') = mk_args is_eval (m1, T1) names |
|
1040 |
val (t2, names'') = mk_args is_eval (m2, T2) names' |
|
1041 |
in |
|
1042 |
(HOLogic.mk_prod (t1, t2), names'') |
|
1043 |
end |
|
1044 |
| mk_args is_eval ((m as Fun _), T) names = |
|
1045 |
let |
|
1046 |
val funT = funT_of Predicate_Comp_Funs.compfuns m T |
|
1047 |
val x = singleton (Name.variant_list names) "x" |
|
1048 |
val (args, _) = fold_map (mk_args is_eval) (strip_fun_mode m ~~ binder_types T) (x :: names) |
|
1049 |
val (inargs, outargs) = split_map_mode (fn _ => fn t => (SOME t, NONE)) m args |
|
1050 |
val t = fold_rev HOLogic.tupled_lambda args (Predicate_Comp_Funs.mk_Eval |
|
1051 |
(list_comb (Free (x, funT), inargs), HOLogic.mk_tuple outargs)) |
|
1052 |
in |
|
1053 |
(if is_eval then t else Free (x, funT), x :: names) |
|
1054 |
end |
|
1055 |
| mk_args _ (_, T) names = |
|
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:
35267
diff
changeset
|
1056 |
let |
43324
2b47822868e4
discontinued Name.variant to emphasize that this is old-style / indirect;
wenzelm
parents:
43253
diff
changeset
|
1057 |
val x = singleton (Name.variant_list names) "x" |
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:
35267
diff
changeset
|
1058 |
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:
35267
diff
changeset
|
1059 |
(Free (x, T), x :: names) |
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:
35267
diff
changeset
|
1060 |
end |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1061 |
|
37003
a393a588b82e
moving towards working with proof contexts in the predicate compiler
bulwahn
parents:
37002
diff
changeset
|
1062 |
fun create_intro_elim_rule ctxt mode defthm mode_id funT pred = |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1063 |
let |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1064 |
val funtrm = Const (mode_id, funT) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1065 |
val Ts = binder_types (fastype_of pred) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1066 |
val (args, argnames) = fold_map (mk_args true) (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:
34028
diff
changeset
|
1067 |
fun strip_eval _ t = |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1068 |
let |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1069 |
val t' = strip_split_abs t |
45450 | 1070 |
val (r, _) = Predicate_Comp_Funs.dest_Eval t' |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1071 |
in (SOME (fst (strip_comb r)), NONE) end |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1072 |
val (inargs, outargs) = split_map_mode strip_eval mode args |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1073 |
val eval_hoargs = ho_args_of mode args |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1074 |
val hoargTs = 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:
34028
diff
changeset
|
1075 |
val hoarg_names' = |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1076 |
Name.variant_list argnames ((map (fn i => "x" ^ string_of_int i)) (1 upto (length hoargTs))) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1077 |
val hoargs' = map2 (curry Free) hoarg_names' hoargTs |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1078 |
val args' = replace_ho_args mode hoargs' args |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1079 |
val predpropI = HOLogic.mk_Trueprop (list_comb (pred, args')) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1080 |
val predpropE = HOLogic.mk_Trueprop (list_comb (pred, args)) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1081 |
val param_eqs = map2 (HOLogic.mk_Trueprop oo (curry HOLogic.mk_eq)) eval_hoargs hoargs' |
45450 | 1082 |
val funpropE = HOLogic.mk_Trueprop (Predicate_Comp_Funs.mk_Eval (list_comb (funtrm, inargs), |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1083 |
if null outargs then Free("y", HOLogic.unitT) else HOLogic.mk_tuple outargs)) |
45450 | 1084 |
val funpropI = HOLogic.mk_Trueprop (Predicate_Comp_Funs.mk_Eval (list_comb (funtrm, inargs), |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1085 |
HOLogic.mk_tuple outargs)) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1086 |
val introtrm = Logic.list_implies (predpropI :: param_eqs, funpropI) |
55437 | 1087 |
val simprules = |
1088 |
[defthm, @{thm eval_pred}, |
|
1089 |
@{thm "split_beta"}, @{thm "fst_conv"}, @{thm "snd_conv"}, @{thm pair_collapse}] |
|
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51673
diff
changeset
|
1090 |
val unfolddef_tac = |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51673
diff
changeset
|
1091 |
Simplifier.asm_full_simp_tac (put_simpset HOL_basic_ss ctxt addsimps simprules) 1 |
37003
a393a588b82e
moving towards working with proof contexts in the predicate compiler
bulwahn
parents:
37002
diff
changeset
|
1092 |
val introthm = Goal.prove ctxt |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1093 |
(argnames @ hoarg_names' @ ["y"]) [] introtrm (fn _ => unfolddef_tac) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1094 |
val P = HOLogic.mk_Trueprop (Free ("P", HOLogic.boolT)); |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1095 |
val elimtrm = Logic.list_implies ([funpropE, Logic.mk_implies (predpropE, P)], P) |
37003
a393a588b82e
moving towards working with proof contexts in the predicate compiler
bulwahn
parents:
37002
diff
changeset
|
1096 |
val elimthm = Goal.prove ctxt |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1097 |
(argnames @ ["y", "P"]) [] elimtrm (fn _ => unfolddef_tac) |
35884
362bfc2ca0ee
adding proof procedure for cases rule with tuples; adding introduction rule for negated premises; improving proof procedure with negated premises
bulwahn
parents:
35881
diff
changeset
|
1098 |
val opt_neg_introthm = |
362bfc2ca0ee
adding proof procedure for cases rule with tuples; adding introduction rule for negated premises; improving proof procedure with negated premises
bulwahn
parents:
35881
diff
changeset
|
1099 |
if is_all_input mode then |
362bfc2ca0ee
adding proof procedure for cases rule with tuples; adding introduction rule for negated premises; improving proof procedure with negated premises
bulwahn
parents:
35881
diff
changeset
|
1100 |
let |
362bfc2ca0ee
adding proof procedure for cases rule with tuples; adding introduction rule for negated premises; improving proof procedure with negated premises
bulwahn
parents:
35881
diff
changeset
|
1101 |
val neg_predpropI = HOLogic.mk_Trueprop (HOLogic.mk_not (list_comb (pred, args'))) |
362bfc2ca0ee
adding proof procedure for cases rule with tuples; adding introduction rule for negated premises; improving proof procedure with negated premises
bulwahn
parents:
35881
diff
changeset
|
1102 |
val neg_funpropI = |
45450 | 1103 |
HOLogic.mk_Trueprop (Predicate_Comp_Funs.mk_Eval |
1104 |
(Predicate_Comp_Funs.mk_not (list_comb (funtrm, inargs)), HOLogic.unit)) |
|
35884
362bfc2ca0ee
adding proof procedure for cases rule with tuples; adding introduction rule for negated premises; improving proof procedure with negated premises
bulwahn
parents:
35881
diff
changeset
|
1105 |
val neg_introtrm = Logic.list_implies (neg_predpropI :: param_eqs, neg_funpropI) |
362bfc2ca0ee
adding proof procedure for cases rule with tuples; adding introduction rule for negated premises; improving proof procedure with negated premises
bulwahn
parents:
35881
diff
changeset
|
1106 |
val tac = |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51673
diff
changeset
|
1107 |
Simplifier.asm_full_simp_tac (put_simpset HOL_basic_ss ctxt addsimps |
35884
362bfc2ca0ee
adding proof procedure for cases rule with tuples; adding introduction rule for negated premises; improving proof procedure with negated premises
bulwahn
parents:
35881
diff
changeset
|
1108 |
(@{thm if_False} :: @{thm Predicate.not_pred_eq} :: simprules)) 1 |
60752 | 1109 |
THEN resolve_tac ctxt @{thms Predicate.singleI} 1 |
37003
a393a588b82e
moving towards working with proof contexts in the predicate compiler
bulwahn
parents:
37002
diff
changeset
|
1110 |
in SOME (Goal.prove ctxt (argnames @ hoarg_names') [] |
35884
362bfc2ca0ee
adding proof procedure for cases rule with tuples; adding introduction rule for negated premises; improving proof procedure with negated premises
bulwahn
parents:
35881
diff
changeset
|
1111 |
neg_introtrm (fn _ => tac)) |
362bfc2ca0ee
adding proof procedure for cases rule with tuples; adding introduction rule for negated premises; improving proof procedure with negated premises
bulwahn
parents:
35881
diff
changeset
|
1112 |
end |
362bfc2ca0ee
adding proof procedure for cases rule with tuples; adding introduction rule for negated premises; improving proof procedure with negated premises
bulwahn
parents:
35881
diff
changeset
|
1113 |
else NONE |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1114 |
in |
35884
362bfc2ca0ee
adding proof procedure for cases rule with tuples; adding introduction rule for negated premises; improving proof procedure with negated premises
bulwahn
parents:
35881
diff
changeset
|
1115 |
((introthm, elimthm), opt_neg_introthm) |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1116 |
end |
32667 | 1117 |
|
55437 | 1118 |
fun create_constname_of_mode options thy prefix name _ mode = |
32667 | 1119 |
let |
55437 | 1120 |
val system_proposal = prefix ^ (Long_Name.base_name name) ^ "_" ^ ascii_string_of_mode mode |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1121 |
val name = the_default system_proposal (proposed_names options name mode) |
32667 | 1122 |
in |
33620
b6bf2dc5aed7
added interface of user proposals for names of generated constants
bulwahn
parents:
33619
diff
changeset
|
1123 |
Sign.full_bname thy name |
55437 | 1124 |
end |
32667 | 1125 |
|
33620
b6bf2dc5aed7
added interface of user proposals for names of generated constants
bulwahn
parents:
33619
diff
changeset
|
1126 |
fun create_definitions options preds (name, modes) thy = |
32667 | 1127 |
let |
45450 | 1128 |
val compfuns = Predicate_Comp_Funs.compfuns |
32667 | 1129 |
val T = AList.lookup (op =) preds name |> the |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1130 |
fun create_definition mode thy = |
33752
9aa8e961f850
adopting proposed_modes; adding a new dimension of complexity for nicer error messages; tuned
bulwahn
parents:
33671
diff
changeset
|
1131 |
let |
9aa8e961f850
adopting proposed_modes; adding a new dimension of complexity for nicer error messages; tuned
bulwahn
parents:
33671
diff
changeset
|
1132 |
val mode_cname = create_constname_of_mode options thy "" name T mode |
9aa8e961f850
adopting proposed_modes; adding a new dimension of complexity for nicer error messages; tuned
bulwahn
parents:
33671
diff
changeset
|
1133 |
val mode_cbasename = Long_Name.base_name mode_cname |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1134 |
val funT = funT_of compfuns mode T |
61114 | 1135 |
val (args, _) = fold_map (mk_args true) (strip_fun_mode mode ~~ binder_types T) [] |
50056 | 1136 |
fun strip_eval _ t = |
33752
9aa8e961f850
adopting proposed_modes; adding a new dimension of complexity for nicer error messages; tuned
bulwahn
parents:
33671
diff
changeset
|
1137 |
let |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1138 |
val t' = strip_split_abs t |
45450 | 1139 |
val (r, _) = Predicate_Comp_Funs.dest_Eval t' |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1140 |
in (SOME (fst (strip_comb r)), NONE) end |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1141 |
val (inargs, outargs) = split_map_mode strip_eval mode args |
39756
6c8e83d94536
consolidated tupled_lambda; moved to structure HOLogic
krauss
parents:
39685
diff
changeset
|
1142 |
val predterm = fold_rev HOLogic.tupled_lambda inargs |
45450 | 1143 |
(Predicate_Comp_Funs.mk_Enum (HOLogic.tupled_lambda (HOLogic.mk_tuple outargs) |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1144 |
(list_comb (Const (name, T), args)))) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1145 |
val lhs = Const (mode_cname, funT) |
33752
9aa8e961f850
adopting proposed_modes; adding a new dimension of complexity for nicer error messages; tuned
bulwahn
parents:
33671
diff
changeset
|
1146 |
val def = Logic.mk_equals (lhs, predterm) |
9aa8e961f850
adopting proposed_modes; adding a new dimension of complexity for nicer error messages; tuned
bulwahn
parents:
33671
diff
changeset
|
1147 |
val ([definition], thy') = thy |> |
56239 | 1148 |
Sign.add_consts [(Binding.name mode_cbasename, funT, NoSyn)] |> |
46909 | 1149 |
Global_Theory.add_defs false [((Binding.name (Thm.def_name mode_cbasename), def), [])] |
42361 | 1150 |
val ctxt' = Proof_Context.init_global thy' |
35884
362bfc2ca0ee
adding proof procedure for cases rule with tuples; adding introduction rule for negated premises; improving proof procedure with negated premises
bulwahn
parents:
35881
diff
changeset
|
1151 |
val rules as ((intro, elim), _) = |
37003
a393a588b82e
moving towards working with proof contexts in the predicate compiler
bulwahn
parents:
37002
diff
changeset
|
1152 |
create_intro_elim_rule ctxt' mode definition mode_cname funT (Const (name, T)) |
52788 | 1153 |
in |
1154 |
thy' |
|
61114 | 1155 |
|> Core_Data.set_function_name Pred name mode mode_cname |
1156 |
|> Core_Data.add_predfun_data name mode (definition, rules) |
|
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39545
diff
changeset
|
1157 |
|> Global_Theory.store_thm (Binding.name (mode_cbasename ^ "I"), intro) |> snd |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39545
diff
changeset
|
1158 |
|> Global_Theory.store_thm (Binding.name (mode_cbasename ^ "E"), elim) |> snd |
32667 | 1159 |
end; |
1160 |
in |
|
61114 | 1161 |
thy |> Core_Data.defined_function_of Pred name |> fold create_definition modes |
32667 | 1162 |
end; |
1163 |
||
50056 | 1164 |
fun define_functions comp_modifiers _ options preds (name, modes) thy = |
32667 | 1165 |
let |
1166 |
val T = AList.lookup (op =) preds name |> the |
|
1167 |
fun create_definition mode thy = |
|
1168 |
let |
|
33485
0df4f6e46e5e
made definition of functions generically for the different instances
bulwahn
parents:
33484
diff
changeset
|
1169 |
val function_name_prefix = Comp_Mod.function_name_prefix comp_modifiers |
33620
b6bf2dc5aed7
added interface of user proposals for names of generated constants
bulwahn
parents:
33619
diff
changeset
|
1170 |
val mode_cname = create_constname_of_mode options thy function_name_prefix name T mode |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1171 |
val funT = Comp_Mod.funT_of comp_modifiers mode T |
32667 | 1172 |
in |
56239 | 1173 |
thy |> Sign.add_consts [(Binding.name (Long_Name.base_name mode_cname), funT, NoSyn)] |
61114 | 1174 |
|> Core_Data.set_function_name (Comp_Mod.compilation comp_modifiers) name mode mode_cname |
32667 | 1175 |
end; |
1176 |
in |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1177 |
thy |
61114 | 1178 |
|> Core_Data.defined_function_of (Comp_Mod.compilation comp_modifiers) name |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1179 |
|> fold create_definition modes |
32667 | 1180 |
end; |
32672
90f3ce5d27ae
added first version of quickcheck based on the predicate compiler; added a few quickcheck examples
bulwahn
parents:
32671
diff
changeset
|
1181 |
|
32667 | 1182 |
|
1183 |
(* composition of mode inference, definition, compilation and proof *) |
|
1184 |
||
1185 |
(** auxillary combinators for table of preds and modes **) |
|
1186 |
||
1187 |
fun map_preds_modes f preds_modes_table = |
|
1188 |
map (fn (pred, modes) => |
|
1189 |
(pred, map (fn (mode, value) => (mode, f pred mode value)) modes)) preds_modes_table |
|
1190 |
||
1191 |
fun join_preds_modes table1 table2 = |
|
1192 |
map_preds_modes (fn pred => fn mode => fn value => |
|
1193 |
(value, the (AList.lookup (op =) (the (AList.lookup (op =) table2 pred)) mode))) table1 |
|
36254 | 1194 |
|
32667 | 1195 |
fun maps_modes preds_modes_table = |
1196 |
map (fn (pred, modes) => |
|
50056 | 1197 |
(pred, map (fn (_, value) => value) modes)) preds_modes_table |
36254 | 1198 |
|
37005
842a73dc6d0e
changing compilation to work only with contexts; adapting quickcheck
bulwahn
parents:
37004
diff
changeset
|
1199 |
fun compile_preds options comp_modifiers ctxt all_vs param_vs preds moded_clauses = |
842a73dc6d0e
changing compilation to work only with contexts; adapting quickcheck
bulwahn
parents:
37004
diff
changeset
|
1200 |
map_preds_modes (fn pred => compile_pred options comp_modifiers ctxt all_vs param_vs pred |
33143
730a2e8a6ec6
modularized the compilation in the predicate compiler
bulwahn
parents:
33141
diff
changeset
|
1201 |
(the (AList.lookup (op =) preds pred))) moded_clauses |
730a2e8a6ec6
modularized the compilation in the predicate compiler
bulwahn
parents:
33141
diff
changeset
|
1202 |
|
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:
35267
diff
changeset
|
1203 |
fun prove options thy clauses preds moded_clauses compiled_terms = |
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:
35267
diff
changeset
|
1204 |
map_preds_modes (prove_pred options thy clauses preds) |
32667 | 1205 |
(join_preds_modes moded_clauses compiled_terms) |
1206 |
||
50056 | 1207 |
fun prove_by_skip _ thy _ _ _ compiled_terms = |
35021
c839a4c670c6
renamed old-style Drule.standard to Drule.export_without_context, to emphasize that this is in no way a standard operation;
wenzelm
parents:
34974
diff
changeset
|
1208 |
map_preds_modes |
50056 | 1209 |
(fn _ => fn _ => fn t => Drule.export_without_context (Skip_Proof.make_thm thy t)) |
32667 | 1210 |
compiled_terms |
33106
7a1636c3ffc9
extended core of predicate compiler to expand tuples in introduction rules
bulwahn
parents:
32740
diff
changeset
|
1211 |
|
33376
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1212 |
(* preparation of introduction rules into special datastructures *) |
37003
a393a588b82e
moving towards working with proof contexts in the predicate compiler
bulwahn
parents:
37002
diff
changeset
|
1213 |
fun dest_prem ctxt params t = |
33106
7a1636c3ffc9
extended core of predicate compiler to expand tuples in introduction rules
bulwahn
parents:
32740
diff
changeset
|
1214 |
(case strip_comb t of |
50056 | 1215 |
(v as Free _, _) => if member (op =) params v then Prem t else Sidecond t |
55437 | 1216 |
| (c as Const (@{const_name Not}, _), [t]) => |
1217 |
(case dest_prem ctxt params t of |
|
1218 |
Prem t => Negprem t |
|
1219 |
| Negprem _ => error ("Double negation not allowed in premise: " ^ |
|
1220 |
Syntax.string_of_term ctxt (c $ t)) |
|
1221 |
| Sidecond t => Sidecond (c $ t)) |
|
50056 | 1222 |
| (Const (s, _), _) => |
61114 | 1223 |
if Core_Data.is_registered ctxt s then Prem t else Sidecond t |
33106
7a1636c3ffc9
extended core of predicate compiler to expand tuples in introduction rules
bulwahn
parents:
32740
diff
changeset
|
1224 |
| _ => Sidecond t) |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1225 |
|
39310
17ef4415b17c
removing obsolete argument in prepare_intrs; passing context instead of theory in prepare_intrs
bulwahn
parents:
39299
diff
changeset
|
1226 |
fun prepare_intrs options ctxt prednames intros = |
32667 | 1227 |
let |
42361 | 1228 |
val thy = Proof_Context.theory_of ctxt |
59582 | 1229 |
val intrs = map Thm.prop_of intros |
33146
bf852ef586f2
now the predicate compilere handles the predicate without introduction rules better as before
bulwahn
parents:
33145
diff
changeset
|
1230 |
val preds = map (fn c => Const (c, Sign.the_const_type thy c)) prednames |
bf852ef586f2
now the predicate compilere handles the predicate without introduction rules better as before
bulwahn
parents:
33145
diff
changeset
|
1231 |
val (preds, intrs) = unify_consts thy preds intrs |
37003
a393a588b82e
moving towards working with proof contexts in the predicate compiler
bulwahn
parents:
37002
diff
changeset
|
1232 |
val ([preds, intrs], _) = fold_burrow (Variable.import_terms false) [preds, intrs] ctxt |
33126
bb8806eb5da7
importing of polymorphic introduction rules with different schematic variable names
bulwahn
parents:
33124
diff
changeset
|
1233 |
val preds = map dest_Const preds |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1234 |
val all_vs = terms_vs intrs |
39201
234e6ef4ff67
using the proposed modes for starting the fixpoint iteration in the mode analysis
bulwahn
parents:
39194
diff
changeset
|
1235 |
fun generate_modes s T = |
234e6ef4ff67
using the proposed modes for starting the fixpoint iteration in the mode analysis
bulwahn
parents:
39194
diff
changeset
|
1236 |
if member (op =) (no_higher_order_predicate options) s then |
234e6ef4ff67
using the proposed modes for starting the fixpoint iteration in the mode analysis
bulwahn
parents:
39194
diff
changeset
|
1237 |
all_smodes_of_typ T |
234e6ef4ff67
using the proposed modes for starting the fixpoint iteration in the mode analysis
bulwahn
parents:
39194
diff
changeset
|
1238 |
else |
234e6ef4ff67
using the proposed modes for starting the fixpoint iteration in the mode analysis
bulwahn
parents:
39194
diff
changeset
|
1239 |
all_modes_of_typ T |
55437 | 1240 |
val all_modes = |
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:
35267
diff
changeset
|
1241 |
map (fn (s, T) => |
55437 | 1242 |
(s, |
1243 |
(case proposed_modes options s of |
|
39651
2e06dad03dd3
adding check if user-given modes match type of predicates; removed useless function expand_tuples_elim
bulwahn
parents:
39649
diff
changeset
|
1244 |
SOME ms => check_matches_type ctxt s T ms |
55437 | 1245 |
| NONE => generate_modes s T))) preds |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1246 |
val params = |
55437 | 1247 |
(case intrs of |
33146
bf852ef586f2
now the predicate compilere handles the predicate without introduction rules better as before
bulwahn
parents:
33145
diff
changeset
|
1248 |
[] => |
bf852ef586f2
now the predicate compilere handles the predicate without introduction rules better as before
bulwahn
parents:
33145
diff
changeset
|
1249 |
let |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1250 |
val T = snd (hd preds) |
39764
1cf2088cf035
only modes but not types are used to destruct terms and types; this allows to interpret arguments that are predicates simply as input
bulwahn
parents:
39763
diff
changeset
|
1251 |
val one_mode = hd (the (AList.lookup (op =) all_modes (fst (hd preds)))) |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1252 |
val paramTs = |
39764
1cf2088cf035
only modes but not types are used to destruct terms and types; this allows to interpret arguments that are predicates simply as input
bulwahn
parents:
39763
diff
changeset
|
1253 |
ho_argsT_of one_mode (binder_types T) |
33482
5029ec373036
strictly respecting the line margin in the predicate compiler core
bulwahn
parents:
33479
diff
changeset
|
1254 |
val param_names = Name.variant_list [] (map (fn i => "p" ^ string_of_int i) |
5029ec373036
strictly respecting the line margin in the predicate compiler core
bulwahn
parents:
33479
diff
changeset
|
1255 |
(1 upto length paramTs)) |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1256 |
in |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1257 |
map2 (curry Free) param_names paramTs |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1258 |
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:
35267
diff
changeset
|
1259 |
| (intr :: _) => |
55437 | 1260 |
let |
1261 |
val (p, args) = strip_comb (HOLogic.dest_Trueprop (Logic.strip_imp_concl intr)) |
|
1262 |
val one_mode = hd (the (AList.lookup (op =) all_modes (fst (dest_Const p)))) |
|
1263 |
in |
|
1264 |
ho_args_of one_mode args |
|
1265 |
end) |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1266 |
val param_vs = map (fst o dest_Free) params |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1267 |
fun add_clause intr clauses = |
32667 | 1268 |
let |
55437 | 1269 |
val (Const (name, _), ts) = |
1270 |
strip_comb (HOLogic.dest_Trueprop (Logic.strip_imp_concl intr)) |
|
1271 |
val prems = |
|
1272 |
map (dest_prem ctxt params o HOLogic.dest_Trueprop) (Logic.strip_imp_prems intr) |
|
32667 | 1273 |
in |
55437 | 1274 |
AList.update op = |
1275 |
(name, these (AList.lookup op = clauses name) @ [(ts, prems)]) |
|
1276 |
clauses |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1277 |
end; |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1278 |
val clauses = fold add_clause intrs [] |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1279 |
in |
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:
35267
diff
changeset
|
1280 |
(preds, all_vs, param_vs, all_modes, clauses) |
55437 | 1281 |
end |
32667 | 1282 |
|
33376
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1283 |
(* sanity check of introduction rules *) |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1284 |
(* TODO: rethink check with new modes *) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1285 |
(* |
33106
7a1636c3ffc9
extended core of predicate compiler to expand tuples in introduction rules
bulwahn
parents:
32740
diff
changeset
|
1286 |
fun check_format_of_intro_rule thy intro = |
7a1636c3ffc9
extended core of predicate compiler to expand tuples in introduction rules
bulwahn
parents:
32740
diff
changeset
|
1287 |
let |
7a1636c3ffc9
extended core of predicate compiler to expand tuples in introduction rules
bulwahn
parents:
32740
diff
changeset
|
1288 |
val concl = Logic.strip_imp_concl (prop_of intro) |
7a1636c3ffc9
extended core of predicate compiler to expand tuples in introduction rules
bulwahn
parents:
32740
diff
changeset
|
1289 |
val (p, args) = strip_comb (HOLogic.dest_Trueprop concl) |
33629
5f35cf91c6a4
improving code quality thanks to Florian's code review
bulwahn
parents:
33628
diff
changeset
|
1290 |
val params = fst (chop (nparams_of thy (fst (dest_Const p))) args) |
33106
7a1636c3ffc9
extended core of predicate compiler to expand tuples in introduction rules
bulwahn
parents:
32740
diff
changeset
|
1291 |
fun check_arg arg = case HOLogic.strip_tupleT (fastype_of arg) of |
7a1636c3ffc9
extended core of predicate compiler to expand tuples in introduction rules
bulwahn
parents:
32740
diff
changeset
|
1292 |
(Ts as _ :: _ :: _) => |
33629
5f35cf91c6a4
improving code quality thanks to Florian's code review
bulwahn
parents:
33628
diff
changeset
|
1293 |
if length (HOLogic.strip_tuple arg) = length Ts then |
5f35cf91c6a4
improving code quality thanks to Florian's code review
bulwahn
parents:
33628
diff
changeset
|
1294 |
true |
33114
4785ef554dcc
added further examples; added mode to code_pred command; tuned; some temporary things in Predicate_Compile_ex
bulwahn
parents:
33113
diff
changeset
|
1295 |
else |
33629
5f35cf91c6a4
improving code quality thanks to Florian's code review
bulwahn
parents:
33628
diff
changeset
|
1296 |
error ("Format of introduction rule is invalid: tuples must be expanded:" |
5f35cf91c6a4
improving code quality thanks to Florian's code review
bulwahn
parents:
33628
diff
changeset
|
1297 |
^ (Syntax.string_of_term_global thy arg) ^ " in " ^ |
61268 | 1298 |
(Thm.string_of_thm_global thy intro)) |
33106
7a1636c3ffc9
extended core of predicate compiler to expand tuples in introduction rules
bulwahn
parents:
32740
diff
changeset
|
1299 |
| _ => true |
7a1636c3ffc9
extended core of predicate compiler to expand tuples in introduction rules
bulwahn
parents:
32740
diff
changeset
|
1300 |
val prems = Logic.strip_imp_prems (prop_of intro) |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1301 |
fun check_prem (Prem t) = forall check_arg args |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1302 |
| check_prem (Negprem t) = forall check_arg args |
33106
7a1636c3ffc9
extended core of predicate compiler to expand tuples in introduction rules
bulwahn
parents:
32740
diff
changeset
|
1303 |
| check_prem _ = true |
7a1636c3ffc9
extended core of predicate compiler to expand tuples in introduction rules
bulwahn
parents:
32740
diff
changeset
|
1304 |
in |
7a1636c3ffc9
extended core of predicate compiler to expand tuples in introduction rules
bulwahn
parents:
32740
diff
changeset
|
1305 |
forall check_arg args andalso |
7a1636c3ffc9
extended core of predicate compiler to expand tuples in introduction rules
bulwahn
parents:
32740
diff
changeset
|
1306 |
forall (check_prem o dest_prem thy params o HOLogic.dest_Trueprop) prems |
7a1636c3ffc9
extended core of predicate compiler to expand tuples in introduction rules
bulwahn
parents:
32740
diff
changeset
|
1307 |
end |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1308 |
*) |
33124
5378e61add1a
continued cleaning up; moved tuple expanding to core
bulwahn
parents:
33123
diff
changeset
|
1309 |
(* |
5378e61add1a
continued cleaning up; moved tuple expanding to core
bulwahn
parents:
33123
diff
changeset
|
1310 |
fun check_intros_elim_match thy prednames = |
5378e61add1a
continued cleaning up; moved tuple expanding to core
bulwahn
parents:
33123
diff
changeset
|
1311 |
let |
5378e61add1a
continued cleaning up; moved tuple expanding to core
bulwahn
parents:
33123
diff
changeset
|
1312 |
fun check predname = |
5378e61add1a
continued cleaning up; moved tuple expanding to core
bulwahn
parents:
33123
diff
changeset
|
1313 |
let |
5378e61add1a
continued cleaning up; moved tuple expanding to core
bulwahn
parents:
33123
diff
changeset
|
1314 |
val intros = intros_of thy predname |
5378e61add1a
continued cleaning up; moved tuple expanding to core
bulwahn
parents:
33123
diff
changeset
|
1315 |
val elim = the_elim_of thy predname |
5378e61add1a
continued cleaning up; moved tuple expanding to core
bulwahn
parents:
33123
diff
changeset
|
1316 |
val nparams = nparams_of thy predname |
5378e61add1a
continued cleaning up; moved tuple expanding to core
bulwahn
parents:
33123
diff
changeset
|
1317 |
val elim' = |
35021
c839a4c670c6
renamed old-style Drule.standard to Drule.export_without_context, to emphasize that this is in no way a standard operation;
wenzelm
parents:
34974
diff
changeset
|
1318 |
(Drule.export_without_context o Skip_Proof.make_thm thy) |
42361 | 1319 |
(mk_casesrule (Proof_Context.init_global thy) nparams intros) |
33124
5378e61add1a
continued cleaning up; moved tuple expanding to core
bulwahn
parents:
33123
diff
changeset
|
1320 |
in |
5378e61add1a
continued cleaning up; moved tuple expanding to core
bulwahn
parents:
33123
diff
changeset
|
1321 |
if not (Thm.equiv_thm (elim, elim')) then |
5378e61add1a
continued cleaning up; moved tuple expanding to core
bulwahn
parents:
33123
diff
changeset
|
1322 |
error "Introduction and elimination rules do not match!" |
5378e61add1a
continued cleaning up; moved tuple expanding to core
bulwahn
parents:
33123
diff
changeset
|
1323 |
else true |
5378e61add1a
continued cleaning up; moved tuple expanding to core
bulwahn
parents:
33123
diff
changeset
|
1324 |
end |
5378e61add1a
continued cleaning up; moved tuple expanding to core
bulwahn
parents:
33123
diff
changeset
|
1325 |
in forall check prednames end |
5378e61add1a
continued cleaning up; moved tuple expanding to core
bulwahn
parents:
33123
diff
changeset
|
1326 |
*) |
33113 | 1327 |
|
55437 | 1328 |
|
33376
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1329 |
(* create code equation *) |
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1330 |
|
37007
116670499530
changing operations for accessing data to work with contexts
bulwahn
parents:
37006
diff
changeset
|
1331 |
fun add_code_equations ctxt preds result_thmss = |
33376
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1332 |
let |
33629
5f35cf91c6a4
improving code quality thanks to Florian's code review
bulwahn
parents:
33628
diff
changeset
|
1333 |
fun add_code_equation (predname, T) (pred, result_thms) = |
33376
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1334 |
let |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1335 |
val full_mode = fold_rev (curry Fun) (map (K Input) (binder_types T)) Bool |
33376
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1336 |
in |
61114 | 1337 |
if member eq_mode (Core_Data.modes_of Pred ctxt predname) full_mode then |
33376
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1338 |
let |
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1339 |
val Ts = binder_types T |
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1340 |
val arg_names = Name.variant_list [] |
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1341 |
(map (fn i => "x" ^ string_of_int i) (1 upto length Ts)) |
33629
5f35cf91c6a4
improving code quality thanks to Florian's code review
bulwahn
parents:
33628
diff
changeset
|
1342 |
val args = map2 (curry Free) arg_names Ts |
61114 | 1343 |
val predfun = Const (Core_Data.function_name_of Pred ctxt predname full_mode, |
45461
130c90bb80b4
using more conventional names for monad plus operations
bulwahn
parents:
45452
diff
changeset
|
1344 |
Ts ---> Predicate_Comp_Funs.mk_monadT @{typ unit}) |
33754
f2957bd46faf
adding derived constant Predicate.holds to Predicate theory; adopting the predicate compiler
bulwahn
parents:
33753
diff
changeset
|
1345 |
val rhs = @{term Predicate.holds} $ (list_comb (predfun, args)) |
33376
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1346 |
val eq_term = HOLogic.mk_Trueprop |
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1347 |
(HOLogic.mk_eq (list_comb (Const (predname, T), args), rhs)) |
61114 | 1348 |
val def = Core_Data.predfun_definition_of ctxt predname full_mode |
33441
99a5f22a967d
eliminated funny record patterns and made SML/NJ happy;
wenzelm
parents:
33377
diff
changeset
|
1349 |
val tac = fn _ => Simplifier.simp_tac |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51673
diff
changeset
|
1350 |
(put_simpset HOL_basic_ss ctxt addsimps [def, @{thm holds_eq}, @{thm eval_pred}]) 1 |
35888
d902054e7ac6
contextifying the proof procedure in the predicate compiler
bulwahn
parents:
35887
diff
changeset
|
1351 |
val eq = Goal.prove ctxt arg_names [] eq_term tac |
33376
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1352 |
in |
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1353 |
(pred, result_thms @ [eq]) |
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1354 |
end |
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1355 |
else |
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1356 |
(pred, result_thms) |
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1357 |
end |
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1358 |
in |
33629
5f35cf91c6a4
improving code quality thanks to Florian's code review
bulwahn
parents:
33628
diff
changeset
|
1359 |
map2 add_code_equation preds result_thmss |
33376
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1360 |
end |
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1361 |
|
55437 | 1362 |
|
32667 | 1363 |
(** main function of predicate compiler **) |
1364 |
||
33330
d6eb7f19bfc6
encapsulating records with datatype constructors and adding type annotations to make SML/NJ happy
bulwahn
parents:
33328
diff
changeset
|
1365 |
datatype steps = Steps of |
d6eb7f19bfc6
encapsulating records with datatype constructors and adding type annotations to make SML/NJ happy
bulwahn
parents:
33328
diff
changeset
|
1366 |
{ |
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:
35267
diff
changeset
|
1367 |
define_functions : options -> (string * typ) list -> string * (bool * mode) list -> theory -> theory, |
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:
35267
diff
changeset
|
1368 |
prove : options -> theory -> (string * (term list * indprem list) list) list -> (string * typ) list |
33330
d6eb7f19bfc6
encapsulating records with datatype constructors and adding type annotations to make SML/NJ happy
bulwahn
parents:
33328
diff
changeset
|
1369 |
-> moded_clause list pred_mode_table -> term pred_mode_table -> thm pred_mode_table, |
37007
116670499530
changing operations for accessing data to work with contexts
bulwahn
parents:
37006
diff
changeset
|
1370 |
add_code_equations : Proof.context -> (string * typ) list |
33376
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1371 |
-> (string * thm list) list -> (string * thm list) list, |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1372 |
comp_modifiers : Comp_Mod.comp_modifiers, |
39761
c2a76ec6e2d9
renaming use_random to use_generators in the predicate compiler
bulwahn
parents:
39760
diff
changeset
|
1373 |
use_generators : bool, |
33330
d6eb7f19bfc6
encapsulating records with datatype constructors and adding type annotations to make SML/NJ happy
bulwahn
parents:
33328
diff
changeset
|
1374 |
qname : bstring |
d6eb7f19bfc6
encapsulating records with datatype constructors and adding type annotations to make SML/NJ happy
bulwahn
parents:
33328
diff
changeset
|
1375 |
} |
d6eb7f19bfc6
encapsulating records with datatype constructors and adding type annotations to make SML/NJ happy
bulwahn
parents:
33328
diff
changeset
|
1376 |
|
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:
35267
diff
changeset
|
1377 |
fun add_equations_of steps mode_analysis_options options prednames thy = |
32667 | 1378 |
let |
33330
d6eb7f19bfc6
encapsulating records with datatype constructors and adding type annotations to make SML/NJ happy
bulwahn
parents:
33328
diff
changeset
|
1379 |
fun dest_steps (Steps s) = s |
35879
99818df5b8f5
reviving the classical depth-limited computation in the predicate compiler
bulwahn
parents:
35845
diff
changeset
|
1380 |
val compilation = Comp_Mod.compilation (#comp_modifiers (dest_steps steps)) |
42361 | 1381 |
val ctxt = Proof_Context.init_global thy |
55437 | 1382 |
val _ = |
1383 |
print_step options |
|
1384 |
("Starting predicate compiler (compilation: " ^ string_of_compilation compilation ^ |
|
1385 |
") for predicates " ^ commas prednames ^ "...") |
|
1386 |
(*val _ = check_intros_elim_match thy prednames*) |
|
1387 |
(*val _ = map (check_format_of_intro_rule thy) (maps (intros_of thy) prednames)*) |
|
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:
35267
diff
changeset
|
1388 |
val _ = |
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:
35267
diff
changeset
|
1389 |
if show_intermediate_results options then |
61268 | 1390 |
tracing (commas (map (Thm.string_of_thm ctxt) (maps (Core_Data.intros_of ctxt) prednames))) |
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:
35267
diff
changeset
|
1391 |
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:
35267
diff
changeset
|
1392 |
val (preds, all_vs, param_vs, all_modes, clauses) = |
61114 | 1393 |
prepare_intrs options ctxt prednames (maps (Core_Data.intros_of ctxt) prednames) |
33123
3c7c4372f9ad
cleaned up debugging messages; added options to code_pred command
bulwahn
parents:
33120
diff
changeset
|
1394 |
val _ = print_step options "Infering modes..." |
61114 | 1395 |
val (lookup_mode, lookup_neg_mode, needs_random) = (Core_Data.modes_of compilation ctxt, |
1396 |
Core_Data.modes_of (negative_compilation_of compilation) ctxt, Core_Data.needs_random ctxt) |
|
39273
92aa2a0f7399
refactoring mode inference so that the theory is not changed in the mode inference procedure
bulwahn
parents:
39201
diff
changeset
|
1397 |
val ((moded_clauses, needs_random), errors) = |
42088
8d00484551fe
making quickcheck's result value more formal; allowing more result information to be returned after timeout; adding output of timing information in quickcheck
bulwahn
parents:
42011
diff
changeset
|
1398 |
cond_timeit (Config.get ctxt Quickcheck.timing) "Infering modes" |
36251
5fd5d732a4ea
only add relevant predicates to the list of extra modes
bulwahn
parents:
36247
diff
changeset
|
1399 |
(fn _ => infer_modes mode_analysis_options |
39273
92aa2a0f7399
refactoring mode inference so that the theory is not changed in the mode inference procedure
bulwahn
parents:
39201
diff
changeset
|
1400 |
options (lookup_mode, lookup_neg_mode, needs_random) ctxt preds all_modes param_vs clauses) |
61114 | 1401 |
val thy' = fold (fn (s, ms) => Core_Data.set_needs_random s ms) needs_random thy |
33132
07efd452a698
moved argument expected_modes into options; improved mode check to only check mode of the named predicate
bulwahn
parents:
33131
diff
changeset
|
1402 |
val modes = map (fn (p, mps) => (p, map fst mps)) moded_clauses |
40138 | 1403 |
val _ = check_expected_modes options preds modes |
1404 |
val _ = check_proposed_modes options preds modes errors |
|
37004 | 1405 |
val _ = print_modes options modes |
33123
3c7c4372f9ad
cleaned up debugging messages; added options to code_pred command
bulwahn
parents:
33120
diff
changeset
|
1406 |
val _ = print_step options "Defining executable functions..." |
36252 | 1407 |
val thy'' = |
42088
8d00484551fe
making quickcheck's result value more formal; allowing more result information to be returned after timeout; adding output of timing information in quickcheck
bulwahn
parents:
42011
diff
changeset
|
1408 |
cond_timeit (Config.get ctxt Quickcheck.timing) "Defining executable functions..." |
52788 | 1409 |
(fn _ => fold (#define_functions (dest_steps steps) options preds) modes thy') |
42361 | 1410 |
val ctxt'' = Proof_Context.init_global thy'' |
33123
3c7c4372f9ad
cleaned up debugging messages; added options to code_pred command
bulwahn
parents:
33120
diff
changeset
|
1411 |
val _ = print_step options "Compiling equations..." |
32667 | 1412 |
val compiled_terms = |
42088
8d00484551fe
making quickcheck's result value more formal; allowing more result information to be returned after timeout; adding output of timing information in quickcheck
bulwahn
parents:
42011
diff
changeset
|
1413 |
cond_timeit (Config.get ctxt Quickcheck.timing) "Compiling equations...." (fn _ => |
36254 | 1414 |
compile_preds options |
37005
842a73dc6d0e
changing compilation to work only with contexts; adapting quickcheck
bulwahn
parents:
37004
diff
changeset
|
1415 |
(#comp_modifiers (dest_steps steps)) ctxt'' all_vs param_vs preds moded_clauses) |
842a73dc6d0e
changing compilation to work only with contexts; adapting quickcheck
bulwahn
parents:
37004
diff
changeset
|
1416 |
val _ = print_compiled_terms options ctxt'' compiled_terms |
33123
3c7c4372f9ad
cleaned up debugging messages; added options to code_pred command
bulwahn
parents:
33120
diff
changeset
|
1417 |
val _ = print_step options "Proving equations..." |
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:
35267
diff
changeset
|
1418 |
val result_thms = |
42088
8d00484551fe
making quickcheck's result value more formal; allowing more result information to be returned after timeout; adding output of timing information in quickcheck
bulwahn
parents:
42011
diff
changeset
|
1419 |
cond_timeit (Config.get ctxt Quickcheck.timing) "Proving equations...." (fn _ => |
36252 | 1420 |
#prove (dest_steps steps) options thy'' clauses preds moded_clauses compiled_terms) |
37007
116670499530
changing operations for accessing data to work with contexts
bulwahn
parents:
37006
diff
changeset
|
1421 |
val result_thms' = #add_code_equations (dest_steps steps) ctxt'' preds |
33376
5cb663aa48ee
predicate compiler creates code equations for predicates with full mode
bulwahn
parents:
33375
diff
changeset
|
1422 |
(maps_modes result_thms) |
33330
d6eb7f19bfc6
encapsulating records with datatype constructors and adding type annotations to make SML/NJ happy
bulwahn
parents:
33328
diff
changeset
|
1423 |
val qname = #qname (dest_steps steps) |
47248 | 1424 |
val attrib = Thm.declaration_attribute (fn thm => Context.mapping (Code.add_eqn thm) I) |
36252 | 1425 |
val thy''' = |
42088
8d00484551fe
making quickcheck's result value more formal; allowing more result information to be returned after timeout; adding output of timing information in quickcheck
bulwahn
parents:
42011
diff
changeset
|
1426 |
cond_timeit (Config.get ctxt Quickcheck.timing) "Setting code equations...." (fn _ => |
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39545
diff
changeset
|
1427 |
fold (fn (name, result_thms) => fn thy => snd (Global_Theory.add_thmss |
32667 | 1428 |
[((Binding.qualify true (Long_Name.base_name name) (Binding.name qname), result_thms), |
47248 | 1429 |
[attrib])] thy)) |
52788 | 1430 |
result_thms' thy'') |
32667 | 1431 |
in |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1432 |
thy''' |
32667 | 1433 |
end |
55437 | 1434 |
|
33132
07efd452a698
moved argument expected_modes into options; improved mode check to only check mode of the named predicate
bulwahn
parents:
33131
diff
changeset
|
1435 |
fun gen_add_equations steps options names thy = |
32667 | 1436 |
let |
33330
d6eb7f19bfc6
encapsulating records with datatype constructors and adding type annotations to make SML/NJ happy
bulwahn
parents:
33328
diff
changeset
|
1437 |
fun dest_steps (Steps s) = s |
61114 | 1438 |
val defined = Core_Data.defined_functions (Comp_Mod.compilation (#comp_modifiers (dest_steps steps))) |
1439 |
val thy' = Core_Data.extend_intro_graph names thy; |
|
32667 | 1440 |
fun strong_conn_of gr keys = |
46614
165886a4fe64
clarified Graph.restrict (formerly Graph.subgraph) based on public graph operations;
wenzelm
parents:
46219
diff
changeset
|
1441 |
Graph.strong_conn (Graph.restrict (member (op =) (Graph.all_succs gr keys)) gr) |
61114 | 1442 |
val scc = strong_conn_of (Core_Data.PredData.get thy') names |
1443 |
val thy'' = fold Core_Data.preprocess_intros (flat scc) thy' |
|
39657
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39653
diff
changeset
|
1444 |
val thy''' = fold_rev |
32667 | 1445 |
(fn preds => fn thy => |
42361 | 1446 |
if not (forall (defined (Proof_Context.init_global thy)) preds) then |
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:
35267
diff
changeset
|
1447 |
let |
39761
c2a76ec6e2d9
renaming use_random to use_generators in the predicate compiler
bulwahn
parents:
39760
diff
changeset
|
1448 |
val mode_analysis_options = {use_generators = #use_generators (dest_steps steps), |
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:
35267
diff
changeset
|
1449 |
reorder_premises = |
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:
35267
diff
changeset
|
1450 |
not (no_topmost_reordering options andalso not (null (inter (op =) preds names))), |
39761
c2a76ec6e2d9
renaming use_random to use_generators in the predicate compiler
bulwahn
parents:
39760
diff
changeset
|
1451 |
infer_pos_and_neg_modes = #use_generators (dest_steps steps)} |
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:
35267
diff
changeset
|
1452 |
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:
35267
diff
changeset
|
1453 |
add_equations_of steps mode_analysis_options options preds thy |
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:
35267
diff
changeset
|
1454 |
end |
33483
a15a2f7f7560
improved handling of already defined functions in the predicate compiler; could cause trouble before when no modes for a predicate were infered
bulwahn
parents:
33482
diff
changeset
|
1455 |
else thy) |
52788 | 1456 |
scc thy'' |
39657
5e57675b7e40
moving the preprocessing of introduction rules after the code_pred command; added tuple expansion preprocessing of elimination rule
bulwahn
parents:
39653
diff
changeset
|
1457 |
in thy''' end |
35879
99818df5b8f5
reviving the classical depth-limited computation in the predicate compiler
bulwahn
parents:
35845
diff
changeset
|
1458 |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1459 |
val add_equations = gen_add_equations |
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:
35267
diff
changeset
|
1460 |
(Steps { |
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:
35267
diff
changeset
|
1461 |
define_functions = |
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:
35267
diff
changeset
|
1462 |
fn options => fn preds => fn (s, modes) => |
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:
35267
diff
changeset
|
1463 |
create_definitions |
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:
35267
diff
changeset
|
1464 |
options preds (s, map_filter (fn (true, m) => SOME m | _ => NONE) modes), |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1465 |
prove = prove, |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1466 |
add_code_equations = add_code_equations, |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1467 |
comp_modifiers = predicate_comp_modifiers, |
39761
c2a76ec6e2d9
renaming use_random to use_generators in the predicate compiler
bulwahn
parents:
39760
diff
changeset
|
1468 |
use_generators = false, |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1469 |
qname = "equation"}) |
33143
730a2e8a6ec6
modularized the compilation in the predicate compiler
bulwahn
parents:
33141
diff
changeset
|
1470 |
|
33134
88c9c3460fe7
renamed functions from sizelim to more natural name depth_limited for compilation of depth-limited search in the predicate compiler
bulwahn
parents:
33133
diff
changeset
|
1471 |
val add_depth_limited_equations = gen_add_equations |
35879
99818df5b8f5
reviving the classical depth-limited computation in the predicate compiler
bulwahn
parents:
35845
diff
changeset
|
1472 |
(Steps { |
99818df5b8f5
reviving the classical depth-limited computation in the predicate compiler
bulwahn
parents:
35845
diff
changeset
|
1473 |
define_functions = |
99818df5b8f5
reviving the classical depth-limited computation in the predicate compiler
bulwahn
parents:
35845
diff
changeset
|
1474 |
fn options => fn preds => fn (s, modes) => |
45450 | 1475 |
define_functions depth_limited_comp_modifiers Predicate_Comp_Funs.compfuns |
35879
99818df5b8f5
reviving the classical depth-limited computation in the predicate compiler
bulwahn
parents:
35845
diff
changeset
|
1476 |
options preds (s, map_filter (fn (true, m) => SOME m | _ => NONE) modes), |
32667 | 1477 |
prove = prove_by_skip, |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1478 |
add_code_equations = K (K I), |
35879
99818df5b8f5
reviving the classical depth-limited computation in the predicate compiler
bulwahn
parents:
35845
diff
changeset
|
1479 |
comp_modifiers = depth_limited_comp_modifiers, |
39761
c2a76ec6e2d9
renaming use_random to use_generators in the predicate compiler
bulwahn
parents:
39760
diff
changeset
|
1480 |
use_generators = false, |
33330
d6eb7f19bfc6
encapsulating records with datatype constructors and adding type annotations to make SML/NJ happy
bulwahn
parents:
33328
diff
changeset
|
1481 |
qname = "depth_limited_equation"}) |
35879
99818df5b8f5
reviving the classical depth-limited computation in the predicate compiler
bulwahn
parents:
35845
diff
changeset
|
1482 |
|
35880
2623b23e41fc
a new simpler random compilation for the predicate compiler
bulwahn
parents:
35879
diff
changeset
|
1483 |
val add_random_equations = gen_add_equations |
2623b23e41fc
a new simpler random compilation for the predicate compiler
bulwahn
parents:
35879
diff
changeset
|
1484 |
(Steps { |
2623b23e41fc
a new simpler random compilation for the predicate compiler
bulwahn
parents:
35879
diff
changeset
|
1485 |
define_functions = |
2623b23e41fc
a new simpler random compilation for the predicate compiler
bulwahn
parents:
35879
diff
changeset
|
1486 |
fn options => fn preds => fn (s, modes) => |
45450 | 1487 |
define_functions random_comp_modifiers Predicate_Comp_Funs.compfuns options preds |
35880
2623b23e41fc
a new simpler random compilation for the predicate compiler
bulwahn
parents:
35879
diff
changeset
|
1488 |
(s, map_filter (fn (true, m) => SOME m | _ => NONE) modes), |
2623b23e41fc
a new simpler random compilation for the predicate compiler
bulwahn
parents:
35879
diff
changeset
|
1489 |
comp_modifiers = random_comp_modifiers, |
32667 | 1490 |
prove = prove_by_skip, |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1491 |
add_code_equations = K (K I), |
39761
c2a76ec6e2d9
renaming use_random to use_generators in the predicate compiler
bulwahn
parents:
39760
diff
changeset
|
1492 |
use_generators = true, |
33375 | 1493 |
qname = "random_equation"}) |
35880
2623b23e41fc
a new simpler random compilation for the predicate compiler
bulwahn
parents:
35879
diff
changeset
|
1494 |
|
35881
aa412e08bfee
adding depth_limited_random compilation to predicate compiler
bulwahn
parents:
35880
diff
changeset
|
1495 |
val add_depth_limited_random_equations = gen_add_equations |
aa412e08bfee
adding depth_limited_random compilation to predicate compiler
bulwahn
parents:
35880
diff
changeset
|
1496 |
(Steps { |
aa412e08bfee
adding depth_limited_random compilation to predicate compiler
bulwahn
parents:
35880
diff
changeset
|
1497 |
define_functions = |
aa412e08bfee
adding depth_limited_random compilation to predicate compiler
bulwahn
parents:
35880
diff
changeset
|
1498 |
fn options => fn preds => fn (s, modes) => |
45450 | 1499 |
define_functions depth_limited_random_comp_modifiers Predicate_Comp_Funs.compfuns options preds |
35881
aa412e08bfee
adding depth_limited_random compilation to predicate compiler
bulwahn
parents:
35880
diff
changeset
|
1500 |
(s, map_filter (fn (true, m) => SOME m | _ => NONE) modes), |
aa412e08bfee
adding depth_limited_random compilation to predicate compiler
bulwahn
parents:
35880
diff
changeset
|
1501 |
comp_modifiers = depth_limited_random_comp_modifiers, |
aa412e08bfee
adding depth_limited_random compilation to predicate compiler
bulwahn
parents:
35880
diff
changeset
|
1502 |
prove = prove_by_skip, |
aa412e08bfee
adding depth_limited_random compilation to predicate compiler
bulwahn
parents:
35880
diff
changeset
|
1503 |
add_code_equations = K (K I), |
39761
c2a76ec6e2d9
renaming use_random to use_generators in the predicate compiler
bulwahn
parents:
39760
diff
changeset
|
1504 |
use_generators = true, |
35881
aa412e08bfee
adding depth_limited_random compilation to predicate compiler
bulwahn
parents:
35880
diff
changeset
|
1505 |
qname = "depth_limited_random_equation"}) |
aa412e08bfee
adding depth_limited_random compilation to predicate compiler
bulwahn
parents:
35880
diff
changeset
|
1506 |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1507 |
val add_dseq_equations = gen_add_equations |
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:
35267
diff
changeset
|
1508 |
(Steps { |
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:
35267
diff
changeset
|
1509 |
define_functions = |
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:
35267
diff
changeset
|
1510 |
fn options => fn preds => fn (s, modes) => |
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:
35267
diff
changeset
|
1511 |
define_functions dseq_comp_modifiers DSequence_CompFuns.compfuns |
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:
35267
diff
changeset
|
1512 |
options preds (s, map_filter (fn (true, m) => SOME m | _ => NONE) modes), |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1513 |
prove = prove_by_skip, |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1514 |
add_code_equations = K (K I), |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1515 |
comp_modifiers = dseq_comp_modifiers, |
39761
c2a76ec6e2d9
renaming use_random to use_generators in the predicate compiler
bulwahn
parents:
39760
diff
changeset
|
1516 |
use_generators = false, |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1517 |
qname = "dseq_equation"}) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1518 |
|
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1519 |
val add_random_dseq_equations = gen_add_equations |
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:
35267
diff
changeset
|
1520 |
(Steps { |
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:
35267
diff
changeset
|
1521 |
define_functions = |
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:
35267
diff
changeset
|
1522 |
fn options => fn preds => fn (s, modes) => |
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:
35267
diff
changeset
|
1523 |
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:
35267
diff
changeset
|
1524 |
val pos_modes = map_filter (fn (true, m) => SOME m | _ => NONE) modes |
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:
35267
diff
changeset
|
1525 |
val neg_modes = map_filter (fn (false, m) => SOME m | _ => NONE) modes |
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:
35267
diff
changeset
|
1526 |
in define_functions pos_random_dseq_comp_modifiers Random_Sequence_CompFuns.compfuns |
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:
35267
diff
changeset
|
1527 |
options preds (s, pos_modes) |
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:
35267
diff
changeset
|
1528 |
#> define_functions neg_random_dseq_comp_modifiers Random_Sequence_CompFuns.compfuns |
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:
35267
diff
changeset
|
1529 |
options preds (s, neg_modes) |
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:
35267
diff
changeset
|
1530 |
end, |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1531 |
prove = prove_by_skip, |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1532 |
add_code_equations = K (K I), |
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:
35267
diff
changeset
|
1533 |
comp_modifiers = pos_random_dseq_comp_modifiers, |
39761
c2a76ec6e2d9
renaming use_random to use_generators in the predicate compiler
bulwahn
parents:
39760
diff
changeset
|
1534 |
use_generators = true, |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1535 |
qname = "random_dseq_equation"}) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1536 |
|
36018 | 1537 |
val add_new_random_dseq_equations = gen_add_equations |
1538 |
(Steps { |
|
1539 |
define_functions = |
|
1540 |
fn options => fn preds => fn (s, modes) => |
|
55437 | 1541 |
let |
1542 |
val pos_modes = map_filter (fn (true, m) => SOME m | _ => NONE) modes |
|
1543 |
val neg_modes = map_filter (fn (false, m) => SOME m | _ => NONE) modes |
|
1544 |
in |
|
1545 |
define_functions new_pos_random_dseq_comp_modifiers |
|
1546 |
New_Pos_Random_Sequence_CompFuns.depth_limited_compfuns |
|
1547 |
options preds (s, pos_modes) #> |
|
1548 |
define_functions new_neg_random_dseq_comp_modifiers |
|
1549 |
New_Neg_Random_Sequence_CompFuns.depth_limited_compfuns |
|
1550 |
options preds (s, neg_modes) |
|
1551 |
end, |
|
36018 | 1552 |
prove = prove_by_skip, |
1553 |
add_code_equations = K (K I), |
|
1554 |
comp_modifiers = new_pos_random_dseq_comp_modifiers, |
|
39761
c2a76ec6e2d9
renaming use_random to use_generators in the predicate compiler
bulwahn
parents:
39760
diff
changeset
|
1555 |
use_generators = true, |
36018 | 1556 |
qname = "new_random_dseq_equation"}) |
32667 | 1557 |
|
40051
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
1558 |
val add_generator_dseq_equations = gen_add_equations |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
1559 |
(Steps { |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
1560 |
define_functions = |
55437 | 1561 |
fn options => fn preds => fn (s, modes) => |
1562 |
let |
|
1563 |
val pos_modes = map_filter (fn (true, m) => SOME m | _ => NONE) modes |
|
1564 |
val neg_modes = map_filter (fn (false, m) => SOME m | _ => NONE) modes |
|
1565 |
in |
|
1566 |
define_functions pos_generator_dseq_comp_modifiers |
|
1567 |
New_Pos_DSequence_CompFuns.depth_limited_compfuns options preds (s, pos_modes) #> |
|
1568 |
define_functions neg_generator_dseq_comp_modifiers |
|
1569 |
New_Neg_DSequence_CompFuns.depth_limited_compfuns options preds (s, neg_modes) |
|
1570 |
end, |
|
40051
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
1571 |
prove = prove_by_skip, |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
1572 |
add_code_equations = K (K I), |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
1573 |
comp_modifiers = pos_generator_dseq_comp_modifiers, |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
1574 |
use_generators = true, |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
1575 |
qname = "generator_dseq_equation"}) |
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
1576 |
|
45450 | 1577 |
val add_generator_cps_equations = gen_add_equations |
1578 |
(Steps { |
|
1579 |
define_functions = |
|
55437 | 1580 |
fn options => fn preds => fn (s, modes) => |
1581 |
let |
|
1582 |
val pos_modes = map_filter (fn (true, m) => SOME m | _ => NONE) modes |
|
1583 |
val neg_modes = map_filter (fn (false, m) => SOME m | _ => NONE) modes |
|
1584 |
in |
|
1585 |
define_functions pos_generator_cps_comp_modifiers Pos_Bounded_CPS_Comp_Funs.compfuns |
|
1586 |
options preds (s, pos_modes) |
|
1587 |
#> define_functions neg_generator_cps_comp_modifiers Neg_Bounded_CPS_Comp_Funs.compfuns |
|
1588 |
options preds (s, neg_modes) |
|
1589 |
end, |
|
45450 | 1590 |
prove = prove_by_skip, |
1591 |
add_code_equations = K (K I), |
|
1592 |
comp_modifiers = pos_generator_cps_comp_modifiers, |
|
1593 |
use_generators = true, |
|
1594 |
qname = "generator_cps_equation"}) |
|
55437 | 1595 |
|
1596 |
||
32667 | 1597 |
(** user interface **) |
1598 |
||
1599 |
(* code_pred_intro attribute *) |
|
1600 |
||
39545
631cf48c7894
code_pred_intro can be used to name facts for the code_pred command
bulwahn
parents:
39477
diff
changeset
|
1601 |
fun attrib' f opt_case_name = |
631cf48c7894
code_pred_intro can be used to name facts for the code_pred command
bulwahn
parents:
39477
diff
changeset
|
1602 |
Thm.declaration_attribute (fn thm => Context.mapping (f (opt_case_name, thm)) I); |
32667 | 1603 |
|
61114 | 1604 |
val code_pred_intro_attrib = attrib' Core_Data.add_intro NONE; |
32667 | 1605 |
|
32668
b2de45007537
added first prototype of the extended predicate compiler
bulwahn
parents:
32667
diff
changeset
|
1606 |
(*FIXME |
b2de45007537
added first prototype of the extended predicate compiler
bulwahn
parents:
32667
diff
changeset
|
1607 |
- Naming of auxiliary rules necessary? |
b2de45007537
added first prototype of the extended predicate compiler
bulwahn
parents:
32667
diff
changeset
|
1608 |
*) |
b2de45007537
added first prototype of the extended predicate compiler
bulwahn
parents:
32667
diff
changeset
|
1609 |
|
42141
2c255ba8f299
changing values_timeout from a static option to a dynamic option as required for testing with SML/NJ
bulwahn
parents:
42094
diff
changeset
|
1610 |
(* values_timeout configuration *) |
2c255ba8f299
changing values_timeout from a static option to a dynamic option as required for testing with SML/NJ
bulwahn
parents:
42094
diff
changeset
|
1611 |
|
45452
414732ebf891
increasing values_timeout to avoid failures of isatest with HOL-IMP
bulwahn
parents:
45450
diff
changeset
|
1612 |
val default_values_timeout = if ML_System.is_smlnj then 1200.0 else 40.0 |
43896
8955dcac6c71
values_timeout defaults to 600.0 on SML/NJ -- saves us from cluttering all theories equivalent declarations
krauss
parents:
43619
diff
changeset
|
1613 |
|
55437 | 1614 |
val values_timeout = |
1615 |
Attrib.setup_config_real @{binding values_timeout} (K default_values_timeout) |
|
42141
2c255ba8f299
changing values_timeout from a static option to a dynamic option as required for testing with SML/NJ
bulwahn
parents:
42094
diff
changeset
|
1616 |
|
58823 | 1617 |
val _ = |
1618 |
Theory.setup |
|
61114 | 1619 |
(Core_Data.PredData.put (Graph.empty) #> |
1620 |
Attrib.setup @{binding code_pred_intro} |
|
1621 |
(Scan.lift (Scan.option Args.name) >> attrib' Core_Data.add_intro) |
|
58823 | 1622 |
"adding alternative introduction rules for code generation of inductive predicates") |
32667 | 1623 |
|
33522 | 1624 |
(* TODO: make Theory_Data to Generic_Data & remove duplication of local theory and theory *) |
38757
2b3e054ae6fc
renamed Local_Theory.theory(_result) to Local_Theory.background_theory(_result) to emphasize that this belongs to the infrastructure and is rarely appropriate in user-space tools;
wenzelm
parents:
38558
diff
changeset
|
1625 |
(* FIXME ... this is important to avoid changing the background theory below *) |
33132
07efd452a698
moved argument expected_modes into options; improved mode check to only check mode of the named predicate
bulwahn
parents:
33131
diff
changeset
|
1626 |
fun generic_code_pred prep_const options raw_const lthy = |
32667 | 1627 |
let |
42361 | 1628 |
val thy = Proof_Context.theory_of lthy |
32667 | 1629 |
val const = prep_const thy raw_const |
61114 | 1630 |
val lthy' = Local_Theory.background_theory (Core_Data.extend_intro_graph [const]) lthy |
42361 | 1631 |
val thy' = Proof_Context.theory_of lthy' |
1632 |
val ctxt' = Proof_Context.init_global thy' |
|
61114 | 1633 |
val preds = |
1634 |
Graph.all_succs (Core_Data.PredData.get thy') [const] |> filter_out (Core_Data.has_elim ctxt') |
|
32667 | 1635 |
fun mk_cases const = |
1636 |
let |
|
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:
39273
diff
changeset
|
1637 |
val T = Sign.the_const_type thy' const |
33146
bf852ef586f2
now the predicate compilere handles the predicate without introduction rules better as before
bulwahn
parents:
33145
diff
changeset
|
1638 |
val pred = Const (const, T) |
61114 | 1639 |
val intros = Core_Data.intros_of ctxt' const |
55437 | 1640 |
in mk_casesrule lthy' pred intros end |
32667 | 1641 |
val cases_rules = map mk_cases preds |
1642 |
val cases = |
|
60565 | 1643 |
map2 (fn pred_name => fn case_rule => |
1644 |
Rule_Cases.Case { |
|
1645 |
fixes = [], |
|
1646 |
assumes = |
|
1647 |
("that", tl (Logic.strip_imp_prems case_rule)) :: |
|
1648 |
map_filter (fn (fact_name, fact) => Option.map (fn a => (a, [fact])) fact_name) |
|
61114 | 1649 |
((SOME "prems" :: Core_Data.names_of ctxt' pred_name) ~~ Logic.strip_imp_prems case_rule), |
60565 | 1650 |
binds = [], cases = []}) preds cases_rules |
32667 | 1651 |
val case_env = map2 (fn p => fn c => (Long_Name.base_name p, SOME c)) preds cases |
1652 |
val lthy'' = lthy' |
|
39545
631cf48c7894
code_pred_intro can be used to name facts for the code_pred command
bulwahn
parents:
39477
diff
changeset
|
1653 |
|> fold Variable.auto_fixes cases_rules |
60573 | 1654 |
|> Proof_Context.update_cases case_env |
32667 | 1655 |
fun after_qed thms goal_ctxt = |
1656 |
let |
|
42361 | 1657 |
val global_thms = Proof_Context.export goal_ctxt |
1658 |
(Proof_Context.init_global (Proof_Context.theory_of goal_ctxt)) (map the_single thms) |
|
32667 | 1659 |
in |
61114 | 1660 |
goal_ctxt |> Local_Theory.background_theory (fold Core_Data.set_elim global_thms #> |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1661 |
((case compilation options of |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1662 |
Pred => add_equations |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1663 |
| DSeq => add_dseq_equations |
35879
99818df5b8f5
reviving the classical depth-limited computation in the predicate compiler
bulwahn
parents:
35845
diff
changeset
|
1664 |
| Pos_Random_DSeq => add_random_dseq_equations |
99818df5b8f5
reviving the classical depth-limited computation in the predicate compiler
bulwahn
parents:
35845
diff
changeset
|
1665 |
| Depth_Limited => add_depth_limited_equations |
35880
2623b23e41fc
a new simpler random compilation for the predicate compiler
bulwahn
parents:
35879
diff
changeset
|
1666 |
| Random => add_random_equations |
35881
aa412e08bfee
adding depth_limited_random compilation to predicate compiler
bulwahn
parents:
35880
diff
changeset
|
1667 |
| Depth_Limited_Random => add_depth_limited_random_equations |
36018 | 1668 |
| New_Pos_Random_DSeq => add_new_random_dseq_equations |
40051
b6acda4d1c29
added generator_dseq compilation for a sound depth-limited compilation with small value generators
bulwahn
parents:
40050
diff
changeset
|
1669 |
| Pos_Generator_DSeq => add_generator_dseq_equations |
45450 | 1670 |
| Pos_Generator_CPS => add_generator_cps_equations |
50056 | 1671 |
| _ => error ("Compilation not supported") |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1672 |
) options [const])) |
33144
1831516747d4
removed obsolete GeneratorPrem; clean-up after modularization; tuned
bulwahn
parents:
33143
diff
changeset
|
1673 |
end |
32667 | 1674 |
in |
36323
655e2d74de3a
modernized naming conventions of main Isar proof elements;
wenzelm
parents:
36261
diff
changeset
|
1675 |
Proof.theorem NONE after_qed (map (single o (rpair [])) cases_rules) lthy'' |
32667 | 1676 |
end; |
1677 |
||
1678 |
val code_pred = generic_code_pred (K I); |
|
1679 |
val code_pred_cmd = generic_code_pred Code.read_const |
|
1680 |
||
55437 | 1681 |
|
32667 | 1682 |
(* transformation for code generation *) |
1683 |
||
59154 | 1684 |
structure Data = Proof_Data |
41472
f6ab14e61604
misc tuning and comments based on review of Theory_Data, Proof_Data, Generic_Data usage;
wenzelm
parents:
40845
diff
changeset
|
1685 |
( |
59154 | 1686 |
type T = |
1687 |
(unit -> term Predicate.pred) * |
|
1688 |
(unit -> seed -> term Predicate.pred * seed) * |
|
1689 |
(unit -> term Limited_Sequence.dseq) * |
|
1690 |
(unit -> Code_Numeral.natural -> Code_Numeral.natural -> seed -> |
|
1691 |
term Limited_Sequence.dseq * seed) * |
|
1692 |
(unit -> Code_Numeral.natural -> term Lazy_Sequence.lazy_sequence) * |
|
1693 |
(unit -> Code_Numeral.natural -> Code_Numeral.natural -> seed -> |
|
1694 |
Code_Numeral.natural -> term Lazy_Sequence.lazy_sequence) * |
|
1695 |
(unit -> Code_Numeral.natural -> Code_Numeral.natural -> seed -> |
|
1696 |
Code_Numeral.natural -> (term * Code_Numeral.natural) Lazy_Sequence.lazy_sequence); |
|
1697 |
val empty: T = |
|
1698 |
(fn () => raise Fail "pred_result", |
|
1699 |
fn () => raise Fail "pred_random_result", |
|
1700 |
fn () => raise Fail "dseq_result", |
|
1701 |
fn () => raise Fail "dseq_random_result", |
|
1702 |
fn () => raise Fail "new_dseq_result", |
|
1703 |
fn () => raise Fail "lseq_random_result", |
|
1704 |
fn () => raise Fail "lseq_random_stats_result"); |
|
1705 |
fun init _ = empty; |
|
39388
fdbb2c55ffc2
replaced ML_Context.evaluate by ML_Context.value -- using context data instead of bare metal references
haftmann
parents:
39310
diff
changeset
|
1706 |
); |
40102
a9e4e94b3022
restructuring values command and adding generator compilation
bulwahn
parents:
40053
diff
changeset
|
1707 |
|
59154 | 1708 |
val get_pred_result = #1 o Data.get; |
1709 |
val get_pred_random_result = #2 o Data.get; |
|
1710 |
val get_dseq_result = #3 o Data.get; |
|
1711 |
val get_dseq_random_result = #4 o Data.get; |
|
1712 |
val get_new_dseq_result = #5 o Data.get; |
|
1713 |
val get_lseq_random_result = #6 o Data.get; |
|
1714 |
val get_lseq_random_stats_result = #7 o Data.get; |
|
39388
fdbb2c55ffc2
replaced ML_Context.evaluate by ML_Context.value -- using context data instead of bare metal references
haftmann
parents:
39310
diff
changeset
|
1715 |
|
59154 | 1716 |
val put_pred_result = Data.map o @{apply 7(1)} o K; |
1717 |
val put_pred_random_result = Data.map o @{apply 7(2)} o K; |
|
1718 |
val put_dseq_result = Data.map o @{apply 7(3)} o K; |
|
1719 |
val put_dseq_random_result = Data.map o @{apply 7(4)} o K; |
|
1720 |
val put_new_dseq_result = Data.map o @{apply 7(5)} o K; |
|
1721 |
val put_lseq_random_result = Data.map o @{apply 7(6)} o K; |
|
1722 |
val put_lseq_random_stats_result = Data.map o @{apply 7(7)} o K; |
|
32667 | 1723 |
|
42094
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1724 |
fun dest_special_compr t = |
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1725 |
let |
55437 | 1726 |
val (inner_t, T_compr) = |
1727 |
(case t of |
|
1728 |
(Const (@{const_name Collect}, _) $ Abs (_, T, t)) => (t, T) |
|
1729 |
| _ => raise TERM ("dest_special_compr", [t])) |
|
42094
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1730 |
val (Ts, conj) = apfst (map snd) (Predicate_Compile_Aux.strip_ex inner_t) |
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1731 |
val [eq, body] = HOLogic.dest_conj conj |
55437 | 1732 |
val rhs = |
1733 |
(case HOLogic.dest_eq eq of |
|
42094
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1734 |
(Bound i, rhs) => if i = length Ts then rhs else raise TERM ("dest_special_compr", [t]) |
55437 | 1735 |
| _ => raise TERM ("dest_special_compr", [t])) |
42094
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1736 |
val output_names = Name.variant_list (fold Term.add_free_names [rhs, body] []) |
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1737 |
(map (fn i => "x" ^ string_of_int i) (1 upto length Ts)) |
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1738 |
val output_frees = map2 (curry Free) output_names (rev Ts) |
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1739 |
val body = subst_bounds (output_frees, body) |
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1740 |
val output = subst_bounds (output_frees, rhs) |
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1741 |
in |
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1742 |
(((body, output), T_compr), output_names) |
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1743 |
end |
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1744 |
|
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1745 |
fun dest_general_compr ctxt t_compr = |
55437 | 1746 |
let |
1747 |
val inner_t = |
|
1748 |
(case t_compr of |
|
1749 |
(Const (@{const_name Collect}, _) $ t) => t |
|
1750 |
| _ => error ("Not a set comprehension: " ^ Syntax.string_of_term ctxt t_compr)) |
|
42094
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1751 |
val (body, Ts, fp) = HOLogic.strip_psplits inner_t; |
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1752 |
val output_names = Name.variant_list (Term.add_free_names body []) |
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1753 |
(map (fn i => "x" ^ string_of_int i) (1 upto length Ts)) |
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1754 |
val output_frees = map2 (curry Free) output_names (rev Ts) |
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1755 |
val body = subst_bounds (output_frees, body) |
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1756 |
val T_compr = HOLogic.mk_ptupleT fp Ts |
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1757 |
val output = HOLogic.mk_ptuple fp T_compr (rev output_frees) |
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1758 |
in |
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1759 |
(((body, output), T_compr), output_names) |
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1760 |
end |
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1761 |
|
32667 | 1762 |
(*FIXME turn this into an LCF-guarded preprocessor for comprehensions*) |
40102
a9e4e94b3022
restructuring values command and adding generator compilation
bulwahn
parents:
40053
diff
changeset
|
1763 |
fun analyze_compr ctxt (comp_modifiers, additional_arguments) param_user_modes |
50056 | 1764 |
(compilation, _) t_compr = |
32667 | 1765 |
let |
40102
a9e4e94b3022
restructuring values command and adding generator compilation
bulwahn
parents:
40053
diff
changeset
|
1766 |
val compfuns = Comp_Mod.compfuns comp_modifiers |
61114 | 1767 |
val all_modes_of = Core_Data.all_modes_of compilation |
42094
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1768 |
val (((body, output), T_compr), output_names) = |
55437 | 1769 |
(case try dest_special_compr t_compr of |
1770 |
SOME r => r |
|
1771 |
| NONE => dest_general_compr ctxt t_compr) |
|
50056 | 1772 |
val (Const (name, _), all_args) = |
55437 | 1773 |
(case strip_comb body of |
36031
199fe16cdaab
returning an more understandable user error message in the values command
bulwahn
parents:
36030
diff
changeset
|
1774 |
(Const (name, T), all_args) => (Const (name, T), all_args) |
55437 | 1775 |
| (head, _) => error ("Not a constant: " ^ Syntax.string_of_term ctxt head)) |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1776 |
in |
61114 | 1777 |
if Core_Data.defined_functions compilation ctxt name then |
32668
b2de45007537
added first prototype of the extended predicate compiler
bulwahn
parents:
32667
diff
changeset
|
1778 |
let |
55437 | 1779 |
fun extract_mode (Const (@{const_name Pair}, _) $ t1 $ t2) = |
1780 |
Pair (extract_mode t1, extract_mode t2) |
|
1781 |
| extract_mode (Free (x, _)) = |
|
1782 |
if member (op =) output_names x then Output else Input |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1783 |
| extract_mode _ = Input |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1784 |
val user_mode = fold_rev (curry Fun) (map extract_mode all_args) Bool |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1785 |
fun valid modes1 modes2 = |
55437 | 1786 |
(case int_ord (length modes1, length modes2) of |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1787 |
GREATER => error "Not enough mode annotations" |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1788 |
| LESS => error "Too many mode annotations" |
55437 | 1789 |
| EQUAL => |
1790 |
forall (fn (_, NONE) => true | (m, SOME m2) => eq_mode (m, m2)) (modes1 ~~ modes2)) |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1791 |
fun mode_instance_of (m1, m2) = |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1792 |
let |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1793 |
fun instance_of (Fun _, Input) = true |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1794 |
| instance_of (Input, Input) = true |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1795 |
| instance_of (Output, Output) = true |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1796 |
| instance_of (Pair (m1, m2), Pair (m1', m2')) = |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1797 |
instance_of (m1, m1') andalso instance_of (m2, m2') |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1798 |
| instance_of (Pair (m1, m2), Input) = |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1799 |
instance_of (m1, Input) andalso instance_of (m2, Input) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1800 |
| instance_of (Pair (m1, m2), Output) = |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1801 |
instance_of (m1, Output) andalso instance_of (m2, Output) |
37002
34e73e8bab66
improved values command to handle a special case with tuples and polymorphic predicates more correctly
bulwahn
parents:
37001
diff
changeset
|
1802 |
| instance_of (Input, Pair (m1, m2)) = |
34e73e8bab66
improved values command to handle a special case with tuples and polymorphic predicates more correctly
bulwahn
parents:
37001
diff
changeset
|
1803 |
instance_of (Input, m1) andalso instance_of (Input, m2) |
34e73e8bab66
improved values command to handle a special case with tuples and polymorphic predicates more correctly
bulwahn
parents:
37001
diff
changeset
|
1804 |
| instance_of (Output, Pair (m1, m2)) = |
34e73e8bab66
improved values command to handle a special case with tuples and polymorphic predicates more correctly
bulwahn
parents:
37001
diff
changeset
|
1805 |
instance_of (Output, m1) andalso instance_of (Output, m2) |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1806 |
| instance_of _ = false |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1807 |
in forall instance_of (strip_fun_mode m1 ~~ strip_fun_mode m2) end |
37003
a393a588b82e
moving towards working with proof contexts in the predicate compiler
bulwahn
parents:
37002
diff
changeset
|
1808 |
val derivs = all_derivations_of ctxt (all_modes_of ctxt) [] body |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1809 |
|> filter (fn (d, missing_vars) => |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1810 |
let |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1811 |
val (p_mode :: modes) = collect_context_modes d |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1812 |
in |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1813 |
null missing_vars andalso |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1814 |
mode_instance_of (p_mode, user_mode) andalso |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1815 |
the_default true (Option.map (valid modes) param_user_modes) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1816 |
end) |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1817 |
|> map fst |
55437 | 1818 |
val deriv = |
1819 |
(case derivs of |
|
1820 |
[] => |
|
1821 |
error ("No mode possible for comprehension " ^ Syntax.string_of_term ctxt t_compr) |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1822 |
| [d] => d |
55437 | 1823 |
| d :: _ :: _ => |
1824 |
(warning ("Multiple modes possible for comprehension " ^ |
|
1825 |
Syntax.string_of_term ctxt t_compr); d)) |
|
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1826 |
val (_, outargs) = split_mode (head_mode_of deriv) all_args |
37003
a393a588b82e
moving towards working with proof contexts in the predicate compiler
bulwahn
parents:
37002
diff
changeset
|
1827 |
val t_pred = compile_expr comp_modifiers ctxt |
39648
655307cb8489
rewriting function mk_Eval_of in predicate compiler
bulwahn
parents:
39557
diff
changeset
|
1828 |
(body, deriv) [] additional_arguments; |
45461
130c90bb80b4
using more conventional names for monad plus operations
bulwahn
parents:
45452
diff
changeset
|
1829 |
val T_pred = dest_monadT compfuns (fastype_of t_pred) |
42094
e6867e9c6d10
allowing special set comprehensions in values command; adding an example for special set comprehension in values
bulwahn
parents:
42088
diff
changeset
|
1830 |
val arrange = HOLogic.tupled_lambda (HOLogic.mk_tuple outargs) output |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1831 |
in |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1832 |
if null outargs then t_pred else mk_map compfuns T_pred T_compr arrange t_pred |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1833 |
end |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1834 |
else |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1835 |
error "Evaluation with values is not possible because compilation with code_pred was not invoked" |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1836 |
end |
32667 | 1837 |
|
37003
a393a588b82e
moving towards working with proof contexts in the predicate compiler
bulwahn
parents:
37002
diff
changeset
|
1838 |
fun eval ctxt stats param_user_modes (options as (compilation, arguments)) k t_compr = |
32667 | 1839 |
let |
36027
29a15da9c63d
added statistics to values command for random generation
bulwahn
parents:
36025
diff
changeset
|
1840 |
fun count xs x = |
29a15da9c63d
added statistics to values command for random generation
bulwahn
parents:
36025
diff
changeset
|
1841 |
let |
29a15da9c63d
added statistics to values command for random generation
bulwahn
parents:
36025
diff
changeset
|
1842 |
fun count' i [] = i |
29a15da9c63d
added statistics to values command for random generation
bulwahn
parents:
36025
diff
changeset
|
1843 |
| count' i (x' :: xs) = if x = x' then count' (i + 1) xs else count' i xs |
29a15da9c63d
added statistics to values command for random generation
bulwahn
parents:
36025
diff
changeset
|
1844 |
in count' 0 xs end |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
1845 |
fun accumulate xs = (map (fn x => (x, count xs x)) o sort int_ord o distinct (op =)) xs; |
40102
a9e4e94b3022
restructuring values command and adding generator compilation
bulwahn
parents:
40053
diff
changeset
|
1846 |
val comp_modifiers = |
55437 | 1847 |
(case compilation of |
1848 |
Pred => predicate_comp_modifiers |
|
1849 |
| Random => random_comp_modifiers |
|
1850 |
| Depth_Limited => depth_limited_comp_modifiers |
|
1851 |
| Depth_Limited_Random => depth_limited_random_comp_modifiers |
|
1852 |
(*| Annotated => annotated_comp_modifiers*) |
|
1853 |
| DSeq => dseq_comp_modifiers |
|
1854 |
| Pos_Random_DSeq => pos_random_dseq_comp_modifiers |
|
1855 |
| New_Pos_Random_DSeq => new_pos_random_dseq_comp_modifiers |
|
1856 |
| Pos_Generator_DSeq => pos_generator_dseq_comp_modifiers) |
|
40102
a9e4e94b3022
restructuring values command and adding generator compilation
bulwahn
parents:
40053
diff
changeset
|
1857 |
val compfuns = Comp_Mod.compfuns comp_modifiers |
a9e4e94b3022
restructuring values command and adding generator compilation
bulwahn
parents:
40053
diff
changeset
|
1858 |
val additional_arguments = |
55437 | 1859 |
(case compilation of |
40102
a9e4e94b3022
restructuring values command and adding generator compilation
bulwahn
parents:
40053
diff
changeset
|
1860 |
Pred => [] |
55437 | 1861 |
| Random => |
1862 |
map (HOLogic.mk_number @{typ "natural"}) arguments @ |
|
1863 |
[@{term "(1, 1) :: natural * natural"}] |
|
40102
a9e4e94b3022
restructuring values command and adding generator compilation
bulwahn
parents:
40053
diff
changeset
|
1864 |
| Annotated => [] |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
1865 |
| Depth_Limited => [HOLogic.mk_number @{typ "natural"} (hd arguments)] |
55437 | 1866 |
| Depth_Limited_Random => |
1867 |
map (HOLogic.mk_number @{typ "natural"}) arguments @ |
|
1868 |
[@{term "(1, 1) :: natural * natural"}] |
|
40102
a9e4e94b3022
restructuring values command and adding generator compilation
bulwahn
parents:
40053
diff
changeset
|
1869 |
| DSeq => [] |
a9e4e94b3022
restructuring values command and adding generator compilation
bulwahn
parents:
40053
diff
changeset
|
1870 |
| Pos_Random_DSeq => [] |
a9e4e94b3022
restructuring values command and adding generator compilation
bulwahn
parents:
40053
diff
changeset
|
1871 |
| New_Pos_Random_DSeq => [] |
55437 | 1872 |
| Pos_Generator_DSeq => []) |
1873 |
val t = |
|
1874 |
analyze_compr ctxt (comp_modifiers, additional_arguments) param_user_modes options t_compr |
|
1875 |
val T = dest_monadT compfuns (fastype_of t) |
|
36027
29a15da9c63d
added statistics to values command for random generation
bulwahn
parents:
36025
diff
changeset
|
1876 |
val t' = |
29a15da9c63d
added statistics to values command for random generation
bulwahn
parents:
36025
diff
changeset
|
1877 |
if stats andalso compilation = New_Pos_Random_DSeq then |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
1878 |
mk_map compfuns T (HOLogic.mk_prodT (HOLogic.termT, @{typ natural})) |
44241 | 1879 |
(absdummy T (HOLogic.mk_prod (HOLogic.term_of_const T $ Bound 0, |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
1880 |
@{term natural_of_nat} $ (HOLogic.size_const T $ Bound 0)))) t |
36027
29a15da9c63d
added statistics to values command for random generation
bulwahn
parents:
36025
diff
changeset
|
1881 |
else |
29a15da9c63d
added statistics to values command for random generation
bulwahn
parents:
36025
diff
changeset
|
1882 |
mk_map compfuns T HOLogic.termT (HOLogic.term_of_const T) t |
42141
2c255ba8f299
changing values_timeout from a static option to a dynamic option as required for testing with SML/NJ
bulwahn
parents:
42094
diff
changeset
|
1883 |
val time_limit = seconds (Config.get ctxt values_timeout) |
36027
29a15da9c63d
added statistics to values command for random generation
bulwahn
parents:
36025
diff
changeset
|
1884 |
val (ts, statistics) = |
40135 | 1885 |
(case compilation of |
35880
2623b23e41fc
a new simpler random compilation for the predicate compiler
bulwahn
parents:
35879
diff
changeset
|
1886 |
(* Random => |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1887 |
fst (Predicate.yieldn k |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1888 |
(Code_Eval.eval NONE ("Predicate_Compile_Core.random_eval_ref", random_eval_ref) |
33137
0d16c07f8d24
added option to generate random values to values command in the predicate compiler
bulwahn
parents:
33135
diff
changeset
|
1889 |
(fn proc => fn g => fn s => g s |>> Predicate.map proc) thy t' [] |
35880
2623b23e41fc
a new simpler random compilation for the predicate compiler
bulwahn
parents:
35879
diff
changeset
|
1890 |
|> Random_Engine.run))*) |
2623b23e41fc
a new simpler random compilation for the predicate compiler
bulwahn
parents:
35879
diff
changeset
|
1891 |
Pos_Random_DSeq => |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1892 |
let |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
1893 |
val [nrandom, size, depth] = map Code_Numeral.natural_of_integer arguments |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1894 |
in |
51126
df86080de4cb
reform of predicate compiler / quickcheck theories:
haftmann
parents:
50057
diff
changeset
|
1895 |
rpair NONE (TimeLimit.timeLimit time_limit (fn () => fst (Limited_Sequence.yieldn k |
59154 | 1896 |
(Code_Runtime.dynamic_value_strict |
1897 |
(get_dseq_random_result, put_dseq_random_result, |
|
1898 |
"Predicate_Compile_Core.put_dseq_random_result") |
|
1899 |
ctxt NONE |
|
1900 |
(fn proc => fn g => fn nrandom => fn size => fn s => |
|
1901 |
g nrandom size s |>> Limited_Sequence.map proc) |
|
39471 | 1902 |
t' [] nrandom size |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1903 |
|> Random_Engine.run) |
40135 | 1904 |
depth true)) ()) |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1905 |
end |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1906 |
| DSeq => |
51126
df86080de4cb
reform of predicate compiler / quickcheck theories:
haftmann
parents:
50057
diff
changeset
|
1907 |
rpair NONE (TimeLimit.timeLimit time_limit (fn () => fst (Limited_Sequence.yieldn k |
59154 | 1908 |
(Code_Runtime.dynamic_value_strict |
1909 |
(get_dseq_result, put_dseq_result, "Predicate_Compile_Core.put_dseq_result") |
|
1910 |
ctxt NONE Limited_Sequence.map t' []) |
|
1911 |
(Code_Numeral.natural_of_integer (the_single arguments)) true)) ()) |
|
40102
a9e4e94b3022
restructuring values command and adding generator compilation
bulwahn
parents:
40053
diff
changeset
|
1912 |
| Pos_Generator_DSeq => |
a9e4e94b3022
restructuring values command and adding generator compilation
bulwahn
parents:
40053
diff
changeset
|
1913 |
let |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
1914 |
val depth = Code_Numeral.natural_of_integer (the_single arguments) |
40102
a9e4e94b3022
restructuring values command and adding generator compilation
bulwahn
parents:
40053
diff
changeset
|
1915 |
in |
42141
2c255ba8f299
changing values_timeout from a static option to a dynamic option as required for testing with SML/NJ
bulwahn
parents:
42094
diff
changeset
|
1916 |
rpair NONE (TimeLimit.timeLimit time_limit (fn () => fst (Lazy_Sequence.yieldn k |
59154 | 1917 |
(Code_Runtime.dynamic_value_strict |
1918 |
(get_new_dseq_result, put_new_dseq_result, |
|
1919 |
"Predicate_Compile_Core.put_new_dseq_result") |
|
1920 |
ctxt NONE (fn proc => fn g => fn depth => g depth |> Lazy_Sequence.map proc) |
|
1921 |
t' [] depth))) ()) |
|
40102
a9e4e94b3022
restructuring values command and adding generator compilation
bulwahn
parents:
40053
diff
changeset
|
1922 |
end |
36020
3ee4c29ead7f
adding values command for new monad; added new random monad compilation to predicate_compile_quickcheck
bulwahn
parents:
36019
diff
changeset
|
1923 |
| New_Pos_Random_DSeq => |
3ee4c29ead7f
adding values command for new monad; added new random monad compilation to predicate_compile_quickcheck
bulwahn
parents:
36019
diff
changeset
|
1924 |
let |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
1925 |
val [nrandom, size, depth] = map Code_Numeral.natural_of_integer arguments |
36020
3ee4c29ead7f
adding values command for new monad; added new random monad compilation to predicate_compile_quickcheck
bulwahn
parents:
36019
diff
changeset
|
1926 |
val seed = Random_Engine.next_seed () |
3ee4c29ead7f
adding values command for new monad; added new random monad compilation to predicate_compile_quickcheck
bulwahn
parents:
36019
diff
changeset
|
1927 |
in |
36027
29a15da9c63d
added statistics to values command for random generation
bulwahn
parents:
36025
diff
changeset
|
1928 |
if stats then |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
1929 |
apsnd (SOME o accumulate o map Code_Numeral.integer_of_natural) |
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
1930 |
(split_list (TimeLimit.timeLimit time_limit |
40135 | 1931 |
(fn () => fst (Lazy_Sequence.yieldn k |
39471 | 1932 |
(Code_Runtime.dynamic_value_strict |
59154 | 1933 |
(get_lseq_random_stats_result, put_lseq_random_stats_result, |
1934 |
"Predicate_Compile_Core.put_lseq_random_stats_result") |
|
55757 | 1935 |
ctxt NONE |
59154 | 1936 |
(fn proc => fn g => fn nrandom => fn size => fn s => fn depth => |
1937 |
g nrandom size s depth |
|
51126
df86080de4cb
reform of predicate compiler / quickcheck theories:
haftmann
parents:
50057
diff
changeset
|
1938 |
|> Lazy_Sequence.map (apfst proc)) |
40135 | 1939 |
t' [] nrandom size seed depth))) ())) |
36027
29a15da9c63d
added statistics to values command for random generation
bulwahn
parents:
36025
diff
changeset
|
1940 |
else rpair NONE |
42141
2c255ba8f299
changing values_timeout from a static option to a dynamic option as required for testing with SML/NJ
bulwahn
parents:
42094
diff
changeset
|
1941 |
(TimeLimit.timeLimit time_limit (fn () => fst (Lazy_Sequence.yieldn k |
39471 | 1942 |
(Code_Runtime.dynamic_value_strict |
59154 | 1943 |
(get_lseq_random_result, put_lseq_random_result, |
1944 |
"Predicate_Compile_Core.put_lseq_random_result") |
|
1945 |
ctxt NONE |
|
1946 |
(fn proc => fn g => fn nrandom => fn size => fn s => fn depth => |
|
1947 |
g nrandom size s depth |
|
1948 |
|> Lazy_Sequence.map proc) |
|
1949 |
t' [] nrandom size seed depth))) ()) |
|
36020
3ee4c29ead7f
adding values command for new monad; added new random monad compilation to predicate_compile_quickcheck
bulwahn
parents:
36019
diff
changeset
|
1950 |
end |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1951 |
| _ => |
42141
2c255ba8f299
changing values_timeout from a static option to a dynamic option as required for testing with SML/NJ
bulwahn
parents:
42094
diff
changeset
|
1952 |
rpair NONE (TimeLimit.timeLimit time_limit (fn () => fst (Predicate.yieldn k |
59154 | 1953 |
(Code_Runtime.dynamic_value_strict |
1954 |
(get_pred_result, put_pred_result, "Predicate_Compile_Core.put_pred_result") |
|
55757 | 1955 |
ctxt NONE Predicate.map t' []))) ())) |
40135 | 1956 |
handle TimeLimit.TimeOut => error "Reached timeout during execution of values" |
36027
29a15da9c63d
added statistics to values command for random generation
bulwahn
parents:
36025
diff
changeset
|
1957 |
in ((T, ts), statistics) end; |
29a15da9c63d
added statistics to values command for random generation
bulwahn
parents:
36025
diff
changeset
|
1958 |
|
43123
28e6351b2f8e
creating a free variable with proper name and local mixfix syntax (cf. db9b9e46131c)
bulwahn
parents:
42616
diff
changeset
|
1959 |
fun values param_user_modes ((raw_expected, stats), comp_options) k t_compr ctxt = |
32667 | 1960 |
let |
37003
a393a588b82e
moving towards working with proof contexts in the predicate compiler
bulwahn
parents:
37002
diff
changeset
|
1961 |
val ((T, ts), statistics) = eval ctxt stats param_user_modes comp_options k t_compr |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1962 |
val setT = HOLogic.mk_setT T |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1963 |
val elems = HOLogic.mk_set T ts |
43123
28e6351b2f8e
creating a free variable with proper name and local mixfix syntax (cf. db9b9e46131c)
bulwahn
parents:
42616
diff
changeset
|
1964 |
val ([dots], ctxt') = |
55437 | 1965 |
Proof_Context.add_fixes [(@{binding dots}, SOME setT, Mixfix ("...", [], 1000))] ctxt |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1966 |
(* check expected values *) |
43123
28e6351b2f8e
creating a free variable with proper name and local mixfix syntax (cf. db9b9e46131c)
bulwahn
parents:
42616
diff
changeset
|
1967 |
val union = Const (@{const_abbrev Set.union}, setT --> setT --> setT) |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1968 |
val () = |
55437 | 1969 |
(case raw_expected of |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1970 |
NONE => () |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1971 |
| SOME s => |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1972 |
if eq_set (op =) (HOLogic.dest_set (Syntax.read_term ctxt s), ts) then () |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1973 |
else |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1974 |
error ("expected and computed values do not match:\n" ^ |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1975 |
"expected values: " ^ Syntax.string_of_term ctxt (Syntax.read_term ctxt s) ^ "\n" ^ |
55437 | 1976 |
"computed values: " ^ Syntax.string_of_term ctxt elems ^ "\n")) |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1977 |
in |
55437 | 1978 |
((if k = ~1 orelse length ts < k then elems else union $ elems $ Free (dots, setT), statistics), |
1979 |
ctxt') |
|
32667 | 1980 |
end; |
33623
4ec42d38224f
changed modes to expected_modes; added UNION to code_pred_inlining; fixed some examples; tuned
bulwahn
parents:
33620
diff
changeset
|
1981 |
|
33479
428ddcc16e7b
added optional mode annotations for parameters in the values command
bulwahn
parents:
33478
diff
changeset
|
1982 |
fun values_cmd print_modes param_user_modes options k raw_t state = |
32667 | 1983 |
let |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1984 |
val ctxt = Toplevel.context_of state |
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1985 |
val t = Syntax.read_term ctxt raw_t |
43123
28e6351b2f8e
creating a free variable with proper name and local mixfix syntax (cf. db9b9e46131c)
bulwahn
parents:
42616
diff
changeset
|
1986 |
val ((t', stats), ctxt') = values param_user_modes options k t ctxt |
34948
2d5f2a9f7601
refactoring the predicate compiler; adding theories for Sequences; adding retrieval to Spec_Rules; adding timing to Quickcheck
bulwahn
parents:
34028
diff
changeset
|
1987 |
val ty' = Term.type_of t' |
43123
28e6351b2f8e
creating a free variable with proper name and local mixfix syntax (cf. db9b9e46131c)
bulwahn
parents:
42616
diff
changeset
|
1988 |
val ctxt'' = Variable.auto_fixes t' ctxt' |
36027
29a15da9c63d
added statistics to values command for random generation
bulwahn
parents:
36025
diff
changeset
|
1989 |
val pretty_stat = |
55437 | 1990 |
(case stats of |
1991 |
NONE => [] |
|
1992 |
| SOME xs => |
|
36027
29a15da9c63d
added statistics to values command for random generation
bulwahn
parents:
36025
diff
changeset
|
1993 |
let |
29a15da9c63d
added statistics to values command for random generation
bulwahn
parents:
36025
diff
changeset
|
1994 |
val total = fold (curry (op +)) (map snd xs) 0 |
29a15da9c63d
added statistics to values command for random generation
bulwahn
parents:
36025
diff
changeset
|
1995 |
fun pretty_entry (s, n) = |
29a15da9c63d
added statistics to values command for random generation
bulwahn
parents:
36025
diff
changeset
|
1996 |
[Pretty.str "size", Pretty.brk 1, |
29a15da9c63d
added statistics to values command for random generation
bulwahn
parents:
36025
diff
changeset
|
1997 |
Pretty.str (string_of_int s), Pretty.str ":", Pretty.brk 1, |
29a15da9c63d
added statistics to values command for random generation
bulwahn
parents:
36025
diff
changeset
|
1998 |
Pretty.str (string_of_int n), Pretty.fbrk] |
29a15da9c63d
added statistics to values command for random generation
bulwahn
parents:
36025
diff
changeset
|
1999 |
in |
29a15da9c63d
added statistics to values command for random generation
bulwahn
parents:
36025
diff
changeset
|
2000 |
[Pretty.fbrk, Pretty.str "Statistics:", Pretty.fbrk, |
55437 | 2001 |
Pretty.str "total:", Pretty.brk 1, Pretty.str (string_of_int total), Pretty.fbrk] @ |
2002 |
maps pretty_entry xs |
|
2003 |
end) |
|
2004 |
in |
|
2005 |
Print_Mode.with_modes print_modes (fn () => |
|
43123
28e6351b2f8e
creating a free variable with proper name and local mixfix syntax (cf. db9b9e46131c)
bulwahn
parents:
42616
diff
changeset
|
2006 |
Pretty.block ([Pretty.quote (Syntax.pretty_term ctxt'' t'), Pretty.fbrk, |
28e6351b2f8e
creating a free variable with proper name and local mixfix syntax (cf. db9b9e46131c)
bulwahn
parents:
42616
diff
changeset
|
2007 |
Pretty.str "::", Pretty.brk 1, Pretty.quote (Syntax.pretty_typ ctxt'' ty')] |
55437 | 2008 |
@ pretty_stat)) () |
2009 |
end |> Pretty.writeln |
|
32667 | 2010 |
|
55437 | 2011 |
end |