src/HOL/Tools/inductive.ML
author bulwahn
Wed, 07 Jul 2010 08:25:21 +0200
changeset 37734 489ac1ecb9f1
parent 37264 8b931fb51cc6
child 37901 ea7d4423cb5b
permissions -rw-r--r--
added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
31723
f5cafe803b55 discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents: 31177
diff changeset
     1
(*  Title:      HOL/Tools/inductive.ML
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
     2
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
     3
    Author:     Stefan Berghofer and Markus Wenzel, TU Muenchen
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
     4
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
     5
(Co)Inductive Definition module for HOL.
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
     6
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
     7
Features:
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
     8
  * least or greatest fixedpoints
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
     9
  * mutually recursive definitions
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
    10
  * definitions involving arbitrary monotone operators
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
    11
  * automatically proves introduction and elimination rules
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    12
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    13
  Introduction rules have the form
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    14
  [| M Pj ti, ..., Q x, ... |] ==> Pk t
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    15
  where M is some monotone operator (usually the identity)
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    16
  Q x is any side condition on the free variables
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    17
  ti, t are any terms
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
    18
  Pj, Pk are two of the predicates being defined in mutual recursion
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    19
*)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    20
31723
f5cafe803b55 discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents: 31177
diff changeset
    21
signature BASIC_INDUCTIVE =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    22
sig
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
    23
  type inductive_result =
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
    24
    {preds: term list, elims: thm list, raw_induct: thm,
37734
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
    25
     induct: thm, inducts: thm list, intrs: thm list, eqs: thm list}
21526
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
    26
  val morph_result: morphism -> inductive_result -> inductive_result
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
    27
  type inductive_info = {names: string list, coind: bool} * inductive_result
21526
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
    28
  val the_inductive: Proof.context -> string -> inductive_info
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
    29
  val print_inductives: Proof.context -> unit
18728
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
    30
  val mono_add: attribute
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
    31
  val mono_del: attribute
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
    32
  val get_monos: Proof.context -> thm list
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
    33
  val mk_cases: Proof.context -> term -> thm
10910
058775a575db export inductive_forall_name, inductive_forall_def, rulify;
wenzelm
parents: 10804
diff changeset
    34
  val inductive_forall_name: string
058775a575db export inductive_forall_name, inductive_forall_def, rulify;
wenzelm
parents: 10804
diff changeset
    35
  val inductive_forall_def: thm
058775a575db export inductive_forall_name, inductive_forall_def, rulify;
wenzelm
parents: 10804
diff changeset
    36
  val rulify: thm -> thm
28839
32d498cf7595 eliminated rewrite_tac/fold_tac, which are not well-formed tactics due to change of main conclusion;
wenzelm
parents: 28791
diff changeset
    37
  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
    38
    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
    39
  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
    40
    thm list list * local_theory
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
    41
  type inductive_flags =
33669
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33666
diff changeset
    42
    {quiet_mode: bool, verbose: bool, alt_name: binding, coind: bool,
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33666
diff changeset
    43
      no_elim: bool, no_ind: bool, skip_mono: bool, fork_mono: bool}
24815
f7093e90f36c tuned internal interfaces: flags record, added kind for results;
wenzelm
parents: 24744
diff changeset
    44
  val add_inductive_i:
29581
b3b33e0298eb binding is alias for Binding.T
haftmann
parents: 29388
diff changeset
    45
    inductive_flags -> ((binding * typ) * mixfix) list ->
28084
a05ca48ef263 type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents: 28083
diff changeset
    46
    (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
    47
    inductive_result * local_theory
28083
103d9282a946 explicit type Name.binding for higher-specification elements;
wenzelm
parents: 27882
diff changeset
    48
  val add_inductive: bool -> bool ->
29581
b3b33e0298eb binding is alias for Binding.T
haftmann
parents: 29388
diff changeset
    49
    (binding * string option * mixfix) list ->
b3b33e0298eb binding is alias for Binding.T
haftmann
parents: 29388
diff changeset
    50
    (binding * string option * mixfix) list ->
28084
a05ca48ef263 type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents: 28083
diff changeset
    51
    (Attrib.binding * string) list ->
28083
103d9282a946 explicit type Name.binding for higher-specification elements;
wenzelm
parents: 27882
diff changeset
    52
    (Facts.ref * Attrib.src list) list ->
29388
79eb3649ca9e added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents: 29064
diff changeset
    53
    bool -> local_theory -> inductive_result * local_theory
33726
0878aecbf119 eliminated slightly odd name space grouping -- now managed by Isar toplevel;
wenzelm
parents: 33671
diff changeset
    54
  val add_inductive_global: inductive_flags ->
29581
b3b33e0298eb binding is alias for Binding.T
haftmann
parents: 29388
diff changeset
    55
    ((binding * typ) * mixfix) list -> (string * typ) list -> (Attrib.binding * term) list ->
28084
a05ca48ef263 type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents: 28083
diff changeset
    56
    thm list -> theory -> inductive_result * theory
22789
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
    57
  val arities_of: thm -> (string * int) list
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
    58
  val params_of: thm -> term list
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
    59
  val partition_rules: thm -> thm list -> (string * thm list) list
25822
05756950011c Added function partition_rules'.
berghofe
parents: 25510
diff changeset
    60
  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
    61
  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
    62
  val infer_intro_vars: thm -> int -> thm list -> term list list
18708
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18678
diff changeset
    63
  val setup: theory -> theory
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    64
end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    65
31723
f5cafe803b55 discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents: 31177
diff changeset
    66
signature INDUCTIVE =
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    67
sig
31723
f5cafe803b55 discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents: 31177
diff changeset
    68
  include BASIC_INDUCTIVE
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
    69
  type add_ind_def =
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
    70
    inductive_flags ->
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
    71
    term list -> (Attrib.binding * term) list -> thm list ->
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
    72
    term list -> (binding * mixfix) list ->
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
    73
    local_theory -> inductive_result * local_theory
35757
c2884bec5463 adding Spec_Rules to definitional package inductive and inductive_set
bulwahn
parents: 35646
diff changeset
    74
  val declare_rules: binding -> bool -> bool -> string list -> term list ->
34986
7f7939c9370f Added "constraints" tag / attribute for specifying the number of equality
berghofe
parents: 33966
diff changeset
    75
    thm list -> binding list -> Attrib.src list list -> (thm * string list * int) list ->
37734
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
    76
    thm list -> thm -> local_theory -> thm list * thm list * thm list * thm * thm list * local_theory
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    77
  val add_ind_def: add_ind_def
28083
103d9282a946 explicit type Name.binding for higher-specification elements;
wenzelm
parents: 27882
diff changeset
    78
  val gen_add_inductive_i: add_ind_def -> inductive_flags ->
29581
b3b33e0298eb binding is alias for Binding.T
haftmann
parents: 29388
diff changeset
    79
    ((binding * typ) * mixfix) list -> (string * typ) list -> (Attrib.binding * term) list ->
28084
a05ca48ef263 type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents: 28083
diff changeset
    80
    thm list -> local_theory -> inductive_result * local_theory
28083
103d9282a946 explicit type Name.binding for higher-specification elements;
wenzelm
parents: 27882
diff changeset
    81
  val gen_add_inductive: add_ind_def -> bool -> bool ->
29581
b3b33e0298eb binding is alias for Binding.T
haftmann
parents: 29388
diff changeset
    82
    (binding * string option * mixfix) list ->
b3b33e0298eb binding is alias for Binding.T
haftmann
parents: 29388
diff changeset
    83
    (binding * string option * mixfix) list ->
28084
a05ca48ef263 type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents: 28083
diff changeset
    84
    (Attrib.binding * string) list -> (Facts.ref * Attrib.src list) list ->
29388
79eb3649ca9e added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents: 29064
diff changeset
    85
    bool -> local_theory -> inductive_result * local_theory
36958
wenzelm
parents: 36954
diff changeset
    86
  val gen_ind_decl: add_ind_def -> bool -> (bool -> local_theory -> local_theory) parser
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    87
end;
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
    88
31723
f5cafe803b55 discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents: 31177
diff changeset
    89
structure Inductive: INDUCTIVE =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    90
struct
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    91
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
    92
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
    93
(** theory context references **)
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
    94
11991
da6ee05d9f3d use HOL.induct_XXX;
wenzelm
parents: 11880
diff changeset
    95
val inductive_forall_name = "HOL.induct_forall";
32602
f2b741473860 more antiquotations
haftmann
parents: 32181
diff changeset
    96
val inductive_forall_def = @{thm induct_forall_def};
11991
da6ee05d9f3d use HOL.induct_XXX;
wenzelm
parents: 11880
diff changeset
    97
val inductive_conj_name = "HOL.induct_conj";
32602
f2b741473860 more antiquotations
haftmann
parents: 32181
diff changeset
    98
val inductive_conj_def = @{thm induct_conj_def};
f2b741473860 more antiquotations
haftmann
parents: 32181
diff changeset
    99
val inductive_conj = @{thms induct_conj};
f2b741473860 more antiquotations
haftmann
parents: 32181
diff changeset
   100
val inductive_atomize = @{thms induct_atomize};
f2b741473860 more antiquotations
haftmann
parents: 32181
diff changeset
   101
val inductive_rulify = @{thms induct_rulify};
f2b741473860 more antiquotations
haftmann
parents: 32181
diff changeset
   102
val inductive_rulify_fallback = @{thms induct_rulify_fallback};
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   103
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   104
val notTrueE = TrueI RSN (2, notE);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   105
val notFalseI = Seq.hd (atac 1 notI);
32181
7e460c2d4223 more antiquotations instead of adhoc ML stuff;
wenzelm
parents: 32172
diff changeset
   106
7e460c2d4223 more antiquotations instead of adhoc ML stuff;
wenzelm
parents: 32172
diff changeset
   107
val simp_thms' = map mk_meta_eq
7e460c2d4223 more antiquotations instead of adhoc ML stuff;
wenzelm
parents: 32172
diff changeset
   108
  @{lemma "(~True) = False" "(~False) = True"
7e460c2d4223 more antiquotations instead of adhoc ML stuff;
wenzelm
parents: 32172
diff changeset
   109
      "(True --> P) = P" "(False --> P) = True"
7e460c2d4223 more antiquotations instead of adhoc ML stuff;
wenzelm
parents: 32172
diff changeset
   110
      "(P & True) = P" "(True & P) = P"
7e460c2d4223 more antiquotations instead of adhoc ML stuff;
wenzelm
parents: 32172
diff changeset
   111
    by (fact simp_thms)+};
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   112
32652
3175e23b79f3 stripped legacy ML bindings
haftmann
parents: 32610
diff changeset
   113
val simp_thms'' = map mk_meta_eq [@{thm inf_fun_eq}, @{thm inf_bool_eq}] @ simp_thms';
3175e23b79f3 stripped legacy ML bindings
haftmann
parents: 32610
diff changeset
   114
3175e23b79f3 stripped legacy ML bindings
haftmann
parents: 32610
diff changeset
   115
val simp_thms''' = map mk_meta_eq
3175e23b79f3 stripped legacy ML bindings
haftmann
parents: 32610
diff changeset
   116
  [@{thm le_fun_def}, @{thm le_bool_def}, @{thm sup_fun_eq}, @{thm sup_bool_eq}];
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   117
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   118
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   119
(** context data **)
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   120
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   121
type inductive_result =
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   122
  {preds: term list, elims: thm list, raw_induct: thm,
37734
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   123
   induct: thm, inducts: thm list, intrs: thm list, eqs: thm list};
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   124
37734
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   125
fun morph_result phi {preds, elims, raw_induct: thm, induct, inducts, intrs, eqs} =
21526
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   126
  let
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   127
    val term = Morphism.term phi;
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   128
    val thm = Morphism.thm phi;
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   129
    val fact = Morphism.fact phi;
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   130
  in
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   131
   {preds = map term preds, elims = fact elims, raw_induct = thm raw_induct,
37734
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   132
    induct = thm induct, inducts = fact inducts, intrs = fact intrs, eqs = fact eqs}
21526
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   133
  end;
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   134
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   135
type inductive_info =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   136
  {names: string list, coind: bool} * inductive_result;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   137
33519
e31a85f92ce9 adapted Generic_Data, Proof_Data;
wenzelm
parents: 33459
diff changeset
   138
structure InductiveData = Generic_Data
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   139
(
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   140
  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
   141
  val empty = (Symtab.empty, []);
16432
a6e8fb94a8ca accomodate change of TheoryDataFun;
wenzelm
parents: 16364
diff changeset
   142
  val extend = I;
33519
e31a85f92ce9 adapted Generic_Data, Proof_Data;
wenzelm
parents: 33459
diff changeset
   143
  fun merge ((tab1, monos1), (tab2, monos2)) : T =
24039
273698405054 renamed Drule.add/del/merge_rules to Thm.add/del/merge_thms;
wenzelm
parents: 23881
diff changeset
   144
    (Symtab.merge (K true) (tab1, tab2), Thm.merge_thms (monos1, monos2));
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   145
);
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   146
21526
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   147
val get_inductives = InductiveData.get o Context.Proof;
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   148
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   149
fun print_inductives ctxt =
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   150
  let
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   151
    val (tab, monos) = get_inductives ctxt;
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   152
    val space = Consts.space_of (ProofContext.consts_of ctxt);
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   153
  in
33095
bbd52d2f8696 renamed NameSpace to Name_Space -- also to emphasize its subtle change in semantics;
wenzelm
parents: 33077
diff changeset
   154
    [Pretty.strs ("(co)inductives:" :: map #1 (Name_Space.extern_table (space, tab))),
32091
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 32035
diff changeset
   155
     Pretty.big_list "monotonicity rules:" (map (Display.pretty_thm ctxt) monos)]
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   156
    |> Pretty.chunks |> Pretty.writeln
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22838
diff changeset
   157
  end;
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   158
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   159
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   160
(* get and put data *)
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   161
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   162
fun the_inductive ctxt name =
21526
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   163
  (case Symtab.lookup (#1 (get_inductives ctxt)) name of
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   164
    NONE => error ("Unknown (co)inductive predicate " ^ quote name)
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15525
diff changeset
   165
  | SOME info => info);
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   166
25380
03201004c77e put_inductives: be permissive about multiple versions
wenzelm
parents: 25365
diff changeset
   167
fun put_inductives names info = InductiveData.map
03201004c77e put_inductives: be permissive about multiple versions
wenzelm
parents: 25365
diff changeset
   168
  (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
   169
8277
493707fcd8a6 added cases_of, cases;
wenzelm
parents: 8100
diff changeset
   170
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   171
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   172
(** monotonicity rules **)
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   173
21526
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   174
val get_monos = #2 o get_inductives;
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   175
val map_monos = InductiveData.map o apsnd;
8277
493707fcd8a6 added cases_of, cases;
wenzelm
parents: 8100
diff changeset
   176
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   177
fun mk_mono thm =
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   178
  let
33933
e429668becc1 Simplified treatment of monotonicity rules.
berghofe
parents: 33766
diff changeset
   179
    fun eq2mono thm' = thm' RS (thm' RS eq_to_mono);
32652
3175e23b79f3 stripped legacy ML bindings
haftmann
parents: 32610
diff changeset
   180
    fun dest_less_concl thm = dest_less_concl (thm RS @{thm le_funD})
3175e23b79f3 stripped legacy ML bindings
haftmann
parents: 32610
diff changeset
   181
      handle THM _ => thm RS @{thm le_boolD}
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   182
  in
33933
e429668becc1 Simplified treatment of monotonicity rules.
berghofe
parents: 33766
diff changeset
   183
    case concl_of thm of
22275
51411098e49b - Improved handling of monotonicity rules involving <=
berghofe
parents: 22102
diff changeset
   184
      Const ("==", _) $ _ $ _ => eq2mono (thm RS meta_eq_to_obj_eq)
35364
b8c62d60195c more antiquotations;
wenzelm
parents: 35092
diff changeset
   185
    | _ $ (Const (@{const_name "op ="}, _) $ _ $ _) => eq2mono thm
35092
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 34991
diff changeset
   186
    | _ $ (Const (@{const_name Orderings.less_eq}, _) $ _ $ _) =>
33933
e429668becc1 Simplified treatment of monotonicity rules.
berghofe
parents: 33766
diff changeset
   187
      dest_less_concl (Seq.hd (REPEAT (FIRSTGOAL
e429668becc1 Simplified treatment of monotonicity rules.
berghofe
parents: 33766
diff changeset
   188
        (resolve_tac [@{thm le_funI}, @{thm le_boolI'}])) thm))
e429668becc1 Simplified treatment of monotonicity rules.
berghofe
parents: 33766
diff changeset
   189
    | _ => thm
32091
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 32035
diff changeset
   190
  end handle THM _ =>
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 32035
diff changeset
   191
    error ("Bad monotonicity theorem:\n" ^ Display.string_of_thm_without_context thm);
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   192
33933
e429668becc1 Simplified treatment of monotonicity rules.
berghofe
parents: 33766
diff changeset
   193
val mono_add = Thm.declaration_attribute (map_monos o Thm.add_thm o mk_mono);
e429668becc1 Simplified treatment of monotonicity rules.
berghofe
parents: 33766
diff changeset
   194
val mono_del = Thm.declaration_attribute (map_monos o 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
   195
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   196
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   197
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   198
(** misc utilities **)
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   199
26477
ecf06644f6cb eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents: 26336
diff changeset
   200
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
   201
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
   202
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   203
fun coind_prefix true = "co"
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   204
  | coind_prefix false = "";
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   205
24133
75063f96618f added int type constraints to accomodate hacked SML/NJ;
wenzelm
parents: 24039
diff changeset
   206
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
   207
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   208
fun make_bool_args f g [] i = []
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   209
  | make_bool_args f g (x :: xs) i =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   210
      (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
   211
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   212
fun make_bool_args' xs =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   213
  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
   214
33957
e9afca2118d4 normalized uncurry take/drop
haftmann
parents: 33955
diff changeset
   215
fun arg_types_of k c = drop k (binder_types (fastype_of c));
33077
3c9cf88ec841 arg_types_of auxiliary function; using multiset operations
haftmann
parents: 33056
diff changeset
   216
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   217
fun find_arg T x [] = sys_error "find_arg"
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   218
  | find_arg T x ((p as (_, (SOME _, _))) :: ps) =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   219
      apsnd (cons p) (find_arg T x ps)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   220
  | find_arg T x ((p as (U, (NONE, y))) :: ps) =
23577
c5b93c69afd3 avoid polymorphic equality;
wenzelm
parents: 22997
diff changeset
   221
      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
   222
      else apsnd (cons p) (find_arg T x ps);
7020
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   223
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   224
fun make_args Ts xs =
28524
644b62cf678f arbitrary is undefined
haftmann
parents: 28107
diff changeset
   225
  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
   226
    (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
   227
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   228
fun make_args' Ts xs Us =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   229
  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
   230
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   231
fun dest_predicate cs params t =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   232
  let
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   233
    val k = length params;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   234
    val (c, ts) = strip_comb t;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   235
    val (xs, ys) = chop k ts;
31986
a68f88d264f7 dropped find_index_eq
haftmann
parents: 31902
diff changeset
   236
    val i = find_index (fn c' => c' = c) cs;
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   237
  in
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   238
    if xs = params andalso i >= 0 then
33077
3c9cf88ec841 arg_types_of auxiliary function; using multiset operations
haftmann
parents: 33056
diff changeset
   239
      SOME (c, i, ys, chop (length ys) (arg_types_of k c))
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   240
    else NONE
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   241
  end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   242
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   243
fun mk_names a 0 = []
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   244
  | mk_names a 1 = [a]
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   245
  | 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
   246
37734
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   247
fun select_disj 1 1 = []
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   248
  | select_disj _ 1 = [rtac disjI1]
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   249
  | select_disj n i = (rtac disjI2)::(select_disj (n - 1) (i - 1));
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   250
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   251
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   252
(** process rules **)
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   253
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   254
local
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   255
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   256
fun err_in_rule ctxt name t msg =
16432
a6e8fb94a8ca accomodate change of TheoryDataFun;
wenzelm
parents: 16364
diff changeset
   257
  error (cat_lines ["Ill-formed introduction rule " ^ quote name,
24920
2a45e400fdad generic Syntax.pretty/string_of operations;
wenzelm
parents: 24915
diff changeset
   258
    Syntax.string_of_term ctxt t, msg]);
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   259
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   260
fun err_in_prem ctxt name t p msg =
24920
2a45e400fdad generic Syntax.pretty/string_of operations;
wenzelm
parents: 24915
diff changeset
   261
  error (cat_lines ["Ill-formed premise", Syntax.string_of_term ctxt p,
2a45e400fdad generic Syntax.pretty/string_of operations;
wenzelm
parents: 24915
diff changeset
   262
    "in introduction rule " ^ quote name, Syntax.string_of_term ctxt t, msg]);
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   263
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   264
val bad_concl = "Conclusion of introduction rule must be an inductive predicate";
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   265
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   266
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
   267
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   268
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
   269
16432
a6e8fb94a8ca accomodate change of TheoryDataFun;
wenzelm
parents: 16364
diff changeset
   270
fun atomize_term thy = MetaSimplifier.rewrite_term thy inductive_atomize [];
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   271
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   272
in
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   273
28083
103d9282a946 explicit type Name.binding for higher-specification elements;
wenzelm
parents: 27882
diff changeset
   274
fun check_rule ctxt cs params ((binding, att), rule) =
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   275
  let
30218
cdd82ba2b4fd Binding.str_of;
wenzelm
parents: 30190
diff changeset
   276
    val err_name = Binding.str_of binding;
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   277
    val params' = Term.variant_frees rule (Logic.strip_params rule);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   278
    val frees = rev (map Free params');
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   279
    val concl = subst_bounds (frees, Logic.strip_assums_concl rule);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   280
    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
   281
    val rule' = Logic.list_implies (prems, concl);
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   282
    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
   283
    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
   284
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   285
    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
   286
        NONE => err (bad_app ^
24920
2a45e400fdad generic Syntax.pretty/string_of operations;
wenzelm
parents: 24915
diff changeset
   287
          commas (map (Syntax.string_of_term ctxt) params))
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   288
      | SOME (_, _, ys, _) =>
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   289
          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
   290
          then err bad_ind_occ else ();
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   291
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   292
    fun check_prem' prem t =
36692
54b64d4ad524 farewell to old-style mem infixes -- type inference in situations with mem_int and mem_string should provide enough information to resolve the type of (op =)
haftmann
parents: 36642
diff changeset
   293
      if member (op =) cs (head_of t) then
29006
abe0f11cfa4e Name.name_of -> Binding.base_name
haftmann
parents: 28965
diff changeset
   294
        check_ind (err_in_prem ctxt err_name rule prem) t
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   295
      else (case t of
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   296
          Abs (_, _, t) => check_prem' prem t
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   297
        | t $ u => (check_prem' prem t; check_prem' prem u)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   298
        | _ => ());
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   299
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   300
    fun check_prem (prem, aprem) =
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   301
      if can HOLogic.dest_Trueprop aprem then check_prem' prem prem
29006
abe0f11cfa4e Name.name_of -> Binding.base_name
haftmann
parents: 28965
diff changeset
   302
      else err_in_prem ctxt err_name rule prem "Non-atomic premise";
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   303
  in
11358
416ea5c009f5 now checks for leading meta-quantifiers and complains, instead of
paulson
parents: 11036
diff changeset
   304
    (case concl of
35364
b8c62d60195c more antiquotations;
wenzelm
parents: 35092
diff changeset
   305
       Const (@{const_name Trueprop}, _) $ t =>
36692
54b64d4ad524 farewell to old-style mem infixes -- type inference in situations with mem_int and mem_string should provide enough information to resolve the type of (op =)
haftmann
parents: 36642
diff changeset
   306
         if member (op =) cs (head_of t) then
29006
abe0f11cfa4e Name.name_of -> Binding.base_name
haftmann
parents: 28965
diff changeset
   307
           (check_ind (err_in_rule ctxt err_name rule') t;
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   308
            List.app check_prem (prems ~~ aprems))
29006
abe0f11cfa4e Name.name_of -> Binding.base_name
haftmann
parents: 28965
diff changeset
   309
         else err_in_rule ctxt err_name rule' bad_concl
abe0f11cfa4e Name.name_of -> Binding.base_name
haftmann
parents: 28965
diff changeset
   310
     | _ => err_in_rule ctxt err_name rule' bad_concl);
28083
103d9282a946 explicit type Name.binding for higher-specification elements;
wenzelm
parents: 27882
diff changeset
   311
    ((binding, att), arule)
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   312
  end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   313
24744
dcb8cf5fc99c - add_inductive_i now takes typ instead of typ option as argument
berghofe
parents: 24721
diff changeset
   314
val rulify =
18222
a8ccacce3b52 declare coinduct rule;
wenzelm
parents: 17985
diff changeset
   315
  hol_simplify inductive_conj
18463
56414918dbbd actually produce projected rules;
wenzelm
parents: 18418
diff changeset
   316
  #> hol_simplify inductive_rulify
56414918dbbd actually produce projected rules;
wenzelm
parents: 18418
diff changeset
   317
  #> hol_simplify inductive_rulify_fallback
30552
58db56278478 provide Simplifier.norm_hhf(_protect) as regular simplifier operation;
wenzelm
parents: 30528
diff changeset
   318
  #> Simplifier.norm_hhf;
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   319
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   320
end;
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   321
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   322
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   323
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   324
(** proofs for (co)inductive predicates **)
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   325
26534
a2cb4de2a1aa Added skip_mono flag and inductive_flags type.
berghofe
parents: 26477
diff changeset
   326
(* prove monotonicity *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   327
36642
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   328
fun prove_mono quiet_mode skip_mono fork_mono predT fp_fun monos ctxt =
29388
79eb3649ca9e added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents: 29064
diff changeset
   329
 (message (quiet_mode orelse skip_mono andalso !quick_and_dirty orelse fork_mono)
26534
a2cb4de2a1aa Added skip_mono flag and inductive_flags type.
berghofe
parents: 26477
diff changeset
   330
    "  Proving monotonicity ...";
32970
fbd2bb2489a8 operations of structure Skip_Proof (formerly SkipProof) no longer require quick_and_dirty mode;
wenzelm
parents: 32952
diff changeset
   331
  (if skip_mono then Skip_Proof.prove else if fork_mono then Goal.prove_future else Goal.prove) ctxt
36642
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   332
    [] []
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   333
    (HOLogic.mk_Trueprop
24815
f7093e90f36c tuned internal interfaces: flags record, added kind for results;
wenzelm
parents: 24744
diff changeset
   334
      (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
   335
    (fn _ => EVERY [rtac @{thm monoI} 1,
32652
3175e23b79f3 stripped legacy ML bindings
haftmann
parents: 32610
diff changeset
   336
      REPEAT (resolve_tac [@{thm le_funI}, @{thm le_boolI'}] 1),
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   337
      REPEAT (FIRST
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   338
        [atac 1,
33933
e429668becc1 Simplified treatment of monotonicity rules.
berghofe
parents: 33766
diff changeset
   339
         resolve_tac (map mk_mono monos @ get_monos ctxt) 1,
32652
3175e23b79f3 stripped legacy ML bindings
haftmann
parents: 32610
diff changeset
   340
         etac @{thm le_funE} 1, dtac @{thm le_boolD} 1])]));
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   341
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   342
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   343
(* prove introduction rules *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   344
36642
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   345
fun prove_intrs quiet_mode coind mono fp_def k intr_ts rec_preds_defs ctxt ctxt' =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   346
  let
26477
ecf06644f6cb eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents: 26336
diff changeset
   347
    val _ = clean_message quiet_mode "  Proving the introduction rules ...";
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   348
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   349
    val unfold = funpow k (fn th => th RS fun_cong)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   350
      (mono RS (fp_def RS
32652
3175e23b79f3 stripped legacy ML bindings
haftmann
parents: 32610
diff changeset
   351
        (if coind then @{thm def_gfp_unfold} else @{thm def_lfp_unfold})));
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   352
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   353
    val rules = [refl, TrueI, notFalseI, exI, conjI];
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   354
36642
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   355
    val intrs = map_index (fn (i, intr) =>
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   356
      Skip_Proof.prove ctxt [] [] intr (fn _ => EVERY
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   357
       [rewrite_goals_tac rec_preds_defs,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   358
        rtac (unfold RS iffD2) 1,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   359
        EVERY1 (select_disj (length intr_ts) (i + 1)),
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   360
        (*Not ares_tac, since refl must be tried before any equality assumptions;
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   361
          backtracking may occur if the premises have extra variables!*)
36642
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   362
        DEPTH_SOLVE_1 (resolve_tac rules 1 APPEND assume_tac 1)])
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   363
       |> singleton (ProofContext.export ctxt ctxt')) intr_ts
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   364
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   365
  in (intrs, unfold) end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   366
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   367
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   368
(* prove elimination rules *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   369
36642
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   370
fun prove_elims quiet_mode cs params intr_ts intr_names unfold rec_preds_defs ctxt ctxt''' =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   371
  let
26477
ecf06644f6cb eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents: 26336
diff changeset
   372
    val _ = clean_message quiet_mode "  Proving the elimination rules ...";
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   373
36642
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   374
    val ([pname], ctxt') = Variable.variant_fixes ["P"] ctxt;
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   375
    val P = HOLogic.mk_Trueprop (Free (pname, HOLogic.boolT));
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   376
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   377
    fun dest_intr r =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   378
      (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
   379
       Logic.strip_assums_hyp r, Logic.strip_params r);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   380
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   381
    val intrs = map dest_intr intr_ts ~~ intr_names;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   382
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   383
    val rules1 = [disjE, exE, FalseE];
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   384
    val rules2 = [conjE, FalseE, notTrueE];
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   385
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   386
    fun prove_elim c =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   387
      let
33077
3c9cf88ec841 arg_types_of auxiliary function; using multiset operations
haftmann
parents: 33056
diff changeset
   388
        val Ts = arg_types_of (length params) c;
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   389
        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
   390
        val frees = map Free (anames ~~ Ts);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   391
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   392
        fun mk_elim_prem ((_, _, us, _), ts, params') =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   393
          list_all (params',
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   394
            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
   395
              (frees ~~ us) @ ts, P));
33317
b4534348b8fd standardized filter/filter_out;
wenzelm
parents: 33278
diff changeset
   396
        val c_intrs = filter (equal c o #1 o #1 o #1) intrs;
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   397
        val prems = HOLogic.mk_Trueprop (list_comb (c, params @ frees)) ::
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   398
           map mk_elim_prem (map #1 c_intrs)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   399
      in
32970
fbd2bb2489a8 operations of structure Skip_Proof (formerly SkipProof) no longer require quick_and_dirty mode;
wenzelm
parents: 32952
diff changeset
   400
        (Skip_Proof.prove ctxt'' [] prems P
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   401
          (fn {prems, ...} => EVERY
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   402
            [cut_facts_tac [hd prems] 1,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   403
             rewrite_goals_tac rec_preds_defs,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   404
             dtac (unfold RS iffD1) 1,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   405
             REPEAT (FIRSTGOAL (eresolve_tac rules1)),
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   406
             REPEAT (FIRSTGOAL (eresolve_tac rules2)),
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   407
             EVERY (map (fn prem =>
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   408
               DEPTH_SOLVE_1 (ares_tac [rewrite_rule rec_preds_defs prem, conjI] 1)) (tl prems))])
36642
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   409
          |> singleton (ProofContext.export ctxt'' ctxt'''),
34986
7f7939c9370f Added "constraints" tag / attribute for specifying the number of equality
berghofe
parents: 33966
diff changeset
   410
         map #2 c_intrs, length Ts)
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   411
      end
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   412
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   413
   in map prove_elim cs end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   414
37734
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   415
(* prove simplification equations *)
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   416
37734
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   417
fun prove_eqs quiet_mode cs params intr_ts intrs elims ctxt ctxt'' =
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   418
  let
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   419
    val _ = clean_message quiet_mode "  Proving the simplification rules ...";
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   420
    
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   421
    fun dest_intr r =
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   422
      (the (dest_predicate cs params (HOLogic.dest_Trueprop (Logic.strip_assums_concl r))),
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   423
       Logic.strip_assums_hyp r, Logic.strip_params r);
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   424
    val intr_ts' = map dest_intr intr_ts;
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   425
    fun prove_eq c elim =
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   426
      let
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   427
        val Ts = arg_types_of (length params) c;
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   428
        val (anames, ctxt') = Variable.variant_fixes (mk_names "a" (length Ts)) ctxt;
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   429
        val frees = map Free (anames ~~ Ts);
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   430
        val c_intrs = filter (equal c o #1 o #1 o #1) (intr_ts' ~~ intrs);
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   431
        fun mk_intr_conj (((_, _, us, _), ts, params'), _) =
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   432
          let
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   433
            fun list_ex ([], t) = t
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   434
              | list_ex ((a,T)::vars, t) =
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   435
                 (HOLogic.exists_const T) $ (Abs(a, T, list_ex(vars,t)));
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   436
            val conjs = map2 (curry HOLogic.mk_eq) frees us @ (map HOLogic.dest_Trueprop ts)
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   437
          in
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   438
            list_ex (params', if null conjs then @{term True} else foldr1 HOLogic.mk_conj conjs)
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   439
          end;
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   440
        val lhs = list_comb (c, params @ frees)
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   441
        val rhs =
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   442
          if null c_intrs then @{term False} else foldr1 HOLogic.mk_disj (map mk_intr_conj c_intrs)
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   443
        val eq = HOLogic.mk_Trueprop (HOLogic.mk_eq (lhs, rhs))
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   444
        fun prove_intr1 (i, _) = Subgoal.FOCUS_PREMS (fn {params, prems, ...} =>
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   445
            let
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   446
              val (prems', last_prem) = split_last prems
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   447
            in
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   448
              EVERY1 (select_disj (length c_intrs) (i + 1))
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   449
              THEN EVERY (replicate (length params) (rtac @{thm exI} 1))
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   450
              THEN EVERY (map (fn prem => (rtac @{thm conjI} 1 THEN rtac prem 1)) prems')
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   451
              THEN rtac last_prem 1
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   452
            end) ctxt' 1
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   453
        fun prove_intr2 (((_, _, us, _), ts, params'), intr) =
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   454
          EVERY (replicate (length params') (etac @{thm exE} 1))
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   455
          THEN EVERY (replicate (length ts + length us - 1) (etac @{thm conjE} 1))
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   456
          THEN Subgoal.FOCUS_PREMS (fn {params, prems, ...} =>
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   457
            let
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   458
              val (eqs, prems') = chop (length us) prems
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   459
              val rew_thms = map (fn th => th RS @{thm eq_reflection}) eqs
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   460
            in
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   461
              rewrite_goal_tac rew_thms 1
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   462
              THEN rtac intr 1
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   463
              THEN (EVERY (map (fn p => rtac p 1) prems'))              
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   464
            end) ctxt' 1 
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   465
      in
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   466
        Skip_Proof.prove ctxt' [] [] eq (fn {...} =>
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   467
          rtac @{thm iffI} 1 THEN etac (#1 elim) 1
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   468
          THEN EVERY (map_index prove_intr1 c_intrs)
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   469
          THEN (if null c_intrs then etac @{thm FalseE} 1 else
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   470
            let val (c_intrs', last_c_intr) = split_last c_intrs in
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   471
              EVERY (map (fn ci => etac @{thm disjE} 1 THEN prove_intr2 ci) c_intrs')
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   472
              THEN prove_intr2 last_c_intr
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   473
            end))
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   474
        |> rulify
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   475
        |> singleton (ProofContext.export ctxt' ctxt'')
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   476
      end;  
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   477
  in
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   478
    map2 prove_eq cs elims
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   479
  end;
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   480
  
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   481
(* derivation of simplified elimination rules *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   482
11682
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   483
local
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   484
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   485
(*delete needless equality assumptions*)
29064
70a61d58460e more antiquotations;
wenzelm
parents: 29006
diff changeset
   486
val refl_thin = Goal.prove_global @{theory HOL} [] [] @{prop "!!P. a = a ==> P ==> P"}
22838
haftmann
parents: 22789
diff changeset
   487
  (fn _ => assume_tac 1);
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   488
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
   489
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
   490
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   491
fun simp_case_tac ss i =
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   492
  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
   493
11682
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   494
in
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   495
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   496
fun mk_cases ctxt prop =
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   497
  let
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   498
    val thy = ProofContext.theory_of ctxt;
32149
ef59550a55d3 renamed simpset_of to global_simpset_of, and local_simpset_of to simpset_of -- same for claset and clasimpset;
wenzelm
parents: 32091
diff changeset
   499
    val ss = simpset_of ctxt;
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   500
21526
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   501
    fun err msg =
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   502
      error (Pretty.string_of (Pretty.block
24920
2a45e400fdad generic Syntax.pretty/string_of operations;
wenzelm
parents: 24915
diff changeset
   503
        [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
   504
24861
cc669ca5f382 tuned Induct interface: prefer pred'' over set'';
wenzelm
parents: 24830
diff changeset
   505
    val elims = Induct.find_casesP ctxt prop;
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   506
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   507
    val cprop = Thm.cterm_of thy prop;
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   508
    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
   509
    fun mk_elim rl =
36546
a9873318fe30 proper context for rule_by_tactic;
wenzelm
parents: 36468
diff changeset
   510
      Thm.implies_intr cprop (Tactic.rule_by_tactic ctxt tac (Thm.assume cprop RS rl))
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   511
      |> singleton (Variable.export (Variable.auto_fixes prop ctxt) ctxt);
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   512
  in
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   513
    (case get_first (try mk_elim) elims of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15525
diff changeset
   514
      SOME r => r
21526
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   515
    | NONE => err "Proposition not an inductive predicate:")
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   516
  end;
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   517
11682
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   518
end;
d9063229b4a1 simp_case_tac is back again from induct_method.ML;
wenzelm
parents: 11628
diff changeset
   519
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   520
(* inductive_cases *)
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   521
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   522
fun gen_inductive_cases prep_att prep_prop args lthy =
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   523
  let
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   524
    val thy = ProofContext.theory_of lthy;
12876
a70df1e5bf10 got rid of explicit marginal comments (now stripped earlier from input);
wenzelm
parents: 12798
diff changeset
   525
    val facts = args |> map (fn ((a, atts), props) =>
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   526
      ((a, map (prep_att thy) atts),
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   527
        map (Thm.no_attributes o single o mk_cases lthy o prep_prop lthy) props));
33671
4b0f2599ed48 modernized structure Local_Theory;
wenzelm
parents: 33670
diff changeset
   528
  in lthy |> Local_Theory.notes facts |>> map snd end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   529
24509
23ee6b7788c2 replaced ProofContext.read_term/prop by general Syntax.read_term/prop;
wenzelm
parents: 24133
diff changeset
   530
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
   531
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
   532
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   533
30722
623d4831c8cf simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents: 30552
diff changeset
   534
val ind_cases_setup =
623d4831c8cf simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents: 30552
diff changeset
   535
  Method.setup @{binding ind_cases}
623d4831c8cf simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents: 30552
diff changeset
   536
    (Scan.lift (Scan.repeat1 Args.name_source --
623d4831c8cf simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents: 30552
diff changeset
   537
      Scan.optional (Args.$$$ "for" |-- Scan.repeat1 Args.name) []) >>
623d4831c8cf simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents: 30552
diff changeset
   538
      (fn (raw_props, fixes) => fn ctxt =>
623d4831c8cf simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents: 30552
diff changeset
   539
        let
623d4831c8cf simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents: 30552
diff changeset
   540
          val (_, ctxt') = Variable.add_fixes fixes ctxt;
623d4831c8cf simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents: 30552
diff changeset
   541
          val props = Syntax.read_props ctxt' raw_props;
623d4831c8cf simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents: 30552
diff changeset
   542
          val ctxt'' = fold Variable.declare_term props ctxt';
623d4831c8cf simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents: 30552
diff changeset
   543
          val rules = ProofContext.export ctxt'' ctxt (map (mk_cases ctxt'') props)
623d4831c8cf simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents: 30552
diff changeset
   544
        in Method.erule 0 rules end))
623d4831c8cf simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents: 30552
diff changeset
   545
    "dynamic case analysis on predicates";
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   546
37734
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   547
(* derivation of simplified equation *)
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   548
37734
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   549
fun mk_simp_eq ctxt prop =
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   550
  let
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   551
    val (c, args) = strip_comb (HOLogic.dest_Trueprop prop)
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   552
    val ctxt' = Variable.auto_fixes prop ctxt
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   553
    val cname = fst (dest_Const c)
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   554
    val info = the_inductive ctxt cname
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   555
    val eq = nth (#eqs (snd info)) (find_index (fn c => c = cname) (#names (fst info)))
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   556
    val (_, args') = strip_comb (fst (HOLogic.dest_eq (HOLogic.dest_Trueprop (Thm.prop_of eq))))
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   557
    val certify = cterm_of (ProofContext.theory_of ctxt)
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   558
  in
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   559
    cterm_instantiate (map (pairself certify) (args' ~~ args)) eq
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   560
    |> Conv.fconv_rule (Conv.arg_conv (Conv.arg_conv
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   561
      (Simplifier.full_rewrite (simpset_of ctxt))))
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   562
    |> singleton (Variable.export ctxt' ctxt)
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   563
  end
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   564
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   565
(* inductive simps *)
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   566
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   567
fun gen_inductive_simps prep_att prep_prop args lthy =
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   568
  let
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   569
    val thy = ProofContext.theory_of lthy;
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   570
    val facts = args |> map (fn ((a, atts), props) =>
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   571
      ((a, map (prep_att thy) atts),
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   572
        map (Thm.no_attributes o single o mk_simp_eq lthy o prep_prop lthy) props));
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   573
  in lthy |> Local_Theory.notes facts |>> map snd end;
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   574
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   575
val inductive_simps = gen_inductive_simps Attrib.intern_src Syntax.read_prop;
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   576
val inductive_simps_i = gen_inductive_simps (K I) Syntax.check_prop;
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   577
    
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   578
(* prove induction rule *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   579
26477
ecf06644f6cb eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents: 26336
diff changeset
   580
fun prove_indrule quiet_mode cs argTs bs xs rec_const params intr_ts mono
36642
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   581
    fp_def rec_preds_defs ctxt ctxt''' =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   582
  let
26477
ecf06644f6cb eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents: 26336
diff changeset
   583
    val _ = clean_message quiet_mode "  Proving the induction rule ...";
20047
e23a3afaaa8a Goal.prove_global;
wenzelm
parents: 19874
diff changeset
   584
    val thy = ProofContext.theory_of ctxt;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   585
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   586
    (* predicates for induction rule *)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   587
36642
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   588
    val (pnames, ctxt') = Variable.variant_fixes (mk_names "P" (length cs)) ctxt;
33077
3c9cf88ec841 arg_types_of auxiliary function; using multiset operations
haftmann
parents: 33056
diff changeset
   589
    val preds = map2 (curry Free) pnames
3c9cf88ec841 arg_types_of auxiliary function; using multiset operations
haftmann
parents: 33056
diff changeset
   590
      (map (fn c => arg_types_of (length params) c ---> HOLogic.boolT) cs);
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   591
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   592
    (* transform an introduction rule into a premise for induction rule *)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   593
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   594
    fun mk_ind_prem r =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   595
      let
33669
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33666
diff changeset
   596
        fun subst s =
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33666
diff changeset
   597
          (case dest_predicate cs params s of
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   598
            SOME (_, i, ys, (_, Ts)) =>
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   599
              let
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   600
                val k = length Ts;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   601
                val bs = map Bound (k - 1 downto 0);
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   602
                val P = list_comb (List.nth (preds, i),
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   603
                  map (incr_boundvars k) ys @ bs);
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   604
                val Q = list_abs (mk_names "x" k ~~ Ts,
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   605
                  HOLogic.mk_binop inductive_conj_name
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   606
                    (list_comb (incr_boundvars k s, bs), P))
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   607
              in (Q, case Ts of [] => SOME (s, P) | _ => NONE) end
33669
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33666
diff changeset
   608
          | NONE =>
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33666
diff changeset
   609
              (case s of
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33666
diff changeset
   610
                (t $ u) => (fst (subst t) $ fst (subst u), NONE)
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33666
diff changeset
   611
              | (Abs (a, T, t)) => (Abs (a, T, fst (subst t)), NONE)
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33666
diff changeset
   612
              | _ => (s, NONE)));
7293
959e060f4a2f Moved sum_case stuff from Sum to Datatype.
berghofe
parents: 7257
diff changeset
   613
33338
de76079f973a eliminated some old folds;
wenzelm
parents: 33317
diff changeset
   614
        fun mk_prem s prems =
de76079f973a eliminated some old folds;
wenzelm
parents: 33317
diff changeset
   615
          (case subst s of
de76079f973a eliminated some old folds;
wenzelm
parents: 33317
diff changeset
   616
            (_, SOME (t, u)) => t :: u :: prems
de76079f973a eliminated some old folds;
wenzelm
parents: 33317
diff changeset
   617
          | (t, _) => t :: prems);
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   618
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   619
        val SOME (_, i, ys, _) = dest_predicate cs params
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   620
          (HOLogic.dest_Trueprop (Logic.strip_assums_concl r))
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   621
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   622
      in list_all_free (Logic.strip_params r,
33338
de76079f973a eliminated some old folds;
wenzelm
parents: 33317
diff changeset
   623
        Logic.list_implies (map HOLogic.mk_Trueprop (fold_rev mk_prem
de76079f973a eliminated some old folds;
wenzelm
parents: 33317
diff changeset
   624
          (map HOLogic.dest_Trueprop (Logic.strip_assums_hyp r)) []),
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   625
            HOLogic.mk_Trueprop (list_comb (List.nth (preds, i), ys))))
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   626
      end;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   627
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   628
    val ind_prems = map mk_ind_prem intr_ts;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   629
21526
1e6bd5ed7abc added morh_result, the_inductive, add_inductive_global;
wenzelm
parents: 21508
diff changeset
   630
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   631
    (* make conclusions for induction rules *)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   632
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   633
    val Tss = map (binder_types o fastype_of) preds;
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   634
    val (xnames, ctxt'') =
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   635
      Variable.variant_fixes (mk_names "x" (length (flat Tss))) ctxt';
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   636
    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
   637
        (map (fn (((xnames, Ts), c), P) =>
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   638
           let val frees = map Free (xnames ~~ Ts)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   639
           in HOLogic.mk_imp
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   640
             (list_comb (c, params @ frees), list_comb (P, frees))
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   641
           end) (unflat Tss xnames ~~ Tss ~~ cs ~~ preds)));
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   642
13626
282fbabec862 Fixed bug involving inductive definitions having equalities in the premises,
paulson
parents: 13197
diff changeset
   643
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   644
    (* make predicate for instantiation of abstract induction rule *)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   645
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   646
    val ind_pred = fold_rev lambda (bs @ xs) (foldr1 HOLogic.mk_conj
33338
de76079f973a eliminated some old folds;
wenzelm
parents: 33317
diff changeset
   647
      (map_index (fn (i, P) => fold_rev (curry HOLogic.mk_imp)
de76079f973a eliminated some old folds;
wenzelm
parents: 33317
diff changeset
   648
         (make_bool_args HOLogic.mk_not I bs i)
de76079f973a eliminated some old folds;
wenzelm
parents: 33317
diff changeset
   649
         (list_comb (P, make_args' argTs xs (binder_types (fastype_of P))))) preds));
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   650
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   651
    val ind_concl = HOLogic.mk_Trueprop
35092
cfe605c54e50 moved less_eq, less to Orderings.thy; moved abs, sgn to Groups.thy
haftmann
parents: 34991
diff changeset
   652
      (HOLogic.mk_binrel @{const_name Orderings.less_eq} (rec_const, ind_pred));
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   653
32652
3175e23b79f3 stripped legacy ML bindings
haftmann
parents: 32610
diff changeset
   654
    val raw_fp_induct = (mono RS (fp_def RS @{thm def_lfp_induct}));
13626
282fbabec862 Fixed bug involving inductive definitions having equalities in the premises,
paulson
parents: 13197
diff changeset
   655
32970
fbd2bb2489a8 operations of structure Skip_Proof (formerly SkipProof) no longer require quick_and_dirty mode;
wenzelm
parents: 32952
diff changeset
   656
    val induct = Skip_Proof.prove ctxt'' [] ind_prems ind_concl
20248
7916ce5bb069 Goal.prove: more tactic arguments;
wenzelm
parents: 20071
diff changeset
   657
      (fn {prems, ...} => EVERY
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   658
        [rewrite_goals_tac [inductive_conj_def],
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   659
         DETERM (rtac raw_fp_induct 1),
32652
3175e23b79f3 stripped legacy ML bindings
haftmann
parents: 32610
diff changeset
   660
         REPEAT (resolve_tac [@{thm le_funI}, @{thm le_boolI}] 1),
32610
c477b0a62ce9 rewrite premises in tactical proof also with inf_fun_eq and inf_bool_eq: attempt to allow user to use inf [=>] and inf [bool] in his specs
haftmann
parents: 32602
diff changeset
   661
         rewrite_goals_tac simp_thms'',
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   662
         (*This disjE separates out the introduction rules*)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   663
         REPEAT (FIRSTGOAL (eresolve_tac [disjE, exE, FalseE])),
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   664
         (*Now break down the individual cases.  No disjE here in case
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   665
           some premise involves disjunction.*)
13747
bf308fcfd08e Better treatment of equality in premises of inductive definitions. Less
paulson
parents: 13709
diff changeset
   666
         REPEAT (FIRSTGOAL (etac conjE ORELSE' bound_hyp_subst_tac)),
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   667
         REPEAT (FIRSTGOAL
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   668
           (resolve_tac [conjI, impI] ORELSE' (etac notE THEN' atac))),
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   669
         EVERY (map (fn prem => DEPTH_SOLVE_1 (ares_tac [rewrite_rule
32610
c477b0a62ce9 rewrite premises in tactical proof also with inf_fun_eq and inf_bool_eq: attempt to allow user to use inf [=>] and inf [bool] in his specs
haftmann
parents: 32602
diff changeset
   670
             (inductive_conj_def :: rec_preds_defs @ simp_thms'') prem,
22980
1226d861eefb Fixed bug that caused proof of induction theorem to fail if
berghofe
parents: 22846
diff changeset
   671
           conjI, refl] 1)) prems)]);
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   672
32970
fbd2bb2489a8 operations of structure Skip_Proof (formerly SkipProof) no longer require quick_and_dirty mode;
wenzelm
parents: 32952
diff changeset
   673
    val lemma = Skip_Proof.prove ctxt'' [] []
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   674
      (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
   675
        [rewrite_goals_tac rec_preds_defs,
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   676
         REPEAT (EVERY
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   677
           [REPEAT (resolve_tac [conjI, impI] 1),
32652
3175e23b79f3 stripped legacy ML bindings
haftmann
parents: 32610
diff changeset
   678
            REPEAT (eresolve_tac [@{thm le_funE}, @{thm le_boolE}] 1),
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   679
            atac 1,
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   680
            rewrite_goals_tac simp_thms',
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   681
            atac 1])])
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   682
36642
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   683
  in singleton (ProofContext.export ctxt'' ctxt''') (induct RS lemma) end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   684
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   685
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   686
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   687
(** specification of (co)inductive predicates **)
10729
1b3350c4ee92 handle proper rules;
wenzelm
parents: 10569
diff changeset
   688
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   689
fun mk_ind_def quiet_mode skip_mono fork_mono alt_name coind
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   690
    cs intr_ts monos params cnames_syn lthy =
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   691
  let
24915
fc90277c0dd7 integrated FixedPoint into Inductive
haftmann
parents: 24867
diff changeset
   692
    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
   693
33077
3c9cf88ec841 arg_types_of auxiliary function; using multiset operations
haftmann
parents: 33056
diff changeset
   694
    val argTs = fold (combine (op =) o arg_types_of (length params)) cs [];
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   695
    val k = log 2 1 (length cs);
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   696
    val predT = replicate k HOLogic.boolT ---> argTs ---> HOLogic.boolT;
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   697
    val p :: xs = map Free (Variable.variant_frees lthy intr_ts
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   698
      (("p", predT) :: (mk_names "x" (length argTs) ~~ argTs)));
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   699
    val bs = map Free (Variable.variant_frees lthy (p :: xs @ intr_ts)
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   700
      (map (rpair HOLogic.boolT) (mk_names "b" k)));
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   701
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   702
    fun subst t =
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   703
      (case dest_predicate cs params t of
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   704
        SOME (_, i, ts, (Ts, Us)) =>
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   705
          let
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   706
            val l = length Us;
33669
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33666
diff changeset
   707
            val zs = map Bound (l - 1 downto 0);
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   708
          in
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   709
            list_abs (map (pair "z") Us, list_comb (p,
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   710
              make_bool_args' bs i @ make_args argTs
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   711
                ((map (incr_boundvars l) ts ~~ Ts) @ (zs ~~ Us))))
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   712
          end
33669
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33666
diff changeset
   713
      | NONE =>
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33666
diff changeset
   714
          (case t of
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33666
diff changeset
   715
            t1 $ t2 => subst t1 $ subst t2
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33666
diff changeset
   716
          | Abs (x, T, u) => Abs (x, T, subst u)
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33666
diff changeset
   717
          | _ => t));
5149
10f0be29c0d1 Fixed bug in transform_rule.
berghofe
parents: 5120
diff changeset
   718
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   719
    (* transform an introduction rule into a conjunction  *)
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   720
    (*   [| p_i t; ... |] ==> p_j u                       *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   721
    (* is transformed into                                *)
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   722
    (*   b_j & x_j = u & p b_j t & ...                    *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   723
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   724
    fun transform_rule r =
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   725
      let
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   726
        val SOME (_, i, ts, (Ts, _)) = dest_predicate cs params
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   727
          (HOLogic.dest_Trueprop (Logic.strip_assums_concl r));
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   728
        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
   729
          map HOLogic.mk_eq (make_args' argTs xs Ts ~~ ts) @
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   730
          map (subst o HOLogic.dest_Trueprop)
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   731
            (Logic.strip_assums_hyp r)
33338
de76079f973a eliminated some old folds;
wenzelm
parents: 33317
diff changeset
   732
      in
de76079f973a eliminated some old folds;
wenzelm
parents: 33317
diff changeset
   733
        fold_rev (fn (x, T) => fn P => HOLogic.exists_const T $ Abs (x, T, P))
de76079f973a eliminated some old folds;
wenzelm
parents: 33317
diff changeset
   734
          (Logic.strip_params r)
de76079f973a eliminated some old folds;
wenzelm
parents: 33317
diff changeset
   735
          (if null ps then HOLogic.true_const else foldr1 HOLogic.mk_conj ps)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   736
      end
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   737
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   738
    (* make a disjunction of all introduction rules *)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   739
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   740
    val fp_fun = fold_rev lambda (p :: bs @ xs)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   741
      (if null intr_ts then HOLogic.false_const
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   742
       else foldr1 HOLogic.mk_disj (map transform_rule intr_ts));
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   743
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   744
    (* add definiton of recursive predicates to theory *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   745
28083
103d9282a946 explicit type Name.binding for higher-specification elements;
wenzelm
parents: 27882
diff changeset
   746
    val rec_name =
28965
1de908189869 cleaned up binding module and related code
haftmann
parents: 28941
diff changeset
   747
      if Binding.is_empty alt_name then
30223
24d975352879 renamed Binding.name_pos to Binding.make, renamed Binding.base_name to Binding.name_of, renamed Binding.map_base to Binding.map_name, added mandatory flag to Binding.qualify;
wenzelm
parents: 30218
diff changeset
   748
        Binding.name (space_implode "_" (map (Binding.name_of o fst) cnames_syn))
28083
103d9282a946 explicit type Name.binding for higher-specification elements;
wenzelm
parents: 27882
diff changeset
   749
      else alt_name;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   750
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   751
    val ((rec_const, (_, fp_def)), lthy') = lthy
33671
4b0f2599ed48 modernized structure Local_Theory;
wenzelm
parents: 33670
diff changeset
   752
      |> Local_Theory.conceal
33766
c679f05600cd adapted Local_Theory.define -- eliminated odd thm kind;
wenzelm
parents: 33726
diff changeset
   753
      |> Local_Theory.define
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   754
        ((rec_name, case cnames_syn of [(_, syn)] => syn | _ => NoSyn),
33577
ea36b70a6c1c added "nitpick_def" attribute to lfp/gfp definition generated by the inductive package;
blanchet
parents: 33317
diff changeset
   755
         ((Binding.empty, [Attrib.internal (K Nitpick_Defs.add)]),
ea36b70a6c1c added "nitpick_def" attribute to lfp/gfp definition generated by the inductive package;
blanchet
parents: 33317
diff changeset
   756
         fold_rev lambda params
33278
ba9f52f56356 conceal internal bindings;
wenzelm
parents: 33171
diff changeset
   757
           (Const (fp_name, (predT --> predT) --> predT) $ fp_fun)))
33671
4b0f2599ed48 modernized structure Local_Theory;
wenzelm
parents: 33670
diff changeset
   758
      ||> Local_Theory.restore_naming lthy;
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   759
    val fp_def' = Simplifier.rewrite (HOL_basic_ss addsimps [fp_def])
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   760
      (cterm_of (ProofContext.theory_of lthy') (list_comb (rec_const, params)));
33278
ba9f52f56356 conceal internal bindings;
wenzelm
parents: 33171
diff changeset
   761
    val specs =
ba9f52f56356 conceal internal bindings;
wenzelm
parents: 33171
diff changeset
   762
      if length cs < 2 then []
ba9f52f56356 conceal internal bindings;
wenzelm
parents: 33171
diff changeset
   763
      else
ba9f52f56356 conceal internal bindings;
wenzelm
parents: 33171
diff changeset
   764
        map_index (fn (i, (name_mx, c)) =>
ba9f52f56356 conceal internal bindings;
wenzelm
parents: 33171
diff changeset
   765
          let
ba9f52f56356 conceal internal bindings;
wenzelm
parents: 33171
diff changeset
   766
            val Ts = arg_types_of (length params) c;
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   767
            val xs = map Free (Variable.variant_frees lthy intr_ts
33278
ba9f52f56356 conceal internal bindings;
wenzelm
parents: 33171
diff changeset
   768
              (mk_names "x" (length Ts) ~~ Ts))
ba9f52f56356 conceal internal bindings;
wenzelm
parents: 33171
diff changeset
   769
          in
ba9f52f56356 conceal internal bindings;
wenzelm
parents: 33171
diff changeset
   770
            (name_mx, (Attrib.empty_binding, fold_rev lambda (params @ xs)
ba9f52f56356 conceal internal bindings;
wenzelm
parents: 33171
diff changeset
   771
              (list_comb (rec_const, params @ make_bool_args' bs i @
ba9f52f56356 conceal internal bindings;
wenzelm
parents: 33171
diff changeset
   772
                make_args argTs (xs ~~ Ts)))))
ba9f52f56356 conceal internal bindings;
wenzelm
parents: 33171
diff changeset
   773
          end) (cnames_syn ~~ cs);
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   774
    val (consts_defs, lthy'') = lthy'
33671
4b0f2599ed48 modernized structure Local_Theory;
wenzelm
parents: 33670
diff changeset
   775
      |> Local_Theory.conceal
33766
c679f05600cd adapted Local_Theory.define -- eliminated odd thm kind;
wenzelm
parents: 33726
diff changeset
   776
      |> fold_map Local_Theory.define specs
33671
4b0f2599ed48 modernized structure Local_Theory;
wenzelm
parents: 33670
diff changeset
   777
      ||> Local_Theory.restore_naming lthy';
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   778
    val preds = (case cs of [_] => [rec_const] | _ => map #1 consts_defs);
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   779
36642
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   780
    val (_, lthy''') = Variable.add_fixes (map (fst o dest_Free) params) lthy'';
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   781
    val mono = prove_mono quiet_mode skip_mono fork_mono predT fp_fun monos lthy''';
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   782
    val (_, lthy'''') =
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   783
      Local_Theory.note (apfst Binding.conceal Attrib.empty_binding,
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   784
        ProofContext.export lthy''' lthy'' [mono]) lthy'';
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   785
36642
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   786
  in (lthy'''', lthy''', rec_name, mono, fp_def', map (#2 o #2) consts_defs,
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   787
    list_comb (rec_const, params), preds, argTs, bs, xs)
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   788
  end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   789
33669
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33666
diff changeset
   790
fun declare_rules rec_binding coind no_ind cnames
37734
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   791
    preds intrs intr_bindings intr_atts elims eqs raw_induct lthy =
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   792
  let
30223
24d975352879 renamed Binding.name_pos to Binding.make, renamed Binding.base_name to Binding.name_of, renamed Binding.map_base to Binding.map_name, added mandatory flag to Binding.qualify;
wenzelm
parents: 30218
diff changeset
   793
    val rec_name = Binding.name_of rec_binding;
32773
f6fd4ccd8eea mandatory prefix where appropriate
haftmann
parents: 32652
diff changeset
   794
    fun rec_qualified qualified = Binding.qualify qualified rec_name;
30223
24d975352879 renamed Binding.name_pos to Binding.make, renamed Binding.base_name to Binding.name_of, renamed Binding.map_base to Binding.map_name, added mandatory flag to Binding.qualify;
wenzelm
parents: 30218
diff changeset
   795
    val intr_names = map Binding.name_of intr_bindings;
33368
b1cf34f1855c modernized structure Rule_Cases;
wenzelm
parents: 33338
diff changeset
   796
    val ind_case_names = Rule_Cases.case_names intr_names;
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   797
    val induct =
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   798
      if coind then
33368
b1cf34f1855c modernized structure Rule_Cases;
wenzelm
parents: 33338
diff changeset
   799
        (raw_induct, [Rule_Cases.case_names [rec_name],
b1cf34f1855c modernized structure Rule_Cases;
wenzelm
parents: 33338
diff changeset
   800
          Rule_Cases.case_conclusion (rec_name, intr_names),
b1cf34f1855c modernized structure Rule_Cases;
wenzelm
parents: 33338
diff changeset
   801
          Rule_Cases.consumes 1, Induct.coinduct_pred (hd cnames)])
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   802
      else if no_ind orelse length cnames > 1 then
33368
b1cf34f1855c modernized structure Rule_Cases;
wenzelm
parents: 33338
diff changeset
   803
        (raw_induct, [ind_case_names, Rule_Cases.consumes 0])
b1cf34f1855c modernized structure Rule_Cases;
wenzelm
parents: 33338
diff changeset
   804
      else (raw_induct RSN (2, rev_mp), [ind_case_names, Rule_Cases.consumes 1]);
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   805
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   806
    val (intrs', lthy1) =
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   807
      lthy |>
35757
c2884bec5463 adding Spec_Rules to definitional package inductive and inductive_set
bulwahn
parents: 35646
diff changeset
   808
      Spec_Rules.add
c2884bec5463 adding Spec_Rules to definitional package inductive and inductive_set
bulwahn
parents: 35646
diff changeset
   809
        (if coind then Spec_Rules.Co_Inductive else Spec_Rules.Inductive) (preds, intrs) |>
33671
4b0f2599ed48 modernized structure Local_Theory;
wenzelm
parents: 33670
diff changeset
   810
      Local_Theory.notes
33278
ba9f52f56356 conceal internal bindings;
wenzelm
parents: 33171
diff changeset
   811
        (map (rec_qualified false) intr_bindings ~~ intr_atts ~~
ba9f52f56356 conceal internal bindings;
wenzelm
parents: 33171
diff changeset
   812
          map (fn th => [([th],
37264
8b931fb51cc6 removed "nitpick_intro" attribute -- Nitpick noew uses Spec_Rules instead
blanchet
parents: 36960
diff changeset
   813
           [Attrib.internal (K (Context_Rules.intro_query NONE))])]) intrs) |>>
24744
dcb8cf5fc99c - add_inductive_i now takes typ instead of typ option as argument
berghofe
parents: 24721
diff changeset
   814
      map (hd o snd);
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   815
    val (((_, elims'), (_, [induct'])), lthy2) =
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   816
      lthy1 |>
33671
4b0f2599ed48 modernized structure Local_Theory;
wenzelm
parents: 33670
diff changeset
   817
      Local_Theory.note ((rec_qualified true (Binding.name "intros"), []), intrs') ||>>
34986
7f7939c9370f Added "constraints" tag / attribute for specifying the number of equality
berghofe
parents: 33966
diff changeset
   818
      fold_map (fn (name, (elim, cases, k)) =>
33671
4b0f2599ed48 modernized structure Local_Theory;
wenzelm
parents: 33670
diff changeset
   819
        Local_Theory.note
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   820
          ((Binding.qualify true (Long_Name.base_name name) (Binding.name "cases"),
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   821
            [Attrib.internal (K (Rule_Cases.case_names cases)),
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   822
             Attrib.internal (K (Rule_Cases.consumes 1)),
34986
7f7939c9370f Added "constraints" tag / attribute for specifying the number of equality
berghofe
parents: 33966
diff changeset
   823
             Attrib.internal (K (Rule_Cases.constraints k)),
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   824
             Attrib.internal (K (Induct.cases_pred name)),
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   825
             Attrib.internal (K (Context_Rules.elim_query NONE))]), [elim]) #>
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   826
        apfst (hd o snd)) (if null elims then [] else cnames ~~ elims) ||>>
33671
4b0f2599ed48 modernized structure Local_Theory;
wenzelm
parents: 33670
diff changeset
   827
      Local_Theory.note
32773
f6fd4ccd8eea mandatory prefix where appropriate
haftmann
parents: 32652
diff changeset
   828
        ((rec_qualified true (Binding.name (coind_prefix coind ^ "induct")),
28107
760ecc6fc1bd Name.qualified;
wenzelm
parents: 28101
diff changeset
   829
          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
   830
37734
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   831
    val (eqs', lthy3) = lthy2 |> 
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   832
      fold_map (fn (name, eq) => Local_Theory.note
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   833
          ((Binding.qualify true (Long_Name.base_name name) (Binding.name "simps"), []), [eq])
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   834
          #> apfst (hd o snd))
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   835
        (if null eqs then [] else (cnames ~~ eqs))
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   836
    val (inducts, lthy4) =
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   837
      if no_ind orelse coind then ([], lthy3)
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   838
      else
37734
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   839
        let val inducts = cnames ~~ Project_Rule.projects lthy3 (1 upto length cnames) induct' in
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   840
          lthy3 |>
33671
4b0f2599ed48 modernized structure Local_Theory;
wenzelm
parents: 33670
diff changeset
   841
          Local_Theory.notes [((rec_qualified true (Binding.name "inducts"), []),
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   842
            inducts |> map (fn (name, th) => ([th],
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   843
              [Attrib.internal (K ind_case_names),
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   844
               Attrib.internal (K (Rule_Cases.consumes 1)),
35646
b32d6c1bdb4d Added inducts field to inductive_result.
berghofe
parents: 35625
diff changeset
   845
               Attrib.internal (K (Induct.induct_pred name))])))] |>> snd o hd
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   846
        end;
37734
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   847
  in (intrs', elims', eqs', induct', inducts, lthy4) end;
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   848
26534
a2cb4de2a1aa Added skip_mono flag and inductive_flags type.
berghofe
parents: 26477
diff changeset
   849
type inductive_flags =
33669
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33666
diff changeset
   850
  {quiet_mode: bool, verbose: bool, alt_name: binding, coind: bool,
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33666
diff changeset
   851
    no_elim: bool, no_ind: bool, skip_mono: bool, fork_mono: bool};
26534
a2cb4de2a1aa Added skip_mono flag and inductive_flags type.
berghofe
parents: 26477
diff changeset
   852
a2cb4de2a1aa Added skip_mono flag and inductive_flags type.
berghofe
parents: 26477
diff changeset
   853
type add_ind_def =
a2cb4de2a1aa Added skip_mono flag and inductive_flags type.
berghofe
parents: 26477
diff changeset
   854
  inductive_flags ->
28084
a05ca48ef263 type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents: 28083
diff changeset
   855
  term list -> (Attrib.binding * term) list -> thm list ->
29581
b3b33e0298eb binding is alias for Binding.T
haftmann
parents: 29388
diff changeset
   856
  term list -> (binding * mixfix) list ->
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   857
  local_theory -> inductive_result * local_theory;
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   858
33669
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33666
diff changeset
   859
fun add_ind_def {quiet_mode, verbose, alt_name, coind, no_elim, no_ind, skip_mono, fork_mono}
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   860
    cs intros monos params cnames_syn lthy =
9072
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   861
  let
25288
6e0c8dd213df improved error message for missing predicates;
wenzelm
parents: 25143
diff changeset
   862
    val _ = null cnames_syn andalso error "No inductive predicates given";
30223
24d975352879 renamed Binding.name_pos to Binding.make, renamed Binding.base_name to Binding.name_of, renamed Binding.map_base to Binding.map_name, added mandatory flag to Binding.qualify;
wenzelm
parents: 30218
diff changeset
   863
    val names = map (Binding.name_of o fst) cnames_syn;
26477
ecf06644f6cb eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents: 26336
diff changeset
   864
    val _ = message (quiet_mode andalso not verbose)
28083
103d9282a946 explicit type Name.binding for higher-specification elements;
wenzelm
parents: 27882
diff changeset
   865
      ("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
   866
33671
4b0f2599ed48 modernized structure Local_Theory;
wenzelm
parents: 33670
diff changeset
   867
    val cnames = map (Local_Theory.full_name lthy o #1) cnames_syn;  (* FIXME *)
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   868
    val ((intr_names, intr_atts), intr_ts) =
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   869
      apfst split_list (split_list (map (check_rule lthy cs params) intros));
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   870
36642
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   871
    val (lthy1, lthy2, rec_name, mono, fp_def, rec_preds_defs, rec_const, preds,
29388
79eb3649ca9e added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents: 29064
diff changeset
   872
      argTs, bs, xs) = mk_ind_def quiet_mode skip_mono fork_mono alt_name coind cs intr_ts
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
   873
        monos params cnames_syn lthy;
9072
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   874
26477
ecf06644f6cb eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents: 26336
diff changeset
   875
    val (intrs, unfold) = prove_intrs quiet_mode coind mono fp_def (length bs + length xs)
36642
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   876
      intr_ts rec_preds_defs lthy2 lthy1;
33459
wenzelm
parents: 33458
diff changeset
   877
    val elims =
wenzelm
parents: 33458
diff changeset
   878
      if no_elim then []
wenzelm
parents: 33458
diff changeset
   879
      else
wenzelm
parents: 33458
diff changeset
   880
        prove_elims quiet_mode cs params intr_ts (map Binding.name_of intr_names)
36642
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   881
          unfold rec_preds_defs lthy2 lthy1;
22605
41b092e7d89a - Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents: 22460
diff changeset
   882
    val raw_induct = zero_var_indexes
33459
wenzelm
parents: 33458
diff changeset
   883
      (if no_ind then Drule.asm_rl
wenzelm
parents: 33458
diff changeset
   884
       else if coind then
36642
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   885
         singleton (ProofContext.export lthy2 lthy1)
35625
9c818cab0dd0 modernized structure Object_Logic;
wenzelm
parents: 35624
diff changeset
   886
           (rotate_prems ~1 (Object_Logic.rulify
28839
32d498cf7595 eliminated rewrite_tac/fold_tac, which are not well-formed tactics due to change of main conclusion;
wenzelm
parents: 28791
diff changeset
   887
             (fold_rule rec_preds_defs
32652
3175e23b79f3 stripped legacy ML bindings
haftmann
parents: 32610
diff changeset
   888
               (rewrite_rule simp_thms'''
3175e23b79f3 stripped legacy ML bindings
haftmann
parents: 32610
diff changeset
   889
                (mono RS (fp_def RS @{thm def_coinduct}))))))
21024
63ab84bb64d1 Completely rewrote inductive definition package. Now allows to
berghofe
parents: 20901
diff changeset
   890
       else
26477
ecf06644f6cb eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents: 26336
diff changeset
   891
         prove_indrule quiet_mode cs argTs bs xs rec_const params intr_ts mono fp_def
36642
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   892
           rec_preds_defs lthy2 lthy1);
37734
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   893
    val eqs =
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   894
      if no_elim then [] else prove_eqs quiet_mode cs params intr_ts intrs elims lthy2 lthy1
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   895
37734
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   896
    val elims' = map (fn (th, ns, i) => (rulify th, ns, i)) elims
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   897
    val intrs' = map rulify intrs
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   898
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   899
    val (intrs'', elims'', eqs', induct, inducts, lthy3) = declare_rules rec_name coind no_ind
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   900
      cnames preds intrs' intr_names intr_atts elims' eqs raw_induct lthy1;
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   901
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   902
    val result =
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   903
      {preds = preds,
37734
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   904
       intrs = intrs'',
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   905
       elims = elims'',
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   906
       raw_induct = rulify raw_induct,
35646
b32d6c1bdb4d Added inducts field to inductive_result.
berghofe
parents: 35625
diff changeset
   907
       induct = induct,
37734
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   908
       inducts = inducts,
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
   909
       eqs = eqs'};
21367
7a0cc1bb4dcc inductive: canonical specification syntax (flattened result only);
wenzelm
parents: 21350
diff changeset
   910
36642
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   911
    val lthy4 = lthy3
33671
4b0f2599ed48 modernized structure Local_Theory;
wenzelm
parents: 33670
diff changeset
   912
      |> Local_Theory.declaration false (fn phi =>
25380
03201004c77e put_inductives: be permissive about multiple versions
wenzelm
parents: 25365
diff changeset
   913
        let val result' = morph_result phi result;
03201004c77e put_inductives: be permissive about multiple versions
wenzelm
parents: 25365
diff changeset
   914
        in put_inductives cnames (*global names!?*) ({names = cnames, coind = coind}, result') end);
36642
084470c3cea2 Corrected handling of "for" parameters.
berghofe
parents: 36546
diff changeset
   915
  in (result, lthy4) end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   916
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   917
10735
dfaf75f0076f simplified quick_and_dirty stuff;
wenzelm
parents: 10729
diff changeset
   918
(* external interfaces *)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   919
26477
ecf06644f6cb eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents: 26336
diff changeset
   920
fun gen_add_inductive_i mk_def
33669
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33666
diff changeset
   921
    (flags as {quiet_mode, verbose, alt_name, coind, no_elim, no_ind, skip_mono, fork_mono})
25029
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   922
    cnames_syn pnames spec monos lthy =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   923
  let
25029
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   924
    val thy = ProofContext.theory_of lthy;
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   925
    val _ = Theory.requires thy "Inductive" (coind_prefix coind ^ "inductive definitions");
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   926
21766
3eb48154388e Abbreviations can now be specified simultaneously
berghofe
parents: 21658
diff changeset
   927
25029
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   928
    (* abbrevs *)
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   929
30223
24d975352879 renamed Binding.name_pos to Binding.make, renamed Binding.base_name to Binding.name_of, renamed Binding.map_base to Binding.map_name, added mandatory flag to Binding.qualify;
wenzelm
parents: 30218
diff changeset
   930
    val (_, ctxt1) = Variable.add_fixes (map (Binding.name_of o fst o fst) cnames_syn) lthy;
21766
3eb48154388e Abbreviations can now be specified simultaneously
berghofe
parents: 21658
diff changeset
   931
25029
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   932
    fun get_abbrev ((name, atts), t) =
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   933
      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
   934
        let
29006
abe0f11cfa4e Name.name_of -> Binding.base_name
haftmann
parents: 28965
diff changeset
   935
          val _ = Binding.is_empty name andalso null atts orelse
25029
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   936
            error "Abbreviations may not have names or attributes";
35624
c4e29a0bb8c1 modernized structure Local_Defs;
wenzelm
parents: 35364
diff changeset
   937
          val ((x, T), rhs) = Local_Defs.abs_def (snd (Local_Defs.cert_def ctxt1 t));
28083
103d9282a946 explicit type Name.binding for higher-specification elements;
wenzelm
parents: 27882
diff changeset
   938
          val var =
30223
24d975352879 renamed Binding.name_pos to Binding.make, renamed Binding.base_name to Binding.name_of, renamed Binding.map_base to Binding.map_name, added mandatory flag to Binding.qualify;
wenzelm
parents: 30218
diff changeset
   939
            (case find_first (fn ((c, _), _) => Binding.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
   940
              NONE => error ("Undeclared head of abbreviation " ^ quote x)
28083
103d9282a946 explicit type Name.binding for higher-specification elements;
wenzelm
parents: 27882
diff changeset
   941
            | SOME ((b, T'), mx) =>
25029
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   942
                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
   943
                else (b, mx));
103d9282a946 explicit type Name.binding for higher-specification elements;
wenzelm
parents: 27882
diff changeset
   944
        in SOME (var, rhs) end
25029
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   945
      else NONE;
21766
3eb48154388e Abbreviations can now be specified simultaneously
berghofe
parents: 21658
diff changeset
   946
25029
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   947
    val abbrevs = map_filter get_abbrev spec;
30223
24d975352879 renamed Binding.name_pos to Binding.make, renamed Binding.base_name to Binding.name_of, renamed Binding.map_base to Binding.map_name, added mandatory flag to Binding.qualify;
wenzelm
parents: 30218
diff changeset
   948
    val bs = map (Binding.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
   949
21766
3eb48154388e Abbreviations can now be specified simultaneously
berghofe
parents: 21658
diff changeset
   950
25029
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   951
    (* predicates *)
21766
3eb48154388e Abbreviations can now be specified simultaneously
berghofe
parents: 21658
diff changeset
   952
25029
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   953
    val pre_intros = filter_out (is_some o get_abbrev) spec;
30223
24d975352879 renamed Binding.name_pos to Binding.make, renamed Binding.base_name to Binding.name_of, renamed Binding.map_base to Binding.map_name, added mandatory flag to Binding.qualify;
wenzelm
parents: 30218
diff changeset
   954
    val cnames_syn' = filter_out (member (op =) bs o Binding.name_of o fst o fst) cnames_syn;
24d975352879 renamed Binding.name_pos to Binding.make, renamed Binding.base_name to Binding.name_of, renamed Binding.map_base to Binding.map_name, added mandatory flag to Binding.qualify;
wenzelm
parents: 30218
diff changeset
   955
    val cs = map (Free o apfst Binding.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
   956
    val ps = map Free pnames;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   957
30223
24d975352879 renamed Binding.name_pos to Binding.make, renamed Binding.base_name to Binding.name_of, renamed Binding.map_base to Binding.map_name, added mandatory flag to Binding.qualify;
wenzelm
parents: 30218
diff changeset
   958
    val (_, ctxt2) = lthy |> Variable.add_fixes (map (Binding.name_of o fst o fst) cnames_syn');
35624
c4e29a0bb8c1 modernized structure Local_Defs;
wenzelm
parents: 35364
diff changeset
   959
    val _ = map (fn abbr => Local_Defs.fixed_abbrev abbr ctxt2) abbrevs;
c4e29a0bb8c1 modernized structure Local_Defs;
wenzelm
parents: 35364
diff changeset
   960
    val ctxt3 = ctxt2 |> fold (snd oo Local_Defs.fixed_abbrev) abbrevs;
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
   961
    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
   962
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   963
    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
   964
      (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
   965
          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
   966
            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
   967
        | _ => I) r []), r);
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   968
26736
e6091328718f added explicit check phase after reading of specification
haftmann
parents: 26534
diff changeset
   969
    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
   970
    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
   971
  in
25029
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   972
    lthy
3a72718c5ddd gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents: 25016
diff changeset
   973
    |> mk_def flags cs intros monos ps preds
33671
4b0f2599ed48 modernized structure Local_Theory;
wenzelm
parents: 33670
diff changeset
   974
    ||> fold (snd oo Local_Theory.abbrev Syntax.mode_default) abbrevs
21048
e57e91f72831 Restructured and repaired code dealing with case names
berghofe
parents: 21024
diff changeset
   975
  end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   976
29388
79eb3649ca9e added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents: 29064
diff changeset
   977
fun gen_add_inductive mk_def verbose coind cnames_syn pnames_syn intro_srcs raw_monos int lthy =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   978
  let
30486
9cdc7ce0e389 simplified preparation and outer parsing of specification;
wenzelm
parents: 30435
diff changeset
   979
    val ((vars, intrs), _) = lthy
9cdc7ce0e389 simplified preparation and outer parsing of specification;
wenzelm
parents: 30435
diff changeset
   980
      |> ProofContext.set_mode ProofContext.mode_abbrev
9cdc7ce0e389 simplified preparation and outer parsing of specification;
wenzelm
parents: 30435
diff changeset
   981
      |> Specification.read_spec (cnames_syn @ pnames_syn) intro_srcs;
24721
2a029b78db60 proper Specification.read_specification;
wenzelm
parents: 24516
diff changeset
   982
    val (cs, ps) = chop (length cnames_syn) vars;
2a029b78db60 proper Specification.read_specification;
wenzelm
parents: 24516
diff changeset
   983
    val monos = Attrib.eval_thms lthy raw_monos;
33669
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33666
diff changeset
   984
    val flags = {quiet_mode = false, verbose = verbose, alt_name = Binding.empty,
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33666
diff changeset
   985
      coind = coind, no_elim = false, no_ind = false, skip_mono = false, fork_mono = not int};
26128
fe2d24c26e0c inductive package: simplified group handling;
wenzelm
parents: 25978
diff changeset
   986
  in
fe2d24c26e0c inductive package: simplified group handling;
wenzelm
parents: 25978
diff changeset
   987
    lthy
30223
24d975352879 renamed Binding.name_pos to Binding.make, renamed Binding.base_name to Binding.name_of, renamed Binding.map_base to Binding.map_name, added mandatory flag to Binding.qualify;
wenzelm
parents: 30218
diff changeset
   988
    |> gen_add_inductive_i mk_def flags cs (map (apfst Binding.name_of o fst) ps) intrs monos
26128
fe2d24c26e0c inductive package: simplified group handling;
wenzelm
parents: 25978
diff changeset
   989
  end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   990
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   991
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
   992
val add_inductive = gen_add_inductive add_ind_def;
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
   993
33726
0878aecbf119 eliminated slightly odd name space grouping -- now managed by Isar toplevel;
wenzelm
parents: 33671
diff changeset
   994
fun add_inductive_global flags cnames_syn pnames pre_intros monos thy =
25380
03201004c77e put_inductives: be permissive about multiple versions
wenzelm
parents: 25365
diff changeset
   995
  let
29006
abe0f11cfa4e Name.name_of -> Binding.base_name
haftmann
parents: 28965
diff changeset
   996
    val name = Sign.full_name thy (fst (fst (hd cnames_syn)));
25380
03201004c77e put_inductives: be permissive about multiple versions
wenzelm
parents: 25365
diff changeset
   997
    val ctxt' = thy
33553
35f2b30593a8 modernized structure Theory_Target;
wenzelm
parents: 33519
diff changeset
   998
      |> Theory_Target.init NONE
25380
03201004c77e put_inductives: be permissive about multiple versions
wenzelm
parents: 25365
diff changeset
   999
      |> add_inductive_i flags cnames_syn pnames pre_intros monos |> snd
33671
4b0f2599ed48 modernized structure Local_Theory;
wenzelm
parents: 33670
diff changeset
  1000
      |> Local_Theory.exit;
25380
03201004c77e put_inductives: be permissive about multiple versions
wenzelm
parents: 25365
diff changeset
  1001
    val info = #2 (the_inductive ctxt' name);
03201004c77e put_inductives: be permissive about multiple versions
wenzelm
parents: 25365
diff changeset
  1002
  in (info, ProofContext.theory_of ctxt') end;
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
  1003
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
  1004
22789
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1005
(* 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
  1006
fun arities_of induct =
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1007
  map (fn (_ $ t $ u) =>
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1008
      (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
  1009
    (HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of induct)));
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1010
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1011
(* 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
  1012
fun params_of induct =
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1013
  let
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1014
    val (_ $ t $ u :: _) =
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1015
      HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of induct));
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1016
    val (_, ts) = strip_comb t;
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1017
    val (_, us) = strip_comb u
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1018
  in
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1019
    List.take (ts, length ts - length us)
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1020
  end;
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1021
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1022
val pname_of_intr =
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1023
  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
  1024
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1025
(* partition introduction rules according to predicate name *)
25822
05756950011c Added function partition_rules'.
berghofe
parents: 25510
diff changeset
  1026
fun gen_partition_rules f induct intros =
05756950011c Added function partition_rules'.
berghofe
parents: 25510
diff changeset
  1027
  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
  1028
    (map (rpair [] o fst) (arities_of induct));
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1029
25822
05756950011c Added function partition_rules'.
berghofe
parents: 25510
diff changeset
  1030
val partition_rules = gen_partition_rules I;
05756950011c Added function partition_rules'.
berghofe
parents: 25510
diff changeset
  1031
fun partition_rules' induct = gen_partition_rules fst induct;
05756950011c Added function partition_rules'.
berghofe
parents: 25510
diff changeset
  1032
22789
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1033
fun unpartition_rules intros xs =
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1034
  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
  1035
    (fn x :: xs => (x, xs)) #>> the) intros xs |> fst;
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1036
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1037
(* 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
  1038
fun infer_intro_vars elim arity intros =
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1039
  let
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1040
    val thy = theory_of_thm elim;
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1041
    val _ :: cases = prems_of elim;
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1042
    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
  1043
    fun mtch (t, u) =
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1044
      let
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1045
        val params = Logic.strip_params t;
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1046
        val vars = map (Var o apfst (rpair 0))
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1047
          (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
  1048
        val ts = map (curry subst_bounds (rev vars))
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1049
          (List.drop (Logic.strip_assums_hyp t, arity));
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1050
        val us = Logic.strip_imp_prems u;
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1051
        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
  1052
          (Vartab.empty, Vartab.empty);
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1053
      in
32035
8e77b6a250d5 tuned/modernized Envir.subst_XXX;
wenzelm
parents: 31986
diff changeset
  1054
        map (Envir.subst_term tab) vars
22789
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1055
      end
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1056
  in
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1057
    map (mtch o apsnd prop_of) (cases ~~ intros)
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1058
  end;
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1059
4d03dc1cad04 Added functions arities_of, params_of, partition_rules, and
berghofe
parents: 22675
diff changeset
  1060
25978
8ba1eba8d058 added theorem group;
wenzelm
parents: 25822
diff changeset
  1061
6437
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
  1062
(** package setup **)
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
  1063
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
  1064
(* setup theory *)
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
  1065
8634
3f34637cb9c0 use Attrib.add_del_args;
wenzelm
parents: 8433
diff changeset
  1066
val setup =
30722
623d4831c8cf simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents: 30552
diff changeset
  1067
  ind_cases_setup #>
30528
7173bf123335 simplified attribute setup;
wenzelm
parents: 30515
diff changeset
  1068
  Attrib.setup @{binding mono} (Attrib.add_del mono_add mono_del)
7173bf123335 simplified attribute setup;
wenzelm
parents: 30515
diff changeset
  1069
    "declaration of monotonicity rule";
6437
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
  1070
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
  1071
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
  1072
(* outer syntax *)
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
  1073
36960
01594f816e3a prefer structure Keyword, Parse, Parse_Spec, Outer_Syntax;
wenzelm
parents: 36958
diff changeset
  1074
val _ = Keyword.keyword "monos";
24867
e5b55d7be9bb simplified interfaces for outer syntax;
wenzelm
parents: 24861
diff changeset
  1075
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
  1076
fun gen_ind_decl mk_def coind =
36960
01594f816e3a prefer structure Keyword, Parse, Parse_Spec, Outer_Syntax;
wenzelm
parents: 36958
diff changeset
  1077
  Parse.fixes -- Parse.for_fixes --
36954
ef698bd61057 prefer structure Parse_Spec;
wenzelm
parents: 36692
diff changeset
  1078
  Scan.optional Parse_Spec.where_alt_specs [] --
36960
01594f816e3a prefer structure Keyword, Parse, Parse_Spec, Outer_Syntax;
wenzelm
parents: 36958
diff changeset
  1079
  Scan.optional (Parse.$$$ "monos" |-- Parse.!!! Parse_Spec.xthms1) []
26988
742e26213212 more uniform treatment of OuterSyntax.local_theory commands;
wenzelm
parents: 26928
diff changeset
  1080
  >> (fn (((preds, params), specs), monos) =>
30486
9cdc7ce0e389 simplified preparation and outer parsing of specification;
wenzelm
parents: 30435
diff changeset
  1081
      (snd oo gen_add_inductive mk_def true coind preds params specs monos));
23762
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
  1082
24eef53a9ad3 Reorganization due to introduction of inductive_set wrapper.
berghofe
parents: 23577
diff changeset
  1083
val ind_decl = gen_ind_decl add_ind_def;
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
  1084
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
  1085
val _ =
36960
01594f816e3a prefer structure Keyword, Parse, Parse_Spec, Outer_Syntax;
wenzelm
parents: 36958
diff changeset
  1086
  Outer_Syntax.local_theory' "inductive" "define inductive predicates" Keyword.thy_decl
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
  1087
    (ind_decl false);
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
  1088
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
  1089
val _ =
36960
01594f816e3a prefer structure Keyword, Parse, Parse_Spec, Outer_Syntax;
wenzelm
parents: 36958
diff changeset
  1090
  Outer_Syntax.local_theory' "coinductive" "define coinductive predicates" Keyword.thy_decl
33458
ae1f5d89b082 proper naming convention lthy: local_theory, but ctxt: Proof.context for arbitrary context;
wenzelm
parents: 33457
diff changeset
  1091
    (ind_decl true);
6723
f342449d73ca outer syntax keyword classification;
wenzelm
parents: 6556
diff changeset
  1092
24867
e5b55d7be9bb simplified interfaces for outer syntax;
wenzelm
parents: 24861
diff changeset
  1093
val _ =
36960
01594f816e3a prefer structure Keyword, Parse, Parse_Spec, Outer_Syntax;
wenzelm
parents: 36958
diff changeset
  1094
  Outer_Syntax.local_theory "inductive_cases"
01594f816e3a prefer structure Keyword, Parse, Parse_Spec, Outer_Syntax;
wenzelm
parents: 36958
diff changeset
  1095
    "create simplified instances of elimination rules (improper)" Keyword.thy_script
01594f816e3a prefer structure Keyword, Parse, Parse_Spec, Outer_Syntax;
wenzelm
parents: 36958
diff changeset
  1096
    (Parse.and_list1 Parse_Spec.specs >> (snd oo inductive_cases));
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
  1097
37734
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
  1098
val _ =
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
  1099
  Outer_Syntax.local_theory "inductive_simps"
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
  1100
    "create simplification rules for inductive predicates" Keyword.thy_script
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
  1101
    (Parse.and_list1 Parse_Spec.specs >> (snd oo inductive_simps));
489ac1ecb9f1 added the new command inductive_cases to derive simplification equations for inductive predicates; added binding simps for general simplification equation
bulwahn
parents: 37264
diff changeset
  1102
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
  1103
end;