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