tuned names (to make them independent from temporary naming convention used in characteristic theorems)
1 (* Title: HOL/BNF/Tools/bnf_fp_rec_sugar.ML
2 Author: Lorenz Panny, TU Muenchen
5 Recursor and corecursor sugar.
8 signature BNF_FP_REC_SUGAR =
10 val add_primrec: (binding * typ option * mixfix) list ->
11 (Attrib.binding * term) list -> local_theory -> (term list * thm list list) * local_theory
12 val add_primrec_cmd: (binding * string option * mixfix) list ->
13 (Attrib.binding * string) list -> local_theory -> (term list * thm list list) * local_theory
14 val add_primrec_global: (binding * typ option * mixfix) list ->
15 (Attrib.binding * term) list -> theory -> (term list * thm list list) * theory
16 val add_primrec_overloaded: (string * (string * typ) * bool) list ->
17 (binding * typ option * mixfix) list ->
18 (Attrib.binding * term) list -> theory -> (term list * thm list list) * theory
19 val add_primrec_simple: ((binding * typ) * mixfix) list -> term list ->
20 local_theory -> (string list * (term list * (int list list * thm list list))) * local_theory
21 val add_primcorecursive_cmd: bool ->
22 (binding * string option * mixfix) list * ((Attrib.binding * string) * string option) list ->
23 Proof.context -> Proof.state
24 val add_primcorec_cmd: bool ->
25 (binding * string option * mixfix) list * ((Attrib.binding * string) * string option) list ->
26 local_theory -> local_theory
29 structure BNF_FP_Rec_Sugar : BNF_FP_REC_SUGAR =
34 open BNF_FP_Rec_Sugar_Util
35 open BNF_FP_Rec_Sugar_Tactics
42 val nitpicksimp_attrs = @{attributes [nitpick_simp]};
43 val simp_attrs = @{attributes [simp]};
44 val code_nitpicksimp_attrs = Code.add_default_eqn_attrib :: nitpicksimp_attrs;
45 val code_nitpicksimp_simp_attrs = Code.add_default_eqn_attrib :: nitpicksimp_attrs @ simp_attrs;
47 exception Primrec_Error of string * term list;
49 fun primrec_error str = raise Primrec_Error (str, []);
50 fun primrec_error_eqn str eqn = raise Primrec_Error (str, [eqn]);
51 fun primrec_error_eqns str eqns = raise Primrec_Error (str, eqns);
53 fun finds eq = fold_map (fn x => List.partition (curry eq x) #>> pair x);
55 val free_name = try (fn Free (v, _) => v);
56 val const_name = try (fn Const (v, _) => v);
57 val undef_const = Const (@{const_name undefined}, dummyT);
59 fun permute_args n t = list_comb (t, map Bound (0 :: (n downto 1)))
60 |> fold (K (Term.abs (Name.uu, dummyT))) (0 upto n);
61 val abs_tuple = HOLogic.tupled_lambda o HOLogic.mk_tuple;
62 fun drop_All t = subst_bounds (strip_qnt_vars @{const_name all} t |> map Free |> rev,
63 strip_qnt_body @{const_name all} t)
65 let fun a n (t $ u) = a n t $ a n u
66 | a n (Abs (v, T, b)) = Abs (v, T, a (n + 1) b)
67 | a n t = let val idx = find_index (equal t) vs in
68 if idx < 0 then t else Bound (n + idx) end
70 fun mk_prod1 Ts (t, u) = HOLogic.pair_const (fastype_of1 (Ts, t)) (fastype_of1 (Ts, u)) $ t $ u;
71 fun mk_tuple1 Ts = the_default HOLogic.unit o try (foldr1 (mk_prod1 Ts));
73 fun get_indices fixes t = map (fst #>> Binding.name_of #> Free) fixes
74 |> map_index (fn (i, v) => if exists_subterm (equal v) t then SOME i else NONE)
86 right_args: term list,
92 fun dissect_eqn lthy fun_names eqn' =
94 val eqn = drop_All eqn' |> HOLogic.dest_Trueprop
96 primrec_error_eqn "malformed function equation (expected \"lhs = rhs\")" eqn';
97 val (lhs, rhs) = HOLogic.dest_eq eqn
99 primrec_error_eqn "malformed function equation (expected \"lhs = rhs\")" eqn';
100 val (fun_name, args) = strip_comb lhs
101 |>> (fn x => if is_Free x then fst (dest_Free x)
102 else primrec_error_eqn "malformed function equation (does not start with free)" eqn);
103 val (left_args, rest) = take_prefix is_Free args;
104 val (nonfrees, right_args) = take_suffix is_Free rest;
105 val num_nonfrees = length nonfrees;
106 val _ = num_nonfrees = 1 orelse if num_nonfrees = 0 then
107 primrec_error_eqn "constructor pattern missing in left-hand side" eqn else
108 primrec_error_eqn "more than one non-variable argument in left-hand side" eqn;
109 val _ = member (op =) fun_names fun_name orelse
110 primrec_error_eqn "malformed function equation (does not start with function name)" eqn
112 val (ctr, ctr_args) = strip_comb (the_single nonfrees);
113 val _ = try (num_binder_types o fastype_of) ctr = SOME (length ctr_args) orelse
114 primrec_error_eqn "partially applied constructor in pattern" eqn;
115 val _ = let val d = duplicates (op =) (left_args @ ctr_args @ right_args) in null d orelse
116 primrec_error_eqn ("duplicate variable \"" ^ Syntax.string_of_term lthy (hd d) ^
117 "\" in left-hand side") eqn end;
118 val _ = forall is_Free ctr_args orelse
119 primrec_error_eqn "non-primitive pattern in left-hand side" eqn;
121 let val b = fold_aterms (fn x as Free (v, _) =>
122 if (not (member (op =) (left_args @ ctr_args @ right_args) x) andalso
123 not (member (op =) fun_names v) andalso
124 not (Variable.is_fixed lthy v)) then cons x else I | _ => I) rhs []
127 primrec_error_eqn ("extra variable(s) in right-hand side: " ^
128 commas (map (Syntax.string_of_term lthy) b)) eqn
131 {fun_name = fun_name,
132 rec_type = body_type (type_of ctr),
135 left_args = left_args,
136 right_args = right_args,
137 res_type = map fastype_of (left_args @ right_args) ---> fastype_of rhs,
142 fun rewrite_map_arg get_ctr_pos rec_type res_type =
144 val pT = HOLogic.mk_prodT (rec_type, res_type);
146 val maybe_suc = Option.map (fn x => x + 1);
147 fun subst d (t as Bound d') = t |> d = SOME d' ? curry (op $) (fst_const pT)
148 | subst d (Abs (v, T, b)) = Abs (v, if d = SOME ~1 then pT else T, subst (maybe_suc d) b)
151 val (u, vs) = strip_comb t;
152 val ctr_pos = try (get_ctr_pos o the) (free_name u) |> the_default ~1;
155 if d = SOME ~1 andalso length vs = ctr_pos then
156 list_comb (permute_args ctr_pos (snd_const pT), vs)
157 else if length vs > ctr_pos andalso is_some d
158 andalso d = try (fn Bound n => n) (nth vs ctr_pos) then
159 list_comb (snd_const pT $ nth vs ctr_pos, map (subst d) (nth_drop ctr_pos vs))
161 primrec_error_eqn ("recursive call not directly applied to constructor argument") t
163 list_comb (u, map (subst (d |> d = SOME ~1 ? K NONE)) vs)
169 fun subst_rec_calls lthy get_ctr_pos has_call ctr_args mutual_calls nested_calls =
171 fun try_nested_rec bound_Ts y t =
172 AList.lookup (op =) nested_calls y
173 |> Option.map (fn y' =>
174 massage_nested_rec_call lthy has_call (rewrite_map_arg get_ctr_pos) bound_Ts y y' t);
176 fun subst bound_Ts (t as g' $ y) =
178 fun subst_rec () = subst bound_Ts g' $ subst bound_Ts y;
179 val y_head = head_of y;
181 if not (member (op =) ctr_args y_head) then
184 (case try_nested_rec bound_Ts y_head t of
187 let val (g, g_args) = strip_comb g' in
188 (case try (get_ctr_pos o the) (free_name g) of
190 (length g_args >= ctr_pos orelse
191 primrec_error_eqn "too few arguments in recursive call" t;
192 (case AList.lookup (op =) mutual_calls y of
193 SOME y' => list_comb (y', g_args)
194 | NONE => subst_rec ()))
195 | NONE => subst_rec ())
198 | subst bound_Ts (Abs (v, T, b)) = Abs (v, T, subst (T :: bound_Ts) b)
203 (* FIXME detect this case earlier? *)
204 primrec_error_eqn "recursive call not directly applied to constructor argument" t
206 try_nested_rec [] (head_of t) t |> the_default t
211 fun build_rec_arg lthy (funs_data : eqn_data list list) has_call (ctr_spec : rec_ctr_spec)
212 (maybe_eqn_data : eqn_data option) =
213 if is_none maybe_eqn_data then undef_const else
215 val eqn_data = the maybe_eqn_data;
216 val t = #rhs_term eqn_data;
217 val ctr_args = #ctr_args eqn_data;
219 val calls = #calls ctr_spec;
220 val n_args = fold (Integer.add o (fn Mutual_Rec _ => 2 | _ => 1)) calls 0;
222 val no_calls' = tag_list 0 calls
223 |> map_filter (try (apsnd (fn No_Rec p => p | Mutual_Rec (p, _) => p)));
224 val mutual_calls' = tag_list 0 calls
225 |> map_filter (try (apsnd (fn Mutual_Rec (_, p) => p)));
226 val nested_calls' = tag_list 0 calls
227 |> map_filter (try (apsnd (fn Nested_Rec p => p)));
229 val args = replicate n_args ("", dummyT)
230 |> Term.rename_wrt_term t
232 |> fold (fn (ctr_arg_idx, (arg_idx, _)) =>
233 nth_map arg_idx (K (nth ctr_args ctr_arg_idx)))
235 |> fold (fn (ctr_arg_idx, (arg_idx, T)) =>
236 nth_map arg_idx (K (retype_free T (nth ctr_args ctr_arg_idx))))
238 |> fold (fn (ctr_arg_idx, (arg_idx, T)) =>
239 nth_map arg_idx (K (retype_free T (nth ctr_args ctr_arg_idx))))
242 val fun_name_ctr_pos_list =
243 map (fn (x :: _) => (#fun_name x, length (#left_args x))) funs_data;
244 val get_ctr_pos = try (the o AList.lookup (op =) fun_name_ctr_pos_list) #> the_default ~1;
245 val mutual_calls = map (apfst (nth ctr_args) o apsnd (nth args o fst)) mutual_calls';
246 val nested_calls = map (apfst (nth ctr_args) o apsnd (nth args o fst)) nested_calls';
248 val abstractions = args @ #left_args eqn_data @ #right_args eqn_data;
251 |> subst_rec_calls lthy get_ctr_pos has_call ctr_args mutual_calls nested_calls
252 |> fold_rev lambda abstractions
255 fun build_defs lthy bs mxs (funs_data : eqn_data list list) (rec_specs : rec_spec list) has_call =
257 val n_funs = length funs_data;
259 val ctr_spec_eqn_data_list' =
260 (take n_funs rec_specs |> map #ctr_specs) ~~ funs_data
261 |> maps (uncurry (finds (fn (x, y) => #ctr x = #ctr y))
262 ##> (fn x => null x orelse
263 primrec_error_eqns "excess equations in definition" (map #rhs_term x)) #> fst);
264 val _ = ctr_spec_eqn_data_list' |> map (fn (_, x) => length x <= 1 orelse
265 primrec_error_eqns ("multiple equations for constructor") (map #user_eqn x));
267 val ctr_spec_eqn_data_list =
268 ctr_spec_eqn_data_list' @ (drop n_funs rec_specs |> maps #ctr_specs |> map (rpair []));
270 val recs = take n_funs rec_specs |> map #recx;
271 val rec_args = ctr_spec_eqn_data_list
272 |> sort ((op <) o pairself (#offset o fst) |> make_ord)
273 |> map (uncurry (build_rec_arg lthy funs_data has_call) o apsnd (try the_single));
274 val ctr_poss = map (fn x =>
275 if length (distinct ((op =) o pairself (length o #left_args)) x) <> 1 then
276 primrec_error ("inconstant constructor pattern position for function " ^
277 quote (#fun_name (hd x)))
279 hd x |> #left_args |> length) funs_data;
282 |-> map2 (fn recx => fn ctr_pos => list_comb (recx, rec_args) |> permute_args ctr_pos)
283 |> Syntax.check_terms lthy
284 |> map3 (fn b => fn mx => fn t => ((b, mx), ((Binding.conceal (Thm.def_binding b), []), t)))
288 fun massage_comp ctxt has_call bound_Ts t =
289 massage_nested_corec_call ctxt has_call (K (K (K I))) bound_Ts (fastype_of1 (bound_Ts, t)) t;
291 fun find_rec_calls ctxt has_call (eqn_data : eqn_data) =
293 fun find bound_Ts (Abs (_, T, b)) ctr_arg = find (T :: bound_Ts) b ctr_arg
294 | find bound_Ts (t as _ $ _) ctr_arg =
296 val typof = curry fastype_of1 bound_Ts;
297 val (f', args') = strip_comb t;
298 val n = find_index (equal ctr_arg o head_of) args';
301 find bound_Ts f' ctr_arg @ maps (fn x => find bound_Ts x ctr_arg) args'
304 val (f, args as arg :: _) = chop n args' |>> curry list_comb f'
305 val (arg_head, arg_args) = Term.strip_comb arg;
308 mk_partial_compN (length arg_args) (typof f) (typof arg_head) f ::
309 maps (fn x => find bound_Ts x ctr_arg) args
311 find bound_Ts f ctr_arg @ maps (fn x => find bound_Ts x ctr_arg) args
316 map (find [] (#rhs_term eqn_data)) (#ctr_args eqn_data)
317 |> (fn [] => NONE | callss => SOME (#ctr eqn_data, callss))
320 fun prepare_primrec fixes specs lthy =
322 val (bs, mxs) = map_split (apfst fst) fixes;
323 val fun_names = map Binding.name_of bs;
324 val eqns_data = map (dissect_eqn lthy fun_names) specs;
325 val funs_data = eqns_data
326 |> partition_eq ((op =) o pairself #fun_name)
327 |> finds (fn (x, y) => x = #fun_name (hd y)) fun_names |> fst
328 |> map (fn (x, y) => the_single y handle List.Empty =>
329 primrec_error ("missing equations for function " ^ quote x));
331 val has_call = exists_subterm (map (fst #>> Binding.name_of #> Free) fixes |> member (op =));
332 val arg_Ts = map (#rec_type o hd) funs_data;
333 val res_Ts = map (#res_type o hd) funs_data;
334 val callssss = funs_data
335 |> map (partition_eq ((op =) o pairself #ctr))
336 |> map (maps (map_filter (find_rec_calls lthy has_call)));
338 val ((n2m, rec_specs, _, induct_thm, induct_thms), lthy') =
339 rec_specs_of bs arg_Ts res_Ts (get_indices fixes) callssss lthy;
341 val actual_nn = length funs_data;
343 val _ = let val ctrs = (maps (map #ctr o #ctr_specs) rec_specs) in
344 map (fn {ctr, user_eqn, ...} => member (op =) ctrs ctr orelse
345 primrec_error_eqn ("argument " ^ quote (Syntax.string_of_term lthy' ctr) ^
346 " is not a constructor in left-hand side") user_eqn) eqns_data end;
348 val defs = build_defs lthy' bs mxs funs_data rec_specs has_call;
350 fun prove lthy def_thms' ({ctr_specs, nested_map_idents, nested_map_comps, ...} : rec_spec)
351 (fun_data : eqn_data list) =
353 val def_thms = map (snd o snd) def_thms';
354 val simp_thmss = finds (fn (x, y) => #ctr x = #ctr y) fun_data ctr_specs
356 |> map_filter (try (fn (x, [y]) =>
357 (#user_eqn x, length (#left_args x) + length (#right_args x), #rec_thm y)))
358 |> map (fn (user_eqn, num_extra_args, rec_thm) =>
359 mk_primrec_tac lthy num_extra_args nested_map_idents nested_map_comps def_thms rec_thm
360 |> K |> Goal.prove lthy [] [] user_eqn
361 |> Thm.close_derivation);
362 val poss = find_indices (fn (x, y) => #ctr x = #ctr y) fun_data eqns_data;
368 (if n2m then map2 (fn name => fn thm =>
369 (name, inductN, [thm], [])) fun_names (take actual_nn induct_thms) else [])
370 |> map (fn (prefix, thmN, thms, attrs) =>
371 ((Binding.qualify true prefix (Binding.name thmN), attrs), [(thms, [])]));
373 val common_name = mk_common_name fun_names;
376 (if n2m then [(inductN, [induct_thm], [])] else [])
377 |> map (fn (thmN, thms, attrs) =>
378 ((Binding.qualify true common_name (Binding.name thmN), attrs), [(thms, [])]));
381 fn lthy => fn defs =>
382 split_list (map2 (prove lthy defs) (take actual_nn rec_specs) funs_data)),
383 lthy' |> Local_Theory.notes (notes @ common_notes) |> snd)
386 (* primrec definition *)
388 fun add_primrec_simple fixes ts lthy =
390 val (((names, defs), prove), lthy) = prepare_primrec fixes ts lthy
391 handle ERROR str => primrec_error str;
394 |> fold_map Local_Theory.define defs
395 |-> (fn defs => `(fn lthy => (names, (map fst defs, prove lthy defs))))
397 handle Primrec_Error (str, eqns) =>
399 then error ("primrec_new error:\n " ^ str)
400 else error ("primrec_new error:\n " ^ str ^ "\nin\n " ^
401 space_implode "\n " (map (quote o Syntax.string_of_term lthy) eqns));
405 fun gen_primrec prep_spec (raw_fixes : (binding * 'a option * mixfix) list) raw_spec lthy =
407 val d = duplicates (op =) (map (Binding.name_of o #1) raw_fixes)
408 val _ = null d orelse primrec_error ("duplicate function name(s): " ^ commas d);
410 val (fixes, specs) = fst (prep_spec raw_fixes raw_spec lthy);
413 flat ooo map3 (fn poss => fn prefix => fn thms =>
415 val (bs, attrss) = map_split (fst o nth specs) poss;
417 map3 (fn b => fn attrs => fn thm =>
418 ((Binding.qualify false prefix b, code_nitpicksimp_simp_attrs @ attrs), [([thm], [])]))
421 ((Binding.qualify true prefix (Binding.name simpsN), []), [(thms, [])]) :: notes
425 |> add_primrec_simple fixes (map snd specs)
426 |-> (fn (names, (ts, (posss, simpss))) =>
427 Spec_Rules.add Spec_Rules.Equational (ts, flat simpss)
428 #> Local_Theory.notes (mk_notes posss names simpss)
429 #>> pair ts o map snd)
434 val add_primrec = gen_primrec Specification.check_spec;
435 val add_primrec_cmd = gen_primrec Specification.read_spec;
439 fun add_primrec_global fixes specs thy =
441 val lthy = Named_Target.theory_init thy;
442 val ((ts, simps), lthy') = add_primrec fixes specs lthy;
443 val simps' = burrow (Proof_Context.export lthy' lthy) simps;
444 in ((ts, simps'), Local_Theory.exit_global lthy') end;
446 fun add_primrec_overloaded ops fixes specs thy =
448 val lthy = Overloading.overloading ops thy;
449 val ((ts, simps), lthy') = add_primrec fixes specs lthy;
450 val simps' = burrow (Proof_Context.export lthy' lthy) simps;
451 in ((ts, simps'), Local_Theory.exit_global lthy') end;
457 type coeqn_data_disc = {
466 maybe_ctr_rhs: term option,
467 maybe_code_rhs: term option,
471 type coeqn_data_sel = {
481 datatype coeqn_data =
482 Disc of coeqn_data_disc |
483 Sel of coeqn_data_sel;
485 fun dissect_coeqn_disc seq fun_names (basic_ctr_specss : basic_corec_ctr_spec list list)
486 maybe_ctr_rhs maybe_code_rhs prems' concl matchedsss =
488 fun find_subterm p = let (* FIXME \<exists>? *)
489 fun f (t as u $ v) = if p t then SOME t else merge_options (f u, f v)
490 | f t = if p t then SOME t else NONE
493 val applied_fun = concl
494 |> find_subterm (member ((op =) o apsnd SOME) fun_names o try (fst o dest_Free o head_of))
496 handle Option.Option => primrec_error_eqn "malformed discriminator formula" concl;
497 val ((fun_name, fun_T), fun_args) = strip_comb applied_fun |>> dest_Free;
498 val basic_ctr_specs = the (AList.lookup (op =) (fun_names ~~ basic_ctr_specss) fun_name);
500 val discs = map #disc basic_ctr_specs;
501 val ctrs = map #ctr basic_ctr_specs;
502 val not_disc = head_of concl = @{term Not};
503 val _ = not_disc andalso length ctrs <> 2 andalso
504 primrec_error_eqn "\<not>ed discriminator for a type with \<noteq> 2 constructors" concl;
505 val disc' = find_subterm (member (op =) discs o head_of) concl;
506 val eq_ctr0 = concl |> perhaps (try (HOLogic.dest_not)) |> try (HOLogic.dest_eq #> snd)
507 |> (fn SOME t => let val n = find_index (equal t) ctrs in
508 if n >= 0 then SOME n else NONE end | _ => NONE);
509 val _ = is_some disc' orelse is_some eq_ctr0 orelse
510 primrec_error_eqn "no discriminator in equation" concl;
512 if is_none disc' then the eq_ctr0 else find_index (equal (head_of (the disc'))) discs;
513 val ctr_no = if not_disc then 1 - ctr_no' else ctr_no';
514 val {ctr, disc, ...} = nth basic_ctr_specs ctr_no;
516 val catch_all = try (fst o dest_Free o the_single) prems' = SOME Name.uu_;
517 val matchedss = AList.lookup (op =) matchedsss fun_name |> the_default [];
518 val prems = map (abstract (List.rev fun_args)) prems';
520 (if catch_all orelse seq then maps s_not_conj matchedss else []) @
521 (if catch_all then [] else prems);
523 val matchedsss' = AList.delete (op =) fun_name matchedsss
524 |> cons (fun_name, if seq then matchedss @ [prems] else matchedss @ [real_prems]);
528 |>> map HOLogic.mk_Trueprop ||> HOLogic.mk_Trueprop o abstract (List.rev fun_args)
529 |> curry Logic.list_all (map dest_Free fun_args) o Logic.list_implies;
539 auto_gen = catch_all,
540 maybe_ctr_rhs = maybe_ctr_rhs,
541 maybe_code_rhs = maybe_code_rhs,
546 fun dissect_coeqn_sel fun_names (basic_ctr_specss : basic_corec_ctr_spec list list) eqn' of_spec
549 val (lhs, rhs) = HOLogic.dest_eq eqn
551 primrec_error_eqn "malformed function equation (expected \"lhs = rhs\")" eqn;
552 val sel = head_of lhs;
553 val ((fun_name, fun_T), fun_args) = dest_comb lhs |> snd |> strip_comb |> apfst dest_Free
555 primrec_error_eqn "malformed selector argument in left-hand side" eqn;
556 val basic_ctr_specs = the (AList.lookup (op =) (fun_names ~~ basic_ctr_specss) fun_name)
557 handle Option.Option => primrec_error_eqn "malformed selector argument in left-hand side" eqn;
560 then the (find_first (equal (the of_spec) o #ctr) basic_ctr_specs)
561 else filter (exists (equal sel) o #sels) basic_ctr_specs |> the_single
562 handle List.Empty => primrec_error_eqn "ambiguous selector - use \"of\"" eqn;
563 val user_eqn = drop_All eqn';
576 fun dissect_coeqn_ctr seq fun_names (basic_ctr_specss : basic_corec_ctr_spec list list) eqn'
577 maybe_code_rhs prems concl matchedsss =
579 val (lhs, rhs) = HOLogic.dest_eq concl;
580 val (fun_name, fun_args) = strip_comb lhs |>> fst o dest_Free;
581 val basic_ctr_specs = the (AList.lookup (op =) (fun_names ~~ basic_ctr_specss) fun_name);
582 val (ctr, ctr_args) = strip_comb (unfold_let rhs);
583 val {disc, sels, ...} = the (find_first (equal ctr o #ctr) basic_ctr_specs)
584 handle Option.Option => primrec_error_eqn "not a constructor" ctr;
586 val disc_concl = betapply (disc, lhs);
587 val (maybe_eqn_data_disc, matchedsss') = if length basic_ctr_specs = 1
588 then (NONE, matchedsss)
589 else apfst SOME (dissect_coeqn_disc seq fun_names basic_ctr_specss
590 (SOME (abstract (List.rev fun_args) rhs)) maybe_code_rhs prems disc_concl matchedsss);
592 val sel_concls = sels ~~ ctr_args
593 |> map (fn (sel, ctr_arg) => HOLogic.mk_eq (betapply (sel, lhs), ctr_arg));
596 val _ = tracing ("reduced\n " ^ Syntax.string_of_term @{context} concl ^ "\nto\n \<cdot> " ^
597 (is_some maybe_eqn_data_disc ? K (Syntax.string_of_term @{context} disc_concl ^ "\n \<cdot> ")) "" ^
598 space_implode "\n \<cdot> " (map (Syntax.string_of_term @{context}) sel_concls) ^
599 "\nfor premise(s)\n \<cdot> " ^
600 space_implode "\n \<cdot> " (map (Syntax.string_of_term @{context}) prems));
604 map (dissect_coeqn_sel fun_names basic_ctr_specss eqn' (SOME ctr)) sel_concls;
606 (the_list maybe_eqn_data_disc @ eqns_data_sel, matchedsss')
609 fun dissect_coeqn_code lthy has_call fun_names basic_ctr_specss eqn' concl matchedsss =
611 val (lhs, (rhs', rhs)) = HOLogic.dest_eq concl ||> `(expand_corec_code_rhs lthy has_call []);
612 val (fun_name, fun_args) = strip_comb lhs |>> fst o dest_Free;
613 val basic_ctr_specs = the (AList.lookup (op =) (fun_names ~~ basic_ctr_specss) fun_name);
615 val cond_ctrs = fold_rev_corec_code_rhs lthy (fn cs => fn ctr => fn _ =>
616 if member ((op =) o apsnd #ctr) basic_ctr_specs ctr
618 else primrec_error_eqn "not a constructor" ctr) [] rhs' []
619 |> AList.group (op =);
621 val ctr_premss = (case cond_ctrs of [_] => [[]] | _ => map (s_dnf o snd) cond_ctrs);
622 val ctr_concls = cond_ctrs |> map (fn (ctr, _) =>
623 binder_types (fastype_of ctr)
624 |> map_index (fn (n, T) => massage_corec_code_rhs lthy (fn _ => fn ctr' => fn args =>
625 if ctr' = ctr then nth args n else Const (@{const_name undefined}, T)) [] rhs')
626 |> curry list_comb ctr
627 |> curry HOLogic.mk_eq lhs);
629 fold_map2 (dissect_coeqn_ctr false fun_names basic_ctr_specss eqn'
630 (SOME (abstract (List.rev fun_args) rhs)))
631 ctr_premss ctr_concls matchedsss
634 fun dissect_coeqn lthy seq has_call fun_names (basic_ctr_specss : basic_corec_ctr_spec list list)
635 eqn' of_spec matchedsss =
637 val eqn = drop_All eqn'
638 handle TERM _ => primrec_error_eqn "malformed function equation" eqn';
639 val (prems, concl) = Logic.strip_horn eqn
640 |> apfst (map HOLogic.dest_Trueprop) o apsnd HOLogic.dest_Trueprop;
643 |> perhaps (try HOLogic.dest_not) |> perhaps (try (fst o HOLogic.dest_eq))
646 val maybe_rhs = concl |> perhaps (try (HOLogic.dest_not)) |> try (snd o HOLogic.dest_eq);
648 val discs = maps (map #disc) basic_ctr_specss;
649 val sels = maps (maps #sels) basic_ctr_specss;
650 val ctrs = maps (map #ctr) basic_ctr_specss;
652 if member (op =) discs head orelse
653 is_some maybe_rhs andalso
654 member (op =) (filter (null o binder_types o fastype_of) ctrs) (the maybe_rhs) then
655 dissect_coeqn_disc seq fun_names basic_ctr_specss NONE NONE prems concl matchedsss
657 else if member (op =) sels head then
658 ([dissect_coeqn_sel fun_names basic_ctr_specss eqn' of_spec concl], matchedsss)
659 else if is_Free head andalso member (op =) fun_names (fst (dest_Free head)) andalso
660 member (op =) ctrs (head_of (unfold_let (the maybe_rhs))) then
661 dissect_coeqn_ctr seq fun_names basic_ctr_specss eqn' NONE prems concl matchedsss
662 else if is_Free head andalso member (op =) fun_names (fst (dest_Free head)) andalso
664 dissect_coeqn_code lthy has_call fun_names basic_ctr_specss eqn' concl matchedsss
667 primrec_error_eqn "malformed function equation" eqn
670 fun build_corec_arg_disc (ctr_specs : corec_ctr_spec list)
671 ({fun_args, ctr_no, prems, ...} : coeqn_data_disc) =
672 if is_none (#pred (nth ctr_specs ctr_no)) then I else
674 |> curry subst_bounds (List.rev fun_args)
675 |> HOLogic.tupled_lambda (HOLogic.mk_tuple fun_args)
676 |> K |> nth_map (the (#pred (nth ctr_specs ctr_no)));
678 fun build_corec_arg_no_call (sel_eqns : coeqn_data_sel list) sel =
679 find_first (equal sel o #sel) sel_eqns
680 |> try (fn SOME {fun_args, rhs_term, ...} => abs_tuple fun_args rhs_term)
681 |> the_default undef_const
684 fun build_corec_args_mutual_call lthy has_call (sel_eqns : coeqn_data_sel list) sel =
686 val maybe_sel_eqn = find_first (equal sel o #sel) sel_eqns;
688 if is_none maybe_sel_eqn then (I, I, I) else
690 val {fun_args, rhs_term, ... } = the maybe_sel_eqn;
691 val bound_Ts = List.rev (map fastype_of fun_args);
692 fun rewrite_stop _ t = if has_call t then @{term False} else @{term True};
693 fun rewrite_end _ t = if has_call t then undef_const else t;
694 fun rewrite_cont bound_Ts t =
695 if has_call t then mk_tuple1 bound_Ts (snd (strip_comb t)) else undef_const;
696 fun massage f _ = massage_mutual_corec_call lthy has_call f bound_Ts rhs_term
697 |> abs_tuple fun_args;
699 (massage rewrite_stop, massage rewrite_end, massage rewrite_cont)
703 fun build_corec_arg_nested_call lthy has_call (sel_eqns : coeqn_data_sel list) sel =
705 val maybe_sel_eqn = find_first (equal sel o #sel) sel_eqns;
707 if is_none maybe_sel_eqn then I else
709 val {fun_args, rhs_term, ...} = the maybe_sel_eqn;
710 val bound_Ts = List.rev (map fastype_of fun_args);
711 fun rewrite bound_Ts U T (Abs (v, V, b)) = Abs (v, V, rewrite (V :: bound_Ts) U T b)
712 | rewrite bound_Ts U T (t as _ $ _) =
713 let val (u, vs) = strip_comb t in
714 if is_Free u andalso has_call u then
715 Inr_const U T $ mk_tuple1 bound_Ts vs
716 else if try (fst o dest_Const) u = SOME @{const_name prod_case} then
717 map (rewrite bound_Ts U T) vs |> chop 1 |>> HOLogic.mk_split o the_single |> list_comb
719 list_comb (rewrite bound_Ts U T u, map (rewrite bound_Ts U T) vs)
722 if is_Free t andalso has_call t then Inr_const U T $ HOLogic.unit else t;
725 |> massage_nested_corec_call lthy has_call rewrite bound_Ts (range_type (fastype_of t))
726 |> abs_tuple fun_args;
732 fun build_corec_args_sel lthy has_call (all_sel_eqns : coeqn_data_sel list)
733 (ctr_spec : corec_ctr_spec) =
734 let val sel_eqns = filter (equal (#ctr ctr_spec) o #ctr) all_sel_eqns in
735 if null sel_eqns then I else
737 val sel_call_list = #sels ctr_spec ~~ #calls ctr_spec;
739 val no_calls' = map_filter (try (apsnd (fn No_Corec n => n))) sel_call_list;
740 val mutual_calls' = map_filter (try (apsnd (fn Mutual_Corec n => n))) sel_call_list;
741 val nested_calls' = map_filter (try (apsnd (fn Nested_Corec n => n))) sel_call_list;
744 #> fold (fn (sel, n) => nth_map n (build_corec_arg_no_call sel_eqns sel)) no_calls'
745 #> fold (fn (sel, (q, g, h)) =>
746 let val (fq, fg, fh) = build_corec_args_mutual_call lthy has_call sel_eqns sel in
747 nth_map q fq o nth_map g fg o nth_map h fh end) mutual_calls'
748 #> fold (fn (sel, n) => nth_map n
749 (build_corec_arg_nested_call lthy has_call sel_eqns sel)) nested_calls'
753 fun build_codefs lthy bs mxs has_call arg_Tss (corec_specs : corec_spec list)
754 (disc_eqnss : coeqn_data_disc list list) (sel_eqnss : coeqn_data_sel list list) =
756 val corecs = map #corec corec_specs;
757 val ctr_specss = map #ctr_specs corec_specs;
758 val corec_args = hd corecs
759 |> fst o split_last o binder_types o fastype_of
760 |> map (Const o pair @{const_name undefined})
761 |> fold2 (fold o build_corec_arg_disc) ctr_specss disc_eqnss
762 |> fold2 (fold o build_corec_args_sel lthy has_call) sel_eqnss ctr_specss;
764 | currys Ts t = t $ mk_tuple1 (List.rev Ts) (map Bound (length Ts - 1 downto 0))
765 |> fold_rev (Term.abs o pair Name.uu) Ts;
768 val _ = tracing ("corecursor arguments:\n \<cdot> " ^
769 space_implode "\n \<cdot> " (map (Syntax.string_of_term lthy) corec_args));
774 |> map (map (fn x => (#fun_args x, #ctr_no x, #prems x, #auto_gen x))
775 #> fst o (fn xs => fold_map (fn x => fn ys => ((x, ys), ys @ [x])) xs [])
776 #> maps (uncurry (map o pair)
777 #> map (fn ((fun_args, c, x, a), (_, c', y, a')) =>
778 ((c, c', a orelse a'), (x, s_not (s_conjs y)))
779 ||> apfst (map HOLogic.mk_Trueprop) o apsnd HOLogic.mk_Trueprop
780 ||> Logic.list_implies
781 ||> curry Logic.list_all (map dest_Free fun_args))))
783 map (list_comb o rpair corec_args) corecs
784 |> map2 (fn Ts => fn t => if length Ts = 0 then t $ HOLogic.unit else t) arg_Tss
785 |> map2 currys arg_Tss
786 |> Syntax.check_terms lthy
787 |> map3 (fn b => fn mx => fn t => ((b, mx), ((Binding.conceal (Thm.def_binding b), []), t)))
792 fun mk_real_disc_eqns fun_binding arg_Ts ({ctr_specs, ...} : corec_spec)
793 (sel_eqns : coeqn_data_sel list) (disc_eqns : coeqn_data_disc list) =
794 if length disc_eqns <> length ctr_specs - 1 then disc_eqns else
796 val n = 0 upto length ctr_specs
797 |> the o find_first (fn idx => not (exists (equal idx o #ctr_no) disc_eqns));
798 val fun_args = (try (#fun_args o hd) disc_eqns, try (#fun_args o hd) sel_eqns)
799 |> the_default (map (curry Free Name.uu) arg_Ts) o merge_options;
800 val extra_disc_eqn = {
801 fun_name = Binding.name_of fun_binding,
802 fun_T = arg_Ts ---> body_type (fastype_of (#ctr (hd ctr_specs))),
804 ctr = #ctr (nth ctr_specs n),
806 disc = #disc (nth ctr_specs n),
807 prems = maps (s_not_conj o #prems) disc_eqns,
809 maybe_ctr_rhs = NONE,
810 maybe_code_rhs = NONE,
811 user_eqn = undef_const};
813 chop n disc_eqns ||> cons extra_disc_eqn |> (op @)
816 fun find_corec_calls has_call basic_ctr_specs {ctr, sel, rhs_term, ...} =
818 val sel_no = find_first (equal ctr o #ctr) basic_ctr_specs
819 |> find_index (equal sel) o #sels o the;
820 fun find (Abs (_, _, b)) = find b
821 | find (t as _ $ _) = strip_comb t |>> find ||> maps find |> (op @)
822 | find f = if is_Free f andalso has_call f then [f] else [];
825 |> K |> nth_map sel_no |> AList.map_entry (op =) ctr
828 fun add_primcorec_ursive maybe_tac seq fixes specs of_specs lthy =
830 val (bs, mxs) = map_split (apfst fst) fixes;
831 val (arg_Ts, res_Ts) = map (strip_type o snd o fst #>> HOLogic.mk_tupleT) fixes |> split_list;
833 val fun_names = map Binding.name_of bs;
834 val basic_ctr_specss = map (basic_corec_specs_of lthy) res_Ts;
835 val has_call = exists_subterm (map (fst #>> Binding.name_of #> Free) fixes |> member (op =));
837 fold_map2 (dissect_coeqn lthy seq has_call fun_names basic_ctr_specss) (map snd specs)
842 map_filter (try (fn Sel x => x)) eqns_data
843 |> partition_eq ((op =) o pairself #fun_name)
844 |> fst o finds (fn (x, ({fun_name, ...} :: _)) => x = fun_name) fun_names
846 |> map2 (fold o find_corec_calls has_call) basic_ctr_specss
847 |> map2 (curry (op |>)) (map (map (fn {ctr, sels, ...} =>
848 (ctr, map (K []) sels))) basic_ctr_specss);
851 val _ = tracing ("callssss = " ^ @{make_string} callssss);
854 val ((n2m, corec_specs', _, coinduct_thm, strong_coinduct_thm, coinduct_thms,
855 strong_coinduct_thms), lthy') =
856 corec_specs_of bs arg_Ts res_Ts (get_indices fixes) callssss lthy;
857 val actual_nn = length bs;
858 val corec_specs = take actual_nn corec_specs'; (*###*)
859 val ctr_specss = map #ctr_specs corec_specs;
861 val disc_eqnss' = map_filter (try (fn Disc x => x)) eqns_data
862 |> partition_eq ((op =) o pairself #fun_name)
863 |> fst o finds (fn (x, ({fun_name, ...} :: _)) => x = fun_name) fun_names
864 |> map (sort ((op <) o pairself #ctr_no |> make_ord) o flat o snd);
865 val _ = disc_eqnss' |> map (fn x =>
866 let val d = duplicates ((op =) o pairself #ctr_no) x in null d orelse
867 primrec_error_eqns "excess discriminator formula in definition"
868 (maps (fn t => filter (equal (#ctr_no t) o #ctr_no) x) d |> map #user_eqn) end);
870 val sel_eqnss = map_filter (try (fn Sel x => x)) eqns_data
871 |> partition_eq ((op =) o pairself #fun_name)
872 |> fst o finds (fn (x, ({fun_name, ...} :: _)) => x = fun_name) fun_names
875 val arg_Tss = map (binder_types o snd o fst) fixes;
876 val disc_eqnss = map5 mk_real_disc_eqns bs arg_Tss corec_specs sel_eqnss disc_eqnss';
877 val (defs, exclss') =
878 build_codefs lthy' bs mxs has_call arg_Tss corec_specs disc_eqnss sel_eqnss;
880 fun excl_tac (c, c', a) =
881 if a orelse c = c' orelse seq then SOME (K (HEADGOAL (mk_primcorec_assumption_tac lthy [])))
885 val _ = tracing ("exclusiveness properties:\n \<cdot> " ^
886 space_implode "\n \<cdot> " (maps (map (Syntax.string_of_term lthy o snd)) exclss'));
889 val exclss'' = exclss' |> map (map (fn (idx, t) =>
890 (idx, (Option.map (Goal.prove lthy [] [] t #> Thm.close_derivation) (excl_tac idx), t))));
891 val taut_thmss = map (map (apsnd (the o fst)) o filter (is_some o fst o snd)) exclss'';
892 val (goal_idxss, goalss) = exclss''
893 |> map (map (apsnd (rpair [] o snd)) o filter (is_none o fst o snd))
894 |> split_list o map split_list;
896 fun prove thmss' def_thms' lthy =
898 val def_thms = map (snd o snd) def_thms';
900 val exclss' = map (op ~~) (goal_idxss ~~ thmss');
901 fun mk_exclsss excls n =
902 (excls, map (fn k => replicate k [TrueI] @ replicate (n - k) []) (0 upto n - 1))
903 |-> fold (fn ((c, c', _), thm) => nth_map c (nth_map c' (K [thm])));
904 val exclssss = (exclss' ~~ taut_thmss |> map (op @), fun_names ~~ corec_specs)
905 |-> map2 (fn excls => fn (_, {ctr_specs, ...}) => mk_exclsss excls (length ctr_specs));
907 fun prove_disc ({ctr_specs, ...} : corec_spec) exclsss
908 ({fun_name, fun_T, fun_args, ctr_no, prems, ...} : coeqn_data_disc) =
909 if Term.aconv_untyped (#disc (nth ctr_specs ctr_no), @{term "\<lambda>x. x = x"}) then [] else
911 val {disc_corec, ...} = nth ctr_specs ctr_no;
913 val m = length prems;
915 list_comb (Free (fun_name, fun_T), map Bound (length fun_args - 1 downto 0))
916 |> curry betapply (#disc (nth ctr_specs ctr_no)) (*###*)
917 |> HOLogic.mk_Trueprop
918 |> curry Logic.list_implies (map HOLogic.mk_Trueprop prems)
919 |> curry Logic.list_all (map dest_Free fun_args);
921 if prems = [@{term False}] then [] else
922 mk_primcorec_disc_tac lthy def_thms disc_corec k m exclsss
923 |> K |> Goal.prove lthy [] [] t
924 |> Thm.close_derivation
925 |> pair (#disc (nth ctr_specs ctr_no))
929 fun prove_sel ({nested_maps, nested_map_idents, nested_map_comps, ctr_specs, ...}
930 : corec_spec) (disc_eqns : coeqn_data_disc list) exclsss
931 ({fun_name, fun_T, fun_args, ctr, sel, rhs_term, ...} : coeqn_data_sel) =
933 val SOME ctr_spec = find_first (equal ctr o #ctr) ctr_specs;
934 val ctr_no = find_index (equal ctr o #ctr) ctr_specs;
935 val prems = the_default (maps (s_not_conj o #prems) disc_eqns)
936 (find_first (equal ctr_no o #ctr_no) disc_eqns |> Option.map #prems);
937 val sel_corec = find_index (equal sel) (#sels ctr_spec)
938 |> nth (#sel_corecs ctr_spec);
940 val m = length prems;
942 list_comb (Free (fun_name, fun_T), map Bound (length fun_args - 1 downto 0))
943 |> curry betapply sel
944 |> rpair (abstract (List.rev fun_args) rhs_term)
945 |> HOLogic.mk_Trueprop o HOLogic.mk_eq
946 |> curry Logic.list_implies (map HOLogic.mk_Trueprop prems)
947 |> curry Logic.list_all (map dest_Free fun_args);
948 val (distincts, _, sel_splits, sel_split_asms) = case_thms_of_term lthy [] rhs_term;
950 mk_primcorec_sel_tac lthy def_thms distincts sel_splits sel_split_asms nested_maps
951 nested_map_idents nested_map_comps sel_corec k m exclsss
952 |> K |> Goal.prove lthy [] [] t
953 |> Thm.close_derivation
957 fun prove_ctr disc_alist sel_alist (disc_eqns : coeqn_data_disc list)
958 (sel_eqns : coeqn_data_sel list) ({ctr, disc, sels, collapse, ...} : corec_ctr_spec) =
959 (* don't try to prove theorems when some sel_eqns are missing *)
960 if not (exists (equal ctr o #ctr) disc_eqns)
961 andalso not (exists (equal ctr o #ctr) sel_eqns)
963 filter (equal ctr o #ctr) sel_eqns
964 |> fst o finds ((op =) o apsnd #sel) sels
965 |> exists (null o snd)
968 val (fun_name, fun_T, fun_args, prems, maybe_rhs) =
969 (find_first (equal ctr o #ctr) disc_eqns, find_first (equal ctr o #ctr) sel_eqns)
970 |>> Option.map (fn x => (#fun_name x, #fun_T x, #fun_args x, #prems x,
972 ||> Option.map (fn x => (#fun_name x, #fun_T x, #fun_args x, [], NONE))
973 |> the o merge_options;
974 val m = length prems;
975 val t = (if is_some maybe_rhs then the maybe_rhs else
976 filter (equal ctr o #ctr) sel_eqns
977 |> fst o finds ((op =) o apsnd #sel) sels
978 |> map (snd #> (fn [x] => (List.rev (#fun_args x), #rhs_term x)) #-> abstract)
979 |> curry list_comb ctr)
980 |> curry HOLogic.mk_eq (list_comb (Free (fun_name, fun_T),
981 map Bound (length fun_args - 1 downto 0)))
982 |> HOLogic.mk_Trueprop
983 |> curry Logic.list_implies (map HOLogic.mk_Trueprop prems)
984 |> curry Logic.list_all (map dest_Free fun_args);
985 val maybe_disc_thm = AList.lookup (op =) disc_alist disc;
986 val sel_thms = map snd (filter (member (op =) sels o fst) sel_alist);
988 if prems = [@{term False}] then [] else
989 mk_primcorec_ctr_of_dtr_tac lthy m collapse maybe_disc_thm sel_thms
990 |> K |> Goal.prove lthy [] [] t
991 |> Thm.close_derivation
996 fun prove_code disc_eqns sel_eqns ctr_alist ctr_specs =
998 val (fun_name, fun_T, fun_args, maybe_rhs) =
999 (find_first (member (op =) (map #ctr ctr_specs) o #ctr) disc_eqns,
1000 find_first (member (op =) (map #ctr ctr_specs) o #ctr) sel_eqns)
1001 |>> Option.map (fn x => (#fun_name x, #fun_T x, #fun_args x, #maybe_code_rhs x))
1002 ||> Option.map (fn x => (#fun_name x, #fun_T x, #fun_args x, NONE))
1003 |> the o merge_options;
1005 val bound_Ts = List.rev (map fastype_of fun_args);
1007 val lhs = list_comb (Free (fun_name, fun_T), map Bound (length fun_args - 1 downto 0));
1008 val maybe_rhs_info =
1012 val raw_rhs = expand_corec_code_rhs lthy has_call bound_Ts rhs;
1014 fold_rev_corec_code_rhs lthy (K oo (cons oo pair)) bound_Ts raw_rhs [];
1015 val ctr_thms = map (the o AList.lookup (op =) ctr_alist o snd) cond_ctrs;
1016 in SOME (rhs, raw_rhs, ctr_thms) end
1019 fun prove_code_ctr {ctr, sels, ...} =
1020 if not (exists (equal ctr o fst) ctr_alist) then NONE else
1022 val prems = find_first (equal ctr o #ctr) disc_eqns
1023 |> Option.map #prems |> the_default [];
1025 filter (equal ctr o #ctr) sel_eqns
1026 |> fst o finds ((op =) o apsnd #sel) sels
1027 |> map (snd #> (fn [x] => (List.rev (#fun_args x), #rhs_term x))
1029 |> curry list_comb ctr;
1033 val maybe_ctr_conds_argss = map prove_code_ctr ctr_specs;
1035 if exists is_none maybe_ctr_conds_argss then NONE else
1037 val rhs = fold_rev (fn SOME (prems, u) => fn t => mk_If (s_conjs prems) u t)
1038 maybe_ctr_conds_argss
1039 (Const (@{const_name Code.abort}, @{typ String.literal} -->
1040 (@{typ unit} --> body_type fun_T) --> body_type fun_T) $
1041 HOLogic.mk_literal fun_name $
1042 absdummy @{typ unit} (incr_boundvars 1 lhs));
1043 in SOME (rhs, rhs, map snd ctr_alist) end
1046 (case maybe_rhs_info of
1048 | SOME (rhs, raw_rhs, ctr_thms) =>
1050 val ms = map (Logic.count_prems o prop_of) ctr_thms;
1051 val (raw_t, t) = (raw_rhs, rhs)
1053 (curry HOLogic.mk_eq (list_comb (Free (fun_name, fun_T),
1054 map Bound (length fun_args - 1 downto 0)))
1055 #> HOLogic.mk_Trueprop
1056 #> curry Logic.list_all (map dest_Free fun_args));
1057 val (distincts, discIs, sel_splits, sel_split_asms) =
1058 case_thms_of_term lthy bound_Ts raw_rhs;
1060 val raw_code_thm = mk_primcorec_raw_code_of_ctr_tac lthy distincts discIs sel_splits
1061 sel_split_asms ms ctr_thms
1062 |> K |> Goal.prove lthy [] [] raw_t
1063 |> Thm.close_derivation;
1065 mk_primcorec_code_of_raw_code_tac lthy distincts sel_splits raw_code_thm
1066 |> K |> Goal.prove lthy [] [] t
1067 |> Thm.close_derivation
1072 val disc_alists = map3 (maps oo prove_disc) corec_specs exclssss disc_eqnss;
1073 val sel_alists = map4 (map ooo prove_sel) corec_specs disc_eqnss exclssss sel_eqnss;
1074 val disc_thmss = map (map snd) disc_alists;
1075 val sel_thmss = map (map snd) sel_alists;
1077 val ctr_alists = map5 (maps oooo prove_ctr) disc_alists sel_alists disc_eqnss sel_eqnss
1079 val ctr_thmss = map (map snd) ctr_alists;
1081 val code_thmss = map4 prove_code disc_eqnss sel_eqnss ctr_alists ctr_specss;
1083 val simp_thmss = map2 append disc_thmss sel_thmss
1085 val common_name = mk_common_name fun_names;
1088 [(coinductN, map (if n2m then single else K []) coinduct_thms, []),
1089 (codeN, code_thmss, code_nitpicksimp_attrs),
1090 (ctrN, ctr_thmss, []),
1091 (discN, disc_thmss, simp_attrs),
1092 (selN, sel_thmss, simp_attrs),
1093 (simpsN, simp_thmss, []),
1094 (strong_coinductN, map (if n2m then single else K []) strong_coinduct_thms, [])]
1095 |> maps (fn (thmN, thmss, attrs) =>
1096 map2 (fn fun_name => fn thms =>
1097 ((Binding.qualify true fun_name (Binding.name thmN), attrs), [(thms, [])]))
1098 fun_names (take actual_nn thmss))
1099 |> filter_out (null o fst o hd o snd);
1102 [(coinductN, if n2m then [coinduct_thm] else [], []),
1103 (strong_coinductN, if n2m then [strong_coinduct_thm] else [], [])]
1104 |> filter_out (null o #2)
1105 |> map (fn (thmN, thms, attrs) =>
1106 ((Binding.qualify true common_name (Binding.name thmN), attrs), [(thms, [])]));
1108 lthy |> Local_Theory.notes (notes @ common_notes) |> snd
1111 fun after_qed thmss' = fold_map Local_Theory.define defs #-> prove thmss';
1113 (goalss, after_qed, lthy')
1116 fun add_primcorec_ursive_cmd maybe_tac seq (raw_fixes, raw_specs') lthy =
1118 val (raw_specs, of_specs) = split_list raw_specs' ||> map (Option.map (Syntax.read_term lthy));
1119 val ((fixes, specs), _) = Specification.read_spec raw_fixes raw_specs lthy;
1121 add_primcorec_ursive maybe_tac seq fixes specs of_specs lthy
1122 handle ERROR str => primrec_error str
1124 handle Primrec_Error (str, eqns) =>
1126 then error ("primcorec error:\n " ^ str)
1127 else error ("primcorec error:\n " ^ str ^ "\nin\n " ^
1128 space_implode "\n " (map (quote o Syntax.string_of_term lthy) eqns));
1130 val add_primcorecursive_cmd = (fn (goalss, after_qed, lthy) =>
1132 |> Proof.theorem NONE after_qed goalss
1133 |> Proof.refine (Method.primitive_text I)
1134 |> Seq.hd) ooo add_primcorec_ursive_cmd NONE;
1136 val add_primcorec_cmd = (fn (goalss, after_qed, lthy) =>
1138 |> after_qed (map (fn [] => []
1139 | _ => primrec_error "need exclusiveness proofs - use primcorecursive instead of primcorec")
1140 goalss)) ooo add_primcorec_ursive_cmd (SOME (fn {context = ctxt, ...} => auto_tac ctxt));