src/HOL/BNF/Tools/bnf_fp_def_sugar.ML
author blanchet
Fri, 07 Jun 2013 11:40:24 +0200
changeset 52341 fc66f7db2c0b
parent 52340 754bc55dcb09
child 52342 df4fef9e15a7
permissions -rw-r--r--
tuning
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
49636
b7256a88a84b renamed ML file in preparation for next step
blanchet
parents: 49633
diff changeset
     1
(*  Title:      HOL/BNF/Tools/bnf_fp_def_sugar.ML
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
     2
    Author:     Jasmin Blanchette, TU Muenchen
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
     3
    Copyright   2012
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
     4
49389
blanchet
parents: 49381
diff changeset
     5
Sugared datatype and codatatype constructions.
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
     6
*)
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
     7
49636
b7256a88a84b renamed ML file in preparation for next step
blanchet
parents: 49633
diff changeset
     8
signature BNF_FP_DEF_SUGAR =
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
     9
sig
51840
b304fb6c5ef5 renamed records
blanchet
parents: 51839
diff changeset
    10
  type fp_sugar =
51859
09d24ea3f140 rationalized data structure
blanchet
parents: 51858
diff changeset
    11
    {T: typ,
52207
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
    12
     fp: BNF_FP_Util.fp_kind,
51838
1999b2e0b157 added pre-BNFs to database
blanchet
parents: 51837
diff changeset
    13
     index: int,
1999b2e0b157 added pre-BNFs to database
blanchet
parents: 51837
diff changeset
    14
     pre_bnfs: BNF_Def.bnf list,
51850
106afdf5806c renamed a few FP-related files, to make it clear that these are not the sum of LFP + GFP but rather shared basic libraries
blanchet
parents: 51847
diff changeset
    15
     fp_res: BNF_FP_Util.fp_result,
51906
38dcb3a6dfcc added field to record
blanchet
parents: 51905
diff changeset
    16
     ctr_defss: thm list list,
51842
cc0a3185406c added fields to database
blanchet
parents: 51841
diff changeset
    17
     ctr_sugars: BNF_Ctr_Sugar.ctr_sugar list,
52336
blanchet
parents: 52335
diff changeset
    18
     co_iterss: term list list,
51864
9761deff11bc store (co)induction rules in data structure
blanchet
parents: 51863
diff changeset
    19
     co_induct: thm,
9761deff11bc store (co)induction rules in data structure
blanchet
parents: 51863
diff changeset
    20
     strong_co_induct: thm,
52337
blanchet
parents: 52336
diff changeset
    21
     co_iter_thmsss: thm list list list};
51823
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
    22
52295
e8a482afb53d added convenience function
blanchet
parents: 52294
diff changeset
    23
  val of_fp_sugar: (fp_sugar -> 'a list) -> fp_sugar -> 'a
51896
1cf1fe22145d export one more function + tuning
blanchet
parents: 51892
diff changeset
    24
  val morph_fp_sugar: morphism -> fp_sugar -> fp_sugar
1cf1fe22145d export one more function + tuning
blanchet
parents: 51892
diff changeset
    25
  val fp_sugar_of: Proof.context -> string -> fp_sugar option
51852
23d938495367 refactoring
blanchet
parents: 51850
diff changeset
    26
51911
6c425d450a8c more robust iterator construction (needed for mutualized FPs)
blanchet
parents: 51910
diff changeset
    27
  val tvar_subst: theory -> typ list -> typ list -> ((string * int) * typ) list
51860
75655198442e export one more function
blanchet
parents: 51859
diff changeset
    28
  val exists_subtype_in: typ list -> typ -> bool
52301
7935e82a4ae4 simpler, more robust iterator goal construction code
blanchet
parents: 52300
diff changeset
    29
  val flat_rec: 'a list list -> 'a list
52207
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
    30
  val mk_co_iter: theory -> BNF_FP_Util.fp_kind -> typ -> typ list -> term -> term
51907
882d850aa3ca export one more function
blanchet
parents: 51906
diff changeset
    31
  val nesty_bnfs: Proof.context -> typ list list list -> typ list -> BNF_Def.bnf list
52334
blanchet
parents: 52330
diff changeset
    32
  val mk_co_iters_prelims: BNF_FP_Util.fp_kind -> typ list -> typ list -> int list ->
52315
fafab8eac3ee avoid duplicate call to "mk_fold_rec_args_types" function
blanchet
parents: 52314
diff changeset
    33
    int list list -> term list list -> Proof.context ->
fafab8eac3ee avoid duplicate call to "mk_fold_rec_args_types" function
blanchet
parents: 52314
diff changeset
    34
    (term list list
fafab8eac3ee avoid duplicate call to "mk_fold_rec_args_types" function
blanchet
parents: 52314
diff changeset
    35
     * (typ list list * typ list list list list * term list list
fafab8eac3ee avoid duplicate call to "mk_fold_rec_args_types" function
blanchet
parents: 52314
diff changeset
    36
        * term list list list list) list option
51903
126f8d11f873 move function to library
blanchet
parents: 51902
diff changeset
    37
     * (term list * term list list
126f8d11f873 move function to library
blanchet
parents: 51902
diff changeset
    38
        * ((term list list * term list list list list * term list list list list)
52326
blanchet
parents: 52321
diff changeset
    39
           * (typ list * typ list list list * typ list list)) list) option)
51903
126f8d11f873 move function to library
blanchet
parents: 51902
diff changeset
    40
    * Proof.context
52293
019ca39edd54 export ML function (needed for "primrec_new")
blanchet
parents: 52292
diff changeset
    41
  val mk_map: int -> typ list -> typ list -> term -> term
51855
fcdf213d332c more code rationalization
blanchet
parents: 51854
diff changeset
    42
  val build_map: local_theory -> (typ * typ -> term) -> typ * typ -> term
51823
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
    43
52215
7facaee8586f tuning (use lists rather than pairs of lists throughout)
blanchet
parents: 52214
diff changeset
    44
  val mk_iter_fun_arg_typessss: typ list -> int list -> int list list -> term ->
7facaee8586f tuning (use lists rather than pairs of lists throughout)
blanchet
parents: 52214
diff changeset
    45
    typ list list list list
52320
blanchet
parents: 52319
diff changeset
    46
  val define_iters: string list ->
52315
fafab8eac3ee avoid duplicate call to "mk_fold_rec_args_types" function
blanchet
parents: 52314
diff changeset
    47
    (typ list list * typ list list list list * term list list * term list list list list) list ->
52319
blanchet
parents: 52317
diff changeset
    48
    (string -> binding) -> typ list -> typ list -> term list -> Proof.context ->
52320
blanchet
parents: 52319
diff changeset
    49
    (term list * thm list) * Proof.context
52326
blanchet
parents: 52321
diff changeset
    50
  val define_coiters: string list -> term list * term list list
52321
blanchet
parents: 52320
diff changeset
    51
    * ((term list list * term list list list list * term list list list list)
52326
blanchet
parents: 52321
diff changeset
    52
       * (typ list * typ list list list * typ list list)) list ->
52319
blanchet
parents: 52317
diff changeset
    53
    (string -> binding) -> typ list -> typ list -> term list -> Proof.context ->
52320
blanchet
parents: 52319
diff changeset
    54
    (term list * thm list) * Proof.context
52329
blanchet
parents: 52328
diff changeset
    55
  val derive_induct_iters_thms_for_types: BNF_Def.bnf list -> term list list ->
52315
fafab8eac3ee avoid duplicate call to "mk_fold_rec_args_types" function
blanchet
parents: 52314
diff changeset
    56
    (typ list list * typ list list list list * term list list * term list list list list) list ->
fafab8eac3ee avoid duplicate call to "mk_fold_rec_args_types" function
blanchet
parents: 52314
diff changeset
    57
    thm -> thm list list -> BNF_Def.bnf list -> BNF_Def.bnf list -> typ list -> typ list ->
fafab8eac3ee avoid duplicate call to "mk_fold_rec_args_types" function
blanchet
parents: 52314
diff changeset
    58
    typ list -> typ list list list -> term list list -> thm list list -> term list list ->
fafab8eac3ee avoid duplicate call to "mk_fold_rec_args_types" function
blanchet
parents: 52314
diff changeset
    59
    thm list list -> local_theory ->
51811
1461426e2bf1 tuned function signatures
blanchet
parents: 51810
diff changeset
    60
    (thm * thm list * Args.src list) * (thm list list * Args.src list)
51827
836257faaad5 tuned signature
blanchet
parents: 51824
diff changeset
    61
    * (thm list list * Args.src list)
52341
blanchet
parents: 52340
diff changeset
    62
  val derive_coinduct_coiters_thms_for_types: BNF_Def.bnf list -> term list list ->
blanchet
parents: 52340
diff changeset
    63
    term list * term list list
blanchet
parents: 52340
diff changeset
    64
    * ((term list list * term list list list list * term list list list list) * 'a) list ->
blanchet
parents: 52340
diff changeset
    65
    thm -> thm -> thm list -> thm list list -> BNF_Def.bnf list -> BNF_Def.bnf list -> typ list ->
52321
blanchet
parents: 52320
diff changeset
    66
    typ list -> typ list -> int list list -> int list list -> int list -> thm list list ->
blanchet
parents: 52320
diff changeset
    67
    BNF_Ctr_Sugar.ctr_sugar list -> term list list -> thm list list -> local_theory ->
51839
5c552de1d8d1 added constructors to data structure
blanchet
parents: 51838
diff changeset
    68
    (thm * thm list * thm * thm list * Args.src list)
5c552de1d8d1 added constructors to data structure
blanchet
parents: 51838
diff changeset
    69
    * (thm list list * thm list list * Args.src list)
51811
1461426e2bf1 tuned function signatures
blanchet
parents: 51810
diff changeset
    70
    * (thm list list * thm list list) * (thm list list * thm list list * Args.src list)
51824
27d073b0876c register all (co)datatypes in local data
blanchet
parents: 51823
diff changeset
    71
    * (thm list list * thm list list * Args.src list)
27d073b0876c register all (co)datatypes in local data
blanchet
parents: 51823
diff changeset
    72
    * (thm list list * thm list list * Args.src list)
51823
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
    73
52207
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
    74
  val co_datatypes: BNF_FP_Util.fp_kind -> (mixfix list -> binding list -> binding list ->
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
    75
      binding list list -> binding list -> (string * sort) list -> typ list * typ list list ->
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
    76
      BNF_Def.bnf list -> local_theory -> BNF_FP_Util.fp_result * local_theory) ->
51767
bbcdd8519253 honor user-specified name for relator + generalize syntax
blanchet
parents: 51766
diff changeset
    77
    (bool * bool) * (((((binding * (typ * sort)) list * binding) * (binding * binding)) * mixfix) *
51758
55963309557b honor user-specified name for map function
blanchet
parents: 51757
diff changeset
    78
      ((((binding * binding) * (binding * typ) list) * (binding * term) list) *
55963309557b honor user-specified name for map function
blanchet
parents: 51757
diff changeset
    79
        mixfix) list) list ->
49297
47fbf2e3e89c provide a programmatic interface for FP sugar
blanchet
parents: 49287
diff changeset
    80
    local_theory -> local_theory
52207
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
    81
  val parse_co_datatype_cmd: BNF_FP_Util.fp_kind -> (mixfix list -> binding list -> binding list ->
51867
6d756057e736 signature tuning
blanchet
parents: 51866
diff changeset
    82
      binding list list -> binding list -> (string * sort) list -> typ list * typ list list ->
6d756057e736 signature tuning
blanchet
parents: 51866
diff changeset
    83
      BNF_Def.bnf list -> local_theory -> BNF_FP_Util.fp_result * local_theory) ->
49308
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents: 49302
diff changeset
    84
    (local_theory -> local_theory) parser
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
    85
end;
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
    86
49636
b7256a88a84b renamed ML file in preparation for next step
blanchet
parents: 49633
diff changeset
    87
structure BNF_FP_Def_Sugar : BNF_FP_DEF_SUGAR =
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
    88
struct
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
    89
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    90
open BNF_Util
51797
182454c06a80 tuned ML and thy file names
blanchet
parents: 51795
diff changeset
    91
open BNF_Ctr_Sugar
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
    92
open BNF_Def
51850
106afdf5806c renamed a few FP-related files, to make it clear that these are not the sum of LFP + GFP but rather shared basic libraries
blanchet
parents: 51847
diff changeset
    93
open BNF_FP_Util
49636
b7256a88a84b renamed ML file in preparation for next step
blanchet
parents: 49633
diff changeset
    94
open BNF_FP_Def_Sugar_Tactics
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    95
51788
5fe72280a49f put an underscore in prefix
blanchet
parents: 51787
diff changeset
    96
val EqN = "Eq_";
51777
48a0ae342ea0 generate proper attributes for coinduction rules
blanchet
parents: 51769
diff changeset
    97
51840
b304fb6c5ef5 renamed records
blanchet
parents: 51839
diff changeset
    98
type fp_sugar =
51859
09d24ea3f140 rationalized data structure
blanchet
parents: 51858
diff changeset
    99
  {T: typ,
52207
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
   100
   fp: fp_kind,
51838
1999b2e0b157 added pre-BNFs to database
blanchet
parents: 51837
diff changeset
   101
   index: int,
1999b2e0b157 added pre-BNFs to database
blanchet
parents: 51837
diff changeset
   102
   pre_bnfs: bnf list,
51823
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
   103
   fp_res: fp_result,
51906
38dcb3a6dfcc added field to record
blanchet
parents: 51905
diff changeset
   104
   ctr_defss: thm list list,
51842
cc0a3185406c added fields to database
blanchet
parents: 51841
diff changeset
   105
   ctr_sugars: ctr_sugar list,
52336
blanchet
parents: 52335
diff changeset
   106
   co_iterss: term list list,
51864
9761deff11bc store (co)induction rules in data structure
blanchet
parents: 51863
diff changeset
   107
   co_induct: thm,
9761deff11bc store (co)induction rules in data structure
blanchet
parents: 51863
diff changeset
   108
   strong_co_induct: thm,
52337
blanchet
parents: 52336
diff changeset
   109
   co_iter_thmsss: thm list list list};
51823
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
   110
52295
e8a482afb53d added convenience function
blanchet
parents: 52294
diff changeset
   111
fun of_fp_sugar f (fp_sugar as {index, ...}) = nth (f fp_sugar) index;
e8a482afb53d added convenience function
blanchet
parents: 52294
diff changeset
   112
52207
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
   113
fun eq_fp_sugar ({T = T1, fp = fp1, index = index1, fp_res = fp_res1, ...} : fp_sugar,
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
   114
    {T = T2, fp = fp2, index = index2, fp_res = fp_res2, ...} : fp_sugar) =
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
   115
  T1 = T2 andalso fp1 = fp2 andalso index1 = index2 andalso eq_fp_result (fp_res1, fp_res2);
51823
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
   116
52336
blanchet
parents: 52335
diff changeset
   117
fun morph_fp_sugar phi {T, fp, index, pre_bnfs, fp_res, ctr_defss, ctr_sugars, co_iterss, co_induct,
52337
blanchet
parents: 52336
diff changeset
   118
    strong_co_induct, co_iter_thmsss} =
52299
085771de5720 reverted 23929f647f79 -- not needed after all
blanchet
parents: 52298
diff changeset
   119
  {T = Morphism.typ phi T, fp = fp, index = index, pre_bnfs = map (morph_bnf phi)
085771de5720 reverted 23929f647f79 -- not needed after all
blanchet
parents: 52298
diff changeset
   120
   pre_bnfs, fp_res = morph_fp_result phi fp_res,
52207
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
   121
   ctr_defss = map (map (Morphism.thm phi)) ctr_defss,
52336
blanchet
parents: 52335
diff changeset
   122
   ctr_sugars = map (morph_ctr_sugar phi) ctr_sugars,
blanchet
parents: 52335
diff changeset
   123
   co_iterss = map (map (Morphism.term phi)) co_iterss, co_induct = Morphism.thm phi co_induct,
51906
38dcb3a6dfcc added field to record
blanchet
parents: 51905
diff changeset
   124
   strong_co_induct = Morphism.thm phi strong_co_induct,
52337
blanchet
parents: 52336
diff changeset
   125
   co_iter_thmsss = map (map (map (Morphism.thm phi))) co_iter_thmsss};
51823
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
   126
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
   127
structure Data = Generic_Data
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
   128
(
51840
b304fb6c5ef5 renamed records
blanchet
parents: 51839
diff changeset
   129
  type T = fp_sugar Symtab.table;
51823
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
   130
  val empty = Symtab.empty;
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
   131
  val extend = I;
51840
b304fb6c5ef5 renamed records
blanchet
parents: 51839
diff changeset
   132
  val merge = Symtab.merge eq_fp_sugar;
51823
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
   133
);
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
   134
51840
b304fb6c5ef5 renamed records
blanchet
parents: 51839
diff changeset
   135
val fp_sugar_of = Symtab.lookup o Data.get o Context.Proof;
51823
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
   136
51840
b304fb6c5ef5 renamed records
blanchet
parents: 51839
diff changeset
   137
fun register_fp_sugar key fp_sugar =
51823
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
   138
  Local_Theory.declaration {syntax = false, pervasive = true}
51840
b304fb6c5ef5 renamed records
blanchet
parents: 51839
diff changeset
   139
    (fn phi => Data.map (Symtab.update_new (key, morph_fp_sugar phi fp_sugar)));
51823
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
   140
52338
blanchet
parents: 52337
diff changeset
   141
fun register_fp_sugars fp pre_bnfs (fp_res as {Ts, ...}) ctr_defss ctr_sugars co_iterss co_induct
blanchet
parents: 52337
diff changeset
   142
    strong_co_induct co_iter_thmsss lthy =
51844
blanchet
parents: 51843
diff changeset
   143
  (0, lthy)
51859
09d24ea3f140 rationalized data structure
blanchet
parents: 51858
diff changeset
   144
  |> fold (fn T as Type (s, _) => fn (kk, lthy) => (kk + 1,
52299
085771de5720 reverted 23929f647f79 -- not needed after all
blanchet
parents: 52298
diff changeset
   145
    register_fp_sugar s {T = T, fp = fp, index = kk, pre_bnfs = pre_bnfs, fp_res = fp_res,
52338
blanchet
parents: 52337
diff changeset
   146
        ctr_defss = ctr_defss, ctr_sugars = ctr_sugars, co_iterss = co_iterss,
52337
blanchet
parents: 52336
diff changeset
   147
        co_induct = co_induct, strong_co_induct = strong_co_induct, co_iter_thmsss = co_iter_thmsss}
blanchet
parents: 52336
diff changeset
   148
      lthy)) Ts
51824
27d073b0876c register all (co)datatypes in local data
blanchet
parents: 51823
diff changeset
   149
  |> snd;
27d073b0876c register all (co)datatypes in local data
blanchet
parents: 51823
diff changeset
   150
51777
48a0ae342ea0 generate proper attributes for coinduction rules
blanchet
parents: 51769
diff changeset
   151
(* This function could produce clashes in contrived examples (e.g., "x.A", "x.x_A", "y.A"). *)
49622
a93f976c3307 use a nicer scheme to indexify names
blanchet
parents: 49605
diff changeset
   152
fun quasi_unambiguous_case_names names =
a93f976c3307 use a nicer scheme to indexify names
blanchet
parents: 49605
diff changeset
   153
  let
a93f976c3307 use a nicer scheme to indexify names
blanchet
parents: 49605
diff changeset
   154
    val ps = map (`Long_Name.base_name) names;
a93f976c3307 use a nicer scheme to indexify names
blanchet
parents: 49605
diff changeset
   155
    val dups = Library.duplicates (op =) (map fst ps);
a93f976c3307 use a nicer scheme to indexify names
blanchet
parents: 49605
diff changeset
   156
    fun underscore s =
a93f976c3307 use a nicer scheme to indexify names
blanchet
parents: 49605
diff changeset
   157
      let val ss = space_explode Long_Name.separator s in
a93f976c3307 use a nicer scheme to indexify names
blanchet
parents: 49605
diff changeset
   158
        space_implode "_" (drop (length ss - 2) ss)
a93f976c3307 use a nicer scheme to indexify names
blanchet
parents: 49605
diff changeset
   159
      end;
a93f976c3307 use a nicer scheme to indexify names
blanchet
parents: 49605
diff changeset
   160
  in
a93f976c3307 use a nicer scheme to indexify names
blanchet
parents: 49605
diff changeset
   161
    map (fn (base, full) => if member (op =) dups base then underscore full else base) ps
a93f976c3307 use a nicer scheme to indexify names
blanchet
parents: 49605
diff changeset
   162
  end;
a93f976c3307 use a nicer scheme to indexify names
blanchet
parents: 49605
diff changeset
   163
49591
91b228e26348 generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents: 49590
diff changeset
   164
val mp_conj = @{thm mp_conj};
91b228e26348 generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents: 49590
diff changeset
   165
49300
c707df2e2083 added attributes to theorems
blanchet
parents: 49298
diff changeset
   166
val simp_attrs = @{attributes [simp]};
49585
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   167
val code_simp_attrs = Code.add_default_eqn_attrib :: simp_attrs;
49300
c707df2e2083 added attributes to theorems
blanchet
parents: 49298
diff changeset
   168
51911
6c425d450a8c more robust iterator construction (needed for mutualized FPs)
blanchet
parents: 51910
diff changeset
   169
fun tvar_subst thy Ts Us =
6c425d450a8c more robust iterator construction (needed for mutualized FPs)
blanchet
parents: 51910
diff changeset
   170
  Vartab.fold (cons o apsnd snd) (fold (Sign.typ_match thy) (Ts ~~ Us) Vartab.empty) [];
6c425d450a8c more robust iterator construction (needed for mutualized FPs)
blanchet
parents: 51910
diff changeset
   171
51860
75655198442e export one more function
blanchet
parents: 51859
diff changeset
   172
val exists_subtype_in = Term.exists_subtype o member (op =);
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   173
49342
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   174
fun resort_tfree S (TFree (s, _)) = TFree (s, S);
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   175
51845
af9a208e6543 further enrich data structure
blanchet
parents: 51844
diff changeset
   176
fun typ_subst_nonatomic inst (T as Type (s, Ts)) =
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   177
    (case AList.lookup (op =) inst T of
51845
af9a208e6543 further enrich data structure
blanchet
parents: 51844
diff changeset
   178
      NONE => Type (s, map (typ_subst_nonatomic inst) Ts)
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   179
    | SOME T' => T')
51845
af9a208e6543 further enrich data structure
blanchet
parents: 51844
diff changeset
   180
  | typ_subst_nonatomic inst T = the_default T (AList.lookup (op =) inst T);
49205
674f04c737e0 implemented "mk_iter_or_rec_tac"
blanchet
parents: 49204
diff changeset
   181
49297
47fbf2e3e89c provide a programmatic interface for FP sugar
blanchet
parents: 49287
diff changeset
   182
val lists_bmoc = fold (fn xs => fn t => Term.list_comb (t, xs));
49202
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   183
52301
7935e82a4ae4 simpler, more robust iterator goal construction code
blanchet
parents: 52300
diff changeset
   184
fun flat_rec xss =
7935e82a4ae4 simpler, more robust iterator goal construction code
blanchet
parents: 52300
diff changeset
   185
  (* The first line below gives the preferred order. The second line is for compatibility with the
7935e82a4ae4 simpler, more robust iterator goal construction code
blanchet
parents: 52300
diff changeset
   186
     old datatype package: *)
52215
7facaee8586f tuning (use lists rather than pairs of lists throughout)
blanchet
parents: 52214
diff changeset
   187
(*
52301
7935e82a4ae4 simpler, more robust iterator goal construction code
blanchet
parents: 52300
diff changeset
   188
  flat xss
51795
096b96281e34 for compatibility, generate recursor arguments in the same order as old package
blanchet
parents: 51794
diff changeset
   189
*)
52301
7935e82a4ae4 simpler, more robust iterator goal construction code
blanchet
parents: 52300
diff changeset
   190
  map hd xss @ maps tl xss;
51793
22f22172a361 started working on compatibility with old package's recursor
blanchet
parents: 51790
diff changeset
   191
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   192
fun flat_predss_getterss qss fss = maps (op @) (qss ~~ fss);
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   193
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   194
fun flat_preds_predsss_gettersss [] [qss] [fss] = flat_predss_getterss qss fss
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   195
  | flat_preds_predsss_gettersss (p :: ps) (qss :: qsss) (fss :: fsss) =
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   196
    p :: flat_predss_getterss qss fss @ flat_preds_predsss_gettersss ps qsss fsss;
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   197
52214
4cc5a80bba80 generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents: 52213
diff changeset
   198
fun mk_tupled_fun x f xs = HOLogic.tupled_lambda x (Term.list_comb (f, xs));
4cc5a80bba80 generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents: 52213
diff changeset
   199
fun mk_uncurried_fun f xs = mk_tupled_fun (HOLogic.mk_tuple xs) f xs;
4cc5a80bba80 generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents: 52213
diff changeset
   200
fun mk_uncurried2_fun f xss =
52301
7935e82a4ae4 simpler, more robust iterator goal construction code
blanchet
parents: 52300
diff changeset
   201
  mk_tupled_fun (HOLogic.mk_tuple (map HOLogic.mk_tuple xss)) f (flat_rec xss);
52214
4cc5a80bba80 generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents: 52213
diff changeset
   202
49585
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   203
fun mk_flip (x, Type (_, [T1, Type (_, [T2, T3])])) =
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   204
  Abs ("x", T1, Abs ("y", T2, Var (x, T2 --> T1 --> T3) $ Bound 0 $ Bound 1));
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   205
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   206
fun flip_rels lthy n thm =
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   207
  let
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   208
    val Rs = Term.add_vars (prop_of thm) [];
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   209
    val Rs' = rev (drop (length Rs - n) Rs);
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   210
    val cRs = map (fn f => (certify lthy (Var f), certify lthy (mk_flip f))) Rs';
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   211
  in
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   212
    Drule.cterm_instantiate cRs thm
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   213
  end;
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   214
49536
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   215
fun mk_ctor_or_dtor get_T Ts t =
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   216
  let val Type (_, Ts0) = get_T (fastype_of t) in
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   217
    Term.subst_atomic_types (Ts0 ~~ Ts) t
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   218
  end;
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   219
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   220
val mk_ctor = mk_ctor_or_dtor range_type;
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   221
val mk_dtor = mk_ctor_or_dtor domain_type;
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   222
52207
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
   223
fun mk_co_iter thy fp fpT Cs t =
49536
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   224
  let
52309
f71d0a604e5a tuned ML variable names
blanchet
parents: 52306
diff changeset
   225
    val (binders, body) = strip_type (fastype_of t);
f71d0a604e5a tuned ML variable names
blanchet
parents: 52306
diff changeset
   226
    val (f_Cs, prebody) = split_last binders;
52207
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
   227
    val fpT0 = if fp = Least_FP then prebody else body;
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
   228
    val Cs0 = distinct (op =) (map (if fp = Least_FP then body_type else domain_type) f_Cs);
52197
20071aef2a3b exported ML function
blanchet
parents: 52195
diff changeset
   229
    val rho = tvar_subst thy (fpT0 :: Cs0) (fpT :: Cs);
49536
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   230
  in
52170
564be617ae84 generalized "mk_co_iter" to handle mutualized (co)iterators
blanchet
parents: 52169
diff changeset
   231
    Term.subst_TVars rho t
49536
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   232
  end;
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   233
52207
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
   234
fun mk_co_iters thy fp fpTs Cs ts0 =
51911
6c425d450a8c more robust iterator construction (needed for mutualized FPs)
blanchet
parents: 51910
diff changeset
   235
  let
6c425d450a8c more robust iterator construction (needed for mutualized FPs)
blanchet
parents: 51910
diff changeset
   236
    val nn = length fpTs;
6c425d450a8c more robust iterator construction (needed for mutualized FPs)
blanchet
parents: 51910
diff changeset
   237
    val (fpTs0, Cs0) =
52207
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
   238
      map ((fp = Greatest_FP ? swap) o dest_funT o snd o strip_typeN nn o fastype_of) ts0
51911
6c425d450a8c more robust iterator construction (needed for mutualized FPs)
blanchet
parents: 51910
diff changeset
   239
      |> split_list;
6c425d450a8c more robust iterator construction (needed for mutualized FPs)
blanchet
parents: 51910
diff changeset
   240
    val rho = tvar_subst thy (fpTs0 @ Cs0) (fpTs @ Cs);
6c425d450a8c more robust iterator construction (needed for mutualized FPs)
blanchet
parents: 51910
diff changeset
   241
  in
52170
564be617ae84 generalized "mk_co_iter" to handle mutualized (co)iterators
blanchet
parents: 52169
diff changeset
   242
    map (Term.subst_TVars rho) ts0
51911
6c425d450a8c more robust iterator construction (needed for mutualized FPs)
blanchet
parents: 51910
diff changeset
   243
  end;
51827
836257faaad5 tuned signature
blanchet
parents: 51824
diff changeset
   244
52169
blanchet
parents: 51912
diff changeset
   245
val mk_fp_iter_fun_types = fst o split_last o binder_types o fastype_of;
blanchet
parents: 51912
diff changeset
   246
52297
blanchet
parents: 52296
diff changeset
   247
fun project_co_recT special_Tname Cs proj =
51827
836257faaad5 tuned signature
blanchet
parents: 51824
diff changeset
   248
  let
52297
blanchet
parents: 52296
diff changeset
   249
    fun project (Type (s, Ts as [T, U])) =
blanchet
parents: 52296
diff changeset
   250
        if s = special_Tname andalso member (op =) Cs U then proj (T, U)
52209
8b2c3e548a20 tuning (refactoring)
blanchet
parents: 52208
diff changeset
   251
        else Type (s, map project Ts)
52297
blanchet
parents: 52296
diff changeset
   252
      | project (Type (s, Ts)) = Type (s, map project Ts)
52209
8b2c3e548a20 tuning (refactoring)
blanchet
parents: 52208
diff changeset
   253
      | project T = T;
8b2c3e548a20 tuning (refactoring)
blanchet
parents: 52208
diff changeset
   254
  in project end;
8b2c3e548a20 tuning (refactoring)
blanchet
parents: 52208
diff changeset
   255
8b2c3e548a20 tuning (refactoring)
blanchet
parents: 52208
diff changeset
   256
val project_corecT = project_co_recT @{type_name sum};
8b2c3e548a20 tuning (refactoring)
blanchet
parents: 52208
diff changeset
   257
52296
45b5935b11b4 slightly nicer ML interface
blanchet
parents: 52295
diff changeset
   258
fun unzip_recT Cs (T as Type (@{type_name prod}, Ts as [_, U])) =
45b5935b11b4 slightly nicer ML interface
blanchet
parents: 52295
diff changeset
   259
    if member (op =) Cs U then Ts else [T]
52216
b6a0668211f6 more work on general recursors
blanchet
parents: 52215
diff changeset
   260
  | unzip_recT _ T = [T];
51827
836257faaad5 tuned signature
blanchet
parents: 51824
diff changeset
   261
51846
67b8712dabb7 export more functions (useful for primrec_new)
blanchet
parents: 51845
diff changeset
   262
fun mk_fun_arg_typess n ms = map2 dest_tupleT ms o dest_sumTN_balanced n o domain_type;
67b8712dabb7 export more functions (useful for primrec_new)
blanchet
parents: 51845
diff changeset
   263
52296
45b5935b11b4 slightly nicer ML interface
blanchet
parents: 52295
diff changeset
   264
fun mk_iter_fun_arg_typessss Cs ns mss =
51885
cc60613a1528 rationalize ML signature
blanchet
parents: 51884
diff changeset
   265
  mk_fp_iter_fun_types
cc60613a1528 rationalize ML signature
blanchet
parents: 51884
diff changeset
   266
  #> map3 mk_fun_arg_typess ns mss
52296
45b5935b11b4 slightly nicer ML interface
blanchet
parents: 52295
diff changeset
   267
  #> map (map (map (unzip_recT Cs)));
51885
cc60613a1528 rationalize ML signature
blanchet
parents: 51884
diff changeset
   268
52335
blanchet
parents: 52334
diff changeset
   269
fun mk_iters_args_types Cs ns mss ctor_iter_fun_Tss lthy =
51832
blanchet
parents: 51831
diff changeset
   270
  let
52214
4cc5a80bba80 generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents: 52213
diff changeset
   271
    val Css = map2 replicate ns Cs;
52335
blanchet
parents: 52334
diff changeset
   272
    val y_Tsss = map3 mk_fun_arg_typess ns mss (map un_fold_of ctor_iter_fun_Tss);
52214
4cc5a80bba80 generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents: 52213
diff changeset
   273
    val g_Tss = map2 (fn C => map (fn y_Ts => y_Ts ---> C)) Cs y_Tsss;
51832
blanchet
parents: 51831
diff changeset
   274
blanchet
parents: 51831
diff changeset
   275
    val ((gss, ysss), lthy) =
blanchet
parents: 51831
diff changeset
   276
      lthy
blanchet
parents: 51831
diff changeset
   277
      |> mk_Freess "f" g_Tss
blanchet
parents: 51831
diff changeset
   278
      ||>> mk_Freesss "x" y_Tsss;
52301
7935e82a4ae4 simpler, more robust iterator goal construction code
blanchet
parents: 52300
diff changeset
   279
7935e82a4ae4 simpler, more robust iterator goal construction code
blanchet
parents: 52300
diff changeset
   280
    val y_Tssss = map (map (map single)) y_Tsss;
52214
4cc5a80bba80 generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents: 52213
diff changeset
   281
    val yssss = map (map (map single)) ysss;
4cc5a80bba80 generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents: 52213
diff changeset
   282
4cc5a80bba80 generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents: 52213
diff changeset
   283
    val z_Tssss =
52296
45b5935b11b4 slightly nicer ML interface
blanchet
parents: 52295
diff changeset
   284
      map3 (fn n => fn ms => map2 (map (unzip_recT Cs) oo dest_tupleT) ms o
52335
blanchet
parents: 52334
diff changeset
   285
        dest_sumTN_balanced n o domain_type o co_rec_of) ns mss ctor_iter_fun_Tss;
51832
blanchet
parents: 51831
diff changeset
   286
52301
7935e82a4ae4 simpler, more robust iterator goal construction code
blanchet
parents: 52300
diff changeset
   287
    val z_Tsss' = map (map flat_rec) z_Tssss;
52215
7facaee8586f tuning (use lists rather than pairs of lists throughout)
blanchet
parents: 52214
diff changeset
   288
    val h_Tss = map2 (map2 (curry (op --->))) z_Tsss' Css;
51832
blanchet
parents: 51831
diff changeset
   289
blanchet
parents: 51831
diff changeset
   290
    val hss = map2 (map2 retype_free) h_Tss gss;
52214
4cc5a80bba80 generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents: 52213
diff changeset
   291
    val zssss_hd = map2 (map2 (map2 (retype_free o hd))) z_Tssss ysss;
4cc5a80bba80 generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents: 52213
diff changeset
   292
    val (zssss_tl, lthy) =
4cc5a80bba80 generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents: 52213
diff changeset
   293
      lthy
4cc5a80bba80 generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents: 52213
diff changeset
   294
      |> mk_Freessss "y" (map (map (map tl)) z_Tssss);
4cc5a80bba80 generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents: 52213
diff changeset
   295
    val zssss = map2 (map2 (map2 cons)) zssss_hd zssss_tl;
51832
blanchet
parents: 51831
diff changeset
   296
  in
52315
fafab8eac3ee avoid duplicate call to "mk_fold_rec_args_types" function
blanchet
parents: 52314
diff changeset
   297
    ([(g_Tss, y_Tssss, gss, yssss), (h_Tss, z_Tssss, hss, zssss)], lthy)
51832
blanchet
parents: 51831
diff changeset
   298
  end;
blanchet
parents: 51831
diff changeset
   299
52335
blanchet
parents: 52334
diff changeset
   300
fun mk_coiters_args_types Cs ns mss dtor_coiter_fun_Tss lthy =
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   301
  let
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   302
    (*avoid "'a itself" arguments in coiterators and corecursors*)
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   303
    fun repair_arity [0] = [1]
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   304
      | repair_arity ms = ms;
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   305
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   306
    fun unzip_corecT T =
52297
blanchet
parents: 52296
diff changeset
   307
      if exists_subtype_in Cs T then [project_corecT Cs fst T, project_corecT Cs snd T]
52209
8b2c3e548a20 tuning (refactoring)
blanchet
parents: 52208
diff changeset
   308
      else [T];
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   309
51831
blanchet
parents: 51830
diff changeset
   310
    val p_Tss = map2 (fn n => replicate (Int.max (0, n - 1)) o mk_pred1T) ns Cs;
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   311
52335
blanchet
parents: 52334
diff changeset
   312
    fun mk_types maybe_unzipT get_Ts =
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   313
      let
52335
blanchet
parents: 52334
diff changeset
   314
        val fun_Ts = map get_Ts dtor_coiter_fun_Tss;
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   315
        val f_sum_prod_Ts = map range_type fun_Ts;
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   316
        val f_prod_Tss = map2 dest_sumTN_balanced ns f_sum_prod_Ts;
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   317
        val f_Tsss = map2 (map2 dest_tupleT o repair_arity) mss f_prod_Tss;
51889
blanchet
parents: 51888
diff changeset
   318
        val f_Tssss = map2 (fn C => map (map (map (curry (op -->) C) o maybe_unzipT))) Cs f_Tsss;
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   319
        val q_Tssss =
52213
blanchet
parents: 52209
diff changeset
   320
          map (map (map (fn [_] => [] | [_, T] => [mk_pred1T (domain_type T)]))) f_Tssss;
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   321
        val pf_Tss = map3 flat_preds_predsss_gettersss p_Tss q_Tssss f_Tssss;
51889
blanchet
parents: 51888
diff changeset
   322
      in (q_Tssss, f_Tssss, (f_sum_prod_Ts, f_Tsss, pf_Tss)) end;
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   323
52335
blanchet
parents: 52334
diff changeset
   324
    val (r_Tssss, g_Tssss, unfold_types) = mk_types single un_fold_of;
blanchet
parents: 52334
diff changeset
   325
    val (s_Tssss, h_Tssss, corec_types) = mk_types unzip_corecT co_rec_of;
51831
blanchet
parents: 51830
diff changeset
   326
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   327
    val (((cs, pss), gssss), lthy) =
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   328
      lthy
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   329
      |> mk_Frees "a" Cs
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   330
      ||>> mk_Freess "p" p_Tss
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   331
      ||>> mk_Freessss "g" g_Tssss;
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   332
    val rssss = map (map (map (fn [] => []))) r_Tssss;
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   333
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   334
    val hssss_hd = map2 (map2 (map2 (fn T :: _ => fn [g] => retype_free T g))) h_Tssss gssss;
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   335
    val ((sssss, hssss_tl), lthy) =
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   336
      lthy
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   337
      |> mk_Freessss "q" s_Tssss
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   338
      ||>> mk_Freessss "h" (map (map (map tl)) h_Tssss);
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   339
    val hssss = map2 (map2 (map2 cons)) hssss_hd hssss_tl;
51831
blanchet
parents: 51830
diff changeset
   340
blanchet
parents: 51830
diff changeset
   341
    val cpss = map2 (map o rapp) cs pss;
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   342
51889
blanchet
parents: 51888
diff changeset
   343
    fun mk_args qssss fssss =
51831
blanchet
parents: 51830
diff changeset
   344
      let
blanchet
parents: 51830
diff changeset
   345
        val pfss = map3 flat_preds_predsss_gettersss pss qssss fssss;
blanchet
parents: 51830
diff changeset
   346
        val cqssss = map2 (map o map o map o rapp) cs qssss;
blanchet
parents: 51830
diff changeset
   347
        val cfssss = map2 (map o map o map o rapp) cs fssss;
blanchet
parents: 51830
diff changeset
   348
      in (pfss, cqssss, cfssss) end;
blanchet
parents: 51830
diff changeset
   349
51889
blanchet
parents: 51888
diff changeset
   350
    val unfold_args = mk_args rssss gssss;
blanchet
parents: 51888
diff changeset
   351
    val corec_args = mk_args sssss hssss;
51831
blanchet
parents: 51830
diff changeset
   352
  in
52326
blanchet
parents: 52321
diff changeset
   353
    ((cs, cpss, [(unfold_args, unfold_types), (corec_args, corec_types)]), lthy)
51831
blanchet
parents: 51830
diff changeset
   354
  end;
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   355
52334
blanchet
parents: 52330
diff changeset
   356
fun mk_co_iters_prelims fp fpTs Cs ns mss xtor_co_iterss0 lthy =
51903
126f8d11f873 move function to library
blanchet
parents: 51902
diff changeset
   357
  let
52169
blanchet
parents: 51912
diff changeset
   358
    val thy = Proof_Context.theory_of lthy;
blanchet
parents: 51912
diff changeset
   359
52335
blanchet
parents: 52334
diff changeset
   360
    val (xtor_co_iter_fun_Tss, xtor_co_iterss) =
52329
blanchet
parents: 52328
diff changeset
   361
      map (mk_co_iters thy fp fpTs Cs #> `(mk_fp_iter_fun_types o hd)) (transpose xtor_co_iterss0)
52335
blanchet
parents: 52334
diff changeset
   362
      |> apsnd transpose o apfst transpose o split_list;
51903
126f8d11f873 move function to library
blanchet
parents: 51902
diff changeset
   363
52329
blanchet
parents: 52328
diff changeset
   364
    val ((iters_args_types, coiters_args_types), lthy') =
52207
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
   365
      if fp = Least_FP then
52335
blanchet
parents: 52334
diff changeset
   366
        mk_iters_args_types Cs ns mss xtor_co_iter_fun_Tss lthy |>> (rpair NONE o SOME)
51903
126f8d11f873 move function to library
blanchet
parents: 51902
diff changeset
   367
      else
52335
blanchet
parents: 52334
diff changeset
   368
        mk_coiters_args_types Cs ns mss xtor_co_iter_fun_Tss lthy |>> (pair NONE o SOME)
51903
126f8d11f873 move function to library
blanchet
parents: 51902
diff changeset
   369
  in
52335
blanchet
parents: 52334
diff changeset
   370
    ((xtor_co_iterss, iters_args_types, coiters_args_types), lthy')
51903
126f8d11f873 move function to library
blanchet
parents: 51902
diff changeset
   371
  end;
126f8d11f873 move function to library
blanchet
parents: 51902
diff changeset
   372
49536
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   373
fun mk_map live Ts Us t =
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   374
  let val (Type (_, Ts0), Type (_, Us0)) = strip_typeN (live + 1) (fastype_of t) |>> List.last in
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   375
    Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   376
  end;
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   377
49591
91b228e26348 generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents: 49590
diff changeset
   378
fun mk_rel live Ts Us t =
91b228e26348 generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents: 49590
diff changeset
   379
  let val [Type (_, Ts0), Type (_, Us0)] = binder_types (snd (strip_typeN live (fastype_of t))) in
91b228e26348 generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents: 49590
diff changeset
   380
    Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t
91b228e26348 generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents: 49590
diff changeset
   381
  end;
91b228e26348 generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents: 49590
diff changeset
   382
49585
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   383
fun liveness_of_fp_bnf n bnf =
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   384
  (case T_of_bnf bnf of
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   385
    Type (_, Ts) => map (not o member (op =) (deads_of_bnf bnf)) Ts
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   386
  | _ => replicate n false);
49536
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   387
49124
968e1b7de057 more work on FP sugar
blanchet
parents: 49123
diff changeset
   388
fun cannot_merge_types () = error "Mutually recursive types must have the same type parameters";
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   389
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   390
fun merge_type_arg T T' = if T = T' then T else cannot_merge_types ();
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   391
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   392
fun merge_type_args (As, As') =
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   393
  if length As = length As' then map2 merge_type_arg As As' else cannot_merge_types ();
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   394
49591
91b228e26348 generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents: 49590
diff changeset
   395
fun reassoc_conjs thm =
91b228e26348 generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents: 49590
diff changeset
   396
  reassoc_conjs (thm RS @{thm conj_assoc[THEN iffD1]})
91b228e26348 generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents: 49590
diff changeset
   397
  handle THM _ => thm;
91b228e26348 generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents: 49590
diff changeset
   398
51767
bbcdd8519253 honor user-specified name for relator + generalize syntax
blanchet
parents: 51766
diff changeset
   399
fun type_args_named_constrained_of ((((ncAs, _), _), _), _) = ncAs;
bbcdd8519253 honor user-specified name for relator + generalize syntax
blanchet
parents: 51766
diff changeset
   400
fun type_binding_of ((((_, b), _), _), _) = b;
bbcdd8519253 honor user-specified name for relator + generalize syntax
blanchet
parents: 51766
diff changeset
   401
fun map_binding_of (((_, (b, _)), _), _) = b;
bbcdd8519253 honor user-specified name for relator + generalize syntax
blanchet
parents: 51766
diff changeset
   402
fun rel_binding_of (((_, (_, b)), _), _) = b;
49181
blanchet
parents: 49180
diff changeset
   403
fun mixfix_of ((_, mx), _) = mx;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   404
fun ctr_specs_of (_, ctr_specs) = ctr_specs;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   405
49286
dde4967c9233 added "defaults" option
blanchet
parents: 49280
diff changeset
   406
fun disc_of ((((disc, _), _), _), _) = disc;
dde4967c9233 added "defaults" option
blanchet
parents: 49280
diff changeset
   407
fun ctr_of ((((_, ctr), _), _), _) = ctr;
dde4967c9233 added "defaults" option
blanchet
parents: 49280
diff changeset
   408
fun args_of (((_, args), _), _) = args;
dde4967c9233 added "defaults" option
blanchet
parents: 49280
diff changeset
   409
fun defaults_of ((_, ds), _) = ds;
49181
blanchet
parents: 49180
diff changeset
   410
fun ctr_mixfix_of (_, mx) = mx;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   411
51907
882d850aa3ca export one more function
blanchet
parents: 51906
diff changeset
   412
fun add_nesty_bnf_names Us =
882d850aa3ca export one more function
blanchet
parents: 51906
diff changeset
   413
  let
882d850aa3ca export one more function
blanchet
parents: 51906
diff changeset
   414
    fun add (Type (s, Ts)) ss =
882d850aa3ca export one more function
blanchet
parents: 51906
diff changeset
   415
        let val (needs, ss') = fold_map add Ts ss in
882d850aa3ca export one more function
blanchet
parents: 51906
diff changeset
   416
          if exists I needs then (true, insert (op =) s ss') else (false, ss')
882d850aa3ca export one more function
blanchet
parents: 51906
diff changeset
   417
        end
882d850aa3ca export one more function
blanchet
parents: 51906
diff changeset
   418
      | add T ss = (member (op =) Us T, ss);
882d850aa3ca export one more function
blanchet
parents: 51906
diff changeset
   419
  in snd oo add end;
882d850aa3ca export one more function
blanchet
parents: 51906
diff changeset
   420
882d850aa3ca export one more function
blanchet
parents: 51906
diff changeset
   421
fun nesty_bnfs ctxt ctr_Tsss Us =
882d850aa3ca export one more function
blanchet
parents: 51906
diff changeset
   422
  map_filter (bnf_of ctxt) (fold (fold (fold (add_nesty_bnf_names Us))) ctr_Tsss []);
882d850aa3ca export one more function
blanchet
parents: 51906
diff changeset
   423
52302
blanchet
parents: 52301
diff changeset
   424
fun indexify proj xs f p = f (find_index (curry (op =) (proj p)) xs) p;
51855
fcdf213d332c more code rationalization
blanchet
parents: 51854
diff changeset
   425
51854
af63d7f52c02 more code rationalization
blanchet
parents: 51853
diff changeset
   426
fun build_map lthy build_simple =
51853
cce8b6ba429d more code rationalization
blanchet
parents: 51852
diff changeset
   427
  let
cce8b6ba429d more code rationalization
blanchet
parents: 51852
diff changeset
   428
    fun build (TU as (T, U)) =
cce8b6ba429d more code rationalization
blanchet
parents: 51852
diff changeset
   429
      if T = U then
cce8b6ba429d more code rationalization
blanchet
parents: 51852
diff changeset
   430
        id_const T
cce8b6ba429d more code rationalization
blanchet
parents: 51852
diff changeset
   431
      else
cce8b6ba429d more code rationalization
blanchet
parents: 51852
diff changeset
   432
        (case TU of
51854
af63d7f52c02 more code rationalization
blanchet
parents: 51853
diff changeset
   433
          (Type (s, Ts), Type (s', Us)) =>
af63d7f52c02 more code rationalization
blanchet
parents: 51853
diff changeset
   434
          if s = s' then
af63d7f52c02 more code rationalization
blanchet
parents: 51853
diff changeset
   435
            let
af63d7f52c02 more code rationalization
blanchet
parents: 51853
diff changeset
   436
              val bnf = the (bnf_of lthy s);
af63d7f52c02 more code rationalization
blanchet
parents: 51853
diff changeset
   437
              val live = live_of_bnf bnf;
af63d7f52c02 more code rationalization
blanchet
parents: 51853
diff changeset
   438
              val mapx = mk_map live Ts Us (map_of_bnf bnf);
af63d7f52c02 more code rationalization
blanchet
parents: 51853
diff changeset
   439
              val TUs' = map dest_funT (fst (strip_typeN live (fastype_of mapx)));
af63d7f52c02 more code rationalization
blanchet
parents: 51853
diff changeset
   440
            in Term.list_comb (mapx, map build TUs') end
af63d7f52c02 more code rationalization
blanchet
parents: 51853
diff changeset
   441
          else
af63d7f52c02 more code rationalization
blanchet
parents: 51853
diff changeset
   442
            build_simple TU
51853
cce8b6ba429d more code rationalization
blanchet
parents: 51852
diff changeset
   443
        | _ => build_simple TU);
cce8b6ba429d more code rationalization
blanchet
parents: 51852
diff changeset
   444
  in build end;
cce8b6ba429d more code rationalization
blanchet
parents: 51852
diff changeset
   445
52298
608afd26a476 killed dead code
blanchet
parents: 52297
diff changeset
   446
fun mk_iter_body ctor_iter fss xssss =
608afd26a476 killed dead code
blanchet
parents: 52297
diff changeset
   447
  Term.list_comb (ctor_iter, map2 (mk_sum_caseN_balanced oo map2 mk_uncurried2_fun) fss xssss);
51884
2928fda12661 factor out construction of iterator
blanchet
parents: 51883
diff changeset
   448
51900
blanchet
parents: 51899
diff changeset
   449
fun mk_preds_getterss_join c cps sum_prod_T cqfss =
blanchet
parents: 51899
diff changeset
   450
  let val n = length cqfss in
blanchet
parents: 51899
diff changeset
   451
    Term.lambda c (mk_IfN sum_prod_T cps
blanchet
parents: 51899
diff changeset
   452
      (map2 (mk_InN_balanced sum_prod_T n) (map HOLogic.mk_tuple cqfss) (1 upto n)))
blanchet
parents: 51899
diff changeset
   453
  end;
51886
e7fac4a483b5 started factoring out coiter construction
blanchet
parents: 51885
diff changeset
   454
51900
blanchet
parents: 51899
diff changeset
   455
fun mk_coiter_body lthy cs cpss f_sum_prod_Ts f_Tsss cqssss cfssss dtor_coiter =
51888
1cbcc0cc6bdf imported patch refactor_coiter_constr
blanchet
parents: 51886
diff changeset
   456
  let
1cbcc0cc6bdf imported patch refactor_coiter_constr
blanchet
parents: 51886
diff changeset
   457
    fun build_sum_inj mk_inj = build_map lthy (uncurry mk_inj o dest_sumT o snd);
1cbcc0cc6bdf imported patch refactor_coiter_constr
blanchet
parents: 51886
diff changeset
   458
1cbcc0cc6bdf imported patch refactor_coiter_constr
blanchet
parents: 51886
diff changeset
   459
    fun build_dtor_coiter_arg _ [] [cf] = cf
1cbcc0cc6bdf imported patch refactor_coiter_constr
blanchet
parents: 51886
diff changeset
   460
      | build_dtor_coiter_arg T [cq] [cf, cf'] =
1cbcc0cc6bdf imported patch refactor_coiter_constr
blanchet
parents: 51886
diff changeset
   461
        mk_If cq (build_sum_inj Inl_const (fastype_of cf, T) $ cf)
1cbcc0cc6bdf imported patch refactor_coiter_constr
blanchet
parents: 51886
diff changeset
   462
          (build_sum_inj Inr_const (fastype_of cf', T) $ cf')
1cbcc0cc6bdf imported patch refactor_coiter_constr
blanchet
parents: 51886
diff changeset
   463
1cbcc0cc6bdf imported patch refactor_coiter_constr
blanchet
parents: 51886
diff changeset
   464
    val cqfsss = map3 (map3 (map3 build_dtor_coiter_arg)) f_Tsss cqssss cfssss;
1cbcc0cc6bdf imported patch refactor_coiter_constr
blanchet
parents: 51886
diff changeset
   465
  in
51900
blanchet
parents: 51899
diff changeset
   466
    Term.list_comb (dtor_coiter, map4 mk_preds_getterss_join cs cpss f_sum_prod_Ts cqfsss)
51888
1cbcc0cc6bdf imported patch refactor_coiter_constr
blanchet
parents: 51886
diff changeset
   467
  end;
51886
e7fac4a483b5 started factoring out coiter construction
blanchet
parents: 51885
diff changeset
   468
52327
blanchet
parents: 52326
diff changeset
   469
fun define_co_iters fp fpT Cs binding_specs lthy0 =
51897
9a27c870ee21 refactoring
blanchet
parents: 51896
diff changeset
   470
  let
52170
564be617ae84 generalized "mk_co_iter" to handle mutualized (co)iterators
blanchet
parents: 52169
diff changeset
   471
    val thy = Proof_Context.theory_of lthy0;
564be617ae84 generalized "mk_co_iter" to handle mutualized (co)iterators
blanchet
parents: 52169
diff changeset
   472
52327
blanchet
parents: 52326
diff changeset
   473
    val ((csts, defs), (lthy', lthy)) = lthy0
blanchet
parents: 52326
diff changeset
   474
      |> apfst split_list o fold_map (fn (b, spec) =>
blanchet
parents: 52326
diff changeset
   475
        Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec))
blanchet
parents: 52326
diff changeset
   476
        #>> apsnd snd) binding_specs
blanchet
parents: 52326
diff changeset
   477
      ||> `Local_Theory.restore;
blanchet
parents: 52326
diff changeset
   478
blanchet
parents: 52326
diff changeset
   479
    val phi = Proof_Context.export_morphism lthy lthy';
blanchet
parents: 52326
diff changeset
   480
blanchet
parents: 52326
diff changeset
   481
    val csts' = map (mk_co_iter thy fp fpT Cs o Morphism.term phi) csts;
blanchet
parents: 52326
diff changeset
   482
    val defs' = map (Morphism.thm phi) defs;
blanchet
parents: 52326
diff changeset
   483
  in
blanchet
parents: 52326
diff changeset
   484
    ((csts', defs'), lthy')
blanchet
parents: 52326
diff changeset
   485
  end;
blanchet
parents: 52326
diff changeset
   486
blanchet
parents: 52326
diff changeset
   487
fun define_iters iterNs iter_args_typess' mk_binding fpTs Cs ctor_iters lthy =
blanchet
parents: 52326
diff changeset
   488
  let
51899
c2c23ac31973 code tuning
blanchet
parents: 51897
diff changeset
   489
    val nn = length fpTs;
c2c23ac31973 code tuning
blanchet
parents: 51897
diff changeset
   490
52320
blanchet
parents: 52319
diff changeset
   491
    val fpT_to_C as Type (_, [fpT, _]) = snd (strip_typeN nn (fastype_of (hd ctor_iters)));
51897
9a27c870ee21 refactoring
blanchet
parents: 51896
diff changeset
   492
52320
blanchet
parents: 52319
diff changeset
   493
    fun generate_iter suf (f_Tss, _, fss, xssss) ctor_iter =
51897
9a27c870ee21 refactoring
blanchet
parents: 51896
diff changeset
   494
      let
51899
c2c23ac31973 code tuning
blanchet
parents: 51897
diff changeset
   495
        val res_T = fold_rev (curry (op --->)) f_Tss fpT_to_C;
52309
f71d0a604e5a tuned ML variable names
blanchet
parents: 52306
diff changeset
   496
        val b = mk_binding suf;
51897
9a27c870ee21 refactoring
blanchet
parents: 51896
diff changeset
   497
        val spec =
52309
f71d0a604e5a tuned ML variable names
blanchet
parents: 52306
diff changeset
   498
          mk_Trueprop_eq (lists_bmoc fss (Free (Binding.name_of b, res_T)),
52298
608afd26a476 killed dead code
blanchet
parents: 52297
diff changeset
   499
            mk_iter_body ctor_iter fss xssss);
52309
f71d0a604e5a tuned ML variable names
blanchet
parents: 52306
diff changeset
   500
      in (b, spec) end;
51897
9a27c870ee21 refactoring
blanchet
parents: 51896
diff changeset
   501
  in
52327
blanchet
parents: 52326
diff changeset
   502
    define_co_iters Least_FP fpT Cs (map3 generate_iter iterNs iter_args_typess' ctor_iters) lthy
51897
9a27c870ee21 refactoring
blanchet
parents: 51896
diff changeset
   503
  end;
9a27c870ee21 refactoring
blanchet
parents: 51896
diff changeset
   504
52327
blanchet
parents: 52326
diff changeset
   505
fun define_coiters coiterNs (cs, cpss, coiter_args_typess') mk_binding fpTs Cs dtor_coiters lthy =
51897
9a27c870ee21 refactoring
blanchet
parents: 51896
diff changeset
   506
  let
51899
c2c23ac31973 code tuning
blanchet
parents: 51897
diff changeset
   507
    val nn = length fpTs;
c2c23ac31973 code tuning
blanchet
parents: 51897
diff changeset
   508
52326
blanchet
parents: 52321
diff changeset
   509
    val C_to_fpT as Type (_, [_, fpT]) = snd (strip_typeN nn (fastype_of (hd dtor_coiters)));
51897
9a27c870ee21 refactoring
blanchet
parents: 51896
diff changeset
   510
52326
blanchet
parents: 52321
diff changeset
   511
    fun generate_coiter suf ((pfss, cqssss, cfssss), (f_sum_prod_Ts, f_Tsss, pf_Tss)) dtor_coiter =
51897
9a27c870ee21 refactoring
blanchet
parents: 51896
diff changeset
   512
      let
51899
c2c23ac31973 code tuning
blanchet
parents: 51897
diff changeset
   513
        val res_T = fold_rev (curry (op --->)) pf_Tss C_to_fpT;
52309
f71d0a604e5a tuned ML variable names
blanchet
parents: 52306
diff changeset
   514
        val b = mk_binding suf;
51897
9a27c870ee21 refactoring
blanchet
parents: 51896
diff changeset
   515
        val spec =
52309
f71d0a604e5a tuned ML variable names
blanchet
parents: 52306
diff changeset
   516
          mk_Trueprop_eq (lists_bmoc pfss (Free (Binding.name_of b, res_T)),
52327
blanchet
parents: 52326
diff changeset
   517
            mk_coiter_body lthy cs cpss f_sum_prod_Ts f_Tsss cqssss cfssss dtor_coiter);
52309
f71d0a604e5a tuned ML variable names
blanchet
parents: 52306
diff changeset
   518
      in (b, spec) end;
51897
9a27c870ee21 refactoring
blanchet
parents: 51896
diff changeset
   519
  in
52327
blanchet
parents: 52326
diff changeset
   520
    define_co_iters Greatest_FP fpT Cs
blanchet
parents: 52326
diff changeset
   521
      (map3 generate_coiter coiterNs coiter_args_typess' dtor_coiters) lthy
52320
blanchet
parents: 52319
diff changeset
   522
  end;
51897
9a27c870ee21 refactoring
blanchet
parents: 51896
diff changeset
   523
52330
blanchet
parents: 52329
diff changeset
   524
fun derive_induct_iters_thms_for_types pre_bnfs (ctor_iters1 :: _) [fold_args_types, rec_args_types]
52340
blanchet
parents: 52339
diff changeset
   525
    ctor_induct ctor_iter_thmss nesting_bnfs nested_bnfs fpTs Cs Xs ctrXs_Tsss ctrss ctr_defss
blanchet
parents: 52339
diff changeset
   526
    iterss iter_defss lthy =
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   527
  let
52340
blanchet
parents: 52339
diff changeset
   528
    val iterss' = transpose iterss;
blanchet
parents: 52339
diff changeset
   529
    val iter_defss' = transpose iter_defss;
blanchet
parents: 52339
diff changeset
   530
blanchet
parents: 52339
diff changeset
   531
    val [folds, recs] = iterss';
blanchet
parents: 52339
diff changeset
   532
    val [fold_defs, rec_defs] = iter_defss';
blanchet
parents: 52339
diff changeset
   533
51827
836257faaad5 tuned signature
blanchet
parents: 51824
diff changeset
   534
    val ctr_Tsss = map (map (binder_types o fastype_of)) ctrss;
836257faaad5 tuned signature
blanchet
parents: 51824
diff changeset
   535
51815
efacb9b99865 tune signatures
blanchet
parents: 51814
diff changeset
   536
    val nn = length pre_bnfs;
51827
836257faaad5 tuned signature
blanchet
parents: 51824
diff changeset
   537
    val ns = map length ctr_Tsss;
836257faaad5 tuned signature
blanchet
parents: 51824
diff changeset
   538
    val mss = map (map length) ctr_Tsss;
51815
efacb9b99865 tune signatures
blanchet
parents: 51814
diff changeset
   539
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   540
    val pre_map_defs = map map_def_of_bnf pre_bnfs;
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   541
    val pre_set_defss = map set_defs_of_bnf pre_bnfs;
51830
blanchet
parents: 51829
diff changeset
   542
    val nesting_map_ids'' = map (unfold_thms lthy @{thms id_def} o map_id_of_bnf) nesting_bnfs;
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   543
    val nested_map_ids'' = map (unfold_thms lthy @{thms id_def} o map_id_of_bnf) nested_bnfs;
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   544
    val nested_set_map's = maps set_map'_of_bnf nested_bnfs;
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   545
51816
5f1dec4297da use base names, not full names
blanchet
parents: 51815
diff changeset
   546
    val fp_b_names = map base_name_of_typ fpTs;
51811
1461426e2bf1 tuned function signatures
blanchet
parents: 51810
diff changeset
   547
52330
blanchet
parents: 52329
diff changeset
   548
    val ctor_fold_fun_Ts = mk_fp_iter_fun_types (un_fold_of ctor_iters1);
blanchet
parents: 52329
diff changeset
   549
    val ctor_rec_fun_Ts = mk_fp_iter_fun_types (co_rec_of ctor_iters1);
51827
836257faaad5 tuned signature
blanchet
parents: 51824
diff changeset
   550
51832
blanchet
parents: 51831
diff changeset
   551
    val ((((ps, ps'), xsss), us'), names_lthy) =
52315
fafab8eac3ee avoid duplicate call to "mk_fold_rec_args_types" function
blanchet
parents: 52314
diff changeset
   552
      lthy
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   553
      |> mk_Frees' "P" (map mk_pred1T fpTs)
51827
836257faaad5 tuned signature
blanchet
parents: 51824
diff changeset
   554
      ||>> mk_Freesss "x" ctr_Tsss
51816
5f1dec4297da use base names, not full names
blanchet
parents: 51815
diff changeset
   555
      ||>> Variable.variant_fixes fp_b_names;
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   556
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   557
    val us = map2 (curry Free) us' fpTs;
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   558
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   559
    fun mk_sets_nested bnf =
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   560
      let
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   561
        val Type (T_name, Us) = T_of_bnf bnf;
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   562
        val lives = lives_of_bnf bnf;
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   563
        val sets = sets_of_bnf bnf;
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   564
        fun mk_set U =
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   565
          (case find_index (curry (op =) U) lives of
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   566
            ~1 => Term.dummy
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   567
          | i => nth sets i);
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   568
      in
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   569
        (T_name, map mk_set Us)
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   570
      end;
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   571
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   572
    val setss_nested = map mk_sets_nested nested_bnfs;
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   573
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   574
    val (induct_thms, induct_thm) =
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   575
      let
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   576
        fun mk_set Ts t =
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   577
          let val Type (_, Ts0) = domain_type (fastype_of t) in
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   578
            Term.subst_atomic_types (Ts0 ~~ Ts) t
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   579
          end;
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   580
52310
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
   581
        fun mk_raw_prem_prems _ (x as Free (_, Type _)) (X as TFree _) =
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
   582
            [([], (find_index (curry (op =) X) Xs + 1, x))]
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
   583
          | mk_raw_prem_prems names_lthy (x as Free (s, Type (T_name, Ts0))) (Type (_, Xs_Ts0)) =
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
   584
            (case AList.lookup (op =) setss_nested T_name of
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
   585
              NONE => []
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
   586
            | SOME raw_sets0 =>
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
   587
              let
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
   588
                val (Xs_Ts, (Ts, raw_sets)) =
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
   589
                  filter (exists_subtype_in Xs o fst) (Xs_Ts0 ~~ (Ts0 ~~ raw_sets0))
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
   590
                  |> split_list ||> split_list;
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
   591
                val sets = map (mk_set Ts0) raw_sets;
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
   592
                val (ys, names_lthy') = names_lthy |> mk_Frees s Ts;
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
   593
                val xysets = map (pair x) (ys ~~ sets);
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
   594
                val ppremss = map2 (mk_raw_prem_prems names_lthy') ys Xs_Ts;
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
   595
              in
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
   596
                flat (map2 (map o apfst o cons) xysets ppremss)
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
   597
              end)
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
   598
          | mk_raw_prem_prems _ _ _ = [];
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   599
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   600
        fun close_prem_prem xs t =
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   601
          fold_rev Logic.all (map Free (drop (nn + length xs)
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   602
            (rev (Term.add_frees t (map dest_Free xs @ ps'))))) t;
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   603
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   604
        fun mk_prem_prem xs (xysets, (j, x)) =
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   605
          close_prem_prem xs (Logic.list_implies (map (fn (x', (y, set)) =>
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   606
              HOLogic.mk_Trueprop (HOLogic.mk_mem (y, set $ x'))) xysets,
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   607
            HOLogic.mk_Trueprop (nth ps (j - 1) $ x)));
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   608
52310
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
   609
        fun mk_raw_prem phi ctr ctr_Ts ctrXs_Ts =
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   610
          let
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   611
            val (xs, names_lthy') = names_lthy |> mk_Frees "x" ctr_Ts;
52310
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
   612
            val pprems = flat (map2 (mk_raw_prem_prems names_lthy') xs ctrXs_Ts);
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   613
          in (xs, pprems, HOLogic.mk_Trueprop (phi $ Term.list_comb (ctr, xs))) end;
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   614
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   615
        fun mk_prem (xs, raw_pprems, concl) =
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   616
          fold_rev Logic.all xs (Logic.list_implies (map (mk_prem_prem xs) raw_pprems, concl));
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   617
52310
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
   618
        val raw_premss = map4 (map3 o mk_raw_prem) ps ctrss ctr_Tsss ctrXs_Tsss;
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   619
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   620
        val goal =
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   621
          Library.foldr (Logic.list_implies o apfst (map mk_prem)) (raw_premss,
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   622
            HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj (map2 (curry (op $)) ps us)));
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   623
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   624
        val kksss = map (map (map (fst o snd) o #2)) raw_premss;
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   625
51814
blanchet
parents: 51813
diff changeset
   626
        val ctor_induct' = ctor_induct OF (map mk_sumEN_tupled_balanced mss);
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   627
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   628
        val thm =
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   629
          Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   630
            mk_induct_tac ctxt nn ns mss kksss (flat ctr_defss) ctor_induct' nested_set_map's
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   631
              pre_set_defss)
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   632
          |> singleton (Proof_Context.export names_lthy lthy)
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   633
          |> Thm.close_derivation;
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   634
      in
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   635
        `(conj_dests nn) thm
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   636
      end;
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   637
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   638
    val induct_cases = quasi_unambiguous_case_names (maps (map name_of_ctr) ctrss);
52305
3f7b92017d71 avoid code duplication
blanchet
parents: 52304
diff changeset
   639
    val induct_case_names_attr = Attrib.internal (K (Rule_Cases.case_names induct_cases));
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   640
52305
3f7b92017d71 avoid code duplication
blanchet
parents: 52304
diff changeset
   641
    val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss;
3f7b92017d71 avoid code duplication
blanchet
parents: 52304
diff changeset
   642
52306
blanchet
parents: 52305
diff changeset
   643
    fun mk_iter_thmss (_, x_Tssss, fss, _) iters iter_defs ctor_iter_thms =
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   644
      let
52305
3f7b92017d71 avoid code duplication
blanchet
parents: 52304
diff changeset
   645
        val fiters = map (lists_bmoc fss) iters;
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   646
51843
899663644482 rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents: 51842
diff changeset
   647
        fun mk_goal fss fiter xctr f xs fxs =
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   648
          fold_rev (fold_rev Logic.all) (xs :: fss)
51843
899663644482 rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents: 51842
diff changeset
   649
            (mk_Trueprop_eq (fiter $ xctr, Term.list_comb (f, fxs)));
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   650
52302
blanchet
parents: 52301
diff changeset
   651
        fun maybe_tick (T, U) u f =
blanchet
parents: 52301
diff changeset
   652
          if try (fst o HOLogic.dest_prodT) U = SOME T then
blanchet
parents: 52301
diff changeset
   653
            Term.lambda u (HOLogic.mk_prod (u, f $ u))
blanchet
parents: 52301
diff changeset
   654
          else
blanchet
parents: 52301
diff changeset
   655
            f;
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   656
52305
3f7b92017d71 avoid code duplication
blanchet
parents: 52304
diff changeset
   657
        fun unzip_iters (x as Free (_, T)) =
52301
7935e82a4ae4 simpler, more robust iterator goal construction code
blanchet
parents: 52300
diff changeset
   658
          map (fn U => if U = T then x else
52303
16d7708aba40 one less flaky "fpTs" check (flaky in the presence of duplicates in "fpTs", which we want to have in "primrec")
blanchet
parents: 52302
diff changeset
   659
            build_map lthy (indexify (perhaps (try (snd o HOLogic.dest_prodT)) o snd) Cs
52305
3f7b92017d71 avoid code duplication
blanchet
parents: 52304
diff changeset
   660
              (fn kk => fn TU => maybe_tick TU (nth us kk) (nth fiters kk))) (T, U) $ x);
52301
7935e82a4ae4 simpler, more robust iterator goal construction code
blanchet
parents: 52300
diff changeset
   661
52305
3f7b92017d71 avoid code duplication
blanchet
parents: 52304
diff changeset
   662
        val fxsss = map2 (map2 (flat_rec oo map2 unzip_iters)) xsss x_Tssss;
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   663
52306
blanchet
parents: 52305
diff changeset
   664
        val goalss = map5 (map4 o mk_goal fss) fiters xctrss fss xsss fxsss;
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   665
52305
3f7b92017d71 avoid code duplication
blanchet
parents: 52304
diff changeset
   666
        val tacss =
3f7b92017d71 avoid code duplication
blanchet
parents: 52304
diff changeset
   667
          map2 (map o mk_iter_tac pre_map_defs (nested_map_ids'' @ nesting_map_ids'') iter_defs)
3f7b92017d71 avoid code duplication
blanchet
parents: 52304
diff changeset
   668
            ctor_iter_thms ctr_defss;
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   669
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   670
        fun prove goal tac =
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   671
          Goal.prove_sorry lthy [] [] goal (tac o #context)
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   672
          |> Thm.close_derivation;
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   673
      in
52305
3f7b92017d71 avoid code duplication
blanchet
parents: 52304
diff changeset
   674
        map2 (map2 prove) goalss tacss
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   675
      end;
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   676
52340
blanchet
parents: 52339
diff changeset
   677
    val fold_thmss = mk_iter_thmss fold_args_types folds fold_defs (map un_fold_of ctor_iter_thmss);
blanchet
parents: 52339
diff changeset
   678
    val rec_thmss = mk_iter_thmss rec_args_types recs rec_defs (map co_rec_of ctor_iter_thmss);
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   679
  in
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   680
    ((induct_thm, induct_thms, [induct_case_names_attr]),
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   681
     (fold_thmss, code_simp_attrs), (rec_thmss, code_simp_attrs))
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   682
  end;
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   683
52341
blanchet
parents: 52340
diff changeset
   684
fun derive_coinduct_coiters_thms_for_types pre_bnfs (dtor_coiters1 :: _)
blanchet
parents: 52340
diff changeset
   685
    (cs, cpss,
blanchet
parents: 52340
diff changeset
   686
     [(unfold_args as (pgss, crssss, cgssss), _), (corec_args as (phss, csssss, chssss), _)])
blanchet
parents: 52340
diff changeset
   687
    dtor_coinduct dtor_strong_induct dtor_ctors dtor_coiter_thmss nesting_bnfs nested_bnfs fpTs Cs
blanchet
parents: 52340
diff changeset
   688
    As kss mss ns ctr_defss ctr_sugars coiterss coiter_defss lthy =
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   689
  let
52339
blanchet
parents: 52338
diff changeset
   690
    val coiterss' = transpose coiterss;
blanchet
parents: 52338
diff changeset
   691
    val coiter_defss' = transpose coiter_defss;
blanchet
parents: 52338
diff changeset
   692
blanchet
parents: 52338
diff changeset
   693
    val [unfolds, corecs] = coiterss';
blanchet
parents: 52338
diff changeset
   694
    val [unfold_defs, corec_defs] = coiter_defss';
52338
blanchet
parents: 52337
diff changeset
   695
51815
efacb9b99865 tune signatures
blanchet
parents: 51814
diff changeset
   696
    val nn = length pre_bnfs;
efacb9b99865 tune signatures
blanchet
parents: 51814
diff changeset
   697
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   698
    val pre_map_defs = map map_def_of_bnf pre_bnfs;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   699
    val pre_rel_defs = map rel_def_of_bnf pre_bnfs;
51830
blanchet
parents: 51829
diff changeset
   700
    val nesting_map_ids'' = map (unfold_thms lthy @{thms id_def} o map_id_of_bnf) nesting_bnfs;
blanchet
parents: 51829
diff changeset
   701
    val nesting_rel_eqs = map rel_eq_of_bnf nesting_bnfs;
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   702
    val nested_map_comp's = map map_comp'_of_bnf nested_bnfs;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   703
    val nested_map_comps'' = map ((fn thm => thm RS sym) o map_comp_of_bnf) nested_bnfs;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   704
    val nested_map_ids'' = map (unfold_thms lthy @{thms id_def} o map_id_of_bnf) nested_bnfs;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   705
51816
5f1dec4297da use base names, not full names
blanchet
parents: 51815
diff changeset
   706
    val fp_b_names = map base_name_of_typ fpTs;
51811
1461426e2bf1 tuned function signatures
blanchet
parents: 51810
diff changeset
   707
52339
blanchet
parents: 52338
diff changeset
   708
    val dtor_iter_fun_Tss' = map mk_fp_iter_fun_types dtor_coiters1;
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   709
51840
b304fb6c5ef5 renamed records
blanchet
parents: 51839
diff changeset
   710
    val ctrss = map (map (mk_ctr As) o #ctrs) ctr_sugars;
b304fb6c5ef5 renamed records
blanchet
parents: 51839
diff changeset
   711
    val discss = map (map (mk_disc_or_sel As) o #discs) ctr_sugars;
b304fb6c5ef5 renamed records
blanchet
parents: 51839
diff changeset
   712
    val selsss = map (map (map (mk_disc_or_sel As)) o #selss) ctr_sugars;
b304fb6c5ef5 renamed records
blanchet
parents: 51839
diff changeset
   713
    val exhausts = map #exhaust ctr_sugars;
b304fb6c5ef5 renamed records
blanchet
parents: 51839
diff changeset
   714
    val disc_thmsss = map #disc_thmss ctr_sugars;
b304fb6c5ef5 renamed records
blanchet
parents: 51839
diff changeset
   715
    val discIss = map #discIs ctr_sugars;
b304fb6c5ef5 renamed records
blanchet
parents: 51839
diff changeset
   716
    val sel_thmsss = map #sel_thmss ctr_sugars;
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   717
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   718
    val (((rs, us'), vs'), names_lthy) =
52341
blanchet
parents: 52340
diff changeset
   719
      lthy
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   720
      |> mk_Frees "R" (map (fn T => mk_pred2T T T) fpTs)
51816
5f1dec4297da use base names, not full names
blanchet
parents: 51815
diff changeset
   721
      ||>> Variable.variant_fixes fp_b_names
5f1dec4297da use base names, not full names
blanchet
parents: 51815
diff changeset
   722
      ||>> Variable.variant_fixes (map (suffix "'") fp_b_names);
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   723
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   724
    val us = map2 (curry Free) us' fpTs;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   725
    val udiscss = map2 (map o rapp) us discss;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   726
    val uselsss = map2 (map o map o rapp) us selsss;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   727
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   728
    val vs = map2 (curry Free) vs' fpTs;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   729
    val vdiscss = map2 (map o rapp) vs discss;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   730
    val vselsss = map2 (map o map o rapp) vs selsss;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   731
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   732
    val ((coinduct_thms, coinduct_thm), (strong_coinduct_thms, strong_coinduct_thm)) =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   733
      let
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   734
        val uvrs = map3 (fn r => fn u => fn v => r $ u $ v) rs us vs;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   735
        val uv_eqs = map2 (curry HOLogic.mk_eq) us vs;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   736
        val strong_rs =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   737
          map4 (fn u => fn v => fn uvr => fn uv_eq =>
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   738
            fold_rev Term.lambda [u, v] (HOLogic.mk_disj (uvr, uv_eq))) us vs uvrs uv_eqs;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   739
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   740
        fun build_rel rs' T =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   741
          (case find_index (curry (op =) T) fpTs of
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   742
            ~1 =>
51856
blanchet
parents: 51855
diff changeset
   743
            if exists_subtype_in fpTs T then
blanchet
parents: 51855
diff changeset
   744
              let
blanchet
parents: 51855
diff changeset
   745
                val Type (s, Ts) = T
blanchet
parents: 51855
diff changeset
   746
                val bnf = the (bnf_of lthy s);
blanchet
parents: 51855
diff changeset
   747
                val live = live_of_bnf bnf;
blanchet
parents: 51855
diff changeset
   748
                val rel = mk_rel live Ts Ts (rel_of_bnf bnf);
blanchet
parents: 51855
diff changeset
   749
                val Ts' = map domain_type (fst (strip_typeN live (fastype_of rel)));
blanchet
parents: 51855
diff changeset
   750
              in Term.list_comb (rel, map (build_rel rs') Ts') end
blanchet
parents: 51855
diff changeset
   751
            else
blanchet
parents: 51855
diff changeset
   752
              HOLogic.eq_const T
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   753
          | kk => nth rs' kk);
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   754
51856
blanchet
parents: 51855
diff changeset
   755
        fun build_rel_app rs' usel vsel = fold rapp [usel, vsel] (build_rel rs' (fastype_of usel));
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   756
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   757
        fun mk_prem_ctr_concls rs' n k udisc usels vdisc vsels =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   758
          (if k = n then [] else [HOLogic.mk_eq (udisc, vdisc)]) @
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   759
          (if null usels then
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   760
             []
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   761
           else
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   762
             [Library.foldr HOLogic.mk_imp (if n = 1 then [] else [udisc, vdisc],
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   763
                Library.foldr1 HOLogic.mk_conj (map2 (build_rel_app rs') usels vsels))]);
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   764
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   765
        fun mk_prem_concl rs' n udiscs uselss vdiscs vselss =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   766
          Library.foldr1 HOLogic.mk_conj
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   767
            (flat (map5 (mk_prem_ctr_concls rs' n) (1 upto n) udiscs uselss vdiscs vselss))
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   768
          handle List.Empty => @{term True};
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   769
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   770
        fun mk_prem rs' uvr u v n udiscs uselss vdiscs vselss =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   771
          fold_rev Logic.all [u, v] (Logic.mk_implies (HOLogic.mk_Trueprop uvr,
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   772
            HOLogic.mk_Trueprop (mk_prem_concl rs' n udiscs uselss vdiscs vselss)));
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   773
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   774
        val concl =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   775
          HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   776
            (map3 (fn uvr => fn u => fn v => HOLogic.mk_imp (uvr, HOLogic.mk_eq (u, v)))
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   777
               uvrs us vs));
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   778
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   779
        fun mk_goal rs' =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   780
          Logic.list_implies (map8 (mk_prem rs') uvrs us vs ns udiscss uselsss vdiscss vselsss,
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   781
            concl);
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   782
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   783
        val goal = mk_goal rs;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   784
        val strong_goal = mk_goal strong_rs;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   785
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   786
        fun prove dtor_coinduct' goal =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   787
          Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   788
            mk_coinduct_tac ctxt nesting_rel_eqs nn ns dtor_coinduct' pre_rel_defs dtor_ctors
51819
9df935196be9 use record instead of big tuple
blanchet
parents: 51816
diff changeset
   789
              exhausts ctr_defss disc_thmsss sel_thmsss)
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   790
          |> singleton (Proof_Context.export names_lthy lthy)
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   791
          |> Thm.close_derivation;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   792
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   793
        fun postproc nn thm =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   794
          Thm.permute_prems 0 nn
51828
67c6d6136915 whitespace tuning
blanchet
parents: 51827
diff changeset
   795
            (if nn = 1 then thm RS mp else funpow nn (fn thm => reassoc_conjs (thm RS mp_conj)) thm)
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   796
          |> Drule.zero_var_indexes
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   797
          |> `(conj_dests nn);
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   798
      in
51814
blanchet
parents: 51813
diff changeset
   799
        (postproc nn (prove dtor_coinduct goal), postproc nn (prove dtor_strong_induct strong_goal))
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   800
      end;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   801
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   802
    fun mk_coinduct_concls ms discs ctrs =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   803
      let
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   804
        fun mk_disc_concl disc = [name_of_disc disc];
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   805
        fun mk_ctr_concl 0 _ = []
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   806
          | mk_ctr_concl _ ctor = [name_of_ctr ctor];
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   807
        val disc_concls = map mk_disc_concl (fst (split_last discs)) @ [[]];
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   808
        val ctr_concls = map2 mk_ctr_concl ms ctrs;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   809
      in
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   810
        flat (map2 append disc_concls ctr_concls)
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   811
      end;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   812
51816
5f1dec4297da use base names, not full names
blanchet
parents: 51815
diff changeset
   813
    val coinduct_cases = quasi_unambiguous_case_names (map (prefix EqN) fp_b_names);
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   814
    val coinduct_conclss =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   815
      map3 (quasi_unambiguous_case_names ooo mk_coinduct_concls) mss discss ctrss;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   816
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   817
    fun mk_maybe_not pos = not pos ? HOLogic.mk_not;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   818
52339
blanchet
parents: 52338
diff changeset
   819
    val fcoiterss' as [gunfolds, hcorecs] =
blanchet
parents: 52338
diff changeset
   820
      map2 (fn (pfss, _, _) => map (lists_bmoc pfss)) [unfold_args, corec_args] coiterss';
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   821
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   822
    val (unfold_thmss, corec_thmss, safe_unfold_thmss, safe_corec_thmss) =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   823
      let
51843
899663644482 rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents: 51842
diff changeset
   824
        fun mk_goal pfss c cps fcoiter n k ctr m cfs' =
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   825
          fold_rev (fold_rev Logic.all) ([c] :: pfss)
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   826
            (Logic.list_implies (seq_conds (HOLogic.mk_Trueprop oo mk_maybe_not) n k cps,
51843
899663644482 rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents: 51842
diff changeset
   827
               mk_Trueprop_eq (fcoiter $ c, Term.list_comb (ctr, take m cfs'))));
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   828
52339
blanchet
parents: 52338
diff changeset
   829
        val substC = typ_subst_nonatomic (map2 pair Cs fpTs);
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   830
51843
899663644482 rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents: 51842
diff changeset
   831
        fun intr_coiters fcoiters [] [cf] =
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   832
            let val T = fastype_of cf in
51855
fcdf213d332c more code rationalization
blanchet
parents: 51854
diff changeset
   833
              if exists_subtype_in Cs T then
52339
blanchet
parents: 52338
diff changeset
   834
                build_map lthy (indexify fst Cs (K o nth fcoiters)) (T, substC T) $ cf
51855
fcdf213d332c more code rationalization
blanchet
parents: 51854
diff changeset
   835
              else
fcdf213d332c more code rationalization
blanchet
parents: 51854
diff changeset
   836
                cf
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   837
            end
51843
899663644482 rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents: 51842
diff changeset
   838
          | intr_coiters fcoiters [cq] [cf, cf'] =
899663644482 rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents: 51842
diff changeset
   839
            mk_If cq (intr_coiters fcoiters [] [cf]) (intr_coiters fcoiters [] [cf']);
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   840
52339
blanchet
parents: 52338
diff changeset
   841
        val [crgsss, cshsss] =
blanchet
parents: 52338
diff changeset
   842
          map2 (fn fcoiters => fn (_, cqssss, cfssss) =>
blanchet
parents: 52338
diff changeset
   843
              map2 (map2 (map2 (intr_coiters fcoiters))) cqssss cfssss)
blanchet
parents: 52338
diff changeset
   844
            fcoiterss' [unfold_args, corec_args];
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   845
51828
67c6d6136915 whitespace tuning
blanchet
parents: 51827
diff changeset
   846
        val unfold_goalss = map8 (map4 oooo mk_goal pgss) cs cpss gunfolds ns kss ctrss mss crgsss;
67c6d6136915 whitespace tuning
blanchet
parents: 51827
diff changeset
   847
        val corec_goalss = map8 (map4 oooo mk_goal phss) cs cpss hcorecs ns kss ctrss mss cshsss;
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   848
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   849
        fun mk_map_if_distrib bnf =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   850
          let
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   851
            val mapx = map_of_bnf bnf;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   852
            val live = live_of_bnf bnf;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   853
            val ((Ts, T), U) = strip_typeN (live + 1) (fastype_of mapx) |>> split_last;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   854
            val fs = Variable.variant_frees lthy [mapx] (map (pair "f") Ts);
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   855
            val t = Term.list_comb (mapx, map (Var o apfst (rpair 0)) fs);
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   856
          in
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   857
            Drule.instantiate' (map (SOME o certifyT lthy) [U, T]) [SOME (certify lthy t)]
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   858
              @{thm if_distrib}
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   859
          end;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   860
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   861
        val nested_map_if_distribs = map mk_map_if_distrib nested_bnfs;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   862
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   863
        val unfold_tacss =
51843
899663644482 rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents: 51842
diff changeset
   864
          map3 (map oo mk_coiter_tac unfold_defs [] [] nesting_map_ids'' [])
52340
blanchet
parents: 52339
diff changeset
   865
            (map un_fold_of dtor_coiter_thmss) pre_map_defs ctr_defss;
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   866
        val corec_tacss =
51843
899663644482 rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents: 51842
diff changeset
   867
          map3 (map oo mk_coiter_tac corec_defs nested_map_comps'' nested_map_comp's
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   868
              (nested_map_ids'' @ nesting_map_ids'') nested_map_if_distribs)
52340
blanchet
parents: 52339
diff changeset
   869
            (map co_rec_of dtor_coiter_thmss) pre_map_defs ctr_defss;
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   870
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   871
        fun prove goal tac =
51815
efacb9b99865 tune signatures
blanchet
parents: 51814
diff changeset
   872
          Goal.prove_sorry lthy [] [] goal (tac o #context)
efacb9b99865 tune signatures
blanchet
parents: 51814
diff changeset
   873
          |> Thm.close_derivation;
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   874
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   875
        val unfold_thmss = map2 (map2 prove) unfold_goalss unfold_tacss;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   876
        val corec_thmss = map2 (map2 prove) corec_goalss corec_tacss;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   877
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   878
        val filter_safesss =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   879
          map2 (map_filter (fn (safes, thm) => if forall I safes then SOME thm else NONE) oo
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   880
            curry (op ~~)) (map2 (map2 (map2 (member (op =)))) cgssss crgsss);
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   881
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   882
        val safe_unfold_thmss = filter_safesss unfold_thmss;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   883
        val safe_corec_thmss = filter_safesss corec_thmss;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   884
      in
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   885
        (unfold_thmss, corec_thmss, safe_unfold_thmss, safe_corec_thmss)
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   886
      end;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   887
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   888
    val (disc_unfold_iff_thmss, disc_corec_iff_thmss) =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   889
      let
51843
899663644482 rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents: 51842
diff changeset
   890
        fun mk_goal c cps fcoiter n k disc =
899663644482 rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents: 51842
diff changeset
   891
          mk_Trueprop_eq (disc $ (fcoiter $ c),
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   892
            if n = 1 then @{const True}
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   893
            else Library.foldr1 HOLogic.mk_conj (seq_conds mk_maybe_not n k cps));
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   894
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   895
        val unfold_goalss = map6 (map2 oooo mk_goal) cs cpss gunfolds ns kss discss;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   896
        val corec_goalss = map6 (map2 oooo mk_goal) cs cpss hcorecs ns kss discss;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   897
51828
67c6d6136915 whitespace tuning
blanchet
parents: 51827
diff changeset
   898
        fun mk_case_split' cp = Drule.instantiate' [] [SOME (certify lthy cp)] @{thm case_split};
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   899
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   900
        val case_splitss' = map (map mk_case_split') cpss;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   901
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   902
        val unfold_tacss =
51843
899663644482 rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents: 51842
diff changeset
   903
          map3 (map oo mk_disc_coiter_iff_tac) case_splitss' unfold_thmss disc_thmsss;
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   904
        val corec_tacss =
51843
899663644482 rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents: 51842
diff changeset
   905
          map3 (map oo mk_disc_coiter_iff_tac) case_splitss' corec_thmss disc_thmsss;
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   906
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   907
        fun prove goal tac =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   908
          Goal.prove_sorry lthy [] [] goal (tac o #context)
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   909
          |> singleton (Proof_Context.export names_lthy lthy)
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   910
          |> Thm.close_derivation;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   911
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   912
        fun proves [_] [_] = []
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   913
          | proves goals tacs = map2 prove goals tacs;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   914
      in
51828
67c6d6136915 whitespace tuning
blanchet
parents: 51827
diff changeset
   915
        (map2 proves unfold_goalss unfold_tacss, map2 proves corec_goalss corec_tacss)
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   916
      end;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   917
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   918
    val is_triv_discI = is_triv_implies orf is_concl_refl;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   919
51843
899663644482 rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents: 51842
diff changeset
   920
    fun mk_disc_coiter_thms coiters discIs =
899663644482 rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents: 51842
diff changeset
   921
      map (op RS) (filter_out (is_triv_discI o snd) (coiters ~~ discIs));
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   922
51843
899663644482 rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents: 51842
diff changeset
   923
    val disc_unfold_thmss = map2 mk_disc_coiter_thms unfold_thmss discIss;
899663644482 rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents: 51842
diff changeset
   924
    val disc_corec_thmss = map2 mk_disc_coiter_thms corec_thmss discIss;
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   925
51843
899663644482 rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents: 51842
diff changeset
   926
    fun mk_sel_coiter_thm coiter_thm sel sel_thm =
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   927
      let
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   928
        val (domT, ranT) = dest_funT (fastype_of sel);
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   929
        val arg_cong' =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   930
          Drule.instantiate' (map (SOME o certifyT lthy) [domT, ranT])
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   931
            [NONE, NONE, SOME (certify lthy sel)] arg_cong
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   932
          |> Thm.varifyT_global;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   933
        val sel_thm' = sel_thm RSN (2, trans);
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   934
      in
51843
899663644482 rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents: 51842
diff changeset
   935
        coiter_thm RS arg_cong' RS sel_thm'
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   936
      end;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   937
52321
blanchet
parents: 52320
diff changeset
   938
    fun mk_sel_coiter_thms coiter_thmss =
blanchet
parents: 52320
diff changeset
   939
      map3 (map3 (map2 o mk_sel_coiter_thm)) coiter_thmss selsss sel_thmsss |> map flat;
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   940
51843
899663644482 rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents: 51842
diff changeset
   941
    val sel_unfold_thmss = mk_sel_coiter_thms unfold_thmss;
899663644482 rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents: 51842
diff changeset
   942
    val sel_corec_thmss = mk_sel_coiter_thms corec_thmss;
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   943
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   944
    val coinduct_consumes_attr = Attrib.internal (K (Rule_Cases.consumes nn));
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   945
    val coinduct_case_names_attr = Attrib.internal (K (Rule_Cases.case_names coinduct_cases));
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   946
    val coinduct_case_concl_attrs =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   947
      map2 (fn casex => fn concls =>
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   948
          Attrib.internal (K (Rule_Cases.case_conclusion (casex, concls))))
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   949
        coinduct_cases coinduct_conclss;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   950
    val coinduct_case_attrs =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   951
      coinduct_consumes_attr :: coinduct_case_names_attr :: coinduct_case_concl_attrs;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   952
  in
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   953
    ((coinduct_thm, coinduct_thms, strong_coinduct_thm, strong_coinduct_thms, coinduct_case_attrs),
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   954
     (unfold_thmss, corec_thmss, []),
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   955
     (safe_unfold_thmss, safe_corec_thmss),
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   956
     (disc_unfold_thmss, disc_corec_thmss, simp_attrs),
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   957
     (disc_unfold_iff_thmss, disc_corec_iff_thmss, simp_attrs),
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   958
     (sel_unfold_thmss, sel_corec_thmss, simp_attrs))
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   959
  end;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   960
52207
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
   961
fun define_co_datatypes prepare_constraint prepare_typ prepare_term fp construct_fp
49633
5b5450bc544c compatibility option to use "rep_datatype"
blanchet
parents: 49622
diff changeset
   962
    (wrap_opts as (no_dests, rep_compat), specs) no_defs_lthy0 =
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   963
  let
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   964
    (* TODO: sanity checks on arguments *)
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   965
52207
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
   966
    val _ = if fp = Greatest_FP andalso no_dests then
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
   967
        error "Cannot define destructor-less codatatypes"
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
   968
      else
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
   969
        ();
49278
718e4ad1517e added no_dests option
blanchet
parents: 49277
diff changeset
   970
49633
5b5450bc544c compatibility option to use "rep_datatype"
blanchet
parents: 49622
diff changeset
   971
    fun qualify mandatory fp_b_name =
5b5450bc544c compatibility option to use "rep_datatype"
blanchet
parents: 49622
diff changeset
   972
      Binding.qualify mandatory fp_b_name o (rep_compat ? Binding.qualify false rep_compat_prefix);
5b5450bc544c compatibility option to use "rep_datatype"
blanchet
parents: 49622
diff changeset
   973
49367
blanchet
parents: 49366
diff changeset
   974
    val nn = length specs;
49361
cc1d39529dd1 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents: 49342
diff changeset
   975
    val fp_bs = map type_binding_of specs;
49498
acc583e14167 tuned variable names
blanchet
parents: 49484
diff changeset
   976
    val fp_b_names = map Binding.name_of fp_bs;
acc583e14167 tuned variable names
blanchet
parents: 49484
diff changeset
   977
    val fp_common_name = mk_common_name fp_b_names;
51758
55963309557b honor user-specified name for map function
blanchet
parents: 51757
diff changeset
   978
    val map_bs = map map_binding_of specs;
51767
bbcdd8519253 honor user-specified name for relator + generalize syntax
blanchet
parents: 51766
diff changeset
   979
    val rel_bs = map rel_binding_of specs;
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   980
51758
55963309557b honor user-specified name for map function
blanchet
parents: 51757
diff changeset
   981
    fun prepare_type_arg (_, (ty, c)) =
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   982
      let val TFree (s, _) = prepare_typ no_defs_lthy0 ty in
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   983
        TFree (s, prepare_constraint no_defs_lthy0 c)
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   984
      end;
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   985
51758
55963309557b honor user-specified name for map function
blanchet
parents: 51757
diff changeset
   986
    val Ass0 = map (map prepare_type_arg o type_args_named_constrained_of) specs;
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   987
    val unsorted_Ass0 = map (map (resort_tfree HOLogic.typeS)) Ass0;
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   988
    val unsorted_As = Library.foldr1 merge_type_args unsorted_Ass0;
51758
55963309557b honor user-specified name for map function
blanchet
parents: 51757
diff changeset
   989
    val set_bss = map (map fst o type_args_named_constrained_of) specs;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   990
49585
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   991
    val (((Bs0, Cs), Xs), no_defs_lthy) =
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   992
      no_defs_lthy0
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   993
      |> fold (Variable.declare_typ o resort_tfree dummyS) unsorted_As
49585
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   994
      |> mk_TFrees (length unsorted_As)
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   995
      ||>> mk_TFrees nn
51858
7a08fe1e19b1 added and moved library functions (used in primrec code)
blanchet
parents: 51857
diff changeset
   996
      ||>> variant_tfrees fp_b_names;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   997
52195
056ec8201667 clean up list of theorems
blanchet
parents: 52173
diff changeset
   998
    (* TODO: Cleaner handling of fake contexts, without "background_theory". The case where the new
056ec8201667 clean up list of theorems
blanchet
parents: 52173
diff changeset
   999
       type is defined in a locale and shadows an existing global type is currently not handled. *)
51768
d2a236b10796 proper error generated for wrong mixfix
blanchet
parents: 51767
diff changeset
  1000
51769
5c657ca97d99 simplified code -- no need for two attempts, the error we get from mixfix the first time is good (and better to get than a parse error in the specification because the user tries to use a mixfix that silently failed)
blanchet
parents: 51768
diff changeset
  1001
    fun add_fake_type spec =
51768
d2a236b10796 proper error generated for wrong mixfix
blanchet
parents: 51767
diff changeset
  1002
      Sign.add_type no_defs_lthy (type_binding_of spec,
51769
5c657ca97d99 simplified code -- no need for two attempts, the error we get from mixfix the first time is good (and better to get than a parse error in the specification because the user tries to use a mixfix that silently failed)
blanchet
parents: 51768
diff changeset
  1003
        length (type_args_named_constrained_of spec), mixfix_of spec);
51768
d2a236b10796 proper error generated for wrong mixfix
blanchet
parents: 51767
diff changeset
  1004
51769
5c657ca97d99 simplified code -- no need for two attempts, the error we get from mixfix the first time is good (and better to get than a parse error in the specification because the user tries to use a mixfix that silently failed)
blanchet
parents: 51768
diff changeset
  1005
    val fake_thy = Theory.copy #> fold add_fake_type specs;
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
  1006
    val fake_lthy = Proof_Context.background_theory fake_thy no_defs_lthy;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
  1007
49182
b8517107ffc5 read the real types off the constant types, rather than using the fake parser types (second step of sugar localization)
blanchet
parents: 49181
diff changeset
  1008
    fun mk_fake_T b =
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
  1009
      Type (fst (Term.dest_Type (Proof_Context.read_type_name fake_lthy true (Binding.name_of b))),
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
  1010
        unsorted_As);
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
  1011
49302
f5bd87aac224 added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents: 49300
diff changeset
  1012
    val fake_Ts = map mk_fake_T fp_bs;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
  1013
49181
blanchet
parents: 49180
diff changeset
  1014
    val mixfixes = map mixfix_of specs;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
  1015
49302
f5bd87aac224 added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents: 49300
diff changeset
  1016
    val _ = (case duplicates Binding.eq_name fp_bs of [] => ()
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
  1017
      | b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b)));
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
  1018
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
  1019
    val ctr_specss = map ctr_specs_of specs;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
  1020
49336
blanchet
parents: 49330
diff changeset
  1021
    val disc_bindingss = map (map disc_of) ctr_specss;
blanchet
parents: 49330
diff changeset
  1022
    val ctr_bindingss =
49633
5b5450bc544c compatibility option to use "rep_datatype"
blanchet
parents: 49622
diff changeset
  1023
      map2 (fn fp_b_name => map (qualify false fp_b_name o ctr_of)) fp_b_names ctr_specss;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
  1024
    val ctr_argsss = map (map args_of) ctr_specss;
49181
blanchet
parents: 49180
diff changeset
  1025
    val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
  1026
49336
blanchet
parents: 49330
diff changeset
  1027
    val sel_bindingsss = map (map (map fst)) ctr_argsss;
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
  1028
    val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss;
49286
dde4967c9233 added "defaults" option
blanchet
parents: 49280
diff changeset
  1029
    val raw_sel_defaultsss = map (map defaults_of) ctr_specss;
dde4967c9233 added "defaults" option
blanchet
parents: 49280
diff changeset
  1030
49308
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents: 49302
diff changeset
  1031
    val (As :: _) :: fake_ctr_Tsss =
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
  1032
      burrow (burrow (Syntax.check_typs fake_lthy)) (Ass0 :: fake_ctr_Tsss0);
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
  1033
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
  1034
    val _ = (case duplicates (op =) unsorted_As of [] => ()
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
  1035
      | A :: _ => error ("Duplicate type parameter " ^
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
  1036
          quote (Syntax.string_of_typ no_defs_lthy A)));
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
  1037
49183
0cc46e2dee7e careful about constructor types w.r.t. fake context (third step of localization)
blanchet
parents: 49182
diff changeset
  1038
    val rhs_As' = fold (fold (fold Term.add_tfreesT)) fake_ctr_Tsss [];
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
  1039
    val _ = (case subtract (op =) (map dest_TFree As) rhs_As' of
49165
c6ccaf6df93c check type variables on rhs
blanchet
parents: 49161
diff changeset
  1040
        [] => ()
49342
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
  1041
      | A' :: _ => error ("Extra type variable on right-hand side: " ^
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
  1042
          quote (Syntax.string_of_typ no_defs_lthy (TFree A'))));
49165
c6ccaf6df93c check type variables on rhs
blanchet
parents: 49161
diff changeset
  1043
49591
91b228e26348 generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents: 49590
diff changeset
  1044
    fun eq_fpT_check (T as Type (s, Us)) (Type (s', Us')) =
49146
e32b1f748854 added a check
blanchet
parents: 49135
diff changeset
  1045
        s = s' andalso (Us = Us' orelse error ("Illegal occurrence of recursive type " ^
e32b1f748854 added a check
blanchet
parents: 49135
diff changeset
  1046
          quote (Syntax.string_of_typ fake_lthy T)))
49591
91b228e26348 generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents: 49590
diff changeset
  1047
      | eq_fpT_check _ _ = false;
49146
e32b1f748854 added a check
blanchet
parents: 49135
diff changeset
  1048
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
  1049
    fun freeze_fp (T as Type (s, Us)) =
49591
91b228e26348 generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents: 49590
diff changeset
  1050
        (case find_index (eq_fpT_check T) fake_Ts of
91b228e26348 generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents: 49590
diff changeset
  1051
          ~1 => Type (s, map freeze_fp Us)
91b228e26348 generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents: 49590
diff changeset
  1052
        | kk => nth Xs kk)
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
  1053
      | freeze_fp T = T;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
  1054
52310
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
  1055
    val ctrXs_Tsss = map (map (map freeze_fp)) fake_ctr_Tsss;
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
  1056
    val ctrXs_sum_prod_Ts = map (mk_sumTN_balanced o map HOLogic.mk_tupleT) ctrXs_Tsss;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
  1057
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
  1058
    val fp_eqs =
52310
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
  1059
      map dest_TFree Xs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctrXs_sum_prod_Ts;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
  1060
51839
5c552de1d8d1 added constructors to data structure
blanchet
parents: 51838
diff changeset
  1061
    val (pre_bnfs, (fp_res as {bnfs = fp_bnfs as any_fp_bnf :: _, ctors = ctors0, dtors = dtors0,
52328
2f286a2b7f98 [mq]: tuning
blanchet
parents: 52327
diff changeset
  1062
           xtor_co_iterss = xtor_co_iterss0, xtor_co_induct, xtor_strong_co_induct, dtor_ctors,
2f286a2b7f98 [mq]: tuning
blanchet
parents: 52327
diff changeset
  1063
           ctor_dtors, ctor_injects, xtor_map_thms, xtor_set_thmss, xtor_rel_thms,
2f286a2b7f98 [mq]: tuning
blanchet
parents: 52327
diff changeset
  1064
           xtor_co_iter_thmss, ...}, lthy)) =
51868
4ab609682752 code tuning
blanchet
parents: 51867
diff changeset
  1065
      fp_bnf (construct_fp mixfixes map_bs rel_bs set_bss) fp_bs (map dest_TFree unsorted_As) fp_eqs
4ab609682752 code tuning
blanchet
parents: 51867
diff changeset
  1066
        no_defs_lthy0;
49585
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1067
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1068
    val timer = time (Timer.startRealTimer ());
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
  1069
52310
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
  1070
    val nesting_bnfs = nesty_bnfs lthy ctrXs_Tsss As;
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
  1071
    val nested_bnfs = nesty_bnfs lthy ctrXs_Tsss Xs;
49226
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
  1072
49585
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1073
    val pre_map_defs = map map_def_of_bnf pre_bnfs;
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1074
    val pre_set_defss = map set_defs_of_bnf pre_bnfs;
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1075
    val pre_rel_defs = map rel_def_of_bnf pre_bnfs;
51830
blanchet
parents: 51829
diff changeset
  1076
    val nesting_set_map's = maps set_map'_of_bnf nesting_bnfs;
51766
f19a4d0ab1bf renamed "set_natural" to "set_map", reflecting {Bl,Po,Tr} concensus
blanchet
parents: 51758
diff changeset
  1077
    val nested_set_map's = maps set_map'_of_bnf nested_bnfs;
49585
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1078
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1079
    val live = live_of_bnf any_fp_bnf;
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1080
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1081
    val Bs =
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1082
      map3 (fn alive => fn A as TFree (_, S) => fn B => if alive then resort_tfree S B else A)
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1083
        (liveness_of_fp_bnf (length As) any_fp_bnf) As Bs0;
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1084
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1085
    val B_ify = Term.typ_subst_atomic (As ~~ Bs);
49167
68623861e0f2 print timing information
blanchet
parents: 49165
diff changeset
  1086
49501
acc9635a644a renamed "fld"/"unf" to "ctor"/"dtor"
blanchet
parents: 49498
diff changeset
  1087
    val ctors = map (mk_ctor As) ctors0;
acc9635a644a renamed "fld"/"unf" to "ctor"/"dtor"
blanchet
parents: 49498
diff changeset
  1088
    val dtors = map (mk_dtor As) dtors0;
49124
968e1b7de057 more work on FP sugar
blanchet
parents: 49123
diff changeset
  1089
49501
acc9635a644a renamed "fld"/"unf" to "ctor"/"dtor"
blanchet
parents: 49498
diff changeset
  1090
    val fpTs = map (domain_type o fastype_of) dtors;
49362
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
  1091
51780
67e4ed510dfb register coinductive type's coinduct rule
blanchet
parents: 51777
diff changeset
  1092
    fun massage_simple_notes base =
67e4ed510dfb register coinductive type's coinduct rule
blanchet
parents: 51777
diff changeset
  1093
      filter_out (null o #2)
67e4ed510dfb register coinductive type's coinduct rule
blanchet
parents: 51777
diff changeset
  1094
      #> map (fn (thmN, thms, attrs) =>
67e4ed510dfb register coinductive type's coinduct rule
blanchet
parents: 51777
diff changeset
  1095
        ((qualify true base (Binding.name thmN), attrs), [(thms, [])]));
67e4ed510dfb register coinductive type's coinduct rule
blanchet
parents: 51777
diff changeset
  1096
67e4ed510dfb register coinductive type's coinduct rule
blanchet
parents: 51777
diff changeset
  1097
    val massage_multi_notes =
67e4ed510dfb register coinductive type's coinduct rule
blanchet
parents: 51777
diff changeset
  1098
      maps (fn (thmN, thmss, attrs) =>
67e4ed510dfb register coinductive type's coinduct rule
blanchet
parents: 51777
diff changeset
  1099
        if forall null thmss then
67e4ed510dfb register coinductive type's coinduct rule
blanchet
parents: 51777
diff changeset
  1100
          []
67e4ed510dfb register coinductive type's coinduct rule
blanchet
parents: 51777
diff changeset
  1101
        else
67e4ed510dfb register coinductive type's coinduct rule
blanchet
parents: 51777
diff changeset
  1102
          map3 (fn fp_b_name => fn Type (T_name, _) => fn thms =>
52311
e2f6ac15d79a tuned signature
blanchet
parents: 52310
diff changeset
  1103
              ((qualify true fp_b_name (Binding.name thmN), attrs T_name), [(thms, [])]))
e2f6ac15d79a tuned signature
blanchet
parents: 52310
diff changeset
  1104
            fp_b_names fpTs thmss);
51780
67e4ed510dfb register coinductive type's coinduct rule
blanchet
parents: 51777
diff changeset
  1105
52310
28063e412793 support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents: 52309
diff changeset
  1106
    val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctrXs_Tsss;
49203
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
  1107
    val ns = map length ctr_Tsss;
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
  1108
    val kss = map (fn n => 1 upto n) ns;
49203
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
  1109
    val mss = map (map length) ctr_Tsss;
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
  1110
52334
blanchet
parents: 52330
diff changeset
  1111
    val ((xtor_co_iterss, iters_args_types, coiters_args_types), lthy) =
blanchet
parents: 52330
diff changeset
  1112
      mk_co_iters_prelims fp fpTs Cs ns mss xtor_co_iterss0 lthy;
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
  1113
52328
2f286a2b7f98 [mq]: tuning
blanchet
parents: 52327
diff changeset
  1114
    fun define_ctrs_case_for_type ((((((((((((((((((((((((fp_bnf, fp_b), fpT), C), ctor), dtor),
2f286a2b7f98 [mq]: tuning
blanchet
parents: 52327
diff changeset
  1115
              xtor_co_iters), ctor_dtor), dtor_ctor), ctor_inject), pre_map_def), pre_set_defs),
2f286a2b7f98 [mq]: tuning
blanchet
parents: 52327
diff changeset
  1116
            pre_rel_def), fp_map_thm), fp_set_thms), fp_rel_thm), n), ks), ms), ctr_bindings),
2f286a2b7f98 [mq]: tuning
blanchet
parents: 52327
diff changeset
  1117
          ctr_mixfixes), ctr_Tss), disc_bindings), sel_bindingss), raw_sel_defaultss) no_defs_lthy =
49176
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
  1118
      let
49498
acc583e14167 tuned variable names
blanchet
parents: 49484
diff changeset
  1119
        val fp_b_name = Binding.name_of fp_b;
acc583e14167 tuned variable names
blanchet
parents: 49484
diff changeset
  1120
49501
acc9635a644a renamed "fld"/"unf" to "ctor"/"dtor"
blanchet
parents: 49498
diff changeset
  1121
        val dtorT = domain_type (fastype_of ctor);
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
  1122
        val ctr_prod_Ts = map HOLogic.mk_tupleT ctr_Tss;
49255
2ecc533d6697 use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents: 49254
diff changeset
  1123
        val ctr_sum_prod_T = mk_sumTN_balanced ctr_prod_Ts;
49134
846264f80f16 optionally provide extra dead variables to the FP constructions
blanchet
parents: 49130
diff changeset
  1124
        val case_Ts = map (fn Ts => Ts ---> C) ctr_Tss;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
  1125
49593
c958f282b382 get rid of shaky "Thm.generalize"
blanchet
parents: 49592
diff changeset
  1126
        val (((((w, fs), xss), yss), u'), names_lthy) =
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
  1127
          no_defs_lthy
49501
acc9635a644a renamed "fld"/"unf" to "ctor"/"dtor"
blanchet
parents: 49498
diff changeset
  1128
          |> yield_singleton (mk_Frees "w") dtorT
49176
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
  1129
          ||>> mk_Frees "f" case_Ts
49370
be6e749fd003 fixed variable exporting problem
blanchet
parents: 49368
diff changeset
  1130
          ||>> mk_Freess "x" ctr_Tss
49585
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1131
          ||>> mk_Freess "y" (map (map B_ify) ctr_Tss)
49498
acc583e14167 tuned variable names
blanchet
parents: 49484
diff changeset
  1132
          ||>> yield_singleton Variable.variant_fixes fp_b_name;
49370
be6e749fd003 fixed variable exporting problem
blanchet
parents: 49368
diff changeset
  1133
49498
acc583e14167 tuned variable names
blanchet
parents: 49484
diff changeset
  1134
        val u = Free (u', fpT);
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
  1135
49585
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1136
        val tuple_xs = map HOLogic.mk_tuple xss;
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1137
        val tuple_ys = map HOLogic.mk_tuple yss;
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1138
49129
b5413cb7d860 define "case" constant
blanchet
parents: 49127
diff changeset
  1139
        val ctr_rhss =
49585
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1140
          map3 (fn k => fn xs => fn tuple_x => fold_rev Term.lambda xs (ctor $
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1141
            mk_InN_balanced ctr_sum_prod_T n tuple_x k)) ks xss tuple_xs;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
  1142
49633
5b5450bc544c compatibility option to use "rep_datatype"
blanchet
parents: 49622
diff changeset
  1143
        val case_binding = qualify false fp_b_name (Binding.suffix_name ("_" ^ caseN) fp_b);
49129
b5413cb7d860 define "case" constant
blanchet
parents: 49127
diff changeset
  1144
49134
846264f80f16 optionally provide extra dead variables to the FP constructions
blanchet
parents: 49130
diff changeset
  1145
        val case_rhs =
49498
acc583e14167 tuned variable names
blanchet
parents: 49484
diff changeset
  1146
          fold_rev Term.lambda (fs @ [u])
49501
acc9635a644a renamed "fld"/"unf" to "ctor"/"dtor"
blanchet
parents: 49498
diff changeset
  1147
            (mk_sum_caseN_balanced (map2 mk_uncurried_fun fs xss) $ (dtor $ u));
49129
b5413cb7d860 define "case" constant
blanchet
parents: 49127
diff changeset
  1148
49201
blanchet
parents: 49200
diff changeset
  1149
        val ((raw_case :: raw_ctrs, raw_case_def :: raw_ctr_defs), (lthy', lthy)) = no_defs_lthy
49169
937a0fadddfb honor mixfix specifications
blanchet
parents: 49167
diff changeset
  1150
          |> apfst split_list o fold_map3 (fn b => fn mx => fn rhs =>
49302
f5bd87aac224 added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents: 49300
diff changeset
  1151
              Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd)
49336
blanchet
parents: 49330
diff changeset
  1152
            (case_binding :: ctr_bindings) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss)
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
  1153
          ||> `Local_Theory.restore;
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
  1154
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
  1155
        val phi = Proof_Context.export_morphism lthy lthy';
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
  1156
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
  1157
        val ctr_defs = map (Morphism.thm phi) raw_ctr_defs;
49585
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1158
        val ctr_defs' =
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1159
          map2 (fn m => fn def => mk_unabs_def m (def RS meta_eq_to_obj_eq)) ms ctr_defs;
49130
3c26e17b2849 implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents: 49129
diff changeset
  1160
        val case_def = Morphism.thm phi raw_case_def;
3c26e17b2849 implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents: 49129
diff changeset
  1161
49203
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
  1162
        val ctrs0 = map (Morphism.term phi) raw_ctrs;
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
  1163
        val casex0 = Morphism.term phi raw_case;
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
  1164
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
  1165
        val ctrs = map (mk_ctr As) ctrs0;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
  1166
51897
9a27c870ee21 refactoring
blanchet
parents: 51896
diff changeset
  1167
        fun wrap_ctrs lthy =
49123
263b0e330d8b more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents: 49121
diff changeset
  1168
          let
50170
8155e280f239 made SML/NJ happier
traytel
parents: 49693
diff changeset
  1169
            fun exhaust_tac {context = ctxt, prems = _} =
49135
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
  1170
              let
49585
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1171
                val ctor_iff_dtor_thm =
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1172
                  let
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1173
                    val goal =
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1174
                      fold_rev Logic.all [w, u]
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1175
                        (mk_Trueprop_eq (HOLogic.mk_eq (u, ctor $ w), HOLogic.mk_eq (dtor $ u, w)));
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1176
                  in
51551
88d1d19fb74f tuned signature and module arrangement;
wenzelm
parents: 51380
diff changeset
  1177
                    Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
49585
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1178
                      mk_ctor_iff_dtor_tac ctxt (map (SOME o certifyT lthy) [dtorT, fpT])
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1179
                        (certify lthy ctor) (certify lthy dtor) ctor_dtor dtor_ctor)
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1180
                    |> Thm.close_derivation
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1181
                    |> Morphism.thm phi
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1182
                  end;
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1183
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1184
                val sumEN_thm' =
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1185
                  unfold_thms lthy @{thms all_unit_eq}
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1186
                    (Drule.instantiate' (map (SOME o certifyT lthy) ctr_prod_Ts) []