src/HOL/Tools/inductive_package.ML
author wenzelm
Sat, 26 Jan 2008 17:08:36 +0100
changeset 25978 8ba1eba8d058
parent 25822 05756950011c
child 26128 fe2d24c26e0c
permissions -rw-r--r--
added theorem group;
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
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    22
signature BASIC_INDUCTIVE_PACKAGE =
5094
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
24815
f7093e90f36c tuned internal interfaces: flags record, added kind for results;
wenzelm
parents: 24744
diff changeset
    41
  val add_inductive_i:
25978
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
    42
    {verbose: bool, kind: string, group: string, alt_name: bstring,
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
    43
      coind: bool, no_elim: bool, no_ind: bool} ->
24744
dcb8cf5fc99c - add_inductive_i now takes typ instead of typ option as argument
berghofe
parents: 24721
diff changeset
    44
    ((string * typ) * mixfix) list ->
dcb8cf5fc99c - add_inductive_i now takes typ instead of typ option as argument
berghofe
parents: 24721
diff changeset
    45
    (string * typ) list -> ((bstring * Attrib.src list) * term) list -> thm list ->
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
    46
      local_theory -> inductive_result * local_theory
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    47
  val add_inductive: bool -> bool -> (string * string option * mixfix) list ->
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    48
    (string * string option * mixfix) list ->
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    49
    ((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
    50
    local_theory -> inductive_result * local_theory
24815
f7093e90f36c tuned internal interfaces: flags record, added kind for results;
wenzelm
parents: 24744
diff changeset
    51
  val add_inductive_global:
25978
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
    52
    {verbose: bool, kind: string, group: string, alt_name: bstring,
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
    53
      coind: bool, no_elim: bool, no_ind: bool} ->
24744
dcb8cf5fc99c - add_inductive_i now takes typ instead of typ option as argument
berghofe
parents: 24721
diff changeset
    54
    ((string * typ) * mixfix) list -> (string * typ) list ->
21526
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
    55
    ((bstring * Attrib.src list) * term) list -> thm list -> theory -> inductive_result * theory
22789
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
    56
  val arities_of: thm -> (string * int) list
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
    57
  val params_of: thm -> term list
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
    58
  val partition_rules: thm -> thm list -> (string * thm list) list
25822
05756950011c Added function partition_rules'.
berghofe
parents: 25510
diff changeset
    59
  val partition_rules': thm -> (thm * 'a) list -> (string * (thm * 'a) list) list
22789
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
    60
  val unpartition_rules: thm list -> (string * 'a list) list -> 'a list
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
    61
  val infer_intro_vars: thm -> int -> thm list -> term list list
18708
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18678
diff changeset
    62
  val setup: theory -> theory
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    63
end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    64
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    65
signature INDUCTIVE_PACKAGE =
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    66
sig
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    67
  include BASIC_INDUCTIVE_PACKAGE
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    68
  type add_ind_def
25978
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
    69
  val declare_rules: string -> string -> bstring -> bool -> bool -> string list ->
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    70
    thm list -> bstring list -> Attrib.src list list -> (thm * string list) list ->
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    71
    thm -> local_theory -> thm list * thm list * thm * local_theory
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    72
  val add_ind_def: add_ind_def
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    73
  val gen_add_inductive_i: add_ind_def ->
25978
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
    74
    {verbose: bool, kind: string, group: string, alt_name: bstring,
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
    75
      coind: bool, no_elim: bool, no_ind: bool} ->
24744
dcb8cf5fc99c - add_inductive_i now takes typ instead of typ option as argument
berghofe
parents: 24721
diff changeset
    76
    ((string * typ) * mixfix) list ->
dcb8cf5fc99c - add_inductive_i now takes typ instead of typ option as argument
berghofe
parents: 24721
diff changeset
    77
    (string * typ) list -> ((bstring * Attrib.src list) * term) list -> thm list ->
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    78
      local_theory -> inductive_result * local_theory
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    79
  val gen_add_inductive: add_ind_def ->
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    80
    bool -> bool -> (string * string option * mixfix) list ->
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    81
    (string * string option * mixfix) list ->
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    82
    ((bstring * Attrib.src list) * string) list -> (thmref * Attrib.src list) list ->
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    83
    local_theory -> inductive_result * local_theory
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    84
  val gen_ind_decl: add_ind_def ->
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    85
    bool -> OuterParse.token list ->
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    86
    (Toplevel.transition -> Toplevel.transition) * OuterParse.token list
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    87
end;
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    88
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
    89
structure InductivePackage: INDUCTIVE_PACKAGE =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    90
struct
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    91
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
    92
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
    93
(** theory context references **)
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
    94
11991
da6ee05d9f3d use HOL.induct_XXX;
wenzelm
parents: 11880
diff changeset
    95
val inductive_forall_name = "HOL.induct_forall";
da6ee05d9f3d use HOL.induct_XXX;
wenzelm
parents: 11880
diff changeset
    96
val inductive_forall_def = thm "induct_forall_def";
da6ee05d9f3d use HOL.induct_XXX;
wenzelm
parents: 11880
diff changeset
    97
val inductive_conj_name = "HOL.induct_conj";
da6ee05d9f3d use HOL.induct_XXX;
wenzelm
parents: 11880
diff changeset
    98
val inductive_conj_def = thm "induct_conj_def";
da6ee05d9f3d use HOL.induct_XXX;
wenzelm
parents: 11880
diff changeset
    99
val inductive_conj = thms "induct_conj";
da6ee05d9f3d use HOL.induct_XXX;
wenzelm
parents: 11880
diff changeset
   100
val inductive_atomize = thms "induct_atomize";
18463
56414918dbbd actually produce projected rules;
wenzelm
parents: 18418
diff changeset
   101
val inductive_rulify = thms "induct_rulify";
56414918dbbd actually produce projected rules;
wenzelm
parents: 18418
diff changeset
   102
val inductive_rulify_fallback = thms "induct_rulify_fallback";
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   103
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   104
val notTrueE = TrueI RSN (2, notE);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   105
val notFalseI = Seq.hd (atac 1 notI);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   106
val simp_thms' = map (fn s => mk_meta_eq (the (find_first
22675
acf10be7dcca cleaned/simplified Sign.read_typ, Thm.read_cterm etc.;
wenzelm
parents: 22667
diff changeset
   107
  (equal (Sign.read_prop HOL.thy s) o prop_of) simp_thms)))
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   108
  ["(~True) = False", "(~False) = True",
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   109
   "(True --> ?P) = ?P", "(False --> ?P) = True",
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   110
   "(?P & True) = ?P", "(True & ?P) = ?P"];
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   111
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   112
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   113
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   114
(** context data **)
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   115
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   116
type inductive_result =
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   117
  {preds: term list, elims: thm list, raw_induct: thm,
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   118
   induct: thm, intrs: thm list};
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   119
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   120
fun morph_result phi {preds, elims, raw_induct: thm, induct, intrs} =
21526
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   121
  let
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   122
    val term = Morphism.term phi;
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   123
    val thm = Morphism.thm phi;
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   124
    val fact = Morphism.fact phi;
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   125
  in
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   126
   {preds = map term preds, elims = fact elims, raw_induct = thm raw_induct,
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   127
    induct = thm induct, intrs = fact intrs}
21526
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   128
  end;
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   129
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   130
type inductive_info =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   131
  {names: string list, coind: bool} * inductive_result;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   132
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   133
structure InductiveData = GenericDataFun
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   134
(
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   135
  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
   136
  val empty = (Symtab.empty, []);
16432
a6e8fb94a8ca accomodate change of TheoryDataFun;
wenzelm
parents: 16364
diff changeset
   137
  val extend = I;
a6e8fb94a8ca accomodate change of TheoryDataFun;
wenzelm
parents: 16364
diff changeset
   138
  fun merge _ ((tab1, monos1), (tab2, monos2)) =
24039
273698405054 renamed Drule.add/del/merge_rules to Thm.add/del/merge_thms;
wenzelm
parents: 23881
diff changeset
   139
    (Symtab.merge (K true) (tab1, tab2), Thm.merge_thms (monos1, monos2));
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   140
);
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   141
21526
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   142
val get_inductives = InductiveData.get o Context.Proof;
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   143
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   144
fun print_inductives ctxt =
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   145
  let
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   146
    val (tab, monos) = get_inductives ctxt;
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   147
    val space = Consts.space_of (ProofContext.consts_of ctxt);
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   148
  in
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   149
    [Pretty.strs ("(co)inductives:" :: map #1 (NameSpace.extern_table (space, tab))),
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   150
     Pretty.big_list "monotonicity rules:" (map (ProofContext.pretty_thm ctxt) monos)]
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   151
    |> Pretty.chunks |> Pretty.writeln
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   152
  end;
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   153
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   154
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   155
(* get and put data *)
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   156
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   157
fun the_inductive ctxt name =
21526
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   158
  (case Symtab.lookup (#1 (get_inductives ctxt)) name of
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   159
    NONE => error ("Unknown (co)inductive predicate " ^ quote name)
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15525
diff changeset
   160
  | SOME info => info);
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   161
25380
03201004c77e put_inductives: be permissive about multiple versions
wenzelm
parents: 25365
diff changeset
   162
fun put_inductives names info = InductiveData.map
03201004c77e put_inductives: be permissive about multiple versions
wenzelm
parents: 25365
diff changeset
   163
  (apfst (fold (fn name => Symtab.update (name, info)) names));
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   164
8277
493707fcd8a6 added cases_of, cases;
wenzelm
parents: 8100
diff changeset
   165
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   166
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   167
(** monotonicity rules **)
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   168
21526
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   169
val get_monos = #2 o get_inductives;
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   170
val map_monos = InductiveData.map o apsnd;
8277
493707fcd8a6 added cases_of, cases;
wenzelm
parents: 8100
diff changeset
   171
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   172
fun mk_mono thm =
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   173
  let
22275
51411098e49b - Improved handling of monotonicity rules involving <=
berghofe
parents: 22102
diff changeset
   174
    val concl = concl_of thm;
51411098e49b - Improved handling of monotonicity rules involving <=
berghofe
parents: 22102
diff changeset
   175
    fun eq2mono thm' = [thm' RS (thm' RS eq_to_mono)] @
51411098e49b - Improved handling of monotonicity rules involving <=
berghofe
parents: 22102
diff changeset
   176
      (case concl of
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   177
          (_ $ (_ $ (Const ("Not", _) $ _) $ _)) => []
22275
51411098e49b - Improved handling of monotonicity rules involving <=
berghofe
parents: 22102
diff changeset
   178
        | _ => [thm' RS (thm' RS eq_to_mono2)]);
51411098e49b - Improved handling of monotonicity rules involving <=
berghofe
parents: 22102
diff changeset
   179
    fun dest_less_concl thm = dest_less_concl (thm RS le_funD)
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   180
      handle THM _ => thm RS le_boolD
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   181
  in
22275
51411098e49b - Improved handling of monotonicity rules involving <=
berghofe
parents: 22102
diff changeset
   182
    case concl of
51411098e49b - Improved handling of monotonicity rules involving <=
berghofe
parents: 22102
diff changeset
   183
      Const ("==", _) $ _ $ _ => eq2mono (thm RS meta_eq_to_obj_eq)
51411098e49b - Improved handling of monotonicity rules involving <=
berghofe
parents: 22102
diff changeset
   184
    | _ $ (Const ("op =", _) $ _ $ _) => eq2mono thm
23881
851c74f1bb69 moved class ord from Orderings.thy to HOL.thy
haftmann
parents: 23762
diff changeset
   185
    | _ $ (Const ("HOL.ord_class.less_eq", _) $ _ $ _) =>
22275
51411098e49b - Improved handling of monotonicity rules involving <=
berghofe
parents: 22102
diff changeset
   186
      [dest_less_concl (Seq.hd (REPEAT (FIRSTGOAL
51411098e49b - Improved handling of monotonicity rules involving <=
berghofe
parents: 22102
diff changeset
   187
         (resolve_tac [le_funI, le_boolI'])) thm))]
51411098e49b - Improved handling of monotonicity rules involving <=
berghofe
parents: 22102
diff changeset
   188
    | _ => [thm]
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   189
  end handle THM _ => error ("Bad monotonicity theorem:\n" ^ string_of_thm thm);
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   190
24039
273698405054 renamed Drule.add/del/merge_rules to Thm.add/del/merge_thms;
wenzelm
parents: 23881
diff changeset
   191
val mono_add = Thm.declaration_attribute (map_monos o fold Thm.add_thm o mk_mono);
273698405054 renamed Drule.add/del/merge_rules to Thm.add/del/merge_thms;
wenzelm
parents: 23881
diff changeset
   192
val mono_del = Thm.declaration_attribute (map_monos o fold Thm.del_thm o mk_mono);
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   193
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   194
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   195
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   196
(** misc utilities **)
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   197
5662
72a2e33d3b9e Added quiet_mode flag.
berghofe
parents: 5553
diff changeset
   198
val quiet_mode = ref false;
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   199
fun message s = if ! quiet_mode then () else writeln s;
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   200
fun clean_message s = if ! quick_and_dirty then () else message s;
5662
72a2e33d3b9e Added quiet_mode flag.
berghofe
parents: 5553
diff changeset
   201
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   202
fun coind_prefix true = "co"
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   203
  | coind_prefix false = "";
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   204
24133
75063f96618f added int type constraints to accomodate hacked SML/NJ;
wenzelm
parents: 24039
diff changeset
   205
fun log (b:int) m n = if m >= n then 0 else 1 + log b (b * m) n;
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   206
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   207
fun make_bool_args f g [] i = []
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   208
  | make_bool_args f g (x :: xs) i =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   209
      (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
   210
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   211
fun make_bool_args' xs =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   212
  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
   213
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   214
fun find_arg T x [] = sys_error "find_arg"
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   215
  | find_arg T x ((p as (_, (SOME _, _))) :: ps) =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   216
      apsnd (cons p) (find_arg T x ps)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   217
  | find_arg T x ((p as (U, (NONE, y))) :: ps) =
23577
c5b93c69afd3 avoid polymorphic equality;
wenzelm
parents: 22997
diff changeset
   218
      if (T: typ) = U then (y, (U, (SOME x, y)) :: ps)
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   219
      else apsnd (cons p) (find_arg T x ps);
7020
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   220
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   221
fun make_args Ts xs =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   222
  map (fn (T, (NONE, ())) => Const ("arbitrary", T) | (_, (SOME t, ())) => t)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   223
    (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
   224
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   225
fun make_args' Ts xs Us =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   226
  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
   227
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   228
fun dest_predicate cs params t =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   229
  let
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   230
    val k = length params;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   231
    val (c, ts) = strip_comb t;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   232
    val (xs, ys) = chop k ts;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   233
    val i = find_index_eq c cs;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   234
  in
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   235
    if xs = params andalso i >= 0 then
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   236
      SOME (c, i, ys, chop (length ys)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   237
        (List.drop (binder_types (fastype_of c), k)))
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   238
    else NONE
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   239
  end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   240
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   241
fun mk_names a 0 = []
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   242
  | mk_names a 1 = [a]
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   243
  | 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
   244
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   245
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   246
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   247
(** process rules **)
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   248
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   249
local
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   250
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   251
fun err_in_rule ctxt name t msg =
16432
a6e8fb94a8ca accomodate change of TheoryDataFun;
wenzelm
parents: 16364
diff changeset
   252
  error (cat_lines ["Ill-formed introduction rule " ^ quote name,
24920
2a45e400fdad generic Syntax.pretty/string_of operations;
wenzelm
parents: 24915
diff changeset
   253
    Syntax.string_of_term ctxt t, msg]);
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   254
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   255
fun err_in_prem ctxt name t p msg =
24920
2a45e400fdad generic Syntax.pretty/string_of operations;
wenzelm
parents: 24915
diff changeset
   256
  error (cat_lines ["Ill-formed premise", Syntax.string_of_term ctxt p,
2a45e400fdad generic Syntax.pretty/string_of operations;
wenzelm
parents: 24915
diff changeset
   257
    "in introduction rule " ^ quote name, Syntax.string_of_term ctxt t, msg]);
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   258
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   259
val bad_concl = "Conclusion of introduction rule must be an inductive predicate";
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   260
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   261
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
   262
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   263
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
   264
16432
a6e8fb94a8ca accomodate change of TheoryDataFun;
wenzelm
parents: 16364
diff changeset
   265
fun atomize_term thy = MetaSimplifier.rewrite_term thy inductive_atomize [];
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   266
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   267
in
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   268
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   269
fun check_rule ctxt cs params ((name, att), rule) =
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   270
  let
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   271
    val params' = Term.variant_frees rule (Logic.strip_params rule);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   272
    val frees = rev (map Free params');
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   273
    val concl = subst_bounds (frees, Logic.strip_assums_concl rule);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   274
    val prems = map (curry subst_bounds frees) (Logic.strip_assums_hyp rule);
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   275
    val rule' = Logic.list_implies (prems, concl);
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   276
    val aprems = map (atomize_term (ProofContext.theory_of ctxt)) prems;
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   277
    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
   278
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   279
    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
   280
        NONE => err (bad_app ^
24920
2a45e400fdad generic Syntax.pretty/string_of operations;
wenzelm
parents: 24915
diff changeset
   281
          commas (map (Syntax.string_of_term ctxt) params))
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   282
      | SOME (_, _, ys, _) =>
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   283
          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
   284
          then err bad_ind_occ else ();
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   285
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   286
    fun check_prem' prem t =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   287
      if head_of t mem cs then
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   288
        check_ind (err_in_prem ctxt name rule prem) t
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   289
      else (case t of
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   290
          Abs (_, _, t) => check_prem' prem t
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   291
        | t $ u => (check_prem' prem t; check_prem' prem u)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   292
        | _ => ());
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   293
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   294
    fun check_prem (prem, aprem) =
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   295
      if can HOLogic.dest_Trueprop aprem then check_prem' prem prem
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   296
      else err_in_prem ctxt name rule prem "Non-atomic premise";
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   297
  in
11358
416ea5c009f5 now checks for leading meta-quantifiers and complains, instead of
paulson
parents: 11036
diff changeset
   298
    (case concl of
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   299
       Const ("Trueprop", _) $ t =>
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   300
         if head_of t mem cs then
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   301
           (check_ind (err_in_rule ctxt name rule') t;
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   302
            List.app check_prem (prems ~~ aprems))
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   303
         else err_in_rule ctxt name rule' bad_concl
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   304
     | _ => err_in_rule ctxt name rule' bad_concl);
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   305
    ((name, att), arule)
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   306
  end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   307
24744
dcb8cf5fc99c - add_inductive_i now takes typ instead of typ option as argument
berghofe
parents: 24721
diff changeset
   308
val rulify =
18222
a8ccacce3b52 declare coinduct rule;
wenzelm
parents: 17985
diff changeset
   309
  hol_simplify inductive_conj
18463
56414918dbbd actually produce projected rules;
wenzelm
parents: 18418
diff changeset
   310
  #> hol_simplify inductive_rulify
56414918dbbd actually produce projected rules;
wenzelm
parents: 18418
diff changeset
   311
  #> hol_simplify inductive_rulify_fallback
24744
dcb8cf5fc99c - add_inductive_i now takes typ instead of typ option as argument
berghofe
parents: 24721
diff changeset
   312
  #> MetaSimplifier.norm_hhf;
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   313
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   314
end;
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   315
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   316
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   317
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   318
(** proofs for (co)inductive predicates **)
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   319
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   320
(* prove monotonicity -- NOT subject to quick_and_dirty! *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   321
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   322
fun prove_mono predT fp_fun monos ctxt =
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   323
 (message "  Proving monotonicity ...";
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   324
  Goal.prove ctxt [] []   (*NO quick_and_dirty here!*)
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   325
    (HOLogic.mk_Trueprop
24815
f7093e90f36c tuned internal interfaces: flags record, added kind for results;
wenzelm
parents: 24744
diff changeset
   326
      (Const (@{const_name Orderings.mono}, (predT --> predT) --> HOLogic.boolT) $ fp_fun))
25380
03201004c77e put_inductives: be permissive about multiple versions
wenzelm
parents: 25365
diff changeset
   327
    (fn _ => EVERY [rtac @{thm monoI} 1,
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   328
      REPEAT (resolve_tac [le_funI, le_boolI'] 1),
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   329
      REPEAT (FIRST
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   330
        [atac 1,
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   331
         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
   332
         etac le_funE 1, dtac le_boolD 1])]));
5094
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 introduction rules *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   336
22605
41b092e7d89a - Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents: 22460
diff changeset
   337
fun prove_intrs coind mono fp_def k params intr_ts 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 introduction 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 unfold = funpow k (fn th => th RS fun_cong)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   342
      (mono RS (fp_def RS
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   343
        (if coind then def_gfp_unfold else def_lfp_unfold)));
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   344
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   345
    fun select_disj 1 1 = []
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   346
      | select_disj _ 1 = [rtac disjI1]
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   347
      | select_disj n i = (rtac disjI2)::(select_disj (n - 1) (i - 1));
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   348
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   349
    val rules = [refl, TrueI, notFalseI, exI, conjI];
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   350
22605
41b092e7d89a - Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents: 22460
diff changeset
   351
    val intrs = map_index (fn (i, intr) => rulify
41b092e7d89a - Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents: 22460
diff changeset
   352
      (SkipProof.prove ctxt (map (fst o dest_Free) params) [] intr (fn _ => EVERY
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   353
       [rewrite_goals_tac rec_preds_defs,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   354
        rtac (unfold RS iffD2) 1,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   355
        EVERY1 (select_disj (length intr_ts) (i + 1)),
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   356
        (*Not ares_tac, since refl must be tried before any equality assumptions;
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   357
          backtracking may occur if the premises have extra variables!*)
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   358
        DEPTH_SOLVE_1 (resolve_tac rules 1 APPEND assume_tac 1)]))) intr_ts
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   359
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   360
  in (intrs, unfold) end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   361
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   362
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   363
(* prove elimination rules *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   364
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   365
fun prove_elims cs params intr_ts intr_names unfold rec_preds_defs ctxt =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   366
  let
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   367
    val _ = clean_message "  Proving the elimination rules ...";
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   368
22605
41b092e7d89a - Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents: 22460
diff changeset
   369
    val ([pname], ctxt') = ctxt |>
41b092e7d89a - Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents: 22460
diff changeset
   370
      Variable.add_fixes (map (fst o dest_Free) params) |> snd |>
41b092e7d89a - Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents: 22460
diff changeset
   371
      Variable.variant_fixes ["P"];
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   372
    val P = HOLogic.mk_Trueprop (Free (pname, HOLogic.boolT));
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   373
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   374
    fun dest_intr r =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   375
      (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
   376
       Logic.strip_assums_hyp r, Logic.strip_params r);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   377
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   378
    val intrs = map dest_intr intr_ts ~~ intr_names;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   379
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   380
    val rules1 = [disjE, exE, FalseE];
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   381
    val rules2 = [conjE, FalseE, notTrueE];
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   382
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   383
    fun prove_elim c =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   384
      let
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   385
        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
   386
        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
   387
        val frees = map Free (anames ~~ Ts);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   388
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   389
        fun mk_elim_prem ((_, _, us, _), ts, params') =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   390
          list_all (params',
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   391
            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
   392
              (frees ~~ us) @ ts, P));
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   393
        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
   394
        val prems = HOLogic.mk_Trueprop (list_comb (c, params @ frees)) ::
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   395
           map mk_elim_prem (map #1 c_intrs)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   396
      in
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   397
        (SkipProof.prove ctxt'' [] prems P
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   398
          (fn {prems, ...} => EVERY
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   399
            [cut_facts_tac [hd prems] 1,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   400
             rewrite_goals_tac rec_preds_defs,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   401
             dtac (unfold RS iffD1) 1,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   402
             REPEAT (FIRSTGOAL (eresolve_tac rules1)),
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   403
             REPEAT (FIRSTGOAL (eresolve_tac rules2)),
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   404
             EVERY (map (fn prem =>
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   405
               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
   406
          |> rulify
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   407
          |> singleton (ProofContext.export ctxt'' ctxt),
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   408
         map #2 c_intrs)
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   409
      end
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   410
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   411
   in map prove_elim cs end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   412
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   413
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   414
(* derivation of simplified elimination rules *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   415
11682
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   416
local
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   417
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   418
(*delete needless equality assumptions*)
25365
4e7a1dabd7ef avoid obsolete Sign.read_prop;
wenzelm
parents: 25288
diff changeset
   419
val refl_thin = Goal.prove_global HOL.thy [] [] @{prop "!!P. a = a ==> P ==> P"}
22838
haftmann
parents: 22789
diff changeset
   420
  (fn _ => assume_tac 1);
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   421
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
   422
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
   423
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   424
fun simp_case_tac ss i =
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   425
  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
   426
11682
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   427
in
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   428
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   429
fun mk_cases ctxt prop =
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   430
  let
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   431
    val thy = ProofContext.theory_of ctxt;
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   432
    val ss = Simplifier.local_simpset_of ctxt;
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   433
21526
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   434
    fun err msg =
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   435
      error (Pretty.string_of (Pretty.block
24920
2a45e400fdad generic Syntax.pretty/string_of operations;
wenzelm
parents: 24915
diff changeset
   436
        [Pretty.str msg, Pretty.fbrk, Syntax.pretty_term ctxt prop]));
21526
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   437
24861
cc669ca5f382 tuned Induct interface: prefer pred'' over set'';
wenzelm
parents: 24830
diff changeset
   438
    val elims = Induct.find_casesP ctxt prop;
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   439
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   440
    val cprop = Thm.cterm_of thy prop;
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   441
    val tac = ALLGOALS (simp_case_tac ss) THEN prune_params_tac;
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   442
    fun mk_elim rl =
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   443
      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
   444
      |> singleton (Variable.export (Variable.auto_fixes prop ctxt) ctxt);
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   445
  in
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   446
    (case get_first (try mk_elim) elims of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15525
diff changeset
   447
      SOME r => r
21526
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   448
    | NONE => err "Proposition not an inductive predicate:")
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   449
  end;
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   450
11682
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   451
end;
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   452
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   453
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   454
(* inductive_cases *)
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   455
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   456
fun gen_inductive_cases prep_att prep_prop args lthy =
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   457
  let
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   458
    val thy = ProofContext.theory_of lthy;
12876
a70df1e5bf10 got rid of explicit marginal comments (now stripped earlier from input);
wenzelm
parents: 12798
diff changeset
   459
    val facts = args |> map (fn ((a, atts), props) =>
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   460
      ((a, map (prep_att thy) atts),
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   461
        map (Thm.no_attributes o single o mk_cases lthy o prep_prop lthy) props));
24815
f7093e90f36c tuned internal interfaces: flags record, added kind for results;
wenzelm
parents: 24744
diff changeset
   462
  in lthy |> LocalTheory.notes Thm.theoremK facts |>> map snd end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   463
24509
23ee6b7788c2 replaced ProofContext.read_term/prop by general Syntax.read_term/prop;
wenzelm
parents: 24133
diff changeset
   464
val inductive_cases = gen_inductive_cases Attrib.intern_src Syntax.read_prop;
23ee6b7788c2 replaced ProofContext.read_term/prop by general Syntax.read_term/prop;
wenzelm
parents: 24133
diff changeset
   465
val inductive_cases_i = gen_inductive_cases (K I) Syntax.check_prop;
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   466
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   467
22275
51411098e49b - Improved handling of monotonicity rules involving <=
berghofe
parents: 22102
diff changeset
   468
fun ind_cases src = Method.syntax (Scan.lift (Scan.repeat1 Args.name --
51411098e49b - Improved handling of monotonicity rules involving <=
berghofe
parents: 22102
diff changeset
   469
    Scan.optional (Args.$$$ "for" |-- Scan.repeat1 Args.name) [])) src
51411098e49b - Improved handling of monotonicity rules involving <=
berghofe
parents: 22102
diff changeset
   470
  #> (fn ((raw_props, fixes), ctxt) =>
51411098e49b - Improved handling of monotonicity rules involving <=
berghofe
parents: 22102
diff changeset
   471
    let
51411098e49b - Improved handling of monotonicity rules involving <=
berghofe
parents: 22102
diff changeset
   472
      val (_, ctxt') = Variable.add_fixes fixes ctxt;
24509
23ee6b7788c2 replaced ProofContext.read_term/prop by general Syntax.read_term/prop;
wenzelm
parents: 24133
diff changeset
   473
      val props = Syntax.read_props ctxt' raw_props;
22275
51411098e49b - Improved handling of monotonicity rules involving <=
berghofe
parents: 22102
diff changeset
   474
      val ctxt'' = fold Variable.declare_term props ctxt';
51411098e49b - Improved handling of monotonicity rules involving <=
berghofe
parents: 22102
diff changeset
   475
      val rules = ProofContext.export ctxt'' ctxt (map (mk_cases ctxt'') props)
51411098e49b - Improved handling of monotonicity rules involving <=
berghofe
parents: 22102
diff changeset
   476
    in Method.erule 0 rules end);
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   477
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   478
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   479
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   480
(* prove induction rule *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   481
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   482
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
   483
    fp_def rec_preds_defs ctxt =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   484
  let
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   485
    val _ = clean_message "  Proving the induction rule ...";
20047
e23a3afaaa8a Goal.prove_global;
wenzelm
parents: 19874
diff changeset
   486
    val thy = ProofContext.theory_of ctxt;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   487
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   488
    (* predicates for induction rule *)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   489
22605
41b092e7d89a - Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents: 22460
diff changeset
   490
    val (pnames, ctxt') = ctxt |>
41b092e7d89a - Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents: 22460
diff changeset
   491
      Variable.add_fixes (map (fst o dest_Free) params) |> snd |>
41b092e7d89a - Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents: 22460
diff changeset
   492
      Variable.variant_fixes (mk_names "P" (length cs));
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   493
    val preds = map Free (pnames ~~
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   494
      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
   495
        HOLogic.boolT) cs);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   496
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   497
    (* transform an introduction rule into a premise for induction rule *)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   498
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   499
    fun mk_ind_prem r =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   500
      let
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   501
        fun subst s = (case dest_predicate cs params s of
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   502
            SOME (_, i, ys, (_, Ts)) =>
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   503
              let
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   504
                val k = length Ts;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   505
                val bs = map Bound (k - 1 downto 0);
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   506
                val P = list_comb (List.nth (preds, i),
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   507
                  map (incr_boundvars k) ys @ bs);
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   508
                val Q = list_abs (mk_names "x" k ~~ Ts,
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   509
                  HOLogic.mk_binop inductive_conj_name
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   510
                    (list_comb (incr_boundvars k s, bs), P))
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   511
              in (Q, case Ts of [] => SOME (s, P) | _ => NONE) end
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   512
          | NONE => (case s of
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   513
              (t $ u) => (fst (subst t) $ fst (subst u), NONE)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   514
            | (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
   515
            | _ => (s, NONE)));
7293
959e060f4a2f Moved sum_case stuff from Sum to Datatype.
berghofe
parents: 7257
diff changeset
   516
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   517
        fun mk_prem (s, prems) = (case subst s of
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   518
              (_, SOME (t, u)) => t :: u :: prems
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   519
            | (t, _) => t :: prems);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   520
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   521
        val SOME (_, i, ys, _) = dest_predicate cs params
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   522
          (HOLogic.dest_Trueprop (Logic.strip_assums_concl r))
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   523
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   524
      in list_all_free (Logic.strip_params r,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   525
        Logic.list_implies (map HOLogic.mk_Trueprop (foldr mk_prem
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   526
          [] (map HOLogic.dest_Trueprop (Logic.strip_assums_hyp r))),
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   527
            HOLogic.mk_Trueprop (list_comb (List.nth (preds, i), ys))))
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   528
      end;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   529
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   530
    val ind_prems = map mk_ind_prem intr_ts;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   531
21526
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   532
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   533
    (* make conclusions for induction rules *)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   534
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   535
    val Tss = map (binder_types o fastype_of) preds;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   536
    val (xnames, ctxt'') =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   537
      Variable.variant_fixes (mk_names "x" (length (flat Tss))) ctxt';
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   538
    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
   539
        (map (fn (((xnames, Ts), c), P) =>
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   540
           let val frees = map Free (xnames ~~ Ts)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   541
           in HOLogic.mk_imp
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   542
             (list_comb (c, params @ frees), list_comb (P, frees))
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   543
           end) (unflat Tss xnames ~~ Tss ~~ cs ~~ preds)));
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   544
13626
282fbabec862 Fixed bug involving inductive definitions having equalities in the premises,
paulson
parents: 13197
diff changeset
   545
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   546
    (* make predicate for instantiation of abstract induction rule *)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   547
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   548
    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
   549
      (map_index (fn (i, P) => foldr HOLogic.mk_imp
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   550
         (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
   551
         (make_bool_args HOLogic.mk_not I bs i)) preds));
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   552
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   553
    val ind_concl = HOLogic.mk_Trueprop
23881
851c74f1bb69 moved class ord from Orderings.thy to HOL.thy
haftmann
parents: 23762
diff changeset
   554
      (HOLogic.mk_binrel "HOL.ord_class.less_eq" (rec_const, ind_pred));
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   555
13626
282fbabec862 Fixed bug involving inductive definitions having equalities in the premises,
paulson
parents: 13197
diff changeset
   556
    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
   557
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   558
    val induct = SkipProof.prove ctxt'' [] ind_prems ind_concl
20248
7916ce5bb069 Goal.prove: more tactic arguments;
wenzelm
parents: 20071
diff changeset
   559
      (fn {prems, ...} => EVERY
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   560
        [rewrite_goals_tac [inductive_conj_def],
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   561
         DETERM (rtac raw_fp_induct 1),
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   562
         REPEAT (resolve_tac [le_funI, le_boolI] 1),
22460
b4f96f343d6c inf_fun_eq and inf_bool_eq now with meta equality
haftmann
parents: 22422
diff changeset
   563
         rewrite_goals_tac (inf_fun_eq :: inf_bool_eq :: simp_thms'),
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   564
         (*This disjE separates out the introduction rules*)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   565
         REPEAT (FIRSTGOAL (eresolve_tac [disjE, exE, FalseE])),
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   566
         (*Now break down the individual cases.  No disjE here in case
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   567
           some premise involves disjunction.*)
13747
bf308fcfd08e Better treatment of equality in premises of inductive definitions. Less
paulson
parents: 13709
diff changeset
   568
         REPEAT (FIRSTGOAL (etac conjE ORELSE' bound_hyp_subst_tac)),
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   569
         REPEAT (FIRSTGOAL
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   570
           (resolve_tac [conjI, impI] ORELSE' (etac notE THEN' atac))),
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   571
         EVERY (map (fn prem => DEPTH_SOLVE_1 (ares_tac [rewrite_rule
22980
1226d861eefb Fixed bug that caused proof of induction theorem to fail if
berghofe
parents: 22846
diff changeset
   572
             (inductive_conj_def :: rec_preds_defs @ simp_thms') prem,
1226d861eefb Fixed bug that caused proof of induction theorem to fail if
berghofe
parents: 22846
diff changeset
   573
           conjI, refl] 1)) prems)]);
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   574
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   575
    val lemma = SkipProof.prove ctxt'' [] []
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   576
      (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
   577
        [rewrite_goals_tac rec_preds_defs,
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   578
         REPEAT (EVERY
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   579
           [REPEAT (resolve_tac [conjI, impI] 1),
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   580
            REPEAT (eresolve_tac [le_funE, le_boolE] 1),
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   581
            atac 1,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   582
            rewrite_goals_tac simp_thms',
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   583
            atac 1])])
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   584
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   585
  in singleton (ProofContext.export ctxt'' ctxt) (induct RS lemma) end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   586
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   587
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   588
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   589
(** specification of (co)inductive predicates **)
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   590
25978
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
   591
fun mk_ind_def group alt_name coind cs intr_ts monos
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   592
      params cnames_syn ctxt =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   593
  let
24915
fc90277c0dd7 integrated FixedPoint into Inductive
haftmann
parents: 24867
diff changeset
   594
    val fp_name = if coind then @{const_name Inductive.gfp} else @{const_name Inductive.lfp};
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   595
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   596
    val argTs = fold (fn c => fn Ts => Ts @
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   597
      (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
   598
    val k = log 2 1 (length cs);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   599
    val predT = replicate k HOLogic.boolT ---> argTs ---> HOLogic.boolT;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   600
    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
   601
      (("p", predT) :: (mk_names "x" (length argTs) ~~ argTs)));
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   602
    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
   603
      (map (rpair HOLogic.boolT) (mk_names "b" k)));
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   604
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   605
    fun subst t = (case dest_predicate cs params t of
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   606
        SOME (_, i, ts, (Ts, Us)) =>
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   607
          let
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   608
            val l = length Us;
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   609
            val zs = map Bound (l - 1 downto 0)
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   610
          in
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   611
            list_abs (map (pair "z") Us, list_comb (p,
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   612
              make_bool_args' bs i @ make_args argTs
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   613
                ((map (incr_boundvars l) ts ~~ Ts) @ (zs ~~ Us))))
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   614
          end
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   615
      | NONE => (case t of
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   616
          t1 $ t2 => subst t1 $ subst t2
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   617
        | Abs (x, T, u) => Abs (x, T, subst u)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   618
        | _ => t));
5149
10f0be29c0d1 Fixed bug in transform_rule.
berghofe
parents: 5120
diff changeset
   619
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   620
    (* transform an introduction rule into a conjunction  *)
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   621
    (*   [| p_i t; ... |] ==> p_j u                       *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   622
    (* is transformed into                                *)
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   623
    (*   b_j & x_j = u & p b_j t & ...                    *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   624
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   625
    fun transform_rule r =
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   626
      let
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   627
        val SOME (_, i, ts, (Ts, _)) = dest_predicate cs params
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   628
          (HOLogic.dest_Trueprop (Logic.strip_assums_concl r));
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   629
        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
   630
          map HOLogic.mk_eq (make_args' argTs xs Ts ~~ ts) @
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   631
          map (subst o HOLogic.dest_Trueprop)
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   632
            (Logic.strip_assums_hyp r)
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   633
      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
   634
        (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
   635
        (Logic.strip_params r)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   636
      end
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   637
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   638
    (* make a disjunction of all introduction rules *)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   639
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   640
    val fp_fun = fold_rev lambda (p :: bs @ xs)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   641
      (if null intr_ts then HOLogic.false_const
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   642
       else foldr1 HOLogic.mk_disj (map transform_rule intr_ts));
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   643
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   644
    (* add definiton of recursive predicates to theory *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   645
14235
281295a1bbaa Fixed bug in mk_ind_def that caused the inductive definition package to
berghofe
parents: 13747
diff changeset
   646
    val rec_name = if alt_name = "" then
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   647
      space_implode "_" (map fst cnames_syn) else alt_name;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   648
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   649
    val ((rec_const, (_, fp_def)), ctxt') = ctxt |>
25978
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
   650
      LocalTheory.define_grouped Thm.internalK group
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   651
        ((rec_name, case cnames_syn of [(_, syn)] => syn | _ => NoSyn),
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   652
         (("", []), fold_rev lambda params
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   653
           (Const (fp_name, (predT --> predT) --> predT) $ fp_fun)));
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   654
    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
   655
      (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
   656
    val specs = if length cs < 2 then [] else
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   657
      map_index (fn (i, (name_mx, c)) =>
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   658
        let
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   659
          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
   660
          val xs = map Free (Variable.variant_frees ctxt intr_ts
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   661
            (mk_names "x" (length Ts) ~~ Ts))
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   662
        in
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   663
          (name_mx, (("", []), fold_rev lambda (params @ xs)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   664
            (list_comb (rec_const, params @ make_bool_args' bs i @
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   665
              make_args argTs (xs ~~ Ts)))))
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   666
        end) (cnames_syn ~~ cs);
25978
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
   667
    val (consts_defs, ctxt'') = fold_map (LocalTheory.define_grouped Thm.internalK group) specs ctxt';
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   668
    val preds = (case cs of [_] => [rec_const] | _ => map #1 consts_defs);
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   669
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   670
    val mono = prove_mono predT fp_fun monos ctxt''
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   671
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   672
  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
   673
    list_comb (rec_const, params), preds, argTs, bs, xs)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   674
  end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   675
25978
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
   676
fun declare_rules kind group rec_name coind no_ind cnames intrs intr_names intr_atts
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   677
      elims raw_induct ctxt =
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   678
  let
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   679
    val ind_case_names = RuleCases.case_names intr_names;
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   680
    val induct =
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   681
      if coind then
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   682
        (raw_induct, [RuleCases.case_names [rec_name],
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   683
          RuleCases.case_conclusion (rec_name, intr_names),
24861
cc669ca5f382 tuned Induct interface: prefer pred'' over set'';
wenzelm
parents: 24830
diff changeset
   684
          RuleCases.consumes 1, Induct.coinduct_pred (hd cnames)])
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   685
      else if no_ind orelse length cnames > 1 then
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   686
        (raw_induct, [ind_case_names, RuleCases.consumes 0])
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   687
      else (raw_induct RSN (2, rev_mp), [ind_case_names, RuleCases.consumes 1]);
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   688
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   689
    val (intrs', ctxt1) =
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   690
      ctxt |>
25978
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
   691
      LocalTheory.notes_grouped kind group
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   692
        (map (NameSpace.qualified rec_name) intr_names ~~
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   693
         intr_atts ~~ map (fn th => [([th],
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   694
           [Attrib.internal (K (ContextRules.intro_query NONE))])]) intrs) |>>
24744
dcb8cf5fc99c - add_inductive_i now takes typ instead of typ option as argument
berghofe
parents: 24721
diff changeset
   695
      map (hd o snd);
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   696
    val (((_, elims'), (_, [induct'])), ctxt2) =
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   697
      ctxt1 |>
25978
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
   698
      LocalTheory.note_grouped kind group ((NameSpace.qualified rec_name "intros", []), intrs') ||>>
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   699
      fold_map (fn (name, (elim, cases)) =>
25978
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
   700
        LocalTheory.note_grouped kind group ((NameSpace.qualified (Sign.base_name name) "cases",
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   701
          [Attrib.internal (K (RuleCases.case_names cases)),
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   702
           Attrib.internal (K (RuleCases.consumes 1)),
24861
cc669ca5f382 tuned Induct interface: prefer pred'' over set'';
wenzelm
parents: 24830
diff changeset
   703
           Attrib.internal (K (Induct.cases_pred name)),
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   704
           Attrib.internal (K (ContextRules.elim_query NONE))]), [elim]) #>
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   705
        apfst (hd o snd)) (if null elims then [] else cnames ~~ elims) ||>>
25978
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
   706
      LocalTheory.note_grouped kind group ((NameSpace.qualified rec_name (coind_prefix coind ^ "induct"),
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   707
        map (Attrib.internal o K) (#2 induct)), [rulify (#1 induct)]);
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   708
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   709
    val ctxt3 = if no_ind orelse coind then ctxt2 else
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   710
      let val inducts = cnames ~~ ProjectRule.projects ctxt2 (1 upto length cnames) induct'
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   711
      in
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   712
        ctxt2 |>
25978
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
   713
        LocalTheory.notes_grouped kind group [((NameSpace.qualified rec_name "inducts", []),
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   714
          inducts |> map (fn (name, th) => ([th],
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   715
            [Attrib.internal (K ind_case_names),
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   716
             Attrib.internal (K (RuleCases.consumes 1)),
24861
cc669ca5f382 tuned Induct interface: prefer pred'' over set'';
wenzelm
parents: 24830
diff changeset
   717
             Attrib.internal (K (Induct.induct_pred name))])))] |> snd
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   718
      end
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   719
  in (intrs', elims', induct', ctxt3) end;
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   720
24815
f7093e90f36c tuned internal interfaces: flags record, added kind for results;
wenzelm
parents: 24744
diff changeset
   721
type add_ind_def =
25978
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
   722
  {verbose: bool, kind: string, group: string, alt_name: bstring,
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
   723
    coind: bool, no_elim: bool, no_ind: bool} ->
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   724
  term list -> ((string * Attrib.src list) * term) list -> thm list ->
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   725
  term list -> (string * mixfix) list ->
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   726
  local_theory -> inductive_result * local_theory
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   727
25978
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
   728
fun add_ind_def {verbose, kind, group, alt_name, coind, no_elim, no_ind}
24815
f7093e90f36c tuned internal interfaces: flags record, added kind for results;
wenzelm
parents: 24744
diff changeset
   729
    cs intros monos params cnames_syn ctxt =
9072
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   730
  let
25288
6e0c8dd213df improved error message for missing predicates;
wenzelm
parents: 25143
diff changeset
   731
    val _ = null cnames_syn andalso error "No inductive predicates given";
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   732
    val _ =
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   733
      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
   734
        commas_quote (map fst cnames_syn)) else ();
9072
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   735
21526
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   736
    val cnames = map (Sign.full_name (ProofContext.theory_of ctxt) o #1) cnames_syn;  (* FIXME *)
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   737
    val ((intr_names, intr_atts), intr_ts) =
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   738
      apfst split_list (split_list (map (check_rule ctxt cs params) intros));
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   739
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   740
    val (ctxt1, rec_name, mono, fp_def, rec_preds_defs, rec_const, preds,
25978
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
   741
      argTs, bs, xs) = mk_ind_def group alt_name coind cs intr_ts
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   742
        monos params cnames_syn ctxt;
9072
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   743
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   744
    val (intrs, unfold) = prove_intrs coind mono fp_def (length bs + length xs)
22605
41b092e7d89a - Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents: 22460
diff changeset
   745
      params intr_ts rec_preds_defs ctxt1;
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   746
    val elims = if no_elim then [] else
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   747
      prove_elims cs params intr_ts intr_names unfold rec_preds_defs ctxt1;
22605
41b092e7d89a - Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents: 22460
diff changeset
   748
    val raw_induct = zero_var_indexes
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   749
      (if no_ind then Drule.asm_rl else
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   750
       if coind then
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   751
         singleton (ProofContext.export
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   752
           (snd (Variable.add_fixes (map (fst o dest_Free) params) ctxt1)) ctxt1)
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   753
           (rotate_prems ~1 (ObjectLogic.rulify (rule_by_tactic
25510
38c15efe603b adjustions to due to instance target
haftmann
parents: 25380
diff changeset
   754
             (rewrite_tac [le_fun_def, le_bool_def, sup_fun_eq, sup_bool_eq] THEN
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   755
               fold_tac rec_preds_defs) (mono RS (fp_def RS def_coinduct)))))
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   756
       else
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   757
         prove_indrule cs argTs bs xs rec_const params intr_ts mono fp_def
22605
41b092e7d89a - Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents: 22460
diff changeset
   758
           rec_preds_defs ctxt1);
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   759
25978
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
   760
    val (intrs', elims', induct, ctxt2) = declare_rules kind group rec_name coind no_ind
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   761
      cnames intrs intr_names intr_atts elims raw_induct ctxt1;
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   762
21526
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   763
    val names = map #1 cnames_syn;
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   764
    val result =
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   765
      {preds = preds,
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   766
       intrs = intrs',
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   767
       elims = elims',
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   768
       raw_induct = rulify raw_induct,
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   769
       induct = induct};
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   770
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   771
    val ctxt3 = ctxt2
21526
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   772
      |> LocalTheory.declaration (fn phi =>
25380
03201004c77e put_inductives: be permissive about multiple versions
wenzelm
parents: 25365
diff changeset
   773
        let val result' = morph_result phi result;
03201004c77e put_inductives: be permissive about multiple versions
wenzelm
parents: 25365
diff changeset
   774
        in put_inductives cnames (*global names!?*) ({names = cnames, coind = coind}, result') end);
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   775
  in (result, ctxt3) end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   776
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   777
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   778
(* external interfaces *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   779
25978
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
   780
fun gen_add_inductive_i mk_def (flags as {verbose, kind, group, alt_name, coind, no_elim, no_ind})
25029
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   781
    cnames_syn pnames spec monos lthy =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   782
  let
25029
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   783
    val thy = ProofContext.theory_of lthy;
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   784
    val _ = Theory.requires thy "Inductive" (coind_prefix coind ^ "inductive definitions");
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
25029
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   787
    (* abbrevs *)
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   788
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   789
    val (_, ctxt1) = Variable.add_fixes (map (fst o fst) cnames_syn) lthy;
21766
3eb48154388e Abbreviations can now be specified simultaneously
berghofe
parents: 21658
diff changeset
   790
25029
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   791
    fun get_abbrev ((name, atts), t) =
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   792
      if can (Logic.strip_assums_concl #> Logic.dest_equals) t then
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   793
        let
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   794
          val _ = name = "" andalso null atts orelse
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   795
            error "Abbreviations may not have names or attributes";
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   796
          val ((x, T), rhs) = LocalDefs.abs_def (snd (LocalDefs.cert_def ctxt1 t));
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   797
          val mx =
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   798
            (case find_first (fn ((c, _), _) => c = x) cnames_syn of
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   799
              NONE => error ("Undeclared head of abbreviation " ^ quote x)
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   800
            | SOME ((_, T'), mx) =>
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   801
                if T <> T' then error ("Bad type specification for abbreviation " ^ quote x)
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   802
                else mx);
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   803
        in SOME ((x, mx), rhs) end
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   804
      else NONE;
21766
3eb48154388e Abbreviations can now be specified simultaneously
berghofe
parents: 21658
diff changeset
   805
25029
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   806
    val abbrevs = map_filter get_abbrev spec;
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   807
    val bs = map (fst o fst) abbrevs;
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   808
21766
3eb48154388e Abbreviations can now be specified simultaneously
berghofe
parents: 21658
diff changeset
   809
25029
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   810
    (* predicates *)
21766
3eb48154388e Abbreviations can now be specified simultaneously
berghofe
parents: 21658
diff changeset
   811
25029
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   812
    val pre_intros = filter_out (is_some o get_abbrev) spec;
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   813
    val cnames_syn' = filter_out (member (op =) bs o fst o fst) cnames_syn;
24744
dcb8cf5fc99c - add_inductive_i now takes typ instead of typ option as argument
berghofe
parents: 24721
diff changeset
   814
    val cs = map (Free o fst) cnames_syn';
25029
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   815
    val ps = map Free pnames;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   816
25143
2a1acc88a180 abbrevs within inductive definitions may no longer depend on each other (reflects in internal organization, particularly for output);
wenzelm
parents: 25114
diff changeset
   817
    val (_, ctxt2) = lthy |> Variable.add_fixes (map (fst o fst) cnames_syn');
2a1acc88a180 abbrevs within inductive definitions may no longer depend on each other (reflects in internal organization, particularly for output);
wenzelm
parents: 25114
diff changeset
   818
    val _ = map (fn abbr => LocalDefs.fixed_abbrev abbr ctxt2) abbrevs;
2a1acc88a180 abbrevs within inductive definitions may no longer depend on each other (reflects in internal organization, particularly for output);
wenzelm
parents: 25114
diff changeset
   819
    val ctxt3 = ctxt2 |> fold (snd oo LocalDefs.fixed_abbrev) abbrevs;
2a1acc88a180 abbrevs within inductive definitions may no longer depend on each other (reflects in internal organization, particularly for output);
wenzelm
parents: 25114
diff changeset
   820
    val expand = Assumption.export_term ctxt3 lthy #> ProofContext.cert_term lthy;
25029
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   821
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   822
    fun close_rule r = list_all_free (rev (fold_aterms
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   823
      (fn t as Free (v as (s, _)) =>
25029
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   824
          if Variable.is_fixed ctxt1 s orelse
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   825
            member (op =) ps t then I else insert (op =) v
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   826
        | _ => I) r []), r);
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   827
25029
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   828
    val intros = map (apsnd (close_rule #> expand)) pre_intros;
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   829
    val preds = map (fn ((c, _), mx) => (c, mx)) cnames_syn';
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   830
  in
25029
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   831
    lthy
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   832
    |> mk_def flags cs intros monos ps preds
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   833
    ||> fold (snd oo LocalTheory.abbrev Syntax.mode_default) abbrevs
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   834
  end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   835
24721
2a029b78db60 proper Specification.read_specification;
wenzelm
parents: 24516
diff changeset
   836
fun gen_add_inductive mk_def verbose coind cnames_syn pnames_syn intro_srcs raw_monos lthy =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   837
  let
25114
7aa178165ee4 add_inductive: more careful handling of abbrevs -- do not expand prematurely;
wenzelm
parents: 25035
diff changeset
   838
    val ((vars, specs), _) = lthy |> ProofContext.set_mode ProofContext.mode_abbrev
7aa178165ee4 add_inductive: more careful handling of abbrevs -- do not expand prematurely;
wenzelm
parents: 25035
diff changeset
   839
      |> Specification.read_specification
7aa178165ee4 add_inductive: more careful handling of abbrevs -- do not expand prematurely;
wenzelm
parents: 25035
diff changeset
   840
          (cnames_syn @ pnames_syn) (map (fn (a, s) => [(a, [s])]) intro_srcs);
24721
2a029b78db60 proper Specification.read_specification;
wenzelm
parents: 24516
diff changeset
   841
    val (cs, ps) = chop (length cnames_syn) vars;
2a029b78db60 proper Specification.read_specification;
wenzelm
parents: 24516
diff changeset
   842
    val intrs = map (apsnd the_single) specs;
2a029b78db60 proper Specification.read_specification;
wenzelm
parents: 24516
diff changeset
   843
    val monos = Attrib.eval_thms lthy raw_monos;
25978
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
   844
    val flags = {verbose = verbose, kind = Thm.theoremK, group = serial_string (), alt_name = "",
24815
f7093e90f36c tuned internal interfaces: flags record, added kind for results;
wenzelm
parents: 24744
diff changeset
   845
      coind = coind, no_elim = false, no_ind = false};
f7093e90f36c tuned internal interfaces: flags record, added kind for results;
wenzelm
parents: 24744
diff changeset
   846
  in gen_add_inductive_i mk_def flags cs (map fst ps) intrs monos lthy end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   847
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   848
val add_inductive_i = gen_add_inductive_i add_ind_def;
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   849
val add_inductive = gen_add_inductive add_ind_def;
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   850
25380
03201004c77e put_inductives: be permissive about multiple versions
wenzelm
parents: 25365
diff changeset
   851
fun add_inductive_global flags cnames_syn pnames pre_intros monos thy =
03201004c77e put_inductives: be permissive about multiple versions
wenzelm
parents: 25365
diff changeset
   852
  let
03201004c77e put_inductives: be permissive about multiple versions
wenzelm
parents: 25365
diff changeset
   853
    val name = Sign.full_name thy (fst (fst (hd cnames_syn)));
03201004c77e put_inductives: be permissive about multiple versions
wenzelm
parents: 25365
diff changeset
   854
    val ctxt' = thy
03201004c77e put_inductives: be permissive about multiple versions
wenzelm
parents: 25365
diff changeset
   855
      |> TheoryTarget.init NONE
03201004c77e put_inductives: be permissive about multiple versions
wenzelm
parents: 25365
diff changeset
   856
      |> add_inductive_i flags cnames_syn pnames pre_intros monos |> snd
03201004c77e put_inductives: be permissive about multiple versions
wenzelm
parents: 25365
diff changeset
   857
      |> LocalTheory.exit;
03201004c77e put_inductives: be permissive about multiple versions
wenzelm
parents: 25365
diff changeset
   858
    val info = #2 (the_inductive ctxt' name);
03201004c77e put_inductives: be permissive about multiple versions
wenzelm
parents: 25365
diff changeset
   859
  in (info, ProofContext.theory_of ctxt') end;
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   860
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   861
22789
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   862
(* read off arities of inductive predicates from raw induction rule *)
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   863
fun arities_of induct =
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   864
  map (fn (_ $ t $ u) =>
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   865
      (fst (dest_Const (head_of t)), length (snd (strip_comb u))))
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   866
    (HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of induct)));
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   867
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   868
(* read off parameters of inductive predicate from raw induction rule *)
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   869
fun params_of induct =
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   870
  let
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   871
    val (_ $ t $ u :: _) =
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   872
      HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of induct));
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   873
    val (_, ts) = strip_comb t;
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   874
    val (_, us) = strip_comb u
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   875
  in
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   876
    List.take (ts, length ts - length us)
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   877
  end;
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   878
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   879
val pname_of_intr =
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   880
  concl_of #> HOLogic.dest_Trueprop #> head_of #> dest_Const #> fst;
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   881
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   882
(* partition introduction rules according to predicate name *)
25822
05756950011c Added function partition_rules'.
berghofe
parents: 25510
diff changeset
   883
fun gen_partition_rules f induct intros =
05756950011c Added function partition_rules'.
berghofe
parents: 25510
diff changeset
   884
  fold_rev (fn r => AList.map_entry op = (pname_of_intr (f r)) (cons r)) intros
22789
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   885
    (map (rpair [] o fst) (arities_of induct));
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   886
25822
05756950011c Added function partition_rules'.
berghofe
parents: 25510
diff changeset
   887
val partition_rules = gen_partition_rules I;
05756950011c Added function partition_rules'.
berghofe
parents: 25510
diff changeset
   888
fun partition_rules' induct = gen_partition_rules fst induct;
05756950011c Added function partition_rules'.
berghofe
parents: 25510
diff changeset
   889
22789
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   890
fun unpartition_rules intros xs =
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   891
  fold_map (fn r => AList.map_entry_yield op = (pname_of_intr r)
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   892
    (fn x :: xs => (x, xs)) #>> the) intros xs |> fst;
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   893
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   894
(* infer order of variables in intro rules from order of quantifiers in elim rule *)
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   895
fun infer_intro_vars elim arity intros =
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   896
  let
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   897
    val thy = theory_of_thm elim;
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   898
    val _ :: cases = prems_of elim;
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   899
    val used = map (fst o fst) (Term.add_vars (prop_of elim) []);
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   900
    fun mtch (t, u) =
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   901
      let
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   902
        val params = Logic.strip_params t;
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   903
        val vars = map (Var o apfst (rpair 0))
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   904
          (Name.variant_list used (map fst params) ~~ map snd params);
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   905
        val ts = map (curry subst_bounds (rev vars))
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   906
          (List.drop (Logic.strip_assums_hyp t, arity));
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   907
        val us = Logic.strip_imp_prems u;
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   908
        val tab = fold (Pattern.first_order_match thy) (ts ~~ us)
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   909
          (Vartab.empty, Vartab.empty);
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   910
      in
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   911
        map (Envir.subst_vars tab) vars
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   912
      end
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   913
  in
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   914
    map (mtch o apsnd prop_of) (cases ~~ intros)
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   915
  end;
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   916
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
   917
25978
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
   918
6437
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   919
(** package setup **)
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   920
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   921
(* setup theory *)
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   922
8634
3f34637cb9c0 use Attrib.add_del_args;
wenzelm
parents: 8433
diff changeset
   923
val setup =
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   924
  Method.add_methods [("ind_cases", ind_cases,
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   925
    "dynamic case analysis on predicates")] #>
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   926
  Attrib.add_attributes [("mono", Attrib.add_del_args mono_add mono_del,
18728
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   927
    "declaration of monotonicity rule")];
6437
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   928
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   929
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   930
(* outer syntax *)
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   931
17057
0934ac31985f OuterKeyword;
wenzelm
parents: 17010
diff changeset
   932
local structure P = OuterParse and K = OuterKeyword in
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   933
24867
e5b55d7be9bb simplified interfaces for outer syntax;
wenzelm
parents: 24861
diff changeset
   934
val _ = OuterSyntax.keywords ["monos"];
e5b55d7be9bb simplified interfaces for outer syntax;
wenzelm
parents: 24861
diff changeset
   935
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   936
fun flatten_specification specs = specs |> maps
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   937
  (fn (a, (concl, [])) => concl |> map
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   938
        (fn ((b, atts), [B]) =>
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   939
              if a = "" then ((b, atts), B)
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   940
              else if b = "" then ((a, atts), B)
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   941
              else error ("Illegal nested case names " ^ quote (NameSpace.append a b))
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   942
          | ((b, _), _) => error ("Illegal simultaneous specification " ^ quote b))
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   943
    | (a, _) => error ("Illegal local specification parameters for " ^ quote a));
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   944
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   945
fun gen_ind_decl mk_def coind =
22102
a89ef7144729 moved parts of OuterParse to SpecParse;
wenzelm
parents: 21879
diff changeset
   946
  P.opt_target --
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   947
  P.fixes -- P.for_fixes --
22102
a89ef7144729 moved parts of OuterParse to SpecParse;
wenzelm
parents: 21879
diff changeset
   948
  Scan.optional (P.$$$ "where" |-- P.!!! SpecParse.specification) [] --
a89ef7144729 moved parts of OuterParse to SpecParse;
wenzelm
parents: 21879
diff changeset
   949
  Scan.optional (P.$$$ "monos" |-- P.!!! SpecParse.xthms1) []
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   950
  >> (fn ((((loc, preds), params), specs), monos) =>
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   951
    Toplevel.local_theory loc
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   952
      (fn lthy => lthy |> gen_add_inductive mk_def true coind preds params
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   953
         (flatten_specification specs) monos |> snd));
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   954
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   955
val ind_decl = gen_ind_decl add_ind_def;
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   956
24867
e5b55d7be9bb simplified interfaces for outer syntax;
wenzelm
parents: 24861
diff changeset
   957
val _ = OuterSyntax.command "inductive" "define inductive predicates" K.thy_decl (ind_decl false);
e5b55d7be9bb simplified interfaces for outer syntax;
wenzelm
parents: 24861
diff changeset
   958
val _ = OuterSyntax.command "coinductive" "define coinductive predicates" K.thy_decl (ind_decl true);
6723
f342449d73ca outer syntax keyword classification;
wenzelm
parents: 6556
diff changeset
   959
24867
e5b55d7be9bb simplified interfaces for outer syntax;
wenzelm
parents: 24861
diff changeset
   960
val _ =
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   961
  OuterSyntax.command "inductive_cases"
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   962
    "create simplified instances of elimination rules (improper)" K.thy_script
22102
a89ef7144729 moved parts of OuterParse to SpecParse;
wenzelm
parents: 21879
diff changeset
   963
    (P.opt_target -- P.and_list1 SpecParse.spec
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   964
      >> (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
   965
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   966
end;
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   967
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   968
end;