src/HOL/BNF/Tools/bnf_fp_rec_sugar.ML
author blanchet
Mon Sep 23 10:38:23 2013 +0200 (2013-09-23)
changeset 53794 af7d1533a25b
parent 53793 d2f8bca22a51
child 53795 dfa1108368ad
permissions -rw-r--r--
undid copy-paste
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
blanchet@53303
    10
  val add_primrec_cmd: (binding * string option * mixfix) list ->
blanchet@53303
    11
    (Attrib.binding * string) list -> local_theory -> local_theory;
blanchet@53753
    12
  val add_primcorecursive_cmd: bool ->
blanchet@53310
    13
    (binding * string option * mixfix) list * (Attrib.binding * string) list -> Proof.context ->
blanchet@53310
    14
    Proof.state
blanchet@53303
    15
end;
blanchet@53303
    16
blanchet@53303
    17
structure BNF_FP_Rec_Sugar : BNF_FP_REC_SUGAR =
blanchet@53303
    18
struct
blanchet@53303
    19
blanchet@53303
    20
open BNF_Util
blanchet@53303
    21
open BNF_FP_Util
blanchet@53303
    22
open BNF_FP_Rec_Sugar_Util
blanchet@53303
    23
open BNF_FP_Rec_Sugar_Tactics
blanchet@53303
    24
blanchet@53791
    25
val ctrN = "ctr"
blanchet@53791
    26
val discN = "disc"
blanchet@53791
    27
val selN = "sel"
blanchet@53791
    28
blanchet@53794
    29
val simp_attrs = @{attributes [simp]};
blanchet@53794
    30
blanchet@53303
    31
exception Primrec_Error of string * term list;
blanchet@53303
    32
blanchet@53303
    33
fun primrec_error str = raise Primrec_Error (str, []);
blanchet@53303
    34
fun primrec_error_eqn str eqn = raise Primrec_Error (str, [eqn]);
blanchet@53303
    35
fun primrec_error_eqns str eqns = raise Primrec_Error (str, eqns);
blanchet@53303
    36
panny@53358
    37
fun finds eq = fold_map (fn x => List.partition (curry eq x) #>> pair x);
panny@53358
    38
panny@53357
    39
val free_name = try (fn Free (v, _) => v);
panny@53357
    40
val const_name = try (fn Const (v, _) => v);
panny@53358
    41
val undef_const = Const (@{const_name undefined}, dummyT);
panny@53357
    42
panny@53358
    43
fun permute_args n t = list_comb (t, map Bound (0 :: (n downto 1)))
panny@53720
    44
  |> fold (K (Term.abs (Name.uu, dummyT))) (0 upto n);
panny@53401
    45
val abs_tuple = HOLogic.tupled_lambda o HOLogic.mk_tuple;
panny@53654
    46
fun drop_All t = subst_bounds (strip_qnt_vars @{const_name all} t |> map Free |> rev,
panny@53654
    47
  strip_qnt_body @{const_name all} t)
blanchet@53793
    48
fun s_not @{const True} = @{const False}
blanchet@53793
    49
  | s_not @{const False} = @{const True}
blanchet@53793
    50
  | s_not (@{const Not} $ t) = t
blanchet@53793
    51
  | s_not (@{const Trueprop} $ t) = @{const Trueprop} $ s_not t
blanchet@53793
    52
  | s_not t = HOLogic.mk_not t
panny@53654
    53
val mk_conjs = try (foldr1 HOLogic.mk_conj) #> the_default @{const True};
panny@53654
    54
val mk_disjs = try (foldr1 HOLogic.mk_disj) #> the_default @{const False};
blanchet@53793
    55
fun invert_prems [t] = map s_not (HOLogic.disjuncts t)
blanchet@53793
    56
  | invert_prems ts = [mk_disjs (map s_not ts)];
blanchet@53793
    57
fun invert_prems_disj [t] = map s_not (HOLogic.disjuncts t)
blanchet@53793
    58
  | invert_prems_disj ts = [mk_disjs (map (mk_conjs o map s_not o HOLogic.disjuncts) ts)];
panny@53720
    59
fun abstract vs =
panny@53720
    60
  let fun a n (t $ u) = a n t $ a n u
panny@53720
    61
        | a n (Abs (v, T, b)) = Abs (v, T, a (n + 1) b)
panny@53720
    62
        | a n t = let val idx = find_index (equal t) vs in
panny@53720
    63
            if idx < 0 then t else Bound (n + idx) end
panny@53720
    64
  in a 0 end;
panny@53735
    65
fun mk_prod1 Ts (t, u) = HOLogic.pair_const (fastype_of1 (Ts, t)) (fastype_of1 (Ts, u)) $ t $ u;
panny@53735
    66
fun mk_tuple1 Ts = the_default HOLogic.unit o try (foldr1 (mk_prod1 Ts));
blanchet@53303
    67
blanchet@53794
    68
fun get_indices fixes t = map (fst #>> Binding.name_of #> Free) fixes
blanchet@53794
    69
  |> map_index (fn (i, v) => if exists_subterm (equal v) t then SOME i else NONE)
blanchet@53794
    70
  |> map_filter I;
blanchet@53303
    71
blanchet@53310
    72
blanchet@53310
    73
(* Primrec *)
blanchet@53310
    74
blanchet@53303
    75
type eqn_data = {
blanchet@53303
    76
  fun_name: string,
blanchet@53303
    77
  rec_type: typ,
blanchet@53303
    78
  ctr: term,
blanchet@53303
    79
  ctr_args: term list,
blanchet@53303
    80
  left_args: term list,
blanchet@53303
    81
  right_args: term list,
blanchet@53303
    82
  res_type: typ,
blanchet@53303
    83
  rhs_term: term,
blanchet@53303
    84
  user_eqn: term
blanchet@53303
    85
};
blanchet@53303
    86
blanchet@53303
    87
fun dissect_eqn lthy fun_names eqn' =
blanchet@53303
    88
  let
panny@53654
    89
    val eqn = drop_All eqn' |> HOLogic.dest_Trueprop
panny@53654
    90
      handle TERM _ =>
panny@53654
    91
        primrec_error_eqn "malformed function equation (expected \"lhs = rhs\")" eqn';
blanchet@53303
    92
    val (lhs, rhs) = HOLogic.dest_eq eqn
blanchet@53303
    93
        handle TERM _ =>
blanchet@53303
    94
          primrec_error_eqn "malformed function equation (expected \"lhs = rhs\")" eqn';
blanchet@53303
    95
    val (fun_name, args) = strip_comb lhs
blanchet@53303
    96
      |>> (fn x => if is_Free x then fst (dest_Free x)
blanchet@53303
    97
          else primrec_error_eqn "malformed function equation (does not start with free)" eqn);
blanchet@53303
    98
    val (left_args, rest) = take_prefix is_Free args;
blanchet@53303
    99
    val (nonfrees, right_args) = take_suffix is_Free rest;
blanchet@53303
   100
    val _ = length nonfrees = 1 orelse if length nonfrees = 0 then
blanchet@53303
   101
      primrec_error_eqn "constructor pattern missing in left-hand side" eqn else
blanchet@53303
   102
      primrec_error_eqn "more than one non-variable argument in left-hand side" eqn;
blanchet@53303
   103
    val _ = member (op =) fun_names fun_name orelse
blanchet@53303
   104
      primrec_error_eqn "malformed function equation (does not start with function name)" eqn
blanchet@53303
   105
blanchet@53303
   106
    val (ctr, ctr_args) = strip_comb (the_single nonfrees);
blanchet@53303
   107
    val _ = try (num_binder_types o fastype_of) ctr = SOME (length ctr_args) orelse
blanchet@53303
   108
      primrec_error_eqn "partially applied constructor in pattern" eqn;
blanchet@53303
   109
    val _ = let val d = duplicates (op =) (left_args @ ctr_args @ right_args) in null d orelse
blanchet@53303
   110
      primrec_error_eqn ("duplicate variable \"" ^ Syntax.string_of_term lthy (hd d) ^
blanchet@53303
   111
        "\" in left-hand side") eqn end;
blanchet@53303
   112
    val _ = forall is_Free ctr_args orelse
blanchet@53303
   113
      primrec_error_eqn "non-primitive pattern in left-hand side" eqn;
blanchet@53303
   114
    val _ =
blanchet@53303
   115
      let val b = fold_aterms (fn x as Free (v, _) =>
blanchet@53303
   116
        if (not (member (op =) (left_args @ ctr_args @ right_args) x) andalso
blanchet@53303
   117
        not (member (op =) fun_names v) andalso
blanchet@53303
   118
        not (Variable.is_fixed lthy v)) then cons x else I | _ => I) rhs []
blanchet@53303
   119
      in
blanchet@53303
   120
        null b orelse
blanchet@53303
   121
        primrec_error_eqn ("extra variable(s) in right-hand side: " ^
blanchet@53303
   122
          commas (map (Syntax.string_of_term lthy) b)) eqn
blanchet@53303
   123
      end;
blanchet@53303
   124
  in
blanchet@53303
   125
    {fun_name = fun_name,
blanchet@53303
   126
     rec_type = body_type (type_of ctr),
blanchet@53303
   127
     ctr = ctr,
blanchet@53303
   128
     ctr_args = ctr_args,
blanchet@53303
   129
     left_args = left_args,
blanchet@53303
   130
     right_args = right_args,
blanchet@53303
   131
     res_type = map fastype_of (left_args @ right_args) ---> fastype_of rhs,
blanchet@53303
   132
     rhs_term = rhs,
blanchet@53303
   133
     user_eqn = eqn'}
blanchet@53303
   134
  end;
blanchet@53303
   135
panny@53401
   136
fun rewrite_map_arg get_ctr_pos rec_type res_type =
blanchet@53303
   137
  let
panny@53357
   138
    val pT = HOLogic.mk_prodT (rec_type, res_type);
blanchet@53303
   139
panny@53357
   140
    val maybe_suc = Option.map (fn x => x + 1);
panny@53357
   141
    fun subst d (t as Bound d') = t |> d = SOME d' ? curry (op $) (fst_const pT)
panny@53357
   142
      | subst d (Abs (v, T, b)) = Abs (v, if d = SOME ~1 then pT else T, subst (maybe_suc d) b)
panny@53357
   143
      | subst d t =
panny@53358
   144
        let
panny@53358
   145
          val (u, vs) = strip_comb t;
panny@53401
   146
          val ctr_pos = try (get_ctr_pos o the) (free_name u) |> the_default ~1;
panny@53358
   147
        in
panny@53401
   148
          if ctr_pos >= 0 then
panny@53357
   149
            if d = SOME ~1 andalso length vs = ctr_pos then
panny@53357
   150
              list_comb (permute_args ctr_pos (snd_const pT), vs)
panny@53357
   151
            else if length vs > ctr_pos andalso is_some d
panny@53357
   152
                andalso d = try (fn Bound n => n) (nth vs ctr_pos) then
panny@53357
   153
              list_comb (snd_const pT $ nth vs ctr_pos, map (subst d) (nth_drop ctr_pos vs))
blanchet@53303
   154
            else
panny@53357
   155
              primrec_error_eqn ("recursive call not directly applied to constructor argument") t
panny@53357
   156
          else if d = SOME ~1 andalso const_name u = SOME @{const_name comp} then
panny@53357
   157
            list_comb (map_types (K dummyT) u, map2 subst [NONE, d] vs)
blanchet@53303
   158
          else
panny@53357
   159
            list_comb (u, map (subst (d |> d = SOME ~1 ? K NONE)) vs)
blanchet@53303
   160
        end
blanchet@53303
   161
  in
panny@53357
   162
    subst (SOME ~1)
blanchet@53303
   163
  end;
blanchet@53303
   164
panny@53401
   165
fun subst_rec_calls lthy get_ctr_pos has_call ctr_args direct_calls indirect_calls t =
blanchet@53303
   166
  let
panny@53350
   167
    fun subst bound_Ts (Abs (v, T, b)) = Abs (v, T, subst (T :: bound_Ts) b)
panny@53358
   168
      | subst bound_Ts (t as g' $ y) =
blanchet@53303
   169
        let
panny@53350
   170
          val maybe_direct_y' = AList.lookup (op =) direct_calls y;
panny@53350
   171
          val maybe_indirect_y' = AList.lookup (op =) indirect_calls y;
panny@53358
   172
          val (g, g_args) = strip_comb g';
panny@53401
   173
          val ctr_pos = try (get_ctr_pos o the) (free_name g) |> the_default ~1;
panny@53401
   174
          val _ = ctr_pos < 0 orelse length g_args >= ctr_pos orelse
panny@53358
   175
            primrec_error_eqn "too few arguments in recursive call" t;
blanchet@53303
   176
        in
panny@53358
   177
          if not (member (op =) ctr_args y) then
panny@53358
   178
            pairself (subst bound_Ts) (g', y) |> (op $)
panny@53401
   179
          else if ctr_pos >= 0 then
panny@53358
   180
            list_comb (the maybe_direct_y', g_args)
panny@53350
   181
          else if is_some maybe_indirect_y' then
panny@53358
   182
            (if has_call g' then t else y)
panny@53358
   183
            |> massage_indirect_rec_call lthy has_call
panny@53401
   184
              (rewrite_map_arg get_ctr_pos) bound_Ts y (the maybe_indirect_y')
panny@53358
   185
            |> (if has_call g' then I else curry (op $) g')
blanchet@53303
   186
          else
panny@53350
   187
            t
blanchet@53303
   188
        end
panny@53350
   189
      | subst _ t = t
panny@53350
   190
  in
panny@53350
   191
    subst [] t
panny@53358
   192
    |> tap (fn u => has_call u andalso (* FIXME detect this case earlier *)
panny@53358
   193
      primrec_error_eqn "recursive call not directly applied to constructor argument" t)
panny@53350
   194
  end;
blanchet@53303
   195
panny@53358
   196
fun build_rec_arg lthy funs_data has_call ctr_spec maybe_eqn_data =
panny@53358
   197
  if is_none maybe_eqn_data then undef_const else
blanchet@53303
   198
    let
blanchet@53303
   199
      val eqn_data = the maybe_eqn_data;
blanchet@53303
   200
      val t = #rhs_term eqn_data;
blanchet@53303
   201
      val ctr_args = #ctr_args eqn_data;
blanchet@53303
   202
blanchet@53303
   203
      val calls = #calls ctr_spec;
blanchet@53303
   204
      val n_args = fold (curry (op +) o (fn Direct_Rec _ => 2 | _ => 1)) calls 0;
blanchet@53303
   205
blanchet@53303
   206
      val no_calls' = tag_list 0 calls
blanchet@53303
   207
        |> map_filter (try (apsnd (fn No_Rec n => n | Direct_Rec (n, _) => n)));
blanchet@53303
   208
      val direct_calls' = tag_list 0 calls
blanchet@53303
   209
        |> map_filter (try (apsnd (fn Direct_Rec (_, n) => n)));
blanchet@53303
   210
      val indirect_calls' = tag_list 0 calls
blanchet@53303
   211
        |> map_filter (try (apsnd (fn Indirect_Rec n => n)));
blanchet@53303
   212
blanchet@53303
   213
      fun make_direct_type T = dummyT; (* FIXME? *)
blanchet@53303
   214
blanchet@53303
   215
      val rec_res_type_list = map (fn (x :: _) => (#rec_type x, #res_type x)) funs_data;
blanchet@53303
   216
blanchet@53303
   217
      fun make_indirect_type (Type (Tname, Ts)) = Type (Tname, Ts |> map (fn T =>
blanchet@53303
   218
        let val maybe_res_type = AList.lookup (op =) rec_res_type_list T in
blanchet@53303
   219
          if is_some maybe_res_type
blanchet@53303
   220
          then HOLogic.mk_prodT (T, the maybe_res_type)
blanchet@53303
   221
          else make_indirect_type T end))
blanchet@53303
   222
        | make_indirect_type T = T;
blanchet@53303
   223
blanchet@53303
   224
      val args = replicate n_args ("", dummyT)
blanchet@53303
   225
        |> Term.rename_wrt_term t
blanchet@53303
   226
        |> map Free
blanchet@53303
   227
        |> fold (fn (ctr_arg_idx, arg_idx) =>
blanchet@53303
   228
            nth_map arg_idx (K (nth ctr_args ctr_arg_idx)))
blanchet@53303
   229
          no_calls'
blanchet@53303
   230
        |> fold (fn (ctr_arg_idx, arg_idx) =>
blanchet@53303
   231
            nth_map arg_idx (K (nth ctr_args ctr_arg_idx |> map_types make_direct_type)))
blanchet@53303
   232
          direct_calls'
blanchet@53303
   233
        |> fold (fn (ctr_arg_idx, arg_idx) =>
blanchet@53303
   234
            nth_map arg_idx (K (nth ctr_args ctr_arg_idx |> map_types make_indirect_type)))
blanchet@53303
   235
          indirect_calls';
blanchet@53303
   236
panny@53401
   237
      val fun_name_ctr_pos_list =
panny@53401
   238
        map (fn (x :: _) => (#fun_name x, length (#left_args x))) funs_data;
panny@53401
   239
      val get_ctr_pos = try (the o AList.lookup (op =) fun_name_ctr_pos_list) #> the_default ~1;
blanchet@53303
   240
      val direct_calls = map (apfst (nth ctr_args) o apsnd (nth args)) direct_calls';
blanchet@53303
   241
      val indirect_calls = map (apfst (nth ctr_args) o apsnd (nth args)) indirect_calls';
blanchet@53303
   242
panny@53401
   243
      val abstractions = args @ #left_args eqn_data @ #right_args eqn_data;
blanchet@53303
   244
    in
panny@53350
   245
      t
panny@53401
   246
      |> subst_rec_calls lthy get_ctr_pos has_call ctr_args direct_calls indirect_calls
panny@53401
   247
      |> fold_rev lambda abstractions
panny@53350
   248
    end;
blanchet@53303
   249
panny@53358
   250
fun build_defs lthy bs mxs funs_data rec_specs has_call =
blanchet@53303
   251
  let
blanchet@53303
   252
    val n_funs = length funs_data;
blanchet@53303
   253
blanchet@53303
   254
    val ctr_spec_eqn_data_list' =
blanchet@53303
   255
      (take n_funs rec_specs |> map #ctr_specs) ~~ funs_data
blanchet@53303
   256
      |> maps (uncurry (finds (fn (x, y) => #ctr x = #ctr y))
blanchet@53303
   257
          ##> (fn x => null x orelse
blanchet@53303
   258
            primrec_error_eqns "excess equations in definition" (map #rhs_term x)) #> fst);
blanchet@53303
   259
    val _ = ctr_spec_eqn_data_list' |> map (fn (_, x) => length x <= 1 orelse
blanchet@53303
   260
      primrec_error_eqns ("multiple equations for constructor") (map #user_eqn x));
blanchet@53303
   261
blanchet@53303
   262
    val ctr_spec_eqn_data_list =
blanchet@53303
   263
      ctr_spec_eqn_data_list' @ (drop n_funs rec_specs |> maps #ctr_specs |> map (rpair []));
blanchet@53303
   264
blanchet@53303
   265
    val recs = take n_funs rec_specs |> map #recx;
blanchet@53303
   266
    val rec_args = ctr_spec_eqn_data_list
blanchet@53303
   267
      |> sort ((op <) o pairself (#offset o fst) |> make_ord)
panny@53358
   268
      |> map (uncurry (build_rec_arg lthy funs_data has_call) o apsnd (try the_single));
blanchet@53303
   269
    val ctr_poss = map (fn x =>
blanchet@53303
   270
      if length (distinct ((op =) o pairself (length o #left_args)) x) <> 1 then
blanchet@53303
   271
        primrec_error ("inconstant constructor pattern position for function " ^
blanchet@53303
   272
          quote (#fun_name (hd x)))
blanchet@53303
   273
      else
blanchet@53303
   274
        hd x |> #left_args |> length) funs_data;
blanchet@53303
   275
  in
blanchet@53303
   276
    (recs, ctr_poss)
blanchet@53303
   277
    |-> map2 (fn recx => fn ctr_pos => list_comb (recx, rec_args) |> permute_args ctr_pos)
blanchet@53303
   278
    |> Syntax.check_terms lthy
traytel@53352
   279
    |> map3 (fn b => fn mx => fn t => ((b, mx), ((Binding.map_name Thm.def_name b, []), t))) bs mxs
blanchet@53303
   280
  end;
blanchet@53303
   281
panny@53358
   282
fun find_rec_calls has_call eqn_data =
blanchet@53303
   283
  let
blanchet@53303
   284
    fun find (Abs (_, _, b)) ctr_arg = find b ctr_arg
blanchet@53303
   285
      | find (t as _ $ _) ctr_arg =
blanchet@53303
   286
        let
blanchet@53303
   287
          val (f', args') = strip_comb t;
blanchet@53303
   288
          val n = find_index (equal ctr_arg) args';
blanchet@53303
   289
        in
blanchet@53303
   290
          if n < 0 then
blanchet@53303
   291
            find f' ctr_arg @ maps (fn x => find x ctr_arg) args'
blanchet@53303
   292
          else
blanchet@53303
   293
            let val (f, args) = chop n args' |>> curry list_comb f' in
panny@53358
   294
              if has_call f then
blanchet@53303
   295
                f :: maps (fn x => find x ctr_arg) args
blanchet@53303
   296
              else
blanchet@53303
   297
                find f ctr_arg @ maps (fn x => find x ctr_arg) args
blanchet@53303
   298
            end
blanchet@53303
   299
        end
blanchet@53303
   300
      | find _ _ = [];
blanchet@53303
   301
  in
blanchet@53303
   302
    map (find (#rhs_term eqn_data)) (#ctr_args eqn_data)
blanchet@53303
   303
    |> (fn [] => NONE | callss => SOME (#ctr eqn_data, callss))
blanchet@53303
   304
  end;
blanchet@53303
   305
blanchet@53303
   306
fun add_primrec fixes specs lthy =
blanchet@53303
   307
  let
traytel@53352
   308
    val (bs, mxs) = map_split (apfst fst) fixes;
blanchet@53303
   309
    val fun_names = map Binding.name_of bs;
blanchet@53303
   310
    val eqns_data = map (snd #> dissect_eqn lthy fun_names) specs;
blanchet@53303
   311
    val funs_data = eqns_data
blanchet@53303
   312
      |> partition_eq ((op =) o pairself #fun_name)
blanchet@53303
   313
      |> finds (fn (x, y) => x = #fun_name (hd y)) fun_names |> fst
blanchet@53303
   314
      |> map (fn (x, y) => the_single y handle List.Empty =>
blanchet@53303
   315
          primrec_error ("missing equations for function " ^ quote x));
blanchet@53303
   316
panny@53358
   317
    val has_call = exists_subterm (map (fst #>> Binding.name_of #> Free) fixes |> member (op =));
blanchet@53303
   318
    val arg_Ts = map (#rec_type o hd) funs_data;
blanchet@53303
   319
    val res_Ts = map (#res_type o hd) funs_data;
blanchet@53303
   320
    val callssss = funs_data
blanchet@53303
   321
      |> map (partition_eq ((op =) o pairself #ctr))
panny@53358
   322
      |> map (maps (map_filter (find_rec_calls has_call)));
blanchet@53303
   323
blanchet@53303
   324
    val ((nontriv, rec_specs, _, induct_thm, induct_thms), lthy') =
blanchet@53794
   325
      rec_specs_of bs arg_Ts res_Ts (get_indices fixes) callssss lthy;
blanchet@53303
   326
blanchet@53303
   327
    val actual_nn = length funs_data;
blanchet@53303
   328
blanchet@53303
   329
    val _ = let val ctrs = (maps (map #ctr o #ctr_specs) rec_specs) in
blanchet@53303
   330
      map (fn {ctr, user_eqn, ...} => member (op =) ctrs ctr orelse
blanchet@53303
   331
        primrec_error_eqn ("argument " ^ quote (Syntax.string_of_term lthy' ctr) ^
blanchet@53303
   332
          " is not a constructor in left-hand side") user_eqn) eqns_data end;
blanchet@53303
   333
panny@53358
   334
    val defs = build_defs lthy' bs mxs funs_data rec_specs has_call;
blanchet@53303
   335
blanchet@53329
   336
    fun prove def_thms' {ctr_specs, nested_map_idents, nested_map_comps, ...} induct_thm fun_data
blanchet@53303
   337
        lthy =
blanchet@53303
   338
      let
blanchet@53303
   339
        val fun_name = #fun_name (hd fun_data);
blanchet@53303
   340
        val def_thms = map (snd o snd) def_thms';
blanchet@53303
   341
        val simp_thms = finds (fn (x, y) => #ctr x = #ctr y) fun_data ctr_specs
blanchet@53303
   342
          |> fst
blanchet@53303
   343
          |> map_filter (try (fn (x, [y]) =>
blanchet@53303
   344
            (#user_eqn x, length (#left_args x) + length (#right_args x), #rec_thm y)))
blanchet@53303
   345
          |> map (fn (user_eqn, num_extra_args, rec_thm) =>
blanchet@53329
   346
            mk_primrec_tac lthy num_extra_args nested_map_idents nested_map_comps def_thms rec_thm
blanchet@53303
   347
            |> K |> Goal.prove lthy [] [] user_eqn)
blanchet@53303
   348
blanchet@53303
   349
        val notes =
blanchet@53303
   350
          [(inductN, if actual_nn > 1 then [induct_thm] else [], []),
blanchet@53303
   351
           (simpsN, simp_thms, simp_attrs)]
blanchet@53303
   352
          |> filter_out (null o #2)
blanchet@53303
   353
          |> map (fn (thmN, thms, attrs) =>
blanchet@53303
   354
            ((Binding.qualify true fun_name (Binding.name thmN), attrs), [(thms, [])]));
blanchet@53303
   355
      in
blanchet@53303
   356
        lthy |> Local_Theory.notes notes
blanchet@53303
   357
      end;
blanchet@53303
   358
blanchet@53303
   359
    val common_name = mk_common_name fun_names;
blanchet@53303
   360
blanchet@53303
   361
    val common_notes =
blanchet@53303
   362
      [(inductN, if nontriv andalso actual_nn > 1 then [induct_thm] else [], [])]
blanchet@53303
   363
      |> filter_out (null o #2)
blanchet@53303
   364
      |> map (fn (thmN, thms, attrs) =>
blanchet@53303
   365
        ((Binding.qualify true common_name (Binding.name thmN), attrs), [(thms, [])]));
blanchet@53303
   366
  in
blanchet@53303
   367
    lthy'
blanchet@53303
   368
    |> fold_map Local_Theory.define defs
panny@53654
   369
    |-> snd oo (fn def_thms' => fold_map3 (prove def_thms') (take actual_nn rec_specs)
blanchet@53303
   370
      (take actual_nn induct_thms) funs_data)
panny@53654
   371
    |> snd o Local_Theory.notes common_notes
blanchet@53303
   372
  end;
blanchet@53303
   373
blanchet@53303
   374
fun add_primrec_cmd raw_fixes raw_specs lthy =
blanchet@53303
   375
  let
blanchet@53303
   376
    val _ = let val d = duplicates (op =) (map (Binding.name_of o #1) raw_fixes) in null d orelse
blanchet@53303
   377
      primrec_error ("duplicate function name(s): " ^ commas d) end;
blanchet@53303
   378
    val (fixes, specs) = fst (Specification.read_spec raw_fixes raw_specs lthy);
blanchet@53303
   379
  in
blanchet@53303
   380
    add_primrec fixes specs lthy
blanchet@53303
   381
      handle ERROR str => primrec_error str
blanchet@53303
   382
  end
blanchet@53303
   383
  handle Primrec_Error (str, eqns) =>
blanchet@53303
   384
    if null eqns
blanchet@53303
   385
    then error ("primrec_new error:\n  " ^ str)
blanchet@53303
   386
    else error ("primrec_new error:\n  " ^ str ^ "\nin\n  " ^
blanchet@53303
   387
      space_implode "\n  " (map (quote o Syntax.string_of_term lthy) eqns))
blanchet@53303
   388
blanchet@53303
   389
blanchet@53303
   390
blanchet@53310
   391
(* Primcorec *)
blanchet@53303
   392
panny@53341
   393
type co_eqn_data_disc = {
blanchet@53303
   394
  fun_name: string,
panny@53720
   395
  fun_T: typ,
panny@53401
   396
  fun_args: term list,
panny@53720
   397
  ctr: term,
panny@53341
   398
  ctr_no: int, (*###*)
panny@53720
   399
  disc: term,
panny@53654
   400
  prems: term list,
blanchet@53303
   401
  user_eqn: term
blanchet@53303
   402
};
panny@53341
   403
type co_eqn_data_sel = {
blanchet@53303
   404
  fun_name: string,
panny@53720
   405
  fun_T: typ,
panny@53401
   406
  fun_args: term list,
panny@53341
   407
  ctr: term,
panny@53341
   408
  sel: term,
blanchet@53303
   409
  rhs_term: term,
blanchet@53303
   410
  user_eqn: term
blanchet@53303
   411
};
blanchet@53303
   412
datatype co_eqn_data =
panny@53341
   413
  Disc of co_eqn_data_disc |
panny@53341
   414
  Sel of co_eqn_data_sel;
blanchet@53303
   415
panny@53720
   416
fun co_dissect_eqn_disc sequential fun_names corec_specs prems' concl matchedsss =
blanchet@53303
   417
  let
blanchet@53303
   418
    fun find_subterm p = let (* FIXME \<exists>? *)
panny@53401
   419
      fun f (t as u $ v) = if p t then SOME t else merge_options (f u, f v)
blanchet@53303
   420
        | f t = if p t then SOME t else NONE
blanchet@53303
   421
      in f end;
blanchet@53303
   422
panny@53654
   423
    val applied_fun = concl
panny@53654
   424
      |> find_subterm (member ((op =) o apsnd SOME) fun_names o try (fst o dest_Free o head_of))
panny@53654
   425
      |> the
panny@53654
   426
      handle Option.Option => primrec_error_eqn "malformed discriminator equation" concl;
panny@53720
   427
    val ((fun_name, fun_T), fun_args) = strip_comb applied_fun |>> dest_Free;
panny@53720
   428
    val {ctr_specs, ...} = the (AList.lookup (op =) (fun_names ~~ corec_specs) fun_name);
blanchet@53303
   429
panny@53720
   430
    val discs = map #disc ctr_specs;
panny@53720
   431
    val ctrs = map #ctr ctr_specs;
panny@53654
   432
    val not_disc = head_of concl = @{term Not};
panny@53401
   433
    val _ = not_disc andalso length ctrs <> 2 andalso
panny@53654
   434
      primrec_error_eqn "\<not>ed discriminator for a type with \<noteq> 2 constructors" concl;
panny@53654
   435
    val disc = find_subterm (member (op =) discs o head_of) concl;
panny@53654
   436
    val eq_ctr0 = concl |> perhaps (try (HOLogic.dest_not)) |> try (HOLogic.dest_eq #> snd)
blanchet@53303
   437
        |> (fn SOME t => let val n = find_index (equal t) ctrs in
blanchet@53303
   438
          if n >= 0 then SOME n else NONE end | _ => NONE);
blanchet@53303
   439
    val _ = is_some disc orelse is_some eq_ctr0 orelse
panny@53654
   440
      primrec_error_eqn "no discriminator in equation" concl;
blanchet@53303
   441
    val ctr_no' =
blanchet@53303
   442
      if is_none disc then the eq_ctr0 else find_index (equal (head_of (the disc))) discs;
blanchet@53303
   443
    val ctr_no = if not_disc then 1 - ctr_no' else ctr_no';
panny@53720
   444
    val ctr = #ctr (nth ctr_specs ctr_no);
panny@53654
   445
panny@53654
   446
    val catch_all = try (fst o dest_Free o the_single) prems' = SOME Name.uu_;
panny@53720
   447
    val matchedss = AList.lookup (op =) matchedsss fun_name |> the_default [];
panny@53720
   448
    val prems = map (abstract (List.rev fun_args)) prems';
panny@53720
   449
    val real_prems =
panny@53720
   450
      (if catch_all orelse sequential then maps invert_prems_disj matchedss else []) @
panny@53654
   451
      (if catch_all then [] else prems);
blanchet@53303
   452
panny@53720
   453
    val matchedsss' = AList.delete (op =) fun_name matchedsss
panny@53720
   454
      |> cons (fun_name, if sequential then matchedss @ [prems] else matchedss @ [real_prems]);
blanchet@53303
   455
panny@53654
   456
    val user_eqn =
panny@53720
   457
      (real_prems, betapply (#disc (nth ctr_specs ctr_no), applied_fun))
panny@53654
   458
      |>> map HOLogic.mk_Trueprop ||> HOLogic.mk_Trueprop
panny@53654
   459
      |> Logic.list_implies;
blanchet@53303
   460
  in
panny@53341
   461
    (Disc {
blanchet@53303
   462
      fun_name = fun_name,
panny@53720
   463
      fun_T = fun_T,
panny@53401
   464
      fun_args = fun_args,
panny@53720
   465
      ctr = ctr,
blanchet@53303
   466
      ctr_no = ctr_no,
panny@53720
   467
      disc = #disc (nth ctr_specs ctr_no),
panny@53654
   468
      prems = real_prems,
panny@53654
   469
      user_eqn = user_eqn
panny@53720
   470
    }, matchedsss')
blanchet@53303
   471
  end;
blanchet@53303
   472
panny@53654
   473
fun co_dissect_eqn_sel fun_names corec_specs eqn' eqn =
blanchet@53303
   474
  let
blanchet@53303
   475
    val (lhs, rhs) = HOLogic.dest_eq eqn
blanchet@53303
   476
      handle TERM _ =>
blanchet@53303
   477
        primrec_error_eqn "malformed function equation (expected \"lhs = rhs\")" eqn;
blanchet@53303
   478
    val sel = head_of lhs;
panny@53720
   479
    val ((fun_name, fun_T), fun_args) = dest_comb lhs |> snd |> strip_comb |> apfst dest_Free
blanchet@53303
   480
      handle TERM _ =>
blanchet@53303
   481
        primrec_error_eqn "malformed selector argument in left-hand side" eqn;
panny@53654
   482
    val corec_spec = the (AList.lookup (op =) (fun_names ~~ corec_specs) fun_name)
blanchet@53303
   483
      handle Option.Option => primrec_error_eqn "malformed selector argument in left-hand side" eqn;
panny@53341
   484
    val (ctr_spec, sel) = #ctr_specs corec_spec
blanchet@53303
   485
      |> the o get_index (try (the o find_first (equal sel) o #sels))
panny@53341
   486
      |>> nth (#ctr_specs corec_spec);
panny@53654
   487
    val user_eqn = drop_All eqn';
blanchet@53303
   488
  in
panny@53341
   489
    Sel {
blanchet@53303
   490
      fun_name = fun_name,
panny@53720
   491
      fun_T = fun_T,
panny@53401
   492
      fun_args = fun_args,
panny@53341
   493
      ctr = #ctr ctr_spec,
panny@53341
   494
      sel = sel,
blanchet@53303
   495
      rhs_term = rhs,
panny@53654
   496
      user_eqn = user_eqn
blanchet@53303
   497
    }
blanchet@53303
   498
  end;
blanchet@53303
   499
panny@53720
   500
fun co_dissect_eqn_ctr sequential fun_names corec_specs eqn' imp_prems imp_rhs matchedsss =
blanchet@53303
   501
  let 
blanchet@53303
   502
    val (lhs, rhs) = HOLogic.dest_eq imp_rhs;
blanchet@53303
   503
    val fun_name = head_of lhs |> fst o dest_Free;
panny@53720
   504
    val {ctr_specs, ...} = the (AList.lookup (op =) (fun_names ~~ corec_specs) fun_name);
blanchet@53303
   505
    val (ctr, ctr_args) = strip_comb rhs;
panny@53720
   506
    val {disc, sels, ...} = the (find_first (equal ctr o #ctr) ctr_specs)
blanchet@53303
   507
      handle Option.Option => primrec_error_eqn "not a constructor" ctr;
panny@53341
   508
panny@53720
   509
    val disc_imp_rhs = betapply (disc, lhs);
panny@53720
   510
    val (maybe_eqn_data_disc, matchedsss') = if length ctr_specs = 1
panny@53720
   511
      then (NONE, matchedsss)
panny@53341
   512
      else apfst SOME (co_dissect_eqn_disc
panny@53720
   513
          sequential fun_names corec_specs imp_prems disc_imp_rhs matchedsss);
blanchet@53303
   514
panny@53720
   515
    val sel_imp_rhss = (sels ~~ ctr_args)
blanchet@53303
   516
      |> map (fn (sel, ctr_arg) => HOLogic.mk_eq (betapply (sel, lhs), ctr_arg));
blanchet@53303
   517
panny@53360
   518
val _ = tracing ("reduced\n    " ^ Syntax.string_of_term @{context} imp_rhs ^ "\nto\n    \<cdot> " ^
panny@53341
   519
 (is_some maybe_eqn_data_disc ? K (Syntax.string_of_term @{context} disc_imp_rhs ^ "\n    \<cdot> ")) "" ^
blanchet@53303
   520
 space_implode "\n    \<cdot> " (map (Syntax.string_of_term @{context}) sel_imp_rhss));
blanchet@53303
   521
blanchet@53303
   522
    val eqns_data_sel =
panny@53654
   523
      map (co_dissect_eqn_sel fun_names corec_specs eqn') sel_imp_rhss;
blanchet@53303
   524
  in
panny@53720
   525
    (the_list maybe_eqn_data_disc @ eqns_data_sel, matchedsss')
blanchet@53303
   526
  end;
blanchet@53303
   527
panny@53720
   528
fun co_dissect_eqn sequential fun_names corec_specs eqn' matchedsss =
blanchet@53303
   529
  let
panny@53654
   530
    val eqn = drop_All eqn'
panny@53654
   531
      handle TERM _ => primrec_error_eqn "malformed function equation" eqn';
panny@53654
   532
    val (imp_prems, imp_rhs) = Logic.strip_horn eqn
panny@53341
   533
      |> apfst (map HOLogic.dest_Trueprop) o apsnd HOLogic.dest_Trueprop;
blanchet@53303
   534
blanchet@53303
   535
    val head = imp_rhs
blanchet@53303
   536
      |> perhaps (try HOLogic.dest_not) |> perhaps (try (fst o HOLogic.dest_eq))
blanchet@53303
   537
      |> head_of;
blanchet@53303
   538
blanchet@53303
   539
    val maybe_rhs = imp_rhs |> perhaps (try (HOLogic.dest_not)) |> try (snd o HOLogic.dest_eq);
blanchet@53303
   540
panny@53654
   541
    val discs = maps #ctr_specs corec_specs |> map #disc;
panny@53654
   542
    val sels = maps #ctr_specs corec_specs |> maps #sels;
panny@53654
   543
    val ctrs = maps #ctr_specs corec_specs |> map #ctr;
blanchet@53303
   544
  in
blanchet@53303
   545
    if member (op =) discs head orelse
blanchet@53303
   546
      is_some maybe_rhs andalso
blanchet@53303
   547
        member (op =) (filter (null o binder_types o fastype_of) ctrs) (the maybe_rhs) then
panny@53720
   548
      co_dissect_eqn_disc sequential fun_names corec_specs imp_prems imp_rhs matchedsss
blanchet@53303
   549
      |>> single
blanchet@53303
   550
    else if member (op =) sels head then
panny@53720
   551
      ([co_dissect_eqn_sel fun_names corec_specs eqn' imp_rhs], matchedsss)
blanchet@53303
   552
    else if is_Free head andalso member (op =) fun_names (fst (dest_Free head)) then
panny@53720
   553
      co_dissect_eqn_ctr sequential fun_names corec_specs eqn' imp_prems imp_rhs matchedsss
blanchet@53303
   554
    else
blanchet@53303
   555
      primrec_error_eqn "malformed function equation" eqn
blanchet@53303
   556
  end;
blanchet@53303
   557
panny@53654
   558
fun build_corec_arg_disc ctr_specs {fun_args, ctr_no, prems, ...} =
panny@53654
   559
  if is_none (#pred (nth ctr_specs ctr_no)) then I else
panny@53654
   560
    mk_conjs prems
panny@53654
   561
    |> curry subst_bounds (List.rev fun_args)
panny@53654
   562
    |> HOLogic.tupled_lambda (HOLogic.mk_tuple fun_args)
panny@53654
   563
    |> K |> nth_map (the (#pred (nth ctr_specs ctr_no)));
blanchet@53303
   564
panny@53720
   565
fun build_corec_arg_no_call sel_eqns sel =
panny@53720
   566
  find_first (equal sel o #sel) sel_eqns
panny@53720
   567
  |> try (fn SOME {fun_args, rhs_term, ...} => abs_tuple fun_args rhs_term)
panny@53720
   568
  |> the_default undef_const
panny@53411
   569
  |> K;
panny@53360
   570
panny@53735
   571
fun build_corec_args_direct_call lthy has_call sel_eqns sel =
panny@53360
   572
  let
panny@53411
   573
    val maybe_sel_eqn = find_first (equal sel o #sel) sel_eqns;
panny@53735
   574
    fun rewrite_q t = if has_call t then @{term False} else @{term True};
panny@53735
   575
    fun rewrite_g t = if has_call t then undef_const else t;
panny@53735
   576
    fun rewrite_h t = if has_call t then HOLogic.mk_tuple (snd (strip_comb t)) else undef_const;
panny@53735
   577
    fun massage _ NONE t = t
panny@53735
   578
      | massage f (SOME {fun_args, rhs_term, ...}) t =
panny@53735
   579
        massage_direct_corec_call lthy has_call f (range_type (fastype_of t)) rhs_term
panny@53735
   580
        |> abs_tuple fun_args;
panny@53360
   581
  in
panny@53735
   582
    (massage rewrite_q maybe_sel_eqn,
panny@53735
   583
     massage rewrite_g maybe_sel_eqn,
panny@53735
   584
     massage rewrite_h maybe_sel_eqn)
panny@53360
   585
  end;
panny@53360
   586
panny@53411
   587
fun build_corec_arg_indirect_call lthy has_call sel_eqns sel =
panny@53411
   588
  let
panny@53411
   589
    val maybe_sel_eqn = find_first (equal sel o #sel) sel_eqns;
panny@53735
   590
    fun rewrite bound_Ts U T (Abs (v, V, b)) = Abs (v, V, rewrite (V :: bound_Ts) U T b)
panny@53735
   591
      | rewrite bound_Ts U T (t as _ $ _) =
blanchet@53734
   592
        let val (u, vs) = strip_comb t in
blanchet@53734
   593
          if is_Free u andalso has_call u then
panny@53735
   594
            Inr_const U T $ mk_tuple1 bound_Ts vs
blanchet@53734
   595
          else if try (fst o dest_Const) u = SOME @{const_name prod_case} then
panny@53735
   596
            list_comb (map_types (K dummyT) u, map (rewrite bound_Ts U T) vs)
blanchet@53734
   597
          else
panny@53735
   598
            list_comb (rewrite bound_Ts U T u, map (rewrite bound_Ts U T) vs)
panny@53735
   599
        end
panny@53735
   600
      | rewrite _ U T t = if is_Free t andalso has_call t then Inr_const U T $ HOLogic.unit else t;
panny@53735
   601
    fun massage NONE t = t
panny@53735
   602
      | massage (SOME {fun_args, rhs_term, ...}) t =
panny@53735
   603
        massage_indirect_corec_call lthy has_call (rewrite []) []
panny@53735
   604
          (range_type (fastype_of t)) rhs_term
panny@53735
   605
        |> abs_tuple fun_args;
panny@53411
   606
  in
panny@53735
   607
    massage maybe_sel_eqn
panny@53411
   608
  end;
panny@53360
   609
panny@53360
   610
fun build_corec_args_sel lthy has_call all_sel_eqns ctr_spec =
panny@53341
   611
  let val sel_eqns = filter (equal (#ctr ctr_spec) o #ctr) all_sel_eqns in
panny@53341
   612
    if null sel_eqns then I else
panny@53341
   613
      let
panny@53341
   614
        val sel_call_list = #sels ctr_spec ~~ #calls ctr_spec;
panny@53341
   615
panny@53341
   616
        val no_calls' = map_filter (try (apsnd (fn No_Corec n => n))) sel_call_list;
panny@53341
   617
        val direct_calls' = map_filter (try (apsnd (fn Direct_Corec n => n))) sel_call_list;
panny@53341
   618
        val indirect_calls' = map_filter (try (apsnd (fn Indirect_Corec n => n))) sel_call_list;
panny@53341
   619
      in
panny@53360
   620
        I
panny@53735
   621
        #> fold (fn (sel, n) => nth_map n (build_corec_arg_no_call sel_eqns sel)) no_calls'
panny@53360
   622
        #> fold (fn (sel, (q, g, h)) =>
panny@53735
   623
          let val (fq, fg, fh) = build_corec_args_direct_call lthy has_call sel_eqns sel in
panny@53735
   624
            nth_map q fq o nth_map g fg o nth_map h fh end) direct_calls'
panny@53360
   625
        #> fold (fn (sel, n) => nth_map n
panny@53411
   626
          (build_corec_arg_indirect_call lthy has_call sel_eqns sel)) indirect_calls'
panny@53341
   627
      end
blanchet@53303
   628
  end;
blanchet@53303
   629
panny@53654
   630
fun co_build_defs lthy bs mxs has_call arg_Tss corec_specs disc_eqnss sel_eqnss =
panny@53654
   631
  let
panny@53654
   632
    val corec_specs' = take (length bs) corec_specs;
panny@53654
   633
    val corecs = map #corec corec_specs';
panny@53654
   634
    val ctr_specss = map #ctr_specs corec_specs';
panny@53360
   635
    val corec_args = hd corecs
panny@53360
   636
      |> fst o split_last o binder_types o fastype_of
panny@53360
   637
      |> map (Const o pair @{const_name undefined})
panny@53720
   638
      |> fold2 (fold o build_corec_arg_disc) ctr_specss disc_eqnss
panny@53360
   639
      |> fold2 (fold o build_corec_args_sel lthy has_call) sel_eqnss ctr_specss;
panny@53735
   640
    fun currys [] t = t
panny@53735
   641
      | currys Ts t = t $ mk_tuple1 (List.rev Ts) (map Bound (length Ts - 1 downto 0))
panny@53735
   642
          |> fold_rev (Term.abs o pair Name.uu) Ts;
panny@53401
   643
panny@53360
   644
val _ = tracing ("corecursor arguments:\n    \<cdot> " ^
panny@53411
   645
 space_implode "\n    \<cdot> " (map (Syntax.string_of_term lthy) corec_args));
blanchet@53303
   646
panny@53654
   647
    val exclss' =
panny@53720
   648
      disc_eqnss
panny@53654
   649
      |> map (map (fn {fun_args, ctr_no, prems, ...} => (fun_args, ctr_no, prems))
panny@53654
   650
        #> fst o (fn xs => fold_map (fn x => fn ys => ((x, ys), ys @ [x])) xs [])
panny@53654
   651
        #> maps (uncurry (map o pair)
blanchet@53793
   652
          #> map (fn ((fun_args, c, x), (_, c', y)) => ((c, c'), (x, s_not (mk_conjs y)))
panny@53654
   653
            ||> apfst (map HOLogic.mk_Trueprop) o apsnd HOLogic.mk_Trueprop
panny@53654
   654
            ||> Logic.list_implies
panny@53654
   655
            ||> curry Logic.list_all (map dest_Free fun_args))))
blanchet@53303
   656
  in
blanchet@53303
   657
    map (list_comb o rpair corec_args) corecs
blanchet@53303
   658
    |> map2 (fn Ts => fn t => if length Ts = 0 then t $ HOLogic.unit else t) arg_Tss
blanchet@53303
   659
    |> map2 currys arg_Tss
blanchet@53303
   660
    |> Syntax.check_terms lthy
traytel@53352
   661
    |> map3 (fn b => fn mx => fn t => ((b, mx), ((Binding.map_name Thm.def_name b, []), t))) bs mxs
panny@53654
   662
    |> rpair exclss'
blanchet@53303
   663
  end;
blanchet@53303
   664
panny@53722
   665
fun mk_real_disc_eqns fun_binding arg_Ts {ctr_specs, ...} sel_eqns disc_eqns =
panny@53720
   666
  if length disc_eqns <> length ctr_specs - 1 then disc_eqns else
panny@53720
   667
    let
panny@53720
   668
      val n = 0 upto length ctr_specs
panny@53720
   669
        |> the o find_first (fn idx => not (exists (equal idx o #ctr_no) disc_eqns));
panny@53722
   670
      val fun_args = (try (#fun_args o hd) disc_eqns, try (#fun_args o hd) sel_eqns)
panny@53722
   671
        |> the_default (map (curry Free Name.uu) arg_Ts) o merge_options;
panny@53720
   672
      val extra_disc_eqn = {
panny@53720
   673
        fun_name = Binding.name_of fun_binding,
panny@53720
   674
        fun_T = arg_Ts ---> body_type (fastype_of (#ctr (hd ctr_specs))),
panny@53722
   675
        fun_args = fun_args,
panny@53720
   676
        ctr = #ctr (nth ctr_specs n),
panny@53720
   677
        ctr_no = n,
panny@53720
   678
        disc = #disc (nth ctr_specs n),
panny@53720
   679
        prems = maps (invert_prems o #prems) disc_eqns,
panny@53720
   680
        user_eqn = undef_const};
panny@53720
   681
    in
panny@53720
   682
      chop n disc_eqns ||> cons extra_disc_eqn |> (op @)
panny@53720
   683
    end;
panny@53720
   684
blanchet@53303
   685
fun add_primcorec sequential fixes specs lthy =
blanchet@53303
   686
  let
traytel@53352
   687
    val (bs, mxs) = map_split (apfst fst) fixes;
blanchet@53303
   688
    val (arg_Ts, res_Ts) = map (strip_type o snd o fst #>> HOLogic.mk_tupleT) fixes |> split_list;
blanchet@53303
   689
blanchet@53303
   690
    val callssss = []; (* FIXME *)
blanchet@53303
   691
panny@53654
   692
    val ((nontriv, corec_specs', _, coinduct_thm, strong_co_induct_thm, coinduct_thmss,
blanchet@53303
   693
          strong_coinduct_thmss), lthy') =
blanchet@53794
   694
      corec_specs_of bs arg_Ts res_Ts (get_indices fixes) callssss lthy;
blanchet@53303
   695
blanchet@53303
   696
    val fun_names = map Binding.name_of bs;
panny@53654
   697
    val corec_specs = take (length fun_names) corec_specs'; (*###*)
blanchet@53303
   698
blanchet@53303
   699
    val (eqns_data, _) =
panny@53654
   700
      fold_map (co_dissect_eqn sequential fun_names corec_specs) (map snd specs) []
blanchet@53303
   701
      |>> flat;
blanchet@53303
   702
panny@53720
   703
    val disc_eqnss' = map_filter (try (fn Disc x => x)) eqns_data
panny@53654
   704
      |> partition_eq ((op =) o pairself #fun_name)
panny@53720
   705
      |> fst o finds (fn (x, ({fun_name, ...} :: _)) => x = fun_name) fun_names
panny@53654
   706
      |> map (sort ((op <) o pairself #ctr_no |> make_ord) o flat o snd);
panny@53720
   707
    val _ = disc_eqnss' |> map (fn x =>
panny@53720
   708
      let val d = duplicates ((op =) o pairself #ctr_no) x in null d orelse
panny@53720
   709
        primrec_error_eqns "excess discriminator equations in definition"
panny@53720
   710
          (maps (fn t => filter (equal (#ctr_no t) o #ctr_no) x) d |> map #user_eqn) end);
panny@53654
   711
panny@53654
   712
    val sel_eqnss = map_filter (try (fn Sel x => x)) eqns_data
panny@53654
   713
      |> partition_eq ((op =) o pairself #fun_name)
panny@53720
   714
      |> fst o finds (fn (x, ({fun_name, ...} :: _)) => x = fun_name) fun_names
panny@53654
   715
      |> map (flat o snd);
panny@53654
   716
panny@53360
   717
    val has_call = exists_subterm (map (fst #>> Binding.name_of #> Free) fixes |> member (op =));
panny@53360
   718
    val arg_Tss = map (binder_types o snd o fst) fixes;
panny@53722
   719
    val disc_eqnss = map5 mk_real_disc_eqns bs arg_Tss corec_specs sel_eqnss disc_eqnss';
panny@53654
   720
    val (defs, exclss') =
panny@53654
   721
      co_build_defs lthy' bs mxs has_call arg_Tss corec_specs disc_eqnss sel_eqnss;
panny@53654
   722
panny@53654
   723
    (* try to prove (automatically generated) tautologies by ourselves *)
panny@53654
   724
    val exclss'' = exclss'
panny@53654
   725
      |> map (map (apsnd
blanchet@53699
   726
        (`(try (fn t => Goal.prove lthy [] [] t (mk_primcorec_assumption_tac lthy |> K))))));
panny@53654
   727
    val taut_thmss = map (map (apsnd (the o fst)) o filter (is_some o fst o snd)) exclss'';
panny@53654
   728
    val (obligation_idxss, obligationss) = exclss''
panny@53654
   729
      |> map (map (apsnd (rpair [] o snd)) o filter (is_none o fst o snd))
panny@53654
   730
      |> split_list o map split_list;
panny@53654
   731
panny@53654
   732
    fun prove thmss' def_thms' lthy =
panny@53654
   733
      let
panny@53654
   734
        val def_thms = map (snd o snd) def_thms';
panny@53654
   735
panny@53654
   736
        val exclss' = map (op ~~) (obligation_idxss ~~ thmss');
panny@53654
   737
        fun mk_exclsss excls n =
panny@53654
   738
          (excls, map (fn k => replicate k [TrueI] @ replicate (n - k) []) (0 upto n - 1))
panny@53654
   739
          |-> fold (fn ((c, c'), thm) => nth_map c (nth_map c' (K [thm])));
panny@53654
   740
        val exclssss = (exclss' ~~ taut_thmss |> map (op @), fun_names ~~ corec_specs)
panny@53654
   741
          |-> map2 (fn excls => fn (_, {ctr_specs, ...}) => mk_exclsss excls (length ctr_specs));
panny@53654
   742
panny@53654
   743
        fun prove_disc {ctr_specs, ...} exclsss
panny@53720
   744
            {fun_name, fun_T, fun_args, ctr_no, prems, user_eqn, ...} =
panny@53722
   745
          if Term.aconv_untyped (#disc (nth ctr_specs ctr_no), @{term "\<lambda>x. x = x"}) then [] else
panny@53720
   746
            let
panny@53722
   747
              val {disc_corec, ...} = nth ctr_specs ctr_no;
panny@53720
   748
              val k = 1 + ctr_no;
panny@53720
   749
              val m = length prems;
panny@53720
   750
              val t =
panny@53720
   751
                list_comb (Free (fun_name, fun_T), map Bound (length fun_args - 1 downto 0))
panny@53720
   752
                |> curry betapply (#disc (nth ctr_specs ctr_no)) (*###*)
panny@53720
   753
                |> HOLogic.mk_Trueprop
panny@53720
   754
                |> curry Logic.list_implies (map HOLogic.mk_Trueprop prems)
panny@53720
   755
                |> curry Logic.list_all (map dest_Free fun_args);
panny@53720
   756
            in
panny@53720
   757
              mk_primcorec_disc_tac lthy def_thms disc_corec k m exclsss
panny@53720
   758
              |> K |> Goal.prove lthy [] [] t
panny@53720
   759
              |> pair (#disc (nth ctr_specs ctr_no))
panny@53720
   760
              |> single
panny@53720
   761
            end;
panny@53720
   762
panny@53720
   763
        fun prove_sel {ctr_specs, nested_maps, nested_map_idents, nested_map_comps, ...}
panny@53720
   764
            disc_eqns exclsss {fun_name, fun_T, fun_args, ctr, sel, rhs_term, ...} =
panny@53654
   765
          let
panny@53720
   766
            val (SOME ctr_spec) = find_first (equal ctr o #ctr) ctr_specs;
panny@53720
   767
            val ctr_no = find_index (equal ctr o #ctr) ctr_specs;
panny@53720
   768
            val prems = the_default (maps (invert_prems o #prems) disc_eqns)
panny@53720
   769
                (find_first (equal ctr_no o #ctr_no) disc_eqns |> Option.map #prems);
panny@53720
   770
            val sel_corec = find_index (equal sel) (#sels ctr_spec)
panny@53720
   771
              |> nth (#sel_corecs ctr_spec);
panny@53654
   772
            val k = 1 + ctr_no;
panny@53654
   773
            val m = length prems;
panny@53654
   774
            val t =
panny@53720
   775
              list_comb (Free (fun_name, fun_T), map Bound (length fun_args - 1 downto 0))
panny@53720
   776
              |> curry betapply sel
panny@53720
   777
              |> rpair (abstract (List.rev fun_args) rhs_term)
panny@53720
   778
              |> HOLogic.mk_Trueprop o HOLogic.mk_eq
panny@53654
   779
              |> curry Logic.list_implies (map HOLogic.mk_Trueprop prems)
panny@53720
   780
              |> curry Logic.list_all (map dest_Free fun_args);
panny@53654
   781
          in
blanchet@53692
   782
            mk_primcorec_ctr_or_sel_tac lthy def_thms sel_corec k m exclsss
panny@53654
   783
              nested_maps nested_map_idents nested_map_comps
panny@53654
   784
            |> K |> Goal.prove lthy [] [] t
panny@53720
   785
            |> pair sel
panny@53654
   786
          end;
panny@53654
   787
blanchet@53791
   788
        fun prove_ctr disc_alist sel_alist disc_eqns sel_eqns {ctr, disc, sels, collapse, ...} =
panny@53720
   789
          if not (exists (equal ctr o #ctr) disc_eqns)
panny@53722
   790
              andalso not (exists (equal ctr o #ctr) sel_eqns)
panny@53722
   791
andalso (warning ("no eqns for ctr " ^ Syntax.string_of_term lthy ctr); true)
panny@53722
   792
            orelse (* don't try to prove theorems when some sel_eqns are missing *)
panny@53720
   793
              filter (equal ctr o #ctr) sel_eqns
panny@53720
   794
              |> fst o finds ((op =) o apsnd #sel) sels
panny@53720
   795
              |> exists (null o snd)
panny@53720
   796
andalso (warning ("sel_eqn(s) missing for ctr " ^ Syntax.string_of_term lthy ctr); true)
panny@53720
   797
          then [] else
panny@53720
   798
            let
panny@53720
   799
val _ = tracing ("ctr = " ^ Syntax.string_of_term lthy ctr);
panny@53735
   800
val _ = tracing (the_default "no disc_eqn" (Option.map (curry (op ^) "disc = " o Syntax.string_of_term lthy o #disc) (find_first (equal ctr o #ctr) disc_eqns)));
panny@53722
   801
              val (fun_name, fun_T, fun_args, prems) =
panny@53722
   802
                (find_first (equal ctr o #ctr) disc_eqns, find_first (equal ctr o #ctr) sel_eqns)
panny@53722
   803
                |>> Option.map (fn x => (#fun_name x, #fun_T x, #fun_args x, #prems x))
panny@53722
   804
                ||> Option.map (fn x => (#fun_name x, #fun_T x, #fun_args x, []))
panny@53722
   805
                |> the o merge_options;
panny@53720
   806
              val m = length prems;
panny@53720
   807
              val t = sel_eqns
panny@53720
   808
                |> fst o finds ((op =) o apsnd #sel) sels
panny@53720
   809
                |> map (snd #> (fn [x] => (List.rev (#fun_args x), #rhs_term x)) #-> abstract)
panny@53720
   810
                |> curry list_comb ctr
panny@53720
   811
                |> curry HOLogic.mk_eq (list_comb (Free (fun_name, fun_T),
panny@53720
   812
                  map Bound (length fun_args - 1 downto 0)))
panny@53720
   813
                |> HOLogic.mk_Trueprop
panny@53720
   814
                |> curry Logic.list_implies (map HOLogic.mk_Trueprop prems)
panny@53720
   815
                |> curry Logic.list_all (map dest_Free fun_args);
blanchet@53791
   816
              val maybe_disc_thm = AList.lookup (op =) disc_alist disc;
blanchet@53791
   817
              val sel_thms = map snd (filter (member (op =) sels o fst) sel_alist);
panny@53720
   818
val _ = tracing ("t = " ^ Syntax.string_of_term lthy t);
panny@53720
   819
val _ = tracing ("m = " ^ @{make_string} m);
panny@53720
   820
val _ = tracing ("collapse = " ^ @{make_string} collapse);
panny@53722
   821
val _ = tracing ("maybe_disc_thm = " ^ @{make_string} maybe_disc_thm);
panny@53720
   822
val _ = tracing ("sel_thms = " ^ @{make_string} sel_thms);
panny@53720
   823
            in
panny@53722
   824
              mk_primcorec_ctr_of_dtr_tac lthy m collapse maybe_disc_thm sel_thms
panny@53720
   825
              |> K |> Goal.prove lthy [] [] t
panny@53720
   826
              |> single
panny@53720
   827
          end;
panny@53720
   828
blanchet@53791
   829
        val disc_alists = map3 (maps oo prove_disc) corec_specs exclssss disc_eqnss;
blanchet@53791
   830
        val sel_alists = map4 (map ooo prove_sel) corec_specs disc_eqnss exclssss sel_eqnss;
blanchet@53744
   831
blanchet@53791
   832
        val disc_thmss = map (map snd) disc_alists;
blanchet@53791
   833
        val sel_thmss = map (map snd) sel_alists;
blanchet@53791
   834
        val ctr_thmss = map5 (maps oooo prove_ctr) disc_alists sel_alists disc_eqnss sel_eqnss
blanchet@53744
   835
          (map #ctr_specs corec_specs);
blanchet@53791
   836
blanchet@53744
   837
        val safess = map (map (K false)) ctr_thmss; (* FIXME: "true" for non-corecursive theorems *)
blanchet@53744
   838
        val safe_ctr_thmss =
blanchet@53744
   839
          map2 (map_filter (fn (safe, thm) => if safe then SOME thm else NONE) oo curry (op ~~))
blanchet@53744
   840
            safess ctr_thmss;
blanchet@53744
   841
blanchet@53744
   842
        val anonymous_notes =
blanchet@53744
   843
          [(flat safe_ctr_thmss, simp_attrs)]
blanchet@53744
   844
          |> map (fn (thms, attrs) => ((Binding.empty, attrs), [(thms, [])]));
blanchet@53791
   845
blanchet@53791
   846
        val notes =
blanchet@53791
   847
          [(ctrN, ctr_thmss, []),
blanchet@53791
   848
           (discN, disc_thmss, simp_attrs),
blanchet@53791
   849
           (selN, sel_thmss, simp_attrs)]
blanchet@53791
   850
          |> maps (fn (thmN, thmss, attrs) =>
blanchet@53791
   851
            map2 (fn fun_name => fn thms =>
blanchet@53791
   852
                ((Binding.qualify true fun_name (Binding.name thmN), attrs), [(thms, [])]))
blanchet@53791
   853
              fun_names thmss)
blanchet@53791
   854
          |> filter_out (null o fst o hd o snd);
panny@53654
   855
      in
blanchet@53791
   856
        lthy |> Local_Theory.notes (anonymous_notes @ notes) |> snd
panny@53654
   857
      end;
blanchet@53303
   858
  in
blanchet@53303
   859
    lthy'
panny@53654
   860
    |> Proof.theorem NONE (curry (op #->) (fold_map Local_Theory.define defs) o prove) obligationss
blanchet@53303
   861
    |> Proof.refine (Method.primitive_text I)
blanchet@53303
   862
    |> Seq.hd
blanchet@53303
   863
  end
blanchet@53303
   864
blanchet@53753
   865
fun add_primcorecursive_cmd seq (raw_fixes, raw_specs) lthy =
blanchet@53303
   866
  let
blanchet@53303
   867
    val (fixes, specs) = fst (Specification.read_spec raw_fixes raw_specs lthy);
blanchet@53303
   868
  in
blanchet@53303
   869
    add_primcorec seq fixes specs lthy
blanchet@53303
   870
    handle ERROR str => primrec_error str
blanchet@53303
   871
  end
blanchet@53303
   872
  handle Primrec_Error (str, eqns) =>
blanchet@53303
   873
    if null eqns
blanchet@53303
   874
    then error ("primcorec error:\n  " ^ str)
blanchet@53303
   875
    else error ("primcorec error:\n  " ^ str ^ "\nin\n  " ^
blanchet@53303
   876
      space_implode "\n  " (map (quote o Syntax.string_of_term lthy) eqns))
blanchet@53303
   877
blanchet@53303
   878
end;