src/HOL/Tools/inductive_package.ML
author berghofe
Tue, 17 Oct 2006 09:51:04 +0200
changeset 21048 e57e91f72831
parent 21024 63ab84bb64d1
child 21350 6e58289b6685
permissions -rw-r--r--
Restructured and repaired code dealing with case names in induction and elimination rules.
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
     1
(*  Title:      HOL/Tools/inductive_package.ML
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
     2
    ID:         $Id$
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
     4
    Author:     Stefan Berghofer, TU Muenchen
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
     5
    Author:     Markus Wenzel, TU Muenchen
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
     6
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
     7
(Co)Inductive Definition module for HOL.
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
     8
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
     9
Features:
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
    10
  * least or greatest fixedpoints
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
    11
  * mutually recursive definitions
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
    12
  * definitions involving arbitrary monotone operators
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
    13
  * automatically proves introduction and elimination rules
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    14
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    15
  Introduction rules have the form
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    16
  [| M Pj ti, ..., Q x, ... |] ==> Pk t
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    17
  where M is some monotone operator (usually the identity)
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    18
  Q x is any side condition on the free variables
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    19
  ti, t are any terms
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    20
  Pj, Pk are two of the predicates being defined in mutual recursion
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    21
*)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    22
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    23
signature INDUCTIVE_PACKAGE =
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    24
sig
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
    25
  val quiet_mode: bool ref
13626
282fbabec862 Fixed bug involving inductive definitions having equalities in the premises,
paulson
parents: 13197
diff changeset
    26
  val trace: bool ref
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    27
  type inductive_result
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    28
  type inductive_info
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    29
  val get_inductive: Context.generic -> string -> inductive_info option
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    30
  val the_mk_cases: Context.generic -> string -> string -> thm
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    31
  val print_inductives: Context.generic -> unit
18728
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
    32
  val mono_add: attribute
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
    33
  val mono_del: attribute
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    34
  val get_monos: Context.generic -> thm list
10910
058775a575db export inductive_forall_name, inductive_forall_def, rulify;
wenzelm
parents: 10804
diff changeset
    35
  val inductive_forall_name: string
058775a575db export inductive_forall_name, inductive_forall_def, rulify;
wenzelm
parents: 10804
diff changeset
    36
  val inductive_forall_def: thm
058775a575db export inductive_forall_name, inductive_forall_def, rulify;
wenzelm
parents: 10804
diff changeset
    37
  val rulify: thm -> thm
15703
727ef1b8b3ee *** empty log message ***
wenzelm
parents: 15574
diff changeset
    38
  val inductive_cases: ((bstring * Attrib.src list) * string list) list -> theory -> theory
18728
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
    39
  val inductive_cases_i: ((bstring * attribute list) * term list) list -> theory -> theory
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    40
  val add_inductive_i: bool -> bstring -> bool -> bool -> bool -> (string * typ option * mixfix) list ->
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    41
    (string * typ option) list -> ((bstring * Attrib.src list) * term) list -> thm list ->
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    42
      local_theory -> local_theory * inductive_result
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    43
  val add_inductive: bool -> bool -> (string * string option * mixfix) list ->
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    44
    (string * string option * mixfix) list ->
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    45
    ((bstring * Attrib.src list) * string) list -> (thmref * Attrib.src list) list ->
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    46
    local_theory -> local_theory * inductive_result
18708
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18678
diff changeset
    47
  val setup: theory -> theory
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    48
end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    49
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
    50
structure InductivePackage: INDUCTIVE_PACKAGE =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    51
struct
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    52
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
    53
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
    54
(** theory context references **)
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
    55
15525
396268ad58b3 HOL.order -> Orderings.order due to restructering
nipkow
parents: 15463
diff changeset
    56
val mono_name = "Orderings.mono";
17010
5abc26872268 changed reference to Lfp.lfp to FixedPint.lfp, ditto for gfp
avigad
parents: 16975
diff changeset
    57
val gfp_name = "FixedPoint.gfp";
5abc26872268 changed reference to Lfp.lfp to FixedPint.lfp, ditto for gfp
avigad
parents: 16975
diff changeset
    58
val lfp_name = "FixedPoint.lfp";
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
    59
11991
da6ee05d9f3d use HOL.induct_XXX;
wenzelm
parents: 11880
diff changeset
    60
val inductive_forall_name = "HOL.induct_forall";
da6ee05d9f3d use HOL.induct_XXX;
wenzelm
parents: 11880
diff changeset
    61
val inductive_forall_def = thm "induct_forall_def";
da6ee05d9f3d use HOL.induct_XXX;
wenzelm
parents: 11880
diff changeset
    62
val inductive_conj_name = "HOL.induct_conj";
da6ee05d9f3d use HOL.induct_XXX;
wenzelm
parents: 11880
diff changeset
    63
val inductive_conj_def = thm "induct_conj_def";
da6ee05d9f3d use HOL.induct_XXX;
wenzelm
parents: 11880
diff changeset
    64
val inductive_conj = thms "induct_conj";
da6ee05d9f3d use HOL.induct_XXX;
wenzelm
parents: 11880
diff changeset
    65
val inductive_atomize = thms "induct_atomize";
18463
56414918dbbd actually produce projected rules;
wenzelm
parents: 18418
diff changeset
    66
val inductive_rulify = thms "induct_rulify";
56414918dbbd actually produce projected rules;
wenzelm
parents: 18418
diff changeset
    67
val inductive_rulify_fallback = thms "induct_rulify_fallback";
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
    68
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    69
val notTrueE = TrueI RSN (2, notE);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    70
val notFalseI = Seq.hd (atac 1 notI);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    71
val simp_thms' = map (fn s => mk_meta_eq (the (find_first
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    72
  (equal (term_of (read_cterm HOL.thy (s, propT))) o prop_of) simp_thms)))
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    73
  ["(~True) = False", "(~False) = True",
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    74
   "(True --> ?P) = ?P", "(False --> ?P) = True",
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    75
   "(?P & True) = ?P", "(True & ?P) = ?P"];
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    76
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
    77
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
    78
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
    79
(** theory data **)
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    80
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    81
type inductive_result =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    82
  {preds: term list, defs: thm list, elims: thm list, raw_induct: thm,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    83
   induct: thm, intrs: thm list, mk_cases: string -> thm, mono: thm, unfold: thm};
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    84
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    85
type inductive_info =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    86
  {names: string list, coind: bool} * inductive_result;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    87
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    88
structure InductiveData = GenericDataFun
16432
a6e8fb94a8ca accomodate change of TheoryDataFun;
wenzelm
parents: 16364
diff changeset
    89
(struct
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    90
  val name = "HOL/inductive2";
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    91
  type T = inductive_info Symtab.table * thm list;
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    92
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    93
  val empty = (Symtab.empty, []);
16432
a6e8fb94a8ca accomodate change of TheoryDataFun;
wenzelm
parents: 16364
diff changeset
    94
  val extend = I;
a6e8fb94a8ca accomodate change of TheoryDataFun;
wenzelm
parents: 16364
diff changeset
    95
  fun merge _ ((tab1, monos1), (tab2, monos2)) =
11502
e80a712982e1 prefer immediate monos;
wenzelm
parents: 11358
diff changeset
    96
    (Symtab.merge (K true) (tab1, tab2), Drule.merge_rules (monos1, monos2));
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    97
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    98
  fun print generic (tab, monos) =
16364
dc9f7066d80a refer to name spaces values instead of names;
wenzelm
parents: 16287
diff changeset
    99
    [Pretty.strs ("(co)inductives:" ::
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   100
      map #1 (NameSpace.extern_table
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   101
        (Sign.const_space (Context.theory_of generic), tab))),  (* FIXME? *)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   102
     Pretty.big_list "monotonicity rules:"
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   103
        (map (ProofContext.pretty_thm (Context.proof_of generic)) monos)]
8720
840c75ab2a7f Pretty.chunks;
wenzelm
parents: 8634
diff changeset
   104
    |> Pretty.chunks |> Pretty.writeln;
16432
a6e8fb94a8ca accomodate change of TheoryDataFun;
wenzelm
parents: 16364
diff changeset
   105
end);
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   106
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   107
val print_inductives = InductiveData.print;
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   108
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   109
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   110
(* get and put data *)
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   111
17412
e26cb20ef0cc TableFun/Symtab: curried lookup and update;
wenzelm
parents: 17325
diff changeset
   112
val get_inductive = Symtab.lookup o #1 o InductiveData.get;
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   113
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   114
fun the_inductive thy name =
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   115
  (case get_inductive thy name of
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   116
    NONE => error ("Unknown (co)inductive predicate " ^ quote name)
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15525
diff changeset
   117
  | SOME info => info);
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   118
12400
f12f95e216e0 added the_mk_cases;
wenzelm
parents: 12338
diff changeset
   119
val the_mk_cases = (#mk_cases o #2) oo the_inductive;
f12f95e216e0 added the_mk_cases;
wenzelm
parents: 12338
diff changeset
   120
18222
a8ccacce3b52 declare coinduct rule;
wenzelm
parents: 17985
diff changeset
   121
fun put_inductives names info = InductiveData.map (apfst (fn tab =>
a8ccacce3b52 declare coinduct rule;
wenzelm
parents: 17985
diff changeset
   122
  fold (fn name => Symtab.update_new (name, info)) names tab
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   123
    handle Symtab.DUP dup => error ("Duplicate definition of (co)inductive predicate " ^ quote dup)));
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   124
8277
493707fcd8a6 added cases_of, cases;
wenzelm
parents: 8100
diff changeset
   125
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   126
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   127
(** monotonicity rules **)
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   128
9831
9b883c416aef tuned "mono" att setup;
wenzelm
parents: 9804
diff changeset
   129
val get_monos = #2 o InductiveData.get;
20901
437ca370dbd7 attribute: Context.mapping;
wenzelm
parents: 20872
diff changeset
   130
val map_monos = InductiveData.map o Library.apsnd;
8277
493707fcd8a6 added cases_of, cases;
wenzelm
parents: 8100
diff changeset
   131
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   132
fun mk_mono thm =
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   133
  let
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   134
    fun eq2mono thm' = [(*standard*) (thm' RS (thm' RS eq_to_mono))] @
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   135
      (case concl_of thm of
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   136
          (_ $ (_ $ (Const ("Not", _) $ _) $ _)) => []
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   137
        | _ => [(*standard*) (thm' RS (thm' RS eq_to_mono2))]);
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   138
    val concl = concl_of thm
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   139
  in
20872
wenzelm
parents: 20548
diff changeset
   140
    if can Logic.dest_equals concl then
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   141
      eq2mono (thm RS meta_eq_to_obj_eq)
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   142
    else if can (HOLogic.dest_eq o HOLogic.dest_Trueprop) concl then
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   143
      eq2mono thm
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   144
    else [thm]
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   145
  end;
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   146
8634
3f34637cb9c0 use Attrib.add_del_args;
wenzelm
parents: 8433
diff changeset
   147
3f34637cb9c0 use Attrib.add_del_args;
wenzelm
parents: 8433
diff changeset
   148
(* attributes *)
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   149
20901
437ca370dbd7 attribute: Context.mapping;
wenzelm
parents: 20872
diff changeset
   150
val mono_add = Thm.declaration_attribute (fn th =>
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   151
  map_monos (fold Drule.add_rule (mk_mono th)));
20901
437ca370dbd7 attribute: Context.mapping;
wenzelm
parents: 20872
diff changeset
   152
437ca370dbd7 attribute: Context.mapping;
wenzelm
parents: 20872
diff changeset
   153
val mono_del = Thm.declaration_attribute (fn th =>
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   154
  map_monos (fold Drule.del_rule (mk_mono th)));
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   155
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   156
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   157
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   158
(** misc utilities **)
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   159
5662
72a2e33d3b9e Added quiet_mode flag.
berghofe
parents: 5553
diff changeset
   160
val quiet_mode = ref false;
13626
282fbabec862 Fixed bug involving inductive definitions having equalities in the premises,
paulson
parents: 13197
diff changeset
   161
val trace = ref false;  (*for debugging*)
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   162
fun message s = if ! quiet_mode then () else writeln s;
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   163
fun clean_message s = if ! quick_and_dirty then () else message s;
5662
72a2e33d3b9e Added quiet_mode flag.
berghofe
parents: 5553
diff changeset
   164
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   165
fun coind_prefix true = "co"
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   166
  | coind_prefix false = "";
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   167
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   168
fun log b m n = if m >= n then 0 else 1 + log b (b * m) n;
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   169
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   170
fun make_bool_args f g [] i = []
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   171
  | make_bool_args f g (x :: xs) i =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   172
      (if i mod 2 = 0 then f x else g x) :: make_bool_args f g xs (i div 2);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   173
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   174
fun make_bool_args' xs =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   175
  make_bool_args (K HOLogic.false_const) (K HOLogic.true_const) xs;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   176
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   177
fun find_arg T x [] = sys_error "find_arg"
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   178
  | find_arg T x ((p as (_, (SOME _, _))) :: ps) =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   179
      apsnd (cons p) (find_arg T x ps)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   180
  | find_arg T x ((p as (U, (NONE, y))) :: ps) =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   181
      if T = U then (y, (U, (SOME x, y)) :: ps)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   182
      else apsnd (cons p) (find_arg T x ps);
7020
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   183
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   184
fun make_args Ts xs =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   185
  map (fn (T, (NONE, ())) => Const ("arbitrary", T) | (_, (SOME t, ())) => t)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   186
    (fold (fn (t, T) => snd o find_arg T t) xs (map (rpair (NONE, ())) Ts));
7020
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   187
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   188
fun make_args' Ts xs Us =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   189
  fst (fold_map (fn T => find_arg T ()) Us (Ts ~~ map (pair NONE) xs));
7020
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   190
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   191
fun dest_predicate cs params t =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   192
  let
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   193
    val k = length params;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   194
    val (c, ts) = strip_comb t;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   195
    val (xs, ys) = chop k ts;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   196
    val i = find_index_eq c cs;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   197
  in
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   198
    if xs = params andalso i >= 0 then
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   199
      SOME (c, i, ys, chop (length ys)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   200
        (List.drop (binder_types (fastype_of c), k)))
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   201
    else NONE
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   202
  end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   203
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   204
fun mk_names a 0 = []
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   205
  | mk_names a 1 = [a]
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   206
  | mk_names a n = map (fn i => a ^ string_of_int i) (1 upto n);
10988
e0016a009c17 Splitting of arguments of product types in induction rules is now less
berghofe
parents: 10910
diff changeset
   207
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   208
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   209
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   210
(** process rules **)
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   211
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   212
local
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   213
16432
a6e8fb94a8ca accomodate change of TheoryDataFun;
wenzelm
parents: 16364
diff changeset
   214
fun err_in_rule thy name t msg =
a6e8fb94a8ca accomodate change of TheoryDataFun;
wenzelm
parents: 16364
diff changeset
   215
  error (cat_lines ["Ill-formed introduction rule " ^ quote name,
a6e8fb94a8ca accomodate change of TheoryDataFun;
wenzelm
parents: 16364
diff changeset
   216
    Sign.string_of_term thy t, msg]);
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   217
16432
a6e8fb94a8ca accomodate change of TheoryDataFun;
wenzelm
parents: 16364
diff changeset
   218
fun err_in_prem thy name t p msg =
a6e8fb94a8ca accomodate change of TheoryDataFun;
wenzelm
parents: 16364
diff changeset
   219
  error (cat_lines ["Ill-formed premise", Sign.string_of_term thy p,
a6e8fb94a8ca accomodate change of TheoryDataFun;
wenzelm
parents: 16364
diff changeset
   220
    "in introduction rule " ^ quote name, Sign.string_of_term thy t, msg]);
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   221
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   222
val bad_concl = "Conclusion of introduction rule must be an inductive predicate";
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   223
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   224
val bad_ind_occ = "Inductive predicate occurs in argument of inductive predicate";
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   225
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   226
val bad_app = "Inductive predicate must be applied to parameter(s) ";
11358
416ea5c009f5 now checks for leading meta-quantifiers and complains, instead of
paulson
parents: 11036
diff changeset
   227
16432
a6e8fb94a8ca accomodate change of TheoryDataFun;
wenzelm
parents: 16364
diff changeset
   228
fun atomize_term thy = MetaSimplifier.rewrite_term thy inductive_atomize [];
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   229
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   230
in
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   231
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   232
fun check_rule thy cs params ((name, att), rule) =
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   233
  let
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   234
    val params' = Term.variant_frees rule (Logic.strip_params rule);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   235
    val frees = rev (map Free params');
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   236
    val concl = subst_bounds (frees, Logic.strip_assums_concl rule);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   237
    val prems = map (curry subst_bounds frees) (Logic.strip_assums_hyp rule);
16432
a6e8fb94a8ca accomodate change of TheoryDataFun;
wenzelm
parents: 16364
diff changeset
   238
    val aprems = map (atomize_term thy) prems;
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   239
    val arule = list_all_free (params', Logic.list_implies (aprems, concl));
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   240
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   241
    fun check_ind err t = case dest_predicate cs params t of
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   242
        NONE => err (bad_app ^
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   243
          commas (map (Sign.string_of_term thy) params))
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   244
      | SOME (_, _, ys, _) =>
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   245
          if exists (fn c => exists (fn t => Logic.occs (c, t)) ys) cs
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   246
          then err bad_ind_occ else ();
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   247
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   248
    fun check_prem' prem t =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   249
      if head_of t mem cs then
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   250
        check_ind (err_in_prem thy name rule prem) t
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   251
      else (case t of
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   252
          Abs (_, _, t) => check_prem' prem t
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   253
        | t $ u => (check_prem' prem t; check_prem' prem u)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   254
        | _ => ());
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   255
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   256
    fun check_prem (prem, aprem) =
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   257
      if can HOLogic.dest_Trueprop aprem then check_prem' prem prem
16432
a6e8fb94a8ca accomodate change of TheoryDataFun;
wenzelm
parents: 16364
diff changeset
   258
      else err_in_prem thy name rule prem "Non-atomic premise";
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   259
  in
11358
416ea5c009f5 now checks for leading meta-quantifiers and complains, instead of
paulson
parents: 11036
diff changeset
   260
    (case concl of
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   261
       Const ("Trueprop", _) $ t => 
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   262
         if head_of t mem cs then
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   263
           (check_ind (err_in_rule thy name rule) t;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   264
            List.app check_prem (prems ~~ aprems))
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   265
         else err_in_rule thy name rule bad_concl
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   266
     | _ => err_in_rule thy name rule bad_concl);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   267
    ((name, att), arule)
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   268
  end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   269
18222
a8ccacce3b52 declare coinduct rule;
wenzelm
parents: 17985
diff changeset
   270
val rulify =  (* FIXME norm_hhf *)
a8ccacce3b52 declare coinduct rule;
wenzelm
parents: 17985
diff changeset
   271
  hol_simplify inductive_conj
18463
56414918dbbd actually produce projected rules;
wenzelm
parents: 18418
diff changeset
   272
  #> hol_simplify inductive_rulify
56414918dbbd actually produce projected rules;
wenzelm
parents: 18418
diff changeset
   273
  #> hol_simplify inductive_rulify_fallback
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   274
  (*#> standard*);
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   275
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   276
end;
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   277
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   278
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   279
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   280
(** proofs for (co)inductive predicates **)
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   281
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   282
(* prove monotonicity -- NOT subject to quick_and_dirty! *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   283
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   284
fun prove_mono predT fp_fun monos ctxt =
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   285
 (message "  Proving monotonicity ...";
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   286
  Goal.prove ctxt [] []   (*NO quick_and_dirty here!*)
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   287
    (HOLogic.mk_Trueprop
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   288
      (Const (mono_name, (predT --> predT) --> HOLogic.boolT) $ fp_fun))
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   289
    (fn _ => EVERY [rtac monoI 1,
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   290
      REPEAT (resolve_tac [le_funI, le_boolI'] 1),
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   291
      REPEAT (FIRST
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   292
        [atac 1,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   293
         resolve_tac (List.concat (map mk_mono monos) @
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   294
           get_monos (Context.Proof ctxt)) 1,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   295
         etac le_funE 1, dtac le_boolD 1])]));
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   296
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   297
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   298
(* prove introduction rules *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   299
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   300
fun prove_intrs coind mono fp_def k intr_ts rec_preds_defs ctxt =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   301
  let
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   302
    val _ = clean_message "  Proving the introduction rules ...";
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   303
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   304
    val unfold = funpow k (fn th => th RS fun_cong)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   305
      (mono RS (fp_def RS
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   306
        (if coind then def_gfp_unfold else def_lfp_unfold)));
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   307
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   308
    fun select_disj 1 1 = []
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   309
      | select_disj _ 1 = [rtac disjI1]
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   310
      | select_disj n i = (rtac disjI2)::(select_disj (n - 1) (i - 1));
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   311
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   312
    val rules = [refl, TrueI, notFalseI, exI, conjI];
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   313
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   314
    val intrs = map_index (fn (i, intr) =>
20047
e23a3afaaa8a Goal.prove_global;
wenzelm
parents: 19874
diff changeset
   315
      rulify (SkipProof.prove ctxt [] [] intr (fn _ => EVERY
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   316
       [rewrite_goals_tac rec_preds_defs,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   317
        rtac (unfold RS iffD2) 1,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   318
        EVERY1 (select_disj (length intr_ts) (i + 1)),
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   319
        (*Not ares_tac, since refl must be tried before any equality assumptions;
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   320
          backtracking may occur if the premises have extra variables!*)
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   321
        DEPTH_SOLVE_1 (resolve_tac rules 1 APPEND assume_tac 1)]))) intr_ts
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   322
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   323
  in (intrs, unfold) end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   324
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   325
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   326
(* prove elimination rules *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   327
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   328
fun prove_elims cs params intr_ts intr_names unfold rec_preds_defs ctxt =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   329
  let
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   330
    val _ = clean_message "  Proving the elimination rules ...";
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   331
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   332
    val ([pname], ctxt') = Variable.variant_fixes ["P"] ctxt;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   333
    val P = HOLogic.mk_Trueprop (Free (pname, HOLogic.boolT));
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   334
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   335
    fun dest_intr r =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   336
      (the (dest_predicate cs params (HOLogic.dest_Trueprop (Logic.strip_assums_concl r))),
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   337
       Logic.strip_assums_hyp r, Logic.strip_params r);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   338
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   339
    val intrs = map dest_intr intr_ts ~~ intr_names;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   340
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   341
    val rules1 = [disjE, exE, FalseE];
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   342
    val rules2 = [conjE, FalseE, notTrueE];
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   343
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   344
    fun prove_elim c =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   345
      let
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   346
        val Ts = List.drop (binder_types (fastype_of c), length params);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   347
        val (anames, ctxt'') = Variable.variant_fixes (mk_names "a" (length Ts)) ctxt';
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   348
        val frees = map Free (anames ~~ Ts);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   349
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   350
        fun mk_elim_prem ((_, _, us, _), ts, params') =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   351
          list_all (params',
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   352
            Logic.list_implies (map (HOLogic.mk_Trueprop o HOLogic.mk_eq)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   353
              (frees ~~ us) @ ts, P));
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   354
        val c_intrs = (List.filter (equal c o #1 o #1 o #1) intrs);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   355
        val prems = HOLogic.mk_Trueprop (list_comb (c, params @ frees)) ::
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   356
           map mk_elim_prem (map #1 c_intrs)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   357
      in
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   358
        (SkipProof.prove ctxt'' [] prems P
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   359
          (fn {prems, ...} => EVERY
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   360
            [cut_facts_tac [hd prems] 1,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   361
             rewrite_goals_tac rec_preds_defs,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   362
             dtac (unfold RS iffD1) 1,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   363
             REPEAT (FIRSTGOAL (eresolve_tac rules1)),
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   364
             REPEAT (FIRSTGOAL (eresolve_tac rules2)),
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   365
             EVERY (map (fn prem =>
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   366
               DEPTH_SOLVE_1 (ares_tac [rewrite_rule rec_preds_defs prem, conjI] 1)) (tl prems))])
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   367
          |> rulify
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   368
          |> singleton (ProofContext.export ctxt'' ctxt),
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   369
         map #2 c_intrs)
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   370
      end
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   371
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   372
   in map prove_elim cs end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   373
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   374
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   375
(* derivation of simplified elimination rules *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   376
11682
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   377
local
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   378
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   379
(*cprop should have the form "Si t" where Si is an inductive predicate*)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   380
val mk_cases_err = "mk_cases: proposition not an inductive predicate";
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   381
11682
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   382
(*delete needless equality assumptions*)
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   383
val refl_thin = prove_goal HOL.thy "!!P. a = a ==> P ==> P" (fn _ => [assume_tac 1]);
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   384
val elim_rls = [asm_rl, FalseE, refl_thin, conjE, exE];
11682
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   385
val elim_tac = REPEAT o Tactic.eresolve_tac elim_rls;
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   386
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   387
fun simp_case_tac solved ss i =
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   388
  EVERY' [elim_tac, asm_full_simp_tac ss, elim_tac, REPEAT o bound_hyp_subst_tac] i
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   389
  THEN_MAYBE (if solved then no_tac else all_tac);
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   390
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   391
in
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   392
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   393
fun mk_cases_i elims ss cprop =
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   394
  let
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   395
    val prem = Thm.assume cprop;
11682
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   396
    val tac = ALLGOALS (simp_case_tac false ss) THEN prune_params_tac;
9298
7d9b562a750b use InductMethod.simp_case_tac;
wenzelm
parents: 9235
diff changeset
   397
    fun mk_elim rl = Drule.standard (Tactic.rule_by_tactic tac (prem RS rl));
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   398
  in
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   399
    (case get_first (try mk_elim) elims of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15525
diff changeset
   400
      SOME r => r
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15525
diff changeset
   401
    | NONE => error (Pretty.string_of (Pretty.block
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   402
        [Pretty.str mk_cases_err, Pretty.fbrk, Display.pretty_cterm cprop])))
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   403
  end;
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   404
6141
a6922171b396 removal of the (thm list) argument of mk_cases
paulson
parents: 6092
diff changeset
   405
fun mk_cases elims s =
16432
a6e8fb94a8ca accomodate change of TheoryDataFun;
wenzelm
parents: 16364
diff changeset
   406
  mk_cases_i elims (simpset()) (Thm.read_cterm (Thm.theory_of_thm (hd elims)) (s, propT));
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   407
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   408
fun smart_mk_cases ctxt ss cprop =
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   409
  let
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   410
    val c = #1 (Term.dest_Const (Term.head_of (HOLogic.dest_Trueprop
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   411
      (Logic.strip_imp_concl (Thm.term_of cprop))))) handle TERM _ => error mk_cases_err;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   412
    val (_, {elims, ...}) = the_inductive ctxt c;
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   413
  in mk_cases_i elims ss cprop end;
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   414
11682
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   415
end;
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   416
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   417
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   418
(* inductive_cases(_i) *)
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   419
12609
fb073a34b537 'inductive_cases': support 'and' form;
wenzelm
parents: 12527
diff changeset
   420
fun gen_inductive_cases prep_att prep_prop args thy =
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   421
  let
16432
a6e8fb94a8ca accomodate change of TheoryDataFun;
wenzelm
parents: 16364
diff changeset
   422
    val cert_prop = Thm.cterm_of thy o prep_prop (ProofContext.init thy);
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   423
    val mk_cases = smart_mk_cases (Context.Theory thy) (Simplifier.simpset_of thy) o cert_prop;
12609
fb073a34b537 'inductive_cases': support 'and' form;
wenzelm
parents: 12527
diff changeset
   424
12876
a70df1e5bf10 got rid of explicit marginal comments (now stripped earlier from input);
wenzelm
parents: 12798
diff changeset
   425
    val facts = args |> map (fn ((a, atts), props) =>
a70df1e5bf10 got rid of explicit marginal comments (now stripped earlier from input);
wenzelm
parents: 12798
diff changeset
   426
     ((a, map (prep_att thy) atts), map (Thm.no_attributes o single o mk_cases) props));
20901
437ca370dbd7 attribute: Context.mapping;
wenzelm
parents: 20872
diff changeset
   427
  in thy |> PureThy.note_thmss_i "" facts |> snd end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   428
18728
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   429
val inductive_cases = gen_inductive_cases Attrib.attribute ProofContext.read_prop;
12172
wenzelm
parents: 12165
diff changeset
   430
val inductive_cases_i = gen_inductive_cases (K I) ProofContext.cert_prop;
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   431
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   432
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   433
(* mk_cases_meth *)
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   434
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   435
fun mk_cases_meth (ctxt, raw_props) =
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   436
  let
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   437
    val thy = ProofContext.theory_of ctxt;
15032
02aed07e01bf local_cla/simpset_of;
wenzelm
parents: 14981
diff changeset
   438
    val ss = local_simpset_of ctxt;
16432
a6e8fb94a8ca accomodate change of TheoryDataFun;
wenzelm
parents: 16364
diff changeset
   439
    val cprops = map (Thm.cterm_of thy o ProofContext.read_prop ctxt) raw_props;
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   440
  in Method.erule 0 (map (smart_mk_cases (Context.Theory thy) ss) cprops) end;
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   441
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   442
val mk_cases_args = Method.syntax (Scan.lift (Scan.repeat1 Args.name));
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   443
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   444
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   445
(* prove induction rule *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   446
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   447
fun prove_indrule cs argTs bs xs rec_const params intr_ts mono
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   448
    fp_def rec_preds_defs ctxt =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   449
  let
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   450
    val _ = clean_message "  Proving the induction rule ...";
20047
e23a3afaaa8a Goal.prove_global;
wenzelm
parents: 19874
diff changeset
   451
    val thy = ProofContext.theory_of ctxt;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   452
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   453
    (* predicates for induction rule *)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   454
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   455
    val (pnames, ctxt') = Variable.variant_fixes (mk_names "P" (length cs)) ctxt;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   456
    val preds = map Free (pnames ~~
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   457
      map (fn c => List.drop (binder_types (fastype_of c), length params) --->
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   458
        HOLogic.boolT) cs);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   459
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   460
    (* transform an introduction rule into a premise for induction rule *)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   461
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   462
    fun mk_ind_prem r =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   463
      let
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   464
        fun subst s = (case dest_predicate cs params s of
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   465
            SOME (_, i, ys, (_, Ts)) =>
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   466
              let
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   467
                val k = length Ts;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   468
                val bs = map Bound (k - 1 downto 0);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   469
                val P = list_comb (List.nth (preds, i), ys @ bs);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   470
                val Q = list_abs (mk_names "x" k ~~ Ts,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   471
                  HOLogic.mk_binop inductive_conj_name (list_comb (s, bs), P))
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   472
              in (Q, case Ts of [] => SOME (s, P) | _ => NONE) end
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   473
          | NONE => (case s of
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   474
              (t $ u) => (fst (subst t) $ fst (subst u), NONE)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   475
            | (Abs (a, T, t)) => (Abs (a, T, fst (subst t)), NONE)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   476
            | _ => (s, NONE)));
7293
959e060f4a2f Moved sum_case stuff from Sum to Datatype.
berghofe
parents: 7257
diff changeset
   477
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   478
        fun mk_prem (s, prems) = (case subst s of
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   479
              (_, SOME (t, u)) => t :: u :: prems
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   480
            | (t, _) => t :: prems);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   481
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   482
        val SOME (_, i, ys, _) = dest_predicate cs params
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   483
          (HOLogic.dest_Trueprop (Logic.strip_assums_concl r))
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   484
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   485
      in list_all_free (Logic.strip_params r,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   486
        Logic.list_implies (map HOLogic.mk_Trueprop (foldr mk_prem
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   487
          [] (map HOLogic.dest_Trueprop (Logic.strip_assums_hyp r))),
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   488
            HOLogic.mk_Trueprop (list_comb (List.nth (preds, i), ys))))
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   489
      end;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   490
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   491
    val ind_prems = map mk_ind_prem intr_ts;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   492
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   493
    (* make conclusions for induction rules *)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   494
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   495
    val Tss = map (binder_types o fastype_of) preds;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   496
    val (xnames, ctxt'') =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   497
      Variable.variant_fixes (mk_names "x" (length (flat Tss))) ctxt';
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   498
    val mutual_ind_concl = HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   499
        (map (fn (((xnames, Ts), c), P) =>
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   500
           let val frees = map Free (xnames ~~ Ts)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   501
           in HOLogic.mk_imp
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   502
             (list_comb (c, params @ frees), list_comb (P, frees))
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   503
           end) (unflat Tss xnames ~~ Tss ~~ cs ~~ preds)));
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   504
13626
282fbabec862 Fixed bug involving inductive definitions having equalities in the premises,
paulson
parents: 13197
diff changeset
   505
    val dummy = if !trace then
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   506
                (writeln "ind_prems = ";
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   507
                 List.app (writeln o Sign.string_of_term thy) ind_prems)
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   508
            else ();
13626
282fbabec862 Fixed bug involving inductive definitions having equalities in the premises,
paulson
parents: 13197
diff changeset
   509
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   510
    (* make predicate for instantiation of abstract induction rule *)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   511
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   512
    val ind_pred = fold_rev lambda (bs @ xs) (foldr1 HOLogic.mk_conj
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   513
      (map_index (fn (i, P) => foldr HOLogic.mk_imp
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   514
         (list_comb (P, make_args' argTs xs (binder_types (fastype_of P))))
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   515
         (make_bool_args HOLogic.mk_not I bs i)) preds));
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   516
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   517
    val ind_concl = HOLogic.mk_Trueprop
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   518
      (HOLogic.mk_binrel "Orderings.less_eq" (rec_const, ind_pred));
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   519
13626
282fbabec862 Fixed bug involving inductive definitions having equalities in the premises,
paulson
parents: 13197
diff changeset
   520
    val raw_fp_induct = (mono RS (fp_def RS def_lfp_induct));
282fbabec862 Fixed bug involving inductive definitions having equalities in the premises,
paulson
parents: 13197
diff changeset
   521
282fbabec862 Fixed bug involving inductive definitions having equalities in the premises,
paulson
parents: 13197
diff changeset
   522
    val dummy = if !trace then
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   523
                (writeln "raw_fp_induct = "; print_thm raw_fp_induct)
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   524
            else ();
13626
282fbabec862 Fixed bug involving inductive definitions having equalities in the premises,
paulson
parents: 13197
diff changeset
   525
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   526
    val induct = SkipProof.prove ctxt'' [] ind_prems ind_concl
20248
7916ce5bb069 Goal.prove: more tactic arguments;
wenzelm
parents: 20071
diff changeset
   527
      (fn {prems, ...} => EVERY
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   528
        [rewrite_goals_tac [inductive_conj_def],
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   529
         DETERM (rtac raw_fp_induct 1),
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   530
         REPEAT (resolve_tac [le_funI, le_boolI] 1),
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   531
         rewrite_goals_tac (map mk_meta_eq [meet_fun_eq, meet_bool_eq] @ simp_thms'),
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   532
         (*This disjE separates out the introduction rules*)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   533
         REPEAT (FIRSTGOAL (eresolve_tac [disjE, exE, FalseE])),
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   534
         (*Now break down the individual cases.  No disjE here in case
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   535
           some premise involves disjunction.*)
13747
bf308fcfd08e Better treatment of equality in premises of inductive definitions. Less
paulson
parents: 13709
diff changeset
   536
         REPEAT (FIRSTGOAL (etac conjE ORELSE' bound_hyp_subst_tac)),
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   537
         REPEAT (FIRSTGOAL
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   538
           (resolve_tac [conjI, impI] ORELSE' (etac notE THEN' atac))),
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   539
         EVERY (map (fn prem => DEPTH_SOLVE_1 (ares_tac [rewrite_rule
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   540
           (inductive_conj_def :: rec_preds_defs) prem, conjI, refl] 1)) prems)]);
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   541
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   542
    val lemma = SkipProof.prove ctxt'' [] []
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   543
      (Logic.mk_implies (ind_concl, mutual_ind_concl)) (fn _ => EVERY
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   544
        [rewrite_goals_tac rec_preds_defs,
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   545
         REPEAT (EVERY
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   546
           [REPEAT (resolve_tac [conjI, impI] 1),
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   547
            REPEAT (eresolve_tac [le_funE, le_boolE] 1),
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   548
            atac 1,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   549
            rewrite_goals_tac simp_thms',
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   550
            atac 1])])
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   551
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   552
  in singleton (ProofContext.export ctxt'' ctxt) (induct RS lemma) end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   553
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   554
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   555
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   556
(** specification of (co)inductive predicates **)
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   557
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   558
fun mk_ind_def alt_name coind cs intr_ts monos
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   559
      params cnames_syn ctxt =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   560
  let
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   561
    val fp_name = if coind then gfp_name else lfp_name;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   562
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   563
    val argTs = fold (fn c => fn Ts => Ts @
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   564
      (List.drop (binder_types (fastype_of c), length params) \\ Ts)) cs [];
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   565
    val k = log 2 1 (length cs);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   566
    val predT = replicate k HOLogic.boolT ---> argTs ---> HOLogic.boolT;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   567
    val p :: xs = map Free (Variable.variant_frees ctxt intr_ts
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   568
      (("p", predT) :: (mk_names "x" (length argTs) ~~ argTs)));
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   569
    val bs = map Free (Variable.variant_frees ctxt (p :: xs @ intr_ts)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   570
      (map (rpair HOLogic.boolT) (mk_names "b" k)));
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   571
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   572
    fun subst t = (case dest_predicate cs params t of
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   573
        SOME (_, i, ts, (Ts, Us)) =>
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   574
          let val zs = map Bound (length Us - 1 downto 0)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   575
          in
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   576
            list_abs (map (pair "z") Us, list_comb (p,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   577
              make_bool_args' bs i @ make_args argTs ((ts ~~ Ts) @ (zs ~~ Us))))
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   578
          end
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   579
      | NONE => (case t of
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   580
          t1 $ t2 => subst t1 $ subst t2
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   581
        | Abs (x, T, u) => Abs (x, T, subst u)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   582
        | _ => t));
5149
10f0be29c0d1 Fixed bug in transform_rule.
berghofe
parents: 5120
diff changeset
   583
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   584
    (* transform an introduction rule into a conjunction  *)
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   585
    (*   [| p_i t; ... |] ==> p_j u                       *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   586
    (* is transformed into                                *)
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   587
    (*   b_j & x_j = u & p b_j t & ...                    *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   588
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   589
    fun transform_rule r =
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   590
      let
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   591
        val SOME (_, i, ts, (Ts, _)) = dest_predicate cs params
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   592
          (HOLogic.dest_Trueprop (Logic.strip_assums_concl r));
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   593
        val ps = make_bool_args HOLogic.mk_not I bs i @
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   594
          map HOLogic.mk_eq (make_args' argTs xs Ts ~~ ts) @
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   595
          map (subst o HOLogic.dest_Trueprop)
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   596
            (Logic.strip_assums_hyp r)
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   597
      in foldr (fn ((x, T), P) => HOLogic.exists_const T $ (Abs (x, T, P)))
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   598
        (if null ps then HOLogic.true_const else foldr1 HOLogic.mk_conj ps)
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   599
        (Logic.strip_params r)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   600
      end
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   601
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   602
    (* make a disjunction of all introduction rules *)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   603
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   604
    val fp_fun = fold_rev lambda (p :: bs @ xs)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   605
      (if null intr_ts then HOLogic.false_const
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   606
       else foldr1 HOLogic.mk_disj (map transform_rule intr_ts));
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   607
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   608
    (* add definiton of recursive predicates to theory *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   609
14235
281295a1bbaa Fixed bug in mk_ind_def that caused the inductive definition package to
berghofe
parents: 13747
diff changeset
   610
    val rec_name = if alt_name = "" then
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   611
      space_implode "_" (map fst cnames_syn) else alt_name;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   612
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   613
    val ((rec_const, (_, fp_def)), ctxt') = ctxt |>
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   614
      Variable.add_fixes (map (fst o dest_Free) params) |> snd |>
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   615
      fold Variable.declare_term intr_ts |>
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   616
      LocalTheory.def
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   617
        ((rec_name, case cnames_syn of [(_, syn)] => syn | _ => NoSyn),
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   618
         (("", []), fold_rev lambda params
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   619
           (Const (fp_name, (predT --> predT) --> predT) $ fp_fun)));
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   620
    val fp_def' = Simplifier.rewrite (HOL_basic_ss addsimps [fp_def])
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   621
      (cterm_of (ProofContext.theory_of ctxt') (list_comb (rec_const, params)));
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   622
    val specs = if length cs < 2 then [] else
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   623
      map_index (fn (i, (name_mx, c)) =>
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   624
        let
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   625
          val Ts = List.drop (binder_types (fastype_of c), length params);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   626
          val xs = map Free (Variable.variant_frees ctxt intr_ts
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   627
            (mk_names "x" (length Ts) ~~ Ts))
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   628
        in
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   629
          (name_mx, (("", []), fold_rev lambda (params @ xs)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   630
            (list_comb (rec_const, params @ make_bool_args' bs i @
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   631
              make_args argTs (xs ~~ Ts)))))
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   632
        end) (cnames_syn ~~ cs);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   633
    val (consts_defs, ctxt'') = fold_map LocalTheory.def specs ctxt';
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   634
    val preds = (case cs of [_] => [rec_const] | _ => map #1 consts_defs);
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   635
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   636
    val mono = prove_mono predT fp_fun monos ctxt''
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   637
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   638
  in (ctxt'', rec_name, mono, fp_def', map (#2 o #2) consts_defs,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   639
    list_comb (rec_const, params), preds, argTs, bs, xs)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   640
  end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   641
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   642
fun add_ind_def verbose alt_name coind no_elim no_ind cs
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   643
    intros monos params cnames_syn ctxt =
9072
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   644
  let
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   645
    val _ =
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   646
      if verbose then message ("Proofs for " ^ coind_prefix coind ^ "inductive predicate(s) " ^
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   647
        commas_quote (map fst cnames_syn)) else ();
9072
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   648
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   649
    val cnames = map (Sign.full_name (ProofContext.theory_of ctxt) o #1) cnames_syn;
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   650
    val ((intr_names, intr_atts), intr_ts) = apfst split_list (split_list intros);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   651
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   652
    val (ctxt1, rec_name, mono, fp_def, rec_preds_defs, rec_const, preds,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   653
      argTs, bs, xs) = mk_ind_def alt_name coind cs intr_ts
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   654
        monos params cnames_syn ctxt;
9072
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   655
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   656
    val (intrs, unfold) = prove_intrs coind mono fp_def (length bs + length xs)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   657
      intr_ts rec_preds_defs ctxt1;
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   658
    val elims = if no_elim then [] else
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   659
      cnames ~~ map (apfst (singleton (ProofContext.export ctxt1 ctxt)))
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   660
        (prove_elims cs params intr_ts intr_names unfold rec_preds_defs ctxt1);
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   661
    val raw_induct = singleton (ProofContext.export ctxt1 ctxt)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   662
      (if no_ind then Drule.asm_rl else
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   663
       if coind then ObjectLogic.rulify (rule_by_tactic
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   664
         (rewrite_tac [le_fun_def, le_bool_def] THEN
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   665
           fold_tac rec_preds_defs) (mono RS (fp_def RS def_coinduct)))
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   666
       else
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   667
         prove_indrule cs argTs bs xs rec_const params intr_ts mono fp_def
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   668
           rec_preds_defs ctxt1);
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   669
    val induct_cases = map (#1 o #1) intros;
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   670
    val ind_case_names = RuleCases.case_names induct_cases;
12165
14e94ad99861 mutual rules declared as ``consumes 0'';
wenzelm
parents: 12128
diff changeset
   671
    val induct =
18222
a8ccacce3b52 declare coinduct rule;
wenzelm
parents: 17985
diff changeset
   672
      if coind then
a8ccacce3b52 declare coinduct rule;
wenzelm
parents: 17985
diff changeset
   673
        (raw_induct, [RuleCases.case_names [rec_name],
18234
0183318232f2 RuleCases.case_conclusion;
wenzelm
parents: 18222
diff changeset
   674
          RuleCases.case_conclusion (rec_name, induct_cases),
18222
a8ccacce3b52 declare coinduct rule;
wenzelm
parents: 17985
diff changeset
   675
          RuleCases.consumes 1])
a8ccacce3b52 declare coinduct rule;
wenzelm
parents: 17985
diff changeset
   676
      else if no_ind orelse length cs > 1 then
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   677
        (raw_induct, [ind_case_names, RuleCases.consumes 0])
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   678
      else (raw_induct RSN (2, rev_mp), [ind_case_names, RuleCases.consumes 1]);
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   679
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   680
    val (intrs', ctxt2) =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   681
      ctxt1 |>
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   682
      LocalTheory.notes
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   683
        (map (fn "" => "" | name => NameSpace.append rec_name name) intr_names ~~
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   684
         intr_atts ~~
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   685
         map (single o rpair [] o single) (ProofContext.export ctxt1 ctxt intrs)) |>>
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   686
      map (hd o snd); (* FIXME? *)
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   687
    val (((_, elims'), (_, [induct'])), ctxt3) =
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   688
      ctxt2 |>
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   689
      LocalTheory.note ((NameSpace.append rec_name "intros", []), intrs') ||>>
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   690
      fold_map (fn (name, (elim, cases)) =>
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   691
        LocalTheory.note ((NameSpace.append (Sign.base_name name) "cases",
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   692
          [Attrib.internal (RuleCases.case_names cases),
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   693
           Attrib.internal (RuleCases.consumes 1),
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   694
           Attrib.internal (InductAttrib.cases_set name)]), [elim]) #>
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   695
        apfst (hd o snd)) elims ||>>
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   696
      LocalTheory.note ((NameSpace.append rec_name (coind_prefix coind ^ "induct"),
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   697
        map Attrib.internal (#2 induct)), [rulify (#1 induct)]);
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   698
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   699
    val induct_att = if coind then InductAttrib.coinduct_set else InductAttrib.induct_set;
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   700
    val ctxt4 = if no_ind then ctxt3 else
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   701
      let val inducts = cnames ~~ ProjectRule.projects ctxt (1 upto length cnames) induct'
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   702
      in
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   703
        ctxt3 |>
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   704
        LocalTheory.notes (inducts |> map (fn (name, th) => (("",
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   705
          [Attrib.internal ind_case_names,
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   706
           Attrib.internal (RuleCases.consumes 1),
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   707
           Attrib.internal (induct_att name)]), [([th], [])]))) |> snd |>
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   708
        LocalTheory.note ((NameSpace.append rec_name (coind_prefix coind ^ "inducts"),
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   709
          [Attrib.internal ind_case_names,
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   710
           Attrib.internal (RuleCases.consumes 1)]), map snd inducts) |> snd
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   711
      end;
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   712
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   713
    val result =
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   714
      {preds = preds,
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   715
       defs = fp_def :: rec_preds_defs,
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   716
       mono = singleton (ProofContext.export ctxt1 ctxt) mono,
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   717
       unfold = singleton (ProofContext.export ctxt1 ctxt) unfold,
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   718
       intrs = intrs',
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   719
       elims = elims',
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   720
       mk_cases = mk_cases elims',
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   721
       raw_induct = rulify raw_induct,
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   722
       induct = induct'}
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   723
      
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   724
  in
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   725
    (LocalTheory.declaration
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   726
       (put_inductives cnames ({names = cnames, coind = coind}, result)) ctxt4,
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   727
     result)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   728
  end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   729
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   730
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   731
(* external interfaces *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   732
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   733
fun add_inductive_i verbose alt_name coind no_elim no_ind cnames_syn pnames pre_intros monos ctxt =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   734
  let
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   735
    val thy = ProofContext.theory_of ctxt;
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   736
    val _ = Theory.requires thy "Inductive" (coind_prefix coind ^ "inductive definitions");
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   737
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   738
    val frees = fold (Term.add_frees o snd) pre_intros [];
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   739
    fun type_of s = (case AList.lookup op = frees s of
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   740
      NONE => error ("No such variable: " ^ s) | SOME T => T);
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   741
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   742
    val params = map
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   743
      (fn (s, SOME T) => Free (s, T) | (s, NONE) => Free (s, type_of s)) pnames;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   744
    val cs = map
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   745
      (fn (s, SOME T, _) => Free (s, T) | (s, NONE, _) => Free (s, type_of s)) cnames_syn;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   746
    val cnames_syn' = map (fn (s, _, mx) => (s, mx)) cnames_syn;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   747
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   748
    fun close_rule (x, r) = (x, list_all_free (rev (fold_aterms
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   749
      (fn t as Free (v as (s, _)) =>
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   750
            if Variable.is_fixed ctxt s orelse member op = cs t orelse
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   751
              member op = params t then I else insert op = v
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   752
        | _ => I) r []), r));
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   753
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   754
    val intros = map (close_rule o check_rule thy cs params) pre_intros;
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   755
  in
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   756
    add_ind_def verbose alt_name coind no_elim no_ind cs intros monos
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   757
      params cnames_syn' ctxt
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   758
  end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   759
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   760
fun add_inductive verbose coind cnames_syn pnames_syn intro_srcs raw_monos ctxt =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   761
  let
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   762
    val (_, ctxt') = Specification.read_specification (cnames_syn @ pnames_syn) [] ctxt;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   763
    val intrs = map (fn spec => apsnd hd (hd (snd (fst
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   764
      (Specification.read_specification [] [apsnd single spec] ctxt'))))) intro_srcs;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   765
    val pnames = map (fn (s, _, _) =>
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   766
      (s, SOME (ProofContext.infer_type ctxt' s))) pnames_syn;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   767
    val cnames_syn' = map (fn (s, _, mx) =>
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   768
      (s, SOME (ProofContext.infer_type ctxt' s), mx)) cnames_syn;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   769
    val (monos, ctxt'') = LocalTheory.theory_result (IsarThy.apply_theorems raw_monos) ctxt;
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   770
  in
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   771
    add_inductive_i verbose "" coind false false cnames_syn' pnames intrs monos ctxt''
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   772
  end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   773
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   774
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   775
6437
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   776
(** package setup **)
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   777
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   778
(* setup theory *)
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   779
8634
3f34637cb9c0 use Attrib.add_del_args;
wenzelm
parents: 8433
diff changeset
   780
val setup =
18708
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18678
diff changeset
   781
  InductiveData.init #>
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   782
  Method.add_methods [("ind_cases2", mk_cases_meth oo mk_cases_args,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   783
    "dynamic case analysis on predicates")] #>
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   784
  Attrib.add_attributes [("mono2", Attrib.add_del_args mono_add mono_del,
18728
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   785
    "declaration of monotonicity rule")];
6437
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   786
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   787
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   788
(* outer syntax *)
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   789
17057
0934ac31985f OuterKeyword;
wenzelm
parents: 17010
diff changeset
   790
local structure P = OuterParse and K = OuterKeyword in
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   791
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   792
fun mk_ind coind ((((loc, preds), params), intrs), monos) =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   793
  Toplevel.local_theory loc
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   794
    (#1 o add_inductive true coind preds params intrs monos);
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   795
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   796
fun ind_decl coind =
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   797
  P.opt_locale_target --
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   798
  P.fixes -- Scan.optional (P.$$$ "for" |-- P.fixes) [] --
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   799
  (P.$$$ "intros" |--
18787
5784fe1b5657 Inductive sets with no introduction rules are now allowed as well.
berghofe
parents: 18728
diff changeset
   800
    P.!!! (Scan.repeat (P.opt_thm_name ":" -- P.prop))) --
12876
a70df1e5bf10 got rid of explicit marginal comments (now stripped earlier from input);
wenzelm
parents: 12798
diff changeset
   801
  Scan.optional (P.$$$ "monos" |-- P.!!! P.xthms1) []
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   802
  >> mk_ind coind;
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   803
6723
f342449d73ca outer syntax keyword classification;
wenzelm
parents: 6556
diff changeset
   804
val inductiveP =
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   805
  OuterSyntax.command "inductive2" "define inductive predicates" K.thy_decl (ind_decl false);
6723
f342449d73ca outer syntax keyword classification;
wenzelm
parents: 6556
diff changeset
   806
f342449d73ca outer syntax keyword classification;
wenzelm
parents: 6556
diff changeset
   807
val coinductiveP =
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   808
  OuterSyntax.command "coinductive2" "define coinductive predicates" K.thy_decl (ind_decl true);
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   809
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   810
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   811
val ind_cases =
12876
a70df1e5bf10 got rid of explicit marginal comments (now stripped earlier from input);
wenzelm
parents: 12798
diff changeset
   812
  P.and_list1 (P.opt_thm_name ":" -- Scan.repeat1 P.prop)
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   813
  >> (Toplevel.theory o inductive_cases);
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   814
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   815
val inductive_casesP =
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   816
  OuterSyntax.command "inductive_cases2"
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   817
    "create simplified instances of elimination rules (improper)" K.thy_script ind_cases;
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   818
12180
91c9f661b183 inductive: removed con_defs;
wenzelm
parents: 12172
diff changeset
   819
val _ = OuterSyntax.add_keywords ["intros", "monos"];
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   820
val _ = OuterSyntax.add_parsers [inductiveP, coinductiveP, inductive_casesP];
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   821
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   822
end;
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   823
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   824
end;
15705
b5edb9dcec9a *** MESSAGE REFERS TO PREVIOUS VERSION ***
wenzelm
parents: 15703
diff changeset
   825