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