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