src/HOL/Tools/datatype_package/datatype_abs_proofs.ML
author haftmann
Fri, 19 Jun 2009 17:23:21 +0200
changeset 31723 f5cafe803b55
parent 31668 a616e56a5ec8
child 31737 b3f63611784e
permissions -rw-r--r--
discontinued ancient tradition to suffix certain ML module names with "_package"
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
     1
(*  Title:      HOL/Tools/datatype_abs_proofs.ML
11539
0f17da240450 tuned headers;
wenzelm
parents: 11435
diff changeset
     2
    Author:     Stefan Berghofer, TU Muenchen
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
     3
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
     4
Proofs and defintions independent of concrete representation
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
     5
of datatypes  (i.e. requiring only abstract properties such as
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
     6
injectivity / distinctness of constructors and induction)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
     7
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
     8
 - case distinction (exhaustion) theorems
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
     9
 - characteristic equations for primrec combinators
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    10
 - characteristic equations for case combinators
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    11
 - equations for splitting "P (case ...)" expressions
29264
4ea3358fac3f use regular Term.add_vars, Term.add_frees etc.;
wenzelm
parents: 28965
diff changeset
    12
 - "nchotomy" and "case_cong" theorems for TFL
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    13
*)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    14
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    15
signature DATATYPE_ABS_PROOFS =
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    16
sig
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    17
  type datatype_config = DatatypeAux.datatype_config
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    18
  type descr = DatatypeAux.descr
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    19
  type datatype_info = DatatypeAux.datatype_info
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    20
  val prove_casedist_thms : datatype_config -> string list ->
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    21
    descr list -> (string * sort) list -> thm ->
18728
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18377
diff changeset
    22
    attribute list -> theory -> thm list * theory
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    23
  val prove_primrec_thms : datatype_config -> string list ->
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    24
    descr list -> (string * sort) list ->
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    25
      datatype_info Symtab.table -> thm list list -> thm list list ->
18314
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
    26
        simpset -> thm -> theory -> (string list * thm list) * theory
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    27
  val prove_case_thms : datatype_config -> string list ->
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    28
    descr list -> (string * sort) list ->
18314
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
    29
      string list -> thm list -> theory -> (thm list list * string list) * theory
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    30
  val prove_split_thms : datatype_config -> string list ->
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    31
    descr list -> (string * sort) list ->
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    32
      thm list list -> thm list list -> thm list -> thm list list -> theory ->
18314
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
    33
        (thm * thm) list * theory
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    34
  val prove_nchotomys : datatype_config -> string list -> descr list ->
18314
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
    35
    (string * sort) list -> thm list -> theory -> thm list * theory
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    36
  val prove_weak_case_congs : string list -> descr list ->
18314
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
    37
    (string * sort) list -> theory -> thm list * theory
13641
63d1790a43ed Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents: 12910
diff changeset
    38
  val prove_case_congs : string list ->
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    39
    descr list -> (string * sort) list ->
18314
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
    40
      thm list -> thm list list -> theory -> thm list * theory
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    41
end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    42
8436
8a87fa482baf adapted to new PureThy.add_thms etc.;
wenzelm
parents: 8305
diff changeset
    43
structure DatatypeAbsProofs: DATATYPE_ABS_PROOFS =
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    44
struct
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    45
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    46
open DatatypeAux;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    47
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    48
(************************ case distinction theorems ***************************)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    49
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    50
fun prove_casedist_thms (config : datatype_config) new_type_names descr sorts induct case_names_exhausts thy =
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    51
  let
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    52
    val _ = message config "Proving case distinction theorems ...";
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    53
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
    54
    val descr' = List.concat descr;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    55
    val recTs = get_rec_types descr' sorts;
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
    56
    val newTs = Library.take (length (hd descr), recTs);
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    57
8477
17231d71171a - Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents: 8436
diff changeset
    58
    val {maxidx, ...} = rep_thm induct;
8305
93aa21ec5494 HOLogic.dest_conj;
wenzelm
parents: 7904
diff changeset
    59
    val induct_Ps = map head_of (HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of induct)));
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    60
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    61
    fun prove_casedist_thm ((i, t), T) =
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    62
      let
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    63
        val dummyPs = map (fn (Var (_, Type (_, [T', T'']))) =>
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    64
          Abs ("z", T', Const ("True", T''))) induct_Ps;
8477
17231d71171a - Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents: 8436
diff changeset
    65
        val P = Abs ("z", T, HOLogic.imp $ HOLogic.mk_eq (Var (("a", maxidx+1), T), Bound 0) $
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    66
          Var (("P", 0), HOLogic.boolT))
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
    67
        val insts = Library.take (i, dummyPs) @ (P::(Library.drop (i + 1, dummyPs)));
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
    68
        val cert = cterm_of thy;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    69
        val insts' = (map cert induct_Ps) ~~ (map cert insts);
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
    70
        val induct' = refl RS ((List.nth
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
    71
          (split_conj_thm (cterm_instantiate insts' induct), i)) RSN (2, rev_mp))
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    72
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
    73
      in
26531
96e82c7861fa - use SkipProof.prove_global instead of Goal.prove_global
berghofe
parents: 26475
diff changeset
    74
        SkipProof.prove_global thy [] (Logic.strip_imp_prems t) (Logic.strip_imp_concl t)
26711
3a478bfa1650 prove_global: pass context;
wenzelm
parents: 26531
diff changeset
    75
          (fn {prems, ...} => EVERY
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
    76
            [rtac induct' 1,
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
    77
             REPEAT (rtac TrueI 1),
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
    78
             REPEAT ((rtac impI 1) THEN (eresolve_tac prems 1)),
20046
9c8909fc5865 Goal.prove_global;
wenzelm
parents: 19233
diff changeset
    79
             REPEAT (rtac TrueI 1)])
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    80
      end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    81
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    82
    val casedist_thms = map prove_casedist_thm ((0 upto (length newTs - 1)) ~~
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    83
      (DatatypeProp.make_casedists descr sorts) ~~ newTs)
18314
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
    84
  in
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
    85
    thy
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
    86
    |> store_thms_atts "exhaust" new_type_names (map single case_names_exhausts) casedist_thms
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
    87
  end;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    88
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    89
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    90
(*************************** primrec combinators ******************************)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    91
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    92
fun prove_primrec_thms (config : datatype_config) new_type_names descr sorts
7015
85be09eb136c - Datatype package now also supports arbitrarily branching datatypes
berghofe
parents: 6522
diff changeset
    93
    (dt_info : datatype_info Symtab.table) constr_inject dist_rewrites dist_ss induct thy =
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    94
  let
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    95
    val _ = message config "Constructing primrec combinators ...";
5661
6ecb6ea25f19 - Changed structure of name spaces
berghofe
parents: 5578
diff changeset
    96
6ecb6ea25f19 - Changed structure of name spaces
berghofe
parents: 5578
diff changeset
    97
    val big_name = space_implode "_" new_type_names;
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    98
    val thy0 = add_path (#flat_names config) big_name thy;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    99
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
   100
    val descr' = List.concat descr;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   101
    val recTs = get_rec_types descr' sorts;
30190
479806475f3c use long names for old-style fold combinators;
wenzelm
parents: 29927
diff changeset
   102
    val used = List.foldr OldTerm.add_typ_tfree_names [] recTs;
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
   103
    val newTs = Library.take (length (hd descr), recTs);
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   104
8305
93aa21ec5494 HOLogic.dest_conj;
wenzelm
parents: 7904
diff changeset
   105
    val induct_Ps = map head_of (HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of induct)));
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   106
5661
6ecb6ea25f19 - Changed structure of name spaces
berghofe
parents: 5578
diff changeset
   107
    val big_rec_name' = big_name ^ "_rec_set";
21021
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   108
    val rec_set_names' =
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   109
      if length descr' = 1 then [big_rec_name'] else
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   110
        map ((curry (op ^) (big_rec_name' ^ "_")) o string_of_int)
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   111
          (1 upto (length descr'));
28965
1de908189869 cleaned up binding module and related code
haftmann
parents: 28839
diff changeset
   112
    val rec_set_names = map (Sign.full_bname thy0) rec_set_names';
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   113
15459
16dd63c78049 Introduced function DatatypeProp.make_primrec_Ts to avoid code duplication.
berghofe
parents: 14981
diff changeset
   114
    val (rec_result_Ts, reccomb_fn_Ts) = DatatypeProp.make_primrec_Ts descr sorts used;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   115
21021
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   116
    val rec_set_Ts = map (fn (T1, T2) =>
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   117
      reccomb_fn_Ts @ [T1, T2] ---> HOLogic.boolT) (recTs ~~ rec_result_Ts);
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   118
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   119
    val rec_fns = map (uncurry (mk_Free "f"))
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   120
      (reccomb_fn_Ts ~~ (1 upto (length reccomb_fn_Ts)));
21021
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   121
    val rec_sets' = map (fn c => list_comb (Free c, rec_fns))
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   122
      (rec_set_names' ~~ rec_set_Ts);
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   123
    val rec_sets = map (fn c => list_comb (Const c, rec_fns))
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   124
      (rec_set_names ~~ rec_set_Ts);
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   125
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   126
    (* introduction rules for graph of primrec function *)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   127
21021
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   128
    fun make_rec_intr T rec_set ((rec_intr_ts, l), (cname, cargs)) =
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   129
      let
7015
85be09eb136c - Datatype package now also supports arbitrarily branching datatypes
berghofe
parents: 6522
diff changeset
   130
        fun mk_prem ((dt, U), (j, k, prems, t1s, t2s)) =
85be09eb136c - Datatype package now also supports arbitrarily branching datatypes
berghofe
parents: 6522
diff changeset
   131
          let val free1 = mk_Free "x" U j
13641
63d1790a43ed Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents: 12910
diff changeset
   132
          in (case (strip_dtyp dt, strip_type U) of
63d1790a43ed Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents: 12910
diff changeset
   133
             ((_, DtRec m), (Us, _)) =>
63d1790a43ed Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents: 12910
diff changeset
   134
               let
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
   135
                 val free2 = mk_Free "y" (Us ---> List.nth (rec_result_Ts, m)) k;
13641
63d1790a43ed Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents: 12910
diff changeset
   136
                 val i = length Us
63d1790a43ed Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents: 12910
diff changeset
   137
               in (j + 1, k + 1, HOLogic.mk_Trueprop (HOLogic.list_all
21021
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   138
                     (map (pair "x") Us, List.nth (rec_sets', m) $
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   139
                       app_bnds free1 i $ app_bnds free2 i)) :: prems,
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   140
                   free1::t1s, free2::t2s)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   141
               end
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   142
           | _ => (j + 1, k, prems, free1::t1s, t2s))
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   143
          end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   144
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   145
        val Ts = map (typ_of_dtyp descr' sorts) cargs;
30190
479806475f3c use long names for old-style fold combinators;
wenzelm
parents: 29927
diff changeset
   146
        val (_, _, prems, t1s, t2s) = List.foldr mk_prem (1, 1, [], [], []) (cargs ~~ Ts)
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   147
21021
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   148
      in (rec_intr_ts @ [Logic.list_implies (prems, HOLogic.mk_Trueprop
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   149
        (rec_set $ list_comb (Const (cname, Ts ---> T), t1s) $
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   150
          list_comb (List.nth (rec_fns, l), t1s @ t2s)))], l + 1)
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   151
      end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   152
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
   153
    val (rec_intr_ts, _) = Library.foldl (fn (x, ((d, T), set_name)) =>
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
   154
      Library.foldl (make_rec_intr T set_name) (x, #3 (snd d)))
21021
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   155
        (([], 0), descr' ~~ recTs ~~ rec_sets');
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   156
21365
4ee8e2702241 InductivePackage.add_inductive_i: canonical argument order;
wenzelm
parents: 21291
diff changeset
   157
    val ({intrs = rec_intrs, elims = rec_elims, ...}, thy1) =
31723
f5cafe803b55 discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents: 31668
diff changeset
   158
        Inductive.add_inductive_global (serial_string ())
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
   159
          {quiet_mode = #quiet config, verbose = false, kind = Thm.internalK,
28965
1de908189869 cleaned up binding module and related code
haftmann
parents: 28839
diff changeset
   160
            alt_name = Binding.name big_rec_name', coind = false, no_elim = false, no_ind = true,
29389
0a49f940d729 inductive: added fork_mono flag;
wenzelm
parents: 29270
diff changeset
   161
            skip_mono = true, fork_mono = false}
28965
1de908189869 cleaned up binding module and related code
haftmann
parents: 28839
diff changeset
   162
          (map (fn (s, T) => ((Binding.name s, T), NoSyn)) (rec_set_names' ~~ rec_set_Ts))
26128
fe2d24c26e0c inductive package: simplified group handling;
wenzelm
parents: 25977
diff changeset
   163
          (map dest_Free rec_fns)
28965
1de908189869 cleaned up binding module and related code
haftmann
parents: 28839
diff changeset
   164
          (map (fn x => (Attrib.empty_binding, x)) rec_intr_ts) [] thy0;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   165
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   166
    (* prove uniqueness and termination of primrec combinators *)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   167
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
   168
    val _ = message config "Proving termination and uniqueness of primrec functions ...";
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   169
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   170
    fun mk_unique_tac ((tac, intrs), ((((i, (tname, _, constrs)), elim), T), T')) =
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   171
      let
21021
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   172
        val distinct_tac =
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   173
          (if i < length newTs then
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
   174
             full_simp_tac (HOL_ss addsimps (List.nth (dist_rewrites, i))) 1
7015
85be09eb136c - Datatype package now also supports arbitrarily branching datatypes
berghofe
parents: 6522
diff changeset
   175
           else full_simp_tac dist_ss 1);
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   176
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   177
        val inject = map (fn r => r RS iffD1)
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
   178
          (if i < length newTs then List.nth (constr_inject, i)
17412
e26cb20ef0cc TableFun/Symtab: curried lookup and update;
wenzelm
parents: 17261
diff changeset
   179
            else #inject (the (Symtab.lookup dt_info tname)));
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   180
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   181
        fun mk_unique_constr_tac n ((tac, intr::intrs, j), (cname, cargs)) =
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   182
          let
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
   183
            val k = length (List.filter is_rec_type cargs)
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   184
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   185
          in (EVERY [DETERM tac,
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   186
                REPEAT (etac ex1E 1), rtac ex1I 1,
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   187
                DEPTH_SOLVE_1 (ares_tac [intr] 1),
13641
63d1790a43ed Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents: 12910
diff changeset
   188
                REPEAT_DETERM_N k (etac thin_rl 1 THEN rotate_tac 1 1),
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   189
                etac elim 1,
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   190
                REPEAT_DETERM_N j distinct_tac,
21021
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   191
                TRY (dresolve_tac inject 1),
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   192
                REPEAT (etac conjE 1), hyp_subst_tac 1,
13641
63d1790a43ed Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents: 12910
diff changeset
   193
                REPEAT (EVERY [etac allE 1, dtac mp 1, atac 1]),
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   194
                TRY (hyp_subst_tac 1),
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   195
                rtac refl 1,
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   196
                REPEAT_DETERM_N (n - j - 1) distinct_tac],
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   197
              intrs, j + 1)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   198
          end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   199
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
   200
        val (tac', intrs', _) = Library.foldl (mk_unique_constr_tac (length constrs))
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   201
          ((tac, intrs, 0), constrs);
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   202
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   203
      in (tac', intrs') end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   204
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   205
    val rec_unique_thms =
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   206
      let
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   207
        val rec_unique_ts = map (fn (((set_t, T1), T2), i) =>
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   208
          Const ("Ex1", (T2 --> HOLogic.boolT) --> HOLogic.boolT) $
21021
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   209
            absfree ("y", T2, set_t $ mk_Free "x" T1 i $ Free ("y", T2)))
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   210
              (rec_sets ~~ recTs ~~ rec_result_Ts ~~ (1 upto length recTs));
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   211
        val cert = cterm_of thy1
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   212
        val insts = map (fn ((i, T), t) => absfree ("x" ^ (string_of_int i), T, t))
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   213
          ((1 upto length recTs) ~~ recTs ~~ rec_unique_ts);
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   214
        val induct' = cterm_instantiate ((map cert induct_Ps) ~~
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   215
          (map cert insts)) induct;
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
   216
        val (tac, _) = Library.foldl mk_unique_tac
23590
ad95084a5c63 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 22994
diff changeset
   217
          (((rtac induct' THEN_ALL_NEW ObjectLogic.atomize_prems_tac) 1
28839
32d498cf7595 eliminated rewrite_tac/fold_tac, which are not well-formed tactics due to change of main conclusion;
wenzelm
parents: 28524
diff changeset
   218
              THEN rewrite_goals_tac [mk_meta_eq choice_eq], rec_intrs),
10911
eb5721204b38 proper induction rule for arbitrarily branching datatype;
wenzelm
parents: 10214
diff changeset
   219
            descr' ~~ rec_elims ~~ recTs ~~ rec_result_Ts);
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   220
26531
96e82c7861fa - use SkipProof.prove_global instead of Goal.prove_global
berghofe
parents: 26475
diff changeset
   221
      in split_conj_thm (SkipProof.prove_global thy1 [] []
20046
9c8909fc5865 Goal.prove_global;
wenzelm
parents: 19233
diff changeset
   222
        (HOLogic.mk_Trueprop (mk_conj rec_unique_ts)) (K tac))
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   223
      end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   224
11435
bd1a7f53c11b replaced "Eps" by "The";
wenzelm
parents: 10911
diff changeset
   225
    val rec_total_thms = map (fn r => r RS theI') rec_unique_thms;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   226
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   227
    (* define primrec combinators *)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   228
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   229
    val big_reccomb_name = (space_implode "_" new_type_names) ^ "_rec";
28965
1de908189869 cleaned up binding module and related code
haftmann
parents: 28839
diff changeset
   230
    val reccomb_names = map (Sign.full_bname thy1)
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   231
      (if length descr' = 1 then [big_reccomb_name] else
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   232
        (map ((curry (op ^) (big_reccomb_name ^ "_")) o string_of_int)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   233
          (1 upto (length descr'))));
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   234
    val reccombs = map (fn ((name, T), T') => list_comb
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   235
      (Const (name, reccomb_fn_Ts @ [T] ---> T'), rec_fns))
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   236
        (reccomb_names ~~ recTs ~~ rec_result_Ts);
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   237
18358
0a733e11021a re-oriented some result tuples in PureThy
haftmann
parents: 18314
diff changeset
   238
    val (reccomb_defs, thy2) =
0a733e11021a re-oriented some result tuples in PureThy
haftmann
parents: 18314
diff changeset
   239
      thy1
24712
64ed05609568 proper Sign operations instead of Theory aliases;
wenzelm
parents: 24699
diff changeset
   240
      |> Sign.add_consts_i (map (fn ((name, T), T') =>
30364
577edc39b501 moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents: 30345
diff changeset
   241
          (Binding.name (Long_Name.base_name name), reccomb_fn_Ts @ [T] ---> T', NoSyn))
18358
0a733e11021a re-oriented some result tuples in PureThy
haftmann
parents: 18314
diff changeset
   242
          (reccomb_names ~~ recTs ~~ rec_result_Ts))
27691
ce171cbd4b93 PureThy: dropped note_thmss_qualified, dropped _i suffix
haftmann
parents: 26711
diff changeset
   243
      |> (PureThy.add_defs false o map Thm.no_attributes) (map (fn ((((name, comb), set), T), T') =>
30364
577edc39b501 moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents: 30345
diff changeset
   244
          (Binding.name (Long_Name.base_name name ^ "_def"), Logic.mk_equals (comb, absfree ("x", T,
11435
bd1a7f53c11b replaced "Eps" by "The";
wenzelm
parents: 10911
diff changeset
   245
           Const ("The", (T' --> HOLogic.boolT) --> T') $ absfree ("y", T',
21021
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   246
             set $ Free ("x", T) $ Free ("y", T'))))))
18358
0a733e11021a re-oriented some result tuples in PureThy
haftmann
parents: 18314
diff changeset
   247
               (reccomb_names ~~ reccombs ~~ rec_sets ~~ recTs ~~ rec_result_Ts))
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
   248
      ||> parent_path (#flat_names config) 
28361
232fcbba2e4e explicit checkpoint for low-level (global) theory operations, admits concurrent proofs;
wenzelm
parents: 28110
diff changeset
   249
      ||> Theory.checkpoint;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   250
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   251
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   252
    (* prove characteristic equations for primrec combinators *)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   253
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
   254
    val _ = message config "Proving characteristic theorems for primrec combinators ..."
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   255
26531
96e82c7861fa - use SkipProof.prove_global instead of Goal.prove_global
berghofe
parents: 26475
diff changeset
   256
    val rec_thms = map (fn t => SkipProof.prove_global thy2 [] [] t
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   257
      (fn _ => EVERY
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   258
        [rewrite_goals_tac reccomb_defs,
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   259
         rtac the1_equality 1,
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   260
         resolve_tac rec_unique_thms 1,
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   261
         resolve_tac rec_intrs 1,
20046
9c8909fc5865 Goal.prove_global;
wenzelm
parents: 19233
diff changeset
   262
         REPEAT (rtac allI 1 ORELSE resolve_tac rec_total_thms 1)]))
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   263
           (DatatypeProp.make_primrecs new_type_names descr sorts thy2)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   264
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   265
  in
18314
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
   266
    thy2
24712
64ed05609568 proper Sign operations instead of Theory aliases;
wenzelm
parents: 24699
diff changeset
   267
    |> Sign.add_path (space_implode "_" new_type_names)
29927
ae8f42c245b2 Added nitpick attribute, and fixed typo.
blanchet
parents: 29866
diff changeset
   268
    |> PureThy.add_thmss [((Binding.name "recs", rec_thms),
ae8f42c245b2 Added nitpick attribute, and fixed typo.
blanchet
parents: 29866
diff changeset
   269
         [Nitpick_Const_Simp_Thms.add])]
24712
64ed05609568 proper Sign operations instead of Theory aliases;
wenzelm
parents: 24699
diff changeset
   270
    ||> Sign.parent_path
28361
232fcbba2e4e explicit checkpoint for low-level (global) theory operations, admits concurrent proofs;
wenzelm
parents: 28110
diff changeset
   271
    ||> Theory.checkpoint
18314
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
   272
    |-> (fn thms => pair (reccomb_names, Library.flat thms))
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   273
  end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   274
8477
17231d71171a - Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents: 8436
diff changeset
   275
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   276
(***************************** case combinators *******************************)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   277
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
   278
fun prove_case_thms (config : datatype_config) new_type_names descr sorts reccomb_names primrec_thms thy =
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   279
  let
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
   280
    val _ = message config "Proving characteristic theorems for case combinators ...";
5661
6ecb6ea25f19 - Changed structure of name spaces
berghofe
parents: 5578
diff changeset
   281
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
   282
    val thy1 = add_path (#flat_names config) (space_implode "_" new_type_names) thy;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   283
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
   284
    val descr' = List.concat descr;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   285
    val recTs = get_rec_types descr' sorts;
30190
479806475f3c use long names for old-style fold combinators;
wenzelm
parents: 29927
diff changeset
   286
    val used = List.foldr OldTerm.add_typ_tfree_names [] recTs;
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
   287
    val newTs = Library.take (length (hd descr), recTs);
20071
8f3e1ddb50e6 replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents: 20046
diff changeset
   288
    val T' = TFree (Name.variant used "'t", HOLogic.typeS);
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   289
13641
63d1790a43ed Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents: 12910
diff changeset
   290
    fun mk_dummyT dt = binder_types (typ_of_dtyp descr' sorts dt) ---> T';
7015
85be09eb136c - Datatype package now also supports arbitrarily branching datatypes
berghofe
parents: 6522
diff changeset
   291
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   292
    val case_dummy_fns = map (fn (_, (_, _, constrs)) => map (fn (_, cargs) =>
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   293
      let
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   294
        val Ts = map (typ_of_dtyp descr' sorts) cargs;
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
   295
        val Ts' = map mk_dummyT (List.filter is_rec_type cargs)
28524
644b62cf678f arbitrary is undefined
haftmann
parents: 28361
diff changeset
   296
      in Const (@{const_name undefined}, Ts @ Ts' ---> T')
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   297
      end) constrs) descr';
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   298
28965
1de908189869 cleaned up binding module and related code
haftmann
parents: 28839
diff changeset
   299
    val case_names = map (fn s => Sign.full_bname thy1 (s ^ "_case")) new_type_names;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   300
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   301
    (* define case combinators via primrec combinators *)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   302
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
   303
    val (case_defs, thy2) = Library.foldl (fn ((defs, thy),
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   304
      ((((i, (_, _, constrs)), T), name), recname)) =>
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   305
        let
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   306
          val (fns1, fns2) = ListPair.unzip (map (fn ((_, cargs), j) =>
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   307
            let
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   308
              val Ts = map (typ_of_dtyp descr' sorts) cargs;
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
   309
              val Ts' = Ts @ map mk_dummyT (List.filter is_rec_type cargs);
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   310
              val frees' = map (uncurry (mk_Free "x")) (Ts' ~~ (1 upto length Ts'));
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
   311
              val frees = Library.take (length cargs, frees');
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   312
              val free = mk_Free "f" (Ts ---> T') j
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   313
            in
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   314
             (free, list_abs_free (map dest_Free frees',
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   315
               list_comb (free, frees)))
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   316
            end) (constrs ~~ (1 upto length constrs)));
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   317
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   318
          val caseT = (map (snd o dest_Free) fns1) @ [T] ---> T';
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
   319
          val fns = (List.concat (Library.take (i, case_dummy_fns))) @
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
   320
            fns2 @ (List.concat (Library.drop (i + 1, case_dummy_fns)));
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   321
          val reccomb = Const (recname, (map fastype_of fns) @ [T] ---> T');
30364
577edc39b501 moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents: 30345
diff changeset
   322
          val decl = ((Binding.name (Long_Name.base_name name), caseT), NoSyn);
577edc39b501 moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents: 30345
diff changeset
   323
          val def = (Binding.name (Long_Name.base_name name ^ "_def"),
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   324
            Logic.mk_equals (list_comb (Const (name, caseT), fns1),
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
   325
              list_comb (reccomb, (List.concat (Library.take (i, case_dummy_fns))) @
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
   326
                fns2 @ (List.concat (Library.drop (i + 1, case_dummy_fns))) )));
18358
0a733e11021a re-oriented some result tuples in PureThy
haftmann
parents: 18314
diff changeset
   327
          val ([def_thm], thy') =
0a733e11021a re-oriented some result tuples in PureThy
haftmann
parents: 18314
diff changeset
   328
            thy
24959
119793c84647 replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents: 24814
diff changeset
   329
            |> Sign.declare_const [] decl |> snd
27691
ce171cbd4b93 PureThy: dropped note_thmss_qualified, dropped _i suffix
haftmann
parents: 26711
diff changeset
   330
            |> (PureThy.add_defs false o map Thm.no_attributes) [def];
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   331
8436
8a87fa482baf adapted to new PureThy.add_thms etc.;
wenzelm
parents: 8305
diff changeset
   332
        in (defs @ [def_thm], thy')
5661
6ecb6ea25f19 - Changed structure of name spaces
berghofe
parents: 5578
diff changeset
   333
        end) (([], thy1), (hd descr) ~~ newTs ~~ case_names ~~
28361
232fcbba2e4e explicit checkpoint for low-level (global) theory operations, admits concurrent proofs;
wenzelm
parents: 28110
diff changeset
   334
          (Library.take (length newTs, reccomb_names)))
232fcbba2e4e explicit checkpoint for low-level (global) theory operations, admits concurrent proofs;
wenzelm
parents: 28110
diff changeset
   335
      ||> Theory.checkpoint;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   336
26531
96e82c7861fa - use SkipProof.prove_global instead of Goal.prove_global
berghofe
parents: 26475
diff changeset
   337
    val case_thms = map (map (fn t => SkipProof.prove_global thy2 [] [] t
20046
9c8909fc5865 Goal.prove_global;
wenzelm
parents: 19233
diff changeset
   338
      (fn _ => EVERY [rewrite_goals_tac (case_defs @ map mk_meta_eq primrec_thms), rtac refl 1])))
8477
17231d71171a - Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents: 8436
diff changeset
   339
          (DatatypeProp.make_cases new_type_names descr sorts thy2)
17231d71171a - Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents: 8436
diff changeset
   340
  in
18314
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
   341
    thy2
29866
6e93ae65c678 Added Nitpick_Const_Psimp attribute, dropped the 's' in Nitpick_Const_Simps, and killed the Nitpick_Ind_Intros attribute.
blanchet
parents: 29579
diff changeset
   342
    |> Context.the_theory o fold (fold Nitpick_Const_Simp_Thms.add_thm) case_thms
6e93ae65c678 Added Nitpick_Const_Psimp attribute, dropped the 's' in Nitpick_Const_Simps, and killed the Nitpick_Ind_Intros attribute.
blanchet
parents: 29579
diff changeset
   343
       o Context.Theory
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
   344
    |> parent_path (#flat_names config)
18314
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
   345
    |> store_thmss "cases" new_type_names case_thms
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
   346
    |-> (fn thmss => pair (thmss, case_names))
8477
17231d71171a - Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents: 8436
diff changeset
   347
  end;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   348
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   349
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   350
(******************************* case splitting *******************************)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   351
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
   352
fun prove_split_thms (config : datatype_config) new_type_names descr sorts constr_inject dist_rewrites
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   353
    casedist_thms case_thms thy =
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   354
  let
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
   355
    val _ = message config "Proving equations for case splitting ...";
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   356
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
   357
    val descr' = flat descr;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   358
    val recTs = get_rec_types descr' sorts;
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15459
diff changeset
   359
    val newTs = Library.take (length (hd descr), recTs);
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   360
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   361
    fun prove_split_thms ((((((t1, t2), inject), dist_rewrites'),
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   362
        exhaustion), case_thms'), T) =
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   363
      let
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   364
        val cert = cterm_of thy;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   365
        val _ $ (_ $ lhs $ _) = hd (Logic.strip_assums_hyp (hd (prems_of exhaustion)));
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   366
        val exhaustion' = cterm_instantiate
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   367
          [(cert lhs, cert (Free ("x", T)))] exhaustion;
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   368
        val tacf = K (EVERY [rtac exhaustion' 1, ALLGOALS (asm_simp_tac
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   369
          (HOL_ss addsimps (dist_rewrites' @ inject @ case_thms')))])
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   370
      in
26531
96e82c7861fa - use SkipProof.prove_global instead of Goal.prove_global
berghofe
parents: 26475
diff changeset
   371
        (SkipProof.prove_global thy [] [] t1 tacf,
96e82c7861fa - use SkipProof.prove_global instead of Goal.prove_global
berghofe
parents: 26475
diff changeset
   372
         SkipProof.prove_global thy [] [] t2 tacf)
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   373
      end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   374
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   375
    val split_thm_pairs = map prove_split_thms
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   376
      ((DatatypeProp.make_splits new_type_names descr sorts thy) ~~ constr_inject ~~
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   377
        dist_rewrites ~~ casedist_thms ~~ case_thms ~~ newTs);
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   378
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   379
    val (split_thms, split_asm_thms) = ListPair.unzip split_thm_pairs
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   380
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   381
  in
18314
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
   382
    thy
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
   383
    |> store_thms "split" new_type_names split_thms
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
   384
    ||>> store_thms "split_asm" new_type_names split_asm_thms
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
   385
    |-> (fn (thms1, thms2) => pair (thms1 ~~ thms2))
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   386
  end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   387
8601
8fb3a81b4ccf added weak_case_cong feature
nipkow
parents: 8477
diff changeset
   388
fun prove_weak_case_congs new_type_names descr sorts thy =
8fb3a81b4ccf added weak_case_cong feature
nipkow
parents: 8477
diff changeset
   389
  let
8fb3a81b4ccf added weak_case_cong feature
nipkow
parents: 8477
diff changeset
   390
    fun prove_weak_case_cong t =
26531
96e82c7861fa - use SkipProof.prove_global instead of Goal.prove_global
berghofe
parents: 26475
diff changeset
   391
       SkipProof.prove_global thy [] (Logic.strip_imp_prems t) (Logic.strip_imp_concl t)
26711
3a478bfa1650 prove_global: pass context;
wenzelm
parents: 26531
diff changeset
   392
         (fn {prems, ...} => EVERY [rtac ((hd prems) RS arg_cong) 1])
8601
8fb3a81b4ccf added weak_case_cong feature
nipkow
parents: 8477
diff changeset
   393
8fb3a81b4ccf added weak_case_cong feature
nipkow
parents: 8477
diff changeset
   394
    val weak_case_congs = map prove_weak_case_cong (DatatypeProp.make_weak_case_congs
8fb3a81b4ccf added weak_case_cong feature
nipkow
parents: 8477
diff changeset
   395
      new_type_names descr sorts thy)
8fb3a81b4ccf added weak_case_cong feature
nipkow
parents: 8477
diff changeset
   396
8fb3a81b4ccf added weak_case_cong feature
nipkow
parents: 8477
diff changeset
   397
  in thy |> store_thms "weak_case_cong" new_type_names weak_case_congs end;
8477
17231d71171a - Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents: 8436
diff changeset
   398
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   399
(************************* additional theorems for TFL ************************)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   400
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
   401
fun prove_nchotomys (config : datatype_config) new_type_names descr sorts casedist_thms thy =
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   402
  let
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
   403
    val _ = message config "Proving additional theorems for TFL ...";
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   404
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   405
    fun prove_nchotomy (t, exhaustion) =
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   406
      let
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   407
        (* For goal i, select the correct disjunct to attack, then prove it *)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   408
        fun tac i 0 = EVERY [TRY (rtac disjI1 i),
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   409
              hyp_subst_tac i, REPEAT (rtac exI i), rtac refl i]
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   410
          | tac i n = rtac disjI2 i THEN tac i (n - 1)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   411
      in 
26531
96e82c7861fa - use SkipProof.prove_global instead of Goal.prove_global
berghofe
parents: 26475
diff changeset
   412
        SkipProof.prove_global thy [] [] t (fn _ =>
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   413
          EVERY [rtac allI 1,
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   414
           exh_tac (K exhaustion) 1,
20046
9c8909fc5865 Goal.prove_global;
wenzelm
parents: 19233
diff changeset
   415
           ALLGOALS (fn i => tac i (i-1))])
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   416
      end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   417
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   418
    val nchotomys =
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   419
      map prove_nchotomy (DatatypeProp.make_nchotomys descr sorts ~~ casedist_thms)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   420
8436
8a87fa482baf adapted to new PureThy.add_thms etc.;
wenzelm
parents: 8305
diff changeset
   421
  in thy |> store_thms "nchotomy" new_type_names nchotomys end;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   422
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   423
fun prove_case_congs new_type_names descr sorts nchotomys case_thms thy =
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   424
  let
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   425
    fun prove_case_cong ((t, nchotomy), case_rewrites) =
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   426
      let
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   427
        val (Const ("==>", _) $ tm $ _) = t;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   428
        val (Const ("Trueprop", _) $ (Const ("op =", _) $ _ $ Ma)) = tm;
22578
b0eb5652f210 removed obsolete sign_of/sign_of_thm;
wenzelm
parents: 21621
diff changeset
   429
        val cert = cterm_of thy;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   430
        val nchotomy' = nchotomy RS spec;
29264
4ea3358fac3f use regular Term.add_vars, Term.add_frees etc.;
wenzelm
parents: 28965
diff changeset
   431
        val [v] = Term.add_vars (concl_of nchotomy') [];
4ea3358fac3f use regular Term.add_vars, Term.add_frees etc.;
wenzelm
parents: 28965
diff changeset
   432
        val nchotomy'' = cterm_instantiate [(cert (Var v), cert Ma)] nchotomy'
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   433
      in
26531
96e82c7861fa - use SkipProof.prove_global instead of Goal.prove_global
berghofe
parents: 26475
diff changeset
   434
        SkipProof.prove_global thy [] (Logic.strip_imp_prems t) (Logic.strip_imp_concl t)
26711
3a478bfa1650 prove_global: pass context;
wenzelm
parents: 26531
diff changeset
   435
          (fn {prems, ...} => 
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   436
            let val simplify = asm_simp_tac (HOL_ss addsimps (prems @ case_rewrites))
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   437
            in EVERY [simp_tac (HOL_ss addsimps [hd prems]) 1,
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   438
                cut_facts_tac [nchotomy''] 1,
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   439
                REPEAT (etac disjE 1 THEN REPEAT (etac exE 1) THEN simplify 1),
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   440
                REPEAT (etac exE 1) THEN simplify 1 (* Get last disjunct *)]
20046
9c8909fc5865 Goal.prove_global;
wenzelm
parents: 19233
diff changeset
   441
            end)
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   442
      end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   443
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   444
    val case_congs = map prove_case_cong (DatatypeProp.make_case_congs
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   445
      new_type_names descr sorts thy ~~ nchotomys ~~ case_thms)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   446
8436
8a87fa482baf adapted to new PureThy.add_thms etc.;
wenzelm
parents: 8305
diff changeset
   447
  in thy |> store_thms "case_cong" new_type_names case_congs end;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   448
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   449
end;