src/HOL/Tools/inductive_package.ML
author nipkow
Wed, 11 Oct 2000 09:09:06 +0200
changeset 10186 499637e8f2c6
parent 10065 ddb3a014f721
child 10202 9e8b4bebc940
permissions -rw-r--r--
*** empty log message ***
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
     1
(*  Title:      HOL/Tools/inductive_package.ML
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
     2
    ID:         $Id$
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
     4
                Stefan Berghofer,   TU Muenchen
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
     5
    Copyright   1994  University of Cambridge
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
     6
                1998  TU Muenchen
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
     7
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
     8
(Co)Inductive Definition module for HOL.
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
     9
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    10
Features:
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
    11
  * least or greatest fixedpoints
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
    12
  * user-specified product and sum constructions
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
    13
  * mutually recursive definitions
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
    14
  * definitions involving arbitrary monotone operators
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
    15
  * automatically proves introduction and elimination rules
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    16
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
    17
The recursive sets must *already* be declared as constants in the
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
    18
current theory!
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    19
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    20
  Introduction rules have the form
8316
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
    21
  [| ti:M(Sj), ..., P(x), ... |] ==> t: Sk
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    22
  where M is some monotone operator (usually the identity)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    23
  P(x) is any side condition on the free variables
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    24
  ti, t are any terms
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    25
  Sj, Sk are two of the sets being defined in mutual recursion
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    26
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
    27
Sums are used only for mutual recursion.  Products are used only to
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
    28
derive "streamlined" induction rules for relations.
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    29
*)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    30
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    31
signature INDUCTIVE_PACKAGE =
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    32
sig
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
    33
  val quiet_mode: bool ref
7020
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
    34
  val unify_consts: Sign.sg -> term list -> term list -> term list * term list
9116
9df44b5c610b get_inductive now returns None instead of raising an exception.
berghofe
parents: 9072
diff changeset
    35
  val get_inductive: theory -> string -> ({names: string list, coind: bool} *
9df44b5c610b get_inductive now returns None instead of raising an exception.
berghofe
parents: 9072
diff changeset
    36
    {defs: thm list, elims: thm list, raw_induct: thm, induct: thm,
9df44b5c610b get_inductive now returns None instead of raising an exception.
berghofe
parents: 9072
diff changeset
    37
     intrs: thm list, mk_cases: string -> thm, mono: thm, unfold: thm}) option
6437
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
    38
  val print_inductives: theory -> unit
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    39
  val mono_add_global: theory attribute
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    40
  val mono_del_global: theory attribute
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    41
  val get_monos: theory -> thm list
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
    42
  val add_inductive_i: bool -> bool -> bstring -> bool -> bool -> bool -> term list ->
6521
16c425fc00cb intrs attributes;
wenzelm
parents: 6437
diff changeset
    43
    theory attribute list -> ((bstring * term) * theory attribute list) list ->
16c425fc00cb intrs attributes;
wenzelm
parents: 6437
diff changeset
    44
      thm list -> thm list -> theory -> theory *
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
    45
      {defs: thm list, elims: thm list, raw_induct: thm, induct: thm,
6437
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
    46
       intrs: thm list, mk_cases: string -> thm, mono: thm, unfold: thm}
6521
16c425fc00cb intrs attributes;
wenzelm
parents: 6437
diff changeset
    47
  val add_inductive: bool -> bool -> string list -> Args.src list ->
16c425fc00cb intrs attributes;
wenzelm
parents: 6437
diff changeset
    48
    ((bstring * string) * Args.src list) list -> (xstring * Args.src list) list ->
16c425fc00cb intrs attributes;
wenzelm
parents: 6437
diff changeset
    49
      (xstring * Args.src list) list -> theory -> theory *
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
    50
      {defs: thm list, elims: thm list, raw_induct: thm, induct: thm,
6437
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
    51
       intrs: thm list, mk_cases: string -> thm, mono: thm, unfold: thm}
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
    52
  val inductive_cases: ((bstring * Args.src list) * string list) * Comment.text
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
    53
    -> theory -> theory
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
    54
  val inductive_cases_i: ((bstring * theory attribute list) * term list) * Comment.text
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
    55
    -> theory -> theory
6437
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
    56
  val setup: (theory -> theory) list
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    57
end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    58
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
    59
structure InductivePackage: INDUCTIVE_PACKAGE =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    60
struct
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
    61
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
    62
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    63
(*** theory data ***)
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    64
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    65
(* data kind 'HOL/inductive' *)
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    66
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    67
type inductive_info =
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    68
  {names: string list, coind: bool} * {defs: thm list, elims: thm list, raw_induct: thm,
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    69
    induct: thm, intrs: thm list, mk_cases: string -> thm, mono: thm, unfold: thm};
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    70
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    71
structure InductiveArgs =
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    72
struct
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    73
  val name = "HOL/inductive";
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    74
  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
    75
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    76
  val empty = (Symtab.empty, []);
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    77
  val copy = I;
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    78
  val prep_ext = I;
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    79
  fun merge ((tab1, monos1), (tab2, monos2)) = (Symtab.merge (K true) (tab1, tab2),
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    80
    Library.generic_merge Thm.eq_thm I I monos1 monos2);
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    81
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    82
  fun print sg (tab, monos) =
8720
840c75ab2a7f Pretty.chunks;
wenzelm
parents: 8634
diff changeset
    83
    [Pretty.strs ("(co)inductives:" :: map #1 (Sign.cond_extern_table sg Sign.constK tab)),
10008
61eb9f3aa92a Display.pretty_thm_sg;
wenzelm
parents: 9939
diff changeset
    84
     Pretty.big_list "monotonicity rules:" (map (Display.pretty_thm_sg sg) monos)]
8720
840c75ab2a7f Pretty.chunks;
wenzelm
parents: 8634
diff changeset
    85
    |> Pretty.chunks |> Pretty.writeln;
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    86
end;
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    87
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    88
structure InductiveData = TheoryDataFun(InductiveArgs);
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    89
val print_inductives = InductiveData.print;
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    90
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    91
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    92
(* get and put data *)
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    93
9116
9df44b5c610b get_inductive now returns None instead of raising an exception.
berghofe
parents: 9072
diff changeset
    94
fun get_inductive thy name = Symtab.lookup (fst (InductiveData.get thy), name);
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
    95
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
    96
fun the_inductive thy name =
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
    97
  (case get_inductive thy name of
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
    98
    None => error ("Unknown (co)inductive set " ^ quote name)
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
    99
  | Some info => info);
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   100
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   101
fun put_inductives names info thy =
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   102
  let
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   103
    fun upd ((tab, monos), name) = (Symtab.update_new ((name, info), tab), monos);
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   104
    val tab_monos = foldl upd (InductiveData.get thy, names)
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   105
      handle Symtab.DUP name => error ("Duplicate definition of (co)inductive set " ^ quote name);
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   106
  in InductiveData.put tab_monos thy end;
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   107
8277
493707fcd8a6 added cases_of, cases;
wenzelm
parents: 8100
diff changeset
   108
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   109
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   110
(** monotonicity rules **)
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   111
9831
9b883c416aef tuned "mono" att setup;
wenzelm
parents: 9804
diff changeset
   112
val get_monos = #2 o InductiveData.get;
9b883c416aef tuned "mono" att setup;
wenzelm
parents: 9804
diff changeset
   113
fun map_monos f = InductiveData.map (Library.apsnd f);
8277
493707fcd8a6 added cases_of, cases;
wenzelm
parents: 8100
diff changeset
   114
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   115
fun mk_mono thm =
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   116
  let
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   117
    fun eq2mono thm' = [standard (thm' RS (thm' RS eq_to_mono))] @
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   118
      (case concl_of thm of
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   119
          (_ $ (_ $ (Const ("Not", _) $ _) $ _)) => []
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   120
        | _ => [standard (thm' RS (thm' RS eq_to_mono2))]);
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   121
    val concl = concl_of thm
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   122
  in
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   123
    if Logic.is_equals concl then
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   124
      eq2mono (thm RS meta_eq_to_obj_eq)
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   125
    else if can (HOLogic.dest_eq o HOLogic.dest_Trueprop) concl then
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   126
      eq2mono thm
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   127
    else [thm]
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   128
  end;
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   129
8634
3f34637cb9c0 use Attrib.add_del_args;
wenzelm
parents: 8433
diff changeset
   130
3f34637cb9c0 use Attrib.add_del_args;
wenzelm
parents: 8433
diff changeset
   131
(* attributes *)
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   132
9831
9b883c416aef tuned "mono" att setup;
wenzelm
parents: 9804
diff changeset
   133
fun mono_add_global (thy, thm) = (map_monos (Drule.add_rules (mk_mono thm)) thy, thm);
9b883c416aef tuned "mono" att setup;
wenzelm
parents: 9804
diff changeset
   134
fun mono_del_global (thy, thm) = (map_monos (Drule.del_rules (mk_mono thm)) thy, thm);
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   135
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   136
val mono_attr =
8634
3f34637cb9c0 use Attrib.add_del_args;
wenzelm
parents: 8433
diff changeset
   137
 (Attrib.add_del_args mono_add_global mono_del_global,
3f34637cb9c0 use Attrib.add_del_args;
wenzelm
parents: 8433
diff changeset
   138
  Attrib.add_del_args Attrib.undef_local_attribute Attrib.undef_local_attribute);
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   139
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   140
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   141
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   142
(** utilities **)
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   143
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   144
(* messages *)
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   145
5662
72a2e33d3b9e Added quiet_mode flag.
berghofe
parents: 5553
diff changeset
   146
val quiet_mode = ref false;
72a2e33d3b9e Added quiet_mode flag.
berghofe
parents: 5553
diff changeset
   147
fun message s = if !quiet_mode then () else writeln s;
72a2e33d3b9e Added quiet_mode flag.
berghofe
parents: 5553
diff changeset
   148
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   149
fun coind_prefix true = "co"
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   150
  | coind_prefix false = "";
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   151
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   152
7020
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   153
(* the following code ensures that each recursive set *)
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   154
(* always has the same type in all introduction rules *)
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   155
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   156
fun unify_consts sign cs intr_ts =
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   157
  (let
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   158
    val {tsig, ...} = Sign.rep_sg sign;
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   159
    val add_term_consts_2 =
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   160
      foldl_aterms (fn (cs, Const c) => c ins cs | (cs, _) => cs);
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   161
    fun varify (t, (i, ts)) =
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   162
      let val t' = map_term_types (incr_tvar (i + 1)) (Type.varify (t, []))
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   163
      in (maxidx_of_term t', t'::ts) end;
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   164
    val (i, cs') = foldr varify (cs, (~1, []));
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   165
    val (i', intr_ts') = foldr varify (intr_ts, (i, []));
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   166
    val rec_consts = foldl add_term_consts_2 ([], cs');
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   167
    val intr_consts = foldl add_term_consts_2 ([], intr_ts');
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   168
    fun unify (env, (cname, cT)) =
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   169
      let val consts = map snd (filter (fn c => fst c = cname) intr_consts)
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   170
      in foldl (fn ((env', j'), Tp) => (Type.unify tsig j' env' Tp))
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   171
          (env, (replicate (length consts) cT) ~~ consts)
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   172
      end;
8410
5902c02fa122 Type.unify now uses Vartab instead of association lists.
berghofe
parents: 8401
diff changeset
   173
    val (env, _) = foldl unify ((Vartab.empty, i'), rec_consts);
5902c02fa122 Type.unify now uses Vartab instead of association lists.
berghofe
parents: 8401
diff changeset
   174
    fun typ_subst_TVars_2 env T = let val T' = typ_subst_TVars_Vartab env T
7020
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   175
      in if T = T' then T else typ_subst_TVars_2 env T' end;
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   176
    val subst = fst o Type.freeze_thaw o
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   177
      (map_term_types (typ_subst_TVars_2 env))
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   178
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   179
  in (map subst cs', map subst intr_ts')
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   180
  end) handle Type.TUNIFY =>
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   181
    (warning "Occurrences of recursive constant have non-unifiable types"; (cs, intr_ts));
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   182
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   183
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   184
(* misc *)
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   185
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   186
val Const _ $ (vimage_f $ _) $ _ = HOLogic.dest_Trueprop (concl_of vimageD);
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   187
10065
ddb3a014f721 renaming the inverse image operator in HOL
paulson
parents: 10008
diff changeset
   188
val vimage_name = Sign.intern_const (Theory.sign_of Vimage.thy) "vimage";
6394
3d9fd50fcc43 Theory.sign_of;
wenzelm
parents: 6141
diff changeset
   189
val mono_name = Sign.intern_const (Theory.sign_of Ord.thy) "mono";
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   190
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   191
(* make injections needed in mutually recursive definitions *)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   192
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   193
fun mk_inj cs sumT c x =
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   194
  let
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   195
    fun mk_inj' T n i =
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   196
      if n = 1 then x else
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   197
      let val n2 = n div 2;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   198
          val Type (_, [T1, T2]) = T
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   199
      in
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   200
        if i <= n2 then
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   201
          Const ("Inl", T1 --> T) $ (mk_inj' T1 n2 i)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   202
        else
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   203
          Const ("Inr", T2 --> T) $ (mk_inj' T2 (n - n2) (i - n2))
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   204
      end
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   205
  in mk_inj' sumT (length cs) (1 + find_index_eq c cs)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   206
  end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   207
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   208
(* make "vimage" terms for selecting out components of mutually rec.def. *)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   209
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   210
fun mk_vimage cs sumT t c = if length cs < 2 then t else
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   211
  let
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   212
    val cT = HOLogic.dest_setT (fastype_of c);
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   213
    val vimageT = [cT --> sumT, HOLogic.mk_setT sumT] ---> HOLogic.mk_setT cT
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   214
  in
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   215
    Const (vimage_name, vimageT) $
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   216
      Abs ("y", cT, mk_inj cs sumT c (Bound 0)) $ t
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   217
  end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   218
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   219
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   220
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   221
(** well-formedness checks **)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   222
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   223
fun err_in_rule sign t msg = error ("Ill-formed introduction rule\n" ^
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   224
  (Sign.string_of_term sign t) ^ "\n" ^ msg);
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   225
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   226
fun err_in_prem sign t p msg = error ("Ill-formed premise\n" ^
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   227
  (Sign.string_of_term sign p) ^ "\nin introduction rule\n" ^
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   228
  (Sign.string_of_term sign t) ^ "\n" ^ msg);
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   229
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   230
val msg1 = "Conclusion of introduction rule must have form\
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   231
          \ ' t : S_i '";
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   232
val msg2 = "Non-atomic premise";
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   233
val msg3 = "Recursion term on left of member symbol";
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   234
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   235
fun check_rule sign cs r =
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   236
  let
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   237
    fun check_prem prem = if can HOLogic.dest_Trueprop prem then ()
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   238
      else err_in_prem sign r prem msg2;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   239
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   240
  in (case HOLogic.dest_Trueprop (Logic.strip_imp_concl r) of
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   241
        (Const ("op :", _) $ t $ u) =>
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   242
          if u mem cs then
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   243
            if exists (Logic.occs o (rpair t)) cs then
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   244
              err_in_rule sign r msg3
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   245
            else
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   246
              seq check_prem (Logic.strip_imp_prems r)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   247
          else err_in_rule sign r msg1
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   248
      | _ => err_in_rule sign r msg1)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   249
  end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   250
7020
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   251
fun try' f msg sign t = (case (try f t) of
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   252
      Some x => x
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   253
    | None => error (msg ^ Sign.string_of_term sign t));
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   254
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   255
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   256
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   257
(*** properties of (co)inductive sets ***)
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   258
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   259
(** elimination rules **)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   260
8375
0544749a5e8f mk_elims, add_cases_induct: name rule cases;
wenzelm
parents: 8336
diff changeset
   261
fun mk_elims cs cTs params intr_ts intr_names =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   262
  let
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   263
    val used = foldr add_term_names (intr_ts, []);
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   264
    val [aname, pname] = variantlist (["a", "P"], used);
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   265
    val P = HOLogic.mk_Trueprop (Free (pname, HOLogic.boolT));
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   266
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   267
    fun dest_intr r =
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   268
      let val Const ("op :", _) $ t $ u =
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   269
        HOLogic.dest_Trueprop (Logic.strip_imp_concl r)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   270
      in (u, t, Logic.strip_imp_prems r) end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   271
8380
c96953faf0a4 removed tune_names;
wenzelm
parents: 8375
diff changeset
   272
    val intrs = map dest_intr intr_ts ~~ intr_names;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   273
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   274
    fun mk_elim (c, T) =
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   275
      let
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   276
        val a = Free (aname, T);
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   277
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   278
        fun mk_elim_prem (_, t, ts) =
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   279
          list_all_free (map dest_Free ((foldr add_term_frees (t::ts, [])) \\ params),
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   280
            Logic.list_implies (HOLogic.mk_Trueprop (HOLogic.mk_eq (a, t)) :: ts, P));
8375
0544749a5e8f mk_elims, add_cases_induct: name rule cases;
wenzelm
parents: 8336
diff changeset
   281
        val c_intrs = (filter (equal c o #1 o #1) intrs);
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   282
      in
8375
0544749a5e8f mk_elims, add_cases_induct: name rule cases;
wenzelm
parents: 8336
diff changeset
   283
        (Logic.list_implies (HOLogic.mk_Trueprop (HOLogic.mk_mem (a, c)) ::
0544749a5e8f mk_elims, add_cases_induct: name rule cases;
wenzelm
parents: 8336
diff changeset
   284
          map mk_elim_prem (map #1 c_intrs), P), map #2 c_intrs)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   285
      end
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   286
  in
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   287
    map mk_elim (cs ~~ cTs)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   288
  end;
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   289
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   290
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   291
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   292
(** premises and conclusions of induction rules **)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   293
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   294
fun mk_indrule cs cTs params intr_ts =
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   295
  let
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   296
    val used = foldr add_term_names (intr_ts, []);
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   297
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   298
    (* predicates for induction rule *)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   299
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   300
    val preds = map Free (variantlist (if length cs < 2 then ["P"] else
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   301
      map (fn i => "P" ^ string_of_int i) (1 upto length cs), used) ~~
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   302
        map (fn T => T --> HOLogic.boolT) cTs);
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   303
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   304
    (* transform an introduction rule into a premise for induction rule *)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   305
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   306
    fun mk_ind_prem r =
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   307
      let
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   308
        val frees = map dest_Free ((add_term_frees (r, [])) \\ params);
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   309
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   310
        val pred_of = curry (Library.gen_assoc (op aconv)) (cs ~~ preds);
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   311
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   312
        fun subst (s as ((m as Const ("op :", T)) $ t $ u)) =
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   313
              (case pred_of u of
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   314
                  None => (m $ fst (subst t) $ fst (subst u), None)
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   315
                | Some P => (HOLogic.conj $ s $ (P $ t), Some (s, P $ t)))
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   316
          | subst s =
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   317
              (case pred_of s of
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   318
                  Some P => (HOLogic.mk_binop "op Int"
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   319
                    (s, HOLogic.Collect_const (HOLogic.dest_setT
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   320
                      (fastype_of s)) $ P), None)
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   321
                | None => (case s of
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   322
                     (t $ u) => (fst (subst t) $ fst (subst u), None)
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   323
                   | (Abs (a, T, t)) => (Abs (a, T, fst (subst t)), None)
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   324
                   | _ => (s, None)));
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   325
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   326
        fun mk_prem (s, prems) = (case subst s of
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   327
              (_, Some (t, u)) => t :: u :: prems
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   328
            | (t, _) => t :: prems);
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   329
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   330
        val Const ("op :", _) $ t $ u =
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   331
          HOLogic.dest_Trueprop (Logic.strip_imp_concl r)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   332
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   333
      in list_all_free (frees,
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   334
           Logic.list_implies (map HOLogic.mk_Trueprop (foldr mk_prem
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   335
             (map HOLogic.dest_Trueprop (Logic.strip_imp_prems r), [])),
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   336
               HOLogic.mk_Trueprop (the (pred_of u) $ t)))
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   337
      end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   338
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   339
    val ind_prems = map mk_ind_prem intr_ts;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   340
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   341
    (* make conclusions for induction rules *)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   342
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   343
    fun mk_ind_concl ((c, P), (ts, x)) =
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   344
      let val T = HOLogic.dest_setT (fastype_of c);
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   345
          val Ts = HOLogic.prodT_factors T;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   346
          val (frees, x') = foldr (fn (T', (fs, s)) =>
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   347
            ((Free (s, T'))::fs, bump_string s)) (Ts, ([], x));
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   348
          val tuple = HOLogic.mk_tuple T frees;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   349
      in ((HOLogic.mk_binop "op -->"
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   350
        (HOLogic.mk_mem (tuple, c), P $ tuple))::ts, x')
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   351
      end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   352
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   353
    val mutual_ind_concl = HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   354
        (fst (foldr mk_ind_concl (cs ~~ preds, ([], "xa")))))
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   355
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   356
  in (preds, ind_prems, mutual_ind_concl)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   357
  end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   358
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   359
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   360
8316
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   361
(** prepare cases and induct rules **)
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   362
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   363
(*
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   364
  transform mutual rule:
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   365
    HH ==> (x1:A1 --> P1 x1) & ... & (xn:An --> Pn xn)
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   366
  into i-th projection:
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   367
    xi:Ai ==> HH ==> Pi xi
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   368
*)
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   369
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   370
fun project_rules [name] rule = [(name, rule)]
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   371
  | project_rules names mutual_rule =
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   372
      let
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   373
        val n = length names;
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   374
        fun proj i =
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   375
          (if i < n then (fn th => th RS conjunct1) else I)
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   376
            (Library.funpow (i - 1) (fn th => th RS conjunct2) mutual_rule)
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   377
            RS mp |> Thm.permute_prems 0 ~1 |> Drule.standard;
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   378
      in names ~~ map proj (1 upto n) end;
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   379
8375
0544749a5e8f mk_elims, add_cases_induct: name rule cases;
wenzelm
parents: 8336
diff changeset
   380
fun add_cases_induct no_elim no_ind names elims induct induct_cases =
8316
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   381
  let
9405
3235873fdd90 improved error msg;
wenzelm
parents: 9315
diff changeset
   382
    fun cases_spec (name, elim) thy =
3235873fdd90 improved error msg;
wenzelm
parents: 9315
diff changeset
   383
      thy
3235873fdd90 improved error msg;
wenzelm
parents: 9315
diff changeset
   384
      |> Theory.add_path (Sign.base_name name)
3235873fdd90 improved error msg;
wenzelm
parents: 9315
diff changeset
   385
      |> (#1 o PureThy.add_thms [(("cases", elim), [InductMethod.cases_set_global name])])
3235873fdd90 improved error msg;
wenzelm
parents: 9315
diff changeset
   386
      |> Theory.parent_path;
8375
0544749a5e8f mk_elims, add_cases_induct: name rule cases;
wenzelm
parents: 8336
diff changeset
   387
    val cases_specs = if no_elim then [] else map2 cases_spec (names, elims);
8316
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   388
9405
3235873fdd90 improved error msg;
wenzelm
parents: 9315
diff changeset
   389
    fun induct_spec (name, th) = (#1 o PureThy.add_thms
3235873fdd90 improved error msg;
wenzelm
parents: 9315
diff changeset
   390
      [(("", th), [RuleCases.case_names induct_cases, InductMethod.induct_set_global name])]);
8401
50d5f4402305 more robust case names of induct;
wenzelm
parents: 8380
diff changeset
   391
    val induct_specs = if no_ind then [] else map induct_spec (project_rules names induct);
9405
3235873fdd90 improved error msg;
wenzelm
parents: 9315
diff changeset
   392
  in Library.apply (cases_specs @ induct_specs) end;
8316
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   393
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   394
74639e19eca0 add_cases_induct: project_rules accomodates mutual induction;
wenzelm
parents: 8312
diff changeset
   395
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   396
(*** proofs for (co)inductive sets ***)
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   397
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   398
(** prove monotonicity **)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   399
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   400
fun prove_mono setT fp_fun monos thy =
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   401
  let
6427
fd36b2e7d80e tuned messages;
wenzelm
parents: 6424
diff changeset
   402
    val _ = message "  Proving monotonicity ...";
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   403
6394
3d9fd50fcc43 Theory.sign_of;
wenzelm
parents: 6141
diff changeset
   404
    val mono = prove_goalw_cterm [] (cterm_of (Theory.sign_of thy) (HOLogic.mk_Trueprop
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   405
      (Const (mono_name, (setT --> setT) --> HOLogic.boolT) $ fp_fun)))
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   406
        (fn _ => [rtac monoI 1, REPEAT (ares_tac (get_monos thy @ flat (map mk_mono monos)) 1)])
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   407
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   408
  in mono end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   409
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   410
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   411
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   412
(** prove introduction rules **)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   413
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   414
fun prove_intrs coind mono fp_def intr_ts con_defs rec_sets_defs thy =
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   415
  let
6427
fd36b2e7d80e tuned messages;
wenzelm
parents: 6424
diff changeset
   416
    val _ = message "  Proving the introduction rules ...";
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   417
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   418
    val unfold = standard (mono RS (fp_def RS
10186
499637e8f2c6 *** empty log message ***
nipkow
parents: 10065
diff changeset
   419
      (if coind then def_gfp_unfold else def_lfp_unfold)));
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   420
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   421
    fun select_disj 1 1 = []
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   422
      | select_disj _ 1 = [rtac disjI1]
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   423
      | select_disj n i = (rtac disjI2)::(select_disj (n - 1) (i - 1));
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   424
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   425
    val intrs = map (fn (i, intr) => prove_goalw_cterm rec_sets_defs
6394
3d9fd50fcc43 Theory.sign_of;
wenzelm
parents: 6141
diff changeset
   426
      (cterm_of (Theory.sign_of thy) intr) (fn prems =>
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   427
       [(*insert prems and underlying sets*)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   428
       cut_facts_tac prems 1,
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   429
       stac unfold 1,
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   430
       REPEAT (resolve_tac [vimageI2, CollectI] 1),
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   431
       (*Now 1-2 subgoals: the disjunction, perhaps equality.*)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   432
       EVERY1 (select_disj (length intr_ts) i),
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   433
       (*Not ares_tac, since refl must be tried before any equality assumptions;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   434
         backtracking may occur if the premises have extra variables!*)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   435
       DEPTH_SOLVE_1 (resolve_tac [refl,exI,conjI] 1 APPEND assume_tac 1),
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   436
       (*Now solve the equations like Inl 0 = Inl ?b2*)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   437
       rewrite_goals_tac con_defs,
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   438
       REPEAT (rtac refl 1)])) (1 upto (length intr_ts) ~~ intr_ts)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   439
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   440
  in (intrs, unfold) end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   441
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   442
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   443
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   444
(** prove elimination rules **)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   445
8375
0544749a5e8f mk_elims, add_cases_induct: name rule cases;
wenzelm
parents: 8336
diff changeset
   446
fun prove_elims cs cTs params intr_ts intr_names unfold rec_sets_defs thy =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   447
  let
6427
fd36b2e7d80e tuned messages;
wenzelm
parents: 6424
diff changeset
   448
    val _ = message "  Proving the elimination rules ...";
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   449
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   450
    val rules1 = [CollectE, disjE, make_elim vimageD, exE];
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   451
    val rules2 = [conjE, Inl_neq_Inr, Inr_neq_Inl] @
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   452
      map make_elim [Inl_inject, Inr_inject];
8375
0544749a5e8f mk_elims, add_cases_induct: name rule cases;
wenzelm
parents: 8336
diff changeset
   453
  in
0544749a5e8f mk_elims, add_cases_induct: name rule cases;
wenzelm
parents: 8336
diff changeset
   454
    map (fn (t, cases) => prove_goalw_cterm rec_sets_defs
6394
3d9fd50fcc43 Theory.sign_of;
wenzelm
parents: 6141
diff changeset
   455
      (cterm_of (Theory.sign_of thy) t) (fn prems =>
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   456
        [cut_facts_tac [hd prems] 1,
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   457
         dtac (unfold RS subst) 1,
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   458
         REPEAT (FIRSTGOAL (eresolve_tac rules1)),
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   459
         REPEAT (FIRSTGOAL (eresolve_tac rules2)),
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   460
         EVERY (map (fn prem =>
8375
0544749a5e8f mk_elims, add_cases_induct: name rule cases;
wenzelm
parents: 8336
diff changeset
   461
           DEPTH_SOLVE_1 (ares_tac [prem, conjI] 1)) (tl prems))])
0544749a5e8f mk_elims, add_cases_induct: name rule cases;
wenzelm
parents: 8336
diff changeset
   462
      |> RuleCases.name cases)
0544749a5e8f mk_elims, add_cases_induct: name rule cases;
wenzelm
parents: 8336
diff changeset
   463
      (mk_elims cs cTs params intr_ts intr_names)
0544749a5e8f mk_elims, add_cases_induct: name rule cases;
wenzelm
parents: 8336
diff changeset
   464
  end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   465
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   466
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   467
(** derivation of simplified elimination rules **)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   468
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   469
(*Applies freeness of the given constructors, which *must* be unfolded by
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   470
  the given defs.  Cannot simply use the local con_defs because con_defs=[]
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   471
  for inference systems.
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   472
 *)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   473
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   474
(*cprop should have the form t:Si where Si is an inductive set*)
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   475
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   476
val mk_cases_err = "mk_cases: proposition not of form 't : S_i'";
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   477
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   478
fun mk_cases_i elims ss cprop =
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   479
  let
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   480
    val prem = Thm.assume cprop;
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   481
    val tac = ALLGOALS (InductMethod.simp_case_tac false ss) THEN prune_params_tac;
9298
7d9b562a750b use InductMethod.simp_case_tac;
wenzelm
parents: 9235
diff changeset
   482
    fun mk_elim rl = Drule.standard (Tactic.rule_by_tactic tac (prem RS rl));
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   483
  in
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   484
    (case get_first (try mk_elim) elims of
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   485
      Some r => r
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   486
    | None => error (Pretty.string_of (Pretty.block
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   487
        [Pretty.str mk_cases_err, Pretty.fbrk, Display.pretty_cterm cprop])))
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   488
  end;
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   489
6141
a6922171b396 removal of the (thm list) argument of mk_cases
paulson
parents: 6092
diff changeset
   490
fun mk_cases elims s =
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   491
  mk_cases_i elims (simpset()) (Thm.read_cterm (Thm.sign_of_thm (hd elims)) (s, propT));
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   492
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   493
fun smart_mk_cases thy ss cprop =
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   494
  let
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   495
    val c = #1 (Term.dest_Const (Term.head_of (#2 (HOLogic.dest_mem (HOLogic.dest_Trueprop
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   496
      (Logic.strip_imp_concl (Thm.term_of cprop))))))) handle TERM _ => error mk_cases_err;
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   497
    val (_, {elims, ...}) = the_inductive thy c;
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   498
  in mk_cases_i elims ss cprop end;
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   499
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   500
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   501
(* inductive_cases(_i) *)
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   502
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   503
fun gen_inductive_cases prep_att prep_const prep_prop
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   504
    (((name, raw_atts), raw_props), comment) thy =
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   505
  let
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   506
    val ss = Simplifier.simpset_of thy;
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   507
    val sign = Theory.sign_of thy;
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   508
    val cprops = map (Thm.cterm_of sign o prep_prop (ProofContext.init thy)) raw_props;
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   509
    val atts = map (prep_att thy) raw_atts;
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   510
    val thms = map (smart_mk_cases thy ss) cprops;
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   511
  in thy |> IsarThy.have_theorems_i [(((name, atts), map Thm.no_attributes thms), comment)] end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   512
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   513
val inductive_cases =
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   514
  gen_inductive_cases Attrib.global_attribute Sign.intern_const ProofContext.read_prop;
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   515
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   516
val inductive_cases_i = gen_inductive_cases (K I) (K I) ProofContext.cert_prop;
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   517
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   518
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   519
(* mk_cases_meth *)
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   520
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   521
fun mk_cases_meth (ctxt, raw_props) =
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   522
  let
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   523
    val thy = ProofContext.theory_of ctxt;
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   524
    val ss = Simplifier.get_local_simpset ctxt;
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   525
    val cprops = map (Thm.cterm_of (Theory.sign_of thy) o ProofContext.read_prop ctxt) raw_props;
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   526
  in Method.erule (map (smart_mk_cases thy ss) cprops) end;
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   527
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   528
val mk_cases_args = Method.syntax (Scan.lift (Scan.repeat1 Args.name));
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   529
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   530
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   531
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   532
(** prove induction rule **)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   533
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   534
fun prove_indrule cs cTs sumT rec_const params intr_ts mono
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   535
    fp_def rec_sets_defs thy =
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   536
  let
6427
fd36b2e7d80e tuned messages;
wenzelm
parents: 6424
diff changeset
   537
    val _ = message "  Proving the induction rule ...";
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   538
6394
3d9fd50fcc43 Theory.sign_of;
wenzelm
parents: 6141
diff changeset
   539
    val sign = Theory.sign_of thy;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   540
7293
959e060f4a2f Moved sum_case stuff from Sum to Datatype.
berghofe
parents: 7257
diff changeset
   541
    val sum_case_rewrites = (case ThyInfo.lookup_theory "Datatype" of
959e060f4a2f Moved sum_case stuff from Sum to Datatype.
berghofe
parents: 7257
diff changeset
   542
        None => []
959e060f4a2f Moved sum_case stuff from Sum to Datatype.
berghofe
parents: 7257
diff changeset
   543
      | Some thy' => map mk_meta_eq (PureThy.get_thms thy' "sum.cases"));
959e060f4a2f Moved sum_case stuff from Sum to Datatype.
berghofe
parents: 7257
diff changeset
   544
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   545
    val (preds, ind_prems, mutual_ind_concl) = mk_indrule cs cTs params intr_ts;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   546
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   547
    (* make predicate for instantiation of abstract induction rule *)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   548
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   549
    fun mk_ind_pred _ [P] = P
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   550
      | mk_ind_pred T Ps =
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   551
         let val n = (length Ps) div 2;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   552
             val Type (_, [T1, T2]) = T
7293
959e060f4a2f Moved sum_case stuff from Sum to Datatype.
berghofe
parents: 7257
diff changeset
   553
         in Const ("Datatype.sum.sum_case",
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   554
           [T1 --> HOLogic.boolT, T2 --> HOLogic.boolT, T] ---> HOLogic.boolT) $
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   555
             mk_ind_pred T1 (take (n, Ps)) $ mk_ind_pred T2 (drop (n, Ps))
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   556
         end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   557
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   558
    val ind_pred = mk_ind_pred sumT preds;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   559
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   560
    val ind_concl = HOLogic.mk_Trueprop
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   561
      (HOLogic.all_const sumT $ Abs ("x", sumT, HOLogic.mk_binop "op -->"
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   562
        (HOLogic.mk_mem (Bound 0, rec_const), ind_pred $ Bound 0)));
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   563
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   564
    (* simplification rules for vimage and Collect *)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   565
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   566
    val vimage_simps = if length cs < 2 then [] else
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   567
      map (fn c => prove_goalw_cterm [] (cterm_of sign
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   568
        (HOLogic.mk_Trueprop (HOLogic.mk_eq
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   569
          (mk_vimage cs sumT (HOLogic.Collect_const sumT $ ind_pred) c,
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   570
           HOLogic.Collect_const (HOLogic.dest_setT (fastype_of c)) $
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   571
             nth_elem (find_index_eq c cs, preds)))))
7293
959e060f4a2f Moved sum_case stuff from Sum to Datatype.
berghofe
parents: 7257
diff changeset
   572
        (fn _ => [rtac vimage_Collect 1, rewrite_goals_tac sum_case_rewrites,
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   573
          rtac refl 1])) cs;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   574
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   575
    val induct = prove_goalw_cterm [] (cterm_of sign
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   576
      (Logic.list_implies (ind_prems, ind_concl))) (fn prems =>
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   577
        [rtac (impI RS allI) 1,
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   578
         DETERM (etac (mono RS (fp_def RS def_induct)) 1),
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   579
         rewrite_goals_tac (map mk_meta_eq (vimage_Int::Int_Collect::vimage_simps)),
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   580
         fold_goals_tac rec_sets_defs,
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   581
         (*This CollectE and disjE separates out the introduction rules*)
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   582
         REPEAT (FIRSTGOAL (eresolve_tac [CollectE, disjE, exE])),
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   583
         (*Now break down the individual cases.  No disjE here in case
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   584
           some premise involves disjunction.*)
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   585
         REPEAT (FIRSTGOAL (etac conjE ORELSE' hyp_subst_tac)),
7293
959e060f4a2f Moved sum_case stuff from Sum to Datatype.
berghofe
parents: 7257
diff changeset
   586
         rewrite_goals_tac sum_case_rewrites,
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   587
         EVERY (map (fn prem =>
5149
10f0be29c0d1 Fixed bug in transform_rule.
berghofe
parents: 5120
diff changeset
   588
           DEPTH_SOLVE_1 (ares_tac [prem, conjI, refl] 1)) prems)]);
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   589
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   590
    val lemma = prove_goalw_cterm rec_sets_defs (cterm_of sign
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   591
      (Logic.mk_implies (ind_concl, mutual_ind_concl))) (fn prems =>
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   592
        [cut_facts_tac prems 1,
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   593
         REPEAT (EVERY
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   594
           [REPEAT (resolve_tac [conjI, impI] 1),
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   595
            TRY (dtac vimageD 1), etac allE 1, dtac mp 1, atac 1,
7293
959e060f4a2f Moved sum_case stuff from Sum to Datatype.
berghofe
parents: 7257
diff changeset
   596
            rewrite_goals_tac sum_case_rewrites,
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   597
            atac 1])])
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   598
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   599
  in standard (split_rule (induct RS lemma))
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   600
  end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   601
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   602
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   603
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   604
(*** specification of (co)inductive sets ****)
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   605
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   606
(** definitional introduction of (co)inductive sets **)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   607
9072
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   608
fun mk_ind_def declare_consts alt_name coind cs intr_ts monos con_defs thy
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   609
      params paramTs cTs cnames =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   610
  let
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   611
    val sumT = fold_bal (fn (T, U) => Type ("+", [T, U])) cTs;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   612
    val setT = HOLogic.mk_setT sumT;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   613
6394
3d9fd50fcc43 Theory.sign_of;
wenzelm
parents: 6141
diff changeset
   614
    val fp_name = if coind then Sign.intern_const (Theory.sign_of Gfp.thy) "gfp"
3d9fd50fcc43 Theory.sign_of;
wenzelm
parents: 6141
diff changeset
   615
      else Sign.intern_const (Theory.sign_of Lfp.thy) "lfp";
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   616
5149
10f0be29c0d1 Fixed bug in transform_rule.
berghofe
parents: 5120
diff changeset
   617
    val used = foldr add_term_names (intr_ts, []);
10f0be29c0d1 Fixed bug in transform_rule.
berghofe
parents: 5120
diff changeset
   618
    val [sname, xname] = variantlist (["S", "x"], used);
10f0be29c0d1 Fixed bug in transform_rule.
berghofe
parents: 5120
diff changeset
   619
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   620
    (* transform an introduction rule into a conjunction  *)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   621
    (*   [| t : ... S_i ... ; ... |] ==> u : S_j          *)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   622
    (* is transformed into                                *)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   623
    (*   x = Inj_j u & t : ... Inj_i -`` S ... & ...      *)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   624
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   625
    fun transform_rule r =
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   626
      let
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   627
        val frees = map dest_Free ((add_term_frees (r, [])) \\ params);
5149
10f0be29c0d1 Fixed bug in transform_rule.
berghofe
parents: 5120
diff changeset
   628
        val subst = subst_free
10f0be29c0d1 Fixed bug in transform_rule.
berghofe
parents: 5120
diff changeset
   629
          (cs ~~ (map (mk_vimage cs sumT (Free (sname, setT))) cs));
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   630
        val Const ("op :", _) $ t $ u =
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   631
          HOLogic.dest_Trueprop (Logic.strip_imp_concl r)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   632
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   633
      in foldr (fn ((x, T), P) => HOLogic.mk_exists (x, T, P))
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   634
        (frees, foldr1 HOLogic.mk_conj
5149
10f0be29c0d1 Fixed bug in transform_rule.
berghofe
parents: 5120
diff changeset
   635
          (((HOLogic.eq_const sumT) $ Free (xname, sumT) $ (mk_inj cs sumT u t))::
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   636
            (map (subst o HOLogic.dest_Trueprop)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   637
              (Logic.strip_imp_prems r))))
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   638
      end
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   639
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   640
    (* make a disjunction of all introduction rules *)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   641
5149
10f0be29c0d1 Fixed bug in transform_rule.
berghofe
parents: 5120
diff changeset
   642
    val fp_fun = absfree (sname, setT, (HOLogic.Collect_const sumT) $
7710
bf8cb3fc5d64 Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents: 7349
diff changeset
   643
      absfree (xname, sumT, foldr1 HOLogic.mk_disj (map transform_rule intr_ts)));
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   644
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   645
    (* add definiton of recursive sets to theory *)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   646
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   647
    val rec_name = if alt_name = "" then space_implode "_" cnames else alt_name;
6394
3d9fd50fcc43 Theory.sign_of;
wenzelm
parents: 6141
diff changeset
   648
    val full_rec_name = Sign.full_name (Theory.sign_of thy) rec_name;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   649
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   650
    val rec_const = list_comb
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   651
      (Const (full_rec_name, paramTs ---> setT), params);
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   652
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   653
    val fp_def_term = Logic.mk_equals (rec_const,
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   654
      Const (fp_name, (setT --> setT) --> setT) $ fp_fun)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   655
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   656
    val def_terms = fp_def_term :: (if length cs < 2 then [] else
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   657
      map (fn c => Logic.mk_equals (c, mk_vimage cs sumT rec_const c)) cs);
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   658
8433
8ae16c770fc8 adapted to new PureThy.add_thms etc.;
wenzelm
parents: 8410
diff changeset
   659
    val (thy', [fp_def :: rec_sets_defs]) =
8ae16c770fc8 adapted to new PureThy.add_thms etc.;
wenzelm
parents: 8410
diff changeset
   660
      thy
8ae16c770fc8 adapted to new PureThy.add_thms etc.;
wenzelm
parents: 8410
diff changeset
   661
      |> (if declare_consts then
8ae16c770fc8 adapted to new PureThy.add_thms etc.;
wenzelm
parents: 8410
diff changeset
   662
          Theory.add_consts_i (map (fn (c, n) =>
8ae16c770fc8 adapted to new PureThy.add_thms etc.;
wenzelm
parents: 8410
diff changeset
   663
            (n, paramTs ---> fastype_of c, NoSyn)) (cs ~~ cnames))
8ae16c770fc8 adapted to new PureThy.add_thms etc.;
wenzelm
parents: 8410
diff changeset
   664
          else I)
8ae16c770fc8 adapted to new PureThy.add_thms etc.;
wenzelm
parents: 8410
diff changeset
   665
      |> (if length cs < 2 then I
8ae16c770fc8 adapted to new PureThy.add_thms etc.;
wenzelm
parents: 8410
diff changeset
   666
          else Theory.add_consts_i [(rec_name, paramTs ---> setT, NoSyn)])
8ae16c770fc8 adapted to new PureThy.add_thms etc.;
wenzelm
parents: 8410
diff changeset
   667
      |> Theory.add_path rec_name
9315
f793f05024f6 adapted PureThy.add_defs_i;
wenzelm
parents: 9298
diff changeset
   668
      |> PureThy.add_defss_i false [(("defs", def_terms), [])];
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   669
9072
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   670
    val mono = prove_mono setT fp_fun monos thy'
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   671
9072
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   672
  in
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   673
    (thy', mono, fp_def, rec_sets_defs, rec_const, sumT)
9072
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   674
  end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   675
9072
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   676
fun add_ind_def verbose declare_consts alt_name coind no_elim no_ind cs
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   677
    atts intros monos con_defs thy params paramTs cTs cnames induct_cases =
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   678
  let
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   679
    val _ = if verbose then message ("Proofs for " ^ coind_prefix coind ^ "inductive set(s) " ^
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   680
      commas_quote cnames) else ();
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   681
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   682
    val ((intr_names, intr_ts), intr_atts) = apfst split_list (split_list intros);
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   683
9939
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   684
    val (thy1, mono, fp_def, rec_sets_defs, rec_const, sumT) =
9072
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   685
      mk_ind_def declare_consts alt_name coind cs intr_ts monos con_defs thy
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   686
        params paramTs cTs cnames;
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   687
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   688
    val (intrs, unfold) = prove_intrs coind mono fp_def intr_ts con_defs
9939
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   689
      rec_sets_defs thy1;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   690
    val elims = if no_elim then [] else
9939
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   691
      prove_elims cs cTs params intr_ts intr_names unfold rec_sets_defs thy1;
8312
b470bc28b59d add_cases_induct: accomodate no_elim and no_ind flags;
wenzelm
parents: 8307
diff changeset
   692
    val raw_induct = if no_ind then Drule.asm_rl else
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   693
      if coind then standard (rule_by_tactic
5553
ae42b36a50c2 renamed mk_meta_eq to mk_eq
oheimb
parents: 5303
diff changeset
   694
        (rewrite_tac [mk_meta_eq vimage_Un] THEN
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   695
          fold_tac rec_sets_defs) (mono RS (fp_def RS def_Collect_coinduct)))
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   696
      else
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   697
        prove_indrule cs cTs sumT rec_const params intr_ts mono fp_def
9939
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   698
          rec_sets_defs thy1;
5108
4074c7d86d44 Fixed bug (improper handling of flag no_ind).
berghofe
parents: 5094
diff changeset
   699
    val induct = if coind orelse no_ind orelse length cs > 1 then raw_induct
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   700
      else standard (raw_induct RSN (2, rev_mp));
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   701
9939
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   702
    val (thy2, intrs') =
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   703
      thy1 |> PureThy.add_thms ((intr_names ~~ intrs) ~~ intr_atts);
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   704
    val (thy3, [intrs'']) =
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   705
      thy2      
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   706
      |> PureThy.add_thmss [(("intros", intrs'), atts)]
8433
8ae16c770fc8 adapted to new PureThy.add_thms etc.;
wenzelm
parents: 8410
diff changeset
   707
      |>> (if no_elim then I else #1 o PureThy.add_thmss [(("elims", elims), [])])
8ae16c770fc8 adapted to new PureThy.add_thms etc.;
wenzelm
parents: 8410
diff changeset
   708
      |>> (if no_ind then I else #1 o PureThy.add_thms
8401
50d5f4402305 more robust case names of induct;
wenzelm
parents: 8380
diff changeset
   709
        [((coind_prefix coind ^ "induct", induct), [RuleCases.case_names induct_cases])])
8433
8ae16c770fc8 adapted to new PureThy.add_thms etc.;
wenzelm
parents: 8410
diff changeset
   710
      |>> Theory.parent_path;
9939
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   711
    val elims' = if no_elim then elims else PureThy.get_thms thy3 "elims";  (* FIXME improve *)
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   712
    val induct' = if no_ind then induct else PureThy.get_thm thy3 (coind_prefix coind ^ "induct");  (* FIXME improve *)
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   713
  in (thy3,
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   714
    {defs = fp_def::rec_sets_defs,
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   715
     mono = mono,
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   716
     unfold = unfold,
9939
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   717
     intrs = intrs'',
7798
42e94b618f34 return stored thms with proper naming in derivation;
wenzelm
parents: 7710
diff changeset
   718
     elims = elims',
42e94b618f34 return stored thms with proper naming in derivation;
wenzelm
parents: 7710
diff changeset
   719
     mk_cases = mk_cases elims',
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   720
     raw_induct = raw_induct,
7798
42e94b618f34 return stored thms with proper naming in derivation;
wenzelm
parents: 7710
diff changeset
   721
     induct = induct'})
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   722
  end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   723
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   724
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   725
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   726
(** axiomatic introduction of (co)inductive sets **)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   727
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   728
fun add_ind_axm verbose declare_consts alt_name coind no_elim no_ind cs
8401
50d5f4402305 more robust case names of induct;
wenzelm
parents: 8380
diff changeset
   729
    atts intros monos con_defs thy params paramTs cTs cnames induct_cases =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   730
  let
9072
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   731
    val _ = message (coind_prefix coind ^ "inductive set(s) " ^ commas_quote cnames);
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   732
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   733
    val ((intr_names, intr_ts), intr_atts) = apfst split_list (split_list intros);
9939
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   734
    val (thy1, _, fp_def, rec_sets_defs, _, _) =
9072
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   735
      mk_ind_def declare_consts alt_name coind cs intr_ts monos con_defs thy
a4896cf23638 Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents: 8720
diff changeset
   736
        params paramTs cTs cnames;
8375
0544749a5e8f mk_elims, add_cases_induct: name rule cases;
wenzelm
parents: 8336
diff changeset
   737
    val (elim_ts, elim_cases) = Library.split_list (mk_elims cs cTs params intr_ts intr_names);
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   738
    val (_, ind_prems, mutual_ind_concl) = mk_indrule cs cTs params intr_ts;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   739
    val ind_t = Logic.list_implies (ind_prems, mutual_ind_concl);
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   740
9939
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   741
    val (thy2, [intrs, raw_elims]) =
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   742
      thy1
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   743
      |> (PureThy.add_axiomss_i o map Thm.no_attributes)
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   744
        [("raw_intros", intr_ts), ("raw_elims", elim_ts)]
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   745
      |>> (if coind then I else
8433
8ae16c770fc8 adapted to new PureThy.add_thms etc.;
wenzelm
parents: 8410
diff changeset
   746
            #1 o PureThy.add_axioms_i [(("raw_induct", ind_t), [apsnd (standard o split_rule)])]);
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   747
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   748
    val elims = map2 (fn (th, cases) => RuleCases.name cases th) (raw_elims, elim_cases);
9939
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   749
    val raw_induct = if coind then Drule.asm_rl else PureThy.get_thm thy2 "raw_induct";
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   750
    val induct = if coind orelse length cs > 1 then raw_induct
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   751
      else standard (raw_induct RSN (2, rev_mp));
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   752
9939
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   753
    val (thy3, intrs') =
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   754
      thy2 |> PureThy.add_thms ((intr_names ~~ intrs) ~~ intr_atts);
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   755
    val (thy4, [intrs'', elims']) =
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   756
      thy3
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   757
      |> PureThy.add_thmss [(("intros", intrs'), atts), (("elims", elims), [])]
8433
8ae16c770fc8 adapted to new PureThy.add_thms etc.;
wenzelm
parents: 8410
diff changeset
   758
      |>> (if coind then I
8ae16c770fc8 adapted to new PureThy.add_thms etc.;
wenzelm
parents: 8410
diff changeset
   759
          else #1 o PureThy.add_thms [(("induct", induct), [RuleCases.case_names induct_cases])])
8ae16c770fc8 adapted to new PureThy.add_thms etc.;
wenzelm
parents: 8410
diff changeset
   760
      |>> Theory.parent_path;
9939
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   761
    val induct' = if coind then raw_induct else PureThy.get_thm thy4 "induct";
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   762
  in (thy4,
9235
1f734dc2e526 previde 'defs' field for quick_and_dirty;
wenzelm
parents: 9201
diff changeset
   763
    {defs = fp_def :: rec_sets_defs,
8312
b470bc28b59d add_cases_induct: accomodate no_elim and no_ind flags;
wenzelm
parents: 8307
diff changeset
   764
     mono = Drule.asm_rl,
b470bc28b59d add_cases_induct: accomodate no_elim and no_ind flags;
wenzelm
parents: 8307
diff changeset
   765
     unfold = Drule.asm_rl,
9939
44af7faa677e tuned handling of "intros";
wenzelm
parents: 9893
diff changeset
   766
     intrs = intrs'',
8433
8ae16c770fc8 adapted to new PureThy.add_thms etc.;
wenzelm
parents: 8410
diff changeset
   767
     elims = elims',
8ae16c770fc8 adapted to new PureThy.add_thms etc.;
wenzelm
parents: 8410
diff changeset
   768
     mk_cases = mk_cases elims',
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   769
     raw_induct = raw_induct,
7798
42e94b618f34 return stored thms with proper naming in derivation;
wenzelm
parents: 7710
diff changeset
   770
     induct = induct'})
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   771
  end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   772
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   773
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   774
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   775
(** introduction of (co)inductive sets **)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   776
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   777
fun add_inductive_i verbose declare_consts alt_name coind no_elim no_ind cs
6521
16c425fc00cb intrs attributes;
wenzelm
parents: 6437
diff changeset
   778
    atts intros monos con_defs thy =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   779
  let
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   780
    val _ = Theory.requires thy "Inductive" (coind_prefix coind ^ "inductive definitions");
6394
3d9fd50fcc43 Theory.sign_of;
wenzelm
parents: 6141
diff changeset
   781
    val sign = Theory.sign_of thy;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   782
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   783
    (*parameters should agree for all mutually recursive components*)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   784
    val (_, params) = strip_comb (hd cs);
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   785
    val paramTs = map (try' (snd o dest_Free) "Parameter in recursive\
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   786
      \ component is not a free variable: " sign) params;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   787
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   788
    val cTs = map (try' (HOLogic.dest_setT o fastype_of)
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   789
      "Recursive component not of type set: " sign) cs;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   790
6437
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   791
    val full_cnames = map (try' (fst o dest_Const o head_of)
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   792
      "Recursive set not previously declared as constant: " sign) cs;
6437
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   793
    val cnames = map Sign.base_name full_cnames;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   794
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   795
    val _ = seq (check_rule sign cs o snd o fst) intros;
8401
50d5f4402305 more robust case names of induct;
wenzelm
parents: 8380
diff changeset
   796
    val induct_cases = map (#1 o #1) intros;
6437
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   797
9405
3235873fdd90 improved error msg;
wenzelm
parents: 9315
diff changeset
   798
    val (thy1, result as {elims, induct, ...}) =
6437
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   799
      (if ! quick_and_dirty then add_ind_axm else add_ind_def)
6521
16c425fc00cb intrs attributes;
wenzelm
parents: 6437
diff changeset
   800
        verbose declare_consts alt_name coind no_elim no_ind cs atts intros monos
8401
50d5f4402305 more robust case names of induct;
wenzelm
parents: 8380
diff changeset
   801
        con_defs thy params paramTs cTs cnames induct_cases;
8307
6600c6e53111 add_cases_induct: induct_method setup;
wenzelm
parents: 8293
diff changeset
   802
    val thy2 = thy1
6600c6e53111 add_cases_induct: induct_method setup;
wenzelm
parents: 8293
diff changeset
   803
      |> put_inductives full_cnames ({names = full_cnames, coind = coind}, result)
9405
3235873fdd90 improved error msg;
wenzelm
parents: 9315
diff changeset
   804
      |> add_cases_induct no_elim (no_ind orelse coind) full_cnames elims induct induct_cases;
6437
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   805
  in (thy2, result) end;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   806
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   807
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   808
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   809
(** external interface **)
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   810
6521
16c425fc00cb intrs attributes;
wenzelm
parents: 6437
diff changeset
   811
fun add_inductive verbose coind c_strings srcs intro_srcs raw_monos raw_con_defs thy =
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   812
  let
6394
3d9fd50fcc43 Theory.sign_of;
wenzelm
parents: 6141
diff changeset
   813
    val sign = Theory.sign_of thy;
8100
6186ee807f2e replaced HOLogic.termTVar by HOLogic.termT;
wenzelm
parents: 7798
diff changeset
   814
    val cs = map (term_of o Thm.read_cterm sign o rpair HOLogic.termT) c_strings;
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   815
6521
16c425fc00cb intrs attributes;
wenzelm
parents: 6437
diff changeset
   816
    val atts = map (Attrib.global_attribute thy) srcs;
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   817
    val intr_names = map (fst o fst) intro_srcs;
9405
3235873fdd90 improved error msg;
wenzelm
parents: 9315
diff changeset
   818
    fun read_rule s = Thm.read_cterm sign (s, propT)
3235873fdd90 improved error msg;
wenzelm
parents: 9315
diff changeset
   819
      handle ERROR => error ("The error(s) above occurred for " ^ s);
3235873fdd90 improved error msg;
wenzelm
parents: 9315
diff changeset
   820
    val intr_ts = map (Thm.term_of o read_rule o snd o fst) intro_srcs;
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   821
    val intr_atts = map (map (Attrib.global_attribute thy) o snd) intro_srcs;
7020
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   822
    val (cs', intr_ts') = unify_consts sign cs intr_ts;
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   823
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   824
    val ((thy', con_defs), monos) = thy
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   825
      |> IsarThy.apply_theorems raw_monos
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   826
      |> apfst (IsarThy.apply_theorems raw_con_defs);
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   827
  in
7020
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   828
    add_inductive_i verbose false "" coind false false cs'
75ff179df7b7 Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents: 6851
diff changeset
   829
      atts ((intr_names ~~ intr_ts') ~~ intr_atts) monos con_defs thy'
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   830
  end;
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   831
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   832
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   833
6437
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   834
(** package setup **)
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   835
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   836
(* setup theory *)
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   837
8634
3f34637cb9c0 use Attrib.add_del_args;
wenzelm
parents: 8433
diff changeset
   838
val setup =
3f34637cb9c0 use Attrib.add_del_args;
wenzelm
parents: 8433
diff changeset
   839
 [InductiveData.init,
9625
77506775481e renamed 'mk_cases_tac' to 'ind_cases';
wenzelm
parents: 9598
diff changeset
   840
  Method.add_methods [("ind_cases", mk_cases_meth oo mk_cases_args,
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   841
    "dynamic case analysis on sets")],
9893
93d2fde0306c tuned msg;
wenzelm
parents: 9831
diff changeset
   842
  Attrib.add_attributes [("mono", mono_attr, "declaration of monotonicity rule")]];
6437
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   843
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   844
9bdfe07ba8e9 'HOL/inductive' theory data;
wenzelm
parents: 6430
diff changeset
   845
(* outer syntax *)
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   846
6723
f342449d73ca outer syntax keyword classification;
wenzelm
parents: 6556
diff changeset
   847
local structure P = OuterParse and K = OuterSyntax.Keyword in
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   848
6521
16c425fc00cb intrs attributes;
wenzelm
parents: 6437
diff changeset
   849
fun mk_ind coind (((sets, (atts, intrs)), monos), con_defs) =
6723
f342449d73ca outer syntax keyword classification;
wenzelm
parents: 6556
diff changeset
   850
  #1 o add_inductive true coind sets atts (map P.triple_swap intrs) monos con_defs;
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   851
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   852
fun ind_decl coind =
6729
b6e167580a32 formal comments (still dummy);
wenzelm
parents: 6723
diff changeset
   853
  (Scan.repeat1 P.term --| P.marg_comment) --
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   854
  (P.$$$ "intros" |--
7152
44d46a112127 tuned outer syntax;
wenzelm
parents: 7107
diff changeset
   855
    P.!!! (P.opt_attribs -- Scan.repeat1 (P.opt_thm_name ":" -- P.prop --| P.marg_comment))) --
6729
b6e167580a32 formal comments (still dummy);
wenzelm
parents: 6723
diff changeset
   856
  Scan.optional (P.$$$ "monos" |-- P.!!! P.xthms1 --| P.marg_comment) [] --
b6e167580a32 formal comments (still dummy);
wenzelm
parents: 6723
diff changeset
   857
  Scan.optional (P.$$$ "con_defs" |-- P.!!! P.xthms1 --| P.marg_comment) []
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   858
  >> (Toplevel.theory o mk_ind coind);
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   859
6723
f342449d73ca outer syntax keyword classification;
wenzelm
parents: 6556
diff changeset
   860
val inductiveP =
f342449d73ca outer syntax keyword classification;
wenzelm
parents: 6556
diff changeset
   861
  OuterSyntax.command "inductive" "define inductive sets" K.thy_decl (ind_decl false);
f342449d73ca outer syntax keyword classification;
wenzelm
parents: 6556
diff changeset
   862
f342449d73ca outer syntax keyword classification;
wenzelm
parents: 6556
diff changeset
   863
val coinductiveP =
f342449d73ca outer syntax keyword classification;
wenzelm
parents: 6556
diff changeset
   864
  OuterSyntax.command "coinductive" "define coinductive sets" K.thy_decl (ind_decl true);
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   865
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   866
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   867
val ind_cases =
9625
77506775481e renamed 'mk_cases_tac' to 'ind_cases';
wenzelm
parents: 9598
diff changeset
   868
  P.opt_thm_name ":" -- Scan.repeat1 P.prop -- P.marg_comment
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   869
  >> (Toplevel.theory o inductive_cases);
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   870
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   871
val inductive_casesP =
9804
ee0c337327cf "inductive_cases": proper command;
wenzelm
parents: 9643
diff changeset
   872
  OuterSyntax.command "inductive_cases"
9598
65ee72db0236 raplaced "intrs" by "intrs" (new-style only);
wenzelm
parents: 9562
diff changeset
   873
    "create simplified instances of elimination rules (improper)" K.thy_script ind_cases;
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   874
9643
c94db1a96f4e removed obsolete keyword;
wenzelm
parents: 9625
diff changeset
   875
val _ = OuterSyntax.add_keywords ["intros", "monos", "con_defs"];
7107
ce69de572bca inductive_cases(_i): Isar interface to mk_cases;
wenzelm
parents: 7020
diff changeset
   876
val _ = OuterSyntax.add_parsers [inductiveP, coinductiveP, inductive_casesP];
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   877
5094
ddcc3c114a0e New inductive definition package
berghofe
parents:
diff changeset
   878
end;
6424
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   879
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   880
ceab9e663e08 tuned comments;
wenzelm
parents: 6394
diff changeset
   881
end;