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