wenzelm@33264
|
1 |
(* Title: HOL/Tools/Predicate_Compile/predicate_compile_core.ML
|
wenzelm@33264
|
2 |
Author: Lukas Bulwahn, TU Muenchen
|
bulwahn@32667
|
3 |
|
wenzelm@33264
|
4 |
A compiler from predicates specified by intro/elim rules to equations.
|
bulwahn@32667
|
5 |
*)
|
bulwahn@32667
|
6 |
|
bulwahn@32667
|
7 |
signature PREDICATE_COMPILE_CORE =
|
bulwahn@32667
|
8 |
sig
|
bulwahn@36048
|
9 |
type mode = Predicate_Compile_Aux.mode
|
bulwahn@36048
|
10 |
type options = Predicate_Compile_Aux.options
|
bulwahn@36048
|
11 |
type compilation = Predicate_Compile_Aux.compilation
|
bulwahn@36048
|
12 |
type compilation_funs = Predicate_Compile_Aux.compilation_funs
|
bulwahn@36048
|
13 |
|
bulwahn@33478
|
14 |
val setup : theory -> theory
|
bulwahn@36048
|
15 |
val code_pred : options -> string -> Proof.context -> Proof.state
|
bulwahn@36048
|
16 |
val code_pred_cmd : options -> string -> Proof.context -> Proof.state
|
bulwahn@36048
|
17 |
val values_cmd : string list -> mode option list option
|
bulwahn@36048
|
18 |
-> ((string option * bool) * (compilation * int list)) -> int -> string -> Toplevel.state -> unit
|
bulwahn@34935
|
19 |
val register_predicate : (string * thm list * thm) -> theory -> theory
|
bulwahn@33146
|
20 |
val register_intros : string * thm list -> theory -> theory
|
bulwahn@36994
|
21 |
val is_registered : Proof.context -> string -> bool
|
bulwahn@36994
|
22 |
val function_name_of : compilation -> Proof.context -> string -> mode -> string
|
bulwahn@36048
|
23 |
val predfun_intro_of: Proof.context -> string -> mode -> thm
|
bulwahn@36048
|
24 |
val predfun_elim_of: Proof.context -> string -> mode -> thm
|
bulwahn@36994
|
25 |
val all_preds_of : Proof.context -> string list
|
bulwahn@36994
|
26 |
val modes_of: compilation -> Proof.context -> string -> mode list
|
bulwahn@36994
|
27 |
val all_modes_of : compilation -> Proof.context -> (string * mode list) list
|
bulwahn@36994
|
28 |
val all_random_modes_of : Proof.context -> (string * mode list) list
|
bulwahn@33478
|
29 |
val intros_of : theory -> string -> thm list
|
bulwahn@33478
|
30 |
val add_intro : thm -> theory -> theory
|
bulwahn@33478
|
31 |
val set_elim : thm -> theory -> theory
|
bulwahn@36048
|
32 |
val register_alternative_function : string -> mode -> string -> theory -> theory
|
bulwahn@36994
|
33 |
val alternative_compilation_of_global : theory -> string -> mode ->
|
bulwahn@36994
|
34 |
(compilation_funs -> typ -> term) option
|
bulwahn@36994
|
35 |
val alternative_compilation_of : Proof.context -> string -> mode ->
|
bulwahn@36032
|
36 |
(compilation_funs -> typ -> term) option
|
bulwahn@36048
|
37 |
val functional_compilation : string -> mode -> compilation_funs -> typ -> term
|
bulwahn@36048
|
38 |
val force_modes_and_functions : string -> (mode * (string * bool)) list -> theory -> theory
|
bulwahn@36032
|
39 |
val force_modes_and_compilations : string ->
|
bulwahn@36048
|
40 |
(mode * ((compilation_funs -> typ -> term) * bool)) list -> theory -> theory
|
bulwahn@34935
|
41 |
val preprocess_intro : theory -> thm -> thm
|
bulwahn@33478
|
42 |
val print_stored_rules : theory -> unit
|
bulwahn@36994
|
43 |
val print_all_modes : compilation -> Proof.context -> unit
|
bulwahn@34935
|
44 |
val mk_casesrule : Proof.context -> term -> thm list -> term
|
bulwahn@33137
|
45 |
val eval_ref : (unit -> term Predicate.pred) option Unsynchronized.ref
|
bulwahn@33482
|
46 |
val random_eval_ref : (unit -> int * int -> term Predicate.pred * (int * int))
|
bulwahn@33482
|
47 |
option Unsynchronized.ref
|
bulwahn@34935
|
48 |
val dseq_eval_ref : (unit -> term DSequence.dseq) option Unsynchronized.ref
|
bulwahn@34935
|
49 |
val random_dseq_eval_ref : (unit -> int -> int -> int * int -> term DSequence.dseq * (int * int))
|
bulwahn@34935
|
50 |
option Unsynchronized.ref
|
bulwahn@36014
|
51 |
val new_random_dseq_eval_ref :
|
bulwahn@36014
|
52 |
(unit -> int -> int -> int * int -> int -> term Lazy_Sequence.lazy_sequence)
|
bulwahn@36014
|
53 |
option Unsynchronized.ref
|
bulwahn@36021
|
54 |
val new_random_dseq_stats_eval_ref :
|
bulwahn@36021
|
55 |
(unit -> int -> int -> int * int -> int -> (term * int) Lazy_Sequence.lazy_sequence)
|
bulwahn@36021
|
56 |
option Unsynchronized.ref
|
bulwahn@33628
|
57 |
val code_pred_intro_attrib : attribute
|
bulwahn@32667
|
58 |
(* used by Quickcheck_Generator *)
|
bulwahn@32667
|
59 |
(* temporary for testing of the compilation *)
|
bulwahn@36048
|
60 |
val add_equations : options -> string list -> theory -> theory
|
bulwahn@36048
|
61 |
val add_depth_limited_random_equations : options -> string list -> theory -> theory
|
bulwahn@36048
|
62 |
val add_random_dseq_equations : options -> string list -> theory -> theory
|
bulwahn@36048
|
63 |
val add_new_random_dseq_equations : options -> string list -> theory -> theory
|
bulwahn@33473
|
64 |
val mk_tracing : string -> term -> term
|
bulwahn@32667
|
65 |
end;
|
bulwahn@32667
|
66 |
|
bulwahn@32667
|
67 |
structure Predicate_Compile_Core : PREDICATE_COMPILE_CORE =
|
bulwahn@32667
|
68 |
struct
|
bulwahn@32667
|
69 |
|
bulwahn@32668
|
70 |
open Predicate_Compile_Aux;
|
bulwahn@33144
|
71 |
|
bulwahn@32667
|
72 |
(** auxiliary **)
|
bulwahn@32667
|
73 |
|
bulwahn@32667
|
74 |
(* debug stuff *)
|
bulwahn@32667
|
75 |
|
bulwahn@35886
|
76 |
fun print_tac options s =
|
bulwahn@33127
|
77 |
if show_proof_trace options then Tactical.print_tac s else Seq.single;
|
bulwahn@33127
|
78 |
|
bulwahn@35885
|
79 |
fun assert b = if not b then raise Fail "Assertion failed" else warning "Assertion holds"
|
bulwahn@34935
|
80 |
|
bulwahn@33108
|
81 |
datatype assertion = Max_number_of_subgoals of int
|
bulwahn@33108
|
82 |
fun assert_tac (Max_number_of_subgoals i) st =
|
bulwahn@33108
|
83 |
if (nprems_of st <= i) then Seq.single st
|
bulwahn@35885
|
84 |
else raise Fail ("assert_tac: Numbers of subgoals mismatch at goal state :"
|
bulwahn@33108
|
85 |
^ "\n" ^ Pretty.string_of (Pretty.chunks
|
bulwahn@33108
|
86 |
(Goal_Display.pretty_goals_without_context (! Goal_Display.goals_limit) st)));
|
bulwahn@33108
|
87 |
|
bulwahn@32667
|
88 |
(** fundamentals **)
|
bulwahn@32667
|
89 |
|
bulwahn@32667
|
90 |
(* syntactic operations *)
|
bulwahn@32667
|
91 |
|
bulwahn@32667
|
92 |
fun mk_eq (x, xs) =
|
bulwahn@32667
|
93 |
let fun mk_eqs _ [] = []
|
bulwahn@32667
|
94 |
| mk_eqs a (b::cs) =
|
bulwahn@32667
|
95 |
HOLogic.mk_eq (Free (a, fastype_of b), b) :: mk_eqs a cs
|
bulwahn@32667
|
96 |
in mk_eqs x xs end;
|
bulwahn@32667
|
97 |
|
bulwahn@32667
|
98 |
fun mk_scomp (t, u) =
|
bulwahn@32667
|
99 |
let
|
bulwahn@32667
|
100 |
val T = fastype_of t
|
bulwahn@32667
|
101 |
val U = fastype_of u
|
bulwahn@32667
|
102 |
val [A] = binder_types T
|
bulwahn@34935
|
103 |
val D = body_type U
|
bulwahn@32667
|
104 |
in
|
bulwahn@32667
|
105 |
Const (@{const_name "scomp"}, T --> U --> A --> D) $ t $ u
|
bulwahn@32667
|
106 |
end;
|
bulwahn@32667
|
107 |
|
bulwahn@32667
|
108 |
fun dest_funT (Type ("fun",[S, T])) = (S, T)
|
bulwahn@32667
|
109 |
| dest_funT T = raise TYPE ("dest_funT", [T], [])
|
bulwahn@32667
|
110 |
|
bulwahn@32667
|
111 |
fun mk_fun_comp (t, u) =
|
bulwahn@32667
|
112 |
let
|
bulwahn@32667
|
113 |
val (_, B) = dest_funT (fastype_of t)
|
bulwahn@32667
|
114 |
val (C, A) = dest_funT (fastype_of u)
|
bulwahn@32667
|
115 |
in
|
bulwahn@32667
|
116 |
Const(@{const_name "Fun.comp"}, (A --> B) --> (C --> A) --> C --> B) $ t $ u
|
bulwahn@32667
|
117 |
end;
|
bulwahn@32667
|
118 |
|
bulwahn@32667
|
119 |
fun dest_randomT (Type ("fun", [@{typ Random.seed},
|
bulwahn@32674
|
120 |
Type ("*", [Type ("*", [T, @{typ "unit => Code_Evaluation.term"}]) ,@{typ Random.seed}])])) = T
|
bulwahn@32667
|
121 |
| dest_randomT T = raise TYPE ("dest_randomT", [T], [])
|
bulwahn@32667
|
122 |
|
bulwahn@33473
|
123 |
fun mk_tracing s t =
|
bulwahn@33473
|
124 |
Const(@{const_name Code_Evaluation.tracing},
|
bulwahn@33473
|
125 |
@{typ String.literal} --> (fastype_of t) --> (fastype_of t)) $ (HOLogic.mk_literal s) $ t
|
bulwahn@33473
|
126 |
|
bulwahn@34935
|
127 |
val strip_intro_concl = (strip_comb o HOLogic.dest_Trueprop o Logic.strip_imp_concl o prop_of)
|
bulwahn@32667
|
128 |
|
bulwahn@34935
|
129 |
(* derivation trees for modes of premises *)
|
bulwahn@34935
|
130 |
|
bulwahn@34935
|
131 |
datatype mode_derivation = Mode_App of mode_derivation * mode_derivation | Context of mode
|
bulwahn@34935
|
132 |
| Mode_Pair of mode_derivation * mode_derivation | Term of mode
|
bulwahn@34935
|
133 |
|
bulwahn@34935
|
134 |
fun string_of_derivation (Mode_App (m1, m2)) =
|
bulwahn@34935
|
135 |
"App (" ^ string_of_derivation m1 ^ ", " ^ string_of_derivation m2 ^ ")"
|
bulwahn@34935
|
136 |
| string_of_derivation (Mode_Pair (m1, m2)) =
|
bulwahn@34935
|
137 |
"Pair (" ^ string_of_derivation m1 ^ ", " ^ string_of_derivation m2 ^ ")"
|
bulwahn@34935
|
138 |
| string_of_derivation (Term m) = "Term (" ^ string_of_mode m ^ ")"
|
bulwahn@34935
|
139 |
| string_of_derivation (Context m) = "Context (" ^ string_of_mode m ^ ")"
|
bulwahn@34935
|
140 |
|
bulwahn@34935
|
141 |
fun strip_mode_derivation deriv =
|
bulwahn@33619
|
142 |
let
|
bulwahn@34935
|
143 |
fun strip (Mode_App (deriv1, deriv2)) ds = strip deriv1 (deriv2 :: ds)
|
bulwahn@34935
|
144 |
| strip deriv ds = (deriv, ds)
|
bulwahn@34935
|
145 |
in
|
bulwahn@34935
|
146 |
strip deriv []
|
bulwahn@34935
|
147 |
end
|
bulwahn@32667
|
148 |
|
bulwahn@34935
|
149 |
fun mode_of (Context m) = m
|
bulwahn@34935
|
150 |
| mode_of (Term m) = m
|
bulwahn@34935
|
151 |
| mode_of (Mode_App (d1, d2)) =
|
bulwahn@34935
|
152 |
(case mode_of d1 of Fun (m, m') =>
|
bulwahn@35885
|
153 |
(if eq_mode (m, mode_of d2) then m' else raise Fail "mode_of")
|
bulwahn@35885
|
154 |
| _ => raise Fail "mode_of2")
|
bulwahn@34935
|
155 |
| mode_of (Mode_Pair (d1, d2)) =
|
bulwahn@34935
|
156 |
Pair (mode_of d1, mode_of d2)
|
bulwahn@32667
|
157 |
|
bulwahn@34935
|
158 |
fun head_mode_of deriv = mode_of (fst (strip_mode_derivation deriv))
|
bulwahn@34935
|
159 |
|
bulwahn@34935
|
160 |
fun param_derivations_of deriv =
|
bulwahn@32667
|
161 |
let
|
bulwahn@34935
|
162 |
val (_, argument_derivs) = strip_mode_derivation deriv
|
bulwahn@34935
|
163 |
fun param_derivation (Mode_Pair (m1, m2)) =
|
bulwahn@34935
|
164 |
param_derivation m1 @ param_derivation m2
|
bulwahn@34935
|
165 |
| param_derivation (Term _) = []
|
bulwahn@34935
|
166 |
| param_derivation m = [m]
|
bulwahn@34935
|
167 |
in
|
bulwahn@34935
|
168 |
maps param_derivation argument_derivs
|
bulwahn@34935
|
169 |
end
|
bulwahn@32667
|
170 |
|
bulwahn@34935
|
171 |
fun collect_context_modes (Mode_App (m1, m2)) =
|
bulwahn@34935
|
172 |
collect_context_modes m1 @ collect_context_modes m2
|
bulwahn@34935
|
173 |
| collect_context_modes (Mode_Pair (m1, m2)) =
|
bulwahn@34935
|
174 |
collect_context_modes m1 @ collect_context_modes m2
|
bulwahn@34935
|
175 |
| collect_context_modes (Context m) = [m]
|
bulwahn@34935
|
176 |
| collect_context_modes (Term _) = []
|
bulwahn@32667
|
177 |
|
bulwahn@34935
|
178 |
(* representation of inferred clauses with modes *)
|
bulwahn@32667
|
179 |
|
bulwahn@34935
|
180 |
type moded_clause = term list * (indprem * mode_derivation) list
|
bulwahn@32668
|
181 |
|
bulwahn@35324
|
182 |
type 'a pred_mode_table = (string * ((bool * mode) * 'a) list) list
|
bulwahn@32667
|
183 |
|
bulwahn@34935
|
184 |
(* book-keeping *)
|
bulwahn@34935
|
185 |
|
bulwahn@32667
|
186 |
datatype predfun_data = PredfunData of {
|
bulwahn@32667
|
187 |
definition : thm,
|
bulwahn@32667
|
188 |
intro : thm,
|
bulwahn@35884
|
189 |
elim : thm,
|
bulwahn@35884
|
190 |
neg_intro : thm option
|
bulwahn@32667
|
191 |
};
|
bulwahn@32667
|
192 |
|
bulwahn@32667
|
193 |
fun rep_predfun_data (PredfunData data) = data;
|
bulwahn@32667
|
194 |
|
bulwahn@35884
|
195 |
fun mk_predfun_data (definition, ((intro, elim), neg_intro)) =
|
bulwahn@35884
|
196 |
PredfunData {definition = definition, intro = intro, elim = elim, neg_intro = neg_intro}
|
bulwahn@32667
|
197 |
|
bulwahn@32667
|
198 |
datatype pred_data = PredData of {
|
bulwahn@32667
|
199 |
intros : thm list,
|
bulwahn@32667
|
200 |
elim : thm option,
|
bulwahn@34935
|
201 |
function_names : (compilation * (mode * string) list) list,
|
bulwahn@34935
|
202 |
predfun_data : (mode * predfun_data) list,
|
bulwahn@34935
|
203 |
needs_random : mode list
|
bulwahn@32667
|
204 |
};
|
bulwahn@32667
|
205 |
|
bulwahn@32667
|
206 |
fun rep_pred_data (PredData data) = data;
|
bulwahn@34935
|
207 |
|
bulwahn@35887
|
208 |
fun mk_pred_data ((intros, elim), (function_names, (predfun_data, needs_random))) =
|
bulwahn@34935
|
209 |
PredData {intros = intros, elim = elim,
|
bulwahn@34935
|
210 |
function_names = function_names, predfun_data = predfun_data, needs_random = needs_random}
|
bulwahn@34935
|
211 |
|
bulwahn@34935
|
212 |
fun map_pred_data f (PredData {intros, elim, function_names, predfun_data, needs_random}) =
|
bulwahn@35887
|
213 |
mk_pred_data (f ((intros, elim), (function_names, (predfun_data, needs_random))))
|
bulwahn@33144
|
214 |
|
bulwahn@32667
|
215 |
fun eq_option eq (NONE, NONE) = true
|
bulwahn@32667
|
216 |
| eq_option eq (SOME x, SOME y) = eq (x, y)
|
bulwahn@32667
|
217 |
| eq_option eq _ = false
|
bulwahn@33144
|
218 |
|
bulwahn@32667
|
219 |
fun eq_pred_data (PredData d1, PredData d2) =
|
bulwahn@35885
|
220 |
eq_list Thm.eq_thm (#intros d1, #intros d2) andalso
|
bulwahn@35885
|
221 |
eq_option Thm.eq_thm (#elim d1, #elim d2)
|
bulwahn@33144
|
222 |
|
wenzelm@33522
|
223 |
structure PredData = Theory_Data
|
bulwahn@32667
|
224 |
(
|
bulwahn@32667
|
225 |
type T = pred_data Graph.T;
|
bulwahn@32667
|
226 |
val empty = Graph.empty;
|
bulwahn@32667
|
227 |
val extend = I;
|
wenzelm@33522
|
228 |
val merge = Graph.merge eq_pred_data;
|
bulwahn@32667
|
229 |
);
|
bulwahn@32667
|
230 |
|
bulwahn@32667
|
231 |
(* queries *)
|
bulwahn@32667
|
232 |
|
bulwahn@32667
|
233 |
fun lookup_pred_data thy name =
|
bulwahn@32667
|
234 |
Option.map rep_pred_data (try (Graph.get_node (PredData.get thy)) name)
|
bulwahn@32667
|
235 |
|
bulwahn@32667
|
236 |
fun the_pred_data thy name = case lookup_pred_data thy name
|
bulwahn@32667
|
237 |
of NONE => error ("No such predicate " ^ quote name)
|
bulwahn@32667
|
238 |
| SOME data => data;
|
bulwahn@32667
|
239 |
|
bulwahn@36994
|
240 |
val is_registered = is_some oo lookup_pred_data o ProofContext.theory_of
|
bulwahn@32667
|
241 |
|
bulwahn@36994
|
242 |
val all_preds_of = Graph.keys o PredData.get o ProofContext.theory_of
|
bulwahn@32667
|
243 |
|
bulwahn@32667
|
244 |
fun intros_of thy = map (Thm.transfer thy) o #intros o the_pred_data thy
|
bulwahn@32667
|
245 |
|
bulwahn@32667
|
246 |
fun the_elim_of thy name = case #elim (the_pred_data thy name)
|
bulwahn@32667
|
247 |
of NONE => error ("No elimination rule for predicate " ^ quote name)
|
bulwahn@35888
|
248 |
| SOME thm => Thm.transfer thy thm
|
bulwahn@32667
|
249 |
|
bulwahn@32667
|
250 |
val has_elim = is_some o #elim oo the_pred_data;
|
bulwahn@32667
|
251 |
|
bulwahn@36994
|
252 |
fun function_names_of compilation ctxt name =
|
bulwahn@36994
|
253 |
case AList.lookup (op =) (#function_names (the_pred_data (ProofContext.theory_of ctxt) name)) compilation of
|
bulwahn@34935
|
254 |
NONE => error ("No " ^ string_of_compilation compilation
|
bulwahn@34935
|
255 |
^ "functions defined for predicate " ^ quote name)
|
bulwahn@34935
|
256 |
| SOME fun_names => fun_names
|
bulwahn@32667
|
257 |
|
bulwahn@36994
|
258 |
fun function_name_of compilation ctxt name mode =
|
bulwahn@35324
|
259 |
case AList.lookup eq_mode
|
bulwahn@36994
|
260 |
(function_names_of compilation ctxt name) mode of
|
bulwahn@34935
|
261 |
NONE => error ("No " ^ string_of_compilation compilation
|
bulwahn@36013
|
262 |
^ " function defined for mode " ^ string_of_mode mode ^ " of predicate " ^ quote name)
|
bulwahn@34935
|
263 |
| SOME function_name => function_name
|
bulwahn@32667
|
264 |
|
bulwahn@36994
|
265 |
fun modes_of compilation ctxt name = map fst (function_names_of compilation ctxt name)
|
bulwahn@32667
|
266 |
|
bulwahn@36994
|
267 |
fun all_modes_of compilation ctxt =
|
bulwahn@36994
|
268 |
map_filter (fn name => Option.map (pair name) (try (modes_of compilation ctxt) name))
|
bulwahn@36994
|
269 |
(all_preds_of ctxt)
|
bulwahn@34935
|
270 |
|
bulwahn@34935
|
271 |
val all_random_modes_of = all_modes_of Random
|
bulwahn@34935
|
272 |
|
bulwahn@36994
|
273 |
fun defined_functions compilation ctxt name = case lookup_pred_data (ProofContext.theory_of ctxt) name of
|
bulwahn@36992
|
274 |
NONE => false
|
bulwahn@36992
|
275 |
| SOME data => AList.defined (op =) (#function_names data) compilation
|
bulwahn@32667
|
276 |
|
bulwahn@36994
|
277 |
fun needs_random ctxt s m =
|
bulwahn@36994
|
278 |
member (op =) (#needs_random (the_pred_data (ProofContext.theory_of ctxt) s)) m
|
bulwahn@36994
|
279 |
|
bulwahn@32667
|
280 |
fun lookup_predfun_data thy name mode =
|
bulwahn@33483
|
281 |
Option.map rep_predfun_data
|
bulwahn@34935
|
282 |
(AList.lookup (op =) (#predfun_data (the_pred_data thy name)) mode)
|
bulwahn@32667
|
283 |
|
bulwahn@34935
|
284 |
fun the_predfun_data thy name mode =
|
bulwahn@34935
|
285 |
case lookup_predfun_data thy name mode of
|
bulwahn@34935
|
286 |
NONE => error ("No function defined for mode " ^ string_of_mode mode ^
|
bulwahn@34935
|
287 |
" of predicate " ^ name)
|
bulwahn@34935
|
288 |
| SOME data => data;
|
bulwahn@32667
|
289 |
|
bulwahn@35888
|
290 |
val predfun_definition_of = #definition ooo the_predfun_data o ProofContext.theory_of
|
bulwahn@32667
|
291 |
|
bulwahn@35888
|
292 |
val predfun_intro_of = #intro ooo the_predfun_data o ProofContext.theory_of
|
bulwahn@32667
|
293 |
|
bulwahn@35888
|
294 |
val predfun_elim_of = #elim ooo the_predfun_data o ProofContext.theory_of
|
bulwahn@32667
|
295 |
|
bulwahn@35888
|
296 |
val predfun_neg_intro_of = #neg_intro ooo the_predfun_data o ProofContext.theory_of
|
bulwahn@35884
|
297 |
|
bulwahn@32667
|
298 |
(* diagnostic display functions *)
|
bulwahn@32667
|
299 |
|
bulwahn@36995
|
300 |
fun print_modes options modes =
|
bulwahn@33243
|
301 |
if show_modes options then
|
bulwahn@33326
|
302 |
tracing ("Inferred modes:\n" ^
|
bulwahn@33243
|
303 |
cat_lines (map (fn (s, ms) => s ^ ": " ^ commas (map
|
bulwahn@35324
|
304 |
(fn (p, m) => string_of_mode m ^ (if p then "pos" else "neg")) ms)) modes))
|
bulwahn@33243
|
305 |
else ()
|
bulwahn@32667
|
306 |
|
bulwahn@36995
|
307 |
fun print_pred_mode_table string_of_entry pred_mode_table =
|
bulwahn@32667
|
308 |
let
|
bulwahn@35324
|
309 |
fun print_mode pred ((pol, mode), entry) = "mode : " ^ string_of_mode mode
|
bulwahn@33619
|
310 |
^ string_of_entry pred mode entry
|
bulwahn@32667
|
311 |
fun print_pred (pred, modes) =
|
bulwahn@32667
|
312 |
"predicate " ^ pred ^ ": " ^ cat_lines (map (print_mode pred) modes)
|
bulwahn@33326
|
313 |
val _ = tracing (cat_lines (map print_pred pred_mode_table))
|
bulwahn@32667
|
314 |
in () end;
|
bulwahn@32667
|
315 |
|
bulwahn@36994
|
316 |
fun string_of_prem ctxt (Prem t) =
|
bulwahn@36994
|
317 |
(Syntax.string_of_term ctxt t) ^ "(premise)"
|
bulwahn@36994
|
318 |
| string_of_prem ctxt (Negprem t) =
|
bulwahn@36994
|
319 |
(Syntax.string_of_term ctxt (HOLogic.mk_not t)) ^ "(negative premise)"
|
bulwahn@36994
|
320 |
| string_of_prem ctxt (Sidecond t) =
|
bulwahn@36994
|
321 |
(Syntax.string_of_term ctxt t) ^ "(sidecondition)"
|
bulwahn@36994
|
322 |
| string_of_prem ctxt _ = raise Fail "string_of_prem: unexpected input"
|
bulwahn@33130
|
323 |
|
bulwahn@36994
|
324 |
fun string_of_clause ctxt pred (ts, prems) =
|
bulwahn@33130
|
325 |
(space_implode " --> "
|
bulwahn@36994
|
326 |
(map (string_of_prem ctxt) prems)) ^ " --> " ^ pred ^ " "
|
bulwahn@36994
|
327 |
^ (space_implode " " (map (Syntax.string_of_term ctxt) ts))
|
bulwahn@33130
|
328 |
|
bulwahn@33139
|
329 |
fun print_compiled_terms options thy =
|
bulwahn@33139
|
330 |
if show_compilation options then
|
bulwahn@33139
|
331 |
print_pred_mode_table (fn _ => fn _ => Syntax.string_of_term_global thy) thy
|
bulwahn@33139
|
332 |
else K ()
|
bulwahn@33139
|
333 |
|
bulwahn@32667
|
334 |
fun print_stored_rules thy =
|
bulwahn@32667
|
335 |
let
|
bulwahn@32667
|
336 |
val preds = (Graph.keys o PredData.get) thy
|
bulwahn@32667
|
337 |
fun print pred () = let
|
bulwahn@32667
|
338 |
val _ = writeln ("predicate: " ^ pred)
|
bulwahn@32667
|
339 |
val _ = writeln ("introrules: ")
|
bulwahn@32667
|
340 |
val _ = fold (fn thm => fn u => writeln (Display.string_of_thm_global thy thm))
|
bulwahn@32667
|
341 |
(rev (intros_of thy pred)) ()
|
bulwahn@32667
|
342 |
in
|
bulwahn@32667
|
343 |
if (has_elim thy pred) then
|
bulwahn@32667
|
344 |
writeln ("elimrule: " ^ Display.string_of_thm_global thy (the_elim_of thy pred))
|
bulwahn@32667
|
345 |
else
|
bulwahn@32667
|
346 |
writeln ("no elimrule defined")
|
bulwahn@32667
|
347 |
end
|
bulwahn@32667
|
348 |
in
|
bulwahn@32667
|
349 |
fold print preds ()
|
bulwahn@32667
|
350 |
end;
|
bulwahn@32667
|
351 |
|
bulwahn@36994
|
352 |
fun print_all_modes compilation ctxt =
|
bulwahn@32667
|
353 |
let
|
bulwahn@32667
|
354 |
val _ = writeln ("Inferred modes:")
|
bulwahn@32667
|
355 |
fun print (pred, modes) u =
|
bulwahn@32667
|
356 |
let
|
bulwahn@32667
|
357 |
val _ = writeln ("predicate: " ^ pred)
|
bulwahn@34935
|
358 |
val _ = writeln ("modes: " ^ (commas (map string_of_mode modes)))
|
bulwahn@33619
|
359 |
in u end
|
bulwahn@32667
|
360 |
in
|
bulwahn@36994
|
361 |
fold print (all_modes_of compilation ctxt) ()
|
bulwahn@32667
|
362 |
end
|
bulwahn@33129
|
363 |
|
bulwahn@33132
|
364 |
(* validity checks *)
|
bulwahn@33752
|
365 |
(* EXPECTED MODE and PROPOSED_MODE are largely the same; define a clear semantics for those! *)
|
bulwahn@33132
|
366 |
|
bulwahn@33752
|
367 |
fun check_expected_modes preds options modes =
|
bulwahn@33752
|
368 |
case expected_modes options of
|
bulwahn@33752
|
369 |
SOME (s, ms) => (case AList.lookup (op =) modes s of
|
bulwahn@33752
|
370 |
SOME modes =>
|
bulwahn@33752
|
371 |
let
|
bulwahn@35324
|
372 |
val modes' = map snd modes
|
bulwahn@33752
|
373 |
in
|
bulwahn@34935
|
374 |
if not (eq_set eq_mode (ms, modes')) then
|
bulwahn@33752
|
375 |
error ("expected modes were not inferred:\n"
|
bulwahn@34935
|
376 |
^ " inferred modes for " ^ s ^ ": " ^ commas (map string_of_mode modes') ^ "\n"
|
bulwahn@34935
|
377 |
^ " expected modes for " ^ s ^ ": " ^ commas (map string_of_mode ms))
|
bulwahn@33752
|
378 |
else ()
|
bulwahn@33752
|
379 |
end
|
bulwahn@33752
|
380 |
| NONE => ())
|
bulwahn@33752
|
381 |
| NONE => ()
|
bulwahn@33752
|
382 |
|
bulwahn@33752
|
383 |
fun check_proposed_modes preds options modes extra_modes errors =
|
bulwahn@33752
|
384 |
case proposed_modes options of
|
bulwahn@33752
|
385 |
SOME (s, ms) => (case AList.lookup (op =) modes s of
|
bulwahn@33752
|
386 |
SOME inferred_ms =>
|
bulwahn@33752
|
387 |
let
|
bulwahn@33752
|
388 |
val preds_without_modes = map fst (filter (null o snd) (modes @ extra_modes))
|
bulwahn@35324
|
389 |
val modes' = map snd inferred_ms
|
bulwahn@33752
|
390 |
in
|
bulwahn@34935
|
391 |
if not (eq_set eq_mode (ms, modes')) then
|
bulwahn@33752
|
392 |
error ("expected modes were not inferred:\n"
|
bulwahn@34935
|
393 |
^ " inferred modes for " ^ s ^ ": " ^ commas (map string_of_mode modes') ^ "\n"
|
bulwahn@34935
|
394 |
^ " expected modes for " ^ s ^ ": " ^ commas (map string_of_mode ms) ^ "\n"
|
bulwahn@33752
|
395 |
^ "For the following clauses, the following modes could not be inferred: " ^ "\n"
|
bulwahn@33752
|
396 |
^ cat_lines errors ^
|
bulwahn@33752
|
397 |
(if not (null preds_without_modes) then
|
bulwahn@33752
|
398 |
"\n" ^ "No mode inferred for the predicates " ^ commas preds_without_modes
|
bulwahn@33752
|
399 |
else ""))
|
bulwahn@33752
|
400 |
else ()
|
bulwahn@33752
|
401 |
end
|
bulwahn@33752
|
402 |
| NONE => ())
|
bulwahn@33752
|
403 |
| NONE => ()
|
bulwahn@33132
|
404 |
|
bulwahn@33144
|
405 |
(* importing introduction rules *)
|
bulwahn@33129
|
406 |
|
bulwahn@33129
|
407 |
fun unify_consts thy cs intr_ts =
|
bulwahn@33129
|
408 |
(let
|
bulwahn@33129
|
409 |
val add_term_consts_2 = fold_aterms (fn Const c => insert (op =) c | _ => I);
|
bulwahn@33129
|
410 |
fun varify (t, (i, ts)) =
|
wenzelm@35845
|
411 |
let val t' = map_types (Logic.incr_tvar (i + 1)) (#2 (Type.varify_global [] t))
|
bulwahn@33129
|
412 |
in (maxidx_of_term t', t'::ts) end;
|
bulwahn@33150
|
413 |
val (i, cs') = List.foldr varify (~1, []) cs;
|
bulwahn@33150
|
414 |
val (i', intr_ts') = List.foldr varify (i, []) intr_ts;
|
bulwahn@33129
|
415 |
val rec_consts = fold add_term_consts_2 cs' [];
|
bulwahn@33129
|
416 |
val intr_consts = fold add_term_consts_2 intr_ts' [];
|
bulwahn@33129
|
417 |
fun unify (cname, cT) =
|
wenzelm@33325
|
418 |
let val consts = map snd (filter (fn c => fst c = cname) intr_consts)
|
bulwahn@33129
|
419 |
in fold (Sign.typ_unify thy) ((replicate (length consts) cT) ~~ consts) end;
|
bulwahn@33129
|
420 |
val (env, _) = fold unify rec_consts (Vartab.empty, i');
|
bulwahn@33129
|
421 |
val subst = map_types (Envir.norm_type env)
|
bulwahn@33129
|
422 |
in (map subst cs', map subst intr_ts')
|
bulwahn@33129
|
423 |
end) handle Type.TUNIFY =>
|
bulwahn@33129
|
424 |
(warning "Occurrences of recursive constant have non-unifiable types"; (cs, intr_ts));
|
bulwahn@33129
|
425 |
|
bulwahn@34935
|
426 |
fun import_intros inp_pred [] ctxt =
|
bulwahn@33146
|
427 |
let
|
bulwahn@34935
|
428 |
val ([outp_pred], ctxt') = Variable.import_terms true [inp_pred] ctxt
|
bulwahn@34935
|
429 |
val T = fastype_of outp_pred
|
bulwahn@34935
|
430 |
(* TODO: put in a function for this next line! *)
|
bulwahn@34935
|
431 |
val paramTs = ho_argsT_of (hd (all_modes_of_typ T)) (binder_types T)
|
bulwahn@34935
|
432 |
val (param_names, ctxt'') = Variable.variant_fixes
|
bulwahn@34935
|
433 |
(map (fn i => "p" ^ (string_of_int i)) (1 upto (length paramTs))) ctxt'
|
bulwahn@33629
|
434 |
val params = map2 (curry Free) param_names paramTs
|
bulwahn@34935
|
435 |
in
|
bulwahn@34935
|
436 |
(((outp_pred, params), []), ctxt')
|
bulwahn@34935
|
437 |
end
|
bulwahn@34935
|
438 |
| import_intros inp_pred (th :: ths) ctxt =
|
bulwahn@33129
|
439 |
let
|
bulwahn@34935
|
440 |
val ((_, [th']), ctxt') = Variable.import true [th] ctxt
|
bulwahn@33129
|
441 |
val thy = ProofContext.theory_of ctxt'
|
bulwahn@34935
|
442 |
val (pred, args) = strip_intro_concl th'
|
bulwahn@34935
|
443 |
val T = fastype_of pred
|
bulwahn@34935
|
444 |
val ho_args = ho_args_of (hd (all_modes_of_typ T)) args
|
bulwahn@33146
|
445 |
fun subst_of (pred', pred) =
|
bulwahn@33146
|
446 |
let
|
bulwahn@33146
|
447 |
val subst = Sign.typ_match thy (fastype_of pred', fastype_of pred) Vartab.empty
|
bulwahn@33146
|
448 |
in map (fn (indexname, (s, T)) => ((indexname, s), T)) (Vartab.dest subst) end
|
bulwahn@33129
|
449 |
fun instantiate_typ th =
|
bulwahn@33129
|
450 |
let
|
bulwahn@34935
|
451 |
val (pred', _) = strip_intro_concl th
|
bulwahn@33129
|
452 |
val _ = if not (fst (dest_Const pred) = fst (dest_Const pred')) then
|
bulwahn@35885
|
453 |
raise Fail "Trying to instantiate another predicate" else ()
|
bulwahn@33146
|
454 |
in Thm.certify_instantiate (subst_of (pred', pred), []) th end;
|
bulwahn@33129
|
455 |
fun instantiate_ho_args th =
|
bulwahn@33129
|
456 |
let
|
bulwahn@34935
|
457 |
val (_, args') = (strip_comb o HOLogic.dest_Trueprop o Logic.strip_imp_concl o prop_of) th
|
bulwahn@34935
|
458 |
val ho_args' = map dest_Var (ho_args_of (hd (all_modes_of_typ T)) args')
|
bulwahn@34935
|
459 |
in Thm.certify_instantiate ([], ho_args' ~~ ho_args) th end
|
bulwahn@33146
|
460 |
val outp_pred =
|
bulwahn@33146
|
461 |
Term_Subst.instantiate (subst_of (inp_pred, pred), []) inp_pred
|
bulwahn@33129
|
462 |
val ((_, ths'), ctxt1) =
|
bulwahn@33129
|
463 |
Variable.import false (map (instantiate_typ #> instantiate_ho_args) ths) ctxt'
|
bulwahn@33129
|
464 |
in
|
bulwahn@34935
|
465 |
(((outp_pred, ho_args), th' :: ths'), ctxt1)
|
bulwahn@33129
|
466 |
end
|
bulwahn@33129
|
467 |
|
bulwahn@33129
|
468 |
(* generation of case rules from user-given introduction rules *)
|
bulwahn@33129
|
469 |
|
bulwahn@34935
|
470 |
fun mk_args2 (Type ("*", [T1, T2])) st =
|
bulwahn@34935
|
471 |
let
|
bulwahn@34935
|
472 |
val (t1, st') = mk_args2 T1 st
|
bulwahn@34935
|
473 |
val (t2, st'') = mk_args2 T2 st'
|
bulwahn@34935
|
474 |
in
|
bulwahn@34935
|
475 |
(HOLogic.mk_prod (t1, t2), st'')
|
bulwahn@34935
|
476 |
end
|
bulwahn@35884
|
477 |
(*| mk_args2 (T as Type ("fun", _)) (params, ctxt) =
|
bulwahn@34935
|
478 |
let
|
bulwahn@34935
|
479 |
val (S, U) = strip_type T
|
bulwahn@34935
|
480 |
in
|
bulwahn@34935
|
481 |
if U = HOLogic.boolT then
|
bulwahn@34935
|
482 |
(hd params, (tl params, ctxt))
|
bulwahn@34935
|
483 |
else
|
bulwahn@34935
|
484 |
let
|
bulwahn@34935
|
485 |
val ([x], ctxt') = Variable.variant_fixes ["x"] ctxt
|
bulwahn@34935
|
486 |
in
|
bulwahn@34935
|
487 |
(Free (x, T), (params, ctxt'))
|
bulwahn@34935
|
488 |
end
|
bulwahn@35884
|
489 |
end*)
|
bulwahn@34935
|
490 |
| mk_args2 T (params, ctxt) =
|
bulwahn@34935
|
491 |
let
|
bulwahn@34935
|
492 |
val ([x], ctxt') = Variable.variant_fixes ["x"] ctxt
|
bulwahn@34935
|
493 |
in
|
bulwahn@34935
|
494 |
(Free (x, T), (params, ctxt'))
|
bulwahn@34935
|
495 |
end
|
bulwahn@35884
|
496 |
|
bulwahn@34935
|
497 |
fun mk_casesrule ctxt pred introrules =
|
bulwahn@33129
|
498 |
let
|
bulwahn@35884
|
499 |
(* TODO: can be simplified if parameters are not treated specially ? *)
|
bulwahn@34935
|
500 |
val (((pred, params), intros_th), ctxt1) = import_intros pred introrules ctxt
|
bulwahn@35884
|
501 |
(* TODO: distinct required ? -- test case with more than one parameter! *)
|
bulwahn@35884
|
502 |
val params = distinct (op aconv) params
|
bulwahn@33129
|
503 |
val intros = map prop_of intros_th
|
bulwahn@33129
|
504 |
val ([propname], ctxt2) = Variable.variant_fixes ["thesis"] ctxt1
|
bulwahn@33129
|
505 |
val prop = HOLogic.mk_Trueprop (Free (propname, HOLogic.boolT))
|
bulwahn@34935
|
506 |
val argsT = binder_types (fastype_of pred)
|
bulwahn@35884
|
507 |
(* TODO: can be simplified if parameters are not treated specially ? <-- see uncommented code! *)
|
bulwahn@34935
|
508 |
val (argvs, _) = fold_map mk_args2 argsT (params, ctxt2)
|
bulwahn@33129
|
509 |
fun mk_case intro =
|
bulwahn@33129
|
510 |
let
|
bulwahn@34935
|
511 |
val (_, args) = (strip_comb o HOLogic.dest_Trueprop o Logic.strip_imp_concl) intro
|
bulwahn@33129
|
512 |
val prems = Logic.strip_imp_prems intro
|
bulwahn@35884
|
513 |
val eqprems =
|
bulwahn@35884
|
514 |
map2 (HOLogic.mk_Trueprop oo (curry HOLogic.mk_eq)) argvs args
|
bulwahn@35884
|
515 |
val frees = map Free (fold Term.add_frees (args @ prems) [])
|
bulwahn@33129
|
516 |
in fold Logic.all frees (Logic.list_implies (eqprems @ prems, prop)) end
|
bulwahn@34935
|
517 |
val assm = HOLogic.mk_Trueprop (list_comb (pred, argvs))
|
bulwahn@33129
|
518 |
val cases = map mk_case intros
|
bulwahn@33129
|
519 |
in Logic.list_implies (assm :: cases, prop) end;
|
bulwahn@33129
|
520 |
|
bulwahn@35884
|
521 |
fun dest_conjunct_prem th =
|
bulwahn@35884
|
522 |
case HOLogic.dest_Trueprop (prop_of th) of
|
bulwahn@35884
|
523 |
(Const ("op &", _) $ t $ t') =>
|
bulwahn@35884
|
524 |
dest_conjunct_prem (th RS @{thm conjunct1})
|
bulwahn@35884
|
525 |
@ dest_conjunct_prem (th RS @{thm conjunct2})
|
bulwahn@35884
|
526 |
| _ => [th]
|
bulwahn@35884
|
527 |
|
bulwahn@35884
|
528 |
fun prove_casesrule ctxt (pred, (pre_cases_rule, nparams)) cases_rule =
|
bulwahn@35884
|
529 |
let
|
bulwahn@35884
|
530 |
val thy = ProofContext.theory_of ctxt
|
bulwahn@35884
|
531 |
val nargs = length (binder_types (fastype_of pred))
|
bulwahn@35884
|
532 |
fun PEEK f dependent_tactic st = dependent_tactic (f st) st
|
bulwahn@35884
|
533 |
fun meta_eq_of th = th RS @{thm eq_reflection}
|
bulwahn@35884
|
534 |
val tuple_rew_rules = map meta_eq_of [@{thm fst_conv}, @{thm snd_conv}, @{thm Pair_eq}]
|
bulwahn@35884
|
535 |
fun instantiate i n {context = ctxt, params = p, prems = prems,
|
bulwahn@35884
|
536 |
asms = a, concl = cl, schematics = s} =
|
bulwahn@35884
|
537 |
let
|
bulwahn@36503
|
538 |
fun term_pair_of (ix, (ty,t)) = (Var (ix,ty), t)
|
bulwahn@36503
|
539 |
fun inst_of_matches tts = fold (Pattern.match thy) tts (Vartab.empty, Vartab.empty)
|
bulwahn@36503
|
540 |
|> snd |> Vartab.dest |> map (pairself (cterm_of thy) o term_pair_of)
|
bulwahn@35884
|
541 |
val (cases, (eqs, prems)) = apsnd (chop (nargs - nparams)) (chop n prems)
|
bulwahn@35884
|
542 |
val case_th = MetaSimplifier.simplify true
|
bulwahn@36502
|
543 |
(@{thm Predicate.eq_is_eq} :: map meta_eq_of eqs) (nth cases (i - 1))
|
bulwahn@35884
|
544 |
val prems' = maps (dest_conjunct_prem o MetaSimplifier.simplify true tuple_rew_rules) prems
|
bulwahn@35884
|
545 |
val pats = map (swap o HOLogic.dest_eq o HOLogic.dest_Trueprop) (take nargs (prems_of case_th))
|
bulwahn@36503
|
546 |
val case_th' = Thm.instantiate ([], inst_of_matches pats) case_th
|
bulwahn@36503
|
547 |
OF (replicate nargs @{thm refl})
|
bulwahn@36503
|
548 |
val thesis =
|
bulwahn@36503
|
549 |
Thm.instantiate ([], inst_of_matches (prems_of case_th' ~~ map prop_of prems')) case_th'
|
bulwahn@36503
|
550 |
OF prems'
|
bulwahn@35884
|
551 |
in
|
bulwahn@35884
|
552 |
(rtac thesis 1)
|
bulwahn@35884
|
553 |
end
|
bulwahn@35884
|
554 |
val tac =
|
bulwahn@35884
|
555 |
etac pre_cases_rule 1
|
bulwahn@35884
|
556 |
THEN
|
bulwahn@35884
|
557 |
(PEEK nprems_of
|
bulwahn@35884
|
558 |
(fn n =>
|
bulwahn@35884
|
559 |
ALLGOALS (fn i =>
|
bulwahn@35884
|
560 |
MetaSimplifier.rewrite_goal_tac [@{thm split_paired_all}] i
|
bulwahn@35884
|
561 |
THEN (SUBPROOF (instantiate i n) ctxt i))))
|
bulwahn@35884
|
562 |
in
|
bulwahn@35884
|
563 |
Goal.prove ctxt (Term.add_free_names cases_rule []) [] cases_rule (fn _ => tac)
|
bulwahn@35884
|
564 |
end
|
bulwahn@35884
|
565 |
|
bulwahn@34935
|
566 |
(** preprocessing rules **)
|
bulwahn@32667
|
567 |
|
bulwahn@32667
|
568 |
fun imp_prems_conv cv ct =
|
bulwahn@32667
|
569 |
case Thm.term_of ct of
|
bulwahn@32667
|
570 |
Const ("==>", _) $ _ $ _ => Conv.combination_conv (Conv.arg_conv cv) (imp_prems_conv cv) ct
|
bulwahn@32667
|
571 |
| _ => Conv.all_conv ct
|
bulwahn@32667
|
572 |
|
bulwahn@32667
|
573 |
fun Trueprop_conv cv ct =
|
bulwahn@32667
|
574 |
case Thm.term_of ct of
|
bulwahn@32667
|
575 |
Const ("Trueprop", _) $ _ => Conv.arg_conv cv ct
|
bulwahn@35885
|
576 |
| _ => raise Fail "Trueprop_conv"
|
bulwahn@32667
|
577 |
|
bulwahn@32667
|
578 |
fun preprocess_intro thy rule =
|
bulwahn@32667
|
579 |
Conv.fconv_rule
|
bulwahn@32667
|
580 |
(imp_prems_conv
|
bulwahn@32667
|
581 |
(Trueprop_conv (Conv.try_conv (Conv.rewr_conv (Thm.symmetric @{thm Predicate.eq_is_eq})))))
|
bulwahn@32667
|
582 |
(Thm.transfer thy rule)
|
bulwahn@32667
|
583 |
|
bulwahn@36994
|
584 |
fun preprocess_elim ctxt elimrule =
|
bulwahn@32667
|
585 |
let
|
bulwahn@32667
|
586 |
fun replace_eqs (Const ("Trueprop", _) $ (Const ("op =", T) $ lhs $ rhs)) =
|
bulwahn@32667
|
587 |
HOLogic.mk_Trueprop (Const (@{const_name Predicate.eq}, T) $ lhs $ rhs)
|
bulwahn@32667
|
588 |
| replace_eqs t = t
|
bulwahn@36994
|
589 |
val thy = ProofContext.theory_of ctxt
|
bulwahn@33128
|
590 |
val ((_, [elimrule]), ctxt') = Variable.import false [elimrule] ctxt
|
bulwahn@33128
|
591 |
val prems = Thm.prems_of elimrule
|
bulwahn@34935
|
592 |
val nargs = length (snd (strip_comb (HOLogic.dest_Trueprop (hd prems))))
|
bulwahn@32667
|
593 |
fun preprocess_case t =
|
bulwahn@33128
|
594 |
let
|
bulwahn@32667
|
595 |
val params = Logic.strip_params t
|
bulwahn@32667
|
596 |
val (assums1, assums2) = chop nargs (Logic.strip_assums_hyp t)
|
bulwahn@32667
|
597 |
val assums_hyp' = assums1 @ (map replace_eqs assums2)
|
bulwahn@33128
|
598 |
in
|
bulwahn@32667
|
599 |
list_all (params, Logic.list_implies (assums_hyp', Logic.strip_assums_concl t))
|
bulwahn@33128
|
600 |
end
|
bulwahn@32667
|
601 |
val cases' = map preprocess_case (tl prems)
|
bulwahn@32667
|
602 |
val elimrule' = Logic.list_implies ((hd prems) :: cases', Thm.concl_of elimrule)
|
bulwahn@32667
|
603 |
val bigeq = (Thm.symmetric (Conv.implies_concl_conv
|
bulwahn@32667
|
604 |
(MetaSimplifier.rewrite true [@{thm Predicate.eq_is_eq}])
|
bulwahn@32667
|
605 |
(cterm_of thy elimrule')))
|
bulwahn@35884
|
606 |
val tac = (fn _ => Skip_Proof.cheat_tac thy)
|
bulwahn@33109
|
607 |
val eq = Goal.prove ctxt' [] [] (Logic.mk_equals ((Thm.prop_of elimrule), elimrule')) tac
|
bulwahn@32667
|
608 |
in
|
bulwahn@33109
|
609 |
Thm.equal_elim eq elimrule |> singleton (Variable.export ctxt' ctxt)
|
bulwahn@32667
|
610 |
end;
|
bulwahn@32667
|
611 |
|
bulwahn@33124
|
612 |
fun expand_tuples_elim th = th
|
bulwahn@33124
|
613 |
|
bulwahn@35887
|
614 |
val no_compilation = ([], ([], []))
|
bulwahn@33483
|
615 |
|
bulwahn@32667
|
616 |
fun fetch_pred_data thy name =
|
wenzelm@36633
|
617 |
case try (Inductive.the_inductive (ProofContext.init_global thy)) name of
|
bulwahn@32667
|
618 |
SOME (info as (_, result)) =>
|
bulwahn@32667
|
619 |
let
|
bulwahn@32667
|
620 |
fun is_intro_of intro =
|
bulwahn@32667
|
621 |
let
|
bulwahn@32667
|
622 |
val (const, _) = strip_comb (HOLogic.dest_Trueprop (concl_of intro))
|
bulwahn@32667
|
623 |
in (fst (dest_Const const) = name) end;
|
bulwahn@33752
|
624 |
val intros =
|
bulwahn@33124
|
625 |
(map (expand_tuples thy #> preprocess_intro thy) (filter is_intro_of (#intrs result)))
|
bulwahn@33146
|
626 |
val index = find_index (fn s => s = name) (#names (fst info))
|
bulwahn@33146
|
627 |
val pre_elim = nth (#elims result) index
|
bulwahn@33146
|
628 |
val pred = nth (#preds result) index
|
bulwahn@35884
|
629 |
val nparams = length (Inductive.params_of (#raw_induct result))
|
wenzelm@36633
|
630 |
val ctxt = ProofContext.init_global thy
|
bulwahn@35884
|
631 |
val elim_t = mk_casesrule ctxt pred intros
|
bulwahn@33124
|
632 |
val elim =
|
bulwahn@35884
|
633 |
prove_casesrule ctxt (pred, (pre_elim, nparams)) elim_t
|
bulwahn@32667
|
634 |
in
|
bulwahn@34935
|
635 |
mk_pred_data ((intros, SOME elim), no_compilation)
|
bulwahn@33483
|
636 |
end
|
bulwahn@32667
|
637 |
| NONE => error ("No such predicate: " ^ quote name)
|
bulwahn@33124
|
638 |
|
bulwahn@34935
|
639 |
fun add_predfun_data name mode data =
|
bulwahn@32667
|
640 |
let
|
bulwahn@35887
|
641 |
val add = (apsnd o apsnd o apfst) (cons (mode, mk_predfun_data data))
|
bulwahn@32667
|
642 |
in PredData.map (Graph.map_node name (map_pred_data add)) end
|
bulwahn@32667
|
643 |
|
bulwahn@36994
|
644 |
fun is_inductive_predicate ctxt name =
|
bulwahn@36994
|
645 |
is_some (try (Inductive.the_inductive ctxt) name)
|
bulwahn@32667
|
646 |
|
bulwahn@36994
|
647 |
fun depending_preds_of ctxt (key, value) =
|
bulwahn@32667
|
648 |
let
|
bulwahn@32667
|
649 |
val intros = (#intros o rep_pred_data) value
|
bulwahn@32667
|
650 |
in
|
bulwahn@32667
|
651 |
fold Term.add_const_names (map Thm.prop_of intros) []
|
bulwahn@33482
|
652 |
|> filter (fn c => (not (c = key)) andalso
|
bulwahn@36994
|
653 |
(is_inductive_predicate ctxt c orelse is_registered ctxt c))
|
bulwahn@32667
|
654 |
end;
|
bulwahn@32667
|
655 |
|
bulwahn@33629
|
656 |
fun add_intro thm thy =
|
bulwahn@33629
|
657 |
let
|
bulwahn@34935
|
658 |
val (name, T) = dest_Const (fst (strip_intro_concl thm))
|
bulwahn@33629
|
659 |
fun cons_intro gr =
|
bulwahn@32667
|
660 |
case try (Graph.get_node gr) name of
|
bulwahn@32667
|
661 |
SOME pred_data => Graph.map_node name (map_pred_data
|
bulwahn@34935
|
662 |
(apfst (fn (intros, elim) => (intros @ [thm], elim)))) gr
|
bulwahn@34935
|
663 |
| NONE => Graph.new_node (name, mk_pred_data (([thm], NONE), no_compilation)) gr
|
bulwahn@32667
|
664 |
in PredData.map cons_intro thy end
|
bulwahn@32667
|
665 |
|
bulwahn@33629
|
666 |
fun set_elim thm =
|
bulwahn@33629
|
667 |
let
|
bulwahn@32667
|
668 |
val (name, _) = dest_Const (fst
|
bulwahn@32667
|
669 |
(strip_comb (HOLogic.dest_Trueprop (hd (prems_of thm)))))
|
bulwahn@34935
|
670 |
fun set (intros, _) = (intros, SOME thm)
|
bulwahn@32667
|
671 |
in PredData.map (Graph.map_node name (map_pred_data (apfst set))) end
|
bulwahn@32667
|
672 |
|
bulwahn@34935
|
673 |
fun register_predicate (constname, pre_intros, pre_elim) thy =
|
bulwahn@33629
|
674 |
let
|
bulwahn@33752
|
675 |
val intros = map (preprocess_intro thy) pre_intros
|
bulwahn@36994
|
676 |
val elim = preprocess_elim (ProofContext.init_global thy) pre_elim
|
bulwahn@32667
|
677 |
in
|
bulwahn@33146
|
678 |
if not (member (op =) (Graph.keys (PredData.get thy)) constname) then
|
bulwahn@32668
|
679 |
PredData.map
|
bulwahn@33482
|
680 |
(Graph.new_node (constname,
|
bulwahn@34935
|
681 |
mk_pred_data ((intros, SOME elim), no_compilation))) thy
|
bulwahn@32668
|
682 |
else thy
|
bulwahn@32667
|
683 |
end
|
bulwahn@32667
|
684 |
|
bulwahn@33146
|
685 |
fun register_intros (constname, pre_intros) thy =
|
bulwahn@32668
|
686 |
let
|
bulwahn@33146
|
687 |
val T = Sign.the_const_type thy constname
|
bulwahn@34935
|
688 |
fun constname_of_intro intr = fst (dest_Const (fst (strip_intro_concl intr)))
|
bulwahn@33146
|
689 |
val _ = if not (forall (fn intr => constname_of_intro intr = constname) pre_intros) then
|
bulwahn@33146
|
690 |
error ("register_intros: Introduction rules of different constants are used\n" ^
|
bulwahn@33146
|
691 |
"expected rules for " ^ constname ^ ", but received rules for " ^
|
bulwahn@33146
|
692 |
commas (map constname_of_intro pre_intros))
|
bulwahn@33146
|
693 |
else ()
|
bulwahn@33146
|
694 |
val pred = Const (constname, T)
|
bulwahn@32672
|
695 |
val pre_elim =
|
wenzelm@35021
|
696 |
(Drule.export_without_context o Skip_Proof.make_thm thy)
|
wenzelm@36633
|
697 |
(mk_casesrule (ProofContext.init_global thy) pred pre_intros)
|
bulwahn@34935
|
698 |
in register_predicate (constname, pre_intros, pre_elim) thy end
|
bulwahn@32668
|
699 |
|
bulwahn@34935
|
700 |
fun defined_function_of compilation pred =
|
bulwahn@32667
|
701 |
let
|
bulwahn@35887
|
702 |
val set = (apsnd o apfst) (cons (compilation, []))
|
bulwahn@32667
|
703 |
in
|
bulwahn@32667
|
704 |
PredData.map (Graph.map_node pred (map_pred_data set))
|
bulwahn@32667
|
705 |
end
|
bulwahn@32667
|
706 |
|
bulwahn@34935
|
707 |
fun set_function_name compilation pred mode name =
|
bulwahn@32667
|
708 |
let
|
bulwahn@35887
|
709 |
val set = (apsnd o apfst)
|
bulwahn@34935
|
710 |
(AList.map_default (op =) (compilation, [(mode, name)]) (cons (mode, name)))
|
bulwahn@33473
|
711 |
in
|
bulwahn@33473
|
712 |
PredData.map (Graph.map_node pred (map_pred_data set))
|
bulwahn@33473
|
713 |
end
|
bulwahn@33473
|
714 |
|
bulwahn@34935
|
715 |
fun set_needs_random name modes =
|
bulwahn@33473
|
716 |
let
|
bulwahn@35887
|
717 |
val set = (apsnd o apsnd o apsnd) (K modes)
|
bulwahn@32667
|
718 |
in
|
bulwahn@34935
|
719 |
PredData.map (Graph.map_node name (map_pred_data set))
|
bulwahn@32667
|
720 |
end
|
bulwahn@32667
|
721 |
|
bulwahn@36032
|
722 |
(* registration of alternative function names *)
|
bulwahn@36032
|
723 |
|
bulwahn@36032
|
724 |
structure Alt_Compilations_Data = Theory_Data
|
bulwahn@36032
|
725 |
(
|
bulwahn@36032
|
726 |
type T = (mode * (compilation_funs -> typ -> term)) list Symtab.table;
|
bulwahn@36032
|
727 |
val empty = Symtab.empty;
|
bulwahn@36032
|
728 |
val extend = I;
|
bulwahn@36056
|
729 |
val merge = Symtab.merge ((K true)
|
bulwahn@36056
|
730 |
: ((mode * (compilation_funs -> typ -> term)) list *
|
bulwahn@36056
|
731 |
(mode * (compilation_funs -> typ -> term)) list -> bool));
|
bulwahn@36032
|
732 |
);
|
bulwahn@36032
|
733 |
|
bulwahn@36994
|
734 |
fun alternative_compilation_of_global thy pred_name mode =
|
bulwahn@36032
|
735 |
AList.lookup eq_mode (Symtab.lookup_list (Alt_Compilations_Data.get thy) pred_name) mode
|
bulwahn@36032
|
736 |
|
bulwahn@36994
|
737 |
fun alternative_compilation_of ctxt pred_name mode =
|
bulwahn@36994
|
738 |
AList.lookup eq_mode
|
bulwahn@36994
|
739 |
(Symtab.lookup_list (Alt_Compilations_Data.get (ProofContext.theory_of ctxt)) pred_name) mode
|
bulwahn@36994
|
740 |
|
bulwahn@36032
|
741 |
fun force_modes_and_compilations pred_name compilations =
|
bulwahn@36032
|
742 |
let
|
bulwahn@36032
|
743 |
(* thm refl is a dummy thm *)
|
bulwahn@36032
|
744 |
val modes = map fst compilations
|
bulwahn@36032
|
745 |
val (needs_random, non_random_modes) = pairself (map fst)
|
bulwahn@36032
|
746 |
(List.partition (fn (m, (fun_name, random)) => random) compilations)
|
bulwahn@36032
|
747 |
val non_random_dummys = map (rpair "dummy") non_random_modes
|
bulwahn@36032
|
748 |
val all_dummys = map (rpair "dummy") modes
|
bulwahn@36032
|
749 |
val dummy_function_names = map (rpair all_dummys) Predicate_Compile_Aux.random_compilations
|
bulwahn@36032
|
750 |
@ map (rpair non_random_dummys) Predicate_Compile_Aux.non_random_compilations
|
bulwahn@36032
|
751 |
val alt_compilations = map (apsnd fst) compilations
|
bulwahn@36032
|
752 |
in
|
bulwahn@36032
|
753 |
PredData.map (Graph.new_node
|
bulwahn@36032
|
754 |
(pred_name, mk_pred_data (([], SOME @{thm refl}), (dummy_function_names, ([], needs_random)))))
|
bulwahn@36032
|
755 |
#> Alt_Compilations_Data.map (Symtab.insert (K false) (pred_name, alt_compilations))
|
bulwahn@36032
|
756 |
end
|
bulwahn@36032
|
757 |
|
bulwahn@36032
|
758 |
fun functional_compilation fun_name mode compfuns T =
|
bulwahn@36032
|
759 |
let
|
bulwahn@36032
|
760 |
val (inpTs, outpTs) = split_map_modeT (fn _ => fn T => (SOME T, NONE))
|
bulwahn@36032
|
761 |
mode (binder_types T)
|
bulwahn@36032
|
762 |
val bs = map (pair "x") inpTs
|
bulwahn@36032
|
763 |
val bounds = map Bound (rev (0 upto (length bs) - 1))
|
bulwahn@36032
|
764 |
val f = Const (fun_name, inpTs ---> HOLogic.mk_tupleT outpTs)
|
bulwahn@36032
|
765 |
in list_abs (bs, mk_single compfuns (list_comb (f, bounds))) end
|
bulwahn@36032
|
766 |
|
bulwahn@36032
|
767 |
fun register_alternative_function pred_name mode fun_name =
|
bulwahn@36032
|
768 |
Alt_Compilations_Data.map (Symtab.insert_list (eq_pair eq_mode (K false))
|
bulwahn@36032
|
769 |
(pred_name, (mode, functional_compilation fun_name mode)))
|
bulwahn@36032
|
770 |
|
bulwahn@36032
|
771 |
fun force_modes_and_functions pred_name fun_names =
|
bulwahn@36032
|
772 |
force_modes_and_compilations pred_name
|
bulwahn@36032
|
773 |
(map (fn (mode, (fun_name, random)) => (mode, (functional_compilation fun_name mode, random)))
|
bulwahn@36032
|
774 |
fun_names)
|
bulwahn@36032
|
775 |
|
bulwahn@36013
|
776 |
(* compilation modifiers *)
|
bulwahn@36013
|
777 |
|
bulwahn@36013
|
778 |
structure Comp_Mod =
|
bulwahn@36013
|
779 |
struct
|
bulwahn@36013
|
780 |
|
bulwahn@36013
|
781 |
datatype comp_modifiers = Comp_Modifiers of
|
bulwahn@36013
|
782 |
{
|
bulwahn@36013
|
783 |
compilation : compilation,
|
bulwahn@36013
|
784 |
function_name_prefix : string,
|
bulwahn@36013
|
785 |
compfuns : compilation_funs,
|
bulwahn@36013
|
786 |
mk_random : typ -> term list -> term,
|
bulwahn@36013
|
787 |
modify_funT : typ -> typ,
|
bulwahn@36013
|
788 |
additional_arguments : string list -> term list,
|
bulwahn@36013
|
789 |
wrap_compilation : compilation_funs -> string -> typ -> mode -> term list -> term -> term,
|
bulwahn@36013
|
790 |
transform_additional_arguments : indprem -> term list -> term list
|
bulwahn@36013
|
791 |
}
|
bulwahn@36013
|
792 |
|
bulwahn@36013
|
793 |
fun dest_comp_modifiers (Comp_Modifiers c) = c
|
bulwahn@36013
|
794 |
|
bulwahn@36013
|
795 |
val compilation = #compilation o dest_comp_modifiers
|
bulwahn@36013
|
796 |
val function_name_prefix = #function_name_prefix o dest_comp_modifiers
|
bulwahn@36013
|
797 |
val compfuns = #compfuns o dest_comp_modifiers
|
bulwahn@36013
|
798 |
|
bulwahn@36013
|
799 |
val mk_random = #mk_random o dest_comp_modifiers
|
bulwahn@36013
|
800 |
val funT_of' = funT_of o compfuns
|
bulwahn@36013
|
801 |
val modify_funT = #modify_funT o dest_comp_modifiers
|
bulwahn@36013
|
802 |
fun funT_of comp mode = modify_funT comp o funT_of' comp mode
|
bulwahn@36013
|
803 |
|
bulwahn@36013
|
804 |
val additional_arguments = #additional_arguments o dest_comp_modifiers
|
bulwahn@36013
|
805 |
val wrap_compilation = #wrap_compilation o dest_comp_modifiers
|
bulwahn@36013
|
806 |
val transform_additional_arguments = #transform_additional_arguments o dest_comp_modifiers
|
bulwahn@36013
|
807 |
|
bulwahn@36013
|
808 |
end;
|
bulwahn@36013
|
809 |
|
bulwahn@36013
|
810 |
val depth_limited_comp_modifiers = Comp_Mod.Comp_Modifiers
|
bulwahn@36013
|
811 |
{
|
bulwahn@36013
|
812 |
compilation = Depth_Limited,
|
bulwahn@36013
|
813 |
function_name_prefix = "depth_limited_",
|
bulwahn@36013
|
814 |
compfuns = PredicateCompFuns.compfuns,
|
bulwahn@36013
|
815 |
mk_random = (fn _ => error "no random generation"),
|
bulwahn@36013
|
816 |
additional_arguments = fn names =>
|
bulwahn@36013
|
817 |
let
|
bulwahn@36013
|
818 |
val depth_name = Name.variant names "depth"
|
bulwahn@36013
|
819 |
in [Free (depth_name, @{typ code_numeral})] end,
|
bulwahn@36013
|
820 |
modify_funT = (fn T => let val (Ts, U) = strip_type T
|
bulwahn@36013
|
821 |
val Ts' = [@{typ code_numeral}] in (Ts @ Ts') ---> U end),
|
bulwahn@36013
|
822 |
wrap_compilation =
|
bulwahn@36013
|
823 |
fn compfuns => fn s => fn T => fn mode => fn additional_arguments => fn compilation =>
|
bulwahn@36013
|
824 |
let
|
bulwahn@36013
|
825 |
val [depth] = additional_arguments
|
bulwahn@36013
|
826 |
val (_, Ts) = split_modeT' mode (binder_types T)
|
bulwahn@36013
|
827 |
val T' = mk_predT compfuns (HOLogic.mk_tupleT Ts)
|
bulwahn@36013
|
828 |
val if_const = Const (@{const_name "If"}, @{typ bool} --> T' --> T' --> T')
|
bulwahn@36013
|
829 |
in
|
bulwahn@36013
|
830 |
if_const $ HOLogic.mk_eq (depth, @{term "0 :: code_numeral"})
|
bulwahn@36013
|
831 |
$ mk_bot compfuns (dest_predT compfuns T')
|
bulwahn@36013
|
832 |
$ compilation
|
bulwahn@36013
|
833 |
end,
|
bulwahn@36013
|
834 |
transform_additional_arguments =
|
bulwahn@36013
|
835 |
fn prem => fn additional_arguments =>
|
bulwahn@36013
|
836 |
let
|
bulwahn@36013
|
837 |
val [depth] = additional_arguments
|
bulwahn@36013
|
838 |
val depth' =
|
bulwahn@36013
|
839 |
Const (@{const_name Groups.minus}, @{typ "code_numeral => code_numeral => code_numeral"})
|
bulwahn@36013
|
840 |
$ depth $ Const (@{const_name Groups.one}, @{typ "Code_Numeral.code_numeral"})
|
bulwahn@36013
|
841 |
in [depth'] end
|
bulwahn@36013
|
842 |
}
|
bulwahn@36013
|
843 |
|
bulwahn@36013
|
844 |
val random_comp_modifiers = Comp_Mod.Comp_Modifiers
|
bulwahn@36013
|
845 |
{
|
bulwahn@36013
|
846 |
compilation = Random,
|
bulwahn@36013
|
847 |
function_name_prefix = "random_",
|
bulwahn@36013
|
848 |
compfuns = PredicateCompFuns.compfuns,
|
bulwahn@36013
|
849 |
mk_random = (fn T => fn additional_arguments =>
|
bulwahn@36013
|
850 |
list_comb (Const(@{const_name Quickcheck.iter},
|
bulwahn@36013
|
851 |
[@{typ code_numeral}, @{typ code_numeral}, @{typ Random.seed}] --->
|
bulwahn@36013
|
852 |
PredicateCompFuns.mk_predT T), additional_arguments)),
|
bulwahn@36013
|
853 |
modify_funT = (fn T =>
|
bulwahn@36013
|
854 |
let
|
bulwahn@36013
|
855 |
val (Ts, U) = strip_type T
|
bulwahn@36013
|
856 |
val Ts' = [@{typ code_numeral}, @{typ code_numeral}, @{typ "code_numeral * code_numeral"}]
|
bulwahn@36013
|
857 |
in (Ts @ Ts') ---> U end),
|
bulwahn@36013
|
858 |
additional_arguments = (fn names =>
|
bulwahn@36013
|
859 |
let
|
bulwahn@36013
|
860 |
val [nrandom, size, seed] = Name.variant_list names ["nrandom", "size", "seed"]
|
bulwahn@36013
|
861 |
in
|
bulwahn@36013
|
862 |
[Free (nrandom, @{typ code_numeral}), Free (size, @{typ code_numeral}),
|
bulwahn@36013
|
863 |
Free (seed, @{typ "code_numeral * code_numeral"})]
|
bulwahn@36013
|
864 |
end),
|
bulwahn@36013
|
865 |
wrap_compilation = K (K (K (K (K I))))
|
bulwahn@36013
|
866 |
: (compilation_funs -> string -> typ -> mode -> term list -> term -> term),
|
bulwahn@36013
|
867 |
transform_additional_arguments = K I : (indprem -> term list -> term list)
|
bulwahn@36013
|
868 |
}
|
bulwahn@36013
|
869 |
|
bulwahn@36013
|
870 |
val depth_limited_random_comp_modifiers = Comp_Mod.Comp_Modifiers
|
bulwahn@36013
|
871 |
{
|
bulwahn@36013
|
872 |
compilation = Depth_Limited_Random,
|
bulwahn@36013
|
873 |
function_name_prefix = "depth_limited_random_",
|
bulwahn@36013
|
874 |
compfuns = PredicateCompFuns.compfuns,
|
bulwahn@36013
|
875 |
mk_random = (fn T => fn additional_arguments =>
|
bulwahn@36013
|
876 |
list_comb (Const(@{const_name Quickcheck.iter},
|
bulwahn@36013
|
877 |
[@{typ code_numeral}, @{typ code_numeral}, @{typ Random.seed}] --->
|
bulwahn@36013
|
878 |
PredicateCompFuns.mk_predT T), tl additional_arguments)),
|
bulwahn@36013
|
879 |
modify_funT = (fn T =>
|
bulwahn@36013
|
880 |
let
|
bulwahn@36013
|
881 |
val (Ts, U) = strip_type T
|
bulwahn@36013
|
882 |
val Ts' = [@{typ code_numeral}, @{typ code_numeral}, @{typ code_numeral},
|
bulwahn@36013
|
883 |
@{typ "code_numeral * code_numeral"}]
|
bulwahn@36013
|
884 |
in (Ts @ Ts') ---> U end),
|
bulwahn@36013
|
885 |
additional_arguments = (fn names =>
|
bulwahn@36013
|
886 |
let
|
bulwahn@36013
|
887 |
val [depth, nrandom, size, seed] = Name.variant_list names ["depth", "nrandom", "size", "seed"]
|
bulwahn@36013
|
888 |
in
|
bulwahn@36013
|
889 |
[Free (depth, @{typ code_numeral}), Free (nrandom, @{typ code_numeral}),
|
bulwahn@36013
|
890 |
Free (size, @{typ code_numeral}), Free (seed, @{typ "code_numeral * code_numeral"})]
|
bulwahn@36013
|
891 |
end),
|
bulwahn@36013
|
892 |
wrap_compilation =
|
bulwahn@36013
|
893 |
fn compfuns => fn s => fn T => fn mode => fn additional_arguments => fn compilation =>
|
bulwahn@36013
|
894 |
let
|
bulwahn@36013
|
895 |
val depth = hd (additional_arguments)
|
bulwahn@36013
|
896 |
val (_, Ts) = split_map_modeT (fn m => fn T => (SOME (funT_of compfuns m T), NONE))
|
bulwahn@36013
|
897 |
mode (binder_types T)
|
bulwahn@36013
|
898 |
val T' = mk_predT compfuns (HOLogic.mk_tupleT Ts)
|
bulwahn@36013
|
899 |
val if_const = Const (@{const_name "If"}, @{typ bool} --> T' --> T' --> T')
|
bulwahn@36013
|
900 |
in
|
bulwahn@36013
|
901 |
if_const $ HOLogic.mk_eq (depth, @{term "0 :: code_numeral"})
|
bulwahn@36013
|
902 |
$ mk_bot compfuns (dest_predT compfuns T')
|
bulwahn@36013
|
903 |
$ compilation
|
bulwahn@36013
|
904 |
end,
|
bulwahn@36013
|
905 |
transform_additional_arguments =
|
bulwahn@36013
|
906 |
fn prem => fn additional_arguments =>
|
bulwahn@36013
|
907 |
let
|
bulwahn@36013
|
908 |
val [depth, nrandom, size, seed] = additional_arguments
|
bulwahn@36013
|
909 |
val depth' =
|
bulwahn@36013
|
910 |
Const (@{const_name Groups.minus}, @{typ "code_numeral => code_numeral => code_numeral"})
|
bulwahn@36013
|
911 |
$ depth $ Const (@{const_name Groups.one}, @{typ "Code_Numeral.code_numeral"})
|
bulwahn@36013
|
912 |
in [depth', nrandom, size, seed] end
|
bulwahn@36013
|
913 |
}
|
bulwahn@36013
|
914 |
|
bulwahn@36013
|
915 |
val predicate_comp_modifiers = Comp_Mod.Comp_Modifiers
|
bulwahn@36013
|
916 |
{
|
bulwahn@36013
|
917 |
compilation = Pred,
|
bulwahn@36013
|
918 |
function_name_prefix = "",
|
bulwahn@36013
|
919 |
compfuns = PredicateCompFuns.compfuns,
|
bulwahn@36013
|
920 |
mk_random = (fn _ => error "no random generation"),
|
bulwahn@36013
|
921 |
modify_funT = I,
|
bulwahn@36013
|
922 |
additional_arguments = K [],
|
bulwahn@36013
|
923 |
wrap_compilation = K (K (K (K (K I))))
|
bulwahn@36013
|
924 |
: (compilation_funs -> string -> typ -> mode -> term list -> term -> term),
|
bulwahn@36013
|
925 |
transform_additional_arguments = K I : (indprem -> term list -> term list)
|
bulwahn@36013
|
926 |
}
|
bulwahn@36013
|
927 |
|
bulwahn@36013
|
928 |
val annotated_comp_modifiers = Comp_Mod.Comp_Modifiers
|
bulwahn@36013
|
929 |
{
|
bulwahn@36013
|
930 |
compilation = Annotated,
|
bulwahn@36013
|
931 |
function_name_prefix = "annotated_",
|
bulwahn@36013
|
932 |
compfuns = PredicateCompFuns.compfuns,
|
bulwahn@36013
|
933 |
mk_random = (fn _ => error "no random generation"),
|
bulwahn@36013
|
934 |
modify_funT = I,
|
bulwahn@36013
|
935 |
additional_arguments = K [],
|
bulwahn@36013
|
936 |
wrap_compilation =
|
bulwahn@36013
|
937 |
fn compfuns => fn s => fn T => fn mode => fn additional_arguments => fn compilation =>
|
bulwahn@36013
|
938 |
mk_tracing ("calling predicate " ^ s ^
|
bulwahn@36013
|
939 |
" with mode " ^ string_of_mode mode) compilation,
|
bulwahn@36013
|
940 |
transform_additional_arguments = K I : (indprem -> term list -> term list)
|
bulwahn@36013
|
941 |
}
|
bulwahn@36013
|
942 |
|
bulwahn@36013
|
943 |
val dseq_comp_modifiers = Comp_Mod.Comp_Modifiers
|
bulwahn@36013
|
944 |
{
|
bulwahn@36013
|
945 |
compilation = DSeq,
|
bulwahn@36013
|
946 |
function_name_prefix = "dseq_",
|
bulwahn@36013
|
947 |
compfuns = DSequence_CompFuns.compfuns,
|
bulwahn@36013
|
948 |
mk_random = (fn _ => error "no random generation"),
|
bulwahn@36013
|
949 |
modify_funT = I,
|
bulwahn@36013
|
950 |
additional_arguments = K [],
|
bulwahn@36013
|
951 |
wrap_compilation = K (K (K (K (K I))))
|
bulwahn@36013
|
952 |
: (compilation_funs -> string -> typ -> mode -> term list -> term -> term),
|
bulwahn@36013
|
953 |
transform_additional_arguments = K I : (indprem -> term list -> term list)
|
bulwahn@36013
|
954 |
}
|
bulwahn@36013
|
955 |
|
bulwahn@36013
|
956 |
val pos_random_dseq_comp_modifiers = Comp_Mod.Comp_Modifiers
|
bulwahn@36013
|
957 |
{
|
bulwahn@36013
|
958 |
compilation = Pos_Random_DSeq,
|
bulwahn@36013
|
959 |
function_name_prefix = "random_dseq_",
|
bulwahn@36013
|
960 |
compfuns = Random_Sequence_CompFuns.compfuns,
|
bulwahn@36013
|
961 |
mk_random = (fn T => fn additional_arguments =>
|
bulwahn@36013
|
962 |
let
|
bulwahn@36013
|
963 |
val random = Const ("Quickcheck.random_class.random",
|
bulwahn@36013
|
964 |
@{typ code_numeral} --> @{typ Random.seed} -->
|
bulwahn@36013
|
965 |
HOLogic.mk_prodT (HOLogic.mk_prodT (T, @{typ "unit => term"}), @{typ Random.seed}))
|
bulwahn@36013
|
966 |
in
|
bulwahn@36013
|
967 |
Const ("Random_Sequence.Random", (@{typ code_numeral} --> @{typ Random.seed} -->
|
bulwahn@36013
|
968 |
HOLogic.mk_prodT (HOLogic.mk_prodT (T, @{typ "unit => term"}), @{typ Random.seed})) -->
|
bulwahn@36013
|
969 |
Random_Sequence_CompFuns.mk_random_dseqT T) $ random
|
bulwahn@36013
|
970 |
end),
|
bulwahn@36013
|
971 |
|
bulwahn@36013
|
972 |
modify_funT = I,
|
bulwahn@36013
|
973 |
additional_arguments = K [],
|
bulwahn@36013
|
974 |
wrap_compilation = K (K (K (K (K I))))
|
bulwahn@36013
|
975 |
: (compilation_funs -> string -> typ -> mode -> term list -> term -> term),
|
bulwahn@36013
|
976 |
transform_additional_arguments = K I : (indprem -> term list -> term list)
|
bulwahn@36013
|
977 |
}
|
bulwahn@36013
|
978 |
|
bulwahn@36013
|
979 |
val neg_random_dseq_comp_modifiers = Comp_Mod.Comp_Modifiers
|
bulwahn@36013
|
980 |
{
|
bulwahn@36013
|
981 |
compilation = Neg_Random_DSeq,
|
bulwahn@36013
|
982 |
function_name_prefix = "random_dseq_neg_",
|
bulwahn@36013
|
983 |
compfuns = Random_Sequence_CompFuns.compfuns,
|
bulwahn@36013
|
984 |
mk_random = (fn _ => error "no random generation"),
|
bulwahn@36013
|
985 |
modify_funT = I,
|
bulwahn@36013
|
986 |
additional_arguments = K [],
|
bulwahn@36013
|
987 |
wrap_compilation = K (K (K (K (K I))))
|
bulwahn@36013
|
988 |
: (compilation_funs -> string -> typ -> mode -> term list -> term -> term),
|
bulwahn@36013
|
989 |
transform_additional_arguments = K I : (indprem -> term list -> term list)
|
bulwahn@36013
|
990 |
}
|
bulwahn@36013
|
991 |
|
bulwahn@36013
|
992 |
|
bulwahn@36013
|
993 |
val new_pos_random_dseq_comp_modifiers = Comp_Mod.Comp_Modifiers
|
bulwahn@36013
|
994 |
{
|
bulwahn@36013
|
995 |
compilation = New_Pos_Random_DSeq,
|
bulwahn@36013
|
996 |
function_name_prefix = "new_random_dseq_",
|
bulwahn@36013
|
997 |
compfuns = New_Pos_Random_Sequence_CompFuns.compfuns,
|
bulwahn@36013
|
998 |
mk_random = (fn T => fn additional_arguments =>
|
bulwahn@36013
|
999 |
let
|
bulwahn@36013
|
1000 |
val random = Const ("Quickcheck.random_class.random",
|
bulwahn@36013
|
1001 |
@{typ code_numeral} --> @{typ Random.seed} -->
|
bulwahn@36013
|
1002 |
HOLogic.mk_prodT (HOLogic.mk_prodT (T, @{typ "unit => term"}), @{typ Random.seed}))
|
bulwahn@36013
|
1003 |
in
|
bulwahn@36013
|
1004 |
Const ("New_Random_Sequence.Random", (@{typ code_numeral} --> @{typ Random.seed} -->
|
bulwahn@36013
|
1005 |
HOLogic.mk_prodT (HOLogic.mk_prodT (T, @{typ "unit => term"}), @{typ Random.seed})) -->
|
bulwahn@36013
|
1006 |
New_Pos_Random_Sequence_CompFuns.mk_pos_random_dseqT T) $ random
|
bulwahn@36013
|
1007 |
end),
|
bulwahn@36013
|
1008 |
modify_funT = I,
|
bulwahn@36013
|
1009 |
additional_arguments = K [],
|
bulwahn@36013
|
1010 |
wrap_compilation = K (K (K (K (K I))))
|
bulwahn@36013
|
1011 |
: (compilation_funs -> string -> typ -> mode -> term list -> term -> term),
|
bulwahn@36013
|
1012 |
transform_additional_arguments = K I : (indprem -> term list -> term list)
|
bulwahn@36013
|
1013 |
}
|
bulwahn@36013
|
1014 |
|
bulwahn@36013
|
1015 |
val new_neg_random_dseq_comp_modifiers = Comp_Mod.Comp_Modifiers
|
bulwahn@36013
|
1016 |
{
|
bulwahn@36013
|
1017 |
compilation = New_Neg_Random_DSeq,
|
bulwahn@36013
|
1018 |
function_name_prefix = "new_random_dseq_neg_",
|
bulwahn@36013
|
1019 |
compfuns = New_Neg_Random_Sequence_CompFuns.compfuns,
|
bulwahn@36013
|
1020 |
mk_random = (fn _ => error "no random generation"),
|
bulwahn@36013
|
1021 |
modify_funT = I,
|
bulwahn@36013
|
1022 |
additional_arguments = K [],
|
bulwahn@36013
|
1023 |
wrap_compilation = K (K (K (K (K I))))
|
bulwahn@36013
|
1024 |
: (compilation_funs -> string -> typ -> mode -> term list -> term -> term),
|
bulwahn@36013
|
1025 |
transform_additional_arguments = K I : (indprem -> term list -> term list)
|
bulwahn@36013
|
1026 |
}
|
bulwahn@36013
|
1027 |
|
bulwahn@36013
|
1028 |
fun negative_comp_modifiers_of comp_modifiers =
|
bulwahn@36013
|
1029 |
(case Comp_Mod.compilation comp_modifiers of
|
bulwahn@36013
|
1030 |
Pos_Random_DSeq => neg_random_dseq_comp_modifiers
|
bulwahn@36013
|
1031 |
| Neg_Random_DSeq => pos_random_dseq_comp_modifiers
|
bulwahn@36013
|
1032 |
| New_Pos_Random_DSeq => new_neg_random_dseq_comp_modifiers
|
bulwahn@36013
|
1033 |
| New_Neg_Random_DSeq => new_pos_random_dseq_comp_modifiers
|
bulwahn@36013
|
1034 |
| c => comp_modifiers)
|
bulwahn@36013
|
1035 |
|
bulwahn@34935
|
1036 |
(** mode analysis **)
|
bulwahn@32672
|
1037 |
|
bulwahn@35411
|
1038 |
type mode_analysis_options = {use_random : bool, reorder_premises : bool, infer_pos_and_neg_modes : bool}
|
bulwahn@35324
|
1039 |
|
bulwahn@32667
|
1040 |
fun is_constrt thy =
|
bulwahn@32667
|
1041 |
let
|
bulwahn@32667
|
1042 |
val cnstrs = flat (maps
|
bulwahn@32667
|
1043 |
(map (fn (_, (Tname, _, cs)) => map (apsnd (rpair Tname o length)) cs) o #descr o snd)
|
bulwahn@32667
|
1044 |
(Symtab.dest (Datatype.get_all thy)));
|
bulwahn@32667
|
1045 |
fun check t = (case strip_comb t of
|
bulwahn@32667
|
1046 |
(Free _, []) => true
|
bulwahn@32667
|
1047 |
| (Const (s, T), ts) => (case (AList.lookup (op =) cnstrs s, body_type T) of
|
bulwahn@33482
|
1048 |
(SOME (i, Tname), Type (Tname', _)) =>
|
bulwahn@33482
|
1049 |
length ts = i andalso Tname = Tname' andalso forall check ts
|
bulwahn@32667
|
1050 |
| _ => false)
|
bulwahn@32667
|
1051 |
| _ => false)
|
bulwahn@32667
|
1052 |
in check end;
|
bulwahn@32667
|
1053 |
|
bulwahn@32667
|
1054 |
(*** check if a type is an equality type (i.e. doesn't contain fun)
|
bulwahn@32667
|
1055 |
FIXME this is only an approximation ***)
|
bulwahn@32667
|
1056 |
fun is_eqT (Type (s, Ts)) = s <> "fun" andalso forall is_eqT Ts
|
bulwahn@32667
|
1057 |
| is_eqT _ = true;
|
bulwahn@32667
|
1058 |
|
bulwahn@32667
|
1059 |
fun term_vs tm = fold_aterms (fn Free (x, T) => cons x | _ => I) tm [];
|
bulwahn@32667
|
1060 |
val terms_vs = distinct (op =) o maps term_vs;
|
bulwahn@32667
|
1061 |
|
bulwahn@32667
|
1062 |
(** collect all Frees in a term (with duplicates!) **)
|
bulwahn@32667
|
1063 |
fun term_vTs tm =
|
bulwahn@32667
|
1064 |
fold_aterms (fn Free xT => cons xT | _ => I) tm [];
|
bulwahn@32667
|
1065 |
|
bulwahn@33138
|
1066 |
fun subsets i j =
|
bulwahn@33138
|
1067 |
if i <= j then
|
bulwahn@33138
|
1068 |
let
|
bulwahn@33138
|
1069 |
fun merge xs [] = xs
|
bulwahn@33138
|
1070 |
| merge [] ys = ys
|
bulwahn@33138
|
1071 |
| merge (x::xs) (y::ys) = if length x >= length y then x::merge xs (y::ys)
|
bulwahn@33138
|
1072 |
else y::merge (x::xs) ys;
|
bulwahn@33138
|
1073 |
val is = subsets (i+1) j
|
bulwahn@33138
|
1074 |
in merge (map (fn ks => i::ks) is) is end
|
bulwahn@33138
|
1075 |
else [[]];
|
bulwahn@32667
|
1076 |
|
bulwahn@35324
|
1077 |
fun print_failed_mode options thy modes p (pol, m) rs is =
|
bulwahn@33130
|
1078 |
if show_mode_inference options then
|
bulwahn@33130
|
1079 |
let
|
bulwahn@33752
|
1080 |
val _ = tracing ("Clauses " ^ commas (map (fn i => string_of_int (i + 1)) is) ^ " of " ^
|
bulwahn@34935
|
1081 |
p ^ " violates mode " ^ string_of_mode m)
|
bulwahn@33130
|
1082 |
in () end
|
bulwahn@33130
|
1083 |
else ()
|
bulwahn@33130
|
1084 |
|
bulwahn@35324
|
1085 |
fun error_of p (pol, m) is =
|
bulwahn@35885
|
1086 |
" Clauses " ^ commas (map (fn i => string_of_int (i + 1)) is) ^ " of " ^
|
bulwahn@35885
|
1087 |
p ^ " violates mode " ^ string_of_mode m
|
bulwahn@33752
|
1088 |
|
bulwahn@34935
|
1089 |
fun is_all_input mode =
|
bulwahn@34935
|
1090 |
let
|
bulwahn@34935
|
1091 |
fun is_all_input' (Fun _) = true
|
bulwahn@34935
|
1092 |
| is_all_input' (Pair (m1, m2)) = is_all_input' m1 andalso is_all_input' m2
|
bulwahn@34935
|
1093 |
| is_all_input' Input = true
|
bulwahn@34935
|
1094 |
| is_all_input' Output = false
|
bulwahn@34935
|
1095 |
in
|
bulwahn@34935
|
1096 |
forall is_all_input' (strip_fun_mode mode)
|
bulwahn@34935
|
1097 |
end
|
bulwahn@33752
|
1098 |
|
bulwahn@34935
|
1099 |
fun all_input_of T =
|
bulwahn@33146
|
1100 |
let
|
bulwahn@34935
|
1101 |
val (Ts, U) = strip_type T
|
bulwahn@34935
|
1102 |
fun input_of (Type ("*", [T1, T2])) = Pair (input_of T1, input_of T2)
|
bulwahn@34935
|
1103 |
| input_of _ = Input
|
bulwahn@34935
|
1104 |
in
|
bulwahn@34935
|
1105 |
if U = HOLogic.boolT then
|
bulwahn@34935
|
1106 |
fold_rev (curry Fun) (map input_of Ts) Bool
|
bulwahn@34935
|
1107 |
else
|
bulwahn@35885
|
1108 |
raise Fail "all_input_of: not a predicate"
|
bulwahn@34935
|
1109 |
end
|
bulwahn@34935
|
1110 |
|
bulwahn@34935
|
1111 |
fun partial_hd [] = NONE
|
bulwahn@34935
|
1112 |
| partial_hd (x :: xs) = SOME x
|
bulwahn@34935
|
1113 |
|
bulwahn@34935
|
1114 |
fun term_vs tm = fold_aterms (fn Free (x, T) => cons x | _ => I) tm [];
|
bulwahn@34935
|
1115 |
val terms_vs = distinct (op =) o maps term_vs;
|
bulwahn@34935
|
1116 |
|
bulwahn@34935
|
1117 |
fun input_mode T =
|
bulwahn@34935
|
1118 |
let
|
bulwahn@34935
|
1119 |
val (Ts, U) = strip_type T
|
bulwahn@34935
|
1120 |
in
|
bulwahn@34935
|
1121 |
fold_rev (curry Fun) (map (K Input) Ts) Input
|
bulwahn@34935
|
1122 |
end
|
bulwahn@34935
|
1123 |
|
bulwahn@34935
|
1124 |
fun output_mode T =
|
bulwahn@34935
|
1125 |
let
|
bulwahn@34935
|
1126 |
val (Ts, U) = strip_type T
|
bulwahn@34935
|
1127 |
in
|
bulwahn@34935
|
1128 |
fold_rev (curry Fun) (map (K Output) Ts) Output
|
bulwahn@34935
|
1129 |
end
|
bulwahn@34935
|
1130 |
|
bulwahn@35891
|
1131 |
fun is_invertible_function ctxt (Const (f, _)) = is_constr ctxt f
|
bulwahn@35891
|
1132 |
| is_invertible_function ctxt _ = false
|
bulwahn@34935
|
1133 |
|
bulwahn@35891
|
1134 |
fun non_invertible_subterms ctxt (t as Free _) = []
|
bulwahn@35891
|
1135 |
| non_invertible_subterms ctxt t =
|
bulwahn@35891
|
1136 |
let
|
bulwahn@35891
|
1137 |
val (f, args) = strip_comb t
|
bulwahn@35891
|
1138 |
in
|
bulwahn@35891
|
1139 |
if is_invertible_function ctxt f then
|
bulwahn@35891
|
1140 |
maps (non_invertible_subterms ctxt) args
|
bulwahn@34935
|
1141 |
else
|
bulwahn@34935
|
1142 |
[t]
|
bulwahn@35891
|
1143 |
end
|
bulwahn@34935
|
1144 |
|
bulwahn@35891
|
1145 |
fun collect_non_invertible_subterms ctxt (f as Free _) (names, eqs) = (f, (names, eqs))
|
bulwahn@35891
|
1146 |
| collect_non_invertible_subterms ctxt t (names, eqs) =
|
bulwahn@34935
|
1147 |
case (strip_comb t) of (f, args) =>
|
bulwahn@35891
|
1148 |
if is_invertible_function ctxt f then
|
bulwahn@34935
|
1149 |
let
|
bulwahn@34935
|
1150 |
val (args', (names', eqs')) =
|
bulwahn@35891
|
1151 |
fold_map (collect_non_invertible_subterms ctxt) args (names, eqs)
|
bulwahn@34935
|
1152 |
in
|
bulwahn@34935
|
1153 |
(list_comb (f, args'), (names', eqs'))
|
bulwahn@34935
|
1154 |
end
|
bulwahn@34935
|
1155 |
else
|
bulwahn@34935
|
1156 |
let
|
bulwahn@34935
|
1157 |
val s = Name.variant names "x"
|
bulwahn@34935
|
1158 |
val v = Free (s, fastype_of t)
|
bulwahn@34935
|
1159 |
in
|
bulwahn@34935
|
1160 |
(v, (s :: names, HOLogic.mk_eq (v, t) :: eqs))
|
bulwahn@34935
|
1161 |
end
|
bulwahn@34935
|
1162 |
(*
|
bulwahn@34935
|
1163 |
if is_constrt thy t then (t, (names, eqs)) else
|
bulwahn@34935
|
1164 |
let
|
bulwahn@34935
|
1165 |
val s = Name.variant names "x"
|
bulwahn@34935
|
1166 |
val v = Free (s, fastype_of t)
|
bulwahn@34935
|
1167 |
in (v, (s::names, HOLogic.mk_eq (v, t)::eqs)) end;
|
bulwahn@34935
|
1168 |
*)
|
bulwahn@34935
|
1169 |
|
bulwahn@36994
|
1170 |
fun is_possible_output ctxt vs t =
|
bulwahn@34935
|
1171 |
forall
|
bulwahn@34935
|
1172 |
(fn t => is_eqT (fastype_of t) andalso forall (member (op =) vs) (term_vs t))
|
bulwahn@36994
|
1173 |
(non_invertible_subterms ctxt t)
|
bulwahn@35324
|
1174 |
andalso
|
bulwahn@35324
|
1175 |
(forall (is_eqT o snd)
|
bulwahn@35324
|
1176 |
(inter (fn ((f', _), f) => f = f') vs (Term.add_frees t [])))
|
bulwahn@34935
|
1177 |
|
bulwahn@35891
|
1178 |
fun vars_of_destructable_term ctxt (Free (x, _)) = [x]
|
bulwahn@35891
|
1179 |
| vars_of_destructable_term ctxt t =
|
bulwahn@35891
|
1180 |
let
|
bulwahn@35891
|
1181 |
val (f, args) = strip_comb t
|
bulwahn@35891
|
1182 |
in
|
bulwahn@35891
|
1183 |
if is_invertible_function ctxt f then
|
bulwahn@35891
|
1184 |
maps (vars_of_destructable_term ctxt) args
|
bulwahn@34935
|
1185 |
else
|
bulwahn@34935
|
1186 |
[]
|
bulwahn@35891
|
1187 |
end
|
bulwahn@34935
|
1188 |
|
bulwahn@36994
|
1189 |
fun is_constructable vs t = forall (member (op =) vs) (term_vs t)
|
bulwahn@34935
|
1190 |
|
bulwahn@34935
|
1191 |
fun missing_vars vs t = subtract (op =) vs (term_vs t)
|
bulwahn@34935
|
1192 |
|
bulwahn@35324
|
1193 |
fun output_terms (Const ("Pair", _) $ t1 $ t2, Mode_Pair (d1, d2)) =
|
bulwahn@35324
|
1194 |
output_terms (t1, d1) @ output_terms (t2, d2)
|
bulwahn@35324
|
1195 |
| output_terms (t1 $ t2, Mode_App (d1, d2)) =
|
bulwahn@35324
|
1196 |
output_terms (t1, d1) @ output_terms (t2, d2)
|
bulwahn@35324
|
1197 |
| output_terms (t, Term Output) = [t]
|
bulwahn@35324
|
1198 |
| output_terms _ = []
|
bulwahn@35324
|
1199 |
|
bulwahn@35324
|
1200 |
fun lookup_mode modes (Const (s, T)) =
|
bulwahn@35324
|
1201 |
(case (AList.lookup (op =) modes s) of
|
bulwahn@35324
|
1202 |
SOME ms => SOME (map (fn m => (Context m, [])) ms)
|
bulwahn@35324
|
1203 |
| NONE => NONE)
|
bulwahn@35324
|
1204 |
| lookup_mode modes (Free (x, _)) =
|
bulwahn@35324
|
1205 |
(case (AList.lookup (op =) modes x) of
|
bulwahn@35324
|
1206 |
SOME ms => SOME (map (fn m => (Context m , [])) ms)
|
bulwahn@35324
|
1207 |
| NONE => NONE)
|
bulwahn@35324
|
1208 |
|
bulwahn@36994
|
1209 |
fun derivations_of (ctxt : Proof.context) modes vs (Const ("Pair", _) $ t1 $ t2) (Pair (m1, m2)) =
|
bulwahn@34935
|
1210 |
map_product
|
bulwahn@34935
|
1211 |
(fn (m1, mvars1) => fn (m2, mvars2) => (Mode_Pair (m1, m2), union (op =) mvars1 mvars2))
|
bulwahn@36994
|
1212 |
(derivations_of ctxt modes vs t1 m1) (derivations_of ctxt modes vs t2 m2)
|
bulwahn@36994
|
1213 |
| derivations_of ctxt modes vs t (m as Fun _) =
|
bulwahn@35324
|
1214 |
(*let
|
bulwahn@35324
|
1215 |
val (p, args) = strip_comb t
|
bulwahn@35324
|
1216 |
in
|
bulwahn@35324
|
1217 |
(case lookup_mode modes p of
|
bulwahn@35324
|
1218 |
SOME ms => map_filter (fn (Context m, []) => let
|
bulwahn@35324
|
1219 |
val ms = strip_fun_mode m
|
bulwahn@35324
|
1220 |
val (argms, restms) = chop (length args) ms
|
bulwahn@35324
|
1221 |
val m' = fold_rev (curry Fun) restms Bool
|
bulwahn@35324
|
1222 |
in
|
bulwahn@35324
|
1223 |
if forall (fn m => eq_mode (Input, m)) argms andalso eq_mode (m', mode) then
|
bulwahn@35324
|
1224 |
SOME (fold (curry Mode_App) (map Term argms) (Context m), missing_vars vs t)
|
bulwahn@35324
|
1225 |
else NONE
|
bulwahn@35324
|
1226 |
end) ms
|
bulwahn@35324
|
1227 |
| NONE => (if is_all_input mode then [(Context mode, [])] else []))
|
bulwahn@35324
|
1228 |
end*)
|
bulwahn@36994
|
1229 |
(case try (all_derivations_of ctxt modes vs) t of
|
bulwahn@35324
|
1230 |
SOME derivs =>
|
bulwahn@35324
|
1231 |
filter (fn (d, mvars) => eq_mode (mode_of d, m) andalso null (output_terms (t, d))) derivs
|
bulwahn@35324
|
1232 |
| NONE => (if is_all_input m then [(Context m, [])] else []))
|
bulwahn@36994
|
1233 |
| derivations_of ctxt modes vs t m =
|
bulwahn@35324
|
1234 |
if eq_mode (m, Input) then
|
bulwahn@35324
|
1235 |
[(Term Input, missing_vars vs t)]
|
bulwahn@35324
|
1236 |
else if eq_mode (m, Output) then
|
bulwahn@36994
|
1237 |
(if is_possible_output ctxt vs t then [(Term Output, [])] else [])
|
bulwahn@35324
|
1238 |
else []
|
bulwahn@36994
|
1239 |
and all_derivations_of ctxt modes vs (Const ("Pair", _) $ t1 $ t2) =
|
bulwahn@34935
|
1240 |
let
|
bulwahn@36994
|
1241 |
val derivs1 = all_derivations_of ctxt modes vs t1
|
bulwahn@36994
|
1242 |
val derivs2 = all_derivations_of ctxt modes vs t2
|
bulwahn@34935
|
1243 |
in
|
bulwahn@34935
|
1244 |
map_product
|
bulwahn@34935
|
1245 |
(fn (m1, mvars1) => fn (m2, mvars2) => (Mode_Pair (m1, m2), union (op =) mvars1 mvars2))
|
bulwahn@34935
|
1246 |
derivs1 derivs2
|
bulwahn@34935
|
1247 |
end
|
bulwahn@36994
|
1248 |
| all_derivations_of ctxt modes vs (t1 $ t2) =
|
bulwahn@34935
|
1249 |
let
|
bulwahn@36994
|
1250 |
val derivs1 = all_derivations_of ctxt modes vs t1
|
bulwahn@34935
|
1251 |
in
|
bulwahn@34935
|
1252 |
maps (fn (d1, mvars1) =>
|
bulwahn@34935
|
1253 |
case mode_of d1 of
|
bulwahn@34935
|
1254 |
Fun (m', _) => map (fn (d2, mvars2) =>
|
bulwahn@36994
|
1255 |
(Mode_App (d1, d2), union (op =) mvars1 mvars2)) (derivations_of ctxt modes vs t2 m')
|
bulwahn@35885
|
1256 |
| _ => raise Fail "Something went wrong") derivs1
|
bulwahn@34935
|
1257 |
end
|
bulwahn@36994
|
1258 |
| all_derivations_of _ modes vs (Const (s, T)) = the (lookup_mode modes (Const (s, T)))
|
bulwahn@36994
|
1259 |
| all_derivations_of _ modes vs (Free (x, T)) = the (lookup_mode modes (Free (x, T)))
|
bulwahn@35885
|
1260 |
| all_derivations_of _ modes vs _ = raise Fail "all_derivations_of"
|
bulwahn@34935
|
1261 |
|
bulwahn@34935
|
1262 |
fun rev_option_ord ord (NONE, NONE) = EQUAL
|
bulwahn@34935
|
1263 |
| rev_option_ord ord (NONE, SOME _) = GREATER
|
bulwahn@34935
|
1264 |
| rev_option_ord ord (SOME _, NONE) = LESS
|
bulwahn@34935
|
1265 |
| rev_option_ord ord (SOME x, SOME y) = ord (x, y)
|
bulwahn@34935
|
1266 |
|
bulwahn@34935
|
1267 |
fun random_mode_in_deriv modes t deriv =
|
bulwahn@34935
|
1268 |
case try dest_Const (fst (strip_comb t)) of
|
bulwahn@34935
|
1269 |
SOME (s, _) =>
|
bulwahn@34935
|
1270 |
(case AList.lookup (op =) modes s of
|
bulwahn@34935
|
1271 |
SOME ms =>
|
bulwahn@35324
|
1272 |
(case AList.lookup (op =) (map (fn ((p, m), r) => (m, r)) ms) (head_mode_of deriv) of
|
bulwahn@34935
|
1273 |
SOME r => r
|
bulwahn@34935
|
1274 |
| NONE => false)
|
bulwahn@34935
|
1275 |
| NONE => false)
|
bulwahn@34935
|
1276 |
| NONE => false
|
bulwahn@34935
|
1277 |
|
bulwahn@34935
|
1278 |
fun number_of_output_positions mode =
|
bulwahn@34935
|
1279 |
let
|
bulwahn@34935
|
1280 |
val args = strip_fun_mode mode
|
bulwahn@34935
|
1281 |
fun contains_output (Fun _) = false
|
bulwahn@34935
|
1282 |
| contains_output Input = false
|
bulwahn@34935
|
1283 |
| contains_output Output = true
|
bulwahn@34935
|
1284 |
| contains_output (Pair (m1, m2)) = contains_output m1 orelse contains_output m2
|
bulwahn@34935
|
1285 |
in
|
bulwahn@34935
|
1286 |
length (filter contains_output args)
|
bulwahn@34935
|
1287 |
end
|
bulwahn@34935
|
1288 |
|
bulwahn@34935
|
1289 |
fun lex_ord ord1 ord2 (x, x') =
|
bulwahn@34935
|
1290 |
case ord1 (x, x') of
|
bulwahn@34935
|
1291 |
EQUAL => ord2 (x, x')
|
bulwahn@34935
|
1292 |
| ord => ord
|
bulwahn@34935
|
1293 |
|
bulwahn@36247
|
1294 |
fun lexl_ord [] (x, x') = EQUAL
|
bulwahn@36247
|
1295 |
| lexl_ord (ord :: ords') (x, x') =
|
bulwahn@36247
|
1296 |
case ord (x, x') of
|
bulwahn@36247
|
1297 |
EQUAL => lexl_ord ords' (x, x')
|
bulwahn@36247
|
1298 |
| ord => ord
|
bulwahn@36247
|
1299 |
|
bulwahn@36994
|
1300 |
fun deriv_ord' ctxt pol pred modes t1 t2 ((deriv1, mvars1), (deriv2, mvars2)) =
|
bulwahn@34935
|
1301 |
let
|
bulwahn@36247
|
1302 |
(* prefer functional modes if it is a function *)
|
bulwahn@36247
|
1303 |
fun fun_ord ((t1, deriv1, mvars1), (t2, deriv2, mvars2)) =
|
bulwahn@36247
|
1304 |
let
|
bulwahn@36247
|
1305 |
fun is_functional t mode =
|
bulwahn@36247
|
1306 |
case try (fst o dest_Const o fst o strip_comb) t of
|
bulwahn@36247
|
1307 |
NONE => false
|
bulwahn@36994
|
1308 |
| SOME c => is_some (alternative_compilation_of ctxt c mode)
|
bulwahn@36247
|
1309 |
in
|
bulwahn@36247
|
1310 |
case (is_functional t1 (head_mode_of deriv1), is_functional t2 (head_mode_of deriv2)) of
|
bulwahn@36247
|
1311 |
(true, true) => EQUAL
|
bulwahn@36247
|
1312 |
| (true, false) => LESS
|
bulwahn@36247
|
1313 |
| (false, true) => GREATER
|
bulwahn@36247
|
1314 |
| (false, false) => EQUAL
|
bulwahn@36247
|
1315 |
end
|
bulwahn@36022
|
1316 |
(* prefer modes without requirement for generating random values *)
|
bulwahn@34935
|
1317 |
fun mvars_ord ((t1, deriv1, mvars1), (t2, deriv2, mvars2)) =
|
bulwahn@34935
|
1318 |
int_ord (length mvars1, length mvars2)
|
bulwahn@36022
|
1319 |
(* prefer non-random modes *)
|
bulwahn@34935
|
1320 |
fun random_mode_ord ((t1, deriv1, mvars1), (t2, deriv2, mvars2)) =
|
bulwahn@34935
|
1321 |
int_ord (if random_mode_in_deriv modes t1 deriv1 then 1 else 0,
|
bulwahn@34935
|
1322 |
if random_mode_in_deriv modes t1 deriv1 then 1 else 0)
|
bulwahn@36022
|
1323 |
(* prefer modes with more input and less output *)
|
bulwahn@34935
|
1324 |
fun output_mode_ord ((t1, deriv1, mvars1), (t2, deriv2, mvars2)) =
|
bulwahn@34935
|
1325 |
int_ord (number_of_output_positions (head_mode_of deriv1),
|
bulwahn@34935
|
1326 |
number_of_output_positions (head_mode_of deriv2))
|
bulwahn@36022
|
1327 |
(* prefer recursive calls *)
|
bulwahn@36022
|
1328 |
fun is_rec_premise t =
|
bulwahn@36022
|
1329 |
case fst (strip_comb t) of Const (c, T) => c = pred | _ => false
|
bulwahn@36022
|
1330 |
fun recursive_ord ((t1, deriv1, mvars1), (t2, deriv2, mvars2)) =
|
bulwahn@36022
|
1331 |
int_ord (if is_rec_premise t1 then 0 else 1,
|
bulwahn@36022
|
1332 |
if is_rec_premise t2 then 0 else 1)
|
bulwahn@36247
|
1333 |
val ord = lexl_ord [mvars_ord, fun_ord, random_mode_ord, output_mode_ord, recursive_ord]
|
bulwahn@34935
|
1334 |
in
|
bulwahn@36022
|
1335 |
ord ((t1, deriv1, mvars1), (t2, deriv2, mvars2))
|
bulwahn@34935
|
1336 |
end
|
bulwahn@34935
|
1337 |
|
bulwahn@36994
|
1338 |
fun deriv_ord ctxt pol pred modes t = deriv_ord' ctxt pol pred modes t t
|
bulwahn@34935
|
1339 |
|
bulwahn@36247
|
1340 |
fun premise_ord thy pol pred modes ((prem1, a1), (prem2, a2)) =
|
bulwahn@36258
|
1341 |
rev_option_ord (deriv_ord' thy pol pred modes (dest_indprem prem1) (dest_indprem prem2)) (a1, a2)
|
bulwahn@34935
|
1342 |
|
bulwahn@34935
|
1343 |
fun print_mode_list modes =
|
bulwahn@34935
|
1344 |
tracing ("modes: " ^ (commas (map (fn (s, ms) => s ^ ": " ^
|
bulwahn@34935
|
1345 |
commas (map (fn (m, r) => string_of_mode m ^ (if r then " random " else " not ")) ms)) modes)))
|
bulwahn@34935
|
1346 |
|
bulwahn@36994
|
1347 |
fun select_mode_prem (mode_analysis_options : mode_analysis_options) (ctxt : Proof.context) pred
|
bulwahn@36022
|
1348 |
pol (modes, (pos_modes, neg_modes)) vs ps =
|
bulwahn@34935
|
1349 |
let
|
bulwahn@35324
|
1350 |
fun choose_mode_of_prem (Prem t) = partial_hd
|
bulwahn@36994
|
1351 |
(sort (deriv_ord ctxt pol pred modes t) (all_derivations_of ctxt pos_modes vs t))
|
bulwahn@35324
|
1352 |
| choose_mode_of_prem (Sidecond t) = SOME (Context Bool, missing_vars vs t)
|
bulwahn@35324
|
1353 |
| choose_mode_of_prem (Negprem t) = partial_hd
|
bulwahn@36994
|
1354 |
(sort (deriv_ord ctxt (not pol) pred modes t)
|
bulwahn@36247
|
1355 |
(filter (fn (d, missing_vars) => is_all_input (head_mode_of d))
|
bulwahn@36994
|
1356 |
(all_derivations_of ctxt neg_modes vs t)))
|
bulwahn@36994
|
1357 |
| choose_mode_of_prem p = raise Fail ("choose_mode_of_prem: " ^ string_of_prem ctxt p)
|
bulwahn@34935
|
1358 |
in
|
bulwahn@35324
|
1359 |
if #reorder_premises mode_analysis_options then
|
bulwahn@36994
|
1360 |
partial_hd (sort (premise_ord ctxt pol pred modes) (ps ~~ map choose_mode_of_prem ps))
|
bulwahn@35324
|
1361 |
else
|
bulwahn@35324
|
1362 |
SOME (hd ps, choose_mode_of_prem (hd ps))
|
bulwahn@34935
|
1363 |
end
|
bulwahn@34935
|
1364 |
|
bulwahn@36994
|
1365 |
fun check_mode_clause' (mode_analysis_options : mode_analysis_options) ctxt pred param_vs (modes :
|
bulwahn@35324
|
1366 |
(string * ((bool * mode) * bool) list) list) ((pol, mode) : bool * mode) (ts, ps) =
|
bulwahn@34935
|
1367 |
let
|
bulwahn@36258
|
1368 |
val vTs = distinct (op =) (fold Term.add_frees (map dest_indprem ps) (fold Term.add_frees ts []))
|
bulwahn@35324
|
1369 |
val modes' = modes @ (param_vs ~~ map (fn x => [((true, x), false), ((false, x), false)]) (ho_arg_modes_of mode))
|
bulwahn@35324
|
1370 |
fun retrieve_modes_of_pol pol = map (fn (s, ms) =>
|
bulwahn@35324
|
1371 |
(s, map_filter (fn ((p, m), r) => if p = pol then SOME m else NONE | _ => NONE) ms))
|
bulwahn@35324
|
1372 |
val (pos_modes', neg_modes') =
|
bulwahn@35324
|
1373 |
if #infer_pos_and_neg_modes mode_analysis_options then
|
bulwahn@35324
|
1374 |
(retrieve_modes_of_pol pol modes', retrieve_modes_of_pol (not pol) modes')
|
bulwahn@35324
|
1375 |
else
|
bulwahn@35324
|
1376 |
let
|
bulwahn@35324
|
1377 |
val modes = map (fn (s, ms) => (s, map (fn ((p, m), r) => m) ms)) modes'
|
bulwahn@35324
|
1378 |
in (modes, modes) end
|
bulwahn@35324
|
1379 |
val (in_ts, out_ts) = split_mode mode ts
|
bulwahn@36994
|
1380 |
val in_vs = maps (vars_of_destructable_term ctxt) in_ts
|
bulwahn@34935
|
1381 |
val out_vs = terms_vs out_ts
|
bulwahn@35324
|
1382 |
fun known_vs_after p vs = (case p of
|
bulwahn@35324
|
1383 |
Prem t => union (op =) vs (term_vs t)
|
bulwahn@35324
|
1384 |
| Sidecond t => union (op =) vs (term_vs t)
|
bulwahn@35324
|
1385 |
| Negprem t => union (op =) vs (term_vs t)
|
bulwahn@35885
|
1386 |
| _ => raise Fail "I do not know")
|
bulwahn@34935
|
1387 |
fun check_mode_prems acc_ps rnd vs [] = SOME (acc_ps, vs, rnd)
|
bulwahn@34935
|
1388 |
| check_mode_prems acc_ps rnd vs ps =
|
bulwahn@35324
|
1389 |
(case
|
bulwahn@36994
|
1390 |
(select_mode_prem mode_analysis_options ctxt pred pol (modes', (pos_modes', neg_modes')) vs ps) of
|
bulwahn@35324
|
1391 |
SOME (p, SOME (deriv, [])) => check_mode_prems ((p, deriv) :: acc_ps) rnd
|
bulwahn@35324
|
1392 |
(known_vs_after p vs) (filter_out (equal p) ps)
|
bulwahn@34935
|
1393 |
| SOME (p, SOME (deriv, missing_vars)) =>
|
bulwahn@35324
|
1394 |
if #use_random mode_analysis_options andalso pol then
|
bulwahn@34935
|
1395 |
check_mode_prems ((p, deriv) :: (map
|
bulwahn@35324
|
1396 |
(fn v => (Generator (v, the (AList.lookup (op =) vTs v)), Term Output))
|
bulwahn@35324
|
1397 |
(distinct (op =) missing_vars))
|
bulwahn@35324
|
1398 |
@ acc_ps) true (known_vs_after p vs) (filter_out (equal p) ps)
|
bulwahn@34935
|
1399 |
else NONE
|
bulwahn@34935
|
1400 |
| SOME (p, NONE) => NONE
|
bulwahn@34935
|
1401 |
| NONE => NONE)
|
bulwahn@34935
|
1402 |
in
|
bulwahn@34935
|
1403 |
case check_mode_prems [] false in_vs ps of
|
bulwahn@34935
|
1404 |
NONE => NONE
|
bulwahn@34935
|
1405 |
| SOME (acc_ps, vs, rnd) =>
|
bulwahn@36994
|
1406 |
if forall (is_constructable vs) (in_ts @ out_ts) then
|
bulwahn@34935
|
1407 |
SOME (ts, rev acc_ps, rnd)
|
bulwahn@34935
|
1408 |
else
|
bulwahn@35324
|
1409 |
if #use_random mode_analysis_options andalso pol then
|
bulwahn@34935
|
1410 |
let
|
bulwahn@35324
|
1411 |
val generators = map
|
bulwahn@34935
|
1412 |
(fn v => (Generator (v, the (AList.lookup (op =) vTs v)), Term Output))
|
bulwahn@35324
|
1413 |
(subtract (op =) vs (terms_vs (in_ts @ out_ts)))
|
bulwahn@34935
|
1414 |
in
|
bulwahn@34935
|
1415 |
SOME (ts, rev (generators @ acc_ps), true)
|
bulwahn@34935
|
1416 |
end
|
bulwahn@34935
|
1417 |
else
|
bulwahn@34935
|
1418 |
NONE
|
bulwahn@34935
|
1419 |
end
|
bulwahn@34935
|
1420 |
|
bulwahn@34935
|
1421 |
datatype result = Success of bool | Error of string
|
bulwahn@34935
|
1422 |
|
bulwahn@35324
|
1423 |
fun check_modes_pred' mode_analysis_options options thy param_vs clauses modes (p, (ms : ((bool * mode) * bool) list)) =
|
bulwahn@34935
|
1424 |
let
|
bulwahn@34935
|
1425 |
fun split xs =
|
bulwahn@34935
|
1426 |
let
|
bulwahn@34935
|
1427 |
fun split' [] (ys, zs) = (rev ys, rev zs)
|
bulwahn@34935
|
1428 |
| split' ((m, Error z) :: xs) (ys, zs) = split' xs (ys, z :: zs)
|
bulwahn@35324
|
1429 |
| split' (((m : bool * mode), Success rnd) :: xs) (ys, zs) = split' xs ((m, rnd) :: ys, zs)
|
bulwahn@34935
|
1430 |
in
|
bulwahn@34935
|
1431 |
split' xs ([], [])
|
bulwahn@34935
|
1432 |
end
|
bulwahn@34935
|
1433 |
val rs = these (AList.lookup (op =) clauses p)
|
bulwahn@34935
|
1434 |
fun check_mode m =
|
bulwahn@34935
|
1435 |
let
|
bulwahn@35324
|
1436 |
val res = Output.cond_timeit false "work part of check_mode for one mode" (fn _ =>
|
bulwahn@36022
|
1437 |
map (check_mode_clause' mode_analysis_options thy p param_vs modes m) rs)
|
bulwahn@34935
|
1438 |
in
|
bulwahn@35324
|
1439 |
Output.cond_timeit false "aux part of check_mode for one mode" (fn _ =>
|
bulwahn@34935
|
1440 |
case find_indices is_none res of
|
bulwahn@34935
|
1441 |
[] => Success (exists (fn SOME (_, _, true) => true | _ => false) res)
|
bulwahn@35324
|
1442 |
| is => (print_failed_mode options thy modes p m rs is; Error (error_of p m is)))
|
bulwahn@34935
|
1443 |
end
|
bulwahn@35324
|
1444 |
val _ = if show_mode_inference options then
|
bulwahn@35324
|
1445 |
tracing ("checking " ^ string_of_int (length ms) ^ " modes ...")
|
bulwahn@35324
|
1446 |
else ()
|
bulwahn@35324
|
1447 |
val res = Output.cond_timeit false "check_mode" (fn _ => map (fn (m, _) => (m, check_mode m)) ms)
|
bulwahn@34935
|
1448 |
val (ms', errors) = split res
|
bulwahn@33752
|
1449 |
in
|
bulwahn@35324
|
1450 |
((p, (ms' : ((bool * mode) * bool) list)), errors)
|
bulwahn@32667
|
1451 |
end;
|
bulwahn@32667
|
1452 |
|
bulwahn@35324
|
1453 |
fun get_modes_pred' mode_analysis_options thy param_vs clauses modes (p, ms) =
|
bulwahn@32667
|
1454 |
let
|
bulwahn@34935
|
1455 |
val rs = these (AList.lookup (op =) clauses p)
|
bulwahn@32667
|
1456 |
in
|
bulwahn@34935
|
1457 |
(p, map (fn (m, rnd) =>
|
bulwahn@35324
|
1458 |
(m, map
|
bulwahn@35324
|
1459 |
((fn (ts, ps, rnd) => (ts, ps)) o the o
|
bulwahn@36022
|
1460 |
check_mode_clause' mode_analysis_options thy p param_vs modes m) rs)) ms)
|
bulwahn@32667
|
1461 |
end;
|
bulwahn@33137
|
1462 |
|
bulwahn@35324
|
1463 |
fun fixp f (x : (string * ((bool * mode) * bool) list) list) =
|
bulwahn@32667
|
1464 |
let val y = f x
|
bulwahn@32667
|
1465 |
in if x = y then x else fixp f y end;
|
bulwahn@32667
|
1466 |
|
bulwahn@35324
|
1467 |
fun fixp_with_state f (x : (string * ((bool * mode) * bool) list) list, state) =
|
bulwahn@33752
|
1468 |
let
|
bulwahn@33752
|
1469 |
val (y, state') = f (x, state)
|
bulwahn@33752
|
1470 |
in
|
bulwahn@33752
|
1471 |
if x = y then (y, state') else fixp_with_state f (y, state')
|
bulwahn@33752
|
1472 |
end
|
bulwahn@33752
|
1473 |
|
bulwahn@35324
|
1474 |
fun string_of_ext_mode ((pol, mode), rnd) =
|
bulwahn@35324
|
1475 |
string_of_mode mode ^ "(" ^ (if pol then "pos" else "neg") ^ ", "
|
bulwahn@35324
|
1476 |
^ (if rnd then "rnd" else "nornd") ^ ")"
|
bulwahn@35324
|
1477 |
|
bulwahn@35324
|
1478 |
fun print_extra_modes options modes =
|
bulwahn@35324
|
1479 |
if show_mode_inference options then
|
bulwahn@35324
|
1480 |
tracing ("Modes of inferred predicates: " ^
|
bulwahn@35324
|
1481 |
cat_lines (map (fn (s, ms) => s ^ ": " ^ commas (map string_of_ext_mode ms)) modes))
|
bulwahn@35324
|
1482 |
else ()
|
bulwahn@35324
|
1483 |
|
bulwahn@35324
|
1484 |
fun infer_modes mode_analysis_options options compilation preds all_modes param_vs clauses thy =
|
bulwahn@32667
|
1485 |
let
|
bulwahn@36994
|
1486 |
val ctxt = ProofContext.init_global thy
|
bulwahn@35324
|
1487 |
val collect_errors = false
|
bulwahn@35324
|
1488 |
fun appair f (x1, x2) (y1, y2) = (f x1 y1, f x2 y2)
|
bulwahn@36994
|
1489 |
fun add_needs_random s (false, m) = ((false, m), false)
|
bulwahn@36994
|
1490 |
| add_needs_random s (true, m) = ((true, m), needs_random ctxt s m)
|
bulwahn@36994
|
1491 |
fun add_polarity_and_random_bit s b ms = map (fn m => add_needs_random s (b, m)) ms
|
bulwahn@35324
|
1492 |
val prednames = map fst preds
|
bulwahn@35324
|
1493 |
(* extramodes contains all modes of all constants, should we only use the necessary ones
|
bulwahn@35324
|
1494 |
- what is the impact on performance? *)
|
bulwahn@36251
|
1495 |
fun predname_of (Prem t) =
|
bulwahn@36251
|
1496 |
(case try dest_Const (fst (strip_comb t)) of SOME (c, _) => insert (op =) c | NONE => I)
|
bulwahn@36251
|
1497 |
| predname_of (Negprem t) =
|
bulwahn@36251
|
1498 |
(case try dest_Const (fst (strip_comb t)) of SOME (c, _) => insert (op =) c | NONE => I)
|
bulwahn@36251
|
1499 |
| predname_of _ = I
|
bulwahn@36251
|
1500 |
val relevant_prednames = fold (fn (_, clauses') =>
|
bulwahn@36251
|
1501 |
fold (fn (_, ps) => fold Term.add_const_names (map dest_indprem ps)) clauses') clauses []
|
bulwahn@35324
|
1502 |
val extra_modes =
|
bulwahn@35324
|
1503 |
if #infer_pos_and_neg_modes mode_analysis_options then
|
bulwahn@33752
|
1504 |
let
|
bulwahn@35324
|
1505 |
val pos_extra_modes =
|
bulwahn@36994
|
1506 |
map_filter (fn name => Option.map (pair name) (try (modes_of compilation ctxt) name))
|
bulwahn@36251
|
1507 |
relevant_prednames
|
bulwahn@36251
|
1508 |
|> filter_out (fn (name, _) => member (op =) prednames name)
|
bulwahn@35324
|
1509 |
val neg_extra_modes =
|
bulwahn@36251
|
1510 |
map_filter (fn name => Option.map (pair name)
|
bulwahn@36994
|
1511 |
(try (modes_of (negative_compilation_of compilation) ctxt) name))
|
bulwahn@36251
|
1512 |
relevant_prednames
|
bulwahn@35324
|
1513 |
|> filter_out (fn (name, _) => member (op =) prednames name)
|
bulwahn@35324
|
1514 |
in
|
bulwahn@35324
|
1515 |
map (fn (s, ms) => (s, (add_polarity_and_random_bit s true ms)
|
bulwahn@35324
|
1516 |
@ add_polarity_and_random_bit s false (the (AList.lookup (op =) neg_extra_modes s))))
|
bulwahn@35324
|
1517 |
pos_extra_modes
|
bulwahn@35324
|
1518 |
end
|
bulwahn@35324
|
1519 |
else
|
bulwahn@35324
|
1520 |
map (fn (s, ms) => (s, (add_polarity_and_random_bit s true ms)))
|
bulwahn@36994
|
1521 |
(map_filter (fn name => Option.map (pair name) (try (modes_of compilation ctxt) name))
|
bulwahn@36251
|
1522 |
relevant_prednames
|
bulwahn@36251
|
1523 |
|> filter_out (fn (name, _) => member (op =) prednames name))
|
bulwahn@35324
|
1524 |
val _ = print_extra_modes options extra_modes
|
bulwahn@35324
|
1525 |
val start_modes =
|
bulwahn@35324
|
1526 |
if #infer_pos_and_neg_modes mode_analysis_options then
|
bulwahn@35324
|
1527 |
map (fn (s, ms) => (s, map (fn m => ((true, m), false)) ms @
|
bulwahn@35324
|
1528 |
(map (fn m => ((false, m), false)) ms))) all_modes
|
bulwahn@35324
|
1529 |
else
|
bulwahn@35324
|
1530 |
map (fn (s, ms) => (s, map (fn m => ((true, m), false)) ms)) all_modes
|
bulwahn@35324
|
1531 |
fun iteration modes = map
|
bulwahn@36994
|
1532 |
(check_modes_pred' mode_analysis_options options ctxt param_vs clauses
|
bulwahn@36022
|
1533 |
(modes @ extra_modes)) modes
|
bulwahn@35324
|
1534 |
val ((modes : (string * ((bool * mode) * bool) list) list), errors) =
|
bulwahn@35324
|
1535 |
Output.cond_timeit false "Fixpount computation of mode analysis" (fn () =>
|
bulwahn@35324
|
1536 |
if collect_errors then
|
bulwahn@35324
|
1537 |
fixp_with_state (fn (modes, errors) =>
|
bulwahn@35324
|
1538 |
let
|
bulwahn@35324
|
1539 |
val (modes', new_errors) = split_list (iteration modes)
|
bulwahn@35324
|
1540 |
in (modes', errors @ flat new_errors) end) (start_modes, [])
|
bulwahn@35324
|
1541 |
else
|
bulwahn@35324
|
1542 |
(fixp (fn modes => map fst (iteration modes)) start_modes, []))
|
bulwahn@36994
|
1543 |
val moded_clauses = map (get_modes_pred' mode_analysis_options ctxt param_vs clauses
|
bulwahn@35324
|
1544 |
(modes @ extra_modes)) modes
|
bulwahn@34935
|
1545 |
val thy' = fold (fn (s, ms) => if member (op =) (map fst preds) s then
|
bulwahn@35324
|
1546 |
set_needs_random s (map_filter (fn ((true, m), true) => SOME m | _ => NONE) ms) else I)
|
bulwahn@35324
|
1547 |
modes thy
|
bulwahn@32667
|
1548 |
in
|
bulwahn@35324
|
1549 |
((moded_clauses, errors), thy')
|
bulwahn@32667
|
1550 |
end;
|
bulwahn@32667
|
1551 |
|
bulwahn@32667
|
1552 |
(* term construction *)
|
bulwahn@32667
|
1553 |
|
bulwahn@32667
|
1554 |
fun mk_v (names, vs) s T = (case AList.lookup (op =) vs s of
|
bulwahn@32667
|
1555 |
NONE => (Free (s, T), (names, (s, [])::vs))
|
bulwahn@32667
|
1556 |
| SOME xs =>
|
bulwahn@32667
|
1557 |
let
|
bulwahn@32667
|
1558 |
val s' = Name.variant names s;
|
bulwahn@32667
|
1559 |
val v = Free (s', T)
|
bulwahn@32667
|
1560 |
in
|
bulwahn@32667
|
1561 |
(v, (s'::names, AList.update (op =) (s, v::xs) vs))
|
bulwahn@32667
|
1562 |
end);
|
bulwahn@32667
|
1563 |
|
bulwahn@32667
|
1564 |
fun distinct_v (Free (s, T)) nvs = mk_v nvs s T
|
bulwahn@32667
|
1565 |
| distinct_v (t $ u) nvs =
|
bulwahn@32667
|
1566 |
let
|
bulwahn@32667
|
1567 |
val (t', nvs') = distinct_v t nvs;
|
bulwahn@32667
|
1568 |
val (u', nvs'') = distinct_v u nvs';
|
bulwahn@32667
|
1569 |
in (t' $ u', nvs'') end
|
bulwahn@32667
|
1570 |
| distinct_v x nvs = (x, nvs);
|
bulwahn@32667
|
1571 |
|
bulwahn@33147
|
1572 |
(** specific rpred functions -- move them to the correct place in this file *)
|
bulwahn@33147
|
1573 |
|
bulwahn@33147
|
1574 |
fun mk_Eval_of additional_arguments ((x, T), NONE) names = (x, names)
|
bulwahn@33147
|
1575 |
| mk_Eval_of additional_arguments ((x, T), SOME mode) names =
|
wenzelm@33268
|
1576 |
let
|
bulwahn@33147
|
1577 |
val Ts = binder_types T
|
wenzelm@33268
|
1578 |
fun mk_split_lambda [] t = lambda (Free (Name.variant names "x", HOLogic.unitT)) t
|
wenzelm@33268
|
1579 |
| mk_split_lambda [x] t = lambda x t
|
wenzelm@33268
|
1580 |
| mk_split_lambda xs t =
|
wenzelm@33268
|
1581 |
let
|
wenzelm@33268
|
1582 |
fun mk_split_lambda' (x::y::[]) t = HOLogic.mk_split (lambda x (lambda y t))
|
wenzelm@33268
|
1583 |
| mk_split_lambda' (x::xs) t = HOLogic.mk_split (lambda x (mk_split_lambda' xs t))
|
wenzelm@33268
|
1584 |
in
|
wenzelm@33268
|
1585 |
mk_split_lambda' xs t
|
wenzelm@33268
|
1586 |
end;
|
wenzelm@33268
|
1587 |
fun mk_arg (i, T) =
|
wenzelm@33268
|
1588 |
let
|
wenzelm@33268
|
1589 |
val vname = Name.variant names ("x" ^ string_of_int i)
|
wenzelm@33268
|
1590 |
val default = Free (vname, T)
|
wenzelm@33268
|
1591 |
in
|
wenzelm@33268
|
1592 |
case AList.lookup (op =) mode i of
|
wenzelm@33268
|
1593 |
NONE => (([], [default]), [default])
|
wenzelm@33268
|
1594 |
| SOME NONE => (([default], []), [default])
|
wenzelm@33268
|
1595 |
| SOME (SOME pis) =>
|
wenzelm@33268
|
1596 |
case HOLogic.strip_tupleT T of
|
wenzelm@33268
|
1597 |
[] => error "pair mode but unit tuple" (*(([default], []), [default])*)
|
wenzelm@33268
|
1598 |
| [_] => error "pair mode but not a tuple" (*(([default], []), [default])*)
|
wenzelm@33268
|
1599 |
| Ts =>
|
wenzelm@33268
|
1600 |
let
|
wenzelm@33268
|
1601 |
val vnames = Name.variant_list names
|
wenzelm@33268
|
1602 |
(map (fn j => "x" ^ string_of_int i ^ "p" ^ string_of_int j)
|
wenzelm@33268
|
1603 |
(1 upto length Ts))
|
bulwahn@33629
|
1604 |
val args = map2 (curry Free) vnames Ts
|
wenzelm@33268
|
1605 |
fun split_args (i, arg) (ins, outs) =
|
wenzelm@33268
|
1606 |
if member (op =) pis i then
|
wenzelm@33268
|
1607 |
(arg::ins, outs)
|
wenzelm@33268
|
1608 |
else
|
wenzelm@33268
|
1609 |
(ins, arg::outs)
|
wenzelm@33268
|
1610 |
val (inargs, outargs) = fold_rev split_args ((1 upto length Ts) ~~ args) ([], [])
|
wenzelm@33268
|
1611 |
fun tuple args = if null args then [] else [HOLogic.mk_tuple args]
|
wenzelm@33268
|
1612 |
in ((tuple inargs, tuple outargs), args) end
|
wenzelm@33268
|
1613 |
end
|
wenzelm@33268
|
1614 |
val (inoutargs, args) = split_list (map mk_arg (1 upto (length Ts) ~~ Ts))
|
bulwahn@33147
|
1615 |
val (inargs, outargs) = pairself flat (split_list inoutargs)
|
wenzelm@33268
|
1616 |
val r = PredicateCompFuns.mk_Eval
|
bulwahn@33148
|
1617 |
(list_comb (x, inargs @ additional_arguments), HOLogic.mk_tuple outargs)
|
bulwahn@33147
|
1618 |
val t = fold_rev mk_split_lambda args r
|
bulwahn@33147
|
1619 |
in
|
bulwahn@33147
|
1620 |
(t, names)
|
bulwahn@33147
|
1621 |
end;
|
bulwahn@33147
|
1622 |
|
bulwahn@34935
|
1623 |
(* TODO: uses param_vs -- change necessary for compilation with new modes *)
|
bulwahn@36013
|
1624 |
fun compile_arg compilation_modifiers additional_arguments ctxt param_vs iss arg =
|
bulwahn@33147
|
1625 |
let
|
bulwahn@33147
|
1626 |
fun map_params (t as Free (f, T)) =
|
bulwahn@33147
|
1627 |
if member (op =) param_vs f then
|
bulwahn@34935
|
1628 |
case (AList.lookup (op =) (param_vs ~~ iss) f) of
|
bulwahn@33147
|
1629 |
SOME is =>
|
bulwahn@33147
|
1630 |
let
|
bulwahn@34935
|
1631 |
val _ = error "compile_arg: A parameter in a input position -- do we have a test case?"
|
bulwahn@34935
|
1632 |
val T' = Comp_Mod.funT_of compilation_modifiers is T
|
bulwahn@34935
|
1633 |
in t(*fst (mk_Eval_of additional_arguments ((Free (f, T'), T), is) [])*) end
|
bulwahn@33147
|
1634 |
| NONE => t
|
bulwahn@33147
|
1635 |
else t
|
bulwahn@33147
|
1636 |
| map_params t = t
|
bulwahn@33147
|
1637 |
in map_aterms map_params arg end
|
bulwahn@33147
|
1638 |
|
bulwahn@36013
|
1639 |
fun compile_match compilation_modifiers additional_arguments
|
bulwahn@35891
|
1640 |
param_vs iss ctxt eqs eqs' out_ts success_t =
|
bulwahn@32667
|
1641 |
let
|
bulwahn@36013
|
1642 |
val compfuns = Comp_Mod.compfuns compilation_modifiers
|
bulwahn@32667
|
1643 |
val eqs'' = maps mk_eq eqs @ eqs'
|
bulwahn@33147
|
1644 |
val eqs'' =
|
bulwahn@36013
|
1645 |
map (compile_arg compilation_modifiers additional_arguments ctxt param_vs iss) eqs''
|
bulwahn@32667
|
1646 |
val names = fold Term.add_free_names (success_t :: eqs'' @ out_ts) [];
|
bulwahn@32667
|
1647 |
val name = Name.variant names "x";
|
bulwahn@32667
|
1648 |
val name' = Name.variant (name :: names) "y";
|
bulwahn@33148
|
1649 |
val T = HOLogic.mk_tupleT (map fastype_of out_ts);
|
bulwahn@32667
|
1650 |
val U = fastype_of success_t;
|
bulwahn@36254
|
1651 |
val U' = dest_predT compfuns U;
|
bulwahn@32667
|
1652 |
val v = Free (name, T);
|
bulwahn@32667
|
1653 |
val v' = Free (name', T);
|
bulwahn@32667
|
1654 |
in
|
bulwahn@35891
|
1655 |
lambda v (fst (Datatype.make_case ctxt Datatype_Case.Quiet [] v
|
bulwahn@33148
|
1656 |
[(HOLogic.mk_tuple out_ts,
|
bulwahn@32667
|
1657 |
if null eqs'' then success_t
|
bulwahn@32667
|
1658 |
else Const (@{const_name HOL.If}, HOLogic.boolT --> U --> U --> U) $
|
bulwahn@32667
|
1659 |
foldr1 HOLogic.mk_conj eqs'' $ success_t $
|
bulwahn@32667
|
1660 |
mk_bot compfuns U'),
|
bulwahn@32667
|
1661 |
(v', mk_bot compfuns U')]))
|
bulwahn@32667
|
1662 |
end;
|
bulwahn@32667
|
1663 |
|
bulwahn@35891
|
1664 |
fun string_of_tderiv ctxt (t, deriv) =
|
bulwahn@35324
|
1665 |
(case (t, deriv) of
|
bulwahn@35324
|
1666 |
(t1 $ t2, Mode_App (deriv1, deriv2)) =>
|
bulwahn@35891
|
1667 |
string_of_tderiv ctxt (t1, deriv1) ^ " $ " ^ string_of_tderiv ctxt (t2, deriv2)
|
bulwahn@35324
|
1668 |
| (Const ("Pair", _) $ t1 $ t2, Mode_Pair (deriv1, deriv2)) =>
|
bulwahn@35891
|
1669 |
"(" ^ string_of_tderiv ctxt (t1, deriv1) ^ ", " ^ string_of_tderiv ctxt (t2, deriv2) ^ ")"
|
bulwahn@35891
|
1670 |
| (t, Term Input) => Syntax.string_of_term ctxt t ^ "[Input]"
|
bulwahn@35891
|
1671 |
| (t, Term Output) => Syntax.string_of_term ctxt t ^ "[Output]"
|
bulwahn@35891
|
1672 |
| (t, Context m) => Syntax.string_of_term ctxt t ^ "[" ^ string_of_mode m ^ "]")
|
bulwahn@35324
|
1673 |
|
bulwahn@36014
|
1674 |
fun compile_expr compilation_modifiers ctxt (t, deriv) additional_arguments =
|
bulwahn@32667
|
1675 |
let
|
bulwahn@36013
|
1676 |
val compfuns = Comp_Mod.compfuns compilation_modifiers
|
bulwahn@34935
|
1677 |
fun expr_of (t, deriv) =
|
bulwahn@34935
|
1678 |
(case (t, deriv) of
|
bulwahn@34935
|
1679 |
(t, Term Input) => SOME t
|
bulwahn@34935
|
1680 |
| (t, Term Output) => NONE
|
bulwahn@34935
|
1681 |
| (Const (name, T), Context mode) =>
|
bulwahn@36994
|
1682 |
(case alternative_compilation_of ctxt name mode of
|
bulwahn@36032
|
1683 |
SOME alt_comp => SOME (alt_comp compfuns T)
|
bulwahn@36028
|
1684 |
| NONE =>
|
bulwahn@36028
|
1685 |
SOME (Const (function_name_of (Comp_Mod.compilation compilation_modifiers)
|
bulwahn@36994
|
1686 |
ctxt name mode,
|
bulwahn@36028
|
1687 |
Comp_Mod.funT_of compilation_modifiers mode T)))
|
bulwahn@34935
|
1688 |
| (Free (s, T), Context m) =>
|
bulwahn@34935
|
1689 |
SOME (Free (s, Comp_Mod.funT_of compilation_modifiers m T))
|
bulwahn@34935
|
1690 |
| (t, Context m) =>
|
bulwahn@34935
|
1691 |
let
|
bulwahn@34935
|
1692 |
val bs = map (pair "x") (binder_types (fastype_of t))
|
bulwahn@34935
|
1693 |
val bounds = map Bound (rev (0 upto (length bs) - 1))
|
bulwahn@34935
|
1694 |
in SOME (list_abs (bs, mk_if compfuns (list_comb (t, bounds)))) end
|
bulwahn@34935
|
1695 |
| (Const ("Pair", _) $ t1 $ t2, Mode_Pair (d1, d2)) =>
|
bulwahn@34935
|
1696 |
(case (expr_of (t1, d1), expr_of (t2, d2)) of
|
bulwahn@34935
|
1697 |
(NONE, NONE) => NONE
|
bulwahn@34935
|
1698 |
| (NONE, SOME t) => SOME t
|
bulwahn@34935
|
1699 |
| (SOME t, NONE) => SOME t
|
bulwahn@34935
|
1700 |
| (SOME t1, SOME t2) => SOME (HOLogic.mk_prod (t1, t2)))
|
bulwahn@34935
|
1701 |
| (t1 $ t2, Mode_App (deriv1, deriv2)) =>
|
bulwahn@34935
|
1702 |
(case (expr_of (t1, deriv1), expr_of (t2, deriv2)) of
|
bulwahn@34935
|
1703 |
(SOME t, NONE) => SOME t
|
bulwahn@34935
|
1704 |
| (SOME t, SOME u) => SOME (t $ u)
|
bulwahn@34935
|
1705 |
| _ => error "something went wrong here!"))
|
bulwahn@32667
|
1706 |
in
|
bulwahn@35879
|
1707 |
list_comb (the (expr_of (t, deriv)), additional_arguments)
|
bulwahn@34935
|
1708 |
end
|
bulwahn@33145
|
1709 |
|
bulwahn@36013
|
1710 |
fun compile_clause compilation_modifiers ctxt all_vs param_vs additional_arguments
|
bulwahn@36254
|
1711 |
mode inp (in_ts, out_ts) moded_ps =
|
bulwahn@32667
|
1712 |
let
|
bulwahn@36013
|
1713 |
val compfuns = Comp_Mod.compfuns compilation_modifiers
|
bulwahn@36254
|
1714 |
val iss = ho_arg_modes_of mode (* FIXME! *)
|
bulwahn@36013
|
1715 |
val compile_match = compile_match compilation_modifiers
|
bulwahn@35891
|
1716 |
additional_arguments param_vs iss ctxt
|
bulwahn@32667
|
1717 |
val (in_ts', (all_vs', eqs)) =
|
bulwahn@35891
|
1718 |
fold_map (collect_non_invertible_subterms ctxt) in_ts (all_vs, []);
|
bulwahn@32667
|
1719 |
fun compile_prems out_ts' vs names [] =
|
bulwahn@32667
|
1720 |
let
|
bulwahn@32667
|
1721 |
val (out_ts'', (names', eqs')) =
|
bulwahn@35891
|
1722 |
fold_map (collect_non_invertible_subterms ctxt) out_ts' (names, []);
|
bulwahn@32667
|
1723 |
val (out_ts''', (names'', constr_vs)) = fold_map distinct_v
|
bulwahn@32667
|
1724 |
out_ts'' (names', map (rpair []) vs);
|
bulwahn@32667
|
1725 |
in
|
bulwahn@33147
|
1726 |
compile_match constr_vs (eqs @ eqs') out_ts'''
|
bulwahn@33148
|
1727 |
(mk_single compfuns (HOLogic.mk_tuple out_ts))
|
bulwahn@32667
|
1728 |
end
|
bulwahn@34935
|
1729 |
| compile_prems out_ts vs names ((p, deriv) :: ps) =
|
bulwahn@32667
|
1730 |
let
|
bulwahn@32667
|
1731 |
val vs' = distinct (op =) (flat (vs :: map term_vs out_ts));
|
bulwahn@32667
|
1732 |
val (out_ts', (names', eqs)) =
|
bulwahn@35891
|
1733 |
fold_map (collect_non_invertible_subterms ctxt) out_ts (names, [])
|
bulwahn@32667
|
1734 |
val (out_ts'', (names'', constr_vs')) = fold_map distinct_v
|
bulwahn@32667
|
1735 |
out_ts' ((names', map (rpair []) vs))
|
bulwahn@34935
|
1736 |
val mode = head_mode_of deriv
|
bulwahn@33143
|
1737 |
val additional_arguments' =
|
bulwahn@33330
|
1738 |
Comp_Mod.transform_additional_arguments compilation_modifiers p additional_arguments
|
bulwahn@32667
|
1739 |
val (compiled_clause, rest) = case p of
|
bulwahn@34935
|
1740 |
Prem t =>
|
bulwahn@32667
|
1741 |
let
|
bulwahn@33138
|
1742 |
val u =
|
bulwahn@36014
|
1743 |
compile_expr compilation_modifiers ctxt (t, deriv) additional_arguments'
|
bulwahn@34935
|
1744 |
val (_, out_ts''') = split_mode mode (snd (strip_comb t))
|
bulwahn@32667
|
1745 |
val rest = compile_prems out_ts''' vs' names'' ps
|
bulwahn@32667
|
1746 |
in
|
bulwahn@32667
|
1747 |
(u, rest)
|
bulwahn@32667
|
1748 |
end
|
bulwahn@34935
|
1749 |
| Negprem t =>
|
bulwahn@32667
|
1750 |
let
|
bulwahn@36013
|
1751 |
val neg_compilation_modifiers =
|
bulwahn@36013
|
1752 |
negative_comp_modifiers_of compilation_modifiers
|
bulwahn@33143
|
1753 |
val u = mk_not compfuns
|
bulwahn@36014
|
1754 |
(compile_expr neg_compilation_modifiers ctxt (t, deriv) additional_arguments')
|
bulwahn@34935
|
1755 |
val (_, out_ts''') = split_mode mode (snd (strip_comb t))
|
bulwahn@32667
|
1756 |
val rest = compile_prems out_ts''' vs' names'' ps
|
bulwahn@32667
|
1757 |
in
|
bulwahn@32667
|
1758 |
(u, rest)
|
bulwahn@32667
|
1759 |
end
|
bulwahn@32667
|
1760 |
| Sidecond t =>
|
bulwahn@32667
|
1761 |
let
|
bulwahn@36013
|
1762 |
val t = compile_arg compilation_modifiers additional_arguments
|
bulwahn@35891
|
1763 |
ctxt param_vs iss t
|
bulwahn@32667
|
1764 |
val rest = compile_prems [] vs' names'' ps;
|
bulwahn@32667
|
1765 |
in
|
bulwahn@32667
|
1766 |
(mk_if compfuns t, rest)
|
bulwahn@32667
|
1767 |
end
|
bulwahn@32667
|
1768 |
| Generator (v, T) =>
|
bulwahn@32667
|
1769 |
let
|
bulwahn@35880
|
1770 |
val u = Comp_Mod.mk_random compilation_modifiers T additional_arguments
|
bulwahn@32667
|
1771 |
val rest = compile_prems [Free (v, T)] vs' names'' ps;
|
bulwahn@32667
|
1772 |
in
|
bulwahn@32667
|
1773 |
(u, rest)
|
bulwahn@32667
|
1774 |
end
|
bulwahn@32667
|
1775 |
in
|
bulwahn@33147
|
1776 |
compile_match constr_vs' eqs out_ts''
|
bulwahn@32667
|
1777 |
(mk_bind compfuns (compiled_clause, rest))
|
bulwahn@32667
|
1778 |
end
|
bulwahn@32667
|
1779 |
val prem_t = compile_prems in_ts' param_vs all_vs' moded_ps;
|
bulwahn@32667
|
1780 |
in
|
bulwahn@32667
|
1781 |
mk_bind compfuns (mk_single compfuns inp, prem_t)
|
bulwahn@32667
|
1782 |
end
|
bulwahn@32667
|
1783 |
|
bulwahn@36254
|
1784 |
(* switch detection *)
|
bulwahn@36254
|
1785 |
|
bulwahn@36254
|
1786 |
(** argument position of an inductive predicates and the executable functions **)
|
bulwahn@36254
|
1787 |
|
bulwahn@36254
|
1788 |
type position = int * int list
|
bulwahn@36254
|
1789 |
|
bulwahn@36254
|
1790 |
fun input_positions_pair Input = [[]]
|
bulwahn@36254
|
1791 |
| input_positions_pair Output = []
|
bulwahn@36254
|
1792 |
| input_positions_pair (Fun _) = []
|
bulwahn@36254
|
1793 |
| input_positions_pair (Pair (m1, m2)) =
|
bulwahn@36254
|
1794 |
map (cons 1) (input_positions_pair m1) @ map (cons 2) (input_positions_pair m2)
|
bulwahn@36254
|
1795 |
|
bulwahn@36254
|
1796 |
fun input_positions_of_mode mode = flat (map_index
|
bulwahn@36254
|
1797 |
(fn (i, Input) => [(i, [])]
|
bulwahn@36254
|
1798 |
| (_, Output) => []
|
bulwahn@36254
|
1799 |
| (_, Fun _) => []
|
bulwahn@36254
|
1800 |
| (i, m as Pair (m1, m2)) => map (pair i) (input_positions_pair m))
|
bulwahn@36254
|
1801 |
(Predicate_Compile_Aux.strip_fun_mode mode))
|
bulwahn@36254
|
1802 |
|
bulwahn@36254
|
1803 |
fun argument_position_pair mode [] = []
|
bulwahn@36254
|
1804 |
| argument_position_pair (Pair (Fun _, m2)) (2 :: is) = argument_position_pair m2 is
|
bulwahn@36254
|
1805 |
| argument_position_pair (Pair (m1, m2)) (i :: is) =
|
bulwahn@36254
|
1806 |
(if eq_mode (m1, Output) andalso i = 2 then
|
bulwahn@36254
|
1807 |
argument_position_pair m2 is
|
bulwahn@36254
|
1808 |
else if eq_mode (m2, Output) andalso i = 1 then
|
bulwahn@36254
|
1809 |
argument_position_pair m1 is
|
bulwahn@36254
|
1810 |
else (i :: argument_position_pair (if i = 1 then m1 else m2) is))
|
bulwahn@36254
|
1811 |
|
bulwahn@36254
|
1812 |
fun argument_position_of mode (i, is) =
|
bulwahn@36254
|
1813 |
(i - (length (filter (fn Output => true | Fun _ => true | _ => false)
|
bulwahn@36254
|
1814 |
(List.take (strip_fun_mode mode, i)))),
|
bulwahn@36254
|
1815 |
argument_position_pair (nth (strip_fun_mode mode) i) is)
|
bulwahn@36254
|
1816 |
|
bulwahn@36254
|
1817 |
fun nth_pair [] t = t
|
bulwahn@36254
|
1818 |
| nth_pair (1 :: is) (Const (@{const_name Pair}, _) $ t1 $ _) = nth_pair is t1
|
bulwahn@36254
|
1819 |
| nth_pair (2 :: is) (Const (@{const_name Pair}, _) $ _ $ t2) = nth_pair is t2
|
bulwahn@36254
|
1820 |
| nth_pair _ _ = raise Fail "unexpected input for nth_tuple"
|
bulwahn@36254
|
1821 |
|
bulwahn@36254
|
1822 |
(** switch detection analysis **)
|
bulwahn@36254
|
1823 |
|
bulwahn@36254
|
1824 |
fun find_switch_test thy (i, is) (ts, prems) =
|
bulwahn@36254
|
1825 |
let
|
bulwahn@36254
|
1826 |
val t = nth_pair is (nth ts i)
|
bulwahn@36254
|
1827 |
val T = fastype_of t
|
bulwahn@36254
|
1828 |
in
|
bulwahn@36254
|
1829 |
case T of
|
bulwahn@36254
|
1830 |
TFree _ => NONE
|
bulwahn@36254
|
1831 |
| Type (Tcon, _) =>
|
bulwahn@36254
|
1832 |
(case Datatype_Data.get_constrs thy Tcon of
|
bulwahn@36254
|
1833 |
NONE => NONE
|
bulwahn@36254
|
1834 |
| SOME cs =>
|
bulwahn@36254
|
1835 |
(case strip_comb t of
|
bulwahn@36254
|
1836 |
(Var _, []) => NONE
|
bulwahn@36254
|
1837 |
| (Free _, []) => NONE
|
bulwahn@36254
|
1838 |
| (Const (c, T), _) => if AList.defined (op =) cs c then SOME (c, T) else NONE))
|
bulwahn@36254
|
1839 |
end
|
bulwahn@36254
|
1840 |
|
bulwahn@36254
|
1841 |
fun partition_clause thy pos moded_clauses =
|
bulwahn@36254
|
1842 |
let
|
bulwahn@36254
|
1843 |
fun insert_list eq (key, value) = AList.map_default eq (key, []) (cons value)
|
bulwahn@36254
|
1844 |
fun find_switch_test' moded_clause (cases, left) =
|
bulwahn@36254
|
1845 |
case find_switch_test thy pos moded_clause of
|
bulwahn@36254
|
1846 |
SOME (c, T) => (insert_list (op =) ((c, T), moded_clause) cases, left)
|
bulwahn@36254
|
1847 |
| NONE => (cases, moded_clause :: left)
|
bulwahn@36254
|
1848 |
in
|
bulwahn@36254
|
1849 |
fold find_switch_test' moded_clauses ([], [])
|
bulwahn@36254
|
1850 |
end
|
bulwahn@36254
|
1851 |
|
bulwahn@36254
|
1852 |
datatype switch_tree =
|
bulwahn@36254
|
1853 |
Atom of moded_clause list | Node of (position * ((string * typ) * switch_tree) list) * switch_tree
|
bulwahn@36254
|
1854 |
|
bulwahn@36254
|
1855 |
fun mk_switch_tree thy mode moded_clauses =
|
bulwahn@36254
|
1856 |
let
|
bulwahn@36254
|
1857 |
fun select_best_switch moded_clauses input_position best_switch =
|
bulwahn@36254
|
1858 |
let
|
bulwahn@36254
|
1859 |
val ord = option_ord (rev_order o int_ord o (pairself (length o snd o snd)))
|
bulwahn@36254
|
1860 |
val partition = partition_clause thy input_position moded_clauses
|
bulwahn@36254
|
1861 |
val switch = if (length (fst partition) > 1) then SOME (input_position, partition) else NONE
|
bulwahn@36254
|
1862 |
in
|
bulwahn@36254
|
1863 |
case ord (switch, best_switch) of LESS => best_switch
|
bulwahn@36254
|
1864 |
| EQUAL => best_switch | GREATER => switch
|
bulwahn@36254
|
1865 |
end
|
bulwahn@36254
|
1866 |
fun detect_switches moded_clauses =
|
bulwahn@36254
|
1867 |
case fold (select_best_switch moded_clauses) (input_positions_of_mode mode) NONE of
|
bulwahn@36254
|
1868 |
SOME (best_pos, (switched_on, left_clauses)) =>
|
bulwahn@36254
|
1869 |
Node ((best_pos, map (apsnd detect_switches) switched_on),
|
bulwahn@36254
|
1870 |
detect_switches left_clauses)
|
bulwahn@36254
|
1871 |
| NONE => Atom moded_clauses
|
bulwahn@36254
|
1872 |
in
|
bulwahn@36254
|
1873 |
detect_switches moded_clauses
|
bulwahn@36254
|
1874 |
end
|
bulwahn@36254
|
1875 |
|
bulwahn@36254
|
1876 |
(** compilation of detected switches **)
|
bulwahn@36254
|
1877 |
|
bulwahn@36254
|
1878 |
fun destruct_constructor_pattern (pat, obj) =
|
bulwahn@36254
|
1879 |
(case strip_comb pat of
|
bulwahn@36254
|
1880 |
(f as Free _, []) => cons (pat, obj)
|
bulwahn@36254
|
1881 |
| (Const (c, T), pat_args) =>
|
bulwahn@36254
|
1882 |
(case strip_comb obj of
|
bulwahn@36254
|
1883 |
(Const (c', T'), obj_args) =>
|
bulwahn@36254
|
1884 |
(if c = c' andalso T = T' then
|
bulwahn@36254
|
1885 |
fold destruct_constructor_pattern (pat_args ~~ obj_args)
|
bulwahn@36254
|
1886 |
else raise Fail "pattern and object mismatch")
|
bulwahn@36254
|
1887 |
| _ => raise Fail "unexpected object")
|
bulwahn@36254
|
1888 |
| _ => raise Fail "unexpected pattern")
|
bulwahn@36254
|
1889 |
|
bulwahn@36254
|
1890 |
|
bulwahn@36254
|
1891 |
fun compile_switch compilation_modifiers ctxt all_vs param_vs additional_arguments mode
|
bulwahn@36254
|
1892 |
in_ts' outTs switch_tree =
|
bulwahn@36254
|
1893 |
let
|
bulwahn@36254
|
1894 |
val compfuns = Comp_Mod.compfuns compilation_modifiers
|
bulwahn@36254
|
1895 |
val thy = ProofContext.theory_of ctxt
|
bulwahn@36254
|
1896 |
fun compile_switch_tree _ _ (Atom []) = NONE
|
bulwahn@36254
|
1897 |
| compile_switch_tree all_vs ctxt_eqs (Atom moded_clauses) =
|
bulwahn@36254
|
1898 |
let
|
bulwahn@36254
|
1899 |
val in_ts' = map (Pattern.rewrite_term thy ctxt_eqs []) in_ts'
|
bulwahn@36254
|
1900 |
fun compile_clause' (ts, moded_ps) =
|
bulwahn@36254
|
1901 |
let
|
bulwahn@36254
|
1902 |
val (ts, out_ts) = split_mode mode ts
|
bulwahn@36254
|
1903 |
val subst = fold destruct_constructor_pattern (in_ts' ~~ ts) []
|
bulwahn@36254
|
1904 |
val (fsubst, pat') = List.partition (fn (_, Free _) => true | _ => false) subst
|
bulwahn@36254
|
1905 |
val moded_ps' = (map o apfst o map_indprem)
|
bulwahn@36254
|
1906 |
(Pattern.rewrite_term thy (map swap fsubst) []) moded_ps
|
bulwahn@36254
|
1907 |
val inp = HOLogic.mk_tuple (map fst pat')
|
bulwahn@36254
|
1908 |
val in_ts' = map (Pattern.rewrite_term thy (map swap fsubst) []) (map snd pat')
|
bulwahn@36254
|
1909 |
val out_ts' = map (Pattern.rewrite_term thy (map swap fsubst) []) out_ts
|
bulwahn@36254
|
1910 |
in
|
bulwahn@36254
|
1911 |
compile_clause compilation_modifiers ctxt all_vs param_vs additional_arguments
|
bulwahn@36254
|
1912 |
mode inp (in_ts', out_ts') moded_ps'
|
bulwahn@36254
|
1913 |
end
|
bulwahn@36254
|
1914 |
in SOME (foldr1 (mk_sup compfuns) (map compile_clause' moded_clauses)) end
|
bulwahn@36254
|
1915 |
| compile_switch_tree all_vs ctxt_eqs (Node ((position, switched_clauses), left_clauses)) =
|
bulwahn@36254
|
1916 |
let
|
bulwahn@36254
|
1917 |
val (i, is) = argument_position_of mode position
|
bulwahn@36254
|
1918 |
val inp_var = nth_pair is (nth in_ts' i)
|
bulwahn@36254
|
1919 |
val x = Name.variant all_vs "x"
|
bulwahn@36254
|
1920 |
val xt = Free (x, fastype_of inp_var)
|
bulwahn@36254
|
1921 |
fun compile_single_case ((c, T), switched) =
|
bulwahn@36254
|
1922 |
let
|
bulwahn@36254
|
1923 |
val Ts = binder_types T
|
bulwahn@36254
|
1924 |
val argnames = Name.variant_list (x :: all_vs)
|
bulwahn@36254
|
1925 |
(map (fn i => "c" ^ string_of_int i) (1 upto length Ts))
|
bulwahn@36254
|
1926 |
val args = map2 (curry Free) argnames Ts
|
bulwahn@36254
|
1927 |
val pattern = list_comb (Const (c, T), args)
|
bulwahn@36254
|
1928 |
val ctxt_eqs' = (inp_var, pattern) :: ctxt_eqs
|
bulwahn@36254
|
1929 |
val compilation = the_default (mk_bot compfuns (HOLogic.mk_tupleT outTs))
|
bulwahn@36254
|
1930 |
(compile_switch_tree (argnames @ x :: all_vs) ctxt_eqs' switched)
|
bulwahn@36254
|
1931 |
in
|
bulwahn@36254
|
1932 |
(pattern, compilation)
|
bulwahn@36254
|
1933 |
end
|
bulwahn@36254
|
1934 |
val switch = fst (Datatype.make_case ctxt Datatype_Case.Quiet [] inp_var
|
bulwahn@36254
|
1935 |
((map compile_single_case switched_clauses) @
|
bulwahn@36254
|
1936 |
[(xt, mk_bot compfuns (HOLogic.mk_tupleT outTs))]))
|
bulwahn@36254
|
1937 |
in
|
bulwahn@36254
|
1938 |
case compile_switch_tree all_vs ctxt_eqs left_clauses of
|
bulwahn@36254
|
1939 |
NONE => SOME switch
|
bulwahn@36254
|
1940 |
| SOME left_comp => SOME (mk_sup compfuns (switch, left_comp))
|
bulwahn@36254
|
1941 |
end
|
bulwahn@36254
|
1942 |
in
|
bulwahn@36254
|
1943 |
compile_switch_tree all_vs [] switch_tree
|
bulwahn@36254
|
1944 |
end
|
bulwahn@36254
|
1945 |
|
bulwahn@36254
|
1946 |
(* compilation of predicates *)
|
bulwahn@36254
|
1947 |
|
bulwahn@36254
|
1948 |
fun compile_pred options compilation_modifiers thy all_vs param_vs s T (pol, mode) moded_cls =
|
bulwahn@32667
|
1949 |
let
|
wenzelm@36633
|
1950 |
val ctxt = ProofContext.init_global thy
|
bulwahn@36014
|
1951 |
val compilation_modifiers = if pol then compilation_modifiers else
|
bulwahn@36014
|
1952 |
negative_comp_modifiers_of compilation_modifiers
|
bulwahn@35879
|
1953 |
val additional_arguments = Comp_Mod.additional_arguments compilation_modifiers
|
bulwahn@33482
|
1954 |
(all_vs @ param_vs)
|
bulwahn@34935
|
1955 |
val compfuns = Comp_Mod.compfuns compilation_modifiers
|
bulwahn@34935
|
1956 |
fun is_param_type (T as Type ("fun",[_ , T'])) =
|
bulwahn@34935
|
1957 |
is_some (try (dest_predT compfuns) T) orelse is_param_type T'
|
bulwahn@34935
|
1958 |
| is_param_type T = is_some (try (dest_predT compfuns) T)
|
bulwahn@34935
|
1959 |
val (inpTs, outTs) = split_map_modeT (fn m => fn T => (SOME (funT_of compfuns m T), NONE)) mode
|
bulwahn@34935
|
1960 |
(binder_types T)
|
bulwahn@34935
|
1961 |
val predT = mk_predT compfuns (HOLogic.mk_tupleT outTs)
|
bulwahn@34935
|
1962 |
val funT = Comp_Mod.funT_of compilation_modifiers mode T
|
bulwahn@34935
|
1963 |
val (in_ts, _) = fold_map (fold_map_aterms_prodT (curry HOLogic.mk_prod)
|
bulwahn@34935
|
1964 |
(fn T => fn (param_vs, names) =>
|
bulwahn@36012
|
1965 |
if is_param_type T then
|
bulwahn@34935
|
1966 |
(Free (hd param_vs, T), (tl param_vs, names))
|
bulwahn@34935
|
1967 |
else
|
bulwahn@34935
|
1968 |
let
|
bulwahn@34935
|
1969 |
val new = Name.variant names "x"
|
bulwahn@34935
|
1970 |
in (Free (new, T), (param_vs, new :: names)) end)) inpTs
|
bulwahn@34935
|
1971 |
(param_vs, (all_vs @ param_vs))
|
bulwahn@34935
|
1972 |
val in_ts' = map_filter (map_filter_prod
|
bulwahn@34935
|
1973 |
(fn t as Free (x, _) => if member (op =) param_vs x then NONE else SOME t | t => SOME t)) in_ts
|
bulwahn@36254
|
1974 |
val compilation =
|
bulwahn@36254
|
1975 |
if detect_switches options then
|
bulwahn@36254
|
1976 |
the_default (mk_bot compfuns (HOLogic.mk_tupleT outTs))
|
bulwahn@36254
|
1977 |
(compile_switch compilation_modifiers ctxt all_vs param_vs additional_arguments
|
bulwahn@36254
|
1978 |
mode in_ts' outTs (mk_switch_tree thy mode moded_cls))
|
bulwahn@36254
|
1979 |
else
|
bulwahn@36254
|
1980 |
let
|
bulwahn@36254
|
1981 |
val cl_ts =
|
bulwahn@36254
|
1982 |
map (fn (ts, moded_prems) =>
|
bulwahn@36254
|
1983 |
compile_clause compilation_modifiers ctxt all_vs param_vs additional_arguments
|
bulwahn@36254
|
1984 |
mode (HOLogic.mk_tuple in_ts') (split_mode mode ts) moded_prems) moded_cls;
|
bulwahn@36254
|
1985 |
in
|
bulwahn@36254
|
1986 |
Comp_Mod.wrap_compilation compilation_modifiers compfuns s T mode additional_arguments
|
bulwahn@36254
|
1987 |
(if null cl_ts then
|
bulwahn@36254
|
1988 |
mk_bot compfuns (HOLogic.mk_tupleT outTs)
|
bulwahn@36254
|
1989 |
else
|
bulwahn@36254
|
1990 |
foldr1 (mk_sup compfuns) cl_ts)
|
bulwahn@36254
|
1991 |
end
|
bulwahn@33143
|
1992 |
val fun_const =
|
bulwahn@35891
|
1993 |
Const (function_name_of (Comp_Mod.compilation compilation_modifiers)
|
bulwahn@36994
|
1994 |
ctxt s mode, funT)
|
bulwahn@32667
|
1995 |
in
|
bulwahn@33143
|
1996 |
HOLogic.mk_Trueprop
|
bulwahn@34935
|
1997 |
(HOLogic.mk_eq (list_comb (fun_const, in_ts @ additional_arguments), compilation))
|
bulwahn@32667
|
1998 |
end;
|
bulwahn@33143
|
1999 |
|
bulwahn@36254
|
2000 |
(** special setup for simpset **)
|
haftmann@34961
|
2001 |
val HOL_basic_ss' = HOL_basic_ss addsimps (@{thms HOL.simp_thms} @ [@{thm Pair_eq}])
|
bulwahn@32667
|
2002 |
setSolver (mk_solver "all_tac_solver" (fn _ => fn _ => all_tac))
|
wenzelm@33268
|
2003 |
setSolver (mk_solver "True_solver" (fn _ => rtac @{thm TrueI}))
|
bulwahn@32667
|
2004 |
|
bulwahn@32667
|
2005 |
(* Definition of executable functions and their intro and elim rules *)
|
bulwahn@32667
|
2006 |
|
bulwahn@32667
|
2007 |
fun print_arities arities = tracing ("Arities:\n" ^
|
bulwahn@32667
|
2008 |
cat_lines (map (fn (s, (ks, k)) => s ^ ": " ^
|
bulwahn@32667
|
2009 |
space_implode " -> " (map
|
bulwahn@32667
|
2010 |
(fn NONE => "X" | SOME k' => string_of_int k')
|
bulwahn@32667
|
2011 |
(ks @ [SOME k]))) arities));
|
bulwahn@32667
|
2012 |
|
bulwahn@34935
|
2013 |
fun split_lambda (x as Free _) t = lambda x t
|
bulwahn@34935
|
2014 |
| split_lambda (Const ("Pair", _) $ t1 $ t2) t =
|
bulwahn@34935
|
2015 |
HOLogic.mk_split (split_lambda t1 (split_lambda t2 t))
|
bulwahn@34935
|
2016 |
| split_lambda (Const ("Product_Type.Unity", _)) t = Abs ("x", HOLogic.unitT, t)
|
bulwahn@34935
|
2017 |
| split_lambda t _ = raise (TERM ("split_lambda", [t]))
|
bulwahn@34935
|
2018 |
|
bulwahn@34935
|
2019 |
fun strip_split_abs (Const ("split", _) $ t) = strip_split_abs t
|
bulwahn@34935
|
2020 |
| strip_split_abs (Abs (_, _, t)) = strip_split_abs t
|
bulwahn@34935
|
2021 |
| strip_split_abs t = t
|
bulwahn@34935
|
2022 |
|
bulwahn@35324
|
2023 |
fun mk_args is_eval (m as Pair (m1, m2), T as Type ("*", [T1, T2])) names =
|
bulwahn@35324
|
2024 |
if eq_mode (m, Input) orelse eq_mode (m, Output) then
|
bulwahn@35324
|
2025 |
let
|
bulwahn@35324
|
2026 |
val x = Name.variant names "x"
|
bulwahn@35324
|
2027 |
in
|
bulwahn@35324
|
2028 |
(Free (x, T), x :: names)
|
bulwahn@35324
|
2029 |
end
|
bulwahn@35324
|
2030 |
else
|
bulwahn@35324
|
2031 |
let
|
bulwahn@35324
|
2032 |
val (t1, names') = mk_args is_eval (m1, T1) names
|
bulwahn@35324
|
2033 |
val (t2, names'') = mk_args is_eval (m2, T2) names'
|
bulwahn@35324
|
2034 |
in
|
bulwahn@35324
|
2035 |
(HOLogic.mk_prod (t1, t2), names'')
|
bulwahn@35324
|
2036 |
end
|
bulwahn@34935
|
2037 |
| mk_args is_eval ((m as Fun _), T) names =
|
bulwahn@34935
|
2038 |
let
|
bulwahn@34935
|
2039 |
val funT = funT_of PredicateCompFuns.compfuns m T
|
bulwahn@34935
|
2040 |
val x = Name.variant names "x"
|
bulwahn@34935
|
2041 |
val (args, _) = fold_map (mk_args is_eval) (strip_fun_mode m ~~ binder_types T) (x :: names)
|
bulwahn@34935
|
2042 |
val (inargs, outargs) = split_map_mode (fn _ => fn t => (SOME t, NONE)) m args
|
bulwahn@34935
|
2043 |
val t = fold_rev split_lambda args (PredicateCompFuns.mk_Eval
|
bulwahn@34935
|
2044 |
(list_comb (Free (x, funT), inargs), HOLogic.mk_tuple outargs))
|
bulwahn@34935
|
2045 |
in
|
bulwahn@34935
|
2046 |
(if is_eval then t else Free (x, funT), x :: names)
|
bulwahn@34935
|
2047 |
end
|
bulwahn@34935
|
2048 |
| mk_args is_eval (_, T) names =
|
bulwahn@34935
|
2049 |
let
|
bulwahn@34935
|
2050 |
val x = Name.variant names "x"
|
bulwahn@34935
|
2051 |
in
|
bulwahn@34935
|
2052 |
(Free (x, T), x :: names)
|
bulwahn@34935
|
2053 |
end
|
bulwahn@34935
|
2054 |
|
bulwahn@36994
|
2055 |
fun create_intro_elim_rule ctxt mode defthm mode_id funT pred =
|
bulwahn@34935
|
2056 |
let
|
bulwahn@34935
|
2057 |
val funtrm = Const (mode_id, funT)
|
bulwahn@34935
|
2058 |
val Ts = binder_types (fastype_of pred)
|
bulwahn@34935
|
2059 |
val (args, argnames) = fold_map (mk_args true) (strip_fun_mode mode ~~ Ts) []
|
bulwahn@34935
|
2060 |
fun strip_eval _ t =
|
bulwahn@34935
|
2061 |
let
|
bulwahn@34935
|
2062 |
val t' = strip_split_abs t
|
bulwahn@34935
|
2063 |
val (r, _) = PredicateCompFuns.dest_Eval t'
|
bulwahn@34935
|
2064 |
in (SOME (fst (strip_comb r)), NONE) end
|
bulwahn@34935
|
2065 |
val (inargs, outargs) = split_map_mode strip_eval mode args
|
bulwahn@34935
|
2066 |
val eval_hoargs = ho_args_of mode args
|
bulwahn@34935
|
2067 |
val hoargTs = ho_argsT_of mode Ts
|
bulwahn@34935
|
2068 |
val hoarg_names' =
|
bulwahn@34935
|
2069 |
Name.variant_list argnames ((map (fn i => "x" ^ string_of_int i)) (1 upto (length hoargTs)))
|
bulwahn@34935
|
2070 |
val hoargs' = map2 (curry Free) hoarg_names' hoargTs
|
bulwahn@34935
|
2071 |
val args' = replace_ho_args mode hoargs' args
|
bulwahn@34935
|
2072 |
val predpropI = HOLogic.mk_Trueprop (list_comb (pred, args'))
|
bulwahn@34935
|
2073 |
val predpropE = HOLogic.mk_Trueprop (list_comb (pred, args))
|
bulwahn@34935
|
2074 |
val param_eqs = map2 (HOLogic.mk_Trueprop oo (curry HOLogic.mk_eq)) eval_hoargs hoargs'
|
bulwahn@34935
|
2075 |
val funpropE = HOLogic.mk_Trueprop (PredicateCompFuns.mk_Eval (list_comb (funtrm, inargs),
|
bulwahn@34935
|
2076 |
if null outargs then Free("y", HOLogic.unitT) else HOLogic.mk_tuple outargs))
|
bulwahn@34935
|
2077 |
val funpropI = HOLogic.mk_Trueprop (PredicateCompFuns.mk_Eval (list_comb (funtrm, inargs),
|
bulwahn@34935
|
2078 |
HOLogic.mk_tuple outargs))
|
bulwahn@34935
|
2079 |
val introtrm = Logic.list_implies (predpropI :: param_eqs, funpropI)
|
bulwahn@34935
|
2080 |
val simprules = [defthm, @{thm eval_pred},
|
bulwahn@34935
|
2081 |
@{thm "split_beta"}, @{thm "fst_conv"}, @{thm "snd_conv"}, @{thm pair_collapse}]
|
bulwahn@34935
|
2082 |
val unfolddef_tac = Simplifier.asm_full_simp_tac (HOL_basic_ss addsimps simprules) 1
|
bulwahn@36994
|
2083 |
val introthm = Goal.prove ctxt
|
bulwahn@34935
|
2084 |
(argnames @ hoarg_names' @ ["y"]) [] introtrm (fn _ => unfolddef_tac)
|
bulwahn@34935
|
2085 |
val P = HOLogic.mk_Trueprop (Free ("P", HOLogic.boolT));
|
bulwahn@34935
|
2086 |
val elimtrm = Logic.list_implies ([funpropE, Logic.mk_implies (predpropE, P)], P)
|
bulwahn@36994
|
2087 |
val elimthm = Goal.prove ctxt
|
bulwahn@34935
|
2088 |
(argnames @ ["y", "P"]) [] elimtrm (fn _ => unfolddef_tac)
|
bulwahn@35884
|
2089 |
val opt_neg_introthm =
|
bulwahn@35884
|
2090 |
if is_all_input mode then
|
bulwahn@35884
|
2091 |
let
|
bulwahn@35884
|
2092 |
val neg_predpropI = HOLogic.mk_Trueprop (HOLogic.mk_not (list_comb (pred, args')))
|
bulwahn@35884
|
2093 |
val neg_funpropI =
|
bulwahn@35884
|
2094 |
HOLogic.mk_Trueprop (PredicateCompFuns.mk_Eval
|
bulwahn@35884
|
2095 |
(PredicateCompFuns.mk_not (list_comb (funtrm, inargs)), HOLogic.unit))
|
bulwahn@35884
|
2096 |
val neg_introtrm = Logic.list_implies (neg_predpropI :: param_eqs, neg_funpropI)
|
bulwahn@35884
|
2097 |
val tac =
|
bulwahn@35884
|
2098 |
Simplifier.asm_full_simp_tac (HOL_basic_ss addsimps
|
bulwahn@35884
|
2099 |
(@{thm if_False} :: @{thm Predicate.not_pred_eq} :: simprules)) 1
|
bulwahn@35884
|
2100 |
THEN rtac @{thm Predicate.singleI} 1
|
bulwahn@36994
|
2101 |
in SOME (Goal.prove ctxt (argnames @ hoarg_names') []
|
bulwahn@35884
|
2102 |
neg_introtrm (fn _ => tac))
|
bulwahn@35884
|
2103 |
end
|
bulwahn@35884
|
2104 |
else NONE
|
bulwahn@34935
|
2105 |
in
|
bulwahn@35884
|
2106 |
((introthm, elimthm), opt_neg_introthm)
|
bulwahn@34935
|
2107 |
end
|
bulwahn@32667
|
2108 |
|
bulwahn@33620
|
2109 |
fun create_constname_of_mode options thy prefix name T mode =
|
bulwahn@32667
|
2110 |
let
|
bulwahn@33626
|
2111 |
val system_proposal = prefix ^ (Long_Name.base_name name)
|
bulwahn@34935
|
2112 |
^ "_" ^ ascii_string_of_mode mode
|
bulwahn@34935
|
2113 |
val name = the_default system_proposal (proposed_names options name mode)
|
bulwahn@32667
|
2114 |
in
|
bulwahn@33620
|
2115 |
Sign.full_bname thy name
|
bulwahn@32667
|
2116 |
end;
|
bulwahn@32667
|
2117 |
|
bulwahn@33620
|
2118 |
fun create_definitions options preds (name, modes) thy =
|
bulwahn@32667
|
2119 |
let
|
bulwahn@32667
|
2120 |
val compfuns = PredicateCompFuns.compfuns
|
bulwahn@32667
|
2121 |
val T = AList.lookup (op =) preds name |> the
|
bulwahn@34935
|
2122 |
fun create_definition mode thy =
|
bulwahn@33752
|
2123 |
let
|
bulwahn@33752
|
2124 |
val mode_cname = create_constname_of_mode options thy "" name T mode
|
bulwahn@33752
|
2125 |
val mode_cbasename = Long_Name.base_name mode_cname
|
bulwahn@34935
|
2126 |
val funT = funT_of compfuns mode T
|
bulwahn@34935
|
2127 |
val (args, _) = fold_map (mk_args true) ((strip_fun_mode mode) ~~ (binder_types T)) []
|
bulwahn@34935
|
2128 |
fun strip_eval m t =
|
bulwahn@33752
|
2129 |
let
|
bulwahn@34935
|
2130 |
val t' = strip_split_abs t
|
bulwahn@34935
|
2131 |
val (r, _) = PredicateCompFuns.dest_Eval t'
|
bulwahn@34935
|
2132 |
in (SOME (fst (strip_comb r)), NONE) end
|
bulwahn@34935
|
2133 |
val (inargs, outargs) = split_map_mode strip_eval mode args
|
bulwahn@34935
|
2134 |
val predterm = fold_rev split_lambda inargs
|
bulwahn@34935
|
2135 |
(PredicateCompFuns.mk_Enum (split_lambda (HOLogic.mk_tuple outargs)
|
bulwahn@34935
|
2136 |
(list_comb (Const (name, T), args))))
|
bulwahn@34935
|
2137 |
val lhs = Const (mode_cname, funT)
|
bulwahn@33752
|
2138 |
val def = Logic.mk_equals (lhs, predterm)
|
bulwahn@33752
|
2139 |
val ([definition], thy') = thy |>
|
bulwahn@33752
|
2140 |
Sign.add_consts_i [(Binding.name mode_cbasename, funT, NoSyn)] |>
|
bulwahn@33752
|
2141 |
PureThy.add_defs false [((Binding.name (mode_cbasename ^ "_def"), def), [])]
|
bulwahn@36994
|
2142 |
val ctxt' = ProofContext.init_global thy'
|
bulwahn@35884
|
2143 |
val rules as ((intro, elim), _) =
|
bulwahn@36994
|
2144 |
create_intro_elim_rule ctxt' mode definition mode_cname funT (Const (name, T))
|
bulwahn@33752
|
2145 |
in thy'
|
bulwahn@34935
|
2146 |
|> set_function_name Pred name mode mode_cname
|
bulwahn@35884
|
2147 |
|> add_predfun_data name mode (definition, rules)
|
bulwahn@33752
|
2148 |
|> PureThy.store_thm (Binding.name (mode_cbasename ^ "I"), intro) |> snd
|
bulwahn@33752
|
2149 |
|> PureThy.store_thm (Binding.name (mode_cbasename ^ "E"), elim) |> snd
|
bulwahn@33752
|
2150 |
|> Theory.checkpoint
|
bulwahn@32667
|
2151 |
end;
|
bulwahn@32667
|
2152 |
in
|
bulwahn@34935
|
2153 |
thy |> defined_function_of Pred name |> fold create_definition modes
|
bulwahn@32667
|
2154 |
end;
|
bulwahn@32667
|
2155 |
|
bulwahn@33620
|
2156 |
fun define_functions comp_modifiers compfuns options preds (name, modes) thy =
|
bulwahn@32667
|
2157 |
let
|
bulwahn@32667
|
2158 |
val T = AList.lookup (op =) preds name |> the
|
bulwahn@32667
|
2159 |
fun create_definition mode thy =
|
bulwahn@32667
|
2160 |
let
|
bulwahn@33485
|
2161 |
val function_name_prefix = Comp_Mod.function_name_prefix comp_modifiers
|
bulwahn@33620
|
2162 |
val mode_cname = create_constname_of_mode options thy function_name_prefix name T mode
|
bulwahn@34935
|
2163 |
val funT = Comp_Mod.funT_of comp_modifiers mode T
|
bulwahn@32667
|
2164 |
in
|
bulwahn@32667
|
2165 |
thy |> Sign.add_consts_i [(Binding.name (Long_Name.base_name mode_cname), funT, NoSyn)]
|
bulwahn@34935
|
2166 |
|> set_function_name (Comp_Mod.compilation comp_modifiers) name mode mode_cname
|
bulwahn@32667
|
2167 |
end;
|
bulwahn@32667
|
2168 |
in
|
bulwahn@34935
|
2169 |
thy
|
bulwahn@34935
|
2170 |
|> defined_function_of (Comp_Mod.compilation comp_modifiers) name
|
bulwahn@34935
|
2171 |
|> fold create_definition modes
|
bulwahn@32667
|
2172 |
end;
|
bulwahn@32672
|
2173 |
|
bulwahn@32667
|
2174 |
(* Proving equivalence of term *)
|
bulwahn@32667
|
2175 |
|
bulwahn@32667
|
2176 |
fun is_Type (Type _) = true
|
bulwahn@32667
|
2177 |
| is_Type _ = false
|
bulwahn@32667
|
2178 |
|
bulwahn@32667
|
2179 |
(* returns true if t is an application of an datatype constructor *)
|
bulwahn@32667
|
2180 |
(* which then consequently would be splitted *)
|
bulwahn@32667
|
2181 |
(* else false *)
|
bulwahn@32667
|
2182 |
fun is_constructor thy t =
|
bulwahn@32667
|
2183 |
if (is_Type (fastype_of t)) then
|
bulwahn@32667
|
2184 |
(case Datatype.get_info thy ((fst o dest_Type o fastype_of) t) of
|
bulwahn@32667
|
2185 |
NONE => false
|
bulwahn@32667
|
2186 |
| SOME info => (let
|
bulwahn@32667
|
2187 |
val constr_consts = maps (fn (_, (_, _, constrs)) => map fst constrs) (#descr info)
|
bulwahn@32667
|
2188 |
val (c, _) = strip_comb t
|
bulwahn@32667
|
2189 |
in (case c of
|
haftmann@36677
|
2190 |
Const (name, _) => member (op =) constr_consts name
|
bulwahn@32667
|
2191 |
| _ => false) end))
|
bulwahn@32667
|
2192 |
else false
|
bulwahn@32667
|
2193 |
|
bulwahn@32667
|
2194 |
(* MAJOR FIXME: prove_params should be simple
|
bulwahn@32667
|
2195 |
- different form of introrule for parameters ? *)
|
bulwahn@34935
|
2196 |
|
bulwahn@35888
|
2197 |
fun prove_param options ctxt nargs t deriv =
|
bulwahn@32667
|
2198 |
let
|
bulwahn@32667
|
2199 |
val (f, args) = strip_comb (Envir.eta_contract t)
|
bulwahn@34935
|
2200 |
val mode = head_mode_of deriv
|
bulwahn@34935
|
2201 |
val param_derivations = param_derivations_of deriv
|
bulwahn@34935
|
2202 |
val ho_args = ho_args_of mode args
|
bulwahn@32667
|
2203 |
val f_tac = case f of
|
bulwahn@32667
|
2204 |
Const (name, T) => simp_tac (HOL_basic_ss addsimps
|
bulwahn@35888
|
2205 |
[@{thm eval_pred}, predfun_definition_of ctxt name mode,
|
bulwahn@35884
|
2206 |
@{thm split_eta}, @{thm split_beta}, @{thm fst_conv},
|
bulwahn@35884
|
2207 |
@{thm snd_conv}, @{thm pair_collapse}, @{thm Product_Type.split_conv}]) 1
|
bulwahn@35884
|
2208 |
| Free _ =>
|
bulwahn@35888
|
2209 |
Subgoal.FOCUS_PREMS (fn {context = ctxt, params = params, prems, asms, concl, schematics} =>
|
bulwahn@35884
|
2210 |
let
|
bulwahn@35884
|
2211 |
val prems' = maps dest_conjunct_prem (take nargs prems)
|
bulwahn@35884
|
2212 |
in
|
bulwahn@35884
|
2213 |
MetaSimplifier.rewrite_goal_tac
|
bulwahn@35884
|
2214 |
(map (fn th => th RS @{thm sym} RS @{thm eq_reflection}) prems') 1
|
bulwahn@35888
|
2215 |
end) ctxt 1
|
bulwahn@35884
|
2216 |
| Abs _ => raise Fail "prove_param: No valid parameter term"
|
bulwahn@32667
|
2217 |
in
|
bulwahn@33753
|
2218 |
REPEAT_DETERM (rtac @{thm ext} 1)
|
bulwahn@35886
|
2219 |
THEN print_tac options "prove_param"
|
bulwahn@35884
|
2220 |
THEN f_tac
|
bulwahn@35886
|
2221 |
THEN print_tac options "after prove_param"
|
bulwahn@32667
|
2222 |
THEN (REPEAT_DETERM (atac 1))
|
bulwahn@35888
|
2223 |
THEN (EVERY (map2 (prove_param options ctxt nargs) ho_args param_derivations))
|
bulwahn@35884
|
2224 |
THEN REPEAT_DETERM (rtac @{thm refl} 1)
|
bulwahn@32667
|
2225 |
end
|
bulwahn@32667
|
2226 |
|
bulwahn@35888
|
2227 |
fun prove_expr options ctxt nargs (premposition : int) (t, deriv) =
|
bulwahn@32667
|
2228 |
case strip_comb t of
|
bulwahn@34935
|
2229 |
(Const (name, T), args) =>
|
bulwahn@32667
|
2230 |
let
|
bulwahn@34935
|
2231 |
val mode = head_mode_of deriv
|
bulwahn@35888
|
2232 |
val introrule = predfun_intro_of ctxt name mode
|
bulwahn@34935
|
2233 |
val param_derivations = param_derivations_of deriv
|
bulwahn@34935
|
2234 |
val ho_args = ho_args_of mode args
|
bulwahn@32667
|
2235 |
in
|
bulwahn@35886
|
2236 |
print_tac options "before intro rule:"
|
bulwahn@35884
|
2237 |
THEN rtac introrule 1
|
bulwahn@35886
|
2238 |
THEN print_tac options "after intro rule"
|
bulwahn@32667
|
2239 |
(* for the right assumption in first position *)
|
bulwahn@32667
|
2240 |
THEN rotate_tac premposition 1
|
bulwahn@33753
|
2241 |
THEN atac 1
|
bulwahn@35886
|
2242 |
THEN print_tac options "parameter goal"
|
bulwahn@35884
|
2243 |
(* work with parameter arguments *)
|
bulwahn@35888
|
2244 |
THEN (EVERY (map2 (prove_param options ctxt nargs) ho_args param_derivations))
|
bulwahn@32667
|
2245 |
THEN (REPEAT_DETERM (atac 1))
|
bulwahn@32667
|
2246 |
end
|
bulwahn@35884
|
2247 |
| (Free _, _) =>
|
bulwahn@35886
|
2248 |
print_tac options "proving parameter call.."
|
bulwahn@35888
|
2249 |
THEN Subgoal.FOCUS_PREMS (fn {context = ctxt, params, prems, asms, concl, schematics} =>
|
bulwahn@35884
|
2250 |
let
|
bulwahn@35884
|
2251 |
val param_prem = nth prems premposition
|
bulwahn@35884
|
2252 |
val (param, _) = strip_comb (HOLogic.dest_Trueprop (prop_of param_prem))
|
bulwahn@35884
|
2253 |
val prems' = maps dest_conjunct_prem (take nargs prems)
|
bulwahn@35884
|
2254 |
fun param_rewrite prem =
|
bulwahn@35884
|
2255 |
param = snd (HOLogic.dest_eq (HOLogic.dest_Trueprop (prop_of prem)))
|
bulwahn@35884
|
2256 |
val SOME rew_eq = find_first param_rewrite prems'
|
bulwahn@35884
|
2257 |
val param_prem' = MetaSimplifier.rewrite_rule
|
bulwahn@35884
|
2258 |
(map (fn th => th RS @{thm eq_reflection})
|
bulwahn@35884
|
2259 |
[rew_eq RS @{thm sym}, @{thm split_beta}, @{thm fst_conv}, @{thm snd_conv}])
|
bulwahn@35884
|
2260 |
param_prem
|
bulwahn@35884
|
2261 |
in
|
bulwahn@35884
|
2262 |
rtac param_prem' 1
|
bulwahn@35888
|
2263 |
end) ctxt 1
|
bulwahn@35886
|
2264 |
THEN print_tac options "after prove parameter call"
|
bulwahn@32667
|
2265 |
|
bulwahn@34935
|
2266 |
fun SOLVED tac st = FILTER (fn st' => nprems_of st' = nprems_of st - 1) tac st;
|
bulwahn@32667
|
2267 |
|
bulwahn@32667
|
2268 |
fun SOLVEDALL tac st = FILTER (fn st' => nprems_of st' = 0) tac st
|
bulwahn@32667
|
2269 |
|
bulwahn@35888
|
2270 |
fun check_format ctxt st =
|
bulwahn@34935
|
2271 |
let
|
bulwahn@34935
|
2272 |
val concl' = Logic.strip_assums_concl (hd (prems_of st))
|
bulwahn@34935
|
2273 |
val concl = HOLogic.dest_Trueprop concl'
|
bulwahn@34935
|
2274 |
val expr = fst (strip_comb (fst (PredicateCompFuns.dest_Eval concl)))
|
bulwahn@34935
|
2275 |
fun valid_expr (Const (@{const_name Predicate.bind}, _)) = true
|
bulwahn@34935
|
2276 |
| valid_expr (Const (@{const_name Predicate.single}, _)) = true
|
bulwahn@34935
|
2277 |
| valid_expr _ = false
|
bulwahn@34935
|
2278 |
in
|
bulwahn@34935
|
2279 |
if valid_expr expr then
|
bulwahn@34935
|
2280 |
((*tracing "expression is valid";*) Seq.single st)
|
bulwahn@34935
|
2281 |
else
|
bulwahn@34935
|
2282 |
((*tracing "expression is not valid";*) Seq.empty) (*error "check_format: wrong format"*)
|
bulwahn@34935
|
2283 |
end
|
bulwahn@34935
|
2284 |
|
bulwahn@35888
|
2285 |
fun prove_match options ctxt out_ts =
|
bulwahn@34935
|
2286 |
let
|
bulwahn@35888
|
2287 |
val thy = ProofContext.theory_of ctxt
|
bulwahn@34935
|
2288 |
fun get_case_rewrite t =
|
bulwahn@34935
|
2289 |
if (is_constructor thy t) then let
|
bulwahn@34935
|
2290 |
val case_rewrites = (#case_rewrites (Datatype.the_info thy
|
bulwahn@34935
|
2291 |
((fst o dest_Type o fastype_of) t)))
|
bulwahn@34935
|
2292 |
in case_rewrites @ maps get_case_rewrite (snd (strip_comb t)) end
|
bulwahn@34935
|
2293 |
else []
|
bulwahn@34935
|
2294 |
val simprules = @{thm "unit.cases"} :: @{thm "prod.cases"} :: maps get_case_rewrite out_ts
|
bulwahn@34935
|
2295 |
(* replace TRY by determining if it necessary - are there equations when calling compile match? *)
|
bulwahn@34935
|
2296 |
in
|
bulwahn@34935
|
2297 |
(* make this simpset better! *)
|
bulwahn@34935
|
2298 |
asm_full_simp_tac (HOL_basic_ss' addsimps simprules) 1
|
bulwahn@35886
|
2299 |
THEN print_tac options "after prove_match:"
|
bulwahn@35888
|
2300 |
THEN (DETERM (TRY (EqSubst.eqsubst_tac ctxt [0] [@{thm HOL.if_P}] 1
|
bulwahn@34935
|
2301 |
THEN (REPEAT_DETERM (rtac @{thm conjI} 1 THEN (SOLVED (asm_simp_tac HOL_basic_ss' 1))))
|
bulwahn@35886
|
2302 |
THEN print_tac options "if condition to be solved:"
|
bulwahn@35886
|
2303 |
THEN (SOLVED (asm_simp_tac HOL_basic_ss' 1 THEN print_tac options "after if simp; in SOLVED:"))
|
bulwahn@34935
|
2304 |
THEN check_format thy
|
bulwahn@35886
|
2305 |
THEN print_tac options "after if simplification - a TRY block")))
|
bulwahn@35886
|
2306 |
THEN print_tac options "after if simplification"
|
bulwahn@34935
|
2307 |
end;
|
bulwahn@32667
|
2308 |
|
bulwahn@32667
|
2309 |
(* corresponds to compile_fun -- maybe call that also compile_sidecond? *)
|
bulwahn@32667
|
2310 |
|
bulwahn@35888
|
2311 |
fun prove_sidecond ctxt t =
|
bulwahn@32667
|
2312 |
let
|
bulwahn@32667
|
2313 |
fun preds_of t nameTs = case strip_comb t of
|
bulwahn@32667
|
2314 |
(f as Const (name, T), args) =>
|
bulwahn@36994
|
2315 |
if is_registered ctxt name then (name, T) :: nameTs
|
bulwahn@32667
|
2316 |
else fold preds_of args nameTs
|
bulwahn@32667
|
2317 |
| _ => nameTs
|
bulwahn@32667
|
2318 |
val preds = preds_of t []
|
bulwahn@32667
|
2319 |
val defs = map
|
bulwahn@35888
|
2320 |
(fn (pred, T) => predfun_definition_of ctxt pred
|
bulwahn@34935
|
2321 |
(all_input_of T))
|
bulwahn@32667
|
2322 |
preds
|
bulwahn@32667
|
2323 |
in
|
bulwahn@32667
|
2324 |
(* remove not_False_eq_True when simpset in prove_match is better *)
|
bulwahn@32667
|
2325 |
simp_tac (HOL_basic_ss addsimps
|
haftmann@34961
|
2326 |
(@{thms HOL.simp_thms} @ (@{thm not_False_eq_True} :: @{thm eval_pred} :: defs))) 1
|
bulwahn@32667
|
2327 |
(* need better control here! *)
|
bulwahn@32667
|
2328 |
end
|
bulwahn@32667
|
2329 |
|
bulwahn@35888
|
2330 |
fun prove_clause options ctxt nargs mode (_, clauses) (ts, moded_ps) =
|
bulwahn@32667
|
2331 |
let
|
bulwahn@34935
|
2332 |
val (in_ts, clause_out_ts) = split_mode mode ts;
|
bulwahn@32667
|
2333 |
fun prove_prems out_ts [] =
|
bulwahn@35888
|
2334 |
(prove_match options ctxt out_ts)
|
bulwahn@35886
|
2335 |
THEN print_tac options "before simplifying assumptions"
|
bulwahn@32667
|
2336 |
THEN asm_full_simp_tac HOL_basic_ss' 1
|
bulwahn@35886
|
2337 |
THEN print_tac options "before single intro rule"
|
bulwahn@32667
|
2338 |
THEN (rtac (if null clause_out_ts then @{thm singleI_unit} else @{thm singleI}) 1)
|
bulwahn@34935
|
2339 |
| prove_prems out_ts ((p, deriv) :: ps) =
|
bulwahn@32667
|
2340 |
let
|
bulwahn@32667
|
2341 |
val premposition = (find_index (equal p) clauses) + nargs
|
bulwahn@34935
|
2342 |
val mode = head_mode_of deriv
|
bulwahn@34935
|
2343 |
val rest_tac =
|
bulwahn@34935
|
2344 |
rtac @{thm bindI} 1
|
bulwahn@34935
|
2345 |
THEN (case p of Prem t =>
|
bulwahn@32667
|
2346 |
let
|
bulwahn@34935
|
2347 |
val (_, us) = strip_comb t
|
bulwahn@34935
|
2348 |
val (_, out_ts''') = split_mode mode us
|
bulwahn@32667
|
2349 |
val rec_tac = prove_prems out_ts''' ps
|
bulwahn@32667
|
2350 |
in
|
bulwahn@35886
|
2351 |
print_tac options "before clause:"
|
bulwahn@34935
|
2352 |
(*THEN asm_simp_tac HOL_basic_ss 1*)
|
bulwahn@35886
|
2353 |
THEN print_tac options "before prove_expr:"
|
bulwahn@35888
|
2354 |
THEN prove_expr options ctxt nargs premposition (t, deriv)
|
bulwahn@35886
|
2355 |
THEN print_tac options "after prove_expr:"
|
bulwahn@32667
|
2356 |
THEN rec_tac
|
bulwahn@32667
|
2357 |
end
|
bulwahn@34935
|
2358 |
| Negprem t =>
|
bulwahn@32667
|
2359 |
let
|
bulwahn@34935
|
2360 |
val (t, args) = strip_comb t
|
bulwahn@34935
|
2361 |
val (_, out_ts''') = split_mode mode args
|
bulwahn@32667
|
2362 |
val rec_tac = prove_prems out_ts''' ps
|
bulwahn@32667
|
2363 |
val name = (case strip_comb t of (Const (c, _), _) => SOME c | _ => NONE)
|
bulwahn@35884
|
2364 |
val neg_intro_rule =
|
bulwahn@35888
|
2365 |
Option.map (fn name =>
|
bulwahn@35888
|
2366 |
the (predfun_neg_intro_of ctxt name mode)) name
|
bulwahn@34935
|
2367 |
val param_derivations = param_derivations_of deriv
|
bulwahn@34935
|
2368 |
val params = ho_args_of mode args
|
bulwahn@32667
|
2369 |
in
|
bulwahn@35886
|
2370 |
print_tac options "before prove_neg_expr:"
|
bulwahn@34935
|
2371 |
THEN full_simp_tac (HOL_basic_ss addsimps
|
bulwahn@34935
|
2372 |
[@{thm split_eta}, @{thm split_beta}, @{thm fst_conv},
|
bulwahn@34935
|
2373 |
@{thm snd_conv}, @{thm pair_collapse}, @{thm Product_Type.split_conv}]) 1
|
bulwahn@32667
|
2374 |
THEN (if (is_some name) then
|
bulwahn@35886
|
2375 |
print_tac options "before applying not introduction rule"
|
bulwahn@35884
|
2376 |
THEN rotate_tac premposition 1
|
bulwahn@35884
|
2377 |
THEN etac (the neg_intro_rule) 1
|
bulwahn@35884
|
2378 |
THEN rotate_tac (~premposition) 1
|
bulwahn@35886
|
2379 |
THEN print_tac options "after applying not introduction rule"
|
bulwahn@35888
|
2380 |
THEN (EVERY (map2 (prove_param options ctxt nargs) params param_derivations))
|
bulwahn@34935
|
2381 |
THEN (REPEAT_DETERM (atac 1))
|
bulwahn@32667
|
2382 |
else
|
bulwahn@35884
|
2383 |
rtac @{thm not_predI'} 1
|
bulwahn@35884
|
2384 |
(* test: *)
|
bulwahn@35884
|
2385 |
THEN dtac @{thm sym} 1
|
bulwahn@35884
|
2386 |
THEN asm_full_simp_tac (HOL_basic_ss addsimps [@{thm not_False_eq_True}]) 1)
|
bulwahn@32667
|
2387 |
THEN simp_tac (HOL_basic_ss addsimps [@{thm not_False_eq_True}]) 1
|
bulwahn@32667
|
2388 |
THEN rec_tac
|
bulwahn@32667
|
2389 |
end
|
bulwahn@32667
|
2390 |
| Sidecond t =>
|
bulwahn@34935
|
2391 |
rtac @{thm if_predI} 1
|
bulwahn@35886
|
2392 |
THEN print_tac options "before sidecond:"
|
bulwahn@35888
|
2393 |
THEN prove_sidecond ctxt t
|
bulwahn@35886
|
2394 |
THEN print_tac options "after sidecond:"
|
bulwahn@32667
|
2395 |
THEN prove_prems [] ps)
|
bulwahn@35888
|
2396 |
in (prove_match options ctxt out_ts)
|
bulwahn@32667
|
2397 |
THEN rest_tac
|
bulwahn@32667
|
2398 |
end;
|
bulwahn@32667
|
2399 |
val prems_tac = prove_prems in_ts moded_ps
|
bulwahn@32667
|
2400 |
in
|
bulwahn@35886
|
2401 |
print_tac options "Proving clause..."
|
bulwahn@33146
|
2402 |
THEN rtac @{thm bindI} 1
|
bulwahn@32667
|
2403 |
THEN rtac @{thm singleI} 1
|
bulwahn@32667
|
2404 |
THEN prems_tac
|
bulwahn@32667
|
2405 |
end;
|
bulwahn@32667
|
2406 |
|
bulwahn@32667
|
2407 |
fun select_sup 1 1 = []
|
bulwahn@32667
|
2408 |
| select_sup _ 1 = [rtac @{thm supI1}]
|
bulwahn@32667
|
2409 |
| select_sup n i = (rtac @{thm supI2})::(select_sup (n - 1) (i - 1));
|
bulwahn@32667
|
2410 |
|
bulwahn@35888
|
2411 |
fun prove_one_direction options ctxt clauses preds pred mode moded_clauses =
|
bulwahn@32667
|
2412 |
let
|
bulwahn@35888
|
2413 |
val thy = ProofContext.theory_of ctxt
|
bulwahn@32667
|
2414 |
val T = the (AList.lookup (op =) preds pred)
|
bulwahn@34935
|
2415 |
val nargs = length (binder_types T)
|
bulwahn@32667
|
2416 |
val pred_case_rule = the_elim_of thy pred
|
bulwahn@32667
|
2417 |
in
|
bulwahn@32667
|
2418 |
REPEAT_DETERM (CHANGED (rewtac @{thm "split_paired_all"}))
|
bulwahn@35886
|
2419 |
THEN print_tac options "before applying elim rule"
|
bulwahn@35888
|
2420 |
THEN etac (predfun_elim_of ctxt pred mode) 1
|
bulwahn@32667
|
2421 |
THEN etac pred_case_rule 1
|
bulwahn@35886
|
2422 |
THEN print_tac options "after applying elim rule"
|
bulwahn@32667
|
2423 |
THEN (EVERY (map
|
bulwahn@32667
|
2424 |
(fn i => EVERY' (select_sup (length moded_clauses) i) i)
|
bulwahn@32667
|
2425 |
(1 upto (length moded_clauses))))
|
bulwahn@35888
|
2426 |
THEN (EVERY (map2 (prove_clause options ctxt nargs mode) clauses moded_clauses))
|
bulwahn@35886
|
2427 |
THEN print_tac options "proved one direction"
|
bulwahn@32667
|
2428 |
end;
|
bulwahn@32667
|
2429 |
|
bulwahn@32667
|
2430 |
(** Proof in the other direction **)
|
bulwahn@32667
|
2431 |
|
bulwahn@35888
|
2432 |
fun prove_match2 options ctxt out_ts =
|
bulwahn@35888
|
2433 |
let
|
bulwahn@35888
|
2434 |
val thy = ProofContext.theory_of ctxt
|
bulwahn@35888
|
2435 |
fun split_term_tac (Free _) = all_tac
|
bulwahn@35888
|
2436 |
| split_term_tac t =
|
bulwahn@35888
|
2437 |
if (is_constructor thy t) then
|
bulwahn@35888
|
2438 |
let
|
bulwahn@35888
|
2439 |
val info = Datatype.the_info thy ((fst o dest_Type o fastype_of) t)
|
bulwahn@35888
|
2440 |
val num_of_constrs = length (#case_rewrites info)
|
bulwahn@35888
|
2441 |
val (_, ts) = strip_comb t
|
bulwahn@35888
|
2442 |
in
|
bulwahn@35889
|
2443 |
print_tac options ("Term " ^ (Syntax.string_of_term ctxt t) ^
|
bulwahn@35889
|
2444 |
"splitting with rules \n" ^ Display.string_of_thm ctxt (#split_asm info))
|
bulwahn@35889
|
2445 |
THEN TRY ((Splitter.split_asm_tac [#split_asm info] 1)
|
bulwahn@35889
|
2446 |
THEN (print_tac options "after splitting with split_asm rules")
|
bulwahn@35888
|
2447 |
(* THEN (Simplifier.asm_full_simp_tac HOL_basic_ss 1)
|
bulwahn@35888
|
2448 |
THEN (DETERM (TRY (etac @{thm Pair_inject} 1)))*)
|
bulwahn@35888
|
2449 |
THEN (REPEAT_DETERM_N (num_of_constrs - 1)
|
bulwahn@35888
|
2450 |
(etac @{thm botE} 1 ORELSE etac @{thm botE} 2)))
|
bulwahn@35888
|
2451 |
THEN (assert_tac (Max_number_of_subgoals 2))
|
bulwahn@35888
|
2452 |
THEN (EVERY (map split_term_tac ts))
|
bulwahn@35888
|
2453 |
end
|
bulwahn@35888
|
2454 |
else all_tac
|
bulwahn@32667
|
2455 |
in
|
bulwahn@33148
|
2456 |
split_term_tac (HOLogic.mk_tuple out_ts)
|
bulwahn@33482
|
2457 |
THEN (DETERM (TRY ((Splitter.split_asm_tac [@{thm "split_if_asm"}] 1)
|
bulwahn@33482
|
2458 |
THEN (etac @{thm botE} 2))))
|
bulwahn@32667
|
2459 |
end
|
bulwahn@32667
|
2460 |
|
bulwahn@32667
|
2461 |
(* VERY LARGE SIMILIRATIY to function prove_param
|
bulwahn@32667
|
2462 |
-- join both functions
|
bulwahn@32667
|
2463 |
*)
|
bulwahn@32667
|
2464 |
(* TODO: remove function *)
|
bulwahn@32667
|
2465 |
|
bulwahn@35888
|
2466 |
fun prove_param2 options ctxt t deriv =
|
bulwahn@33629
|
2467 |
let
|
bulwahn@34935
|
2468 |
val (f, args) = strip_comb (Envir.eta_contract t)
|
bulwahn@34935
|
2469 |
val mode = head_mode_of deriv
|
bulwahn@34935
|
2470 |
val param_derivations = param_derivations_of deriv
|
bulwahn@34935
|
2471 |
val ho_args = ho_args_of mode args
|
bulwahn@32667
|
2472 |
val f_tac = case f of
|
bulwahn@32667
|
2473 |
Const (name, T) => full_simp_tac (HOL_basic_ss addsimps
|
bulwahn@35888
|
2474 |
(@{thm eval_pred}::(predfun_definition_of ctxt name mode)
|
bulwahn@32667
|
2475 |
:: @{thm "Product_Type.split_conv"}::[])) 1
|
bulwahn@32667
|
2476 |
| Free _ => all_tac
|
bulwahn@32667
|
2477 |
| _ => error "prove_param2: illegal parameter term"
|
bulwahn@33629
|
2478 |
in
|
bulwahn@35886
|
2479 |
print_tac options "before simplification in prove_args:"
|
bulwahn@32667
|
2480 |
THEN f_tac
|
bulwahn@35886
|
2481 |
THEN print_tac options "after simplification in prove_args"
|
bulwahn@35888
|
2482 |
THEN EVERY (map2 (prove_param2 options ctxt) ho_args param_derivations)
|
bulwahn@32667
|
2483 |
end
|
bulwahn@32667
|
2484 |
|
bulwahn@35888
|
2485 |
fun prove_expr2 options ctxt (t, deriv) =
|
bulwahn@34935
|
2486 |
(case strip_comb t of
|
bulwahn@34935
|
2487 |
(Const (name, T), args) =>
|
bulwahn@34935
|
2488 |
let
|
bulwahn@34935
|
2489 |
val mode = head_mode_of deriv
|
bulwahn@34935
|
2490 |
val param_derivations = param_derivations_of deriv
|
bulwahn@34935
|
2491 |
val ho_args = ho_args_of mode args
|
bulwahn@34935
|
2492 |
in
|
bulwahn@34935
|
2493 |
etac @{thm bindE} 1
|
bulwahn@34935
|
2494 |
THEN (REPEAT_DETERM (CHANGED (rewtac @{thm "split_paired_all"})))
|
bulwahn@35886
|
2495 |
THEN print_tac options "prove_expr2-before"
|
bulwahn@35888
|
2496 |
THEN etac (predfun_elim_of ctxt name mode) 1
|
bulwahn@35886
|
2497 |
THEN print_tac options "prove_expr2"
|
bulwahn@35888
|
2498 |
THEN (EVERY (map2 (prove_param2 options ctxt) ho_args param_derivations))
|
bulwahn@35886
|
2499 |
THEN print_tac options "finished prove_expr2"
|
bulwahn@34935
|
2500 |
end
|
bulwahn@34935
|
2501 |
| _ => etac @{thm bindE} 1)
|
bulwahn@32667
|
2502 |
|
bulwahn@35888
|
2503 |
fun prove_sidecond2 options ctxt t = let
|
bulwahn@32667
|
2504 |
fun preds_of t nameTs = case strip_comb t of
|
bulwahn@32667
|
2505 |
(f as Const (name, T), args) =>
|
bulwahn@36994
|
2506 |
if is_registered ctxt name then (name, T) :: nameTs
|
bulwahn@32667
|
2507 |
else fold preds_of args nameTs
|
bulwahn@32667
|
2508 |
| _ => nameTs
|
bulwahn@32667
|
2509 |
val preds = preds_of t []
|
bulwahn@32667
|
2510 |
val defs = map
|
bulwahn@35888
|
2511 |
(fn (pred, T) => predfun_definition_of ctxt pred
|
bulwahn@34935
|
2512 |
(all_input_of T))
|
bulwahn@32667
|
2513 |
preds
|
bulwahn@32667
|
2514 |
in
|
bulwahn@32667
|
2515 |
(* only simplify the one assumption *)
|
bulwahn@32667
|
2516 |
full_simp_tac (HOL_basic_ss' addsimps @{thm eval_pred} :: defs) 1
|
bulwahn@32667
|
2517 |
(* need better control here! *)
|
bulwahn@35886
|
2518 |
THEN print_tac options "after sidecond2 simplification"
|
bulwahn@32667
|
2519 |
end
|
bulwahn@32667
|
2520 |
|
bulwahn@35888
|
2521 |
fun prove_clause2 options ctxt pred mode (ts, ps) i =
|
bulwahn@32667
|
2522 |
let
|
bulwahn@35888
|
2523 |
val pred_intro_rule = nth (intros_of (ProofContext.theory_of ctxt) pred) (i - 1)
|
bulwahn@34935
|
2524 |
val (in_ts, clause_out_ts) = split_mode mode ts;
|
bulwahn@32667
|
2525 |
fun prove_prems2 out_ts [] =
|
bulwahn@35886
|
2526 |
print_tac options "before prove_match2 - last call:"
|
bulwahn@35888
|
2527 |
THEN prove_match2 options ctxt out_ts
|
bulwahn@35886
|
2528 |
THEN print_tac options "after prove_match2 - last call:"
|
bulwahn@32667
|
2529 |
THEN (etac @{thm singleE} 1)
|
bulwahn@32667
|
2530 |
THEN (REPEAT_DETERM (etac @{thm Pair_inject} 1))
|
bulwahn@32667
|
2531 |
THEN (asm_full_simp_tac HOL_basic_ss' 1)
|
bulwahn@32667
|
2532 |
THEN (REPEAT_DETERM (etac @{thm Pair_inject} 1))
|
bulwahn@32667
|
2533 |
THEN (asm_full_simp_tac HOL_basic_ss' 1)
|
bulwahn@35886
|
2534 |
THEN SOLVED (print_tac options "state before applying intro rule:"
|
bulwahn@32667
|
2535 |
THEN (rtac pred_intro_rule 1)
|
bulwahn@32667
|
2536 |
(* How to handle equality correctly? *)
|
bulwahn@35886
|
2537 |
THEN (print_tac options "state before assumption matching")
|
bulwahn@32667
|
2538 |
THEN (REPEAT (atac 1 ORELSE
|
bulwahn@32667
|
2539 |
(CHANGED (asm_full_simp_tac (HOL_basic_ss' addsimps
|
bulwahn@33482
|
2540 |
[@{thm split_eta}, @{thm "split_beta"}, @{thm "fst_conv"},
|
bulwahn@33482
|
2541 |
@{thm "snd_conv"}, @{thm pair_collapse}]) 1)
|
bulwahn@35886
|
2542 |
THEN print_tac options "state after simp_tac:"))))
|
bulwahn@34935
|
2543 |
| prove_prems2 out_ts ((p, deriv) :: ps) =
|
bulwahn@32667
|
2544 |
let
|
bulwahn@34935
|
2545 |
val mode = head_mode_of deriv
|
bulwahn@32667
|
2546 |
val rest_tac = (case p of
|
bulwahn@34935
|
2547 |
Prem t =>
|
bulwahn@32667
|
2548 |
let
|
bulwahn@34935
|
2549 |
val (_, us) = strip_comb t
|
bulwahn@34935
|
2550 |
val (_, out_ts''') = split_mode mode us
|
bulwahn@32667
|
2551 |
val rec_tac = prove_prems2 out_ts''' ps
|
bulwahn@32667
|
2552 |
in
|
bulwahn@35888
|
2553 |
(prove_expr2 options ctxt (t, deriv)) THEN rec_tac
|
bulwahn@32667
|
2554 |
end
|
bulwahn@34935
|
2555 |
| Negprem t =>
|
bulwahn@32667
|
2556 |
let
|
bulwahn@34935
|
2557 |
val (_, args) = strip_comb t
|
bulwahn@34935
|
2558 |
val (_, out_ts''') = split_mode mode args
|
bulwahn@32667
|
2559 |
val rec_tac = prove_prems2 out_ts''' ps
|
bulwahn@32667
|
2560 |
val name = (case strip_comb t of (Const (c, _), _) => SOME c | _ => NONE)
|
bulwahn@34935
|
2561 |
val param_derivations = param_derivations_of deriv
|
bulwahn@34935
|
2562 |
val ho_args = ho_args_of mode args
|
bulwahn@32667
|
2563 |
in
|
bulwahn@35886
|
2564 |
print_tac options "before neg prem 2"
|
bulwahn@32667
|
2565 |
THEN etac @{thm bindE} 1
|
bulwahn@32667
|
2566 |
THEN (if is_some name then
|
bulwahn@33482
|
2567 |
full_simp_tac (HOL_basic_ss addsimps
|
bulwahn@35888
|
2568 |
[predfun_definition_of ctxt (the name) mode]) 1
|
bulwahn@32667
|
2569 |
THEN etac @{thm not_predE} 1
|
bulwahn@32667
|
2570 |
THEN simp_tac (HOL_basic_ss addsimps [@{thm not_False_eq_True}]) 1
|
bulwahn@35888
|
2571 |
THEN (EVERY (map2 (prove_param2 options ctxt) ho_args param_derivations))
|
bulwahn@32667
|
2572 |
else
|
bulwahn@32667
|
2573 |
etac @{thm not_predE'} 1)
|
bulwahn@32667
|
2574 |
THEN rec_tac
|
bulwahn@32667
|
2575 |
end
|
bulwahn@32667
|
2576 |
| Sidecond t =>
|
bulwahn@32667
|
2577 |
etac @{thm bindE} 1
|
bulwahn@32667
|
2578 |
THEN etac @{thm if_predE} 1
|
bulwahn@35888
|
2579 |
THEN prove_sidecond2 options ctxt t
|
bulwahn@32667
|
2580 |
THEN prove_prems2 [] ps)
|
bulwahn@35886
|
2581 |
in print_tac options "before prove_match2:"
|
bulwahn@35888
|
2582 |
THEN prove_match2 options ctxt out_ts
|
bulwahn@35886
|
2583 |
THEN print_tac options "after prove_match2:"
|
bulwahn@32667
|
2584 |
THEN rest_tac
|
bulwahn@32667
|
2585 |
end;
|
bulwahn@32667
|
2586 |
val prems_tac = prove_prems2 in_ts ps
|
bulwahn@32667
|
2587 |
in
|
bulwahn@35886
|
2588 |
print_tac options "starting prove_clause2"
|
bulwahn@32667
|
2589 |
THEN etac @{thm bindE} 1
|
bulwahn@32667
|
2590 |
THEN (etac @{thm singleE'} 1)
|
bulwahn@32667
|
2591 |
THEN (TRY (etac @{thm Pair_inject} 1))
|
bulwahn@35886
|
2592 |
THEN print_tac options "after singleE':"
|
bulwahn@32667
|
2593 |
THEN prems_tac
|
bulwahn@32667
|
2594 |
end;
|
bulwahn@32667
|
2595 |
|
bulwahn@35888
|
2596 |
fun prove_other_direction options ctxt pred mode moded_clauses =
|
bulwahn@32667
|
2597 |
let
|
bulwahn@32667
|
2598 |
fun prove_clause clause i =
|
bulwahn@32667
|
2599 |
(if i < length moded_clauses then etac @{thm supE} 1 else all_tac)
|
bulwahn@35888
|
2600 |
THEN (prove_clause2 options ctxt pred mode clause i)
|
bulwahn@32667
|
2601 |
in
|
bulwahn@32667
|
2602 |
(DETERM (TRY (rtac @{thm unit.induct} 1)))
|
bulwahn@32667
|
2603 |
THEN (REPEAT_DETERM (CHANGED (rewtac @{thm split_paired_all})))
|
bulwahn@35888
|
2604 |
THEN (rtac (predfun_intro_of ctxt pred mode) 1)
|
bulwahn@32667
|
2605 |
THEN (REPEAT_DETERM (rtac @{thm refl} 2))
|
bulwahn@33146
|
2606 |
THEN (if null moded_clauses then
|
bulwahn@33146
|
2607 |
etac @{thm botE} 1
|
bulwahn@33146
|
2608 |
else EVERY (map2 prove_clause moded_clauses (1 upto (length moded_clauses))))
|
bulwahn@32667
|
2609 |
end;
|
bulwahn@32667
|
2610 |
|
bulwahn@32667
|
2611 |
(** proof procedure **)
|
bulwahn@32667
|
2612 |
|
bulwahn@35324
|
2613 |
fun prove_pred options thy clauses preds pred (pol, mode) (moded_clauses, compiled_term) =
|
bulwahn@32667
|
2614 |
let
|
wenzelm@36633
|
2615 |
val ctxt = ProofContext.init_global thy
|
bulwahn@33146
|
2616 |
val clauses = case AList.lookup (op =) clauses pred of SOME rs => rs | NONE => []
|
bulwahn@32667
|
2617 |
in
|
bulwahn@32667
|
2618 |
Goal.prove ctxt (Term.add_free_names compiled_term []) [] compiled_term
|
bulwahn@33143
|
2619 |
(if not (skip_proof options) then
|
bulwahn@32667
|
2620 |
(fn _ =>
|
bulwahn@32667
|
2621 |
rtac @{thm pred_iffI} 1
|
bulwahn@35886
|
2622 |
THEN print_tac options "after pred_iffI"
|
bulwahn@35888
|
2623 |
THEN prove_one_direction options ctxt clauses preds pred mode moded_clauses
|
bulwahn@35886
|
2624 |
THEN print_tac options "proved one direction"
|
bulwahn@35888
|
2625 |
THEN prove_other_direction options ctxt pred mode moded_clauses
|
bulwahn@35886
|
2626 |
THEN print_tac options "proved other direction")
|
bulwahn@33150
|
2627 |
else (fn _ => Skip_Proof.cheat_tac thy))
|
bulwahn@32667
|
2628 |
end;
|
bulwahn@32667
|
2629 |
|
bulwahn@32667
|
2630 |
(* composition of mode inference, definition, compilation and proof *)
|
bulwahn@32667
|
2631 |
|
bulwahn@32667
|
2632 |
(** auxillary combinators for table of preds and modes **)
|
bulwahn@32667
|
2633 |
|
bulwahn@32667
|
2634 |
fun map_preds_modes f preds_modes_table =
|
bulwahn@32667
|
2635 |
map (fn (pred, modes) =>
|
bulwahn@32667
|
2636 |
(pred, map (fn (mode, value) => (mode, f pred mode value)) modes)) preds_modes_table
|
bulwahn@32667
|
2637 |
|
bulwahn@32667
|
2638 |
fun join_preds_modes table1 table2 =
|
bulwahn@32667
|
2639 |
map_preds_modes (fn pred => fn mode => fn value =>
|
bulwahn@32667
|
2640 |
(value, the (AList.lookup (op =) (the (AList.lookup (op =) table2 pred)) mode))) table1
|
bulwahn@36254
|
2641 |
|
bulwahn@32667
|
2642 |
fun maps_modes preds_modes_table =
|
bulwahn@32667
|
2643 |
map (fn (pred, modes) =>
|
bulwahn@34935
|
2644 |
(pred, map (fn (mode, value) => value) modes)) preds_modes_table
|
bulwahn@36254
|
2645 |
|
bulwahn@36254
|
2646 |
fun compile_preds options comp_modifiers thy all_vs param_vs preds moded_clauses =
|
bulwahn@36254
|
2647 |
map_preds_modes (fn pred => compile_pred options comp_modifiers thy all_vs param_vs pred
|
bulwahn@33143
|
2648 |
(the (AList.lookup (op =) preds pred))) moded_clauses
|
bulwahn@33143
|
2649 |
|
bulwahn@35324
|
2650 |
fun prove options thy clauses preds moded_clauses compiled_terms =
|
bulwahn@35324
|
2651 |
map_preds_modes (prove_pred options thy clauses preds)
|
bulwahn@32667
|
2652 |
(join_preds_modes moded_clauses compiled_terms)
|
bulwahn@32667
|
2653 |
|
bulwahn@35324
|
2654 |
fun prove_by_skip options thy _ _ _ compiled_terms =
|
wenzelm@35021
|
2655 |
map_preds_modes
|
wenzelm@35021
|
2656 |
(fn pred => fn mode => fn t => Drule.export_without_context (Skip_Proof.make_thm thy t))
|
bulwahn@32667
|
2657 |
compiled_terms
|
bulwahn@33106
|
2658 |
|
bulwahn@33376
|
2659 |
(* preparation of introduction rules into special datastructures *)
|
bulwahn@36994
|
2660 |
fun dest_prem ctxt params t =
|
bulwahn@33106
|
2661 |
(case strip_comb t of
|
bulwahn@34935
|
2662 |
(v as Free _, ts) => if member (op =) params v then Prem t else Sidecond t
|
bulwahn@36994
|
2663 |
| (c as Const (@{const_name Not}, _), [t]) => (case dest_prem ctxt params t of
|
bulwahn@34935
|
2664 |
Prem t => Negprem t
|
bulwahn@33482
|
2665 |
| Negprem _ => error ("Double negation not allowed in premise: " ^
|
bulwahn@36994
|
2666 |
Syntax.string_of_term ctxt (c $ t))
|
bulwahn@33106
|
2667 |
| Sidecond t => Sidecond (c $ t))
|
bulwahn@33106
|
2668 |
| (c as Const (s, _), ts) =>
|
bulwahn@36994
|
2669 |
if is_registered ctxt s then Prem t else Sidecond t
|
bulwahn@33106
|
2670 |
| _ => Sidecond t)
|
bulwahn@34935
|
2671 |
|
bulwahn@34935
|
2672 |
fun prepare_intrs options compilation thy prednames intros =
|
bulwahn@32667
|
2673 |
let
|
bulwahn@36994
|
2674 |
val ctxt = ProofContext.init_global thy
|
bulwahn@33126
|
2675 |
val intrs = map prop_of intros
|
bulwahn@33146
|
2676 |
val preds = map (fn c => Const (c, Sign.the_const_type thy c)) prednames
|
bulwahn@33146
|
2677 |
val (preds, intrs) = unify_consts thy preds intrs
|
bulwahn@36994
|
2678 |
val ([preds, intrs], _) = fold_burrow (Variable.import_terms false) [preds, intrs] ctxt
|
bulwahn@33126
|
2679 |
val preds = map dest_Const preds
|
bulwahn@34935
|
2680 |
val all_vs = terms_vs intrs
|
bulwahn@35324
|
2681 |
val all_modes =
|
bulwahn@35324
|
2682 |
map (fn (s, T) =>
|
bulwahn@35324
|
2683 |
(s,
|
bulwahn@35324
|
2684 |
(if member (op =) (no_higher_order_predicate options) s then
|
bulwahn@35324
|
2685 |
(all_smodes_of_typ T)
|
bulwahn@35324
|
2686 |
else (all_modes_of_typ T)))) preds
|
bulwahn@34935
|
2687 |
val params =
|
bulwahn@34935
|
2688 |
case intrs of
|
bulwahn@33146
|
2689 |
[] =>
|
bulwahn@33146
|
2690 |
let
|
bulwahn@34935
|
2691 |
val T = snd (hd preds)
|
bulwahn@34935
|
2692 |
val paramTs =
|
bulwahn@34935
|
2693 |
ho_argsT_of (hd (all_modes_of_typ T)) (binder_types T)
|
bulwahn@33482
|
2694 |
val param_names = Name.variant_list [] (map (fn i => "p" ^ string_of_int i)
|
bulwahn@33482
|
2695 |
(1 upto length paramTs))
|
bulwahn@34935
|
2696 |
in
|
bulwahn@34935
|
2697 |
map2 (curry Free) param_names paramTs
|
bulwahn@34935
|
2698 |
end
|
bulwahn@35324
|
2699 |
| (intr :: _) =>
|
bulwahn@35324
|
2700 |
let
|
bulwahn@35324
|
2701 |
val (p, args) = strip_comb (HOLogic.dest_Trueprop (Logic.strip_imp_concl intr))
|
bulwahn@35324
|
2702 |
in
|
bulwahn@35324
|
2703 |
ho_args_of (hd (the (AList.lookup (op =) all_modes (fst (dest_Const p))))) args
|
bulwahn@35324
|
2704 |
end
|
bulwahn@34935
|
2705 |
val param_vs = map (fst o dest_Free) params
|
bulwahn@34935
|
2706 |
fun add_clause intr clauses =
|
bulwahn@32667
|
2707 |
let
|
bulwahn@34935
|
2708 |
val (Const (name, T), ts) = strip_comb (HOLogic.dest_Trueprop (Logic.strip_imp_concl intr))
|
bulwahn@36994
|
2709 |
val prems = map (dest_prem ctxt params o HOLogic.dest_Trueprop) (Logic.strip_imp_prems intr)
|
bulwahn@32667
|
2710 |
in
|
bulwahn@34935
|
2711 |
AList.update op = (name, these (AList.lookup op = clauses name) @
|
bulwahn@34935
|
2712 |
[(ts, prems)]) clauses
|
bulwahn@34935
|
2713 |
end;
|
bulwahn@34935
|
2714 |
val clauses = fold add_clause intrs []
|
bulwahn@34935
|
2715 |
in
|
bulwahn@35324
|
2716 |
(preds, all_vs, param_vs, all_modes, clauses)
|
bulwahn@34935
|
2717 |
end;
|
bulwahn@32667
|
2718 |
|
bulwahn@33376
|
2719 |
(* sanity check of introduction rules *)
|
bulwahn@34935
|
2720 |
(* TODO: rethink check with new modes *)
|
bulwahn@34935
|
2721 |
(*
|
bulwahn@33106
|
2722 |
fun check_format_of_intro_rule thy intro =
|
bulwahn@33106
|
2723 |
let
|
bulwahn@33106
|
2724 |
val concl = Logic.strip_imp_concl (prop_of intro)
|
bulwahn@33106
|
2725 |
val (p, args) = strip_comb (HOLogic.dest_Trueprop concl)
|
bulwahn@33629
|
2726 |
val params = fst (chop (nparams_of thy (fst (dest_Const p))) args)
|
bulwahn@33106
|
2727 |
fun check_arg arg = case HOLogic.strip_tupleT (fastype_of arg) of
|
bulwahn@33106
|
2728 |
(Ts as _ :: _ :: _) =>
|
bulwahn@33629
|
2729 |
if length (HOLogic.strip_tuple arg) = length Ts then
|
bulwahn@33629
|
2730 |
true
|
bulwahn@33114
|
2731 |
else
|
bulwahn@33629
|
2732 |
error ("Format of introduction rule is invalid: tuples must be expanded:"
|
bulwahn@33629
|
2733 |
^ (Syntax.string_of_term_global thy arg) ^ " in " ^
|
bulwahn@33629
|
2734 |
(Display.string_of_thm_global thy intro))
|
bulwahn@33106
|
2735 |
| _ => true
|
bulwahn@33106
|
2736 |
val prems = Logic.strip_imp_prems (prop_of intro)
|
bulwahn@34935
|
2737 |
fun check_prem (Prem t) = forall check_arg args
|
bulwahn@34935
|
2738 |
| check_prem (Negprem t) = forall check_arg args
|
bulwahn@33106
|
2739 |
| check_prem _ = true
|
bulwahn@33106
|
2740 |
in
|
bulwahn@33106
|
2741 |
forall check_arg args andalso
|
bulwahn@33106
|
2742 |
forall (check_prem o dest_prem thy params o HOLogic.dest_Trueprop) prems
|
bulwahn@33106
|
2743 |
end
|
bulwahn@34935
|
2744 |
*)
|
bulwahn@33124
|
2745 |
(*
|
bulwahn@33124
|
2746 |
fun check_intros_elim_match thy prednames =
|
bulwahn@33124
|
2747 |
let
|
bulwahn@33124
|
2748 |
fun check predname =
|
bulwahn@33124
|
2749 |
let
|
bulwahn@33124
|
2750 |
val intros = intros_of thy predname
|
bulwahn@33124
|
2751 |
val elim = the_elim_of thy predname
|
bulwahn@33124
|
2752 |
val nparams = nparams_of thy predname
|
bulwahn@33124
|
2753 |
val elim' =
|
wenzelm@35021
|
2754 |
(Drule.export_without_context o Skip_Proof.make_thm thy)
|
wenzelm@36633
|
2755 |
(mk_casesrule (ProofContext.init_global thy) nparams intros)
|
bulwahn@33124
|
2756 |
in
|
bulwahn@33124
|
2757 |
if not (Thm.equiv_thm (elim, elim')) then
|
bulwahn@33124
|
2758 |
error "Introduction and elimination rules do not match!"
|
bulwahn@33124
|
2759 |
else true
|
bulwahn@33124
|
2760 |
end
|
bulwahn@33124
|
2761 |
in forall check prednames end
|
bulwahn@33124
|
2762 |
*)
|
bulwahn@33113
|
2763 |
|
bulwahn@33376
|
2764 |
(* create code equation *)
|
bulwahn@33376
|
2765 |
|
bulwahn@34935
|
2766 |
fun add_code_equations thy preds result_thmss =
|
bulwahn@33376
|
2767 |
let
|
wenzelm@36633
|
2768 |
val ctxt = ProofContext.init_global thy
|
bulwahn@33629
|
2769 |
fun add_code_equation (predname, T) (pred, result_thms) =
|
bulwahn@33376
|
2770 |
let
|
bulwahn@34935
|
2771 |
val full_mode = fold_rev (curry Fun) (map (K Input) (binder_types T)) Bool
|
bulwahn@33376
|
2772 |
in
|
bulwahn@36994
|
2773 |
if member (op =) (modes_of Pred ctxt predname) full_mode then
|
bulwahn@33376
|
2774 |
let
|
bulwahn@33376
|
2775 |
val Ts = binder_types T
|
bulwahn@33376
|
2776 |
val arg_names = Name.variant_list []
|
bulwahn@33376
|
2777 |
(map (fn i => "x" ^ string_of_int i) (1 upto length Ts))
|
bulwahn@33629
|
2778 |
val args = map2 (curry Free) arg_names Ts
|
bulwahn@36994
|
2779 |
val predfun = Const (function_name_of Pred ctxt predname full_mode,
|
bulwahn@33376
|
2780 |
Ts ---> PredicateCompFuns.mk_predT @{typ unit})
|
bulwahn@33754
|
2781 |
val rhs = @{term Predicate.holds} $ (list_comb (predfun, args))
|
bulwahn@33376
|
2782 |
val eq_term = HOLogic.mk_Trueprop
|
bulwahn@33376
|
2783 |
(HOLogic.mk_eq (list_comb (Const (predname, T), args), rhs))
|
bulwahn@35888
|
2784 |
val def = predfun_definition_of ctxt predname full_mode
|
wenzelm@33448
|
2785 |
val tac = fn _ => Simplifier.simp_tac
|
bulwahn@33754
|
2786 |
(HOL_basic_ss addsimps [def, @{thm holds_eq}, @{thm eval_pred}]) 1
|
bulwahn@35888
|
2787 |
val eq = Goal.prove ctxt arg_names [] eq_term tac
|
bulwahn@33376
|
2788 |
in
|
bulwahn@33376
|
2789 |
(pred, result_thms @ [eq])
|
bulwahn@33376
|
2790 |
end
|
bulwahn@33376
|
2791 |
else
|
bulwahn@33376
|
2792 |
(pred, result_thms)
|
bulwahn@33376
|
2793 |
end
|
bulwahn@33376
|
2794 |
in
|
bulwahn@33629
|
2795 |
map2 add_code_equation preds result_thmss
|
bulwahn@33376
|
2796 |
end
|
bulwahn@33376
|
2797 |
|
bulwahn@32667
|
2798 |
(** main function of predicate compiler **)
|
bulwahn@32667
|
2799 |
|
bulwahn@33330
|
2800 |
datatype steps = Steps of
|
bulwahn@33330
|
2801 |
{
|
bulwahn@35324
|
2802 |
define_functions : options -> (string * typ) list -> string * (bool * mode) list -> theory -> theory,
|
bulwahn@35324
|
2803 |
prove : options -> theory -> (string * (term list * indprem list) list) list -> (string * typ) list
|
bulwahn@33330
|
2804 |
-> moded_clause list pred_mode_table -> term pred_mode_table -> thm pred_mode_table,
|
bulwahn@34935
|
2805 |
add_code_equations : theory -> (string * typ) list
|
bulwahn@33376
|
2806 |
-> (string * thm list) list -> (string * thm list) list,
|
bulwahn@34935
|
2807 |
comp_modifiers : Comp_Mod.comp_modifiers,
|
bulwahn@35324
|
2808 |
use_random : bool,
|
bulwahn@33330
|
2809 |
qname : bstring
|
bulwahn@33330
|
2810 |
}
|
bulwahn@33330
|
2811 |
|
bulwahn@35324
|
2812 |
fun add_equations_of steps mode_analysis_options options prednames thy =
|
bulwahn@32667
|
2813 |
let
|
bulwahn@33330
|
2814 |
fun dest_steps (Steps s) = s
|
bulwahn@35879
|
2815 |
val compilation = Comp_Mod.compilation (#comp_modifiers (dest_steps steps))
|
bulwahn@33482
|
2816 |
val _ = print_step options
|
bulwahn@35879
|
2817 |
("Starting predicate compiler (compilation: " ^ string_of_compilation compilation
|
bulwahn@35879
|
2818 |
^ ") for predicates " ^ commas prednames ^ "...")
|
bulwahn@33124
|
2819 |
(*val _ = check_intros_elim_match thy prednames*)
|
bulwahn@33114
|
2820 |
(*val _ = map (check_format_of_intro_rule thy) (maps (intros_of thy) prednames)*)
|
bulwahn@35324
|
2821 |
val _ =
|
bulwahn@35324
|
2822 |
if show_intermediate_results options then
|
bulwahn@35324
|
2823 |
tracing (commas (map (Display.string_of_thm_global thy) (maps (intros_of thy) prednames)))
|
bulwahn@35324
|
2824 |
else ()
|
bulwahn@35324
|
2825 |
val (preds, all_vs, param_vs, all_modes, clauses) =
|
bulwahn@34935
|
2826 |
prepare_intrs options compilation thy prednames (maps (intros_of thy) prednames)
|
bulwahn@33123
|
2827 |
val _ = print_step options "Infering modes..."
|
bulwahn@34935
|
2828 |
val ((moded_clauses, errors), thy') =
|
bulwahn@36251
|
2829 |
Output.cond_timeit true "Infering modes"
|
bulwahn@36251
|
2830 |
(fn _ => infer_modes mode_analysis_options
|
bulwahn@36251
|
2831 |
options compilation preds all_modes param_vs clauses thy)
|
bulwahn@33132
|
2832 |
val modes = map (fn (p, mps) => (p, map fst mps)) moded_clauses
|
bulwahn@33619
|
2833 |
val _ = check_expected_modes preds options modes
|
bulwahn@35324
|
2834 |
(*val _ = check_proposed_modes preds options modes (fst extra_modes) errors*)
|
bulwahn@36995
|
2835 |
val _ = print_modes options modes
|
bulwahn@33123
|
2836 |
val _ = print_step options "Defining executable functions..."
|
bulwahn@36252
|
2837 |
val thy'' =
|
bulwahn@36261
|
2838 |
Output.cond_timeit (!Quickcheck.timing) "Defining executable functions..."
|
bulwahn@36252
|
2839 |
(fn _ => fold (#define_functions (dest_steps steps) options preds) modes thy'
|
bulwahn@36252
|
2840 |
|> Theory.checkpoint)
|
bulwahn@33123
|
2841 |
val _ = print_step options "Compiling equations..."
|
bulwahn@32667
|
2842 |
val compiled_terms =
|
bulwahn@36261
|
2843 |
Output.cond_timeit (!Quickcheck.timing) "Compiling equations...." (fn _ =>
|
bulwahn@36254
|
2844 |
compile_preds options
|
bulwahn@36261
|
2845 |
(#comp_modifiers (dest_steps steps)) thy'' all_vs param_vs preds moded_clauses)
|
bulwahn@34935
|
2846 |
val _ = print_compiled_terms options thy'' compiled_terms
|
bulwahn@33123
|
2847 |
val _ = print_step options "Proving equations..."
|
bulwahn@35324
|
2848 |
val result_thms =
|
bulwahn@36261
|
2849 |
Output.cond_timeit (!Quickcheck.timing) "Proving equations...." (fn _ =>
|
bulwahn@36252
|
2850 |
#prove (dest_steps steps) options thy'' clauses preds moded_clauses compiled_terms)
|
bulwahn@34935
|
2851 |
val result_thms' = #add_code_equations (dest_steps steps) thy'' preds
|
bulwahn@33376
|
2852 |
(maps_modes result_thms)
|
bulwahn@33330
|
2853 |
val qname = #qname (dest_steps steps)
|
bulwahn@32667
|
2854 |
val attrib = fn thy => Attrib.attribute_i thy (Attrib.internal (K (Thm.declaration_attribute
|
bulwahn@32667
|
2855 |
(fn thm => Context.mapping (Code.add_eqn thm) I))))
|
bulwahn@36252
|
2856 |
val thy''' =
|
bulwahn@36261
|
2857 |
Output.cond_timeit (!Quickcheck.timing) "Setting code equations...." (fn _ =>
|
bulwahn@36252
|
2858 |
fold (fn (name, result_thms) => fn thy => snd (PureThy.add_thmss
|
bulwahn@32667
|
2859 |
[((Binding.qualify true (Long_Name.base_name name) (Binding.name qname), result_thms),
|
bulwahn@32667
|
2860 |
[attrib thy ])] thy))
|
bulwahn@36252
|
2861 |
result_thms' thy'' |> Theory.checkpoint)
|
bulwahn@32667
|
2862 |
in
|
bulwahn@34935
|
2863 |
thy'''
|
bulwahn@32667
|
2864 |
end
|
bulwahn@32667
|
2865 |
|
bulwahn@32667
|
2866 |
fun extend' value_of edges_of key (G, visited) =
|
bulwahn@32667
|
2867 |
let
|
bulwahn@32667
|
2868 |
val (G', v) = case try (Graph.get_node G) key of
|
bulwahn@32667
|
2869 |
SOME v => (G, v)
|
bulwahn@32667
|
2870 |
| NONE => (Graph.new_node (key, value_of key) G, value_of key)
|
bulwahn@33482
|
2871 |
val (G'', visited') = fold (extend' value_of edges_of)
|
bulwahn@33482
|
2872 |
(subtract (op =) visited (edges_of (key, v)))
|
bulwahn@33326
|
2873 |
(G', key :: visited)
|
bulwahn@32667
|
2874 |
in
|
bulwahn@32667
|
2875 |
(fold (Graph.add_edge o (pair key)) (edges_of (key, v)) G'', visited')
|
bulwahn@32667
|
2876 |
end;
|
bulwahn@32667
|
2877 |
|
bulwahn@32667
|
2878 |
fun extend value_of edges_of key G = fst (extend' value_of edges_of key (G, []))
|
bulwahn@32667
|
2879 |
|
bulwahn@33132
|
2880 |
fun gen_add_equations steps options names thy =
|
bulwahn@32667
|
2881 |
let
|
bulwahn@33330
|
2882 |
fun dest_steps (Steps s) = s
|
bulwahn@34935
|
2883 |
val defined = defined_functions (Comp_Mod.compilation (#comp_modifiers (dest_steps steps)))
|
bulwahn@36994
|
2884 |
val ctxt = ProofContext.init_global thy
|
bulwahn@33482
|
2885 |
val thy' = thy
|
bulwahn@36994
|
2886 |
|> PredData.map (fold (extend (fetch_pred_data thy) (depending_preds_of ctxt)) names)
|
bulwahn@32667
|
2887 |
|> Theory.checkpoint;
|
bulwahn@32667
|
2888 |
fun strong_conn_of gr keys =
|
bulwahn@32667
|
2889 |
Graph.strong_conn (Graph.subgraph (member (op =) (Graph.all_succs gr keys)) gr)
|
bulwahn@32667
|
2890 |
val scc = strong_conn_of (PredData.get thy') names
|
bulwahn@34935
|
2891 |
|
bulwahn@32667
|
2892 |
val thy'' = fold_rev
|
bulwahn@32667
|
2893 |
(fn preds => fn thy =>
|
bulwahn@36994
|
2894 |
if not (forall (defined (ProofContext.init_global thy)) preds) then
|
bulwahn@35324
|
2895 |
let
|
bulwahn@35324
|
2896 |
val mode_analysis_options = {use_random = #use_random (dest_steps steps),
|
bulwahn@35324
|
2897 |
reorder_premises =
|
bulwahn@35324
|
2898 |
not (no_topmost_reordering options andalso not (null (inter (op =) preds names))),
|
bulwahn@35324
|
2899 |
infer_pos_and_neg_modes = #use_random (dest_steps steps)}
|
bulwahn@35324
|
2900 |
in
|
bulwahn@35324
|
2901 |
add_equations_of steps mode_analysis_options options preds thy
|
bulwahn@35324
|
2902 |
end
|
bulwahn@33483
|
2903 |
else thy)
|
bulwahn@32667
|
2904 |
scc thy' |> Theory.checkpoint
|
bulwahn@32667
|
2905 |
in thy'' end
|
bulwahn@35879
|
2906 |
|
bulwahn@34935
|
2907 |
val add_equations = gen_add_equations
|
bulwahn@35324
|
2908 |
(Steps {
|
bulwahn@35324
|
2909 |
define_functions =
|
bulwahn@35324
|
2910 |
fn options => fn preds => fn (s, modes) =>
|
bulwahn@35324
|
2911 |
create_definitions
|
bulwahn@35324
|
2912 |
options preds (s, map_filter (fn (true, m) => SOME m | _ => NONE) modes),
|
bulwahn@34935
|
2913 |
prove = prove,
|
bulwahn@34935
|
2914 |
add_code_equations = add_code_equations,
|
bulwahn@34935
|
2915 |
comp_modifiers = predicate_comp_modifiers,
|
bulwahn@35324
|
2916 |
use_random = false,
|
bulwahn@34935
|
2917 |
qname = "equation"})
|
bulwahn@33143
|
2918 |
|
bulwahn@33134
|
2919 |
val add_depth_limited_equations = gen_add_equations
|
bulwahn@35879
|
2920 |
(Steps {
|
bulwahn@35879
|
2921 |
define_functions =
|
bulwahn@35879
|
2922 |
fn options => fn preds => fn (s, modes) =>
|
bulwahn@35879
|
2923 |
define_functions depth_limited_comp_modifiers PredicateCompFuns.compfuns
|
bulwahn@35879
|
2924 |
options preds (s, map_filter (fn (true, m) => SOME m | _ => NONE) modes),
|
bulwahn@32667
|
2925 |
prove = prove_by_skip,
|
bulwahn@34935
|
2926 |
add_code_equations = K (K I),
|
bulwahn@35879
|
2927 |
comp_modifiers = depth_limited_comp_modifiers,
|
bulwahn@35879
|
2928 |
use_random = false,
|
bulwahn@33330
|
2929 |
qname = "depth_limited_equation"})
|
bulwahn@35879
|
2930 |
|
bulwahn@33473
|
2931 |
val add_annotated_equations = gen_add_equations
|
bulwahn@35324
|
2932 |
(Steps {
|
bulwahn@35324
|
2933 |
define_functions =
|
bulwahn@35324
|
2934 |
fn options => fn preds => fn (s, modes) =>
|
bulwahn@35324
|
2935 |
define_functions annotated_comp_modifiers PredicateCompFuns.compfuns options preds
|
bulwahn@35324
|
2936 |
(s, map_filter (fn (true, m) => SOME m | _ => NONE) modes),
|
bulwahn@33473
|
2937 |
prove = prove_by_skip,
|
bulwahn@34935
|
2938 |
add_code_equations = K (K I),
|
bulwahn@34935
|
2939 |
comp_modifiers = annotated_comp_modifiers,
|
bulwahn@35324
|
2940 |
use_random = false,
|
bulwahn@33473
|
2941 |
qname = "annotated_equation"})
|
bulwahn@35880
|
2942 |
|
bulwahn@35880
|
2943 |
val add_random_equations = gen_add_equations
|
bulwahn@35880
|
2944 |
(Steps {
|
bulwahn@35880
|
2945 |
define_functions =
|
bulwahn@35880
|
2946 |
fn options => fn preds => fn (s, modes) =>
|
bulwahn@35880
|
2947 |
define_functions random_comp_modifiers PredicateCompFuns.compfuns options preds
|
bulwahn@35880
|
2948 |
(s, map_filter (fn (true, m) => SOME m | _ => NONE) modes),
|
bulwahn@35880
|
2949 |
comp_modifiers = random_comp_modifiers,
|
bulwahn@32667
|
2950 |
prove = prove_by_skip,
|
bulwahn@34935
|
2951 |
add_code_equations = K (K I),
|
bulwahn@35880
|
2952 |
use_random = true,
|
bulwahn@33375
|
2953 |
qname = "random_equation"})
|
bulwahn@35880
|
2954 |
|
bulwahn@35881
|
2955 |
val add_depth_limited_random_equations = gen_add_equations
|
bulwahn@35881
|
2956 |
(Steps {
|
bulwahn@35881
|
2957 |
define_functions =
|
bulwahn@35881
|
2958 |
fn options => fn preds => fn (s, modes) =>
|
bulwahn@35881
|
2959 |
define_functions depth_limited_random_comp_modifiers PredicateCompFuns.compfuns options preds
|
bulwahn@35881
|
2960 |
(s, map_filter (fn (true, m) => SOME m | _ => NONE) modes),
|
bulwahn@35881
|
2961 |
comp_modifiers = depth_limited_random_comp_modifiers,
|
bulwahn@35881
|
2962 |
prove = prove_by_skip,
|
bulwahn@35881
|
2963 |
add_code_equations = K (K I),
|
bulwahn@35881
|
2964 |
use_random = true,
|
bulwahn@35881
|
2965 |
qname = "depth_limited_random_equation"})
|
bulwahn@35881
|
2966 |
|
bulwahn@34935
|
2967 |
val add_dseq_equations = gen_add_equations
|
bulwahn@35324
|
2968 |
(Steps {
|
bulwahn@35324
|
2969 |
define_functions =
|
bulwahn@35324
|
2970 |
fn options => fn preds => fn (s, modes) =>
|
bulwahn@35324
|
2971 |
define_functions dseq_comp_modifiers DSequence_CompFuns.compfuns
|
bulwahn@35324
|
2972 |
options preds (s, map_filter (fn (true, m) => SOME m | _ => NONE) modes),
|
bulwahn@34935
|
2973 |
prove = prove_by_skip,
|
bulwahn@34935
|
2974 |
add_code_equations = K (K I),
|
bulwahn@34935
|
2975 |
comp_modifiers = dseq_comp_modifiers,
|
bulwahn@35324
|
2976 |
use_random = false,
|
bulwahn@34935
|
2977 |
qname = "dseq_equation"})
|
bulwahn@34935
|
2978 |
|
bulwahn@34935
|
2979 |
val add_random_dseq_equations = gen_add_equations
|
bulwahn@35324
|
2980 |
(Steps {
|
bulwahn@35324
|
2981 |
define_functions =
|
bulwahn@35324
|
2982 |
fn options => fn preds => fn (s, modes) =>
|
bulwahn@35324
|
2983 |
let
|
bulwahn@35324
|
2984 |
val pos_modes = map_filter (fn (true, m) => SOME m | _ => NONE) modes
|
bulwahn@35324
|
2985 |
val neg_modes = map_filter (fn (false, m) => SOME m | _ => NONE) modes
|
bulwahn@35324
|
2986 |
in define_functions pos_random_dseq_comp_modifiers Random_Sequence_CompFuns.compfuns
|
bulwahn@35324
|
2987 |
options preds (s, pos_modes)
|
bulwahn@35324
|
2988 |
#> define_functions neg_random_dseq_comp_modifiers Random_Sequence_CompFuns.compfuns
|
bulwahn@35324
|
2989 |
options preds (s, neg_modes)
|
bulwahn@35324
|
2990 |
end,
|
bulwahn@34935
|
2991 |
prove = prove_by_skip,
|
bulwahn@34935
|
2992 |
add_code_equations = K (K I),
|
bulwahn@35324
|
2993 |
comp_modifiers = pos_random_dseq_comp_modifiers,
|
bulwahn@35324
|
2994 |
use_random = true,
|
bulwahn@34935
|
2995 |
qname = "random_dseq_equation"})
|
bulwahn@34935
|
2996 |
|
bulwahn@36012
|
2997 |
val add_new_random_dseq_equations = gen_add_equations
|
bulwahn@36012
|
2998 |
(Steps {
|
bulwahn@36012
|
2999 |
define_functions =
|
bulwahn@36012
|
3000 |
fn options => fn preds => fn (s, modes) =>
|
bulwahn@36012
|
3001 |
let
|
bulwahn@36012
|
3002 |
val pos_modes = map_filter (fn (true, m) => SOME m | _ => NONE) modes
|
bulwahn@36012
|
3003 |
val neg_modes = map_filter (fn (false, m) => SOME m | _ => NONE) modes
|
bulwahn@36012
|
3004 |
in define_functions new_pos_random_dseq_comp_modifiers New_Pos_Random_Sequence_CompFuns.compfuns
|
bulwahn@36012
|
3005 |
options preds (s, pos_modes)
|
bulwahn@36012
|
3006 |
#> define_functions new_neg_random_dseq_comp_modifiers New_Neg_Random_Sequence_CompFuns.compfuns
|
bulwahn@36012
|
3007 |
options preds (s, neg_modes)
|
bulwahn@36012
|
3008 |
end,
|
bulwahn@36012
|
3009 |
prove = prove_by_skip,
|
bulwahn@36012
|
3010 |
add_code_equations = K (K I),
|
bulwahn@36012
|
3011 |
comp_modifiers = new_pos_random_dseq_comp_modifiers,
|
bulwahn@36012
|
3012 |
use_random = true,
|
bulwahn@36012
|
3013 |
qname = "new_random_dseq_equation"})
|
bulwahn@32667
|
3014 |
|
bulwahn@32667
|
3015 |
(** user interface **)
|
bulwahn@32667
|
3016 |
|
bulwahn@32667
|
3017 |
(* code_pred_intro attribute *)
|
bulwahn@32667
|
3018 |
|
bulwahn@32667
|
3019 |
fun attrib f = Thm.declaration_attribute (fn thm => Context.mapping (f thm) I);
|
bulwahn@32667
|
3020 |
|
bulwahn@33628
|
3021 |
val code_pred_intro_attrib = attrib add_intro;
|
bulwahn@32667
|
3022 |
|
bulwahn@32668
|
3023 |
|
bulwahn@32668
|
3024 |
(*FIXME
|
bulwahn@32668
|
3025 |
- Naming of auxiliary rules necessary?
|
bulwahn@32668
|
3026 |
*)
|
bulwahn@32668
|
3027 |
|
bulwahn@32668
|
3028 |
val setup = PredData.put (Graph.empty) #>
|
bulwahn@33628
|
3029 |
Attrib.setup @{binding code_pred_intro} (Scan.succeed (attrib add_intro))
|
bulwahn@32668
|
3030 |
"adding alternative introduction rules for code generation of inductive predicates"
|
bulwahn@32667
|
3031 |
|
wenzelm@33522
|
3032 |
(* TODO: make Theory_Data to Generic_Data & remove duplication of local theory and theory *)
|
bulwahn@33132
|
3033 |
fun generic_code_pred prep_const options raw_const lthy =
|
bulwahn@32667
|
3034 |
let
|
bulwahn@32667
|
3035 |
val thy = ProofContext.theory_of lthy
|
bulwahn@32667
|
3036 |
val const = prep_const thy raw_const
|
bulwahn@36994
|
3037 |
val ctxt = ProofContext.init_global thy
|
wenzelm@33673
|
3038 |
val lthy' = Local_Theory.theory (PredData.map
|
bulwahn@36994
|
3039 |
(extend (fetch_pred_data thy) (depending_preds_of ctxt) const)) lthy
|
bulwahn@32667
|
3040 |
val thy' = ProofContext.theory_of lthy'
|
bulwahn@33326
|
3041 |
val preds = Graph.all_succs (PredData.get thy') [const] |> filter_out (has_elim thy')
|
bulwahn@32667
|
3042 |
fun mk_cases const =
|
bulwahn@32667
|
3043 |
let
|
bulwahn@33146
|
3044 |
val T = Sign.the_const_type thy const
|
bulwahn@33146
|
3045 |
val pred = Const (const, T)
|
bulwahn@32667
|
3046 |
val intros = intros_of thy' const
|
bulwahn@34935
|
3047 |
in mk_casesrule lthy' pred intros end
|
bulwahn@32667
|
3048 |
val cases_rules = map mk_cases preds
|
bulwahn@32667
|
3049 |
val cases =
|
wenzelm@33368
|
3050 |
map (fn case_rule => Rule_Cases.Case {fixes = [],
|
bulwahn@32667
|
3051 |
assumes = [("", Logic.strip_imp_prems case_rule)],
|
bulwahn@32667
|
3052 |
binds = [], cases = []}) cases_rules
|
bulwahn@32667
|
3053 |
val case_env = map2 (fn p => fn c => (Long_Name.base_name p, SOME c)) preds cases
|
bulwahn@32667
|
3054 |
val lthy'' = lthy'
|
bulwahn@32667
|
3055 |
|> fold Variable.auto_fixes cases_rules
|
bulwahn@32667
|
3056 |
|> ProofContext.add_cases true case_env
|
bulwahn@32667
|
3057 |
fun after_qed thms goal_ctxt =
|
bulwahn@32667
|
3058 |
let
|
bulwahn@32667
|
3059 |
val global_thms = ProofContext.export goal_ctxt
|
wenzelm@36633
|
3060 |
(ProofContext.init_global (ProofContext.theory_of goal_ctxt)) (map the_single thms)
|
bulwahn@32667
|
3061 |
in
|
wenzelm@33673
|
3062 |
goal_ctxt |> Local_Theory.theory (fold set_elim global_thms #>
|
bulwahn@34935
|
3063 |
((case compilation options of
|
bulwahn@34935
|
3064 |
Pred => add_equations
|
bulwahn@34935
|
3065 |
| DSeq => add_dseq_equations
|
bulwahn@35879
|
3066 |
| Pos_Random_DSeq => add_random_dseq_equations
|
bulwahn@35879
|
3067 |
| Depth_Limited => add_depth_limited_equations
|
bulwahn@35880
|
3068 |
| Random => add_random_equations
|
bulwahn@35881
|
3069 |
| Depth_Limited_Random => add_depth_limited_random_equations
|
bulwahn@36012
|
3070 |
| New_Pos_Random_DSeq => add_new_random_dseq_equations
|
bulwahn@34935
|
3071 |
| compilation => error ("Compilation not supported")
|
bulwahn@34935
|
3072 |
) options [const]))
|
bulwahn@33144
|
3073 |
end
|
bulwahn@32667
|
3074 |
in
|
wenzelm@36334
|
3075 |
Proof.theorem NONE after_qed (map (single o (rpair [])) cases_rules) lthy''
|
bulwahn@32667
|
3076 |
end;
|
bulwahn@32667
|
3077 |
|
bulwahn@32667
|
3078 |
val code_pred = generic_code_pred (K I);
|
bulwahn@32667
|
3079 |
val code_pred_cmd = generic_code_pred Code.read_const
|
bulwahn@32667
|
3080 |
|
bulwahn@32667
|
3081 |
(* transformation for code generation *)
|
bulwahn@32667
|
3082 |
|
wenzelm@32740
|
3083 |
val eval_ref = Unsynchronized.ref (NONE : (unit -> term Predicate.pred) option);
|
bulwahn@33482
|
3084 |
val random_eval_ref =
|
bulwahn@33482
|
3085 |
Unsynchronized.ref (NONE : (unit -> int * int -> term Predicate.pred * (int * int)) option);
|
bulwahn@34935
|
3086 |
val dseq_eval_ref = Unsynchronized.ref (NONE : (unit -> term DSequence.dseq) option);
|
bulwahn@34935
|
3087 |
val random_dseq_eval_ref =
|
bulwahn@34935
|
3088 |
Unsynchronized.ref (NONE : (unit -> int -> int -> int * int -> term DSequence.dseq * (int * int)) option);
|
bulwahn@36014
|
3089 |
val new_random_dseq_eval_ref =
|
bulwahn@36014
|
3090 |
Unsynchronized.ref (NONE : (unit -> int -> int -> int * int -> int -> term Lazy_Sequence.lazy_sequence) option)
|
bulwahn@36021
|
3091 |
val new_random_dseq_stats_eval_ref =
|
bulwahn@36021
|
3092 |
Unsynchronized.ref (NONE :
|
bulwahn@36021
|
3093 |
(unit -> int -> int -> int * int -> int -> (term * int) Lazy_Sequence.lazy_sequence) option)
|
bulwahn@32667
|
3094 |
|
bulwahn@32667
|
3095 |
(*FIXME turn this into an LCF-guarded preprocessor for comprehensions*)
|
bulwahn@36994
|
3096 |
fun analyze_compr ctxt compfuns param_user_modes (compilation, arguments) t_compr =
|
bulwahn@32667
|
3097 |
let
|
bulwahn@34935
|
3098 |
val all_modes_of = all_modes_of compilation
|
bulwahn@32667
|
3099 |
val split = case t_compr of (Const (@{const_name Collect}, _) $ t) => t
|
bulwahn@36994
|
3100 |
| _ => error ("Not a set comprehension: " ^ Syntax.string_of_term ctxt t_compr);
|
bulwahn@32667
|
3101 |
val (body, Ts, fp) = HOLogic.strip_psplits split;
|
bulwahn@34935
|
3102 |
val output_names = Name.variant_list (Term.add_free_names body [])
|
bulwahn@34935
|
3103 |
(map (fn i => "x" ^ string_of_int i) (1 upto length Ts))
|
haftmann@34950
|
3104 |
val output_frees = map2 (curry Free) output_names (rev Ts)
|
bulwahn@34935
|
3105 |
val body = subst_bounds (output_frees, body)
|
haftmann@34950
|
3106 |
val T_compr = HOLogic.mk_ptupleT fp Ts
|
bulwahn@34935
|
3107 |
val output_tuple = HOLogic.mk_ptuple fp T_compr (rev output_frees)
|
bulwahn@36025
|
3108 |
val (pred as Const (name, T), all_args) =
|
bulwahn@36025
|
3109 |
case strip_comb body of
|
bulwahn@36025
|
3110 |
(Const (name, T), all_args) => (Const (name, T), all_args)
|
bulwahn@36994
|
3111 |
| (head, _) => error ("Not a constant: " ^ Syntax.string_of_term ctxt head)
|
bulwahn@34935
|
3112 |
in
|
bulwahn@36994
|
3113 |
if defined_functions compilation ctxt name then
|
bulwahn@32668
|
3114 |
let
|
bulwahn@34935
|
3115 |
fun extract_mode (Const ("Pair", _) $ t1 $ t2) = Pair (extract_mode t1, extract_mode t2)
|
bulwahn@34935
|
3116 |
| extract_mode (Free (x, _)) = if member (op =) output_names x then Output else Input
|
bulwahn@34935
|
3117 |
| extract_mode _ = Input
|
bulwahn@34935
|
3118 |
val user_mode = fold_rev (curry Fun) (map extract_mode all_args) Bool
|
bulwahn@34935
|
3119 |
fun valid modes1 modes2 =
|
bulwahn@34935
|
3120 |
case int_ord (length modes1, length modes2) of
|
bulwahn@34935
|
3121 |
GREATER => error "Not enough mode annotations"
|
bulwahn@34935
|
3122 |
| LESS => error "Too many mode annotations"
|
bulwahn@34935
|
3123 |
| EQUAL => forall (fn (m, NONE) => true | (m, SOME m2) => eq_mode (m, m2))
|
bulwahn@34935
|
3124 |
(modes1 ~~ modes2)
|
bulwahn@34935
|
3125 |
fun mode_instance_of (m1, m2) =
|
bulwahn@34935
|
3126 |
let
|
bulwahn@34935
|
3127 |
fun instance_of (Fun _, Input) = true
|
bulwahn@34935
|
3128 |
| instance_of (Input, Input) = true
|
bulwahn@34935
|
3129 |
| instance_of (Output, Output) = true
|
bulwahn@34935
|
3130 |
| instance_of (Pair (m1, m2), Pair (m1', m2')) =
|
bulwahn@34935
|
3131 |
instance_of (m1, m1') andalso instance_of (m2, m2')
|
bulwahn@34935
|
3132 |
| instance_of (Pair (m1, m2), Input) =
|
bulwahn@34935
|
3133 |
instance_of (m1, Input) andalso instance_of (m2, Input)
|
bulwahn@34935
|
3134 |
| instance_of (Pair (m1, m2), Output) =
|
bulwahn@34935
|
3135 |
instance_of (m1, Output) andalso instance_of (m2, Output)
|
bulwahn@36993
|
3136 |
| instance_of (Input, Pair (m1, m2)) =
|
bulwahn@36993
|
3137 |
instance_of (Input, m1) andalso instance_of (Input, m2)
|
bulwahn@36993
|
3138 |
| instance_of (Output, Pair (m1, m2)) =
|
bulwahn@36993
|
3139 |
instance_of (Output, m1) andalso instance_of (Output, m2)
|
bulwahn@34935
|
3140 |
| instance_of _ = false
|
bulwahn@34935
|
3141 |
in forall instance_of (strip_fun_mode m1 ~~ strip_fun_mode m2) end
|
bulwahn@36994
|
3142 |
val derivs = all_derivations_of ctxt (all_modes_of ctxt) [] body
|
bulwahn@34935
|
3143 |
|> filter (fn (d, missing_vars) =>
|
bulwahn@34935
|
3144 |
let
|
bulwahn@34935
|
3145 |
val (p_mode :: modes) = collect_context_modes d
|
bulwahn@34935
|
3146 |
in
|
bulwahn@34935
|
3147 |
null missing_vars andalso
|
bulwahn@34935
|
3148 |
mode_instance_of (p_mode, user_mode) andalso
|
bulwahn@34935
|
3149 |
the_default true (Option.map (valid modes) param_user_modes)
|
bulwahn@34935
|
3150 |
end)
|
bulwahn@34935
|
3151 |
|> map fst
|
bulwahn@34935
|
3152 |
val deriv = case derivs of
|
bulwahn@34935
|
3153 |
[] => error ("No mode possible for comprehension "
|
bulwahn@36994
|
3154 |
^ Syntax.string_of_term ctxt t_compr)
|
bulwahn@34935
|
3155 |
| [d] => d
|
bulwahn@34935
|
3156 |
| d :: _ :: _ => (warning ("Multiple modes possible for comprehension "
|
bulwahn@36994
|
3157 |
^ Syntax.string_of_term ctxt t_compr); d);
|
bulwahn@34935
|
3158 |
val (_, outargs) = split_mode (head_mode_of deriv) all_args
|
bulwahn@34935
|
3159 |
val additional_arguments =
|
bulwahn@34935
|
3160 |
case compilation of
|
bulwahn@34935
|
3161 |
Pred => []
|
bulwahn@35880
|
3162 |
| Random => map (HOLogic.mk_number @{typ "code_numeral"}) arguments @
|
bulwahn@35880
|
3163 |
[@{term "(1, 1) :: code_numeral * code_numeral"}]
|
bulwahn@34935
|
3164 |
| Annotated => []
|
bulwahn@35879
|
3165 |
| Depth_Limited => [HOLogic.mk_number @{typ "code_numeral"} (hd arguments)]
|
bulwahn@35881
|
3166 |
| Depth_Limited_Random => map (HOLogic.mk_number @{typ "code_numeral"}) arguments @
|
bulwahn@35881
|
3167 |
[@{term "(1, 1) :: code_numeral * code_numeral"}]
|
bulwahn@34935
|
3168 |
| DSeq => []
|
bulwahn@35879
|
3169 |
| Pos_Random_DSeq => []
|
bulwahn@36014
|
3170 |
| New_Pos_Random_DSeq => []
|
bulwahn@34935
|
3171 |
val comp_modifiers =
|
bulwahn@34935
|
3172 |
case compilation of
|
bulwahn@34935
|
3173 |
Pred => predicate_comp_modifiers
|
bulwahn@35879
|
3174 |
| Random => random_comp_modifiers
|
bulwahn@34935
|
3175 |
| Depth_Limited => depth_limited_comp_modifiers
|
bulwahn@35881
|
3176 |
| Depth_Limited_Random => depth_limited_random_comp_modifiers
|
bulwahn@35879
|
3177 |
(*| Annotated => annotated_comp_modifiers*)
|
bulwahn@34935
|
3178 |
| DSeq => dseq_comp_modifiers
|
bulwahn@35879
|
3179 |
| Pos_Random_DSeq => pos_random_dseq_comp_modifiers
|
bulwahn@36014
|
3180 |
| New_Pos_Random_DSeq => new_pos_random_dseq_comp_modifiers
|
bulwahn@36994
|
3181 |
val t_pred = compile_expr comp_modifiers ctxt
|
bulwahn@36014
|
3182 |
(body, deriv) additional_arguments;
|
bulwahn@34935
|
3183 |
val T_pred = dest_predT compfuns (fastype_of t_pred)
|
bulwahn@34935
|
3184 |
val arrange = split_lambda (HOLogic.mk_tuple outargs) output_tuple
|
bulwahn@34935
|
3185 |
in
|
bulwahn@34935
|
3186 |
if null outargs then t_pred else mk_map compfuns T_pred T_compr arrange t_pred
|
bulwahn@34935
|
3187 |
end
|
bulwahn@34935
|
3188 |
else
|
bulwahn@34935
|
3189 |
error "Evaluation with values is not possible because compilation with code_pred was not invoked"
|
bulwahn@34935
|
3190 |
end
|
bulwahn@32667
|
3191 |
|
bulwahn@36994
|
3192 |
fun eval ctxt stats param_user_modes (options as (compilation, arguments)) k t_compr =
|
bulwahn@32667
|
3193 |
let
|
bulwahn@36021
|
3194 |
fun count xs x =
|
bulwahn@36021
|
3195 |
let
|
bulwahn@36021
|
3196 |
fun count' i [] = i
|
bulwahn@36021
|
3197 |
| count' i (x' :: xs) = if x = x' then count' (i + 1) xs else count' i xs
|
bulwahn@36021
|
3198 |
in count' 0 xs end
|
bulwahn@36021
|
3199 |
fun accumulate xs = map (fn x => (x, count xs x)) (sort int_ord (distinct (op =) xs))
|
bulwahn@34935
|
3200 |
val compfuns =
|
bulwahn@34935
|
3201 |
case compilation of
|
bulwahn@35880
|
3202 |
Random => PredicateCompFuns.compfuns
|
bulwahn@34935
|
3203 |
| DSeq => DSequence_CompFuns.compfuns
|
bulwahn@35324
|
3204 |
| Pos_Random_DSeq => Random_Sequence_CompFuns.compfuns
|
bulwahn@36014
|
3205 |
| New_Pos_Random_DSeq => New_Pos_Random_Sequence_CompFuns.compfuns
|
bulwahn@34935
|
3206 |
| _ => PredicateCompFuns.compfuns
|
bulwahn@36994
|
3207 |
val t = analyze_compr ctxt compfuns param_user_modes options t_compr;
|
bulwahn@33137
|
3208 |
val T = dest_predT compfuns (fastype_of t);
|
bulwahn@36021
|
3209 |
val t' =
|
bulwahn@36021
|
3210 |
if stats andalso compilation = New_Pos_Random_DSeq then
|
bulwahn@36021
|
3211 |
mk_map compfuns T (HOLogic.mk_prodT (HOLogic.termT, @{typ code_numeral}))
|
bulwahn@36021
|
3212 |
(absdummy (T, HOLogic.mk_prod (HOLogic.term_of_const T $ Bound 0,
|
bulwahn@36021
|
3213 |
@{term Code_Numeral.of_nat} $ (HOLogic.size_const T $ Bound 0)))) t
|
bulwahn@36021
|
3214 |
else
|
bulwahn@36021
|
3215 |
mk_map compfuns T HOLogic.termT (HOLogic.term_of_const T) t
|
bulwahn@36994
|
3216 |
val thy = ProofContext.theory_of ctxt
|
bulwahn@36021
|
3217 |
val (ts, statistics) =
|
bulwahn@34935
|
3218 |
case compilation of
|
bulwahn@35880
|
3219 |
(* Random =>
|
bulwahn@34935
|
3220 |
fst (Predicate.yieldn k
|
bulwahn@34935
|
3221 |
(Code_Eval.eval NONE ("Predicate_Compile_Core.random_eval_ref", random_eval_ref)
|
bulwahn@33137
|
3222 |
(fn proc => fn g => fn s => g s |>> Predicate.map proc) thy t' []
|
bulwahn@35880
|
3223 |
|> Random_Engine.run))*)
|
bulwahn@35880
|
3224 |
Pos_Random_DSeq =>
|
bulwahn@34935
|
3225 |
let
|
bulwahn@34935
|
3226 |
val [nrandom, size, depth] = arguments
|
bulwahn@34935
|
3227 |
in
|
bulwahn@36021
|
3228 |
rpair NONE (fst (DSequence.yieldn k
|
bulwahn@34935
|
3229 |
(Code_Eval.eval NONE ("Predicate_Compile_Core.random_dseq_eval_ref", random_dseq_eval_ref)
|
bulwahn@34935
|
3230 |
(fn proc => fn g => fn nrandom => fn size => fn s => g nrandom size s |>> DSequence.map proc)
|
bulwahn@34935
|
3231 |
thy t' [] nrandom size
|
bulwahn@34935
|
3232 |
|> Random_Engine.run)
|
bulwahn@36021
|
3233 |
depth true))
|
bulwahn@34935
|
3234 |
end
|
bulwahn@34935
|
3235 |
| DSeq =>
|
bulwahn@36021
|
3236 |
rpair NONE (fst (DSequence.yieldn k
|
bulwahn@34935
|
3237 |
(Code_Eval.eval NONE ("Predicate_Compile_Core.dseq_eval_ref", dseq_eval_ref)
|
bulwahn@36021
|
3238 |
DSequence.map thy t' []) (the_single arguments) true))
|
bulwahn@36014
|
3239 |
| New_Pos_Random_DSeq =>
|
bulwahn@36014
|
3240 |
let
|
bulwahn@36014
|
3241 |
val [nrandom, size, depth] = arguments
|
bulwahn@36014
|
3242 |
val seed = Random_Engine.next_seed ()
|
bulwahn@36014
|
3243 |
in
|
bulwahn@36021
|
3244 |
if stats then
|
bulwahn@36021
|
3245 |
apsnd (SOME o accumulate) (split_list
|
bulwahn@36021
|
3246 |
(fst (Lazy_Sequence.yieldn k
|
bulwahn@36021
|
3247 |
(Code_Eval.eval NONE
|
bulwahn@36021
|
3248 |
("Predicate_Compile_Core.new_random_dseq_stats_eval_ref", new_random_dseq_stats_eval_ref)
|
bulwahn@36021
|
3249 |
(fn proc => fn g => fn nrandom => fn size => fn s => fn depth => g nrandom size s depth
|
haftmann@36533
|
3250 |
|> Lazy_Sequence.mapa (apfst proc))
|
bulwahn@36021
|
3251 |
thy t' [] nrandom size seed depth))))
|
bulwahn@36021
|
3252 |
else rpair NONE
|
bulwahn@36021
|
3253 |
(fst (Lazy_Sequence.yieldn k
|
bulwahn@36021
|
3254 |
(Code_Eval.eval NONE
|
bulwahn@36021
|
3255 |
("Predicate_Compile_Core.new_random_dseq_eval_ref", new_random_dseq_eval_ref)
|
bulwahn@36021
|
3256 |
(fn proc => fn g => fn nrandom => fn size => fn s => fn depth => g nrandom size s depth
|
haftmann@36533
|
3257 |
|> Lazy_Sequence.mapa proc)
|
bulwahn@36021
|
3258 |
thy t' [] nrandom size seed depth)))
|
bulwahn@36014
|
3259 |
end
|
bulwahn@34935
|
3260 |
| _ =>
|
bulwahn@36021
|
3261 |
rpair NONE (fst (Predicate.yieldn k
|
bulwahn@34935
|
3262 |
(Code_Eval.eval NONE ("Predicate_Compile_Core.eval_ref", eval_ref)
|
bulwahn@36021
|
3263 |
Predicate.map thy t' [])))
|
bulwahn@36021
|
3264 |
in ((T, ts), statistics) end;
|
bulwahn@36021
|
3265 |
|
bulwahn@36021
|
3266 |
fun values ctxt param_user_modes ((raw_expected, stats), comp_options) k t_compr =
|
bulwahn@32667
|
3267 |
let
|
bulwahn@36994
|
3268 |
val ((T, ts), statistics) = eval ctxt stats param_user_modes comp_options k t_compr
|
bulwahn@34935
|
3269 |
val setT = HOLogic.mk_setT T
|
bulwahn@34935
|
3270 |
val elems = HOLogic.mk_set T ts
|
bulwahn@33476
|
3271 |
val cont = Free ("...", setT)
|
bulwahn@34935
|
3272 |
(* check expected values *)
|
bulwahn@34935
|
3273 |
val () =
|
bulwahn@34935
|
3274 |
case raw_expected of
|
bulwahn@34935
|
3275 |
NONE => ()
|
bulwahn@34935
|
3276 |
| SOME s =>
|
bulwahn@34935
|
3277 |
if eq_set (op =) (HOLogic.dest_set (Syntax.read_term ctxt s), ts) then ()
|
bulwahn@34935
|
3278 |
else
|
bulwahn@34935
|
3279 |
error ("expected and computed values do not match:\n" ^
|
bulwahn@34935
|
3280 |
"expected values: " ^ Syntax.string_of_term ctxt (Syntax.read_term ctxt s) ^ "\n" ^
|
bulwahn@34935
|
3281 |
"computed values: " ^ Syntax.string_of_term ctxt elems ^ "\n")
|
bulwahn@34935
|
3282 |
in
|
bulwahn@36021
|
3283 |
(if k = ~1 orelse length ts < k then elems
|
bulwahn@36021
|
3284 |
else Const (@{const_abbrev Set.union}, setT --> setT --> setT) $ elems $ cont, statistics)
|
bulwahn@32667
|
3285 |
end;
|
bulwahn@33623
|
3286 |
|
bulwahn@33479
|
3287 |
fun values_cmd print_modes param_user_modes options k raw_t state =
|
bulwahn@32667
|
3288 |
let
|
bulwahn@34935
|
3289 |
val ctxt = Toplevel.context_of state
|
bulwahn@34935
|
3290 |
val t = Syntax.read_term ctxt raw_t
|
bulwahn@36021
|
3291 |
val (t', stats) = values ctxt param_user_modes options k t
|
bulwahn@34935
|
3292 |
val ty' = Term.type_of t'
|
bulwahn@34935
|
3293 |
val ctxt' = Variable.auto_fixes t' ctxt
|
bulwahn@36021
|
3294 |
val pretty_stat =
|
bulwahn@36021
|
3295 |
case stats of
|
bulwahn@36021
|
3296 |
NONE => []
|
bulwahn@36021
|
3297 |
| SOME xs =>
|
bulwahn@36021
|
3298 |
let
|
bulwahn@36021
|
3299 |
val total = fold (curry (op +)) (map snd xs) 0
|
bulwahn@36021
|
3300 |
fun pretty_entry (s, n) =
|
bulwahn@36021
|
3301 |
[Pretty.str "size", Pretty.brk 1,
|
bulwahn@36021
|
3302 |
Pretty.str (string_of_int s), Pretty.str ":", Pretty.brk 1,
|
bulwahn@36021
|
3303 |
Pretty.str (string_of_int n), Pretty.fbrk]
|
bulwahn@36021
|
3304 |
in
|
bulwahn@36021
|
3305 |
[Pretty.fbrk, Pretty.str "Statistics:", Pretty.fbrk,
|
bulwahn@36021
|
3306 |
Pretty.str "total:", Pretty.brk 1, Pretty.str (string_of_int total), Pretty.fbrk]
|
bulwahn@36021
|
3307 |
@ maps pretty_entry xs
|
bulwahn@36021
|
3308 |
end
|
bulwahn@33478
|
3309 |
val p = PrintMode.with_modes print_modes (fn () =>
|
bulwahn@36021
|
3310 |
Pretty.block ([Pretty.quote (Syntax.pretty_term ctxt' t'), Pretty.fbrk,
|
bulwahn@36021
|
3311 |
Pretty.str "::", Pretty.brk 1, Pretty.quote (Syntax.pretty_typ ctxt' ty')]
|
bulwahn@36021
|
3312 |
@ pretty_stat)) ();
|
bulwahn@32667
|
3313 |
in Pretty.writeln p end;
|
bulwahn@32667
|
3314 |
|
bulwahn@32667
|
3315 |
end;
|