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