src/HOL/Tools/Datatype/datatype_abs_proofs.ML
author wenzelm
Wed, 17 Aug 2011 18:05:31 +0200
changeset 44241 7943b69f0188
parent 44121 44adaa6db327
child 45700 9dcbf6a1829c
permissions -rw-r--r--
modernized signature of Term.absfree/absdummy; eliminated obsolete Term.list_abs_free;
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
33968
f94fb13ecbb3 modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents: 33957
diff changeset
     1
(*  Title:      HOL/Tools/Datatype/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
33968
f94fb13ecbb3 modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents: 33957
diff changeset
     4
Datatype package: proofs and defintions independent of concrete
f94fb13ecbb3 modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents: 33957
diff changeset
     5
representation of datatypes  (i.e. requiring only abstract
f94fb13ecbb3 modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents: 33957
diff changeset
     6
properties: injectivity / distinctness of constructors and induction).
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
     7
*)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
     8
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
     9
signature DATATYPE_ABS_PROOFS =
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    10
sig
31737
b3f63611784e simplified names of common datatype types
haftmann
parents: 31723
diff changeset
    11
  include DATATYPE_COMMON
b3f63611784e simplified names of common datatype types
haftmann
parents: 31723
diff changeset
    12
  val prove_casedist_thms : config -> string list ->
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    13
    descr list -> (string * sort) list -> thm ->
18728
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18377
diff changeset
    14
    attribute list -> theory -> thm list * theory
31737
b3f63611784e simplified names of common datatype types
haftmann
parents: 31723
diff changeset
    15
  val prove_primrec_thms : config -> string list ->
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    16
    descr list -> (string * sort) list ->
32915
a7a97960054b more appropriate abstraction over distinctness rules
haftmann
parents: 32906
diff changeset
    17
      (string -> thm list) -> thm list list -> thm list list * thm list list ->
a7a97960054b more appropriate abstraction over distinctness rules
haftmann
parents: 32906
diff changeset
    18
        thm -> theory -> (string list * thm list) * theory
31737
b3f63611784e simplified names of common datatype types
haftmann
parents: 31723
diff changeset
    19
  val prove_case_thms : config -> string list ->
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    20
    descr list -> (string * sort) list ->
18314
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
    21
      string list -> thm list -> theory -> (thm list list * string list) * theory
31737
b3f63611784e simplified names of common datatype types
haftmann
parents: 31723
diff changeset
    22
  val prove_split_thms : config -> string list ->
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    23
    descr list -> (string * sort) list ->
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    24
      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
    25
        (thm * thm) list * theory
31737
b3f63611784e simplified names of common datatype types
haftmann
parents: 31723
diff changeset
    26
  val prove_nchotomys : config -> string list -> descr list ->
18314
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
    27
    (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
    28
  val prove_weak_case_congs : string list -> descr list ->
18314
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
    29
    (string * sort) list -> theory -> thm list * theory
13641
63d1790a43ed Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents: 12910
diff changeset
    30
  val prove_case_congs : string list ->
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
    31
    descr list -> (string * sort) list ->
18314
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
    32
      thm list -> thm list list -> theory -> thm list * theory
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    33
end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    34
33968
f94fb13ecbb3 modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents: 33957
diff changeset
    35
structure Datatype_Abs_Proofs: DATATYPE_ABS_PROOFS =
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    36
struct
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    37
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    38
(************************ case distinction theorems ***************************)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    39
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
    40
fun prove_casedist_thms (config : Datatype_Aux.config)
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
    41
    new_type_names descr sorts induct case_names_exhausts thy =
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    42
  let
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
    43
    val _ = Datatype_Aux.message config "Proving case distinction theorems ...";
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    44
32952
aeb1e44fbc19 replaced String.concat by implode;
wenzelm
parents: 32915
diff changeset
    45
    val descr' = flat descr;
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
    46
    val recTs = Datatype_Aux.get_rec_types descr' sorts;
33957
e9afca2118d4 normalized uncurry take/drop
haftmann
parents: 33955
diff changeset
    47
    val newTs = take (length (hd descr)) recTs;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    48
44058
ae85c5d64913 misc tuning -- eliminated old-fashioned rep_thm;
wenzelm
parents: 43324
diff changeset
    49
    val maxidx = Thm.maxidx_of induct;
8305
93aa21ec5494 HOLogic.dest_conj;
wenzelm
parents: 7904
diff changeset
    50
    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
    51
33063
4d462963a7db map_range (and map_index) combinator
haftmann
parents: 33056
diff changeset
    52
    fun prove_casedist_thm (i, (T, t)) =
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    53
      let
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    54
        val dummyPs = map (fn (Var (_, Type (_, [T', T'']))) =>
35364
b8c62d60195c more antiquotations;
wenzelm
parents: 33968
diff changeset
    55
          Abs ("z", T', Const (@{const_name True}, T''))) induct_Ps;
8477
17231d71171a - Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents: 8436
diff changeset
    56
        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
    57
          Var (("P", 0), HOLogic.boolT))
33957
e9afca2118d4 normalized uncurry take/drop
haftmann
parents: 33955
diff changeset
    58
        val insts = take i dummyPs @ (P::(drop (i + 1) dummyPs));
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
    59
        val cert = cterm_of thy;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    60
        val insts' = (map cert induct_Ps) ~~ (map cert insts);
32905
5e46c6704cee nth replaces List.nth
haftmann
parents: 32729
diff changeset
    61
        val induct' = refl RS ((nth
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
    62
          (Datatype_Aux.split_conj_thm (cterm_instantiate insts' induct)) i) RSN (2, rev_mp))
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    63
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
    64
      in
32970
fbd2bb2489a8 operations of structure Skip_Proof (formerly SkipProof) no longer require quick_and_dirty mode;
wenzelm
parents: 32952
diff changeset
    65
        Skip_Proof.prove_global thy [] (Logic.strip_imp_prems t) (Logic.strip_imp_concl t)
26711
3a478bfa1650 prove_global: pass context;
wenzelm
parents: 26531
diff changeset
    66
          (fn {prems, ...} => EVERY
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
    67
            [rtac induct' 1,
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
    68
             REPEAT (rtac TrueI 1),
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
    69
             REPEAT ((rtac impI 1) THEN (eresolve_tac prems 1)),
20046
9c8909fc5865 Goal.prove_global;
wenzelm
parents: 19233
diff changeset
    70
             REPEAT (rtac TrueI 1)])
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    71
      end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    72
33063
4d462963a7db map_range (and map_index) combinator
haftmann
parents: 33056
diff changeset
    73
    val casedist_thms = map_index prove_casedist_thm
33968
f94fb13ecbb3 modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents: 33957
diff changeset
    74
      (newTs ~~ Datatype_Prop.make_casedists descr sorts)
18314
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
    75
  in
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
    76
    thy
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
    77
    |> Datatype_Aux.store_thms_atts "exhaust" new_type_names
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
    78
      (map single case_names_exhausts) casedist_thms
18314
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
    79
  end;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    80
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    81
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    82
(*************************** primrec combinators ******************************)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    83
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
    84
fun prove_primrec_thms (config : Datatype_Aux.config) new_type_names descr sorts
32915
a7a97960054b more appropriate abstraction over distinctness rules
haftmann
parents: 32906
diff changeset
    85
    injects_of constr_inject (dist_rewrites, other_dist_rewrites) induct thy =
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    86
  let
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
    87
    val _ = Datatype_Aux.message config "Constructing primrec combinators ...";
5661
6ecb6ea25f19 - Changed structure of name spaces
berghofe
parents: 5578
diff changeset
    88
6ecb6ea25f19 - Changed structure of name spaces
berghofe
parents: 5578
diff changeset
    89
    val big_name = space_implode "_" new_type_names;
32124
954321008785 dropped ancient flat_names option
haftmann
parents: 31902
diff changeset
    90
    val thy0 = Sign.add_path big_name thy;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    91
32952
aeb1e44fbc19 replaced String.concat by implode;
wenzelm
parents: 32915
diff changeset
    92
    val descr' = flat descr;
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
    93
    val recTs = Datatype_Aux.get_rec_types descr' sorts;
44121
44adaa6db327 old term operations are legacy;
wenzelm
parents: 44058
diff changeset
    94
    val used = List.foldr Misc_Legacy.add_typ_tfree_names [] recTs;
33957
e9afca2118d4 normalized uncurry take/drop
haftmann
parents: 33955
diff changeset
    95
    val newTs = take (length (hd descr)) recTs;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
    96
8305
93aa21ec5494 HOLogic.dest_conj;
wenzelm
parents: 7904
diff changeset
    97
    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
    98
5661
6ecb6ea25f19 - Changed structure of name spaces
berghofe
parents: 5578
diff changeset
    99
    val big_rec_name' = big_name ^ "_rec_set";
21021
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   100
    val rec_set_names' =
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   101
      if length descr' = 1 then [big_rec_name'] else
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   102
        map ((curry (op ^) (big_rec_name' ^ "_")) o string_of_int)
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   103
          (1 upto (length descr'));
28965
1de908189869 cleaned up binding module and related code
haftmann
parents: 28839
diff changeset
   104
    val rec_set_names = map (Sign.full_bname thy0) rec_set_names';
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   105
33968
f94fb13ecbb3 modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents: 33957
diff changeset
   106
    val (rec_result_Ts, reccomb_fn_Ts) = Datatype_Prop.make_primrec_Ts descr sorts used;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   107
21021
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   108
    val rec_set_Ts = map (fn (T1, T2) =>
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   109
      reccomb_fn_Ts @ [T1, T2] ---> HOLogic.boolT) (recTs ~~ rec_result_Ts);
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   110
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   111
    val rec_fns = map (uncurry (Datatype_Aux.mk_Free "f"))
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   112
      (reccomb_fn_Ts ~~ (1 upto (length reccomb_fn_Ts)));
21021
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   113
    val rec_sets' = map (fn c => list_comb (Free c, rec_fns))
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   114
      (rec_set_names' ~~ rec_set_Ts);
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   115
    val rec_sets = map (fn c => list_comb (Const c, rec_fns))
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   116
      (rec_set_names ~~ rec_set_Ts);
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   117
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   118
    (* introduction rules for graph of primrec function *)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   119
32906
ac97e8735cc2 less non-standard combinators
haftmann
parents: 32905
diff changeset
   120
    fun make_rec_intr T rec_set (cname, cargs) (rec_intr_ts, l) =
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   121
      let
33338
de76079f973a eliminated some old folds;
wenzelm
parents: 33317
diff changeset
   122
        fun mk_prem (dt, U) (j, k, prems, t1s, t2s) =
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   123
          let val free1 = Datatype_Aux.mk_Free "x" U j
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   124
          in (case (Datatype_Aux.strip_dtyp dt, strip_type U) of
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   125
             ((_, Datatype_Aux.DtRec m), (Us, _)) =>
13641
63d1790a43ed Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents: 12910
diff changeset
   126
               let
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   127
                 val free2 = Datatype_Aux.mk_Free "y" (Us ---> nth rec_result_Ts m) k;
13641
63d1790a43ed Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents: 12910
diff changeset
   128
                 val i = length Us
63d1790a43ed Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents: 12910
diff changeset
   129
               in (j + 1, k + 1, HOLogic.mk_Trueprop (HOLogic.list_all
32905
5e46c6704cee nth replaces List.nth
haftmann
parents: 32729
diff changeset
   130
                     (map (pair "x") Us, nth rec_sets' m $
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   131
                       Datatype_Aux.app_bnds free1 i $ Datatype_Aux.app_bnds free2 i)) :: prems,
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   132
                   free1::t1s, free2::t2s)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   133
               end
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   134
           | _ => (j + 1, k, prems, free1::t1s, t2s))
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   135
          end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   136
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   137
        val Ts = map (Datatype_Aux.typ_of_dtyp descr' sorts) cargs;
33338
de76079f973a eliminated some old folds;
wenzelm
parents: 33317
diff changeset
   138
        val (_, _, prems, t1s, t2s) = fold_rev mk_prem (cargs ~~ Ts) (1, 1, [], [], [])
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   139
21021
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   140
      in (rec_intr_ts @ [Logic.list_implies (prems, HOLogic.mk_Trueprop
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   141
        (rec_set $ list_comb (Const (cname, Ts ---> T), t1s) $
32905
5e46c6704cee nth replaces List.nth
haftmann
parents: 32729
diff changeset
   142
          list_comb (nth rec_fns l, t1s @ t2s)))], l + 1)
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   143
      end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   144
32906
ac97e8735cc2 less non-standard combinators
haftmann
parents: 32905
diff changeset
   145
    val (rec_intr_ts, _) = fold (fn ((d, T), set_name) =>
ac97e8735cc2 less non-standard combinators
haftmann
parents: 32905
diff changeset
   146
      fold (make_rec_intr T set_name) (#3 (snd d)))
ac97e8735cc2 less non-standard combinators
haftmann
parents: 32905
diff changeset
   147
        (descr' ~~ recTs ~~ rec_sets') ([], 0);
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   148
21365
4ee8e2702241 InductivePackage.add_inductive_i: canonical argument order;
wenzelm
parents: 21291
diff changeset
   149
    val ({intrs = rec_intrs, elims = rec_elims, ...}, thy1) =
33278
ba9f52f56356 conceal internal bindings;
wenzelm
parents: 33173
diff changeset
   150
      thy0
ba9f52f56356 conceal internal bindings;
wenzelm
parents: 33173
diff changeset
   151
      |> Sign.map_naming Name_Space.conceal
33726
0878aecbf119 eliminated slightly odd name space grouping -- now managed by Isar toplevel;
wenzelm
parents: 33669
diff changeset
   152
      |> Inductive.add_inductive_global
33669
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33643
diff changeset
   153
          {quiet_mode = #quiet config, verbose = false, alt_name = Binding.name big_rec_name',
ae9a2ea9a989 inductive: eliminated obsolete kind;
wenzelm
parents: 33643
diff changeset
   154
            coind = false, no_elim = false, no_ind = true, skip_mono = true, fork_mono = false}
28965
1de908189869 cleaned up binding module and related code
haftmann
parents: 28839
diff changeset
   155
          (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
   156
          (map dest_Free rec_fns)
33278
ba9f52f56356 conceal internal bindings;
wenzelm
parents: 33173
diff changeset
   157
          (map (fn x => (Attrib.empty_binding, x)) rec_intr_ts) []
ba9f52f56356 conceal internal bindings;
wenzelm
parents: 33173
diff changeset
   158
      ||> Sign.restore_naming thy0
ba9f52f56356 conceal internal bindings;
wenzelm
parents: 33173
diff changeset
   159
      ||> Theory.checkpoint;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   160
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   161
    (* prove uniqueness and termination of primrec combinators *)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   162
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   163
    val _ = Datatype_Aux.message config "Proving termination and uniqueness of primrec functions ...";
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   164
32906
ac97e8735cc2 less non-standard combinators
haftmann
parents: 32905
diff changeset
   165
    fun mk_unique_tac ((((i, (tname, _, constrs)), elim), T), T') (tac, intrs) =
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   166
      let
21021
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   167
        val distinct_tac =
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   168
          (if i < length newTs then
32905
5e46c6704cee nth replaces List.nth
haftmann
parents: 32729
diff changeset
   169
             full_simp_tac (HOL_ss addsimps (nth dist_rewrites i)) 1
32915
a7a97960054b more appropriate abstraction over distinctness rules
haftmann
parents: 32906
diff changeset
   170
           else full_simp_tac (HOL_ss addsimps (flat other_dist_rewrites)) 1);
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   171
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   172
        val inject = map (fn r => r RS iffD1)
32905
5e46c6704cee nth replaces List.nth
haftmann
parents: 32729
diff changeset
   173
          (if i < length newTs then nth constr_inject i
32729
1441cf4ddc1a shared code between rep_datatype and datatype
haftmann
parents: 32124
diff changeset
   174
            else injects_of tname);
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   175
32906
ac97e8735cc2 less non-standard combinators
haftmann
parents: 32905
diff changeset
   176
        fun mk_unique_constr_tac n (cname, cargs) (tac, intr::intrs, j) =
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   177
          let
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   178
            val k = length (filter Datatype_Aux.is_rec_type cargs)
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   179
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   180
          in (EVERY [DETERM tac,
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   181
                REPEAT (etac ex1E 1), rtac ex1I 1,
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   182
                DEPTH_SOLVE_1 (ares_tac [intr] 1),
13641
63d1790a43ed Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents: 12910
diff changeset
   183
                REPEAT_DETERM_N k (etac thin_rl 1 THEN rotate_tac 1 1),
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   184
                etac elim 1,
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   185
                REPEAT_DETERM_N j distinct_tac,
21021
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   186
                TRY (dresolve_tac inject 1),
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   187
                REPEAT (etac conjE 1), hyp_subst_tac 1,
13641
63d1790a43ed Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents: 12910
diff changeset
   188
                REPEAT (EVERY [etac allE 1, dtac mp 1, atac 1]),
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   189
                TRY (hyp_subst_tac 1),
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   190
                rtac refl 1,
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   191
                REPEAT_DETERM_N (n - j - 1) distinct_tac],
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   192
              intrs, j + 1)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   193
          end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   194
32906
ac97e8735cc2 less non-standard combinators
haftmann
parents: 32905
diff changeset
   195
        val (tac', intrs', _) = fold (mk_unique_constr_tac (length constrs))
ac97e8735cc2 less non-standard combinators
haftmann
parents: 32905
diff changeset
   196
          constrs (tac, intrs, 0);
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   197
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   198
      in (tac', intrs') end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   199
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   200
    val rec_unique_thms =
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   201
      let
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   202
        val rec_unique_ts = map (fn (((set_t, T1), T2), i) =>
35364
b8c62d60195c more antiquotations;
wenzelm
parents: 33968
diff changeset
   203
          Const (@{const_name Ex1}, (T2 --> HOLogic.boolT) --> HOLogic.boolT) $
44241
7943b69f0188 modernized signature of Term.absfree/absdummy;
wenzelm
parents: 44121
diff changeset
   204
            absfree ("y", T2) (set_t $ Datatype_Aux.mk_Free "x" T1 i $ Free ("y", T2)))
21021
6f19e5eb3a44 Adapted to new inductive definition package.
berghofe
parents: 20071
diff changeset
   205
              (rec_sets ~~ recTs ~~ rec_result_Ts ~~ (1 upto length recTs));
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   206
        val cert = cterm_of thy1
44241
7943b69f0188 modernized signature of Term.absfree/absdummy;
wenzelm
parents: 44121
diff changeset
   207
        val insts = map (fn ((i, T), t) => absfree ("x" ^ string_of_int i, T) t)
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   208
          ((1 upto length recTs) ~~ recTs ~~ rec_unique_ts);
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   209
        val induct' = cterm_instantiate ((map cert induct_Ps) ~~
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   210
          (map cert insts)) induct;
32906
ac97e8735cc2 less non-standard combinators
haftmann
parents: 32905
diff changeset
   211
        val (tac, _) = fold mk_unique_tac (descr' ~~ rec_elims ~~ recTs ~~ rec_result_Ts)
35625
9c818cab0dd0 modernized structure Object_Logic;
wenzelm
parents: 35410
diff changeset
   212
           (((rtac induct' THEN_ALL_NEW Object_Logic.atomize_prems_tac) 1
35410
1ea89d2a1bd4 more antiquotations;
wenzelm
parents: 35364
diff changeset
   213
              THEN rewrite_goals_tac [mk_meta_eq @{thm choice_eq}], rec_intrs));
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   214
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   215
      in
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   216
        Datatype_Aux.split_conj_thm (Skip_Proof.prove_global thy1 [] []
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   217
          (HOLogic.mk_Trueprop (Datatype_Aux.mk_conj rec_unique_ts)) (K tac))
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   218
      end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   219
35410
1ea89d2a1bd4 more antiquotations;
wenzelm
parents: 35364
diff changeset
   220
    val rec_total_thms = map (fn r => r RS @{thm theI'}) rec_unique_thms;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   221
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   222
    (* define primrec combinators *)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   223
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   224
    val big_reccomb_name = (space_implode "_" new_type_names) ^ "_rec";
28965
1de908189869 cleaned up binding module and related code
haftmann
parents: 28839
diff changeset
   225
    val reccomb_names = map (Sign.full_bname thy1)
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   226
      (if length descr' = 1 then [big_reccomb_name] else
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   227
        (map ((curry (op ^) (big_reccomb_name ^ "_")) o string_of_int)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   228
          (1 upto (length descr'))));
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   229
    val reccombs = map (fn ((name, T), T') => list_comb
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   230
      (Const (name, reccomb_fn_Ts @ [T] ---> T'), rec_fns))
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   231
        (reccomb_names ~~ recTs ~~ rec_result_Ts);
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   232
18358
0a733e11021a re-oriented some result tuples in PureThy
haftmann
parents: 18314
diff changeset
   233
    val (reccomb_defs, thy2) =
0a733e11021a re-oriented some result tuples in PureThy
haftmann
parents: 18314
diff changeset
   234
      thy1
24712
64ed05609568 proper Sign operations instead of Theory aliases;
wenzelm
parents: 24699
diff changeset
   235
      |> 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
   236
          (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
   237
          (reccomb_names ~~ recTs ~~ rec_result_Ts))
39557
fe5722fce758 renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents: 38864
diff changeset
   238
      |> (Global_Theory.add_defs false o map Thm.no_attributes)
fe5722fce758 renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents: 38864
diff changeset
   239
          (map (fn ((((name, comb), set), T), T') =>
fe5722fce758 renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents: 38864
diff changeset
   240
            (Binding.name (Long_Name.base_name name ^ "_def"),
44241
7943b69f0188 modernized signature of Term.absfree/absdummy;
wenzelm
parents: 44121
diff changeset
   241
              Logic.mk_equals (comb, absfree ("x", T)
7943b69f0188 modernized signature of Term.absfree/absdummy;
wenzelm
parents: 44121
diff changeset
   242
               (Const (@{const_name The}, (T' --> HOLogic.boolT) --> T') $ absfree ("y", T')
7943b69f0188 modernized signature of Term.absfree/absdummy;
wenzelm
parents: 44121
diff changeset
   243
                 (set $ Free ("x", T) $ Free ("y", T'))))))
39557
fe5722fce758 renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents: 38864
diff changeset
   244
                   (reccomb_names ~~ reccombs ~~ rec_sets ~~ recTs ~~ rec_result_Ts))
32124
954321008785 dropped ancient flat_names option
haftmann
parents: 31902
diff changeset
   245
      ||> Sign.parent_path
28361
232fcbba2e4e explicit checkpoint for low-level (global) theory operations, admits concurrent proofs;
wenzelm
parents: 28110
diff changeset
   246
      ||> Theory.checkpoint;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   247
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   248
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   249
    (* prove characteristic equations for primrec combinators *)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   250
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   251
    val _ = Datatype_Aux.message config "Proving characteristic theorems for primrec combinators ...";
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   252
32970
fbd2bb2489a8 operations of structure Skip_Proof (formerly SkipProof) no longer require quick_and_dirty mode;
wenzelm
parents: 32952
diff changeset
   253
    val rec_thms = map (fn t => Skip_Proof.prove_global thy2 [] [] t
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   254
      (fn _ => EVERY
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   255
        [rewrite_goals_tac reccomb_defs,
35410
1ea89d2a1bd4 more antiquotations;
wenzelm
parents: 35364
diff changeset
   256
         rtac @{thm the1_equality} 1,
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   257
         resolve_tac rec_unique_thms 1,
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   258
         resolve_tac rec_intrs 1,
20046
9c8909fc5865 Goal.prove_global;
wenzelm
parents: 19233
diff changeset
   259
         REPEAT (rtac allI 1 ORELSE resolve_tac rec_total_thms 1)]))
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   260
           (Datatype_Prop.make_primrecs new_type_names descr sorts thy2);
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   261
  in
18314
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
   262
    thy2
24712
64ed05609568 proper Sign operations instead of Theory aliases;
wenzelm
parents: 24699
diff changeset
   263
    |> Sign.add_path (space_implode "_" new_type_names)
39557
fe5722fce758 renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents: 38864
diff changeset
   264
    |> Global_Theory.add_thmss [((Binding.name "recs", rec_thms), [Nitpick_Simps.add])]
24712
64ed05609568 proper Sign operations instead of Theory aliases;
wenzelm
parents: 24699
diff changeset
   265
    ||> Sign.parent_path
28361
232fcbba2e4e explicit checkpoint for low-level (global) theory operations, admits concurrent proofs;
wenzelm
parents: 28110
diff changeset
   266
    ||> Theory.checkpoint
32906
ac97e8735cc2 less non-standard combinators
haftmann
parents: 32905
diff changeset
   267
    |-> (fn thms => pair (reccomb_names, flat thms))
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   268
  end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   269
8477
17231d71171a - Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents: 8436
diff changeset
   270
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   271
(***************************** case combinators *******************************)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   272
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   273
fun prove_case_thms (config : Datatype_Aux.config)
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   274
    new_type_names descr sorts reccomb_names primrec_thms thy =
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   275
  let
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   276
    val _ = Datatype_Aux.message config "Proving characteristic theorems for case combinators ...";
5661
6ecb6ea25f19 - Changed structure of name spaces
berghofe
parents: 5578
diff changeset
   277
32124
954321008785 dropped ancient flat_names option
haftmann
parents: 31902
diff changeset
   278
    val thy1 = Sign.add_path (space_implode "_" new_type_names) thy;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   279
32952
aeb1e44fbc19 replaced String.concat by implode;
wenzelm
parents: 32915
diff changeset
   280
    val descr' = flat descr;
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   281
    val recTs = Datatype_Aux.get_rec_types descr' sorts;
44121
44adaa6db327 old term operations are legacy;
wenzelm
parents: 44058
diff changeset
   282
    val used = List.foldr Misc_Legacy.add_typ_tfree_names [] recTs;
33957
e9afca2118d4 normalized uncurry take/drop
haftmann
parents: 33955
diff changeset
   283
    val newTs = take (length (hd descr)) recTs;
43324
2b47822868e4 discontinued Name.variant to emphasize that this is old-style / indirect;
wenzelm
parents: 42375
diff changeset
   284
    val T' = TFree (singleton (Name.variant_list used) "'t", HOLogic.typeS);
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   285
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   286
    fun mk_dummyT dt = binder_types (Datatype_Aux.typ_of_dtyp descr' sorts dt) ---> T';
7015
85be09eb136c - Datatype package now also supports arbitrarily branching datatypes
berghofe
parents: 6522
diff changeset
   287
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   288
    val case_dummy_fns = map (fn (_, (_, _, constrs)) => map (fn (_, cargs) =>
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   289
      let
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   290
        val Ts = map (Datatype_Aux.typ_of_dtyp descr' sorts) cargs;
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   291
        val Ts' = map mk_dummyT (filter Datatype_Aux.is_rec_type cargs)
28524
644b62cf678f arbitrary is undefined
haftmann
parents: 28361
diff changeset
   292
      in Const (@{const_name undefined}, Ts @ Ts' ---> T')
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   293
      end) constrs) descr';
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   294
28965
1de908189869 cleaned up binding module and related code
haftmann
parents: 28839
diff changeset
   295
    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
   296
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   297
    (* define case combinators via primrec combinators *)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   298
32906
ac97e8735cc2 less non-standard combinators
haftmann
parents: 32905
diff changeset
   299
    val (case_defs, thy2) = fold (fn ((((i, (_, _, constrs)), T), name), recname) => fn (defs, thy) =>
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   300
        let
32906
ac97e8735cc2 less non-standard combinators
haftmann
parents: 32905
diff changeset
   301
          val (fns1, fns2) = split_list (map (fn ((_, cargs), j) =>
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   302
            let
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   303
              val Ts = map (Datatype_Aux.typ_of_dtyp descr' sorts) cargs;
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   304
              val Ts' = Ts @ map mk_dummyT (filter Datatype_Aux.is_rec_type cargs);
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   305
              val frees' = map2 (Datatype_Aux.mk_Free "x") Ts' (1 upto length Ts');
33957
e9afca2118d4 normalized uncurry take/drop
haftmann
parents: 33955
diff changeset
   306
              val frees = take (length cargs) frees';
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   307
              val free = Datatype_Aux.mk_Free "f" (Ts ---> T') j
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   308
            in
44241
7943b69f0188 modernized signature of Term.absfree/absdummy;
wenzelm
parents: 44121
diff changeset
   309
              (free, fold_rev (absfree o dest_Free) frees' (list_comb (free, frees)))
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   310
            end) (constrs ~~ (1 upto length constrs)));
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   311
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   312
          val caseT = (map (snd o dest_Free) fns1) @ [T] ---> T';
33957
e9afca2118d4 normalized uncurry take/drop
haftmann
parents: 33955
diff changeset
   313
          val fns = flat (take i case_dummy_fns) @
e9afca2118d4 normalized uncurry take/drop
haftmann
parents: 33955
diff changeset
   314
            fns2 @ flat (drop (i + 1) case_dummy_fns);
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   315
          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
   316
          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
   317
          val def = (Binding.name (Long_Name.base_name name ^ "_def"),
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   318
            Logic.mk_equals (list_comb (Const (name, caseT), fns1),
33957
e9afca2118d4 normalized uncurry take/drop
haftmann
parents: 33955
diff changeset
   319
              list_comb (reccomb, (flat (take i case_dummy_fns)) @
e9afca2118d4 normalized uncurry take/drop
haftmann
parents: 33955
diff changeset
   320
                fns2 @ (flat (drop (i + 1) case_dummy_fns)))));
18358
0a733e11021a re-oriented some result tuples in PureThy
haftmann
parents: 18314
diff changeset
   321
          val ([def_thm], thy') =
0a733e11021a re-oriented some result tuples in PureThy
haftmann
parents: 18314
diff changeset
   322
            thy
42375
774df7c59508 report Name_Space.declare/define, relatively to context;
wenzelm
parents: 41423
diff changeset
   323
            |> Sign.declare_const_global decl |> snd
39557
fe5722fce758 renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents: 38864
diff changeset
   324
            |> (Global_Theory.add_defs false o map Thm.no_attributes) [def];
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   325
8436
8a87fa482baf adapted to new PureThy.add_thms etc.;
wenzelm
parents: 8305
diff changeset
   326
        in (defs @ [def_thm], thy')
32906
ac97e8735cc2 less non-standard combinators
haftmann
parents: 32905
diff changeset
   327
        end) (hd descr ~~ newTs ~~ case_names ~~
33957
e9afca2118d4 normalized uncurry take/drop
haftmann
parents: 33955
diff changeset
   328
          take (length newTs) reccomb_names) ([], thy1)
28361
232fcbba2e4e explicit checkpoint for low-level (global) theory operations, admits concurrent proofs;
wenzelm
parents: 28110
diff changeset
   329
      ||> Theory.checkpoint;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   330
32970
fbd2bb2489a8 operations of structure Skip_Proof (formerly SkipProof) no longer require quick_and_dirty mode;
wenzelm
parents: 32952
diff changeset
   331
    val case_thms = map (map (fn t => Skip_Proof.prove_global thy2 [] [] t
20046
9c8909fc5865 Goal.prove_global;
wenzelm
parents: 19233
diff changeset
   332
      (fn _ => EVERY [rewrite_goals_tac (case_defs @ map mk_meta_eq primrec_thms), rtac refl 1])))
33968
f94fb13ecbb3 modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents: 33957
diff changeset
   333
          (Datatype_Prop.make_cases new_type_names descr sorts thy2)
8477
17231d71171a - Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents: 8436
diff changeset
   334
  in
18314
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
   335
    thy2
33459
wenzelm
parents: 33338
diff changeset
   336
    |> Context.theory_map ((fold o fold) Nitpick_Simps.add_thm case_thms)
32124
954321008785 dropped ancient flat_names option
haftmann
parents: 31902
diff changeset
   337
    |> Sign.parent_path
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   338
    |> Datatype_Aux.store_thmss "cases" new_type_names case_thms
18314
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
   339
    |-> (fn thmss => pair (thmss, case_names))
8477
17231d71171a - Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents: 8436
diff changeset
   340
  end;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   341
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   342
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   343
(******************************* case splitting *******************************)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   344
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   345
fun prove_split_thms (config : Datatype_Aux.config)
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   346
    new_type_names descr sorts constr_inject dist_rewrites casedist_thms case_thms thy =
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   347
  let
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   348
    val _ = Datatype_Aux.message config "Proving equations for case splitting ...";
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   349
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31604
diff changeset
   350
    val descr' = flat descr;
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   351
    val recTs = Datatype_Aux.get_rec_types descr' sorts;
33957
e9afca2118d4 normalized uncurry take/drop
haftmann
parents: 33955
diff changeset
   352
    val newTs = take (length (hd descr)) recTs;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   353
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   354
    fun prove_split_thms ((((((t1, t2), inject), dist_rewrites'),
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   355
        exhaustion), case_thms'), T) =
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   356
      let
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   357
        val cert = cterm_of thy;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   358
        val _ $ (_ $ lhs $ _) = hd (Logic.strip_assums_hyp (hd (prems_of exhaustion)));
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   359
        val exhaustion' = cterm_instantiate
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   360
          [(cert lhs, cert (Free ("x", T)))] exhaustion;
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   361
        val tacf = K (EVERY [rtac exhaustion' 1, ALLGOALS (asm_simp_tac
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   362
          (HOL_ss addsimps (dist_rewrites' @ inject @ case_thms')))])
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   363
      in
32970
fbd2bb2489a8 operations of structure Skip_Proof (formerly SkipProof) no longer require quick_and_dirty mode;
wenzelm
parents: 32952
diff changeset
   364
        (Skip_Proof.prove_global thy [] [] t1 tacf,
fbd2bb2489a8 operations of structure Skip_Proof (formerly SkipProof) no longer require quick_and_dirty mode;
wenzelm
parents: 32952
diff changeset
   365
         Skip_Proof.prove_global thy [] [] t2 tacf)
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   366
      end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   367
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   368
    val split_thm_pairs = map prove_split_thms
33968
f94fb13ecbb3 modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents: 33957
diff changeset
   369
      ((Datatype_Prop.make_splits new_type_names descr sorts thy) ~~ constr_inject ~~
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   370
        dist_rewrites ~~ casedist_thms ~~ case_thms ~~ newTs);
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   371
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   372
    val (split_thms, split_asm_thms) = ListPair.unzip split_thm_pairs
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   373
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   374
  in
18314
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
   375
    thy
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   376
    |> Datatype_Aux.store_thms "split" new_type_names split_thms
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   377
    ||>> Datatype_Aux.store_thms "split_asm" new_type_names split_asm_thms
18314
4595eb4627fa oriented pairs theory * 'a to 'a * theory
haftmann
parents: 17985
diff changeset
   378
    |-> (fn (thms1, thms2) => pair (thms1 ~~ thms2))
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   379
  end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   380
8601
8fb3a81b4ccf added weak_case_cong feature
nipkow
parents: 8477
diff changeset
   381
fun prove_weak_case_congs new_type_names descr sorts thy =
8fb3a81b4ccf added weak_case_cong feature
nipkow
parents: 8477
diff changeset
   382
  let
8fb3a81b4ccf added weak_case_cong feature
nipkow
parents: 8477
diff changeset
   383
    fun prove_weak_case_cong t =
32970
fbd2bb2489a8 operations of structure Skip_Proof (formerly SkipProof) no longer require quick_and_dirty mode;
wenzelm
parents: 32952
diff changeset
   384
       Skip_Proof.prove_global thy [] (Logic.strip_imp_prems t) (Logic.strip_imp_concl t)
26711
3a478bfa1650 prove_global: pass context;
wenzelm
parents: 26531
diff changeset
   385
         (fn {prems, ...} => EVERY [rtac ((hd prems) RS arg_cong) 1])
8601
8fb3a81b4ccf added weak_case_cong feature
nipkow
parents: 8477
diff changeset
   386
33968
f94fb13ecbb3 modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents: 33957
diff changeset
   387
    val weak_case_congs = map prove_weak_case_cong (Datatype_Prop.make_weak_case_congs
8601
8fb3a81b4ccf added weak_case_cong feature
nipkow
parents: 8477
diff changeset
   388
      new_type_names descr sorts thy)
8fb3a81b4ccf added weak_case_cong feature
nipkow
parents: 8477
diff changeset
   389
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   390
  in thy |> Datatype_Aux.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
   391
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   392
(************************* additional theorems for TFL ************************)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   393
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   394
fun prove_nchotomys (config : Datatype_Aux.config)
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   395
    new_type_names descr sorts casedist_thms thy =
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   396
  let
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   397
    val _ = Datatype_Aux.message config "Proving additional theorems for TFL ...";
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   398
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   399
    fun prove_nchotomy (t, exhaustion) =
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   400
      let
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   401
        (* For goal i, select the correct disjunct to attack, then prove it *)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   402
        fun tac i 0 = EVERY [TRY (rtac disjI1 i),
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   403
              hyp_subst_tac i, REPEAT (rtac exI i), rtac refl i]
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   404
          | tac i n = rtac disjI2 i THEN tac i (n - 1)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   405
      in 
32970
fbd2bb2489a8 operations of structure Skip_Proof (formerly SkipProof) no longer require quick_and_dirty mode;
wenzelm
parents: 32952
diff changeset
   406
        Skip_Proof.prove_global thy [] [] t (fn _ =>
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   407
          EVERY [rtac allI 1,
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   408
           Datatype_Aux.exh_tac (K exhaustion) 1,
20046
9c8909fc5865 Goal.prove_global;
wenzelm
parents: 19233
diff changeset
   409
           ALLGOALS (fn i => tac i (i-1))])
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   410
      end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   411
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   412
    val nchotomys =
33968
f94fb13ecbb3 modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents: 33957
diff changeset
   413
      map prove_nchotomy (Datatype_Prop.make_nchotomys descr sorts ~~ casedist_thms)
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   414
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   415
  in thy |> Datatype_Aux.store_thms "nchotomy" new_type_names nchotomys end;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   416
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   417
fun prove_case_congs new_type_names descr sorts nchotomys case_thms thy =
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   418
  let
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   419
    fun prove_case_cong ((t, nchotomy), case_rewrites) =
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   420
      let
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   421
        val (Const ("==>", _) $ tm $ _) = t;
38864
4abe644fcea5 formerly unnamed infix equality now named HOL.eq
haftmann
parents: 35625
diff changeset
   422
        val (Const (@{const_name Trueprop}, _) $ (Const (@{const_name HOL.eq}, _) $ _ $ Ma)) = tm;
22578
b0eb5652f210 removed obsolete sign_of/sign_of_thm;
wenzelm
parents: 21621
diff changeset
   423
        val cert = cterm_of thy;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   424
        val nchotomy' = nchotomy RS spec;
29264
4ea3358fac3f use regular Term.add_vars, Term.add_frees etc.;
wenzelm
parents: 28965
diff changeset
   425
        val [v] = Term.add_vars (concl_of nchotomy') [];
4ea3358fac3f use regular Term.add_vars, Term.add_frees etc.;
wenzelm
parents: 28965
diff changeset
   426
        val nchotomy'' = cterm_instantiate [(cert (Var v), cert Ma)] nchotomy'
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   427
      in
32970
fbd2bb2489a8 operations of structure Skip_Proof (formerly SkipProof) no longer require quick_and_dirty mode;
wenzelm
parents: 32952
diff changeset
   428
        Skip_Proof.prove_global thy [] (Logic.strip_imp_prems t) (Logic.strip_imp_concl t)
26711
3a478bfa1650 prove_global: pass context;
wenzelm
parents: 26531
diff changeset
   429
          (fn {prems, ...} => 
17985
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   430
            let val simplify = asm_simp_tac (HOL_ss addsimps (prems @ case_rewrites))
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   431
            in EVERY [simp_tac (HOL_ss addsimps [hd prems]) 1,
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   432
                cut_facts_tac [nchotomy''] 1,
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   433
                REPEAT (etac disjE 1 THEN REPEAT (etac exE 1) THEN simplify 1),
d5d576b72371 avoid legacy goals;
wenzelm
parents: 17959
diff changeset
   434
                REPEAT (etac exE 1) THEN simplify 1 (* Get last disjunct *)]
20046
9c8909fc5865 Goal.prove_global;
wenzelm
parents: 19233
diff changeset
   435
            end)
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   436
      end;
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   437
33968
f94fb13ecbb3 modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents: 33957
diff changeset
   438
    val case_congs = map prove_case_cong (Datatype_Prop.make_case_congs
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   439
      new_type_names descr sorts thy ~~ nchotomys ~~ case_thms)
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   440
41423
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   441
  in thy |> Datatype_Aux.store_thms "case_cong" new_type_names case_congs end;
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   442
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   443
25df154b8ffc do not open auxiliary ML structures;
wenzelm
parents: 39557
diff changeset
   444
open Datatype_Aux;
5177
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   445
0d3a168e4d44 New datatype definition package
berghofe
parents:
diff changeset
   446
end;