src/HOL/Tools/inductive_package.ML
author berghofe
Fri Mar 10 15:02:04 2000 +0100 (2000-03-10)
changeset 8410 5902c02fa122
parent 8401 50d5f4402305
child 8433 8ae16c770fc8
permissions -rw-r--r--
Type.unify now uses Vartab instead of association lists.
berghofe@5094
     1
(*  Title:      HOL/Tools/inductive_package.ML
berghofe@5094
     2
    ID:         $Id$
berghofe@5094
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
berghofe@5094
     4
                Stefan Berghofer,   TU Muenchen
berghofe@5094
     5
    Copyright   1994  University of Cambridge
berghofe@5094
     6
                1998  TU Muenchen     
berghofe@5094
     7
wenzelm@6424
     8
(Co)Inductive Definition module for HOL.
berghofe@5094
     9
berghofe@5094
    10
Features:
wenzelm@6424
    11
  * least or greatest fixedpoints
wenzelm@6424
    12
  * user-specified product and sum constructions
wenzelm@6424
    13
  * mutually recursive definitions
wenzelm@6424
    14
  * definitions involving arbitrary monotone operators
wenzelm@6424
    15
  * automatically proves introduction and elimination rules
berghofe@5094
    16
wenzelm@6424
    17
The recursive sets must *already* be declared as constants in the
wenzelm@6424
    18
current theory!
berghofe@5094
    19
berghofe@5094
    20
  Introduction rules have the form
wenzelm@8316
    21
  [| ti:M(Sj), ..., P(x), ... |] ==> t: Sk
berghofe@5094
    22
  where M is some monotone operator (usually the identity)
berghofe@5094
    23
  P(x) is any side condition on the free variables
berghofe@5094
    24
  ti, t are any terms
berghofe@5094
    25
  Sj, Sk are two of the sets being defined in mutual recursion
berghofe@5094
    26
wenzelm@6424
    27
Sums are used only for mutual recursion.  Products are used only to
wenzelm@6424
    28
derive "streamlined" induction rules for relations.
berghofe@5094
    29
*)
berghofe@5094
    30
berghofe@5094
    31
signature INDUCTIVE_PACKAGE =
berghofe@5094
    32
sig
wenzelm@6424
    33
  val quiet_mode: bool ref
berghofe@7020
    34
  val unify_consts: Sign.sg -> term list -> term list -> term list * term list
wenzelm@6437
    35
  val get_inductive: theory -> string ->
wenzelm@6437
    36
    {names: string list, coind: bool} * {defs: thm list, elims: thm list, raw_induct: thm,
wenzelm@6437
    37
      induct: thm, intrs: thm list, mk_cases: string -> thm, mono: thm, unfold: thm}
wenzelm@6437
    38
  val print_inductives: theory -> unit
berghofe@7710
    39
  val mono_add_global: theory attribute
berghofe@7710
    40
  val mono_del_global: theory attribute
berghofe@7710
    41
  val get_monos: theory -> thm list
wenzelm@6424
    42
  val add_inductive_i: bool -> bool -> bstring -> bool -> bool -> bool -> term list ->
wenzelm@6521
    43
    theory attribute list -> ((bstring * term) * theory attribute list) list ->
wenzelm@6521
    44
      thm list -> thm list -> theory -> theory *
wenzelm@6424
    45
      {defs: thm list, elims: thm list, raw_induct: thm, induct: thm,
wenzelm@6437
    46
       intrs: thm list, mk_cases: string -> thm, mono: thm, unfold: thm}
wenzelm@6521
    47
  val add_inductive: bool -> bool -> string list -> Args.src list ->
wenzelm@6521
    48
    ((bstring * string) * Args.src list) list -> (xstring * Args.src list) list ->
wenzelm@6521
    49
      (xstring * Args.src list) list -> theory -> theory *
wenzelm@6424
    50
      {defs: thm list, elims: thm list, raw_induct: thm, induct: thm,
wenzelm@6437
    51
       intrs: thm list, mk_cases: string -> thm, mono: thm, unfold: thm}
wenzelm@7107
    52
  val inductive_cases: (((bstring * Args.src list) * xstring) * string list) * Comment.text
wenzelm@7107
    53
    -> theory -> theory
wenzelm@7107
    54
  val inductive_cases_i: (((bstring * theory attribute list) * string) * term list) * Comment.text
wenzelm@7107
    55
    -> theory -> theory
wenzelm@6437
    56
  val setup: (theory -> theory) list
berghofe@5094
    57
end;
berghofe@5094
    58
wenzelm@6424
    59
structure InductivePackage: INDUCTIVE_PACKAGE =
berghofe@5094
    60
struct
berghofe@5094
    61
berghofe@7710
    62
(*** theory data ***)
berghofe@7710
    63
berghofe@7710
    64
(* data kind 'HOL/inductive' *)
berghofe@7710
    65
berghofe@7710
    66
type inductive_info =
berghofe@7710
    67
  {names: string list, coind: bool} * {defs: thm list, elims: thm list, raw_induct: thm,
berghofe@7710
    68
    induct: thm, intrs: thm list, mk_cases: string -> thm, mono: thm, unfold: thm};
berghofe@7710
    69
berghofe@7710
    70
structure InductiveArgs =
berghofe@7710
    71
struct
berghofe@7710
    72
  val name = "HOL/inductive";
berghofe@7710
    73
  type T = inductive_info Symtab.table * thm list;
berghofe@7710
    74
berghofe@7710
    75
  val empty = (Symtab.empty, []);
berghofe@7710
    76
  val copy = I;
berghofe@7710
    77
  val prep_ext = I;
berghofe@7710
    78
  fun merge ((tab1, monos1), (tab2, monos2)) = (Symtab.merge (K true) (tab1, tab2),
berghofe@7710
    79
    Library.generic_merge Thm.eq_thm I I monos1 monos2);
berghofe@7710
    80
berghofe@7710
    81
  fun print sg (tab, monos) =
berghofe@7710
    82
    (Pretty.writeln (Pretty.strs ("(co)inductives:" ::
berghofe@7710
    83
       map #1 (Sign.cond_extern_table sg Sign.constK tab)));
berghofe@7710
    84
     Pretty.writeln (Pretty.big_list "monotonicity rules:" (map Display.pretty_thm monos)));
berghofe@7710
    85
end;
berghofe@7710
    86
berghofe@7710
    87
structure InductiveData = TheoryDataFun(InductiveArgs);
berghofe@7710
    88
val print_inductives = InductiveData.print;
berghofe@7710
    89
berghofe@7710
    90
berghofe@7710
    91
(* get and put data *)
berghofe@7710
    92
berghofe@7710
    93
fun get_inductive thy name =
berghofe@7710
    94
  (case Symtab.lookup (fst (InductiveData.get thy), name) of
berghofe@7710
    95
    Some info => info
berghofe@7710
    96
  | None => error ("Unknown (co)inductive set " ^ quote name));
berghofe@7710
    97
berghofe@7710
    98
fun put_inductives names info thy =
berghofe@7710
    99
  let
berghofe@7710
   100
    fun upd ((tab, monos), name) = (Symtab.update_new ((name, info), tab), monos);
berghofe@7710
   101
    val tab_monos = foldl upd (InductiveData.get thy, names)
berghofe@7710
   102
      handle Symtab.DUP name => error ("Duplicate definition of (co)inductive set " ^ quote name);
berghofe@7710
   103
  in InductiveData.put tab_monos thy end;
berghofe@7710
   104
wenzelm@8277
   105
berghofe@7710
   106
berghofe@7710
   107
(** monotonicity rules **)
berghofe@7710
   108
wenzelm@8277
   109
val get_monos = snd o InductiveData.get;
wenzelm@8277
   110
fun put_monos thms thy = InductiveData.put (fst (InductiveData.get thy), thms) thy;
wenzelm@8277
   111
berghofe@7710
   112
fun mk_mono thm =
berghofe@7710
   113
  let
berghofe@7710
   114
    fun eq2mono thm' = [standard (thm' RS (thm' RS eq_to_mono))] @
berghofe@7710
   115
      (case concl_of thm of
berghofe@7710
   116
          (_ $ (_ $ (Const ("Not", _) $ _) $ _)) => []
berghofe@7710
   117
        | _ => [standard (thm' RS (thm' RS eq_to_mono2))]);
berghofe@7710
   118
    val concl = concl_of thm
berghofe@7710
   119
  in
berghofe@7710
   120
    if Logic.is_equals concl then
berghofe@7710
   121
      eq2mono (thm RS meta_eq_to_obj_eq)
berghofe@7710
   122
    else if can (HOLogic.dest_eq o HOLogic.dest_Trueprop) concl then
berghofe@7710
   123
      eq2mono thm
berghofe@7710
   124
    else [thm]
berghofe@7710
   125
  end;
berghofe@7710
   126
berghofe@7710
   127
(* mono add/del *)
berghofe@7710
   128
berghofe@7710
   129
local
berghofe@7710
   130
berghofe@7710
   131
fun map_rules_global f thy = put_monos (f (get_monos thy)) thy;
berghofe@7710
   132
berghofe@7710
   133
fun add_mono thm rules = Library.gen_union Thm.eq_thm (mk_mono thm, rules);
berghofe@7710
   134
fun del_mono thm rules = Library.gen_rems Thm.eq_thm (rules, mk_mono thm);
berghofe@7710
   135
berghofe@7710
   136
fun mk_att f g (x, thm) = (f (g thm) x, thm);
berghofe@7710
   137
berghofe@7710
   138
in
berghofe@7710
   139
berghofe@7710
   140
val mono_add_global = mk_att map_rules_global add_mono;
berghofe@7710
   141
val mono_del_global = mk_att map_rules_global del_mono;
berghofe@7710
   142
berghofe@7710
   143
end;
berghofe@7710
   144
berghofe@7710
   145
berghofe@7710
   146
(* concrete syntax *)
berghofe@7710
   147
berghofe@7710
   148
val monoN = "mono";
berghofe@7710
   149
val addN = "add";
berghofe@7710
   150
val delN = "del";
berghofe@7710
   151
berghofe@7710
   152
fun mono_att add del =
berghofe@7710
   153
  Attrib.syntax (Scan.lift (Args.$$$ addN >> K add || Args.$$$ delN >> K del || Scan.succeed add));
berghofe@7710
   154
berghofe@7710
   155
val mono_attr =
berghofe@7710
   156
  (mono_att mono_add_global mono_del_global, mono_att Attrib.undef_local_attribute Attrib.undef_local_attribute);
berghofe@7710
   157
berghofe@7710
   158
wenzelm@7107
   159
wenzelm@6424
   160
(** utilities **)
wenzelm@6424
   161
wenzelm@6424
   162
(* messages *)
wenzelm@6424
   163
berghofe@5662
   164
val quiet_mode = ref false;
berghofe@5662
   165
fun message s = if !quiet_mode then () else writeln s;
berghofe@5662
   166
wenzelm@6424
   167
fun coind_prefix true = "co"
wenzelm@6424
   168
  | coind_prefix false = "";
wenzelm@6424
   169
wenzelm@6424
   170
berghofe@7020
   171
(* the following code ensures that each recursive set *)
berghofe@7020
   172
(* always has the same type in all introduction rules *)
berghofe@7020
   173
berghofe@7020
   174
fun unify_consts sign cs intr_ts =
berghofe@7020
   175
  (let
berghofe@7020
   176
    val {tsig, ...} = Sign.rep_sg sign;
berghofe@7020
   177
    val add_term_consts_2 =
berghofe@7020
   178
      foldl_aterms (fn (cs, Const c) => c ins cs | (cs, _) => cs);
berghofe@7020
   179
    fun varify (t, (i, ts)) =
berghofe@7020
   180
      let val t' = map_term_types (incr_tvar (i + 1)) (Type.varify (t, []))
berghofe@7020
   181
      in (maxidx_of_term t', t'::ts) end;
berghofe@7020
   182
    val (i, cs') = foldr varify (cs, (~1, []));
berghofe@7020
   183
    val (i', intr_ts') = foldr varify (intr_ts, (i, []));
berghofe@7020
   184
    val rec_consts = foldl add_term_consts_2 ([], cs');
berghofe@7020
   185
    val intr_consts = foldl add_term_consts_2 ([], intr_ts');
berghofe@7020
   186
    fun unify (env, (cname, cT)) =
berghofe@7020
   187
      let val consts = map snd (filter (fn c => fst c = cname) intr_consts)
berghofe@7020
   188
      in foldl (fn ((env', j'), Tp) => (Type.unify tsig j' env' Tp))
berghofe@7020
   189
          (env, (replicate (length consts) cT) ~~ consts)
berghofe@7020
   190
      end;
berghofe@8410
   191
    val (env, _) = foldl unify ((Vartab.empty, i'), rec_consts);
berghofe@8410
   192
    fun typ_subst_TVars_2 env T = let val T' = typ_subst_TVars_Vartab env T
berghofe@7020
   193
      in if T = T' then T else typ_subst_TVars_2 env T' end;
berghofe@7020
   194
    val subst = fst o Type.freeze_thaw o
berghofe@7020
   195
      (map_term_types (typ_subst_TVars_2 env))
berghofe@7020
   196
berghofe@7020
   197
  in (map subst cs', map subst intr_ts')
berghofe@7020
   198
  end) handle Type.TUNIFY =>
berghofe@7020
   199
    (warning "Occurrences of recursive constant have non-unifiable types"; (cs, intr_ts));
berghofe@7020
   200
berghofe@7020
   201
wenzelm@6424
   202
(* misc *)
wenzelm@6424
   203
berghofe@5094
   204
val Const _ $ (vimage_f $ _) $ _ = HOLogic.dest_Trueprop (concl_of vimageD);
berghofe@5094
   205
wenzelm@6394
   206
val vimage_name = Sign.intern_const (Theory.sign_of Vimage.thy) "op -``";
wenzelm@6394
   207
val mono_name = Sign.intern_const (Theory.sign_of Ord.thy) "mono";
berghofe@5094
   208
berghofe@5094
   209
(* make injections needed in mutually recursive definitions *)
berghofe@5094
   210
berghofe@5094
   211
fun mk_inj cs sumT c x =
berghofe@5094
   212
  let
berghofe@5094
   213
    fun mk_inj' T n i =
berghofe@5094
   214
      if n = 1 then x else
berghofe@5094
   215
      let val n2 = n div 2;
berghofe@5094
   216
          val Type (_, [T1, T2]) = T
berghofe@5094
   217
      in
berghofe@5094
   218
        if i <= n2 then
berghofe@5094
   219
          Const ("Inl", T1 --> T) $ (mk_inj' T1 n2 i)
berghofe@5094
   220
        else
berghofe@5094
   221
          Const ("Inr", T2 --> T) $ (mk_inj' T2 (n - n2) (i - n2))
berghofe@5094
   222
      end
berghofe@5094
   223
  in mk_inj' sumT (length cs) (1 + find_index_eq c cs)
berghofe@5094
   224
  end;
berghofe@5094
   225
berghofe@5094
   226
(* make "vimage" terms for selecting out components of mutually rec.def. *)
berghofe@5094
   227
berghofe@5094
   228
fun mk_vimage cs sumT t c = if length cs < 2 then t else
berghofe@5094
   229
  let
berghofe@5094
   230
    val cT = HOLogic.dest_setT (fastype_of c);
berghofe@5094
   231
    val vimageT = [cT --> sumT, HOLogic.mk_setT sumT] ---> HOLogic.mk_setT cT
berghofe@5094
   232
  in
berghofe@5094
   233
    Const (vimage_name, vimageT) $
berghofe@5094
   234
      Abs ("y", cT, mk_inj cs sumT c (Bound 0)) $ t
berghofe@5094
   235
  end;
berghofe@5094
   236
wenzelm@6424
   237
wenzelm@6424
   238
wenzelm@6424
   239
(** well-formedness checks **)
berghofe@5094
   240
berghofe@5094
   241
fun err_in_rule sign t msg = error ("Ill-formed introduction rule\n" ^
berghofe@5094
   242
  (Sign.string_of_term sign t) ^ "\n" ^ msg);
berghofe@5094
   243
berghofe@5094
   244
fun err_in_prem sign t p msg = error ("Ill-formed premise\n" ^
berghofe@5094
   245
  (Sign.string_of_term sign p) ^ "\nin introduction rule\n" ^
berghofe@5094
   246
  (Sign.string_of_term sign t) ^ "\n" ^ msg);
berghofe@5094
   247
berghofe@5094
   248
val msg1 = "Conclusion of introduction rule must have form\
berghofe@5094
   249
          \ ' t : S_i '";
berghofe@7710
   250
val msg2 = "Non-atomic premise";
berghofe@5094
   251
val msg3 = "Recursion term on left of member symbol";
berghofe@5094
   252
berghofe@5094
   253
fun check_rule sign cs r =
berghofe@5094
   254
  let
berghofe@7710
   255
    fun check_prem prem = if can HOLogic.dest_Trueprop prem then ()
berghofe@7710
   256
      else err_in_prem sign r prem msg2;
berghofe@5094
   257
berghofe@7710
   258
  in (case HOLogic.dest_Trueprop (Logic.strip_imp_concl r) of
berghofe@7710
   259
        (Const ("op :", _) $ t $ u) =>
berghofe@7710
   260
          if u mem cs then
berghofe@7710
   261
            if exists (Logic.occs o (rpair t)) cs then
berghofe@7710
   262
              err_in_rule sign r msg3
berghofe@7710
   263
            else
berghofe@7710
   264
              seq check_prem (Logic.strip_imp_prems r)
berghofe@5094
   265
          else err_in_rule sign r msg1
berghofe@5094
   266
      | _ => err_in_rule sign r msg1)
berghofe@5094
   267
  end;
berghofe@5094
   268
berghofe@7020
   269
fun try' f msg sign t = (case (try f t) of
berghofe@7020
   270
      Some x => x
berghofe@7020
   271
    | None => error (msg ^ Sign.string_of_term sign t));
berghofe@5094
   272
wenzelm@6424
   273
berghofe@5094
   274
wenzelm@6424
   275
(*** properties of (co)inductive sets ***)
wenzelm@6424
   276
wenzelm@6424
   277
(** elimination rules **)
berghofe@5094
   278
wenzelm@8375
   279
fun mk_elims cs cTs params intr_ts intr_names =
berghofe@5094
   280
  let
berghofe@5094
   281
    val used = foldr add_term_names (intr_ts, []);
berghofe@5094
   282
    val [aname, pname] = variantlist (["a", "P"], used);
berghofe@5094
   283
    val P = HOLogic.mk_Trueprop (Free (pname, HOLogic.boolT));
berghofe@5094
   284
berghofe@5094
   285
    fun dest_intr r =
berghofe@5094
   286
      let val Const ("op :", _) $ t $ u =
berghofe@5094
   287
        HOLogic.dest_Trueprop (Logic.strip_imp_concl r)
berghofe@5094
   288
      in (u, t, Logic.strip_imp_prems r) end;
berghofe@5094
   289
wenzelm@8380
   290
    val intrs = map dest_intr intr_ts ~~ intr_names;
berghofe@5094
   291
berghofe@5094
   292
    fun mk_elim (c, T) =
berghofe@5094
   293
      let
berghofe@5094
   294
        val a = Free (aname, T);
berghofe@5094
   295
berghofe@5094
   296
        fun mk_elim_prem (_, t, ts) =
berghofe@5094
   297
          list_all_free (map dest_Free ((foldr add_term_frees (t::ts, [])) \\ params),
berghofe@5094
   298
            Logic.list_implies (HOLogic.mk_Trueprop (HOLogic.mk_eq (a, t)) :: ts, P));
wenzelm@8375
   299
        val c_intrs = (filter (equal c o #1 o #1) intrs);
berghofe@5094
   300
      in
wenzelm@8375
   301
        (Logic.list_implies (HOLogic.mk_Trueprop (HOLogic.mk_mem (a, c)) ::
wenzelm@8375
   302
          map mk_elim_prem (map #1 c_intrs), P), map #2 c_intrs)
berghofe@5094
   303
      end
berghofe@5094
   304
  in
berghofe@5094
   305
    map mk_elim (cs ~~ cTs)
berghofe@5094
   306
  end;
berghofe@5094
   307
        
wenzelm@6424
   308
wenzelm@6424
   309
wenzelm@6424
   310
(** premises and conclusions of induction rules **)
berghofe@5094
   311
berghofe@5094
   312
fun mk_indrule cs cTs params intr_ts =
berghofe@5094
   313
  let
berghofe@5094
   314
    val used = foldr add_term_names (intr_ts, []);
berghofe@5094
   315
berghofe@5094
   316
    (* predicates for induction rule *)
berghofe@5094
   317
berghofe@5094
   318
    val preds = map Free (variantlist (if length cs < 2 then ["P"] else
berghofe@5094
   319
      map (fn i => "P" ^ string_of_int i) (1 upto length cs), used) ~~
berghofe@5094
   320
        map (fn T => T --> HOLogic.boolT) cTs);
berghofe@5094
   321
berghofe@5094
   322
    (* transform an introduction rule into a premise for induction rule *)
berghofe@5094
   323
berghofe@5094
   324
    fun mk_ind_prem r =
berghofe@5094
   325
      let
berghofe@5094
   326
        val frees = map dest_Free ((add_term_frees (r, [])) \\ params);
berghofe@5094
   327
berghofe@7710
   328
        val pred_of = curry (Library.gen_assoc (op aconv)) (cs ~~ preds);
berghofe@5094
   329
berghofe@7710
   330
        fun subst (s as ((m as Const ("op :", T)) $ t $ u)) =
berghofe@7710
   331
              (case pred_of u of
berghofe@7710
   332
                  None => (m $ fst (subst t) $ fst (subst u), None)
berghofe@7710
   333
                | Some P => (HOLogic.conj $ s $ (P $ t), Some (s, P $ t)))
berghofe@7710
   334
          | subst s =
berghofe@7710
   335
              (case pred_of s of
berghofe@7710
   336
                  Some P => (HOLogic.mk_binop "op Int"
berghofe@7710
   337
                    (s, HOLogic.Collect_const (HOLogic.dest_setT
berghofe@7710
   338
                      (fastype_of s)) $ P), None)
berghofe@7710
   339
                | None => (case s of
berghofe@7710
   340
                     (t $ u) => (fst (subst t) $ fst (subst u), None)
berghofe@7710
   341
                   | (Abs (a, T, t)) => (Abs (a, T, fst (subst t)), None)
berghofe@7710
   342
                   | _ => (s, None)));
berghofe@7710
   343
berghofe@7710
   344
        fun mk_prem (s, prems) = (case subst s of
berghofe@7710
   345
              (_, Some (t, u)) => t :: u :: prems
berghofe@7710
   346
            | (t, _) => t :: prems);
berghofe@7710
   347
          
berghofe@5094
   348
        val Const ("op :", _) $ t $ u =
berghofe@5094
   349
          HOLogic.dest_Trueprop (Logic.strip_imp_concl r)
berghofe@5094
   350
berghofe@5094
   351
      in list_all_free (frees,
berghofe@7710
   352
           Logic.list_implies (map HOLogic.mk_Trueprop (foldr mk_prem
berghofe@5094
   353
             (map HOLogic.dest_Trueprop (Logic.strip_imp_prems r), [])),
berghofe@7710
   354
               HOLogic.mk_Trueprop (the (pred_of u) $ t)))
berghofe@5094
   355
      end;
berghofe@5094
   356
berghofe@5094
   357
    val ind_prems = map mk_ind_prem intr_ts;
berghofe@5094
   358
berghofe@5094
   359
    (* make conclusions for induction rules *)
berghofe@5094
   360
berghofe@5094
   361
    fun mk_ind_concl ((c, P), (ts, x)) =
berghofe@5094
   362
      let val T = HOLogic.dest_setT (fastype_of c);
berghofe@5094
   363
          val Ts = HOLogic.prodT_factors T;
berghofe@5094
   364
          val (frees, x') = foldr (fn (T', (fs, s)) =>
berghofe@5094
   365
            ((Free (s, T'))::fs, bump_string s)) (Ts, ([], x));
berghofe@5094
   366
          val tuple = HOLogic.mk_tuple T frees;
berghofe@5094
   367
      in ((HOLogic.mk_binop "op -->"
berghofe@5094
   368
        (HOLogic.mk_mem (tuple, c), P $ tuple))::ts, x')
berghofe@5094
   369
      end;
berghofe@5094
   370
berghofe@7710
   371
    val mutual_ind_concl = HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj
berghofe@5094
   372
        (fst (foldr mk_ind_concl (cs ~~ preds, ([], "xa")))))
berghofe@5094
   373
berghofe@5094
   374
  in (preds, ind_prems, mutual_ind_concl)
berghofe@5094
   375
  end;
berghofe@5094
   376
wenzelm@6424
   377
berghofe@5094
   378
wenzelm@8316
   379
(** prepare cases and induct rules **)
wenzelm@8316
   380
wenzelm@8316
   381
(*
wenzelm@8316
   382
  transform mutual rule:
wenzelm@8316
   383
    HH ==> (x1:A1 --> P1 x1) & ... & (xn:An --> Pn xn)
wenzelm@8316
   384
  into i-th projection:
wenzelm@8316
   385
    xi:Ai ==> HH ==> Pi xi
wenzelm@8316
   386
*)
wenzelm@8316
   387
wenzelm@8316
   388
fun project_rules [name] rule = [(name, rule)]
wenzelm@8316
   389
  | project_rules names mutual_rule =
wenzelm@8316
   390
      let
wenzelm@8316
   391
        val n = length names;
wenzelm@8316
   392
        fun proj i =
wenzelm@8316
   393
          (if i < n then (fn th => th RS conjunct1) else I)
wenzelm@8316
   394
            (Library.funpow (i - 1) (fn th => th RS conjunct2) mutual_rule)
wenzelm@8316
   395
            RS mp |> Thm.permute_prems 0 ~1 |> Drule.standard;
wenzelm@8316
   396
      in names ~~ map proj (1 upto n) end;
wenzelm@8316
   397
wenzelm@8375
   398
fun add_cases_induct no_elim no_ind names elims induct induct_cases =
wenzelm@8316
   399
  let
wenzelm@8375
   400
    fun cases_spec (name, elim) = (("", elim), [InductMethod.cases_set_global name]);
wenzelm@8375
   401
    val cases_specs = if no_elim then [] else map2 cases_spec (names, elims);
wenzelm@8316
   402
wenzelm@8375
   403
    fun induct_spec (name, th) =
wenzelm@8380
   404
      (("", th), [RuleCases.case_names induct_cases, InductMethod.induct_set_global name]);
wenzelm@8401
   405
    val induct_specs = if no_ind then [] else map induct_spec (project_rules names induct);
wenzelm@8316
   406
  in PureThy.add_thms (cases_specs @ induct_specs) end;
wenzelm@8316
   407
wenzelm@8316
   408
wenzelm@8316
   409
wenzelm@6424
   410
(*** proofs for (co)inductive sets ***)
wenzelm@6424
   411
wenzelm@6424
   412
(** prove monotonicity **)
berghofe@5094
   413
berghofe@5094
   414
fun prove_mono setT fp_fun monos thy =
berghofe@5094
   415
  let
wenzelm@6427
   416
    val _ = message "  Proving monotonicity ...";
berghofe@5094
   417
wenzelm@6394
   418
    val mono = prove_goalw_cterm [] (cterm_of (Theory.sign_of thy) (HOLogic.mk_Trueprop
berghofe@5094
   419
      (Const (mono_name, (setT --> setT) --> HOLogic.boolT) $ fp_fun)))
berghofe@7710
   420
        (fn _ => [rtac monoI 1, REPEAT (ares_tac (get_monos thy @ flat (map mk_mono monos)) 1)])
berghofe@5094
   421
berghofe@5094
   422
  in mono end;
berghofe@5094
   423
wenzelm@6424
   424
wenzelm@6424
   425
wenzelm@6424
   426
(** prove introduction rules **)
berghofe@5094
   427
berghofe@5094
   428
fun prove_intrs coind mono fp_def intr_ts con_defs rec_sets_defs thy =
berghofe@5094
   429
  let
wenzelm@6427
   430
    val _ = message "  Proving the introduction rules ...";
berghofe@5094
   431
berghofe@5094
   432
    val unfold = standard (mono RS (fp_def RS
berghofe@5094
   433
      (if coind then def_gfp_Tarski else def_lfp_Tarski)));
berghofe@5094
   434
berghofe@5094
   435
    fun select_disj 1 1 = []
berghofe@5094
   436
      | select_disj _ 1 = [rtac disjI1]
berghofe@5094
   437
      | select_disj n i = (rtac disjI2)::(select_disj (n - 1) (i - 1));
berghofe@5094
   438
berghofe@5094
   439
    val intrs = map (fn (i, intr) => prove_goalw_cterm rec_sets_defs
wenzelm@6394
   440
      (cterm_of (Theory.sign_of thy) intr) (fn prems =>
berghofe@5094
   441
       [(*insert prems and underlying sets*)
berghofe@5094
   442
       cut_facts_tac prems 1,
berghofe@5094
   443
       stac unfold 1,
berghofe@5094
   444
       REPEAT (resolve_tac [vimageI2, CollectI] 1),
berghofe@5094
   445
       (*Now 1-2 subgoals: the disjunction, perhaps equality.*)
berghofe@5094
   446
       EVERY1 (select_disj (length intr_ts) i),
berghofe@5094
   447
       (*Not ares_tac, since refl must be tried before any equality assumptions;
berghofe@5094
   448
         backtracking may occur if the premises have extra variables!*)
berghofe@5094
   449
       DEPTH_SOLVE_1 (resolve_tac [refl,exI,conjI] 1 APPEND assume_tac 1),
berghofe@5094
   450
       (*Now solve the equations like Inl 0 = Inl ?b2*)
berghofe@5094
   451
       rewrite_goals_tac con_defs,
berghofe@5094
   452
       REPEAT (rtac refl 1)])) (1 upto (length intr_ts) ~~ intr_ts)
berghofe@5094
   453
berghofe@5094
   454
  in (intrs, unfold) end;
berghofe@5094
   455
wenzelm@6424
   456
wenzelm@6424
   457
wenzelm@6424
   458
(** prove elimination rules **)
berghofe@5094
   459
wenzelm@8375
   460
fun prove_elims cs cTs params intr_ts intr_names unfold rec_sets_defs thy =
berghofe@5094
   461
  let
wenzelm@6427
   462
    val _ = message "  Proving the elimination rules ...";
berghofe@5094
   463
berghofe@7710
   464
    val rules1 = [CollectE, disjE, make_elim vimageD, exE];
berghofe@7710
   465
    val rules2 = [conjE, Inl_neq_Inr, Inr_neq_Inl] @
berghofe@5094
   466
      map make_elim [Inl_inject, Inr_inject];
wenzelm@8375
   467
  in
wenzelm@8375
   468
    map (fn (t, cases) => prove_goalw_cterm rec_sets_defs
wenzelm@6394
   469
      (cterm_of (Theory.sign_of thy) t) (fn prems =>
berghofe@5094
   470
        [cut_facts_tac [hd prems] 1,
berghofe@5094
   471
         dtac (unfold RS subst) 1,
berghofe@5094
   472
         REPEAT (FIRSTGOAL (eresolve_tac rules1)),
berghofe@5094
   473
         REPEAT (FIRSTGOAL (eresolve_tac rules2)),
berghofe@5094
   474
         EVERY (map (fn prem =>
wenzelm@8375
   475
           DEPTH_SOLVE_1 (ares_tac [prem, conjI] 1)) (tl prems))])
wenzelm@8375
   476
      |> RuleCases.name cases)
wenzelm@8375
   477
      (mk_elims cs cTs params intr_ts intr_names)
wenzelm@8375
   478
  end;
berghofe@5094
   479
wenzelm@6424
   480
berghofe@5094
   481
(** derivation of simplified elimination rules **)
berghofe@5094
   482
berghofe@5094
   483
(*Applies freeness of the given constructors, which *must* be unfolded by
berghofe@5094
   484
  the given defs.  Cannot simply use the local con_defs because con_defs=[] 
berghofe@5094
   485
  for inference systems.
berghofe@5094
   486
 *)
berghofe@5094
   487
wenzelm@7107
   488
(*cprop should have the form t:Si where Si is an inductive set*)
wenzelm@8336
   489
fun mk_cases_i solved elims ss cprop =
wenzelm@7107
   490
  let
wenzelm@7107
   491
    val prem = Thm.assume cprop;
wenzelm@8336
   492
    val tac = if solved then InductMethod.con_elim_solved_tac else InductMethod.con_elim_tac;
wenzelm@8336
   493
    fun mk_elim rl = Drule.standard (Tactic.rule_by_tactic (tac ss) (prem RS rl));
wenzelm@7107
   494
  in
wenzelm@7107
   495
    (case get_first (try mk_elim) elims of
wenzelm@7107
   496
      Some r => r
wenzelm@7107
   497
    | None => error (Pretty.string_of (Pretty.block
wenzelm@7107
   498
        [Pretty.str "mk_cases: proposition not of form 't : S_i'", Pretty.fbrk,
wenzelm@7107
   499
          Display.pretty_cterm cprop])))
wenzelm@7107
   500
  end;
wenzelm@7107
   501
paulson@6141
   502
fun mk_cases elims s =
wenzelm@8336
   503
  mk_cases_i false elims (simpset()) (Thm.read_cterm (Thm.sign_of_thm (hd elims)) (s, propT));
wenzelm@7107
   504
wenzelm@7107
   505
wenzelm@7107
   506
(* inductive_cases(_i) *)
wenzelm@7107
   507
wenzelm@7107
   508
fun gen_inductive_cases prep_att prep_const prep_prop
wenzelm@7107
   509
    ((((name, raw_atts), raw_set), raw_props), comment) thy =
wenzelm@7107
   510
  let
wenzelm@7107
   511
    val sign = Theory.sign_of thy;
wenzelm@7107
   512
wenzelm@7107
   513
    val atts = map (prep_att thy) raw_atts;
wenzelm@7107
   514
    val (_, {elims, ...}) = get_inductive thy (prep_const sign raw_set);
wenzelm@7107
   515
    val cprops = map (Thm.cterm_of sign o prep_prop (ProofContext.init thy)) raw_props;
wenzelm@8336
   516
    val thms = map (mk_cases_i true elims (Simplifier.simpset_of thy)) cprops;
wenzelm@7107
   517
  in
wenzelm@7107
   518
    thy
wenzelm@7107
   519
    |> IsarThy.have_theorems_i (((name, atts), map Thm.no_attributes thms), comment)
berghofe@5094
   520
  end;
berghofe@5094
   521
wenzelm@7107
   522
val inductive_cases =
wenzelm@7107
   523
  gen_inductive_cases Attrib.global_attribute Sign.intern_const ProofContext.read_prop;
wenzelm@7107
   524
wenzelm@7107
   525
val inductive_cases_i = gen_inductive_cases (K I) (K I) ProofContext.cert_prop;
wenzelm@7107
   526
wenzelm@6424
   527
wenzelm@6424
   528
wenzelm@6424
   529
(** prove induction rule **)
berghofe@5094
   530
berghofe@5094
   531
fun prove_indrule cs cTs sumT rec_const params intr_ts mono
berghofe@5094
   532
    fp_def rec_sets_defs thy =
berghofe@5094
   533
  let
wenzelm@6427
   534
    val _ = message "  Proving the induction rule ...";
berghofe@5094
   535
wenzelm@6394
   536
    val sign = Theory.sign_of thy;
berghofe@5094
   537
berghofe@7293
   538
    val sum_case_rewrites = (case ThyInfo.lookup_theory "Datatype" of
berghofe@7293
   539
        None => []
berghofe@7293
   540
      | Some thy' => map mk_meta_eq (PureThy.get_thms thy' "sum.cases"));
berghofe@7293
   541
berghofe@5094
   542
    val (preds, ind_prems, mutual_ind_concl) = mk_indrule cs cTs params intr_ts;
berghofe@5094
   543
berghofe@5094
   544
    (* make predicate for instantiation of abstract induction rule *)
berghofe@5094
   545
berghofe@5094
   546
    fun mk_ind_pred _ [P] = P
berghofe@5094
   547
      | mk_ind_pred T Ps =
berghofe@5094
   548
         let val n = (length Ps) div 2;
berghofe@5094
   549
             val Type (_, [T1, T2]) = T
berghofe@7293
   550
         in Const ("Datatype.sum.sum_case",
berghofe@5094
   551
           [T1 --> HOLogic.boolT, T2 --> HOLogic.boolT, T] ---> HOLogic.boolT) $
berghofe@5094
   552
             mk_ind_pred T1 (take (n, Ps)) $ mk_ind_pred T2 (drop (n, Ps))
berghofe@5094
   553
         end;
berghofe@5094
   554
berghofe@5094
   555
    val ind_pred = mk_ind_pred sumT preds;
berghofe@5094
   556
berghofe@5094
   557
    val ind_concl = HOLogic.mk_Trueprop
berghofe@5094
   558
      (HOLogic.all_const sumT $ Abs ("x", sumT, HOLogic.mk_binop "op -->"
berghofe@5094
   559
        (HOLogic.mk_mem (Bound 0, rec_const), ind_pred $ Bound 0)));
berghofe@5094
   560
berghofe@5094
   561
    (* simplification rules for vimage and Collect *)
berghofe@5094
   562
berghofe@5094
   563
    val vimage_simps = if length cs < 2 then [] else
berghofe@5094
   564
      map (fn c => prove_goalw_cterm [] (cterm_of sign
berghofe@5094
   565
        (HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@5094
   566
          (mk_vimage cs sumT (HOLogic.Collect_const sumT $ ind_pred) c,
berghofe@5094
   567
           HOLogic.Collect_const (HOLogic.dest_setT (fastype_of c)) $
berghofe@5094
   568
             nth_elem (find_index_eq c cs, preds)))))
berghofe@7293
   569
        (fn _ => [rtac vimage_Collect 1, rewrite_goals_tac sum_case_rewrites,
berghofe@5094
   570
          rtac refl 1])) cs;
berghofe@5094
   571
berghofe@5094
   572
    val induct = prove_goalw_cterm [] (cterm_of sign
berghofe@5094
   573
      (Logic.list_implies (ind_prems, ind_concl))) (fn prems =>
berghofe@5094
   574
        [rtac (impI RS allI) 1,
berghofe@5094
   575
         DETERM (etac (mono RS (fp_def RS def_induct)) 1),
berghofe@7710
   576
         rewrite_goals_tac (map mk_meta_eq (vimage_Int::Int_Collect::vimage_simps)),
berghofe@5094
   577
         fold_goals_tac rec_sets_defs,
berghofe@5094
   578
         (*This CollectE and disjE separates out the introduction rules*)
berghofe@7710
   579
         REPEAT (FIRSTGOAL (eresolve_tac [CollectE, disjE, exE])),
berghofe@5094
   580
         (*Now break down the individual cases.  No disjE here in case
berghofe@5094
   581
           some premise involves disjunction.*)
berghofe@7710
   582
         REPEAT (FIRSTGOAL (etac conjE ORELSE' hyp_subst_tac)),
berghofe@7293
   583
         rewrite_goals_tac sum_case_rewrites,
berghofe@5094
   584
         EVERY (map (fn prem =>
berghofe@5149
   585
           DEPTH_SOLVE_1 (ares_tac [prem, conjI, refl] 1)) prems)]);
berghofe@5094
   586
berghofe@5094
   587
    val lemma = prove_goalw_cterm rec_sets_defs (cterm_of sign
berghofe@5094
   588
      (Logic.mk_implies (ind_concl, mutual_ind_concl))) (fn prems =>
berghofe@5094
   589
        [cut_facts_tac prems 1,
berghofe@5094
   590
         REPEAT (EVERY
berghofe@5094
   591
           [REPEAT (resolve_tac [conjI, impI] 1),
berghofe@5094
   592
            TRY (dtac vimageD 1), etac allE 1, dtac mp 1, atac 1,
berghofe@7293
   593
            rewrite_goals_tac sum_case_rewrites,
berghofe@5094
   594
            atac 1])])
berghofe@5094
   595
berghofe@5094
   596
  in standard (split_rule (induct RS lemma))
berghofe@5094
   597
  end;
berghofe@5094
   598
wenzelm@6424
   599
wenzelm@6424
   600
wenzelm@6424
   601
(*** specification of (co)inductive sets ****)
wenzelm@6424
   602
wenzelm@6424
   603
(** definitional introduction of (co)inductive sets **)
berghofe@5094
   604
berghofe@5094
   605
fun add_ind_def verbose declare_consts alt_name coind no_elim no_ind cs
wenzelm@8401
   606
    atts intros monos con_defs thy params paramTs cTs cnames induct_cases =
berghofe@5094
   607
  let
wenzelm@6424
   608
    val _ = if verbose then message ("Proofs for " ^ coind_prefix coind ^ "inductive set(s) " ^
wenzelm@6424
   609
      commas_quote cnames) else ();
berghofe@5094
   610
berghofe@5094
   611
    val sumT = fold_bal (fn (T, U) => Type ("+", [T, U])) cTs;
berghofe@5094
   612
    val setT = HOLogic.mk_setT sumT;
berghofe@5094
   613
wenzelm@6394
   614
    val fp_name = if coind then Sign.intern_const (Theory.sign_of Gfp.thy) "gfp"
wenzelm@6394
   615
      else Sign.intern_const (Theory.sign_of Lfp.thy) "lfp";
berghofe@5094
   616
wenzelm@6424
   617
    val ((intr_names, intr_ts), intr_atts) = apfst split_list (split_list intros);
wenzelm@6424
   618
berghofe@5149
   619
    val used = foldr add_term_names (intr_ts, []);
berghofe@5149
   620
    val [sname, xname] = variantlist (["S", "x"], used);
berghofe@5149
   621
berghofe@5094
   622
    (* transform an introduction rule into a conjunction  *)
berghofe@5094
   623
    (*   [| t : ... S_i ... ; ... |] ==> u : S_j          *)
berghofe@5094
   624
    (* is transformed into                                *)
berghofe@5094
   625
    (*   x = Inj_j u & t : ... Inj_i -`` S ... & ...      *)
berghofe@5094
   626
berghofe@5094
   627
    fun transform_rule r =
berghofe@5094
   628
      let
berghofe@5094
   629
        val frees = map dest_Free ((add_term_frees (r, [])) \\ params);
berghofe@5149
   630
        val subst = subst_free
berghofe@5149
   631
          (cs ~~ (map (mk_vimage cs sumT (Free (sname, setT))) cs));
berghofe@5094
   632
        val Const ("op :", _) $ t $ u =
berghofe@5094
   633
          HOLogic.dest_Trueprop (Logic.strip_imp_concl r)
berghofe@5094
   634
berghofe@5094
   635
      in foldr (fn ((x, T), P) => HOLogic.mk_exists (x, T, P))
berghofe@7710
   636
        (frees, foldr1 HOLogic.mk_conj
berghofe@5149
   637
          (((HOLogic.eq_const sumT) $ Free (xname, sumT) $ (mk_inj cs sumT u t))::
berghofe@5094
   638
            (map (subst o HOLogic.dest_Trueprop)
berghofe@5094
   639
              (Logic.strip_imp_prems r))))
berghofe@5094
   640
      end
berghofe@5094
   641
berghofe@5094
   642
    (* make a disjunction of all introduction rules *)
berghofe@5094
   643
berghofe@5149
   644
    val fp_fun = absfree (sname, setT, (HOLogic.Collect_const sumT) $
berghofe@7710
   645
      absfree (xname, sumT, foldr1 HOLogic.mk_disj (map transform_rule intr_ts)));
berghofe@5094
   646
berghofe@5094
   647
    (* add definiton of recursive sets to theory *)
berghofe@5094
   648
berghofe@5094
   649
    val rec_name = if alt_name = "" then space_implode "_" cnames else alt_name;
wenzelm@6394
   650
    val full_rec_name = Sign.full_name (Theory.sign_of thy) rec_name;
berghofe@5094
   651
berghofe@5094
   652
    val rec_const = list_comb
berghofe@5094
   653
      (Const (full_rec_name, paramTs ---> setT), params);
berghofe@5094
   654
berghofe@5094
   655
    val fp_def_term = Logic.mk_equals (rec_const,
berghofe@5094
   656
      Const (fp_name, (setT --> setT) --> setT) $ fp_fun)
berghofe@5094
   657
berghofe@5094
   658
    val def_terms = fp_def_term :: (if length cs < 2 then [] else
berghofe@5094
   659
      map (fn c => Logic.mk_equals (c, mk_vimage cs sumT rec_const c)) cs);
berghofe@5094
   660
berghofe@5094
   661
    val thy' = thy |>
berghofe@5094
   662
      (if declare_consts then
berghofe@5094
   663
        Theory.add_consts_i (map (fn (c, n) =>
berghofe@5094
   664
          (n, paramTs ---> fastype_of c, NoSyn)) (cs ~~ cnames))
berghofe@5094
   665
       else I) |>
berghofe@5094
   666
      (if length cs < 2 then I else
berghofe@5094
   667
       Theory.add_consts_i [(rec_name, paramTs ---> setT, NoSyn)]) |>
berghofe@5094
   668
      Theory.add_path rec_name |>
berghofe@5094
   669
      PureThy.add_defss_i [(("defs", def_terms), [])];
berghofe@5094
   670
berghofe@5094
   671
    (* get definitions from theory *)
berghofe@5094
   672
wenzelm@6424
   673
    val fp_def::rec_sets_defs = PureThy.get_thms thy' "defs";
berghofe@5094
   674
berghofe@5094
   675
    (* prove and store theorems *)
berghofe@5094
   676
berghofe@5094
   677
    val mono = prove_mono setT fp_fun monos thy';
berghofe@5094
   678
    val (intrs, unfold) = prove_intrs coind mono fp_def intr_ts con_defs
berghofe@5094
   679
      rec_sets_defs thy';
berghofe@5094
   680
    val elims = if no_elim then [] else
wenzelm@8375
   681
      prove_elims cs cTs params intr_ts intr_names unfold rec_sets_defs thy';
wenzelm@8312
   682
    val raw_induct = if no_ind then Drule.asm_rl else
berghofe@5094
   683
      if coind then standard (rule_by_tactic
oheimb@5553
   684
        (rewrite_tac [mk_meta_eq vimage_Un] THEN
berghofe@5094
   685
          fold_tac rec_sets_defs) (mono RS (fp_def RS def_Collect_coinduct)))
berghofe@5094
   686
      else
berghofe@5094
   687
        prove_indrule cs cTs sumT rec_const params intr_ts mono fp_def
berghofe@5094
   688
          rec_sets_defs thy';
berghofe@5108
   689
    val induct = if coind orelse no_ind orelse length cs > 1 then raw_induct
berghofe@5094
   690
      else standard (raw_induct RSN (2, rev_mp));
berghofe@5094
   691
wenzelm@6424
   692
    val thy'' = thy'
wenzelm@6521
   693
      |> PureThy.add_thmss [(("intrs", intrs), atts)]
wenzelm@6424
   694
      |> PureThy.add_thms ((intr_names ~~ intrs) ~~ intr_atts)
wenzelm@6424
   695
      |> (if no_elim then I else PureThy.add_thmss [(("elims", elims), [])])
wenzelm@6424
   696
      |> (if no_ind then I else PureThy.add_thms
wenzelm@8401
   697
        [((coind_prefix coind ^ "induct", induct), [RuleCases.case_names induct_cases])])
wenzelm@6424
   698
      |> Theory.parent_path;
wenzelm@7798
   699
    val intrs' = PureThy.get_thms thy'' "intrs";
wenzelm@8312
   700
    val elims' = if no_elim then elims else PureThy.get_thms thy'' "elims";  (* FIXME improve *)
wenzelm@8312
   701
    val induct' = if no_ind then induct else PureThy.get_thm thy'' (coind_prefix coind ^ "induct");  (* FIXME improve *)
berghofe@5094
   702
  in (thy'',
berghofe@5094
   703
    {defs = fp_def::rec_sets_defs,
berghofe@5094
   704
     mono = mono,
berghofe@5094
   705
     unfold = unfold,
wenzelm@7798
   706
     intrs = intrs',
wenzelm@7798
   707
     elims = elims',
wenzelm@7798
   708
     mk_cases = mk_cases elims',
berghofe@5094
   709
     raw_induct = raw_induct,
wenzelm@7798
   710
     induct = induct'})
berghofe@5094
   711
  end;
berghofe@5094
   712
wenzelm@6424
   713
wenzelm@6424
   714
wenzelm@6424
   715
(** axiomatic introduction of (co)inductive sets **)
berghofe@5094
   716
berghofe@5094
   717
fun add_ind_axm verbose declare_consts alt_name coind no_elim no_ind cs
wenzelm@8401
   718
    atts intros monos con_defs thy params paramTs cTs cnames induct_cases =
berghofe@5094
   719
  let
berghofe@5094
   720
    val rec_name = if alt_name = "" then space_implode "_" cnames else alt_name;
berghofe@5094
   721
wenzelm@6424
   722
    val ((intr_names, intr_ts), intr_atts) = apfst split_list (split_list intros);
wenzelm@8375
   723
    val (elim_ts, elim_cases) = Library.split_list (mk_elims cs cTs params intr_ts intr_names);
berghofe@5094
   724
berghofe@5094
   725
    val (_, ind_prems, mutual_ind_concl) = mk_indrule cs cTs params intr_ts;
berghofe@5094
   726
    val ind_t = Logic.list_implies (ind_prems, mutual_ind_concl);
berghofe@5094
   727
    
wenzelm@6424
   728
    val thy' = thy
wenzelm@6424
   729
      |> (if declare_consts then
wenzelm@6424
   730
            Theory.add_consts_i
wenzelm@6424
   731
              (map (fn (c, n) => (n, paramTs ---> fastype_of c, NoSyn)) (cs ~~ cnames))
wenzelm@6424
   732
         else I)
wenzelm@6424
   733
      |> Theory.add_path rec_name
wenzelm@8375
   734
      |> PureThy.add_axiomss_i [(("intrs", intr_ts), atts), (("raw_elims", elim_ts), [])]
berghofe@7710
   735
      |> (if coind then I else
berghofe@7710
   736
            PureThy.add_axioms_i [(("raw_induct", ind_t), [apsnd (standard o split_rule)])]);
berghofe@5094
   737
wenzelm@6424
   738
    val intrs = PureThy.get_thms thy' "intrs";
wenzelm@8375
   739
    val elims = map2 (fn (th, cases) => RuleCases.name cases th)
wenzelm@8375
   740
      (PureThy.get_thms thy' "raw_elims", elim_cases);
wenzelm@8312
   741
    val raw_induct = if coind then Drule.asm_rl else PureThy.get_thm thy' "raw_induct";
berghofe@5094
   742
    val induct = if coind orelse length cs > 1 then raw_induct
berghofe@5094
   743
      else standard (raw_induct RSN (2, rev_mp));
berghofe@5094
   744
wenzelm@6424
   745
    val thy'' =
wenzelm@6424
   746
      thy'
wenzelm@8375
   747
      |> PureThy.add_thmss [(("elims", elims), [])]
wenzelm@8401
   748
      |> (if coind then I else PureThy.add_thms [(("induct", induct),
wenzelm@8401
   749
          [RuleCases.case_names induct_cases])])
wenzelm@6424
   750
      |> PureThy.add_thms ((intr_names ~~ intrs) ~~ intr_atts)
wenzelm@6424
   751
      |> Theory.parent_path;
wenzelm@7798
   752
    val induct' = if coind then raw_induct else PureThy.get_thm thy'' "induct";
berghofe@5094
   753
  in (thy'',
berghofe@5094
   754
    {defs = [],
wenzelm@8312
   755
     mono = Drule.asm_rl,
wenzelm@8312
   756
     unfold = Drule.asm_rl,
berghofe@5094
   757
     intrs = intrs,
berghofe@5094
   758
     elims = elims,
berghofe@5094
   759
     mk_cases = mk_cases elims,
berghofe@5094
   760
     raw_induct = raw_induct,
wenzelm@7798
   761
     induct = induct'})
berghofe@5094
   762
  end;
berghofe@5094
   763
wenzelm@6424
   764
wenzelm@6424
   765
wenzelm@6424
   766
(** introduction of (co)inductive sets **)
berghofe@5094
   767
berghofe@5094
   768
fun add_inductive_i verbose declare_consts alt_name coind no_elim no_ind cs
wenzelm@6521
   769
    atts intros monos con_defs thy =
berghofe@5094
   770
  let
wenzelm@6424
   771
    val _ = Theory.requires thy "Inductive" (coind_prefix coind ^ "inductive definitions");
wenzelm@6394
   772
    val sign = Theory.sign_of thy;
berghofe@5094
   773
berghofe@5094
   774
    (*parameters should agree for all mutually recursive components*)
berghofe@5094
   775
    val (_, params) = strip_comb (hd cs);
berghofe@5094
   776
    val paramTs = map (try' (snd o dest_Free) "Parameter in recursive\
berghofe@5094
   777
      \ component is not a free variable: " sign) params;
berghofe@5094
   778
berghofe@5094
   779
    val cTs = map (try' (HOLogic.dest_setT o fastype_of)
berghofe@5094
   780
      "Recursive component not of type set: " sign) cs;
berghofe@5094
   781
wenzelm@6437
   782
    val full_cnames = map (try' (fst o dest_Const o head_of)
berghofe@5094
   783
      "Recursive set not previously declared as constant: " sign) cs;
wenzelm@6437
   784
    val cnames = map Sign.base_name full_cnames;
berghofe@5094
   785
wenzelm@6424
   786
    val _ = seq (check_rule sign cs o snd o fst) intros;
wenzelm@8401
   787
    val induct_cases = map (#1 o #1) intros;
wenzelm@6437
   788
wenzelm@6437
   789
    val (thy1, result) =
wenzelm@6437
   790
      (if ! quick_and_dirty then add_ind_axm else add_ind_def)
wenzelm@6521
   791
        verbose declare_consts alt_name coind no_elim no_ind cs atts intros monos
wenzelm@8401
   792
        con_defs thy params paramTs cTs cnames induct_cases;
wenzelm@8307
   793
    val thy2 = thy1
wenzelm@8307
   794
      |> put_inductives full_cnames ({names = full_cnames, coind = coind}, result)
wenzelm@8401
   795
      |> add_cases_induct no_elim (no_ind orelse coind) full_cnames
wenzelm@8401
   796
          (#elims result) (#induct result) induct_cases;
wenzelm@6437
   797
  in (thy2, result) end;
berghofe@5094
   798
wenzelm@6424
   799
berghofe@5094
   800
wenzelm@6424
   801
(** external interface **)
wenzelm@6424
   802
wenzelm@6521
   803
fun add_inductive verbose coind c_strings srcs intro_srcs raw_monos raw_con_defs thy =
berghofe@5094
   804
  let
wenzelm@6394
   805
    val sign = Theory.sign_of thy;
wenzelm@8100
   806
    val cs = map (term_of o Thm.read_cterm sign o rpair HOLogic.termT) c_strings;
wenzelm@6424
   807
wenzelm@6521
   808
    val atts = map (Attrib.global_attribute thy) srcs;
wenzelm@6424
   809
    val intr_names = map (fst o fst) intro_srcs;
berghofe@7710
   810
    val intr_ts = map (term_of o Thm.read_cterm sign o rpair propT o snd o fst) intro_srcs;
wenzelm@6424
   811
    val intr_atts = map (map (Attrib.global_attribute thy) o snd) intro_srcs;
berghofe@7020
   812
    val (cs', intr_ts') = unify_consts sign cs intr_ts;
berghofe@5094
   813
wenzelm@6424
   814
    val ((thy', con_defs), monos) = thy
wenzelm@6424
   815
      |> IsarThy.apply_theorems raw_monos
wenzelm@6424
   816
      |> apfst (IsarThy.apply_theorems raw_con_defs);
wenzelm@6424
   817
  in
berghofe@7020
   818
    add_inductive_i verbose false "" coind false false cs'
berghofe@7020
   819
      atts ((intr_names ~~ intr_ts') ~~ intr_atts) monos con_defs thy'
berghofe@5094
   820
  end;
berghofe@5094
   821
wenzelm@6424
   822
wenzelm@6424
   823
wenzelm@6437
   824
(** package setup **)
wenzelm@6437
   825
wenzelm@6437
   826
(* setup theory *)
wenzelm@6437
   827
berghofe@7710
   828
val setup = [InductiveData.init,
berghofe@7710
   829
             Attrib.add_attributes [(monoN, mono_attr, "monotonicity rule")]];
wenzelm@6437
   830
wenzelm@6437
   831
wenzelm@6437
   832
(* outer syntax *)
wenzelm@6424
   833
wenzelm@6723
   834
local structure P = OuterParse and K = OuterSyntax.Keyword in
wenzelm@6424
   835
wenzelm@6521
   836
fun mk_ind coind (((sets, (atts, intrs)), monos), con_defs) =
wenzelm@6723
   837
  #1 o add_inductive true coind sets atts (map P.triple_swap intrs) monos con_defs;
wenzelm@6424
   838
wenzelm@6424
   839
fun ind_decl coind =
wenzelm@6729
   840
  (Scan.repeat1 P.term --| P.marg_comment) --
wenzelm@6729
   841
  (P.$$$ "intrs" |--
wenzelm@7152
   842
    P.!!! (P.opt_attribs -- Scan.repeat1 (P.opt_thm_name ":" -- P.prop --| P.marg_comment))) --
wenzelm@6729
   843
  Scan.optional (P.$$$ "monos" |-- P.!!! P.xthms1 --| P.marg_comment) [] --
wenzelm@6729
   844
  Scan.optional (P.$$$ "con_defs" |-- P.!!! P.xthms1 --| P.marg_comment) []
wenzelm@6424
   845
  >> (Toplevel.theory o mk_ind coind);
wenzelm@6424
   846
wenzelm@6723
   847
val inductiveP =
wenzelm@6723
   848
  OuterSyntax.command "inductive" "define inductive sets" K.thy_decl (ind_decl false);
wenzelm@6723
   849
wenzelm@6723
   850
val coinductiveP =
wenzelm@6723
   851
  OuterSyntax.command "coinductive" "define coinductive sets" K.thy_decl (ind_decl true);
wenzelm@6424
   852
wenzelm@7107
   853
wenzelm@7107
   854
val ind_cases =
wenzelm@7107
   855
  P.opt_thm_name "=" -- P.xname --| P.$$$ ":" -- Scan.repeat1 P.prop -- P.marg_comment
wenzelm@7107
   856
  >> (Toplevel.theory o inductive_cases);
wenzelm@7107
   857
wenzelm@7107
   858
val inductive_casesP =
wenzelm@7107
   859
  OuterSyntax.command "inductive_cases" "create simplified instances of elimination rules"
wenzelm@7107
   860
    K.thy_decl ind_cases;
wenzelm@7107
   861
wenzelm@6424
   862
val _ = OuterSyntax.add_keywords ["intrs", "monos", "con_defs"];
wenzelm@7107
   863
val _ = OuterSyntax.add_parsers [inductiveP, coinductiveP, inductive_casesP];
wenzelm@6424
   864
berghofe@5094
   865
end;
wenzelm@6424
   866
wenzelm@6424
   867
wenzelm@6424
   868
end;