blanchet@54440
|
1 |
(* Title: HOL/BNF/Tools/bnf_fp_rec_sugar.ML
|
blanchet@54440
|
2 |
Author: Lorenz Panny, TU Muenchen
|
blanchet@54440
|
3 |
Copyright 2013
|
blanchet@54440
|
4 |
|
blanchet@54440
|
5 |
Recursor and corecursor sugar.
|
blanchet@54440
|
6 |
*)
|
blanchet@54440
|
7 |
|
blanchet@54440
|
8 |
signature BNF_FP_REC_SUGAR =
|
blanchet@54440
|
9 |
sig
|
traytel@55150
|
10 |
val add_primrec: (binding * typ option * mixfix) list ->
|
traytel@55150
|
11 |
(Attrib.binding * term) list -> local_theory -> (term list * thm list list) * local_theory
|
blanchet@54440
|
12 |
val add_primrec_cmd: (binding * string option * mixfix) list ->
|
traytel@55150
|
13 |
(Attrib.binding * string) list -> local_theory -> (term list * thm list list) * local_theory
|
traytel@55150
|
14 |
val add_primrec_global: (binding * typ option * mixfix) list ->
|
traytel@55150
|
15 |
(Attrib.binding * term) list -> theory -> (term list * thm list list) * theory
|
traytel@55150
|
16 |
val add_primrec_overloaded: (string * (string * typ) * bool) list ->
|
traytel@55150
|
17 |
(binding * typ option * mixfix) list ->
|
traytel@55150
|
18 |
(Attrib.binding * term) list -> theory -> (term list * thm list list) * theory
|
traytel@55150
|
19 |
val add_primrec_simple: ((binding * typ) * mixfix) list -> term list ->
|
traytel@55150
|
20 |
local_theory -> (string list * (term list * (int list list * thm list list))) * local_theory
|
blanchet@54890
|
21 |
val add_primcorecursive_cmd: bool ->
|
panny@54968
|
22 |
(binding * string option * mixfix) list * ((Attrib.binding * string) * string option) list ->
|
panny@54968
|
23 |
Proof.context -> Proof.state
|
panny@54959
|
24 |
val add_primcorec_cmd: bool ->
|
panny@54968
|
25 |
(binding * string option * mixfix) list * ((Attrib.binding * string) * string option) list ->
|
panny@54968
|
26 |
local_theory -> local_theory
|
blanchet@54440
|
27 |
end;
|
blanchet@54440
|
28 |
|
blanchet@54440
|
29 |
structure BNF_FP_Rec_Sugar : BNF_FP_REC_SUGAR =
|
blanchet@54440
|
30 |
struct
|
blanchet@54440
|
31 |
|
blanchet@54440
|
32 |
open BNF_Util
|
blanchet@54440
|
33 |
open BNF_FP_Util
|
blanchet@54440
|
34 |
open BNF_FP_Rec_Sugar_Util
|
blanchet@54440
|
35 |
open BNF_FP_Rec_Sugar_Tactics
|
blanchet@54440
|
36 |
|
panny@55517
|
37 |
val codeN = "code";
|
panny@55517
|
38 |
val ctrN = "ctr";
|
panny@55517
|
39 |
val discN = "disc";
|
panny@55517
|
40 |
val selN = "sel";
|
blanchet@54928
|
41 |
|
blanchet@55597
|
42 |
val nitpicksimp_attrs = @{attributes [nitpick_simp]};
|
blanchet@54931
|
43 |
val simp_attrs = @{attributes [simp]};
|
blanchet@55597
|
44 |
val code_nitpicksimp_attrs = Code.add_default_eqn_attrib :: nitpicksimp_attrs;
|
blanchet@55597
|
45 |
val code_nitpicksimp_simp_attrs = Code.add_default_eqn_attrib :: nitpicksimp_attrs @ simp_attrs;
|
blanchet@54931
|
46 |
|
blanchet@54440
|
47 |
exception Primrec_Error of string * term list;
|
blanchet@54440
|
48 |
|
blanchet@54440
|
49 |
fun primrec_error str = raise Primrec_Error (str, []);
|
blanchet@54440
|
50 |
fun primrec_error_eqn str eqn = raise Primrec_Error (str, [eqn]);
|
blanchet@54440
|
51 |
fun primrec_error_eqns str eqns = raise Primrec_Error (str, eqns);
|
blanchet@54440
|
52 |
|
panny@54495
|
53 |
fun finds eq = fold_map (fn x => List.partition (curry eq x) #>> pair x);
|
panny@54495
|
54 |
|
panny@54494
|
55 |
val free_name = try (fn Free (v, _) => v);
|
panny@54494
|
56 |
val const_name = try (fn Const (v, _) => v);
|
panny@54495
|
57 |
val undef_const = Const (@{const_name undefined}, dummyT);
|
panny@54494
|
58 |
|
panny@54495
|
59 |
fun permute_args n t = list_comb (t, map Bound (0 :: (n downto 1)))
|
panny@54857
|
60 |
|> fold (K (Term.abs (Name.uu, dummyT))) (0 upto n);
|
panny@54538
|
61 |
val abs_tuple = HOLogic.tupled_lambda o HOLogic.mk_tuple;
|
panny@54791
|
62 |
fun drop_All t = subst_bounds (strip_qnt_vars @{const_name all} t |> map Free |> rev,
|
panny@54791
|
63 |
strip_qnt_body @{const_name all} t)
|
panny@54857
|
64 |
fun abstract vs =
|
panny@54857
|
65 |
let fun a n (t $ u) = a n t $ a n u
|
panny@54857
|
66 |
| a n (Abs (v, T, b)) = Abs (v, T, a (n + 1) b)
|
panny@54857
|
67 |
| a n t = let val idx = find_index (equal t) vs in
|
panny@54857
|
68 |
if idx < 0 then t else Bound (n + idx) end
|
panny@54857
|
69 |
in a 0 end;
|
panny@54872
|
70 |
fun mk_prod1 Ts (t, u) = HOLogic.pair_const (fastype_of1 (Ts, t)) (fastype_of1 (Ts, u)) $ t $ u;
|
panny@54872
|
71 |
fun mk_tuple1 Ts = the_default HOLogic.unit o try (foldr1 (mk_prod1 Ts));
|
blanchet@54440
|
72 |
|
blanchet@54931
|
73 |
fun get_indices fixes t = map (fst #>> Binding.name_of #> Free) fixes
|
blanchet@54931
|
74 |
|> map_index (fn (i, v) => if exists_subterm (equal v) t then SOME i else NONE)
|
blanchet@54931
|
75 |
|> map_filter I;
|
blanchet@54440
|
76 |
|
blanchet@54447
|
77 |
|
blanchet@54447
|
78 |
(* Primrec *)
|
blanchet@54447
|
79 |
|
blanchet@54440
|
80 |
type eqn_data = {
|
blanchet@54440
|
81 |
fun_name: string,
|
blanchet@54440
|
82 |
rec_type: typ,
|
blanchet@54440
|
83 |
ctr: term,
|
blanchet@54440
|
84 |
ctr_args: term list,
|
blanchet@54440
|
85 |
left_args: term list,
|
blanchet@54440
|
86 |
right_args: term list,
|
blanchet@54440
|
87 |
res_type: typ,
|
blanchet@54440
|
88 |
rhs_term: term,
|
blanchet@54440
|
89 |
user_eqn: term
|
blanchet@54440
|
90 |
};
|
blanchet@54440
|
91 |
|
blanchet@54440
|
92 |
fun dissect_eqn lthy fun_names eqn' =
|
blanchet@54440
|
93 |
let
|
panny@54791
|
94 |
val eqn = drop_All eqn' |> HOLogic.dest_Trueprop
|
panny@54791
|
95 |
handle TERM _ =>
|
panny@54791
|
96 |
primrec_error_eqn "malformed function equation (expected \"lhs = rhs\")" eqn';
|
blanchet@54440
|
97 |
val (lhs, rhs) = HOLogic.dest_eq eqn
|
blanchet@54440
|
98 |
handle TERM _ =>
|
blanchet@54440
|
99 |
primrec_error_eqn "malformed function equation (expected \"lhs = rhs\")" eqn';
|
blanchet@54440
|
100 |
val (fun_name, args) = strip_comb lhs
|
blanchet@54440
|
101 |
|>> (fn x => if is_Free x then fst (dest_Free x)
|
blanchet@54440
|
102 |
else primrec_error_eqn "malformed function equation (does not start with free)" eqn);
|
blanchet@54440
|
103 |
val (left_args, rest) = take_prefix is_Free args;
|
blanchet@54440
|
104 |
val (nonfrees, right_args) = take_suffix is_Free rest;
|
blanchet@54967
|
105 |
val num_nonfrees = length nonfrees;
|
blanchet@54967
|
106 |
val _ = num_nonfrees = 1 orelse if num_nonfrees = 0 then
|
blanchet@54440
|
107 |
primrec_error_eqn "constructor pattern missing in left-hand side" eqn else
|
blanchet@54440
|
108 |
primrec_error_eqn "more than one non-variable argument in left-hand side" eqn;
|
blanchet@54440
|
109 |
val _ = member (op =) fun_names fun_name orelse
|
blanchet@54440
|
110 |
primrec_error_eqn "malformed function equation (does not start with function name)" eqn
|
blanchet@54440
|
111 |
|
blanchet@54440
|
112 |
val (ctr, ctr_args) = strip_comb (the_single nonfrees);
|
blanchet@54440
|
113 |
val _ = try (num_binder_types o fastype_of) ctr = SOME (length ctr_args) orelse
|
blanchet@54440
|
114 |
primrec_error_eqn "partially applied constructor in pattern" eqn;
|
blanchet@54440
|
115 |
val _ = let val d = duplicates (op =) (left_args @ ctr_args @ right_args) in null d orelse
|
blanchet@54440
|
116 |
primrec_error_eqn ("duplicate variable \"" ^ Syntax.string_of_term lthy (hd d) ^
|
blanchet@54440
|
117 |
"\" in left-hand side") eqn end;
|
blanchet@54440
|
118 |
val _ = forall is_Free ctr_args orelse
|
blanchet@54440
|
119 |
primrec_error_eqn "non-primitive pattern in left-hand side" eqn;
|
blanchet@54440
|
120 |
val _ =
|
blanchet@54440
|
121 |
let val b = fold_aterms (fn x as Free (v, _) =>
|
blanchet@54440
|
122 |
if (not (member (op =) (left_args @ ctr_args @ right_args) x) andalso
|
blanchet@54440
|
123 |
not (member (op =) fun_names v) andalso
|
blanchet@54440
|
124 |
not (Variable.is_fixed lthy v)) then cons x else I | _ => I) rhs []
|
blanchet@54440
|
125 |
in
|
blanchet@54440
|
126 |
null b orelse
|
blanchet@54440
|
127 |
primrec_error_eqn ("extra variable(s) in right-hand side: " ^
|
blanchet@54440
|
128 |
commas (map (Syntax.string_of_term lthy) b)) eqn
|
blanchet@54440
|
129 |
end;
|
blanchet@54440
|
130 |
in
|
blanchet@54440
|
131 |
{fun_name = fun_name,
|
blanchet@54440
|
132 |
rec_type = body_type (type_of ctr),
|
blanchet@54440
|
133 |
ctr = ctr,
|
blanchet@54440
|
134 |
ctr_args = ctr_args,
|
blanchet@54440
|
135 |
left_args = left_args,
|
blanchet@54440
|
136 |
right_args = right_args,
|
blanchet@54440
|
137 |
res_type = map fastype_of (left_args @ right_args) ---> fastype_of rhs,
|
blanchet@54440
|
138 |
rhs_term = rhs,
|
blanchet@54440
|
139 |
user_eqn = eqn'}
|
blanchet@54440
|
140 |
end;
|
blanchet@54440
|
141 |
|
panny@54538
|
142 |
fun rewrite_map_arg get_ctr_pos rec_type res_type =
|
blanchet@54440
|
143 |
let
|
blanchet@54440
|
144 |
val pT = HOLogic.mk_prodT (rec_type, res_type);
|
blanchet@54440
|
145 |
|
panny@54494
|
146 |
val maybe_suc = Option.map (fn x => x + 1);
|
panny@54494
|
147 |
fun subst d (t as Bound d') = t |> d = SOME d' ? curry (op $) (fst_const pT)
|
panny@54494
|
148 |
| subst d (Abs (v, T, b)) = Abs (v, if d = SOME ~1 then pT else T, subst (maybe_suc d) b)
|
panny@54494
|
149 |
| subst d t =
|
panny@54495
|
150 |
let
|
panny@54495
|
151 |
val (u, vs) = strip_comb t;
|
panny@54538
|
152 |
val ctr_pos = try (get_ctr_pos o the) (free_name u) |> the_default ~1;
|
panny@54495
|
153 |
in
|
panny@54538
|
154 |
if ctr_pos >= 0 then
|
panny@54494
|
155 |
if d = SOME ~1 andalso length vs = ctr_pos then
|
panny@54494
|
156 |
list_comb (permute_args ctr_pos (snd_const pT), vs)
|
panny@54494
|
157 |
else if length vs > ctr_pos andalso is_some d
|
panny@54494
|
158 |
andalso d = try (fn Bound n => n) (nth vs ctr_pos) then
|
panny@54494
|
159 |
list_comb (snd_const pT $ nth vs ctr_pos, map (subst d) (nth_drop ctr_pos vs))
|
blanchet@54440
|
160 |
else
|
panny@54494
|
161 |
primrec_error_eqn ("recursive call not directly applied to constructor argument") t
|
panny@54494
|
162 |
else if d = SOME ~1 andalso const_name u = SOME @{const_name comp} then
|
panny@54494
|
163 |
list_comb (map_types (K dummyT) u, map2 subst [NONE, d] vs)
|
blanchet@54440
|
164 |
else
|
panny@54494
|
165 |
list_comb (u, map (subst (d |> d = SOME ~1 ? K NONE)) vs)
|
blanchet@54440
|
166 |
end
|
blanchet@54440
|
167 |
in
|
panny@54494
|
168 |
subst (SOME ~1)
|
blanchet@54440
|
169 |
end;
|
blanchet@54440
|
170 |
|
blanchet@55554
|
171 |
fun subst_rec_calls lthy get_ctr_pos has_call ctr_args mutual_calls nested_calls t =
|
blanchet@54440
|
172 |
let
|
panny@54487
|
173 |
fun subst bound_Ts (Abs (v, T, b)) = Abs (v, T, subst (T :: bound_Ts) b)
|
panny@54495
|
174 |
| subst bound_Ts (t as g' $ y) =
|
blanchet@55611
|
175 |
let val y_head = head_of y in
|
blanchet@55611
|
176 |
if not (member (op =) ctr_args y_head) then
|
blanchet@55611
|
177 |
pairself (subst bound_Ts) (g', y) |> op $
|
blanchet@55611
|
178 |
else
|
blanchet@55611
|
179 |
let
|
blanchet@55611
|
180 |
val maybe_mutual_y' = AList.lookup (op =) mutual_calls y;
|
blanchet@55611
|
181 |
val maybe_nested_y_head' = AList.lookup (op =) nested_calls y_head;
|
blanchet@55611
|
182 |
val (g, g_args) = strip_comb g';
|
blanchet@55611
|
183 |
val ctr_pos = try (get_ctr_pos o the) (free_name g) |> the_default ~1;
|
blanchet@55611
|
184 |
val _ = ctr_pos < 0 orelse length g_args >= ctr_pos orelse
|
blanchet@55611
|
185 |
primrec_error_eqn "too few arguments in recursive call" t;
|
blanchet@55611
|
186 |
in
|
blanchet@55615
|
187 |
if is_some maybe_nested_y_head' then
|
blanchet@55611
|
188 |
(if has_call g' then t else y)
|
blanchet@55611
|
189 |
|> massage_nested_rec_call lthy has_call
|
blanchet@55611
|
190 |
(rewrite_map_arg get_ctr_pos) bound_Ts y_head (the maybe_nested_y_head')
|
blanchet@55611
|
191 |
|> (if has_call g' then I else curry (op $) g')
|
blanchet@55615
|
192 |
else if ctr_pos >= 0 then
|
blanchet@55615
|
193 |
(case maybe_mutual_y' of
|
blanchet@55615
|
194 |
NONE => t
|
blanchet@55615
|
195 |
| SOME y' => list_comb (y', g_args))
|
blanchet@55611
|
196 |
else
|
blanchet@55611
|
197 |
t
|
blanchet@55611
|
198 |
end
|
blanchet@55611
|
199 |
end
|
panny@54487
|
200 |
| subst _ t = t
|
panny@54487
|
201 |
in
|
panny@54487
|
202 |
subst [] t
|
panny@54495
|
203 |
|> tap (fn u => has_call u andalso (* FIXME detect this case earlier *)
|
panny@54495
|
204 |
primrec_error_eqn "recursive call not directly applied to constructor argument" t)
|
panny@54487
|
205 |
end;
|
blanchet@54440
|
206 |
|
blanchet@55140
|
207 |
fun build_rec_arg lthy (funs_data : eqn_data list list) has_call (ctr_spec : rec_ctr_spec)
|
blanchet@55140
|
208 |
(maybe_eqn_data : eqn_data option) =
|
panny@54495
|
209 |
if is_none maybe_eqn_data then undef_const else
|
blanchet@54440
|
210 |
let
|
blanchet@54440
|
211 |
val eqn_data = the maybe_eqn_data;
|
blanchet@54440
|
212 |
val t = #rhs_term eqn_data;
|
blanchet@54440
|
213 |
val ctr_args = #ctr_args eqn_data;
|
blanchet@54440
|
214 |
|
blanchet@54440
|
215 |
val calls = #calls ctr_spec;
|
blanchet@55554
|
216 |
val n_args = fold (curry (op +) o (fn Mutual_Rec _ => 2 | _ => 1)) calls 0;
|
blanchet@54440
|
217 |
|
blanchet@54440
|
218 |
val no_calls' = tag_list 0 calls
|
blanchet@55554
|
219 |
|> map_filter (try (apsnd (fn No_Rec n => n | Mutual_Rec (n, _) => n)));
|
blanchet@55554
|
220 |
val mutual_calls' = tag_list 0 calls
|
blanchet@55554
|
221 |
|> map_filter (try (apsnd (fn Mutual_Rec (_, n) => n)));
|
blanchet@55554
|
222 |
val nested_calls' = tag_list 0 calls
|
blanchet@55554
|
223 |
|> map_filter (try (apsnd (fn Nested_Rec n => n)));
|
blanchet@54440
|
224 |
|
blanchet@55554
|
225 |
fun make_mutual_type _ = dummyT; (* FIXME? *)
|
blanchet@54440
|
226 |
|
blanchet@54440
|
227 |
val rec_res_type_list = map (fn (x :: _) => (#rec_type x, #res_type x)) funs_data;
|
blanchet@54440
|
228 |
|
blanchet@55554
|
229 |
fun make_nested_type (Type (Tname, Ts)) = Type (Tname, Ts |> map (fn T =>
|
blanchet@54440
|
230 |
let val maybe_res_type = AList.lookup (op =) rec_res_type_list T in
|
blanchet@54440
|
231 |
if is_some maybe_res_type
|
blanchet@54440
|
232 |
then HOLogic.mk_prodT (T, the maybe_res_type)
|
blanchet@55554
|
233 |
else make_nested_type T end))
|
blanchet@55554
|
234 |
| make_nested_type T = T;
|
blanchet@54440
|
235 |
|
blanchet@54440
|
236 |
val args = replicate n_args ("", dummyT)
|
blanchet@54440
|
237 |
|> Term.rename_wrt_term t
|
blanchet@54440
|
238 |
|> map Free
|
blanchet@54440
|
239 |
|> fold (fn (ctr_arg_idx, arg_idx) =>
|
blanchet@54440
|
240 |
nth_map arg_idx (K (nth ctr_args ctr_arg_idx)))
|
blanchet@54440
|
241 |
no_calls'
|
blanchet@54440
|
242 |
|> fold (fn (ctr_arg_idx, arg_idx) =>
|
blanchet@55554
|
243 |
nth_map arg_idx (K (nth ctr_args ctr_arg_idx |> map_types make_mutual_type)))
|
blanchet@55554
|
244 |
mutual_calls'
|
blanchet@54440
|
245 |
|> fold (fn (ctr_arg_idx, arg_idx) =>
|
blanchet@55554
|
246 |
nth_map arg_idx (K (nth ctr_args ctr_arg_idx |> map_types make_nested_type)))
|
blanchet@55554
|
247 |
nested_calls';
|
blanchet@54440
|
248 |
|
panny@54538
|
249 |
val fun_name_ctr_pos_list =
|
panny@54538
|
250 |
map (fn (x :: _) => (#fun_name x, length (#left_args x))) funs_data;
|
panny@54538
|
251 |
val get_ctr_pos = try (the o AList.lookup (op =) fun_name_ctr_pos_list) #> the_default ~1;
|
blanchet@55554
|
252 |
val mutual_calls = map (apfst (nth ctr_args) o apsnd (nth args)) mutual_calls';
|
blanchet@55554
|
253 |
val nested_calls = map (apfst (nth ctr_args) o apsnd (nth args)) nested_calls';
|
blanchet@54440
|
254 |
|
panny@54538
|
255 |
val abstractions = args @ #left_args eqn_data @ #right_args eqn_data;
|
blanchet@54440
|
256 |
in
|
panny@54487
|
257 |
t
|
blanchet@55554
|
258 |
|> subst_rec_calls lthy get_ctr_pos has_call ctr_args mutual_calls nested_calls
|
panny@54538
|
259 |
|> fold_rev lambda abstractions
|
panny@54487
|
260 |
end;
|
blanchet@54440
|
261 |
|
blanchet@55140
|
262 |
fun build_defs lthy bs mxs (funs_data : eqn_data list list) (rec_specs : rec_spec list) has_call =
|
blanchet@54440
|
263 |
let
|
blanchet@54440
|
264 |
val n_funs = length funs_data;
|
blanchet@54440
|
265 |
|
blanchet@54440
|
266 |
val ctr_spec_eqn_data_list' =
|
blanchet@54440
|
267 |
(take n_funs rec_specs |> map #ctr_specs) ~~ funs_data
|
blanchet@54440
|
268 |
|> maps (uncurry (finds (fn (x, y) => #ctr x = #ctr y))
|
blanchet@54440
|
269 |
##> (fn x => null x orelse
|
blanchet@54440
|
270 |
primrec_error_eqns "excess equations in definition" (map #rhs_term x)) #> fst);
|
blanchet@54440
|
271 |
val _ = ctr_spec_eqn_data_list' |> map (fn (_, x) => length x <= 1 orelse
|
blanchet@54440
|
272 |
primrec_error_eqns ("multiple equations for constructor") (map #user_eqn x));
|
blanchet@54440
|
273 |
|
blanchet@54440
|
274 |
val ctr_spec_eqn_data_list =
|
blanchet@54440
|
275 |
ctr_spec_eqn_data_list' @ (drop n_funs rec_specs |> maps #ctr_specs |> map (rpair []));
|
blanchet@54440
|
276 |
|
blanchet@54440
|
277 |
val recs = take n_funs rec_specs |> map #recx;
|
blanchet@54440
|
278 |
val rec_args = ctr_spec_eqn_data_list
|
blanchet@54440
|
279 |
|> sort ((op <) o pairself (#offset o fst) |> make_ord)
|
panny@54495
|
280 |
|> map (uncurry (build_rec_arg lthy funs_data has_call) o apsnd (try the_single));
|
blanchet@54440
|
281 |
val ctr_poss = map (fn x =>
|
blanchet@54440
|
282 |
if length (distinct ((op =) o pairself (length o #left_args)) x) <> 1 then
|
blanchet@54440
|
283 |
primrec_error ("inconstant constructor pattern position for function " ^
|
blanchet@54440
|
284 |
quote (#fun_name (hd x)))
|
blanchet@54440
|
285 |
else
|
blanchet@54440
|
286 |
hd x |> #left_args |> length) funs_data;
|
blanchet@54440
|
287 |
in
|
blanchet@54440
|
288 |
(recs, ctr_poss)
|
blanchet@54440
|
289 |
|-> map2 (fn recx => fn ctr_pos => list_comb (recx, rec_args) |> permute_args ctr_pos)
|
blanchet@54440
|
290 |
|> Syntax.check_terms lthy
|
blanchet@55607
|
291 |
|> map3 (fn b => fn mx => fn t => ((b, mx), ((Binding.conceal (Thm.def_binding b), []), t)))
|
blanchet@55607
|
292 |
bs mxs
|
blanchet@54440
|
293 |
end;
|
blanchet@54440
|
294 |
|
blanchet@55138
|
295 |
fun find_rec_calls has_call (eqn_data : eqn_data) =
|
blanchet@54440
|
296 |
let
|
blanchet@54440
|
297 |
fun find (Abs (_, _, b)) ctr_arg = find b ctr_arg
|
blanchet@54440
|
298 |
| find (t as _ $ _) ctr_arg =
|
blanchet@54440
|
299 |
let
|
blanchet@54440
|
300 |
val (f', args') = strip_comb t;
|
blanchet@54440
|
301 |
val n = find_index (equal ctr_arg) args';
|
blanchet@54440
|
302 |
in
|
blanchet@54440
|
303 |
if n < 0 then
|
blanchet@54440
|
304 |
find f' ctr_arg @ maps (fn x => find x ctr_arg) args'
|
blanchet@54440
|
305 |
else
|
blanchet@54440
|
306 |
let val (f, args) = chop n args' |>> curry list_comb f' in
|
panny@54495
|
307 |
if has_call f then
|
blanchet@54440
|
308 |
f :: maps (fn x => find x ctr_arg) args
|
blanchet@54440
|
309 |
else
|
blanchet@54440
|
310 |
find f ctr_arg @ maps (fn x => find x ctr_arg) args
|
blanchet@54440
|
311 |
end
|
blanchet@54440
|
312 |
end
|
blanchet@54440
|
313 |
| find _ _ = [];
|
blanchet@54440
|
314 |
in
|
blanchet@54440
|
315 |
map (find (#rhs_term eqn_data)) (#ctr_args eqn_data)
|
blanchet@54440
|
316 |
|> (fn [] => NONE | callss => SOME (#ctr eqn_data, callss))
|
blanchet@54440
|
317 |
end;
|
blanchet@54440
|
318 |
|
traytel@55150
|
319 |
fun prepare_primrec fixes specs lthy =
|
blanchet@54440
|
320 |
let
|
traytel@54489
|
321 |
val (bs, mxs) = map_split (apfst fst) fixes;
|
blanchet@54440
|
322 |
val fun_names = map Binding.name_of bs;
|
traytel@55150
|
323 |
val eqns_data = map (dissect_eqn lthy fun_names) specs;
|
blanchet@54440
|
324 |
val funs_data = eqns_data
|
blanchet@54440
|
325 |
|> partition_eq ((op =) o pairself #fun_name)
|
blanchet@54440
|
326 |
|> finds (fn (x, y) => x = #fun_name (hd y)) fun_names |> fst
|
blanchet@54440
|
327 |
|> map (fn (x, y) => the_single y handle List.Empty =>
|
blanchet@54440
|
328 |
primrec_error ("missing equations for function " ^ quote x));
|
blanchet@54440
|
329 |
|
panny@54495
|
330 |
val has_call = exists_subterm (map (fst #>> Binding.name_of #> Free) fixes |> member (op =));
|
blanchet@54440
|
331 |
val arg_Ts = map (#rec_type o hd) funs_data;
|
blanchet@54440
|
332 |
val res_Ts = map (#res_type o hd) funs_data;
|
blanchet@54440
|
333 |
val callssss = funs_data
|
blanchet@54440
|
334 |
|> map (partition_eq ((op =) o pairself #ctr))
|
panny@54495
|
335 |
|> map (maps (map_filter (find_rec_calls has_call)));
|
blanchet@54440
|
336 |
|
blanchet@54967
|
337 |
val ((n2m, rec_specs, _, induct_thm, induct_thms), lthy') =
|
blanchet@54931
|
338 |
rec_specs_of bs arg_Ts res_Ts (get_indices fixes) callssss lthy;
|
blanchet@54440
|
339 |
|
blanchet@54440
|
340 |
val actual_nn = length funs_data;
|
blanchet@54440
|
341 |
|
blanchet@54440
|
342 |
val _ = let val ctrs = (maps (map #ctr o #ctr_specs) rec_specs) in
|
blanchet@54440
|
343 |
map (fn {ctr, user_eqn, ...} => member (op =) ctrs ctr orelse
|
blanchet@54440
|
344 |
primrec_error_eqn ("argument " ^ quote (Syntax.string_of_term lthy' ctr) ^
|
blanchet@54440
|
345 |
" is not a constructor in left-hand side") user_eqn) eqns_data end;
|
blanchet@54440
|
346 |
|
panny@54495
|
347 |
val defs = build_defs lthy' bs mxs funs_data rec_specs has_call;
|
blanchet@54440
|
348 |
|
traytel@55150
|
349 |
fun prove lthy def_thms' ({ctr_specs, nested_map_idents, nested_map_comps, ...} : rec_spec)
|
traytel@55150
|
350 |
(fun_data : eqn_data list) =
|
blanchet@54440
|
351 |
let
|
blanchet@54440
|
352 |
val def_thms = map (snd o snd) def_thms';
|
traytel@55150
|
353 |
val simp_thmss = finds (fn (x, y) => #ctr x = #ctr y) fun_data ctr_specs
|
blanchet@54440
|
354 |
|> fst
|
blanchet@54440
|
355 |
|> map_filter (try (fn (x, [y]) =>
|
blanchet@54440
|
356 |
(#user_eqn x, length (#left_args x) + length (#right_args x), #rec_thm y)))
|
blanchet@54440
|
357 |
|> map (fn (user_eqn, num_extra_args, rec_thm) =>
|
blanchet@54466
|
358 |
mk_primrec_tac lthy num_extra_args nested_map_idents nested_map_comps def_thms rec_thm
|
traytel@55150
|
359 |
|> K |> Goal.prove lthy [] [] user_eqn);
|
traytel@55150
|
360 |
val poss = find_indices (fn (x, y) => #ctr x = #ctr y) fun_data eqns_data;
|
traytel@55150
|
361 |
in
|
traytel@55150
|
362 |
(poss, simp_thmss)
|
traytel@55150
|
363 |
end;
|
blanchet@54440
|
364 |
|
traytel@55150
|
365 |
val notes =
|
traytel@55150
|
366 |
(if n2m then map2 (fn name => fn thm =>
|
traytel@55150
|
367 |
(name, inductN, [thm], [])) fun_names (take actual_nn induct_thms) else [])
|
traytel@55150
|
368 |
|> map (fn (prefix, thmN, thms, attrs) =>
|
traytel@55150
|
369 |
((Binding.qualify true prefix (Binding.name thmN), attrs), [(thms, [])]));
|
blanchet@54440
|
370 |
|
blanchet@54440
|
371 |
val common_name = mk_common_name fun_names;
|
blanchet@54440
|
372 |
|
blanchet@54440
|
373 |
val common_notes =
|
traytel@55150
|
374 |
(if n2m then [(inductN, [induct_thm], [])] else [])
|
blanchet@54440
|
375 |
|> map (fn (thmN, thms, attrs) =>
|
blanchet@54440
|
376 |
((Binding.qualify true common_name (Binding.name thmN), attrs), [(thms, [])]));
|
blanchet@54440
|
377 |
in
|
traytel@55150
|
378 |
(((fun_names, defs),
|
traytel@55150
|
379 |
fn lthy => fn defs =>
|
traytel@55150
|
380 |
split_list (map2 (prove lthy defs) (take actual_nn rec_specs) funs_data)),
|
traytel@55150
|
381 |
lthy' |> Local_Theory.notes (notes @ common_notes) |> snd)
|
blanchet@54440
|
382 |
end;
|
blanchet@54440
|
383 |
|
traytel@55150
|
384 |
(* primrec definition *)
|
traytel@55150
|
385 |
|
traytel@55150
|
386 |
fun add_primrec_simple fixes ts lthy =
|
blanchet@54440
|
387 |
let
|
traytel@55150
|
388 |
val (((names, defs), prove), lthy) = prepare_primrec fixes ts lthy
|
traytel@55150
|
389 |
handle ERROR str => primrec_error str;
|
blanchet@54440
|
390 |
in
|
traytel@55150
|
391 |
lthy
|
traytel@55150
|
392 |
|> fold_map Local_Theory.define defs
|
traytel@55150
|
393 |
|-> (fn defs => `(fn lthy => (names, (map fst defs, prove lthy defs))))
|
blanchet@54440
|
394 |
end
|
blanchet@54440
|
395 |
handle Primrec_Error (str, eqns) =>
|
blanchet@54440
|
396 |
if null eqns
|
blanchet@54440
|
397 |
then error ("primrec_new error:\n " ^ str)
|
blanchet@54440
|
398 |
else error ("primrec_new error:\n " ^ str ^ "\nin\n " ^
|
panny@54959
|
399 |
space_implode "\n " (map (quote o Syntax.string_of_term lthy) eqns));
|
blanchet@54440
|
400 |
|
traytel@55150
|
401 |
local
|
traytel@55150
|
402 |
|
traytel@55165
|
403 |
fun gen_primrec prep_spec (raw_fixes : (binding * 'a option * mixfix) list) raw_spec lthy =
|
traytel@55150
|
404 |
let
|
traytel@55150
|
405 |
val d = duplicates (op =) (map (Binding.name_of o #1) raw_fixes)
|
traytel@55150
|
406 |
val _ = null d orelse primrec_error ("duplicate function name(s): " ^ commas d);
|
traytel@55150
|
407 |
|
traytel@55150
|
408 |
val (fixes, specs) = fst (prep_spec raw_fixes raw_spec lthy);
|
traytel@55150
|
409 |
|
traytel@55150
|
410 |
val mk_notes =
|
traytel@55150
|
411 |
flat ooo map3 (fn poss => fn prefix => fn thms =>
|
traytel@55150
|
412 |
let
|
traytel@55150
|
413 |
val (bs, attrss) = map_split (fst o nth specs) poss;
|
traytel@55150
|
414 |
val notes =
|
traytel@55150
|
415 |
map3 (fn b => fn attrs => fn thm =>
|
blanchet@55597
|
416 |
((Binding.qualify false prefix b, code_nitpicksimp_simp_attrs @ attrs), [([thm], [])]))
|
traytel@55150
|
417 |
bs attrss thms;
|
traytel@55150
|
418 |
in
|
traytel@55150
|
419 |
((Binding.qualify true prefix (Binding.name simpsN), []), [(thms, [])]) :: notes
|
traytel@55150
|
420 |
end);
|
traytel@55150
|
421 |
in
|
traytel@55150
|
422 |
lthy
|
traytel@55150
|
423 |
|> add_primrec_simple fixes (map snd specs)
|
traytel@55150
|
424 |
|-> (fn (names, (ts, (posss, simpss))) =>
|
traytel@55150
|
425 |
Spec_Rules.add Spec_Rules.Equational (ts, flat simpss)
|
traytel@55150
|
426 |
#> Local_Theory.notes (mk_notes posss names simpss)
|
traytel@55150
|
427 |
#>> pair ts o map snd)
|
traytel@55150
|
428 |
end;
|
traytel@55150
|
429 |
|
traytel@55150
|
430 |
in
|
traytel@55150
|
431 |
|
traytel@55150
|
432 |
val add_primrec = gen_primrec Specification.check_spec;
|
traytel@55150
|
433 |
val add_primrec_cmd = gen_primrec Specification.read_spec;
|
traytel@55150
|
434 |
|
traytel@55150
|
435 |
end;
|
traytel@55150
|
436 |
|
traytel@55150
|
437 |
fun add_primrec_global fixes specs thy =
|
traytel@55150
|
438 |
let
|
traytel@55150
|
439 |
val lthy = Named_Target.theory_init thy;
|
traytel@55150
|
440 |
val ((ts, simps), lthy') = add_primrec fixes specs lthy;
|
traytel@55150
|
441 |
val simps' = burrow (Proof_Context.export lthy' lthy) simps;
|
traytel@55150
|
442 |
in ((ts, simps'), Local_Theory.exit_global lthy') end;
|
traytel@55150
|
443 |
|
traytel@55150
|
444 |
fun add_primrec_overloaded ops fixes specs thy =
|
traytel@55150
|
445 |
let
|
traytel@55150
|
446 |
val lthy = Overloading.overloading ops thy;
|
traytel@55150
|
447 |
val ((ts, simps), lthy') = add_primrec fixes specs lthy;
|
traytel@55150
|
448 |
val simps' = burrow (Proof_Context.export lthy' lthy) simps;
|
traytel@55150
|
449 |
in ((ts, simps'), Local_Theory.exit_global lthy') end;
|
traytel@55150
|
450 |
|
blanchet@54440
|
451 |
|
blanchet@54440
|
452 |
|
blanchet@54447
|
453 |
(* Primcorec *)
|
blanchet@54440
|
454 |
|
blanchet@55605
|
455 |
type coeqn_data_disc = {
|
blanchet@54440
|
456 |
fun_name: string,
|
panny@54857
|
457 |
fun_T: typ,
|
panny@54538
|
458 |
fun_args: term list,
|
panny@54857
|
459 |
ctr: term,
|
panny@54478
|
460 |
ctr_no: int, (*###*)
|
panny@54857
|
461 |
disc: term,
|
panny@54791
|
462 |
prems: term list,
|
panny@54959
|
463 |
auto_gen: bool,
|
panny@55549
|
464 |
maybe_ctr_rhs: term option,
|
panny@55549
|
465 |
maybe_code_rhs: term option,
|
blanchet@54440
|
466 |
user_eqn: term
|
blanchet@54440
|
467 |
};
|
blanchet@55138
|
468 |
|
blanchet@55605
|
469 |
type coeqn_data_sel = {
|
blanchet@54440
|
470 |
fun_name: string,
|
panny@54857
|
471 |
fun_T: typ,
|
panny@54538
|
472 |
fun_args: term list,
|
panny@54478
|
473 |
ctr: term,
|
panny@54478
|
474 |
sel: term,
|
blanchet@54440
|
475 |
rhs_term: term,
|
blanchet@54440
|
476 |
user_eqn: term
|
blanchet@54440
|
477 |
};
|
blanchet@55138
|
478 |
|
blanchet@55605
|
479 |
datatype coeqn_data =
|
blanchet@55605
|
480 |
Disc of coeqn_data_disc |
|
blanchet@55605
|
481 |
Sel of coeqn_data_sel;
|
blanchet@54440
|
482 |
|
panny@55612
|
483 |
fun dissect_coeqn_disc seq fun_names (basic_ctr_specss : basic_corec_ctr_spec list list)
|
panny@55612
|
484 |
maybe_ctr_rhs maybe_code_rhs prems' concl matchedsss =
|
blanchet@54440
|
485 |
let
|
blanchet@54440
|
486 |
fun find_subterm p = let (* FIXME \<exists>? *)
|
panny@54538
|
487 |
fun f (t as u $ v) = if p t then SOME t else merge_options (f u, f v)
|
blanchet@54440
|
488 |
| f t = if p t then SOME t else NONE
|
blanchet@54440
|
489 |
in f end;
|
blanchet@54440
|
490 |
|
panny@54791
|
491 |
val applied_fun = concl
|
panny@54791
|
492 |
|> find_subterm (member ((op =) o apsnd SOME) fun_names o try (fst o dest_Free o head_of))
|
panny@54791
|
493 |
|> the
|
panny@54791
|
494 |
handle Option.Option => primrec_error_eqn "malformed discriminator equation" concl;
|
panny@54857
|
495 |
val ((fun_name, fun_T), fun_args) = strip_comb applied_fun |>> dest_Free;
|
panny@55612
|
496 |
val basic_ctr_specs = the (AList.lookup (op =) (fun_names ~~ basic_ctr_specss) fun_name);
|
blanchet@54440
|
497 |
|
panny@55612
|
498 |
val discs = map #disc basic_ctr_specs;
|
panny@55612
|
499 |
val ctrs = map #ctr basic_ctr_specs;
|
panny@54791
|
500 |
val not_disc = head_of concl = @{term Not};
|
panny@54538
|
501 |
val _ = not_disc andalso length ctrs <> 2 andalso
|
panny@54791
|
502 |
primrec_error_eqn "\<not>ed discriminator for a type with \<noteq> 2 constructors" concl;
|
panny@55612
|
503 |
val disc' = find_subterm (member (op =) discs o head_of) concl;
|
panny@54791
|
504 |
val eq_ctr0 = concl |> perhaps (try (HOLogic.dest_not)) |> try (HOLogic.dest_eq #> snd)
|
blanchet@54440
|
505 |
|> (fn SOME t => let val n = find_index (equal t) ctrs in
|
blanchet@54440
|
506 |
if n >= 0 then SOME n else NONE end | _ => NONE);
|
panny@55612
|
507 |
val _ = is_some disc' orelse is_some eq_ctr0 orelse
|
panny@54791
|
508 |
primrec_error_eqn "no discriminator in equation" concl;
|
blanchet@54440
|
509 |
val ctr_no' =
|
panny@55612
|
510 |
if is_none disc' then the eq_ctr0 else find_index (equal (head_of (the disc'))) discs;
|
blanchet@54440
|
511 |
val ctr_no = if not_disc then 1 - ctr_no' else ctr_no';
|
panny@55612
|
512 |
val {ctr, disc, ...} = nth basic_ctr_specs ctr_no;
|
blanchet@54440
|
513 |
|
panny@54791
|
514 |
val catch_all = try (fst o dest_Free o the_single) prems' = SOME Name.uu_;
|
panny@54857
|
515 |
val matchedss = AList.lookup (op =) matchedsss fun_name |> the_default [];
|
panny@54857
|
516 |
val prems = map (abstract (List.rev fun_args)) prems';
|
panny@54857
|
517 |
val real_prems =
|
blanchet@55519
|
518 |
(if catch_all orelse seq then maps s_not_conj matchedss else []) @
|
panny@54791
|
519 |
(if catch_all then [] else prems);
|
blanchet@54440
|
520 |
|
panny@54857
|
521 |
val matchedsss' = AList.delete (op =) fun_name matchedsss
|
panny@55517
|
522 |
|> cons (fun_name, if seq then matchedss @ [prems] else matchedss @ [real_prems]);
|
panny@54791
|
523 |
|
panny@54791
|
524 |
val user_eqn =
|
panny@55549
|
525 |
(real_prems, concl)
|
panny@55549
|
526 |
|>> map HOLogic.mk_Trueprop ||> HOLogic.mk_Trueprop o abstract (List.rev fun_args)
|
panny@55549
|
527 |
|> curry Logic.list_all (map dest_Free fun_args) o Logic.list_implies;
|
blanchet@54440
|
528 |
in
|
panny@54478
|
529 |
(Disc {
|
blanchet@54440
|
530 |
fun_name = fun_name,
|
panny@54857
|
531 |
fun_T = fun_T,
|
panny@54538
|
532 |
fun_args = fun_args,
|
panny@54857
|
533 |
ctr = ctr,
|
blanchet@54440
|
534 |
ctr_no = ctr_no,
|
panny@55612
|
535 |
disc = disc,
|
panny@54791
|
536 |
prems = real_prems,
|
panny@54959
|
537 |
auto_gen = catch_all,
|
panny@55549
|
538 |
maybe_ctr_rhs = maybe_ctr_rhs,
|
panny@55549
|
539 |
maybe_code_rhs = maybe_code_rhs,
|
panny@54791
|
540 |
user_eqn = user_eqn
|
panny@54857
|
541 |
}, matchedsss')
|
blanchet@54440
|
542 |
end;
|
blanchet@54440
|
543 |
|
panny@55612
|
544 |
fun dissect_coeqn_sel fun_names (basic_ctr_specss : basic_corec_ctr_spec list list) eqn' of_spec
|
panny@55612
|
545 |
eqn =
|
blanchet@54440
|
546 |
let
|
blanchet@54440
|
547 |
val (lhs, rhs) = HOLogic.dest_eq eqn
|
blanchet@54440
|
548 |
handle TERM _ =>
|
blanchet@54440
|
549 |
primrec_error_eqn "malformed function equation (expected \"lhs = rhs\")" eqn;
|
blanchet@54440
|
550 |
val sel = head_of lhs;
|
panny@54857
|
551 |
val ((fun_name, fun_T), fun_args) = dest_comb lhs |> snd |> strip_comb |> apfst dest_Free
|
blanchet@54440
|
552 |
handle TERM _ =>
|
blanchet@54440
|
553 |
primrec_error_eqn "malformed selector argument in left-hand side" eqn;
|
panny@55612
|
554 |
val basic_ctr_specs = the (AList.lookup (op =) (fun_names ~~ basic_ctr_specss) fun_name)
|
blanchet@54440
|
555 |
handle Option.Option => primrec_error_eqn "malformed selector argument in left-hand side" eqn;
|
panny@55612
|
556 |
val {ctr, ...} =
|
panny@54968
|
557 |
if is_some of_spec
|
panny@55612
|
558 |
then the (find_first (equal (the of_spec) o #ctr) basic_ctr_specs)
|
panny@55612
|
559 |
else filter (exists (equal sel) o #sels) basic_ctr_specs |> the_single
|
panny@54968
|
560 |
handle List.Empty => primrec_error_eqn "ambiguous selector - use \"of\"" eqn;
|
panny@54791
|
561 |
val user_eqn = drop_All eqn';
|
blanchet@54440
|
562 |
in
|
panny@54478
|
563 |
Sel {
|
blanchet@54440
|
564 |
fun_name = fun_name,
|
panny@54857
|
565 |
fun_T = fun_T,
|
panny@54538
|
566 |
fun_args = fun_args,
|
panny@55612
|
567 |
ctr = ctr,
|
panny@54478
|
568 |
sel = sel,
|
blanchet@54440
|
569 |
rhs_term = rhs,
|
panny@54791
|
570 |
user_eqn = user_eqn
|
blanchet@54440
|
571 |
}
|
blanchet@54440
|
572 |
end;
|
blanchet@54440
|
573 |
|
panny@55612
|
574 |
fun dissect_coeqn_ctr seq fun_names (basic_ctr_specss : basic_corec_ctr_spec list list) eqn'
|
panny@55612
|
575 |
maybe_code_rhs prems concl matchedsss =
|
blanchet@55047
|
576 |
let
|
panny@55517
|
577 |
val (lhs, rhs) = HOLogic.dest_eq concl;
|
panny@55549
|
578 |
val (fun_name, fun_args) = strip_comb lhs |>> fst o dest_Free;
|
panny@55612
|
579 |
val basic_ctr_specs = the (AList.lookup (op =) (fun_names ~~ basic_ctr_specss) fun_name);
|
blanchet@55526
|
580 |
val (ctr, ctr_args) = strip_comb (unfold_let rhs);
|
panny@55612
|
581 |
val {disc, sels, ...} = the (find_first (equal ctr o #ctr) basic_ctr_specs)
|
blanchet@54440
|
582 |
handle Option.Option => primrec_error_eqn "not a constructor" ctr;
|
panny@54478
|
583 |
|
panny@55517
|
584 |
val disc_concl = betapply (disc, lhs);
|
panny@55612
|
585 |
val (maybe_eqn_data_disc, matchedsss') = if length basic_ctr_specs = 1
|
panny@54857
|
586 |
then (NONE, matchedsss)
|
panny@55612
|
587 |
else apfst SOME (dissect_coeqn_disc seq fun_names basic_ctr_specss
|
panny@55549
|
588 |
(SOME (abstract (List.rev fun_args) rhs)) maybe_code_rhs prems disc_concl matchedsss);
|
blanchet@54440
|
589 |
|
blanchet@55611
|
590 |
val sel_concls = sels ~~ ctr_args
|
blanchet@54440
|
591 |
|> map (fn (sel, ctr_arg) => HOLogic.mk_eq (betapply (sel, lhs), ctr_arg));
|
blanchet@54440
|
592 |
|
blanchet@54993
|
593 |
(*
|
panny@55517
|
594 |
val _ = tracing ("reduced\n " ^ Syntax.string_of_term @{context} concl ^ "\nto\n \<cdot> " ^
|
panny@55517
|
595 |
(is_some maybe_eqn_data_disc ? K (Syntax.string_of_term @{context} disc_concl ^ "\n \<cdot> ")) "" ^
|
panny@55549
|
596 |
space_implode "\n \<cdot> " (map (Syntax.string_of_term @{context}) sel_concls) ^
|
panny@55549
|
597 |
"\nfor premise(s)\n \<cdot> " ^
|
panny@55549
|
598 |
space_implode "\n \<cdot> " (map (Syntax.string_of_term @{context}) prems));
|
blanchet@54993
|
599 |
*)
|
blanchet@54440
|
600 |
|
panny@55612
|
601 |
val eqns_data_sel =
|
panny@55612
|
602 |
map (dissect_coeqn_sel fun_names basic_ctr_specss eqn' (SOME ctr)) sel_concls;
|
blanchet@54440
|
603 |
in
|
panny@54857
|
604 |
(the_list maybe_eqn_data_disc @ eqns_data_sel, matchedsss')
|
blanchet@54440
|
605 |
end;
|
blanchet@54440
|
606 |
|
panny@55612
|
607 |
fun dissect_coeqn_code lthy has_call fun_names basic_ctr_specss eqn' concl matchedsss =
|
panny@55517
|
608 |
let
|
panny@55517
|
609 |
val (lhs, (rhs', rhs)) = HOLogic.dest_eq concl ||> `(expand_corec_code_rhs lthy has_call []);
|
panny@55549
|
610 |
val (fun_name, fun_args) = strip_comb lhs |>> fst o dest_Free;
|
panny@55612
|
611 |
val basic_ctr_specs = the (AList.lookup (op =) (fun_names ~~ basic_ctr_specss) fun_name);
|
panny@55517
|
612 |
|
panny@55517
|
613 |
val cond_ctrs = fold_rev_corec_code_rhs lthy (fn cs => fn ctr => fn _ =>
|
panny@55612
|
614 |
if member ((op =) o apsnd #ctr) basic_ctr_specs ctr
|
panny@55517
|
615 |
then cons (ctr, cs)
|
panny@55517
|
616 |
else primrec_error_eqn "not a constructor" ctr) [] rhs' []
|
panny@55517
|
617 |
|> AList.group (op =);
|
panny@55517
|
618 |
|
blanchet@55520
|
619 |
val ctr_premss = (case cond_ctrs of [_] => [[]] | _ => map (s_dnf o snd) cond_ctrs);
|
panny@55517
|
620 |
val ctr_concls = cond_ctrs |> map (fn (ctr, _) =>
|
panny@55517
|
621 |
binder_types (fastype_of ctr)
|
panny@55517
|
622 |
|> map_index (fn (n, T) => massage_corec_code_rhs lthy (fn _ => fn ctr' => fn args =>
|
panny@55517
|
623 |
if ctr' = ctr then nth args n else Const (@{const_name undefined}, T)) [] rhs')
|
panny@55517
|
624 |
|> curry list_comb ctr
|
panny@55517
|
625 |
|> curry HOLogic.mk_eq lhs);
|
panny@55517
|
626 |
in
|
panny@55612
|
627 |
fold_map2 (dissect_coeqn_ctr false fun_names basic_ctr_specss eqn'
|
panny@55549
|
628 |
(SOME (abstract (List.rev fun_args) rhs)))
|
panny@55549
|
629 |
ctr_premss ctr_concls matchedsss
|
panny@55517
|
630 |
end;
|
panny@55517
|
631 |
|
panny@55612
|
632 |
fun dissect_coeqn lthy seq has_call fun_names (basic_ctr_specss : basic_corec_ctr_spec list list)
|
panny@55612
|
633 |
eqn' of_spec matchedsss =
|
blanchet@54440
|
634 |
let
|
panny@54791
|
635 |
val eqn = drop_All eqn'
|
panny@54791
|
636 |
handle TERM _ => primrec_error_eqn "malformed function equation" eqn';
|
panny@55517
|
637 |
val (prems, concl) = Logic.strip_horn eqn
|
panny@54478
|
638 |
|> apfst (map HOLogic.dest_Trueprop) o apsnd HOLogic.dest_Trueprop;
|
blanchet@54440
|
639 |
|
panny@55517
|
640 |
val head = concl
|
blanchet@54440
|
641 |
|> perhaps (try HOLogic.dest_not) |> perhaps (try (fst o HOLogic.dest_eq))
|
blanchet@54440
|
642 |
|> head_of;
|
blanchet@54440
|
643 |
|
panny@55517
|
644 |
val maybe_rhs = concl |> perhaps (try (HOLogic.dest_not)) |> try (snd o HOLogic.dest_eq);
|
blanchet@54440
|
645 |
|
panny@55612
|
646 |
val discs = maps (map #disc) basic_ctr_specss;
|
panny@55612
|
647 |
val sels = maps (maps #sels) basic_ctr_specss;
|
panny@55612
|
648 |
val ctrs = maps (map #ctr) basic_ctr_specss;
|
blanchet@54440
|
649 |
in
|
blanchet@54440
|
650 |
if member (op =) discs head orelse
|
blanchet@54440
|
651 |
is_some maybe_rhs andalso
|
blanchet@54440
|
652 |
member (op =) (filter (null o binder_types o fastype_of) ctrs) (the maybe_rhs) then
|
panny@55612
|
653 |
dissect_coeqn_disc seq fun_names basic_ctr_specss NONE NONE prems concl matchedsss
|
blanchet@54440
|
654 |
|>> single
|
blanchet@54440
|
655 |
else if member (op =) sels head then
|
panny@55612
|
656 |
([dissect_coeqn_sel fun_names basic_ctr_specss eqn' of_spec concl], matchedsss)
|
panny@55517
|
657 |
else if is_Free head andalso member (op =) fun_names (fst (dest_Free head)) andalso
|
blanchet@55526
|
658 |
member (op =) ctrs (head_of (unfold_let (the maybe_rhs))) then
|
panny@55612
|
659 |
dissect_coeqn_ctr seq fun_names basic_ctr_specss eqn' NONE prems concl matchedsss
|
panny@55517
|
660 |
else if is_Free head andalso member (op =) fun_names (fst (dest_Free head)) andalso
|
panny@55517
|
661 |
null prems then
|
panny@55612
|
662 |
dissect_coeqn_code lthy has_call fun_names basic_ctr_specss eqn' concl matchedsss
|
panny@55517
|
663 |
|>> flat
|
blanchet@54440
|
664 |
else
|
blanchet@54440
|
665 |
primrec_error_eqn "malformed function equation" eqn
|
blanchet@54440
|
666 |
end;
|
blanchet@54440
|
667 |
|
blanchet@55139
|
668 |
fun build_corec_arg_disc (ctr_specs : corec_ctr_spec list)
|
blanchet@55605
|
669 |
({fun_args, ctr_no, prems, ...} : coeqn_data_disc) =
|
panny@54791
|
670 |
if is_none (#pred (nth ctr_specs ctr_no)) then I else
|
blanchet@55520
|
671 |
s_conjs prems
|
panny@54791
|
672 |
|> curry subst_bounds (List.rev fun_args)
|
panny@54791
|
673 |
|> HOLogic.tupled_lambda (HOLogic.mk_tuple fun_args)
|
panny@54791
|
674 |
|> K |> nth_map (the (#pred (nth ctr_specs ctr_no)));
|
blanchet@54440
|
675 |
|
blanchet@55605
|
676 |
fun build_corec_arg_no_call (sel_eqns : coeqn_data_sel list) sel =
|
panny@54857
|
677 |
find_first (equal sel o #sel) sel_eqns
|
panny@54857
|
678 |
|> try (fn SOME {fun_args, rhs_term, ...} => abs_tuple fun_args rhs_term)
|
panny@54857
|
679 |
|> the_default undef_const
|
panny@54548
|
680 |
|> K;
|
panny@54497
|
681 |
|
blanchet@55605
|
682 |
fun build_corec_args_mutual_call lthy has_call (sel_eqns : coeqn_data_sel list) sel =
|
panny@54497
|
683 |
let
|
panny@54548
|
684 |
val maybe_sel_eqn = find_first (equal sel o #sel) sel_eqns;
|
panny@54497
|
685 |
in
|
panny@55013
|
686 |
if is_none maybe_sel_eqn then (I, I, I) else
|
panny@55013
|
687 |
let
|
panny@55013
|
688 |
val {fun_args, rhs_term, ... } = the maybe_sel_eqn;
|
panny@55549
|
689 |
val bound_Ts = List.rev (map fastype_of fun_args);
|
blanchet@55027
|
690 |
fun rewrite_q _ t = if has_call t then @{term False} else @{term True};
|
blanchet@55027
|
691 |
fun rewrite_g _ t = if has_call t then undef_const else t;
|
panny@55036
|
692 |
fun rewrite_h bound_Ts t =
|
panny@55036
|
693 |
if has_call t then mk_tuple1 bound_Ts (snd (strip_comb t)) else undef_const;
|
blanchet@55554
|
694 |
fun massage f _ = massage_mutual_corec_call lthy has_call f bound_Ts rhs_term
|
panny@55549
|
695 |
|> abs_tuple fun_args;
|
panny@55013
|
696 |
in
|
panny@55013
|
697 |
(massage rewrite_q,
|
panny@55013
|
698 |
massage rewrite_g,
|
panny@55013
|
699 |
massage rewrite_h)
|
panny@55013
|
700 |
end
|
panny@54497
|
701 |
end;
|
panny@54497
|
702 |
|
blanchet@55605
|
703 |
fun build_corec_arg_nested_call lthy has_call (sel_eqns : coeqn_data_sel list) sel =
|
panny@54548
|
704 |
let
|
panny@54548
|
705 |
val maybe_sel_eqn = find_first (equal sel o #sel) sel_eqns;
|
panny@55036
|
706 |
in
|
panny@55036
|
707 |
if is_none maybe_sel_eqn then I else
|
panny@55036
|
708 |
let
|
panny@55036
|
709 |
val {fun_args, rhs_term, ...} = the maybe_sel_eqn;
|
panny@55549
|
710 |
val bound_Ts = List.rev (map fastype_of fun_args);
|
panny@55036
|
711 |
fun rewrite bound_Ts U T (Abs (v, V, b)) = Abs (v, V, rewrite (V :: bound_Ts) U T b)
|
panny@55036
|
712 |
| rewrite bound_Ts U T (t as _ $ _) =
|
panny@55036
|
713 |
let val (u, vs) = strip_comb t in
|
panny@55036
|
714 |
if is_Free u andalso has_call u then
|
panny@55036
|
715 |
Inr_const U T $ mk_tuple1 bound_Ts vs
|
panny@55036
|
716 |
else if try (fst o dest_Const) u = SOME @{const_name prod_case} then
|
panny@55036
|
717 |
map (rewrite bound_Ts U T) vs |> chop 1 |>> HOLogic.mk_split o the_single |> list_comb
|
panny@55036
|
718 |
else
|
panny@55036
|
719 |
list_comb (rewrite bound_Ts U T u, map (rewrite bound_Ts U T) vs)
|
panny@55036
|
720 |
end
|
panny@55036
|
721 |
| rewrite _ U T t =
|
panny@55036
|
722 |
if is_Free t andalso has_call t then Inr_const U T $ HOLogic.unit else t;
|
panny@55036
|
723 |
fun massage t =
|
panny@55549
|
724 |
rhs_term
|
blanchet@55554
|
725 |
|> massage_nested_corec_call lthy has_call rewrite bound_Ts (range_type (fastype_of t))
|
panny@54872
|
726 |
|> abs_tuple fun_args;
|
panny@55036
|
727 |
in
|
panny@55036
|
728 |
massage
|
panny@55036
|
729 |
end
|
panny@54548
|
730 |
end;
|
panny@54497
|
731 |
|
blanchet@55605
|
732 |
fun build_corec_args_sel lthy has_call (all_sel_eqns : coeqn_data_sel list)
|
blanchet@55139
|
733 |
(ctr_spec : corec_ctr_spec) =
|
panny@54478
|
734 |
let val sel_eqns = filter (equal (#ctr ctr_spec) o #ctr) all_sel_eqns in
|
panny@54478
|
735 |
if null sel_eqns then I else
|
panny@54478
|
736 |
let
|
panny@54478
|
737 |
val sel_call_list = #sels ctr_spec ~~ #calls ctr_spec;
|
panny@54478
|
738 |
|
panny@54478
|
739 |
val no_calls' = map_filter (try (apsnd (fn No_Corec n => n))) sel_call_list;
|
blanchet@55554
|
740 |
val mutual_calls' = map_filter (try (apsnd (fn Mutual_Corec n => n))) sel_call_list;
|
blanchet@55554
|
741 |
val nested_calls' = map_filter (try (apsnd (fn Nested_Corec n => n))) sel_call_list;
|
panny@54478
|
742 |
in
|
panny@54497
|
743 |
I
|
panny@54872
|
744 |
#> fold (fn (sel, n) => nth_map n (build_corec_arg_no_call sel_eqns sel)) no_calls'
|
panny@54497
|
745 |
#> fold (fn (sel, (q, g, h)) =>
|
blanchet@55554
|
746 |
let val (fq, fg, fh) = build_corec_args_mutual_call lthy has_call sel_eqns sel in
|
blanchet@55554
|
747 |
nth_map q fq o nth_map g fg o nth_map h fh end) mutual_calls'
|
panny@54497
|
748 |
#> fold (fn (sel, n) => nth_map n
|
blanchet@55554
|
749 |
(build_corec_arg_nested_call lthy has_call sel_eqns sel)) nested_calls'
|
panny@54478
|
750 |
end
|
blanchet@54440
|
751 |
end;
|
blanchet@54440
|
752 |
|
blanchet@55605
|
753 |
fun build_codefs lthy bs mxs has_call arg_Tss (corec_specs : corec_spec list)
|
blanchet@55605
|
754 |
(disc_eqnss : coeqn_data_disc list list) (sel_eqnss : coeqn_data_sel list list) =
|
panny@54791
|
755 |
let
|
panny@55612
|
756 |
val corecs = map #corec corec_specs;
|
panny@55612
|
757 |
val ctr_specss = map #ctr_specs corec_specs;
|
panny@54497
|
758 |
val corec_args = hd corecs
|
panny@54497
|
759 |
|> fst o split_last o binder_types o fastype_of
|
panny@54497
|
760 |
|> map (Const o pair @{const_name undefined})
|
panny@54857
|
761 |
|> fold2 (fold o build_corec_arg_disc) ctr_specss disc_eqnss
|
panny@54497
|
762 |
|> fold2 (fold o build_corec_args_sel lthy has_call) sel_eqnss ctr_specss;
|
panny@54872
|
763 |
fun currys [] t = t
|
panny@54872
|
764 |
| currys Ts t = t $ mk_tuple1 (List.rev Ts) (map Bound (length Ts - 1 downto 0))
|
panny@54872
|
765 |
|> fold_rev (Term.abs o pair Name.uu) Ts;
|
panny@54538
|
766 |
|
blanchet@54993
|
767 |
(*
|
panny@54497
|
768 |
val _ = tracing ("corecursor arguments:\n \<cdot> " ^
|
panny@54548
|
769 |
space_implode "\n \<cdot> " (map (Syntax.string_of_term lthy) corec_args));
|
blanchet@54993
|
770 |
*)
|
blanchet@54440
|
771 |
|
panny@54791
|
772 |
val exclss' =
|
panny@54857
|
773 |
disc_eqnss
|
panny@54959
|
774 |
|> map (map (fn x => (#fun_args x, #ctr_no x, #prems x, #auto_gen x))
|
panny@54791
|
775 |
#> fst o (fn xs => fold_map (fn x => fn ys => ((x, ys), ys @ [x])) xs [])
|
panny@54791
|
776 |
#> maps (uncurry (map o pair)
|
panny@54959
|
777 |
#> map (fn ((fun_args, c, x, a), (_, c', y, a')) =>
|
blanchet@55520
|
778 |
((c, c', a orelse a'), (x, s_not (s_conjs y)))
|
panny@54791
|
779 |
||> apfst (map HOLogic.mk_Trueprop) o apsnd HOLogic.mk_Trueprop
|
panny@54791
|
780 |
||> Logic.list_implies
|
panny@54791
|
781 |
||> curry Logic.list_all (map dest_Free fun_args))))
|
blanchet@54440
|
782 |
in
|
blanchet@54440
|
783 |
map (list_comb o rpair corec_args) corecs
|
blanchet@54440
|
784 |
|> map2 (fn Ts => fn t => if length Ts = 0 then t $ HOLogic.unit else t) arg_Tss
|
blanchet@54440
|
785 |
|> map2 currys arg_Tss
|
blanchet@54440
|
786 |
|> Syntax.check_terms lthy
|
blanchet@55607
|
787 |
|> map3 (fn b => fn mx => fn t => ((b, mx), ((Binding.conceal (Thm.def_binding b), []), t)))
|
blanchet@55607
|
788 |
bs mxs
|
panny@54791
|
789 |
|> rpair exclss'
|
blanchet@54440
|
790 |
end;
|
blanchet@54440
|
791 |
|
blanchet@55139
|
792 |
fun mk_real_disc_eqns fun_binding arg_Ts ({ctr_specs, ...} : corec_spec)
|
blanchet@55605
|
793 |
(sel_eqns : coeqn_data_sel list) (disc_eqns : coeqn_data_disc list) =
|
panny@54857
|
794 |
if length disc_eqns <> length ctr_specs - 1 then disc_eqns else
|
panny@54857
|
795 |
let
|
panny@54857
|
796 |
val n = 0 upto length ctr_specs
|
panny@54857
|
797 |
|> the o find_first (fn idx => not (exists (equal idx o #ctr_no) disc_eqns));
|
panny@54859
|
798 |
val fun_args = (try (#fun_args o hd) disc_eqns, try (#fun_args o hd) sel_eqns)
|
panny@54859
|
799 |
|> the_default (map (curry Free Name.uu) arg_Ts) o merge_options;
|
panny@54857
|
800 |
val extra_disc_eqn = {
|
panny@54857
|
801 |
fun_name = Binding.name_of fun_binding,
|
panny@54857
|
802 |
fun_T = arg_Ts ---> body_type (fastype_of (#ctr (hd ctr_specs))),
|
panny@54859
|
803 |
fun_args = fun_args,
|
panny@54857
|
804 |
ctr = #ctr (nth ctr_specs n),
|
panny@54857
|
805 |
ctr_no = n,
|
panny@54857
|
806 |
disc = #disc (nth ctr_specs n),
|
blanchet@55519
|
807 |
prems = maps (s_not_conj o #prems) disc_eqns,
|
panny@54959
|
808 |
auto_gen = true,
|
panny@55549
|
809 |
maybe_ctr_rhs = NONE,
|
panny@55549
|
810 |
maybe_code_rhs = NONE,
|
panny@54857
|
811 |
user_eqn = undef_const};
|
panny@54857
|
812 |
in
|
panny@54857
|
813 |
chop n disc_eqns ||> cons extra_disc_eqn |> (op @)
|
panny@54857
|
814 |
end;
|
panny@54857
|
815 |
|
panny@55612
|
816 |
fun find_corec_calls has_call basic_ctr_specs {ctr, sel, rhs_term, ...} =
|
panny@55612
|
817 |
let
|
panny@55612
|
818 |
val sel_no = find_first (equal ctr o #ctr) basic_ctr_specs
|
panny@55612
|
819 |
|> find_index (equal sel) o #sels o the;
|
panny@55612
|
820 |
fun find (Abs (_, _, b)) = find b
|
panny@55612
|
821 |
| find (t as _ $ _) = strip_comb t |>> find ||> maps find |> (op @)
|
panny@55612
|
822 |
| find f = if is_Free f andalso has_call f then [f] else [];
|
panny@55612
|
823 |
in
|
panny@55612
|
824 |
find rhs_term
|
panny@55612
|
825 |
|> K |> nth_map sel_no |> AList.map_entry (op =) ctr
|
panny@55612
|
826 |
end;
|
panny@55612
|
827 |
|
panny@55517
|
828 |
fun add_primcorec simple seq fixes specs of_specs lthy =
|
blanchet@54440
|
829 |
let
|
traytel@54489
|
830 |
val (bs, mxs) = map_split (apfst fst) fixes;
|
blanchet@54440
|
831 |
val (arg_Ts, res_Ts) = map (strip_type o snd o fst #>> HOLogic.mk_tupleT) fixes |> split_list;
|
blanchet@54440
|
832 |
|
panny@55612
|
833 |
val fun_names = map Binding.name_of bs;
|
panny@55612
|
834 |
val basic_ctr_specss = map (basic_corec_specs_of lthy) res_Ts;
|
panny@55612
|
835 |
val has_call = exists_subterm (map (fst #>> Binding.name_of #> Free) fixes |> member (op =));
|
panny@55612
|
836 |
val eqns_data =
|
panny@55612
|
837 |
fold_map2 (dissect_coeqn lthy seq has_call fun_names basic_ctr_specss) (map snd specs)
|
panny@55612
|
838 |
of_specs []
|
panny@55612
|
839 |
|> flat o fst;
|
panny@55612
|
840 |
|
panny@55612
|
841 |
val callssss =
|
panny@55612
|
842 |
map_filter (try (fn Sel x => x)) eqns_data
|
panny@55612
|
843 |
|> partition_eq ((op =) o pairself #fun_name)
|
panny@55612
|
844 |
|> fst o finds (fn (x, ({fun_name, ...} :: _)) => x = fun_name) fun_names
|
panny@55613
|
845 |
|> map (flat o snd)
|
panny@55613
|
846 |
|> map2 (fold o find_corec_calls has_call) basic_ctr_specss
|
panny@55612
|
847 |
|> map2 (curry (op |>)) (map (map (fn {ctr, sels, ...} =>
|
panny@55612
|
848 |
(ctr, map (K []) sels))) basic_ctr_specss);
|
panny@55612
|
849 |
|
panny@55612
|
850 |
(*
|
panny@55612
|
851 |
val _ = tracing ("callssss = " ^ @{make_string} callssss);
|
panny@55612
|
852 |
*)
|
blanchet@54440
|
853 |
|
blanchet@54967
|
854 |
val ((n2m, corec_specs', _, coinduct_thm, strong_coinduct_thm, coinduct_thms,
|
blanchet@54934
|
855 |
strong_coinduct_thms), lthy') =
|
blanchet@54931
|
856 |
corec_specs_of bs arg_Ts res_Ts (get_indices fixes) callssss lthy;
|
blanchet@54967
|
857 |
val actual_nn = length bs;
|
blanchet@54967
|
858 |
val corec_specs = take actual_nn corec_specs'; (*###*)
|
blanchet@54440
|
859 |
|
panny@54857
|
860 |
val disc_eqnss' = map_filter (try (fn Disc x => x)) eqns_data
|
panny@54791
|
861 |
|> partition_eq ((op =) o pairself #fun_name)
|
panny@54857
|
862 |
|> fst o finds (fn (x, ({fun_name, ...} :: _)) => x = fun_name) fun_names
|
panny@54791
|
863 |
|> map (sort ((op <) o pairself #ctr_no |> make_ord) o flat o snd);
|
panny@54857
|
864 |
val _ = disc_eqnss' |> map (fn x =>
|
panny@54857
|
865 |
let val d = duplicates ((op =) o pairself #ctr_no) x in null d orelse
|
panny@54857
|
866 |
primrec_error_eqns "excess discriminator equations in definition"
|
panny@54857
|
867 |
(maps (fn t => filter (equal (#ctr_no t) o #ctr_no) x) d |> map #user_eqn) end);
|
panny@54791
|
868 |
|
panny@54791
|
869 |
val sel_eqnss = map_filter (try (fn Sel x => x)) eqns_data
|
panny@54791
|
870 |
|> partition_eq ((op =) o pairself #fun_name)
|
panny@54857
|
871 |
|> fst o finds (fn (x, ({fun_name, ...} :: _)) => x = fun_name) fun_names
|
panny@54791
|
872 |
|> map (flat o snd);
|
panny@54791
|
873 |
|
panny@54497
|
874 |
val arg_Tss = map (binder_types o snd o fst) fixes;
|
panny@54859
|
875 |
val disc_eqnss = map5 mk_real_disc_eqns bs arg_Tss corec_specs sel_eqnss disc_eqnss';
|
panny@54791
|
876 |
val (defs, exclss') =
|
blanchet@55605
|
877 |
build_codefs lthy' bs mxs has_call arg_Tss corec_specs disc_eqnss sel_eqnss;
|
panny@54791
|
878 |
|
blanchet@55060
|
879 |
fun excl_tac (c, c', a) =
|
panny@55517
|
880 |
if a orelse c = c' orelse seq then
|
blanchet@55181
|
881 |
SOME (K (HEADGOAL (mk_primcorec_assumption_tac lthy [])))
|
blanchet@55181
|
882 |
else if simple then
|
blanchet@55181
|
883 |
SOME (K (auto_tac lthy))
|
blanchet@55181
|
884 |
else
|
blanchet@55181
|
885 |
NONE;
|
panny@54959
|
886 |
|
blanchet@54993
|
887 |
(*
|
panny@54959
|
888 |
val _ = tracing ("exclusiveness properties:\n \<cdot> " ^
|
panny@54959
|
889 |
space_implode "\n \<cdot> " (maps (map (Syntax.string_of_term lthy o snd)) exclss'));
|
blanchet@54993
|
890 |
*)
|
panny@54959
|
891 |
|
panny@54959
|
892 |
val exclss'' = exclss' |> map (map (fn (idx, t) =>
|
blanchet@55060
|
893 |
(idx, (Option.map (Goal.prove lthy [] [] t) (excl_tac idx), t))));
|
panny@54791
|
894 |
val taut_thmss = map (map (apsnd (the o fst)) o filter (is_some o fst o snd)) exclss'';
|
panny@54791
|
895 |
val (obligation_idxss, obligationss) = exclss''
|
panny@54791
|
896 |
|> map (map (apsnd (rpair [] o snd)) o filter (is_none o fst o snd))
|
panny@54791
|
897 |
|> split_list o map split_list;
|
panny@54791
|
898 |
|
panny@54791
|
899 |
fun prove thmss' def_thms' lthy =
|
panny@54791
|
900 |
let
|
panny@54791
|
901 |
val def_thms = map (snd o snd) def_thms';
|
panny@54791
|
902 |
|
panny@54791
|
903 |
val exclss' = map (op ~~) (obligation_idxss ~~ thmss');
|
panny@54791
|
904 |
fun mk_exclsss excls n =
|
panny@54791
|
905 |
(excls, map (fn k => replicate k [TrueI] @ replicate (n - k) []) (0 upto n - 1))
|
panny@54959
|
906 |
|-> fold (fn ((c, c', _), thm) => nth_map c (nth_map c' (K [thm])));
|
panny@54791
|
907 |
val exclssss = (exclss' ~~ taut_thmss |> map (op @), fun_names ~~ corec_specs)
|
panny@54791
|
908 |
|-> map2 (fn excls => fn (_, {ctr_specs, ...}) => mk_exclsss excls (length ctr_specs));
|
panny@54791
|
909 |
|
blanchet@55139
|
910 |
fun prove_disc ({ctr_specs, ...} : corec_spec) exclsss
|
blanchet@55605
|
911 |
({fun_name, fun_T, fun_args, ctr_no, prems, ...} : coeqn_data_disc) =
|
panny@54859
|
912 |
if Term.aconv_untyped (#disc (nth ctr_specs ctr_no), @{term "\<lambda>x. x = x"}) then [] else
|
panny@54857
|
913 |
let
|
panny@54859
|
914 |
val {disc_corec, ...} = nth ctr_specs ctr_no;
|
panny@54857
|
915 |
val k = 1 + ctr_no;
|
panny@54857
|
916 |
val m = length prems;
|
panny@54857
|
917 |
val t =
|
panny@54857
|
918 |
list_comb (Free (fun_name, fun_T), map Bound (length fun_args - 1 downto 0))
|
panny@54857
|
919 |
|> curry betapply (#disc (nth ctr_specs ctr_no)) (*###*)
|
panny@54857
|
920 |
|> HOLogic.mk_Trueprop
|
panny@54857
|
921 |
|> curry Logic.list_implies (map HOLogic.mk_Trueprop prems)
|
panny@54857
|
922 |
|> curry Logic.list_all (map dest_Free fun_args);
|
panny@54857
|
923 |
in
|
panny@55549
|
924 |
if prems = [@{term False}] then [] else
|
panny@54857
|
925 |
mk_primcorec_disc_tac lthy def_thms disc_corec k m exclsss
|
panny@54857
|
926 |
|> K |> Goal.prove lthy [] [] t
|
panny@54857
|
927 |
|> pair (#disc (nth ctr_specs ctr_no))
|
panny@54857
|
928 |
|> single
|
panny@54857
|
929 |
end;
|
panny@54857
|
930 |
|
blanchet@55139
|
931 |
fun prove_sel ({nested_maps, nested_map_idents, nested_map_comps, ctr_specs, ...}
|
blanchet@55605
|
932 |
: corec_spec) (disc_eqns : coeqn_data_disc list) exclsss
|
blanchet@55605
|
933 |
({fun_name, fun_T, fun_args, ctr, sel, rhs_term, ...} : coeqn_data_sel) =
|
panny@54791
|
934 |
let
|
blanchet@55046
|
935 |
val SOME ctr_spec = find_first (equal ctr o #ctr) ctr_specs;
|
panny@54857
|
936 |
val ctr_no = find_index (equal ctr o #ctr) ctr_specs;
|
blanchet@55519
|
937 |
val prems = the_default (maps (s_not_conj o #prems) disc_eqns)
|
panny@54857
|
938 |
(find_first (equal ctr_no o #ctr_no) disc_eqns |> Option.map #prems);
|
panny@54857
|
939 |
val sel_corec = find_index (equal sel) (#sels ctr_spec)
|
panny@54857
|
940 |
|> nth (#sel_corecs ctr_spec);
|
panny@54791
|
941 |
val k = 1 + ctr_no;
|
panny@54791
|
942 |
val m = length prems;
|
panny@54791
|
943 |
val t =
|
panny@54857
|
944 |
list_comb (Free (fun_name, fun_T), map Bound (length fun_args - 1 downto 0))
|
panny@54857
|
945 |
|> curry betapply sel
|
panny@54857
|
946 |
|> rpair (abstract (List.rev fun_args) rhs_term)
|
panny@54857
|
947 |
|> HOLogic.mk_Trueprop o HOLogic.mk_eq
|
panny@54791
|
948 |
|> curry Logic.list_implies (map HOLogic.mk_Trueprop prems)
|
panny@54857
|
949 |
|> curry Logic.list_all (map dest_Free fun_args);
|
blanchet@55062
|
950 |
val (distincts, _, sel_splits, sel_split_asms) = case_thms_of_term lthy [] rhs_term;
|
panny@54791
|
951 |
in
|
blanchet@55055
|
952 |
mk_primcorec_sel_tac lthy def_thms distincts sel_splits sel_split_asms nested_maps
|
blanchet@55047
|
953 |
nested_map_idents nested_map_comps sel_corec k m exclsss
|
panny@54791
|
954 |
|> K |> Goal.prove lthy [] [] t
|
panny@54857
|
955 |
|> pair sel
|
panny@54791
|
956 |
end;
|
panny@54791
|
957 |
|
blanchet@55605
|
958 |
fun prove_ctr disc_alist sel_alist (disc_eqns : coeqn_data_disc list)
|
blanchet@55605
|
959 |
(sel_eqns : coeqn_data_sel list) ({ctr, disc, sels, collapse, ...} : corec_ctr_spec) =
|
panny@55549
|
960 |
(* don't try to prove theorems when some sel_eqns are missing *)
|
panny@54857
|
961 |
if not (exists (equal ctr o #ctr) disc_eqns)
|
panny@54859
|
962 |
andalso not (exists (equal ctr o #ctr) sel_eqns)
|
panny@55549
|
963 |
orelse
|
panny@54857
|
964 |
filter (equal ctr o #ctr) sel_eqns
|
panny@54857
|
965 |
|> fst o finds ((op =) o apsnd #sel) sels
|
panny@54857
|
966 |
|> exists (null o snd)
|
panny@54857
|
967 |
then [] else
|
panny@54857
|
968 |
let
|
panny@55549
|
969 |
val (fun_name, fun_T, fun_args, prems, maybe_rhs) =
|
panny@54859
|
970 |
(find_first (equal ctr o #ctr) disc_eqns, find_first (equal ctr o #ctr) sel_eqns)
|
panny@55549
|
971 |
|>> Option.map (fn x => (#fun_name x, #fun_T x, #fun_args x, #prems x,
|
panny@55549
|
972 |
#maybe_ctr_rhs x))
|
panny@55549
|
973 |
||> Option.map (fn x => (#fun_name x, #fun_T x, #fun_args x, [], NONE))
|
panny@54859
|
974 |
|> the o merge_options;
|
panny@54857
|
975 |
val m = length prems;
|
panny@55549
|
976 |
val t = (if is_some maybe_rhs then the maybe_rhs else
|
panny@55549
|
977 |
filter (equal ctr o #ctr) sel_eqns
|
panny@55549
|
978 |
|> fst o finds ((op =) o apsnd #sel) sels
|
panny@55549
|
979 |
|> map (snd #> (fn [x] => (List.rev (#fun_args x), #rhs_term x)) #-> abstract)
|
panny@55549
|
980 |
|> curry list_comb ctr)
|
panny@54857
|
981 |
|> curry HOLogic.mk_eq (list_comb (Free (fun_name, fun_T),
|
panny@54857
|
982 |
map Bound (length fun_args - 1 downto 0)))
|
panny@54857
|
983 |
|> HOLogic.mk_Trueprop
|
panny@54857
|
984 |
|> curry Logic.list_implies (map HOLogic.mk_Trueprop prems)
|
panny@54857
|
985 |
|> curry Logic.list_all (map dest_Free fun_args);
|
blanchet@54928
|
986 |
val maybe_disc_thm = AList.lookup (op =) disc_alist disc;
|
blanchet@54928
|
987 |
val sel_thms = map snd (filter (member (op =) sels o fst) sel_alist);
|
panny@54857
|
988 |
in
|
panny@55549
|
989 |
if prems = [@{term False}] then [] else
|
panny@55549
|
990 |
mk_primcorec_ctr_of_dtr_tac lthy m collapse maybe_disc_thm sel_thms
|
panny@55549
|
991 |
|> K |> Goal.prove lthy [] [] t
|
panny@55549
|
992 |
|> pair ctr
|
panny@55549
|
993 |
|> single
|
panny@55013
|
994 |
end;
|
panny@54857
|
995 |
|
panny@55550
|
996 |
fun prove_code disc_eqns sel_eqns ctr_alist {ctr_specs, ...} =
|
panny@55550
|
997 |
let
|
panny@55549
|
998 |
val (fun_name, fun_T, fun_args, maybe_rhs) =
|
panny@55549
|
999 |
(find_first (member (op =) (map #ctr ctr_specs) o #ctr) disc_eqns,
|
panny@55549
|
1000 |
find_first (member (op =) (map #ctr ctr_specs) o #ctr) sel_eqns)
|
panny@55549
|
1001 |
|>> Option.map (fn x => (#fun_name x, #fun_T x, #fun_args x, #maybe_code_rhs x))
|
panny@55549
|
1002 |
||> Option.map (fn x => (#fun_name x, #fun_T x, #fun_args x, NONE))
|
panny@55549
|
1003 |
|> the o merge_options;
|
panny@55549
|
1004 |
|
panny@55572
|
1005 |
val lhs = list_comb (Free (fun_name, fun_T), map Bound (length fun_args - 1 downto 0));
|
panny@55549
|
1006 |
val maybe_rhs' = if is_some maybe_rhs then maybe_rhs else
|
panny@55549
|
1007 |
let
|
panny@55550
|
1008 |
fun prove_code_ctr {ctr, sels, ...} =
|
panny@55549
|
1009 |
if not (exists (equal ctr o fst) ctr_alist) then NONE else
|
panny@55549
|
1010 |
let
|
panny@55551
|
1011 |
val prems = find_first (equal ctr o #ctr) disc_eqns
|
panny@55551
|
1012 |
|> Option.map #prems |> the_default [];
|
panny@55549
|
1013 |
val t =
|
panny@55549
|
1014 |
filter (equal ctr o #ctr) sel_eqns
|
panny@55549
|
1015 |
|> fst o finds ((op =) o apsnd #sel) sels
|
panny@55549
|
1016 |
|> map (snd #> (fn [x] => (List.rev (#fun_args x), #rhs_term x)) #-> abstract)
|
panny@55549
|
1017 |
|> curry list_comb ctr;
|
panny@55549
|
1018 |
in
|
panny@55549
|
1019 |
SOME (prems, t)
|
panny@55549
|
1020 |
end;
|
panny@55549
|
1021 |
val maybe_ctr_conds_argss = map prove_code_ctr ctr_specs;
|
panny@55549
|
1022 |
in
|
panny@55549
|
1023 |
if exists is_none maybe_ctr_conds_argss then NONE else
|
panny@55549
|
1024 |
fold_rev (fn SOME (prems, u) => fn t => mk_If (s_conjs prems) u t)
|
panny@55572
|
1025 |
maybe_ctr_conds_argss
|
panny@55572
|
1026 |
(Const (@{const_name Code.abort}, @{typ String.literal} -->
|
panny@55572
|
1027 |
(@{typ unit} --> body_type fun_T) --> body_type fun_T) $
|
panny@55572
|
1028 |
@{term "STR []"} $ (* FIXME *)
|
panny@55572
|
1029 |
absdummy @{typ unit} (incr_boundvars 1 lhs))
|
panny@55549
|
1030 |
|> SOME
|
panny@55549
|
1031 |
end;
|
panny@55549
|
1032 |
in
|
panny@55549
|
1033 |
if is_none maybe_rhs' then [] else
|
panny@55549
|
1034 |
let
|
panny@55549
|
1035 |
val rhs = the maybe_rhs';
|
panny@55549
|
1036 |
val bound_Ts = List.rev (map fastype_of fun_args);
|
blanchet@55585
|
1037 |
val ctr_thms = map snd ctr_alist;
|
panny@55549
|
1038 |
val ms = map (Logic.count_prems o prop_of) ctr_thms;
|
blanchet@55585
|
1039 |
val t = HOLogic.mk_eq (lhs, rhs)
|
blanchet@55585
|
1040 |
|> HOLogic.mk_Trueprop
|
blanchet@55585
|
1041 |
|> curry Logic.list_all (map dest_Free fun_args);
|
panny@55550
|
1042 |
val (distincts, discIs, sel_splits, sel_split_asms) =
|
blanchet@55585
|
1043 |
case_thms_of_term lthy bound_Ts rhs;
|
panny@55572
|
1044 |
val _ = tracing ("code equation: " ^ Syntax.string_of_term lthy t);
|
panny@55550
|
1045 |
|
blanchet@55585
|
1046 |
val code_thm = mk_primcorec_raw_code_of_ctr_tac lthy distincts discIs sel_splits
|
panny@55549
|
1047 |
sel_split_asms ms ctr_thms
|
blanchet@55585
|
1048 |
|> K |> Goal.prove lthy [] [] t;
|
blanchet@55585
|
1049 |
val _ = tracing ("code theorem: " ^ Syntax.string_of_term lthy (prop_of code_thm));
|
blanchet@55558
|
1050 |
in
|
blanchet@55585
|
1051 |
[code_thm]
|
blanchet@55558
|
1052 |
end
|
blanchet@55558
|
1053 |
handle ERROR s => (warning s; []) (*###*)
|
blanchet@55558
|
1054 |
end;
|
panny@55549
|
1055 |
|
blanchet@54928
|
1056 |
val disc_alists = map3 (maps oo prove_disc) corec_specs exclssss disc_eqnss;
|
blanchet@54928
|
1057 |
val sel_alists = map4 (map ooo prove_sel) corec_specs disc_eqnss exclssss sel_eqnss;
|
blanchet@54928
|
1058 |
val disc_thmss = map (map snd) disc_alists;
|
blanchet@54928
|
1059 |
val sel_thmss = map (map snd) sel_alists;
|
panny@55549
|
1060 |
|
panny@55549
|
1061 |
val ctr_alists = map5 (maps oooo prove_ctr) disc_alists sel_alists disc_eqnss sel_eqnss
|
blanchet@54881
|
1062 |
(map #ctr_specs corec_specs);
|
panny@55549
|
1063 |
val ctr_thmss = map (map snd) ctr_alists;
|
panny@55549
|
1064 |
|
panny@55549
|
1065 |
val code_thmss = map4 prove_code disc_eqnss sel_eqnss ctr_alists corec_specs;
|
blanchet@54928
|
1066 |
|
blanchet@55167
|
1067 |
val simp_thmss = map2 append disc_thmss sel_thmss
|
blanchet@54932
|
1068 |
|
blanchet@54934
|
1069 |
val common_name = mk_common_name fun_names;
|
blanchet@54934
|
1070 |
|
blanchet@54928
|
1071 |
val notes =
|
blanchet@54967
|
1072 |
[(coinductN, map (if n2m then single else K []) coinduct_thms, []),
|
blanchet@55597
|
1073 |
(codeN, code_thmss, code_nitpicksimp_attrs),
|
blanchet@54934
|
1074 |
(ctrN, ctr_thmss, []),
|
blanchet@54928
|
1075 |
(discN, disc_thmss, simp_attrs),
|
blanchet@54932
|
1076 |
(selN, sel_thmss, simp_attrs),
|
blanchet@54934
|
1077 |
(simpsN, simp_thmss, []),
|
blanchet@54967
|
1078 |
(strong_coinductN, map (if n2m then single else K []) strong_coinduct_thms, [])]
|
blanchet@54928
|
1079 |
|> maps (fn (thmN, thmss, attrs) =>
|
blanchet@54928
|
1080 |
map2 (fn fun_name => fn thms =>
|
blanchet@54928
|
1081 |
((Binding.qualify true fun_name (Binding.name thmN), attrs), [(thms, [])]))
|
blanchet@54967
|
1082 |
fun_names (take actual_nn thmss))
|
blanchet@54928
|
1083 |
|> filter_out (null o fst o hd o snd);
|
blanchet@54934
|
1084 |
|
blanchet@54934
|
1085 |
val common_notes =
|
blanchet@54967
|
1086 |
[(coinductN, if n2m then [coinduct_thm] else [], []),
|
blanchet@54967
|
1087 |
(strong_coinductN, if n2m then [strong_coinduct_thm] else [], [])]
|
blanchet@54934
|
1088 |
|> filter_out (null o #2)
|
blanchet@54934
|
1089 |
|> map (fn (thmN, thms, attrs) =>
|
blanchet@54934
|
1090 |
((Binding.qualify true common_name (Binding.name thmN), attrs), [(thms, [])]));
|
panny@54791
|
1091 |
in
|
blanchet@55167
|
1092 |
lthy |> Local_Theory.notes (notes @ common_notes) |> snd
|
panny@54791
|
1093 |
end;
|
panny@54959
|
1094 |
|
panny@54959
|
1095 |
fun after_qed thmss' = fold_map Local_Theory.define defs #-> prove thmss';
|
panny@54959
|
1096 |
|
panny@54959
|
1097 |
val _ = if not simple orelse forall null obligationss then () else
|
panny@54959
|
1098 |
primrec_error "need exclusiveness proofs - use primcorecursive instead of primcorec";
|
blanchet@54440
|
1099 |
in
|
panny@54959
|
1100 |
if simple then
|
panny@54959
|
1101 |
lthy'
|
panny@54959
|
1102 |
|> after_qed (map (fn [] => []) obligationss)
|
panny@54959
|
1103 |
|> pair NONE o SOME
|
panny@54959
|
1104 |
else
|
panny@54959
|
1105 |
lthy'
|
panny@54959
|
1106 |
|> Proof.theorem NONE after_qed obligationss
|
panny@54959
|
1107 |
|> Proof.refine (Method.primitive_text I)
|
panny@54959
|
1108 |
|> Seq.hd
|
panny@54959
|
1109 |
|> rpair NONE o SOME
|
panny@54959
|
1110 |
end;
|
blanchet@54440
|
1111 |
|
panny@54968
|
1112 |
fun add_primcorec_ursive_cmd simple seq (raw_fixes, raw_specs') lthy =
|
blanchet@54440
|
1113 |
let
|
panny@54968
|
1114 |
val (raw_specs, of_specs) = split_list raw_specs' ||> map (Option.map (Syntax.read_term lthy));
|
panny@54968
|
1115 |
val ((fixes, specs), _) = Specification.read_spec raw_fixes raw_specs lthy;
|
blanchet@54440
|
1116 |
in
|
panny@54968
|
1117 |
add_primcorec simple seq fixes specs of_specs lthy
|
blanchet@54440
|
1118 |
handle ERROR str => primrec_error str
|
blanchet@54440
|
1119 |
end
|
blanchet@54440
|
1120 |
handle Primrec_Error (str, eqns) =>
|
blanchet@54440
|
1121 |
if null eqns
|
blanchet@54440
|
1122 |
then error ("primcorec error:\n " ^ str)
|
blanchet@54440
|
1123 |
else error ("primcorec error:\n " ^ str ^ "\nin\n " ^
|
panny@54959
|
1124 |
space_implode "\n " (map (quote o Syntax.string_of_term lthy) eqns));
|
panny@54959
|
1125 |
|
panny@54959
|
1126 |
val add_primcorecursive_cmd = (the o fst) ooo add_primcorec_ursive_cmd false;
|
panny@54959
|
1127 |
val add_primcorec_cmd = (the o snd) ooo add_primcorec_ursive_cmd true;
|
blanchet@54440
|
1128 |
|
blanchet@54440
|
1129 |
end;
|