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