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