src/HOL/Tools/BNF/bnf_fp_def_sugar.ML
author desharna
Wed, 16 Jul 2014 10:13:00 +0200
changeset 57563 e3e7c86168b4
parent 57562 c1238062184b
child 57565 ab7f39114507
permissions -rw-r--r--
generate 'rel_sel' theorem for (co)datatypes
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
55061
a0adf838e2d1 adjusted comments
blanchet
parents: 55060
diff changeset
     1
(*  Title:      HOL/Tools/BNF/bnf_fp_def_sugar.ML
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
     2
    Author:     Jasmin Blanchette, TU Muenchen
52349
07fd21c01e93 code simplifications (cf. 78a3d5006cf1)
blanchet
parents: 52348
diff changeset
     3
    Copyright   2012, 2013
49112
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
56650
1f9ab71d43a5 no need to make 'size' generation an interpretation -- overkill
blanchet
parents: 56648
diff changeset
    10
  val fp_sugar_of: Proof.context -> string -> BNF_FP_Util.fp_sugar option
1f9ab71d43a5 no need to make 'size' generation an interpretation -- overkill
blanchet
parents: 56648
diff changeset
    11
  val fp_sugars_of: Proof.context -> BNF_FP_Util.fp_sugar list
1f9ab71d43a5 no need to make 'size' generation an interpretation -- overkill
blanchet
parents: 56648
diff changeset
    12
  val fp_sugar_interpretation: (BNF_FP_Util.fp_sugar list -> theory -> theory) -> theory -> theory
1f9ab71d43a5 no need to make 'size' generation an interpretation -- overkill
blanchet
parents: 56648
diff changeset
    13
  val register_fp_sugars: BNF_FP_Util.fp_sugar list -> local_theory -> local_theory
51852
23d938495367 refactoring
blanchet
parents: 51850
diff changeset
    14
53106
d81211f61a1b moved derivation of strong coinduction to sugar
traytel
parents: 53037
diff changeset
    15
  val co_induct_of: 'a list -> 'a
d81211f61a1b moved derivation of strong coinduction to sugar
traytel
parents: 53037
diff changeset
    16
  val strong_co_induct_of: 'a list -> 'a
d81211f61a1b moved derivation of strong coinduction to sugar
traytel
parents: 53037
diff changeset
    17
52868
cca9e958da5c export ML function (for primcorec)
blanchet
parents: 52823
diff changeset
    18
  val flat_corec_preds_predsss_gettersss: 'a list -> 'a list list list -> 'a list list list ->
cca9e958da5c export ML function (for primcorec)
blanchet
parents: 52823
diff changeset
    19
    'a list
57397
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
    20
  val nesting_bnfs: Proof.context -> typ list list list -> typ list -> BNF_Def.bnf list
53746
bd038e48526d have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents: 53741
diff changeset
    21
bd038e48526d have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents: 53741
diff changeset
    22
  type lfp_sugar_thms =
55856
bddaada24074 got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents: 55803
diff changeset
    23
    (thm list * thm * Args.src list) * (thm list list * Args.src list)
53746
bd038e48526d have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents: 53741
diff changeset
    24
54256
4843082be7ef added some N2M caching
blanchet
parents: 54253
diff changeset
    25
  val morph_lfp_sugar_thms: morphism -> lfp_sugar_thms -> lfp_sugar_thms
4843082be7ef added some N2M caching
blanchet
parents: 54253
diff changeset
    26
  val transfer_lfp_sugar_thms: Proof.context -> lfp_sugar_thms -> lfp_sugar_thms
4843082be7ef added some N2M caching
blanchet
parents: 54253
diff changeset
    27
53746
bd038e48526d have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents: 53741
diff changeset
    28
  type gfp_sugar_thms =
57260
8747af0d1012 fixed postprocessing of 'coinduct' formula to obtain right property format (without needless hypotheses)
blanchet
parents: 57206
diff changeset
    29
    ((thm list * thm) list * (Args.src list * Args.src list))
57489
8f0ba9f2d10f generate 'corec_code' theorem for codatatypes
desharna
parents: 57471
diff changeset
    30
    * thm list list
8f0ba9f2d10f generate 'corec_code' theorem for codatatypes
desharna
parents: 57471
diff changeset
    31
    * thm list list
55856
bddaada24074 got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents: 55803
diff changeset
    32
    * (thm list list * Args.src list)
bddaada24074 got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents: 55803
diff changeset
    33
    * (thm list list list * Args.src list)
53746
bd038e48526d have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents: 53741
diff changeset
    34
54256
4843082be7ef added some N2M caching
blanchet
parents: 54253
diff changeset
    35
  val morph_gfp_sugar_thms: morphism -> gfp_sugar_thms -> gfp_sugar_thms
4843082be7ef added some N2M caching
blanchet
parents: 54253
diff changeset
    36
  val transfer_gfp_sugar_thms: Proof.context -> gfp_sugar_thms -> gfp_sugar_thms
4843082be7ef added some N2M caching
blanchet
parents: 54253
diff changeset
    37
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
    38
  val mk_co_recs_prelims: BNF_Util.fp_kind -> typ list list list -> typ list -> typ list ->
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
    39
     typ list -> typ list -> int list -> int list list -> term list -> Proof.context ->
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
    40
     (term list
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
    41
      * (typ list list * typ list list list list * term list list * term list list list list) option
55862
b458558cbcc2 optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents: 55861
diff changeset
    42
      * (string * term list * term list list
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
    43
         * ((term list list * term list list list) * typ list)) option)
55862
b458558cbcc2 optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents: 55861
diff changeset
    44
     * Proof.context
55772
367ec44763fd correct most general type for mutual recursion when several identical types are involved
blanchet
parents: 55701
diff changeset
    45
  val repair_nullary_single_ctr: typ list list -> typ list list
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
    46
  val mk_corec_p_pred_types: typ list -> int list -> typ list list
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
    47
  val mk_corec_fun_arg_types: typ list list list -> typ list -> typ list -> typ list -> int list ->
55803
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
    48
    int list list -> term ->
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
    49
    typ list list
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
    50
    * (typ list list list list * typ list list list * typ list list list list * typ list)
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
    51
  val define_rec:
56641
029997d3b5d8 reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents: 56640
diff changeset
    52
    typ list list * typ list list list list * term list list * term list list list list ->
55862
b458558cbcc2 optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents: 55861
diff changeset
    53
    (string -> binding) -> typ list -> typ list -> term list -> term -> Proof.context ->
55864
516ab2906e7e rationalized internals
blanchet
parents: 55863
diff changeset
    54
    (term * thm) * Proof.context
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
    55
  val define_corec: 'a * term list * term list list
55862
b458558cbcc2 optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents: 55861
diff changeset
    56
      * ((term list list * term list list list) * typ list) -> (string -> binding) -> 'b list ->
56347
6edbd4d20717 added new-style (co)datatype interpretation hook
blanchet
parents: 56254
diff changeset
    57
    typ list -> term list -> term -> local_theory -> (term * thm) * local_theory
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
    58
  val derive_induct_recs_thms_for_types: BNF_Def.bnf list ->
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
    59
     ('a * typ list list list list * term list list * 'b) option -> thm -> thm list ->
55862
b458558cbcc2 optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents: 55861
diff changeset
    60
     BNF_Def.bnf list -> BNF_Def.bnf list -> typ list -> typ list -> typ list ->
b458558cbcc2 optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents: 55861
diff changeset
    61
     typ list list list -> thm list -> thm list -> thm list -> term list list -> thm list list ->
55864
516ab2906e7e rationalized internals
blanchet
parents: 55863
diff changeset
    62
     term list -> thm list -> Proof.context -> lfp_sugar_thms
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
    63
  val derive_coinduct_corecs_thms_for_types: BNF_Def.bnf list ->
55862
b458558cbcc2 optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents: 55861
diff changeset
    64
    string * term list * term list list * ((term list list * term list list list) * typ list) ->
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
    65
    thm -> thm list -> thm list -> thm list -> BNF_Def.bnf list -> typ list -> typ list ->
55803
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
    66
    typ list -> typ list list list -> int list list -> int list list -> int list -> thm list ->
55864
516ab2906e7e rationalized internals
blanchet
parents: 55863
diff changeset
    67
    thm list -> (thm -> thm) -> thm list list -> Ctr_Sugar.ctr_sugar list -> term list ->
56347
6edbd4d20717 added new-style (co)datatype interpretation hook
blanchet
parents: 56254
diff changeset
    68
    thm list -> (thm list -> thm list) -> Proof.context -> gfp_sugar_thms
55469
b19dd108f0c2 aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents: 55468
diff changeset
    69
55575
a5e33e18fb5c moved 'primrec' up (for real this time) and removed temporary 'old_primrec'
blanchet
parents: 55573
diff changeset
    70
  val co_datatypes: BNF_Util.fp_kind -> (mixfix list -> binding list -> binding list ->
52207
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
    71
      binding list list -> binding list -> (string * sort) list -> typ list * typ list list ->
55803
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
    72
      BNF_Def.bnf list -> BNF_Comp.absT_info list -> local_theory ->
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
    73
      BNF_FP_Util.fp_result * local_theory) ->
57200
aab87ffa60cc use 'where' clause for selector default value syntax
blanchet
parents: 57199
diff changeset
    74
    (bool * bool)
57206
d9be905d6283 changed syntax of map: and rel: arguments to BNF-based datatypes
blanchet
parents: 57205
diff changeset
    75
    * ((((((binding option * (typ * sort)) list * binding) * mixfix)
d9be905d6283 changed syntax of map: and rel: arguments to BNF-based datatypes
blanchet
parents: 57205
diff changeset
    76
         * ((binding, binding * typ) Ctr_Sugar.ctr_spec * mixfix) list) * (binding * binding))
d9be905d6283 changed syntax of map: and rel: arguments to BNF-based datatypes
blanchet
parents: 57205
diff changeset
    77
       * term list) list ->
49297
47fbf2e3e89c provide a programmatic interface for FP sugar
blanchet
parents: 49287
diff changeset
    78
    local_theory -> local_theory
55575
a5e33e18fb5c moved 'primrec' up (for real this time) and removed temporary 'old_primrec'
blanchet
parents: 55573
diff changeset
    79
  val parse_co_datatype_cmd: BNF_Util.fp_kind -> (mixfix list -> binding list -> binding list ->
51867
6d756057e736 signature tuning
blanchet
parents: 51866
diff changeset
    80
      binding list list -> binding list -> (string * sort) list -> typ list * typ list list ->
55803
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
    81
      BNF_Def.bnf list -> BNF_Comp.absT_info list -> local_theory ->
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
    82
      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
    83
    (local_theory -> local_theory) parser
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
    84
end;
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
    85
49636
b7256a88a84b renamed ML file in preparation for next step
blanchet
parents: 49633
diff changeset
    86
structure BNF_FP_Def_Sugar : BNF_FP_DEF_SUGAR =
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
    87
struct
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
    88
54006
9fe1bd54d437 renamed theory file
blanchet
parents: 53974
diff changeset
    89
open Ctr_Sugar
55571
a6153343c44f prepare two-stage 'primrec' setup
blanchet
parents: 55570
diff changeset
    90
open BNF_FP_Rec_Sugar_Util
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    91
open BNF_Util
53222
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
    92
open BNF_Comp
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
    93
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
    94
open BNF_FP_Util
49636
b7256a88a84b renamed ML file in preparation for next step
blanchet
parents: 49633
diff changeset
    95
open BNF_FP_Def_Sugar_Tactics
56650
1f9ab71d43a5 no need to make 'size' generation an interpretation -- overkill
blanchet
parents: 56648
diff changeset
    96
open BNF_LFP_Size
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    97
51788
5fe72280a49f put an underscore in prefix
blanchet
parents: 51787
diff changeset
    98
val EqN = "Eq_";
57489
8f0ba9f2d10f generate 'corec_code' theorem for codatatypes
desharna
parents: 57471
diff changeset
    99
8f0ba9f2d10f generate 'corec_code' theorem for codatatypes
desharna
parents: 57471
diff changeset
   100
val corec_codeN = "corec_code";
57046
b3613d7e108b generate 'sel_map[simp]' theorem for (co)datatypes and tuning 'disc_map_iff'
desharna
parents: 56991
diff changeset
   101
val disc_map_iffN = "disc_map_iff";
b3613d7e108b generate 'sel_map[simp]' theorem for (co)datatypes and tuning 'disc_map_iff'
desharna
parents: 56991
diff changeset
   102
val sel_mapN = "sel_map";
57152
de1ed2c1c3bf generate 'sel_set' theorem for (co)datatypes
desharna
parents: 57094
diff changeset
   103
val sel_setN = "sel_set";
56956
7425fa3763ff generate 'set_empty' theorem for BNFs
desharna
parents: 56767
diff changeset
   104
val set_emptyN = "set_empty";
51777
48a0ae342ea0 generate proper attributes for coinduction rules
blanchet
parents: 51769
diff changeset
   105
51823
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
   106
structure Data = Generic_Data
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
   107
(
51840
b304fb6c5ef5 renamed records
blanchet
parents: 51839
diff changeset
   108
  type T = fp_sugar Symtab.table;
51823
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
   109
  val empty = Symtab.empty;
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
   110
  val extend = I;
55394
d5ebe055b599 more liberal merging of BNFs and constructor sugar
blanchet
parents: 55356
diff changeset
   111
  fun merge data : T = Symtab.merge (K true) data;
51823
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
   112
);
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
   113
57563
e3e7c86168b4 generate 'rel_sel' theorem for (co)datatypes
desharna
parents: 57562
diff changeset
   114
fun choose_relator Rs AB = find_first (fastype_of #> binder_types #> (fn [A, B] => AB = (A, B))) Rs;
e3e7c86168b4 generate 'rel_sel' theorem for (co)datatypes
desharna
parents: 57562
diff changeset
   115
fun build_the_rel ctxt Rs Ts A B = build_rel ctxt Ts (the o choose_relator Rs) (A, B);
e3e7c86168b4 generate 'rel_sel' theorem for (co)datatypes
desharna
parents: 57562
diff changeset
   116
fun build_rel_app ctxt Rs Ts a b = build_the_rel ctxt Rs Ts (fastype_of a) (fastype_of b) $ a $ b;
57525
f9dd8a33f820 generate 'rel_cases' theorem for (co)datatypes
desharna
parents: 57493
diff changeset
   117
53126
f4d2c64c7aa8 transfer stored fp_sugar theorems into the "current" theory when retrieving an fp_sugar (avoids non-trivial merges)
traytel
parents: 53106
diff changeset
   118
fun fp_sugar_of ctxt =
f4d2c64c7aa8 transfer stored fp_sugar theorems into the "current" theory when retrieving an fp_sugar (avoids non-trivial merges)
traytel
parents: 53106
diff changeset
   119
  Symtab.lookup (Data.get (Context.Proof ctxt))
53907
d177eb989c65 added data query function
blanchet
parents: 53901
diff changeset
   120
  #> Option.map (transfer_fp_sugar ctxt);
d177eb989c65 added data query function
blanchet
parents: 53901
diff changeset
   121
d177eb989c65 added data query function
blanchet
parents: 53901
diff changeset
   122
fun fp_sugars_of ctxt =
d177eb989c65 added data query function
blanchet
parents: 53901
diff changeset
   123
  Symtab.fold (cons o transfer_fp_sugar ctxt o snd) (Data.get (Context.Proof ctxt)) [];
51823
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
   124
53106
d81211f61a1b moved derivation of strong coinduction to sugar
traytel
parents: 53037
diff changeset
   125
fun co_induct_of (i :: _) = i;
d81211f61a1b moved derivation of strong coinduction to sugar
traytel
parents: 53037
diff changeset
   126
fun strong_co_induct_of [_, s] = s;
d81211f61a1b moved derivation of strong coinduction to sugar
traytel
parents: 53037
diff changeset
   127
56347
6edbd4d20717 added new-style (co)datatype interpretation hook
blanchet
parents: 56254
diff changeset
   128
structure FP_Sugar_Interpretation = Interpretation
6edbd4d20717 added new-style (co)datatype interpretation hook
blanchet
parents: 56254
diff changeset
   129
(
56637
d1d55f1bbc8a invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents: 56523
diff changeset
   130
  type T = fp_sugar list;
d1d55f1bbc8a invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents: 56523
diff changeset
   131
  val eq: T * T -> bool = op = o pairself (map #T);
56347
6edbd4d20717 added new-style (co)datatype interpretation hook
blanchet
parents: 56254
diff changeset
   132
);
6edbd4d20717 added new-style (co)datatype interpretation hook
blanchet
parents: 56254
diff changeset
   133
56648
2ffa440b3074 manual merge + added 'rel_distincts' field to record for symmetry
blanchet
parents: 56641
diff changeset
   134
fun with_repaired_path f (fp_sugars as ({T = Type (s, _), ...} : fp_sugar) :: _) thy =
56376
5a93b8f928a2 added same idiomatic handling of namings for Ctr_Sugar/BNF-related interpretation hooks as for typedef and (old-style) datatypes
blanchet
parents: 56347
diff changeset
   135
  thy
56767
9b311dbd0f55 restored naming trick
blanchet
parents: 56765
diff changeset
   136
  |> Sign.root_path
9b311dbd0f55 restored naming trick
blanchet
parents: 56765
diff changeset
   137
  |> Sign.add_path (Long_Name.qualifier s)
56637
d1d55f1bbc8a invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents: 56523
diff changeset
   138
  |> f fp_sugars
56767
9b311dbd0f55 restored naming trick
blanchet
parents: 56765
diff changeset
   139
  |> Sign.restore_naming thy;
56376
5a93b8f928a2 added same idiomatic handling of namings for Ctr_Sugar/BNF-related interpretation hooks as for typedef and (old-style) datatypes
blanchet
parents: 56347
diff changeset
   140
56657
558afd429255 made SML/NJ happier
blanchet
parents: 56651
diff changeset
   141
fun fp_sugar_interpretation f = FP_Sugar_Interpretation.interpretation (with_repaired_path f);
56347
6edbd4d20717 added new-style (co)datatype interpretation hook
blanchet
parents: 56254
diff changeset
   142
56650
1f9ab71d43a5 no need to make 'size' generation an interpretation -- overkill
blanchet
parents: 56648
diff changeset
   143
fun register_fp_sugars (fp_sugars as {fp, ...} :: _) =
56648
2ffa440b3074 manual merge + added 'rel_distincts' field to record for symmetry
blanchet
parents: 56641
diff changeset
   144
  fold (fn fp_sugar as {T = Type (s, _), ...} =>
56637
d1d55f1bbc8a invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents: 56523
diff changeset
   145
      Local_Theory.declaration {syntax = false, pervasive = true}
d1d55f1bbc8a invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents: 56523
diff changeset
   146
        (fn phi => Data.map (Symtab.update (s, morph_fp_sugar phi fp_sugar))))
d1d55f1bbc8a invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents: 56523
diff changeset
   147
    fp_sugars
56651
fc105315822a localize new size function generation code
blanchet
parents: 56650
diff changeset
   148
  #> fp = Least_FP ? generate_lfp_size fp_sugars
56637
d1d55f1bbc8a invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents: 56523
diff changeset
   149
  #> Local_Theory.background_theory (FP_Sugar_Interpretation.data fp_sugars);
51823
38996458bc5c create data structure for storing (co)datatype information
blanchet
parents: 51819
diff changeset
   150
57397
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
   151
fun register_as_fp_sugars Ts BTs Xs fp pre_bnfs absT_infos fp_nesting_bnfs live_nesting_bnfs fp_res
56648
2ffa440b3074 manual merge + added 'rel_distincts' field to record for symmetry
blanchet
parents: 56641
diff changeset
   152
    ctrXs_Tsss ctr_defss ctr_sugars co_recs co_rec_defs mapss common_co_inducts co_inductss
2ffa440b3074 manual merge + added 'rel_distincts' field to record for symmetry
blanchet
parents: 56641
diff changeset
   153
    co_rec_thmss disc_co_recss sel_co_recsss rel_injectss rel_distinctss =
56637
d1d55f1bbc8a invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents: 56523
diff changeset
   154
  let
d1d55f1bbc8a invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents: 56523
diff changeset
   155
    val fp_sugars =
d1d55f1bbc8a invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents: 56523
diff changeset
   156
      map_index (fn (kk, T) =>
56648
2ffa440b3074 manual merge + added 'rel_distincts' field to record for symmetry
blanchet
parents: 56641
diff changeset
   157
        {T = T, BT = nth BTs kk, X = nth Xs kk, fp = fp, fp_res = fp_res, fp_res_index = kk,
57397
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
   158
         pre_bnf = nth pre_bnfs kk, absT_info = nth absT_infos kk,
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
   159
         fp_nesting_bnfs = fp_nesting_bnfs, live_nesting_bnfs = live_nesting_bnfs,
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
   160
         ctrXs_Tss = nth ctrXs_Tsss kk, ctr_defs = nth ctr_defss kk, ctr_sugar = nth ctr_sugars kk,
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
   161
         co_rec = nth co_recs kk, co_rec_def = nth co_rec_defs kk, maps = nth mapss kk,
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
   162
         common_co_inducts = common_co_inducts, co_inducts = nth co_inductss kk,
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
   163
         co_rec_thms = nth co_rec_thmss kk, disc_co_recs = nth disc_co_recss kk,
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
   164
         sel_co_recss = nth sel_co_recsss kk, rel_injects = nth rel_injectss kk,
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
   165
         rel_distincts = nth rel_distinctss kk}) Ts
56637
d1d55f1bbc8a invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents: 56523
diff changeset
   166
  in
d1d55f1bbc8a invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents: 56523
diff changeset
   167
    register_fp_sugars fp_sugars
d1d55f1bbc8a invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents: 56523
diff changeset
   168
  end;
51824
27d073b0876c register all (co)datatypes in local data
blanchet
parents: 51823
diff changeset
   169
55342
blanchet
parents: 55095
diff changeset
   170
(* This function could produce (fairly harmless) clashes in contrived examples (e.g., "x.A",
blanchet
parents: 55095
diff changeset
   171
   "x.x_A", "y.A"). *)
49622
a93f976c3307 use a nicer scheme to indexify names
blanchet
parents: 49605
diff changeset
   172
fun quasi_unambiguous_case_names names =
a93f976c3307 use a nicer scheme to indexify names
blanchet
parents: 49605
diff changeset
   173
  let
a93f976c3307 use a nicer scheme to indexify names
blanchet
parents: 49605
diff changeset
   174
    val ps = map (`Long_Name.base_name) names;
a93f976c3307 use a nicer scheme to indexify names
blanchet
parents: 49605
diff changeset
   175
    val dups = Library.duplicates (op =) (map fst ps);
a93f976c3307 use a nicer scheme to indexify names
blanchet
parents: 49605
diff changeset
   176
    fun underscore s =
a93f976c3307 use a nicer scheme to indexify names
blanchet
parents: 49605
diff changeset
   177
      let val ss = space_explode Long_Name.separator s in
a93f976c3307 use a nicer scheme to indexify names
blanchet
parents: 49605
diff changeset
   178
        space_implode "_" (drop (length ss - 2) ss)
a93f976c3307 use a nicer scheme to indexify names
blanchet
parents: 49605
diff changeset
   179
      end;
a93f976c3307 use a nicer scheme to indexify names
blanchet
parents: 49605
diff changeset
   180
  in
a93f976c3307 use a nicer scheme to indexify names
blanchet
parents: 49605
diff changeset
   181
    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
   182
  end;
a93f976c3307 use a nicer scheme to indexify names
blanchet
parents: 49605
diff changeset
   183
49591
91b228e26348 generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents: 49590
diff changeset
   184
val mp_conj = @{thm mp_conj};
91b228e26348 generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents: 49590
diff changeset
   185
55397
c2506f61fd26 generate 'fundec_cong' attribute for new-style (co)datatypes
blanchet
parents: 55394
diff changeset
   186
val fundefcong_attrs = @{attributes [fundef_cong]};
54145
297d1c603999 make sure that registered code equations are actually equations
blanchet
parents: 54107
diff changeset
   187
val nitpicksimp_attrs = @{attributes [nitpick_simp]};
297d1c603999 make sure that registered code equations are actually equations
blanchet
parents: 54107
diff changeset
   188
val code_nitpicksimp_attrs = Code.add_default_eqn_attrib :: nitpicksimp_attrs;
49300
c707df2e2083 added attributes to theorems
blanchet
parents: 49298
diff changeset
   189
val simp_attrs = @{attributes [simp]};
c707df2e2083 added attributes to theorems
blanchet
parents: 49298
diff changeset
   190
49297
47fbf2e3e89c provide a programmatic interface for FP sugar
blanchet
parents: 49287
diff changeset
   191
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
   192
55871
a28817253b31 removed (co)iterators from documentation
blanchet
parents: 55869
diff changeset
   193
fun flat_corec_predss_getterss qss gss = maps (op @) (qss ~~ gss);
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   194
55871
a28817253b31 removed (co)iterators from documentation
blanchet
parents: 55869
diff changeset
   195
fun flat_corec_preds_predsss_gettersss [] [qss] [gss] = flat_corec_predss_getterss qss gss
a28817253b31 removed (co)iterators from documentation
blanchet
parents: 55869
diff changeset
   196
  | flat_corec_preds_predsss_gettersss (p :: ps) (qss :: qsss) (gss :: gsss) =
a28817253b31 removed (co)iterators from documentation
blanchet
parents: 55869
diff changeset
   197
    p :: flat_corec_predss_getterss qss gss @ flat_corec_preds_predsss_gettersss ps qsss gsss;
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   198
49585
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   199
fun mk_flip (x, Type (_, [T1, Type (_, [T2, T3])])) =
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   200
  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
   201
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   202
fun flip_rels lthy n thm =
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   203
  let
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   204
    val Rs = Term.add_vars (prop_of thm) [];
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   205
    val Rs' = rev (drop (length Rs - n) Rs);
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   206
    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
   207
  in
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   208
    Drule.cterm_instantiate cRs thm
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   209
  end;
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   210
49536
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   211
fun mk_ctor_or_dtor get_T Ts t =
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   212
  let val Type (_, Ts0) = get_T (fastype_of t) in
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   213
    Term.subst_atomic_types (Ts0 ~~ Ts) t
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   214
  end;
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   215
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   216
val mk_ctor = mk_ctor_or_dtor range_type;
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   217
val mk_dtor = mk_ctor_or_dtor domain_type;
898aea2e7a94 started work on generation of "rel" theorems
blanchet
parents: 49518
diff changeset
   218
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   219
fun mk_xtor_co_recs thy fp fpTs Cs ts0 =
51911
6c425d450a8c more robust iterator construction (needed for mutualized FPs)
blanchet
parents: 51910
diff changeset
   220
  let
6c425d450a8c more robust iterator construction (needed for mutualized FPs)
blanchet
parents: 51910
diff changeset
   221
    val nn = length fpTs;
6c425d450a8c more robust iterator construction (needed for mutualized FPs)
blanchet
parents: 51910
diff changeset
   222
    val (fpTs0, Cs0) =
52207
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
   223
      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
   224
      |> split_list;
6c425d450a8c more robust iterator construction (needed for mutualized FPs)
blanchet
parents: 51910
diff changeset
   225
    val rho = tvar_subst thy (fpTs0 @ Cs0) (fpTs @ Cs);
6c425d450a8c more robust iterator construction (needed for mutualized FPs)
blanchet
parents: 51910
diff changeset
   226
  in
52170
564be617ae84 generalized "mk_co_iter" to handle mutualized (co)iterators
blanchet
parents: 52169
diff changeset
   227
    map (Term.subst_TVars rho) ts0
51911
6c425d450a8c more robust iterator construction (needed for mutualized FPs)
blanchet
parents: 51910
diff changeset
   228
  end;
51827
836257faaad5 tuned signature
blanchet
parents: 51824
diff changeset
   229
55575
a5e33e18fb5c moved 'primrec' up (for real this time) and removed temporary 'old_primrec'
blanchet
parents: 55573
diff changeset
   230
fun unzip_recT (Type (@{type_name prod}, _)) T = [T]
a5e33e18fb5c moved 'primrec' up (for real this time) and removed temporary 'old_primrec'
blanchet
parents: 55573
diff changeset
   231
  | unzip_recT _ (Type (@{type_name prod}, Ts)) = Ts
a5e33e18fb5c moved 'primrec' up (for real this time) and removed temporary 'old_primrec'
blanchet
parents: 55573
diff changeset
   232
  | unzip_recT _ T = [T];
a5e33e18fb5c moved 'primrec' up (for real this time) and removed temporary 'old_primrec'
blanchet
parents: 55573
diff changeset
   233
53591
b6e2993fd0d3 don't wrongly destroy sum types in coiterators
blanchet
parents: 53569
diff changeset
   234
fun unzip_corecT (Type (@{type_name sum}, _)) T = [T]
53901
blanchet
parents: 53888
diff changeset
   235
  | unzip_corecT _ (Type (@{type_name sum}, Ts)) = Ts
52871
blanchet
parents: 52870
diff changeset
   236
  | unzip_corecT _ T = [T];
blanchet
parents: 52870
diff changeset
   237
52347
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   238
fun liveness_of_fp_bnf n bnf =
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   239
  (case T_of_bnf bnf of
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   240
    Type (_, Ts) => map (not o member (op =) (deads_of_bnf bnf)) Ts
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   241
  | _ => replicate n false);
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   242
55700
cf6a029b28d8 more precise error message
blanchet
parents: 55699
diff changeset
   243
fun cannot_merge_types fp =
cf6a029b28d8 more precise error message
blanchet
parents: 55699
diff changeset
   244
  error ("Mutually " ^ co_prefix fp ^ "recursive types must have the same type parameters");
52347
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   245
55700
cf6a029b28d8 more precise error message
blanchet
parents: 55699
diff changeset
   246
fun merge_type_arg fp T T' = if T = T' then T else cannot_merge_types fp;
52347
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   247
55700
cf6a029b28d8 more precise error message
blanchet
parents: 55699
diff changeset
   248
fun merge_type_args fp (As, As') =
cf6a029b28d8 more precise error message
blanchet
parents: 55699
diff changeset
   249
  if length As = length As' then map2 (merge_type_arg fp) As As' else cannot_merge_types fp;
52347
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   250
57200
aab87ffa60cc use 'where' clause for selector default value syntax
blanchet
parents: 57199
diff changeset
   251
fun type_args_named_constrained_of_spec (((((ncAs, _), _), _), _), _) = ncAs;
aab87ffa60cc use 'where' clause for selector default value syntax
blanchet
parents: 57199
diff changeset
   252
fun type_binding_of_spec (((((_, b), _), _), _), _) = b;
57206
d9be905d6283 changed syntax of map: and rel: arguments to BNF-based datatypes
blanchet
parents: 57205
diff changeset
   253
fun mixfix_of_spec ((((_, mx), _), _), _) = mx;
d9be905d6283 changed syntax of map: and rel: arguments to BNF-based datatypes
blanchet
parents: 57205
diff changeset
   254
fun mixfixed_ctr_specs_of_spec (((_, mx_ctr_specs), _), _) = mx_ctr_specs;
d9be905d6283 changed syntax of map: and rel: arguments to BNF-based datatypes
blanchet
parents: 57205
diff changeset
   255
fun map_binding_of_spec ((_, (b, _)), _) = b;
d9be905d6283 changed syntax of map: and rel: arguments to BNF-based datatypes
blanchet
parents: 57205
diff changeset
   256
fun rel_binding_of_spec ((_, (_, b)), _) = b;
57200
aab87ffa60cc use 'where' clause for selector default value syntax
blanchet
parents: 57199
diff changeset
   257
fun sel_default_eqs_of_spec (_, ts) = ts;
52347
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   258
57397
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
   259
fun add_nesting_bnf_names Us =
52347
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   260
  let
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   261
    fun add (Type (s, Ts)) ss =
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   262
        let val (needs, ss') = fold_map add Ts ss in
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   263
          if exists I needs then (true, insert (op =) s ss') else (false, ss')
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   264
        end
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   265
      | add T ss = (member (op =) Us T, ss);
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   266
  in snd oo add end;
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   267
57397
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
   268
fun nesting_bnfs ctxt ctr_Tsss Us =
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
   269
  map_filter (bnf_of ctxt) (fold (fold (fold (add_nesting_bnf_names Us))) ctr_Tsss []);
52347
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   270
54237
7cc6e286fe28 made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents: 54236
diff changeset
   271
fun indexify proj xs f p = f (find_index (curry (op =) (proj p)) xs) p;
52347
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   272
53746
bd038e48526d have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents: 53741
diff changeset
   273
type lfp_sugar_thms =
55856
bddaada24074 got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents: 55803
diff changeset
   274
  (thm list * thm * Args.src list) * (thm list list * Args.src list);
53746
bd038e48526d have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents: 53741
diff changeset
   275
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   276
fun morph_lfp_sugar_thms phi ((inducts, induct, induct_attrs), (recss, rec_attrs)) =
54256
4843082be7ef added some N2M caching
blanchet
parents: 54253
diff changeset
   277
  ((map (Morphism.thm phi) inducts, Morphism.thm phi induct, induct_attrs),
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   278
   (map (map (Morphism.thm phi)) recss, rec_attrs))
55095
7883bd17362f made SML/NJ happier
blanchet
parents: 55093
diff changeset
   279
  : lfp_sugar_thms;
54256
4843082be7ef added some N2M caching
blanchet
parents: 54253
diff changeset
   280
4843082be7ef added some N2M caching
blanchet
parents: 54253
diff changeset
   281
val transfer_lfp_sugar_thms =
54740
91f54d386680 maintain morphism names for diagnostic purposes;
wenzelm
parents: 54626
diff changeset
   282
  morph_lfp_sugar_thms o Morphism.transfer_morphism o Proof_Context.theory_of;
54256
4843082be7ef added some N2M caching
blanchet
parents: 54253
diff changeset
   283
53746
bd038e48526d have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents: 53741
diff changeset
   284
type gfp_sugar_thms =
57260
8747af0d1012 fixed postprocessing of 'coinduct' formula to obtain right property format (without needless hypotheses)
blanchet
parents: 57206
diff changeset
   285
  ((thm list * thm) list * (Args.src list * Args.src list))
57489
8f0ba9f2d10f generate 'corec_code' theorem for codatatypes
desharna
parents: 57471
diff changeset
   286
  * thm list list
8f0ba9f2d10f generate 'corec_code' theorem for codatatypes
desharna
parents: 57471
diff changeset
   287
  * thm list list
55856
bddaada24074 got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents: 55803
diff changeset
   288
  * (thm list list * Args.src list)
bddaada24074 got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents: 55803
diff changeset
   289
  * (thm list list list * Args.src list);
53746
bd038e48526d have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents: 53741
diff changeset
   290
57260
8747af0d1012 fixed postprocessing of 'coinduct' formula to obtain right property format (without needless hypotheses)
blanchet
parents: 57206
diff changeset
   291
fun morph_gfp_sugar_thms phi ((coinducts_pairs, coinduct_attrs_pair),
57489
8f0ba9f2d10f generate 'corec_code' theorem for codatatypes
desharna
parents: 57471
diff changeset
   292
    corecss, disc_corecss, (disc_corec_iffss, disc_corec_iff_attrs),
8f0ba9f2d10f generate 'corec_code' theorem for codatatypes
desharna
parents: 57471
diff changeset
   293
    (sel_corecsss, sel_corec_attrs)) =
54256
4843082be7ef added some N2M caching
blanchet
parents: 54253
diff changeset
   294
  ((map (apfst (map (Morphism.thm phi)) o apsnd (Morphism.thm phi)) coinducts_pairs,
57260
8747af0d1012 fixed postprocessing of 'coinduct' formula to obtain right property format (without needless hypotheses)
blanchet
parents: 57206
diff changeset
   295
    coinduct_attrs_pair),
57489
8f0ba9f2d10f generate 'corec_code' theorem for codatatypes
desharna
parents: 57471
diff changeset
   296
   map (map (Morphism.thm phi)) corecss,
8f0ba9f2d10f generate 'corec_code' theorem for codatatypes
desharna
parents: 57471
diff changeset
   297
   map (map (Morphism.thm phi)) disc_corecss,
55871
a28817253b31 removed (co)iterators from documentation
blanchet
parents: 55869
diff changeset
   298
   (map (map (Morphism.thm phi)) disc_corec_iffss, disc_corec_iff_attrs),
a28817253b31 removed (co)iterators from documentation
blanchet
parents: 55869
diff changeset
   299
   (map (map (map (Morphism.thm phi))) sel_corecsss, sel_corec_attrs)) : gfp_sugar_thms;
54256
4843082be7ef added some N2M caching
blanchet
parents: 54253
diff changeset
   300
4843082be7ef added some N2M caching
blanchet
parents: 54253
diff changeset
   301
val transfer_gfp_sugar_thms =
54740
91f54d386680 maintain morphism names for diagnostic purposes;
wenzelm
parents: 54626
diff changeset
   302
  morph_gfp_sugar_thms o Morphism.transfer_morphism o Proof_Context.theory_of;
54256
4843082be7ef added some N2M caching
blanchet
parents: 54253
diff changeset
   303
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   304
fun mk_recs_args_types ctr_Tsss Cs absTs repTs ns mss ctor_rec_fun_Ts lthy =
51832
blanchet
parents: 51831
diff changeset
   305
  let
52214
4cc5a80bba80 generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents: 52213
diff changeset
   306
    val Css = map2 replicate ns Cs;
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   307
    val x_Tssss =
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   308
      map6 (fn absT => fn repT => fn n => fn ms => fn ctr_Tss => fn ctor_rec_fun_T =>
55803
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
   309
          map2 (map2 unzip_recT)
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   310
            ctr_Tss (dest_absumprodT absT repT n ms (domain_type ctor_rec_fun_T)))
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   311
        absTs repTs ns mss ctr_Tsss ctor_rec_fun_Ts;
51832
blanchet
parents: 51831
diff changeset
   312
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   313
    val x_Tsss' = map (map flat_rec_arg_args) x_Tssss;
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   314
    val f_Tss = map2 (map2 (curry (op --->))) x_Tsss' Css;
51832
blanchet
parents: 51831
diff changeset
   315
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   316
    val ((fss, xssss), lthy) =
52214
4cc5a80bba80 generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents: 52213
diff changeset
   317
      lthy
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   318
      |> mk_Freess "f" f_Tss
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   319
      ||>> mk_Freessss "x" x_Tssss;
51832
blanchet
parents: 51831
diff changeset
   320
  in
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   321
    ((f_Tss, x_Tssss, fss, xssss), lthy)
51832
blanchet
parents: 51831
diff changeset
   322
  end;
blanchet
parents: 51831
diff changeset
   323
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   324
(*avoid "'a itself" arguments in corecursors*)
55966
972f0aa7091b balance tuples that represent curried functions
blanchet
parents: 55903
diff changeset
   325
fun repair_nullary_single_ctr [[]] = [[HOLogic.unitT]]
55772
367ec44763fd correct most general type for mutual recursion when several identical types are involved
blanchet
parents: 55701
diff changeset
   326
  | repair_nullary_single_ctr Tss = Tss;
367ec44763fd correct most general type for mutual recursion when several identical types are involved
blanchet
parents: 55701
diff changeset
   327
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   328
fun mk_corec_fun_arg_types0 ctr_Tsss Cs absTs repTs ns mss fun_Ts =
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   329
  let
55772
367ec44763fd correct most general type for mutual recursion when several identical types are involved
blanchet
parents: 55701
diff changeset
   330
    val ctr_Tsss' = map repair_nullary_single_ctr ctr_Tsss;
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   331
    val g_absTs = map range_type fun_Ts;
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   332
    val g_Tsss = map repair_nullary_single_ctr (map5 dest_absumprodT absTs repTs ns mss g_absTs);
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   333
    val g_Tssss = map3 (fn C => map2 (map2 (map (curry (op -->) C) oo unzip_corecT)))
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   334
      Cs ctr_Tsss' g_Tsss;
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   335
    val q_Tssss = map (map (map (fn [_] => [] | [_, T] => [mk_pred1T (domain_type T)]))) g_Tssss;
52870
blanchet
parents: 52869
diff changeset
   336
  in
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   337
    (q_Tssss, g_Tsss, g_Tssss, g_absTs)
52870
blanchet
parents: 52869
diff changeset
   338
  end;
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   339
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   340
fun mk_corec_p_pred_types Cs ns = map2 (fn n => replicate (Int.max (0, n - 1)) o mk_pred1T) ns Cs;
52898
2af1caada147 enrich exported ML function's signature
blanchet
parents: 52872
diff changeset
   341
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   342
fun mk_corec_fun_arg_types ctr_Tsss Cs absTs repTs ns mss dtor_corec =
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   343
  (mk_corec_p_pred_types Cs ns,
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   344
   mk_corec_fun_arg_types0 ctr_Tsss Cs absTs repTs ns mss
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   345
     (binder_fun_types (fastype_of dtor_corec)));
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   346
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   347
fun mk_corecs_args_types ctr_Tsss Cs absTs repTs ns mss dtor_corec_fun_Ts lthy =
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   348
  let
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   349
    val p_Tss = mk_corec_p_pred_types Cs ns;
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   350
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   351
    val (q_Tssss, g_Tsss, g_Tssss, corec_types) =
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   352
      mk_corec_fun_arg_types0 ctr_Tsss Cs absTs repTs ns mss dtor_corec_fun_Ts;
51831
blanchet
parents: 51830
diff changeset
   353
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   354
    val (((((Free (x, _), cs), pss), qssss), gssss), lthy) =
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   355
      lthy
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   356
      |> yield_singleton (mk_Frees "x") dummyT
52347
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   357
      ||>> mk_Frees "a" Cs
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   358
      ||>> mk_Freess "p" p_Tss
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   359
      ||>> mk_Freessss "q" q_Tssss
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   360
      ||>> mk_Freessss "g" g_Tssss;
51831
blanchet
parents: 51830
diff changeset
   361
blanchet
parents: 51830
diff changeset
   362
    val cpss = map2 (map o rapp) cs pss;
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   363
57303
498a62e65f5f tune the implementation of 'rel_coinduct'
desharna
parents: 57302
diff changeset
   364
    fun build_sum_inj mk_inj = build_map lthy [] (uncurry mk_inj o dest_sumT o snd);
52347
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   365
55871
a28817253b31 removed (co)iterators from documentation
blanchet
parents: 55869
diff changeset
   366
    fun build_dtor_corec_arg _ [] [cg] = cg
a28817253b31 removed (co)iterators from documentation
blanchet
parents: 55869
diff changeset
   367
      | build_dtor_corec_arg T [cq] [cg, cg'] =
a28817253b31 removed (co)iterators from documentation
blanchet
parents: 55869
diff changeset
   368
        mk_If cq (build_sum_inj Inl_const (fastype_of cg, T) $ cg)
a28817253b31 removed (co)iterators from documentation
blanchet
parents: 55869
diff changeset
   369
          (build_sum_inj Inr_const (fastype_of cg', T) $ cg');
52347
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   370
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   371
    val pgss = map3 flat_corec_preds_predsss_gettersss pss qssss gssss;
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   372
    val cqssss = map2 (map o map o map o rapp) cs qssss;
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   373
    val cgssss = map2 (map o map o map o rapp) cs gssss;
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   374
    val cqgsss = map3 (map3 (map3 build_dtor_corec_arg)) g_Tsss cqssss cgssss;
51831
blanchet
parents: 51830
diff changeset
   375
  in
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   376
    ((x, cs, cpss, ((pgss, cqgsss), corec_types)), lthy)
51831
blanchet
parents: 51830
diff changeset
   377
  end;
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   378
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   379
fun mk_co_recs_prelims fp ctr_Tsss fpTs Cs absTs repTs ns mss xtor_co_recs0 lthy =
51903
126f8d11f873 move function to library
blanchet
parents: 51902
diff changeset
   380
  let
52169
blanchet
parents: 51912
diff changeset
   381
    val thy = Proof_Context.theory_of lthy;
blanchet
parents: 51912
diff changeset
   382
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   383
    val (xtor_co_rec_fun_Ts, xtor_co_recs) =
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   384
      mk_xtor_co_recs thy fp fpTs Cs xtor_co_recs0 |> `(binder_fun_types o fastype_of o hd);
51903
126f8d11f873 move function to library
blanchet
parents: 51902
diff changeset
   385
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   386
    val ((recs_args_types, corecs_args_types), lthy') =
52207
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
   387
      if fp = Least_FP then
56641
029997d3b5d8 reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents: 56640
diff changeset
   388
        mk_recs_args_types ctr_Tsss Cs absTs repTs ns mss xtor_co_rec_fun_Ts lthy
029997d3b5d8 reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents: 56640
diff changeset
   389
        |>> (rpair NONE o SOME)
51903
126f8d11f873 move function to library
blanchet
parents: 51902
diff changeset
   390
      else
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   391
        mk_corecs_args_types ctr_Tsss Cs absTs repTs ns mss xtor_co_rec_fun_Ts lthy
55803
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
   392
        |>> (pair NONE o SOME);
51903
126f8d11f873 move function to library
blanchet
parents: 51902
diff changeset
   393
  in
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   394
    ((xtor_co_recs, recs_args_types, corecs_args_types), lthy')
51903
126f8d11f873 move function to library
blanchet
parents: 51902
diff changeset
   395
  end;
126f8d11f873 move function to library
blanchet
parents: 51902
diff changeset
   396
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   397
fun mk_preds_getterss_join c cps absT abs cqgss =
55803
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
   398
  let
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   399
    val n = length cqgss;
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   400
    val ts = map2 (mk_absumprod absT abs n) (1 upto n) cqgss;
55803
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
   401
  in
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
   402
    Term.lambda c (mk_IfN absT cps ts)
51900
blanchet
parents: 51899
diff changeset
   403
  end;
51886
e7fac4a483b5 started factoring out coiter construction
blanchet
parents: 51885
diff changeset
   404
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   405
fun define_co_rec fp fpT Cs b rhs lthy0 =
51897
9a27c870ee21 refactoring
blanchet
parents: 51896
diff changeset
   406
  let
52170
564be617ae84 generalized "mk_co_iter" to handle mutualized (co)iterators
blanchet
parents: 52169
diff changeset
   407
    val thy = Proof_Context.theory_of lthy0;
564be617ae84 generalized "mk_co_iter" to handle mutualized (co)iterators
blanchet
parents: 52169
diff changeset
   408
53569
b4db0ade27bd conceal definitions of high-level constructors and (co)iterators
traytel
parents: 53553
diff changeset
   409
    val maybe_conceal_def_binding = Thm.def_binding
b4db0ade27bd conceal definitions of high-level constructors and (co)iterators
traytel
parents: 53553
diff changeset
   410
      #> Config.get lthy0 bnf_note_all = false ? Binding.conceal;
b4db0ade27bd conceal definitions of high-level constructors and (co)iterators
traytel
parents: 53553
diff changeset
   411
55864
516ab2906e7e rationalized internals
blanchet
parents: 55863
diff changeset
   412
    val ((cst, (_, def)), (lthy', lthy)) = lthy0
516ab2906e7e rationalized internals
blanchet
parents: 55863
diff changeset
   413
      |> Local_Theory.define ((b, NoSyn), ((maybe_conceal_def_binding b, []), rhs))
52327
blanchet
parents: 52326
diff changeset
   414
      ||> `Local_Theory.restore;
blanchet
parents: 52326
diff changeset
   415
blanchet
parents: 52326
diff changeset
   416
    val phi = Proof_Context.export_morphism lthy lthy';
blanchet
parents: 52326
diff changeset
   417
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   418
    val cst' = mk_co_rec thy fp fpT Cs (Morphism.term phi cst);
55864
516ab2906e7e rationalized internals
blanchet
parents: 55863
diff changeset
   419
    val def' = Morphism.thm phi def;
52327
blanchet
parents: 52326
diff changeset
   420
  in
55864
516ab2906e7e rationalized internals
blanchet
parents: 55863
diff changeset
   421
    ((cst', def'), lthy')
52327
blanchet
parents: 52326
diff changeset
   422
  end;
blanchet
parents: 52326
diff changeset
   423
56641
029997d3b5d8 reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents: 56640
diff changeset
   424
fun define_rec (_, _, fss, xssss) mk_binding fpTs Cs reps ctor_rec =
029997d3b5d8 reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents: 56640
diff changeset
   425
  let
029997d3b5d8 reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents: 56640
diff changeset
   426
    val nn = length fpTs;
029997d3b5d8 reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents: 56640
diff changeset
   427
    val (ctor_rec_absTs, fpT) = strip_typeN nn (fastype_of ctor_rec)
029997d3b5d8 reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents: 56640
diff changeset
   428
      |>> map domain_type ||> domain_type;
029997d3b5d8 reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents: 56640
diff changeset
   429
  in
029997d3b5d8 reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents: 56640
diff changeset
   430
    define_co_rec Least_FP fpT Cs (mk_binding recN)
029997d3b5d8 reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents: 56640
diff changeset
   431
      (fold_rev (fold_rev Term.lambda) fss (Term.list_comb (ctor_rec,
029997d3b5d8 reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents: 56640
diff changeset
   432
         map4 (fn ctor_rec_absT => fn rep => fn fs => fn xsss =>
029997d3b5d8 reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents: 56640
diff changeset
   433
             mk_case_absumprod ctor_rec_absT rep fs (map (map HOLogic.mk_tuple) xsss)
029997d3b5d8 reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents: 56640
diff changeset
   434
               (map flat_rec_arg_args xsss))
029997d3b5d8 reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents: 56640
diff changeset
   435
           ctor_rec_absTs reps fss xssss)))
029997d3b5d8 reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents: 56640
diff changeset
   436
  end;
51897
9a27c870ee21 refactoring
blanchet
parents: 51896
diff changeset
   437
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   438
fun define_corec (_, cs, cpss, ((pgss, cqgsss), f_absTs)) mk_binding fpTs Cs abss dtor_corec =
51897
9a27c870ee21 refactoring
blanchet
parents: 51896
diff changeset
   439
  let
51899
c2c23ac31973 code tuning
blanchet
parents: 51897
diff changeset
   440
    val nn = length fpTs;
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   441
    val fpT = range_type (snd (strip_typeN nn (fastype_of dtor_corec)));
51897
9a27c870ee21 refactoring
blanchet
parents: 51896
diff changeset
   442
  in
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   443
    define_co_rec Greatest_FP fpT Cs (mk_binding corecN)
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   444
      (fold_rev (fold_rev Term.lambda) pgss (Term.list_comb (dtor_corec,
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   445
         map5 mk_preds_getterss_join cs cpss f_absTs abss cqgsss)))
52320
blanchet
parents: 52319
diff changeset
   446
  end;
51897
9a27c870ee21 refactoring
blanchet
parents: 51896
diff changeset
   447
57471
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   448
fun postproc_co_induct lthy nn prop prop_conj =
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   449
  Drule.zero_var_indexes
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   450
  #> `(conj_dests nn)
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   451
  #>> map (fn thm => Thm.permute_prems 0 (~1) (thm RS prop))
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   452
  ##> (fn thm => Thm.permute_prems 0 (~nn)
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   453
    (if nn = 1 then thm RS prop
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   454
     else funpow nn (fn thm => Local_Defs.unfold lthy @{thms conj_assoc} (thm RS prop_conj)) thm));
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   455
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   456
fun mk_induct_attrs ctrss =
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   457
  let
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   458
    val induct_cases = quasi_unambiguous_case_names (maps (map name_of_ctr) ctrss);
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   459
    val induct_case_names_attr = Attrib.internal (K (Rule_Cases.case_names induct_cases));
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   460
  in
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   461
    [induct_case_names_attr]
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   462
  end;
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   463
57535
9b99b773acd4 made SML/NJ happier
blanchet
parents: 57525
diff changeset
   464
fun derive_rel_induct_thms_for_types lthy fpA_Ts As Bs ctrAss ctrAs_Tsss exhausts ctor_rel_induct
9b99b773acd4 made SML/NJ happier
blanchet
parents: 57525
diff changeset
   465
    ctor_defss ctor_injects pre_rel_defs abs_inverses live_nesting_rel_eqs =
57471
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   466
  let
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   467
    val B_ify = typ_subst_nonatomic (As ~~ Bs)
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   468
    val fpB_Ts = map B_ify fpA_Ts;
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   469
    val ctrBs_Tsss = map (map (map B_ify)) ctrAs_Tsss;
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   470
    val ctrBss = map (map (subst_nonatomic_types (As ~~ Bs))) ctrAss;
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   471
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   472
    val ((((Rs, IRs), ctrAsss), ctrBsss), names_lthy) = lthy
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   473
      |> mk_Frees "R" (map2 mk_pred2T As Bs)
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   474
      ||>> mk_Frees "IR" (map2 mk_pred2T fpA_Ts fpB_Ts)
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   475
      ||>> mk_Freesss "a" ctrAs_Tsss
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   476
      ||>> mk_Freesss "b" ctrBs_Tsss;
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   477
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   478
    val premises =
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   479
      let
57525
f9dd8a33f820 generate 'rel_cases' theorem for (co)datatypes
desharna
parents: 57493
diff changeset
   480
        fun build_the_rel A B = build_rel lthy fpA_Ts (the o choose_relator (Rs @ IRs)) (A, B);
57471
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   481
        fun build_rel_app a b = build_the_rel (fastype_of a) (fastype_of b) $ a $ b;
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   482
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   483
        fun mk_prem ctrA ctrB argAs argBs =
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   484
          fold_rev Logic.all (argAs @ argBs) (fold_rev (curry Logic.mk_implies)
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   485
            (map2 (HOLogic.mk_Trueprop oo build_rel_app) argAs argBs)
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   486
            (HOLogic.mk_Trueprop
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   487
              (build_rel_app (Term.list_comb (ctrA, argAs)) (Term.list_comb (ctrB, argBs)))));
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   488
      in
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   489
        flat (map4 (map4 mk_prem) ctrAss ctrBss ctrAsss ctrBsss)
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   490
      end;
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   491
57525
f9dd8a33f820 generate 'rel_cases' theorem for (co)datatypes
desharna
parents: 57493
diff changeset
   492
    val goal = HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj (map2 mk_leq
f9dd8a33f820 generate 'rel_cases' theorem for (co)datatypes
desharna
parents: 57493
diff changeset
   493
      (map (build_rel lthy [] (the o choose_relator (Rs @ IRs))) (fpA_Ts ~~ fpB_Ts)) IRs));
57471
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   494
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   495
    val rel_induct0_thm = Goal.prove_sorry lthy [] premises goal
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   496
      (fn {context = ctxt, prems = prems} =>
57535
9b99b773acd4 made SML/NJ happier
blanchet
parents: 57525
diff changeset
   497
          mk_rel_induct0_tac ctxt ctor_rel_induct prems (map (certify ctxt) IRs) exhausts ctor_defss
9b99b773acd4 made SML/NJ happier
blanchet
parents: 57525
diff changeset
   498
            ctor_injects pre_rel_defs abs_inverses live_nesting_rel_eqs)
57471
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   499
      |> singleton (Proof_Context.export names_lthy lthy)
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   500
      |> Thm.close_derivation;
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   501
  in
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   502
    (postproc_co_induct lthy (length fpA_Ts) @{thm predicate2D} @{thm predicate2D_conj}
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   503
       rel_induct0_thm,
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   504
     mk_induct_attrs ctrAss)
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   505
  end;
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   506
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   507
fun derive_induct_recs_thms_for_types pre_bnfs rec_args_typess ctor_induct ctor_rec_thms
57397
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
   508
    live_nesting_bnfs fp_nesting_bnfs fpTs Cs Xs ctrXs_Tsss fp_abs_inverses fp_type_definitions
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
   509
    abs_inverses ctrss ctr_defss recs rec_defs 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
   510
  let
51827
836257faaad5 tuned signature
blanchet
parents: 51824
diff changeset
   511
    val ctr_Tsss = map (map (binder_types o fastype_of)) ctrss;
836257faaad5 tuned signature
blanchet
parents: 51824
diff changeset
   512
51815
efacb9b99865 tune signatures
blanchet
parents: 51814
diff changeset
   513
    val nn = length pre_bnfs;
51827
836257faaad5 tuned signature
blanchet
parents: 51824
diff changeset
   514
    val ns = map length ctr_Tsss;
836257faaad5 tuned signature
blanchet
parents: 51824
diff changeset
   515
    val mss = map (map length) ctr_Tsss;
51815
efacb9b99865 tune signatures
blanchet
parents: 51814
diff changeset
   516
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   517
    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
   518
    val pre_set_defss = map set_defs_of_bnf pre_bnfs;
57399
cfc19f0a6261 compile
blanchet
parents: 57397
diff changeset
   519
    val live_nesting_map_ident0s = map map_ident0_of_bnf live_nesting_bnfs;
cfc19f0a6261 compile
blanchet
parents: 57397
diff changeset
   520
    val fp_nesting_map_ident0s = map map_ident0_of_bnf fp_nesting_bnfs;
57397
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
   521
    val fp_nesting_set_maps = maps set_map_of_bnf fp_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
   522
51816
5f1dec4297da use base names, not full names
blanchet
parents: 51815
diff changeset
   523
    val fp_b_names = map base_name_of_typ fpTs;
51811
1461426e2bf1 tuned function signatures
blanchet
parents: 51810
diff changeset
   524
51832
blanchet
parents: 51831
diff changeset
   525
    val ((((ps, ps'), xsss), us'), names_lthy) =
52315
fafab8eac3ee avoid duplicate call to "mk_fold_rec_args_types" function
blanchet
parents: 52314
diff changeset
   526
      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
      |> mk_Frees' "P" (map mk_pred1T fpTs)
51827
836257faaad5 tuned signature
blanchet
parents: 51824
diff changeset
   528
      ||>> mk_Freesss "x" ctr_Tsss
51816
5f1dec4297da use base names, not full names
blanchet
parents: 51815
diff changeset
   529
      ||>> 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
   530
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   531
    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
   532
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   533
    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
   534
      let
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   535
        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
   536
        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
   537
        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
   538
        fun mk_set U =
54237
7cc6e286fe28 made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents: 54236
diff changeset
   539
          (case find_index (curry (op =) U) lives of
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
            ~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
   541
          | 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
   542
      in
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   543
        (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
   544
      end;
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   545
57397
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
   546
    val setss_nested = map mk_sets_nested fp_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
   547
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   548
    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
   549
      let
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   550
        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
   551
          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
   552
            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
   553
          end;
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   554
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
   555
        fun mk_raw_prem_prems _ (x as Free (_, Type _)) (X as TFree _) =
54237
7cc6e286fe28 made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents: 54236
diff changeset
   556
            [([], (find_index (curry (op =) X) Xs + 1, x))]
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
   557
          | 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
   558
            (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
   559
              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
   560
            | 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
   561
              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
   562
                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
   563
                  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
   564
                  |> 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
   565
                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
   566
                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
   567
                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
   568
                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
   569
              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
   570
                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
   571
              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
   572
          | 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
   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
        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
   575
          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
   576
            (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
   577
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   578
        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
   579
          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
   580
              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
   581
            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
   582
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
   583
        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
   584
          let
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   585
            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
   586
            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
   587
          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
   588
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   589
        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
   590
          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
   591
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
   592
        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
   593
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   594
        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
   595
          Library.foldr (Logic.list_implies o apfst (map mk_prem)) (raw_premss,
54237
7cc6e286fe28 made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents: 54236
diff changeset
   596
            HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj (map2 (curry (op $)) ps us)));
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   597
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   598
        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
   599
55803
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
   600
        val ctor_induct' = ctor_induct OF (map2 mk_absumprodE fp_type_definitions 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
   601
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   602
        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
   603
          Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
55803
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
   604
            mk_induct_tac ctxt nn ns mss kksss (flat ctr_defss) ctor_induct' fp_abs_inverses
57397
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
   605
              abs_inverses fp_nesting_set_maps pre_set_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
   606
          |> singleton (Proof_Context.export names_lthy lthy)
55409
b74248961819 made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents: 55397
diff changeset
   607
          (* for "datatype_realizer.ML": *)
b74248961819 made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents: 55397
diff changeset
   608
          |> Thm.name_derivation (fst (dest_Type (hd fpTs)) ^ Long_Name.separator ^
b74248961819 made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents: 55397
diff changeset
   609
            (if nn > 1 then space_implode "_" (tl fp_b_names) ^ Long_Name.separator else "") ^
b74248961819 made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents: 55397
diff changeset
   610
            inductN);
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   611
      in
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   612
        `(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
   613
      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
52305
3f7b92017d71 avoid code duplication
blanchet
parents: 52304
diff changeset
   615
    val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss;
3f7b92017d71 avoid code duplication
blanchet
parents: 52304
diff changeset
   616
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   617
    fun mk_rec_thmss (_, x_Tssss, fss, _) recs rec_defs ctor_rec_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
   618
      let
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   619
        val frecs = map (lists_bmoc fss) recs;
51808
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   620
55871
a28817253b31 removed (co)iterators from documentation
blanchet
parents: 55869
diff changeset
   621
        fun mk_goal frec 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
   622
          fold_rev (fold_rev Logic.all) (xs :: fss)
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   623
            (mk_Trueprop_eq (frec $ 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
   624
52302
blanchet
parents: 52301
diff changeset
   625
        fun maybe_tick (T, U) u f =
blanchet
parents: 52301
diff changeset
   626
          if try (fst o HOLogic.dest_prodT) U = SOME T then
blanchet
parents: 52301
diff changeset
   627
            Term.lambda u (HOLogic.mk_prod (u, f $ u))
blanchet
parents: 52301
diff changeset
   628
          else
blanchet
parents: 52301
diff changeset
   629
            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
   630
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   631
        fun build_rec (x as Free (_, T)) U =
52368
blanchet
parents: 52367
diff changeset
   632
          if T = U then
blanchet
parents: 52367
diff changeset
   633
            x
blanchet
parents: 52367
diff changeset
   634
          else
57303
498a62e65f5f tune the implementation of 'rel_coinduct'
desharna
parents: 57302
diff changeset
   635
            build_map lthy [] (indexify (perhaps (try (snd o HOLogic.dest_prodT)) o snd) Cs
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   636
              (fn kk => fn TU => maybe_tick TU (nth us kk) (nth frecs kk))) (T, U) $ x;
52301
7935e82a4ae4 simpler, more robust iterator goal construction code
blanchet
parents: 52300
diff changeset
   637
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   638
        val fxsss = map2 (map2 (flat_rec_arg_args oo map2 (map o build_rec))) xsss x_Tssss;
55871
a28817253b31 removed (co)iterators from documentation
blanchet
parents: 55869
diff changeset
   639
        val goalss = map5 (map4 o mk_goal) frecs 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
   640
57397
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
   641
        val tacss = map4 (map ooo
57399
cfc19f0a6261 compile
blanchet
parents: 57397
diff changeset
   642
              mk_rec_tac pre_map_defs (fp_nesting_map_ident0s @ live_nesting_map_ident0s) rec_defs)
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   643
            ctor_rec_thms fp_abs_inverses abs_inverses 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
   644
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   645
        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
   646
          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
   647
          |> 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
   648
      in
52305
3f7b92017d71 avoid code duplication
blanchet
parents: 52304
diff changeset
   649
        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
   650
      end;
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   651
56641
029997d3b5d8 reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents: 56640
diff changeset
   652
    val rec_thmss = mk_rec_thmss (the rec_args_typess) recs rec_defs ctor_rec_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
   653
  in
57471
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   654
    ((induct_thms, induct_thm, mk_induct_attrs ctrss),
55856
bddaada24074 got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents: 55803
diff changeset
   655
     (rec_thmss, code_nitpicksimp_attrs @ simp_attrs))
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
  end;
355dcd6a9b3c factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents: 51805
diff changeset
   657
57535
9b99b773acd4 made SML/NJ happier
blanchet
parents: 57525
diff changeset
   658
fun mk_coinduct_attributes fpTs ctrss discss mss =
57302
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   659
  let
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   660
    val nn = length fpTs;
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   661
    val fp_b_names = map base_name_of_typ fpTs;
57535
9b99b773acd4 made SML/NJ happier
blanchet
parents: 57525
diff changeset
   662
57302
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   663
    fun mk_coinduct_concls ms discs ctrs =
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   664
      let
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   665
        fun mk_disc_concl disc = [name_of_disc disc];
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   666
        fun mk_ctr_concl 0 _ = []
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   667
          | mk_ctr_concl _ ctor = [name_of_ctr ctor];
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   668
        val disc_concls = map mk_disc_concl (fst (split_last discs)) @ [[]];
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   669
        val ctr_concls = map2 mk_ctr_concl ms ctrs;
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   670
      in
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   671
        flat (map2 append disc_concls ctr_concls)
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   672
      end;
57535
9b99b773acd4 made SML/NJ happier
blanchet
parents: 57525
diff changeset
   673
57302
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   674
    val coinduct_cases = quasi_unambiguous_case_names (map (prefix EqN) fp_b_names);
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   675
    val coinduct_conclss =
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   676
      map3 (quasi_unambiguous_case_names ooo mk_coinduct_concls) mss discss ctrss;
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   677
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   678
    val common_coinduct_consumes_attr = Attrib.internal (K (Rule_Cases.consumes nn));
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   679
    val coinduct_consumes_attr = Attrib.internal (K (Rule_Cases.consumes 1));
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   680
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   681
    val coinduct_case_names_attr = Attrib.internal (K (Rule_Cases.case_names coinduct_cases));
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   682
    val coinduct_case_concl_attrs =
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   683
      map2 (fn casex => fn concls =>
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   684
          Attrib.internal (K (Rule_Cases.case_conclusion (casex, concls))))
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   685
        coinduct_cases coinduct_conclss;
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   686
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   687
    val common_coinduct_attrs =
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   688
      common_coinduct_consumes_attr :: coinduct_case_names_attr :: coinduct_case_concl_attrs;
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   689
    val coinduct_attrs =
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   690
      coinduct_consumes_attr :: coinduct_case_names_attr :: coinduct_case_concl_attrs;
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   691
  in
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   692
    (coinduct_attrs, common_coinduct_attrs)
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   693
  end;
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   694
57535
9b99b773acd4 made SML/NJ happier
blanchet
parents: 57525
diff changeset
   695
fun derive_rel_coinduct_thm_for_types lthy fpA_Ts ns As Bs mss (ctr_sugars : ctr_sugar list)
9b99b773acd4 made SML/NJ happier
blanchet
parents: 57525
diff changeset
   696
    abs_inverses abs_injects ctor_injects dtor_ctors rel_pre_defs ctor_defss dtor_rel_coinduct
9b99b773acd4 made SML/NJ happier
blanchet
parents: 57525
diff changeset
   697
    live_nesting_rel_eqs =
57301
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   698
  let
57302
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   699
    val fpB_Ts = map (typ_subst_nonatomic (As ~~ Bs)) fpA_Ts;
57301
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   700
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   701
    val (Rs, IRs, fpAs, fpBs, names_lthy) =
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   702
      let
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   703
        val fp_names = map base_name_of_typ fpA_Ts;
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   704
        val ((((Rs, IRs), fpAs_names), fpBs_names), names_lthy) = lthy
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   705
          |> mk_Frees "R" (map2 mk_pred2T As Bs)
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   706
          ||>> mk_Frees "IR" (map2 mk_pred2T fpA_Ts fpB_Ts)
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   707
          ||>> Variable.variant_fixes fp_names
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   708
          ||>> Variable.variant_fixes (map (suffix "'") fp_names);
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   709
      in
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   710
        (Rs, IRs,
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   711
          map2 (curry Free) fpAs_names fpA_Ts,
57302
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   712
          map2 (curry Free) fpBs_names fpB_Ts,
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   713
          names_lthy)
57301
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   714
      end;
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   715
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   716
    val ((discA_tss, selA_tsss), (discB_tss, selB_tsss)) =
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   717
      let
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   718
        val discss = map #discs ctr_sugars;
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   719
        val selsss = map #selss ctr_sugars;
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   720
        fun mk_discss ts Ts = map2 (map o rapp) ts (map (map (mk_disc_or_sel Ts)) discss);
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   721
        fun mk_selsss ts Ts = map2 (map o map o rapp) ts (map (map (map (mk_disc_or_sel Ts)))
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   722
          selsss);
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   723
      in
57302
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   724
        ((mk_discss fpAs As, mk_selsss fpAs As),
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   725
         (mk_discss fpBs Bs, mk_selsss fpBs Bs))
57301
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   726
      end;
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   727
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   728
    val premises =
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   729
      let
57525
f9dd8a33f820 generate 'rel_cases' theorem for (co)datatypes
desharna
parents: 57493
diff changeset
   730
        fun build_the_rel A B = build_rel lthy fpA_Ts (the o choose_relator (Rs @ IRs)) (A, B);
57301
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   731
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   732
        fun build_rel_app selA_t selB_t =
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   733
          (build_the_rel (fastype_of selA_t) (fastype_of selB_t )) $ selA_t $ selB_t
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   734
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   735
        fun mk_prem_ctr_concls n k discA_t selA_ts discB_t selB_ts =
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   736
          (if k = n then [] else [HOLogic.mk_eq (discA_t, discB_t)]) @
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   737
          (case (selA_ts, selB_ts) of
57303
498a62e65f5f tune the implementation of 'rel_coinduct'
desharna
parents: 57302
diff changeset
   738
            ([], []) => []
57301
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   739
          | (_ :: _, _ :: _) =>
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   740
            [Library.foldr HOLogic.mk_imp (if n = 1 then [] else [discA_t, discB_t],
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   741
              Library.foldr1 HOLogic.mk_conj (map2 build_rel_app selA_ts selB_ts))]);
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   742
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   743
        fun mk_prem_concl n discA_ts selA_tss discB_ts selB_tss =
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   744
          Library.foldr1 HOLogic.mk_conj (flat (map5 (mk_prem_ctr_concls n)
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   745
            (1 upto n) discA_ts selA_tss discB_ts selB_tss))
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   746
          handle List.Empty => @{term True};
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   747
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   748
        fun mk_prem IR tA tB n discA_ts selA_tss discB_ts selB_tss =
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   749
          fold_rev Logic.all [tA, tB] (Logic.mk_implies (HOLogic.mk_Trueprop (IR $ tA $ tB),
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   750
            HOLogic.mk_Trueprop (mk_prem_concl n discA_ts selA_tss discB_ts selB_tss)));
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   751
      in
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   752
        map8 mk_prem IRs fpAs fpBs ns discA_tss selA_tsss discB_tss selB_tsss
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   753
      end;
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   754
57525
f9dd8a33f820 generate 'rel_cases' theorem for (co)datatypes
desharna
parents: 57493
diff changeset
   755
    val goal = HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj (map2 mk_leq
f9dd8a33f820 generate 'rel_cases' theorem for (co)datatypes
desharna
parents: 57493
diff changeset
   756
      IRs (map (build_rel lthy [] (the o choose_relator (Rs @ IRs))) (fpA_Ts ~~ fpB_Ts))));
57302
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   757
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   758
    val rel_coinduct0_thm = Goal.prove_sorry lthy [] premises goal
57301
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   759
      (fn {context = ctxt, prems = prems} =>
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   760
          mk_rel_coinduct0_tac ctxt dtor_rel_coinduct (map (certify ctxt) IRs) prems
57303
498a62e65f5f tune the implementation of 'rel_coinduct'
desharna
parents: 57302
diff changeset
   761
            (map #exhaust ctr_sugars) (map (flat o #disc_thmss) ctr_sugars)
498a62e65f5f tune the implementation of 'rel_coinduct'
desharna
parents: 57302
diff changeset
   762
            (map (flat o #sel_thmss) ctr_sugars) ctor_defss dtor_ctors ctor_injects abs_injects
57471
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   763
            rel_pre_defs abs_inverses live_nesting_rel_eqs)
57301
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   764
      |> singleton (Proof_Context.export names_lthy lthy)
57302
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   765
      |> Thm.close_derivation;
58f02fbaa764 generate 'rel_coinduct' theorem for codatatypes
desharna
parents: 57301
diff changeset
   766
  in
57471
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   767
    (postproc_co_induct lthy (length fpA_Ts) @{thm predicate2D} @{thm predicate2D_conj}
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   768
       rel_coinduct0_thm,
57535
9b99b773acd4 made SML/NJ happier
blanchet
parents: 57525
diff changeset
   769
     mk_coinduct_attributes fpA_Ts (map #ctrs ctr_sugars) (map #discs ctr_sugars) mss)
57301
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   770
  end;
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
   771
55871
a28817253b31 removed (co)iterators from documentation
blanchet
parents: 55869
diff changeset
   772
fun derive_coinduct_corecs_thms_for_types pre_bnfs (x, cs, cpss, ((pgss, cqgsss), _))
57397
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
   773
    dtor_coinduct dtor_injects dtor_ctors dtor_corec_thms live_nesting_bnfs fpTs Cs Xs ctrXs_Tsss
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
   774
    kss mss ns fp_abs_inverses abs_inverses mk_vimage2p ctr_defss (ctr_sugars : ctr_sugar list)
55864
516ab2906e7e rationalized internals
blanchet
parents: 55863
diff changeset
   775
    corecs corec_defs export_args lthy =
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   776
  let
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   777
    fun mk_ctor_dtor_corec_thm dtor_inject dtor_ctor corec =
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   778
      iffD1 OF [dtor_inject, trans OF [corec, dtor_ctor RS sym]];
53203
222ea6acbdd6 moved derivation of ctor_dtor_unfold to sugar (streamlines fp_result interface)
traytel
parents: 53143
diff changeset
   779
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   780
    val ctor_dtor_corec_thms = map3 mk_ctor_dtor_corec_thm dtor_injects dtor_ctors dtor_corec_thms;
53203
222ea6acbdd6 moved derivation of ctor_dtor_unfold to sugar (streamlines fp_result interface)
traytel
parents: 53143
diff changeset
   781
51815
efacb9b99865 tune signatures
blanchet
parents: 51814
diff changeset
   782
    val nn = length pre_bnfs;
efacb9b99865 tune signatures
blanchet
parents: 51814
diff changeset
   783
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   784
    val pre_map_defs = map map_def_of_bnf pre_bnfs;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   785
    val pre_rel_defs = map rel_def_of_bnf pre_bnfs;
57399
cfc19f0a6261 compile
blanchet
parents: 57397
diff changeset
   786
    val live_nesting_map_ident0s = map map_ident0_of_bnf live_nesting_bnfs;
57397
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
   787
    val live_nesting_rel_eqs = map rel_eq_of_bnf live_nesting_bnfs;
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   788
51816
5f1dec4297da use base names, not full names
blanchet
parents: 51815
diff changeset
   789
    val fp_b_names = map base_name_of_typ fpTs;
51811
1461426e2bf1 tuned function signatures
blanchet
parents: 51810
diff changeset
   790
53210
7219c61796c0 simplify code (now that ctr_sugar uses the same type variables as fp_sugar)
blanchet
parents: 53203
diff changeset
   791
    val ctrss = map #ctrs ctr_sugars;
7219c61796c0 simplify code (now that ctr_sugar uses the same type variables as fp_sugar)
blanchet
parents: 53203
diff changeset
   792
    val discss = map #discs ctr_sugars;
7219c61796c0 simplify code (now that ctr_sugar uses the same type variables as fp_sugar)
blanchet
parents: 53203
diff changeset
   793
    val selsss = map #selss ctr_sugars;
51840
b304fb6c5ef5 renamed records
blanchet
parents: 51839
diff changeset
   794
    val exhausts = map #exhaust ctr_sugars;
b304fb6c5ef5 renamed records
blanchet
parents: 51839
diff changeset
   795
    val disc_thmsss = map #disc_thmss ctr_sugars;
b304fb6c5ef5 renamed records
blanchet
parents: 51839
diff changeset
   796
    val discIss = map #discIs ctr_sugars;
b304fb6c5ef5 renamed records
blanchet
parents: 51839
diff changeset
   797
    val sel_thmsss = map #sel_thmss ctr_sugars;
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   798
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   799
    val (((rs, us'), vs'), names_lthy) =
52341
blanchet
parents: 52340
diff changeset
   800
      lthy
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   801
      |> mk_Frees "R" (map (fn T => mk_pred2T T T) fpTs)
51816
5f1dec4297da use base names, not full names
blanchet
parents: 51815
diff changeset
   802
      ||>> Variable.variant_fixes fp_b_names
5f1dec4297da use base names, not full names
blanchet
parents: 51815
diff changeset
   803
      ||>> Variable.variant_fixes (map (suffix "'") fp_b_names);
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   804
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   805
    val us = map2 (curry Free) us' fpTs;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   806
    val udiscss = map2 (map o rapp) us discss;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   807
    val uselsss = map2 (map o map o rapp) us selsss;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   808
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   809
    val vs = map2 (curry Free) vs' fpTs;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   810
    val vdiscss = map2 (map o rapp) vs discss;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   811
    val vselsss = map2 (map o map o rapp) vs selsss;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   812
52345
blanchet
parents: 52344
diff changeset
   813
    val coinduct_thms_pairs =
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   814
      let
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   815
        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
   816
        val uv_eqs = map2 (curry HOLogic.mk_eq) us vs;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   817
        val strong_rs =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   818
          map4 (fn u => fn v => fn uvr => fn uv_eq =>
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   819
            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
   820
54237
7cc6e286fe28 made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents: 54236
diff changeset
   821
        fun build_the_rel rs' T Xs_T =
57303
498a62e65f5f tune the implementation of 'rel_coinduct'
desharna
parents: 57302
diff changeset
   822
          build_rel lthy [] (fn (_, X) => nth rs' (find_index (curry (op =) X) Xs)) (T, Xs_T)
54237
7cc6e286fe28 made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents: 54236
diff changeset
   823
          |> Term.subst_atomic_types (Xs ~~ fpTs);
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   824
54237
7cc6e286fe28 made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents: 54236
diff changeset
   825
        fun build_rel_app rs' usel vsel Xs_T =
7cc6e286fe28 made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents: 54236
diff changeset
   826
          fold rapp [usel, vsel] (build_the_rel rs' (fastype_of usel) Xs_T);
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   827
54237
7cc6e286fe28 made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents: 54236
diff changeset
   828
        fun mk_prem_ctr_concls rs' n k udisc usels vdisc vsels ctrXs_Ts =
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   829
          (if k = n then [] else [HOLogic.mk_eq (udisc, vdisc)]) @
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   830
          (if null usels then
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   831
             []
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   832
           else
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   833
             [Library.foldr HOLogic.mk_imp (if n = 1 then [] else [udisc, vdisc],
54237
7cc6e286fe28 made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents: 54236
diff changeset
   834
                Library.foldr1 HOLogic.mk_conj (map3 (build_rel_app rs') usels vsels ctrXs_Ts))]);
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   835
54237
7cc6e286fe28 made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents: 54236
diff changeset
   836
        fun mk_prem_concl rs' n udiscs uselss vdiscs vselss ctrXs_Tss =
7cc6e286fe28 made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents: 54236
diff changeset
   837
          Library.foldr1 HOLogic.mk_conj (flat (map6 (mk_prem_ctr_concls rs' n)
7cc6e286fe28 made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents: 54236
diff changeset
   838
            (1 upto n) udiscs uselss vdiscs vselss ctrXs_Tss))
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   839
          handle List.Empty => @{term True};
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   840
54237
7cc6e286fe28 made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents: 54236
diff changeset
   841
        fun mk_prem rs' uvr u v n udiscs uselss vdiscs vselss ctrXs_Tss =
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   842
          fold_rev Logic.all [u, v] (Logic.mk_implies (HOLogic.mk_Trueprop uvr,
54237
7cc6e286fe28 made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents: 54236
diff changeset
   843
            HOLogic.mk_Trueprop (mk_prem_concl rs' n udiscs uselss vdiscs vselss ctrXs_Tss)));
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   844
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   845
        val concl =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   846
          HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   847
            (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
   848
               uvrs us vs));
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   849
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   850
        fun mk_goal rs' =
54237
7cc6e286fe28 made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents: 54236
diff changeset
   851
          Logic.list_implies (map9 (mk_prem rs') uvrs us vs ns udiscss uselsss vdiscss vselsss
7cc6e286fe28 made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents: 54236
diff changeset
   852
            ctrXs_Tsss, concl);
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   853
52345
blanchet
parents: 52344
diff changeset
   854
        val goals = map mk_goal [rs, strong_rs];
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   855
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   856
        fun prove dtor_coinduct' goal =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   857
          Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
57397
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
   858
            mk_coinduct_tac ctxt live_nesting_rel_eqs nn ns dtor_coinduct' pre_rel_defs
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
   859
              fp_abs_inverses abs_inverses dtor_ctors exhausts ctr_defss disc_thmsss sel_thmsss)
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   860
          |> singleton (Proof_Context.export names_lthy lthy)
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   861
          |> Thm.close_derivation;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   862
53106
d81211f61a1b moved derivation of strong coinduction to sugar
traytel
parents: 53037
diff changeset
   863
        val rel_eqs = map rel_eq_of_bnf pre_bnfs;
d81211f61a1b moved derivation of strong coinduction to sugar
traytel
parents: 53037
diff changeset
   864
        val rel_monos = map rel_mono_of_bnf pre_bnfs;
d81211f61a1b moved derivation of strong coinduction to sugar
traytel
parents: 53037
diff changeset
   865
        val dtor_coinducts =
55803
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
   866
          [dtor_coinduct, mk_strong_coinduct_thm dtor_coinduct rel_eqs rel_monos mk_vimage2p lthy]
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   867
      in
57471
11cd462e31ec generate 'rel_induct' theorem for datatypes
desharna
parents: 57399
diff changeset
   868
        map2 (postproc_co_induct lthy nn mp mp_conj oo prove) dtor_coinducts goals
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   869
      end;
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 mk_maybe_not pos = not pos ? HOLogic.mk_not;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   872
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   873
    val gcorecs = map (lists_bmoc pgss) corecs;
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   874
55856
bddaada24074 got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents: 55803
diff changeset
   875
    val corec_thmss =
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   876
      let
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   877
        fun mk_goal c cps gcorec n k ctr m cfs' =
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   878
          fold_rev (fold_rev Logic.all) ([c] :: pgss)
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   879
            (Logic.list_implies (seq_conds (HOLogic.mk_Trueprop oo mk_maybe_not) n k cps,
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   880
               mk_Trueprop_eq (gcorec $ c, Term.list_comb (ctr, take m cfs'))));
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   881
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   882
        val mk_U = typ_subst_nonatomic (map2 (fn C => fn fpT => (mk_sumT (fpT, C), fpT)) Cs fpTs);
52347
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   883
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   884
        fun tack (c, u) f =
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   885
          let val x' = Free (x, mk_sumT (fastype_of u, fastype_of c)) in
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   886
            Term.lambda x' (mk_case_sum (Term.lambda u u, Term.lambda c (f $ c)) $ x')
52347
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   887
          end;
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   888
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   889
        fun build_corec cqg =
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   890
          let val T = fastype_of cqg in
52347
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   891
            if exists_subtype_in Cs T then
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   892
              let val U = mk_U T in
57303
498a62e65f5f tune the implementation of 'rel_coinduct'
desharna
parents: 57302
diff changeset
   893
                build_map lthy [] (indexify fst (map2 (curry mk_sumT) fpTs Cs) (fn kk => fn _ =>
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   894
                  tack (nth cs kk, nth us kk) (nth gcorecs kk))) (T, U) $ cqg
52368
blanchet
parents: 52367
diff changeset
   895
              end
52347
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   896
            else
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   897
              cqg
52347
ead18e3b2c1b changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents: 52346
diff changeset
   898
          end;
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   899
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   900
        val cqgsss' = map (map (map build_corec)) cqgsss;
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   901
        val goalss = map8 (map4 oooo mk_goal) cs cpss gcorecs ns kss ctrss mss cqgsss';
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   902
55856
bddaada24074 got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents: 55803
diff changeset
   903
        val tacss =
57399
cfc19f0a6261 compile
blanchet
parents: 57397
diff changeset
   904
          map4 (map ooo mk_corec_tac corec_defs live_nesting_map_ident0s)
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   905
            ctor_dtor_corec_thms pre_map_defs abs_inverses ctr_defss;
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 =
51815
efacb9b99865 tune signatures
blanchet
parents: 51814
diff changeset
   908
          Goal.prove_sorry lthy [] [] goal (tac o #context)
efacb9b99865 tune signatures
blanchet
parents: 51814
diff changeset
   909
          |> Thm.close_derivation;
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   910
      in
55856
bddaada24074 got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents: 55803
diff changeset
   911
        map2 (map2 prove) goalss tacss
bddaada24074 got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents: 55803
diff changeset
   912
        |> map (map (unfold_thms lthy @{thms case_sum_if}))
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   913
      end;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   914
55856
bddaada24074 got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents: 55803
diff changeset
   915
    val disc_corec_iff_thmss =
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   916
      let
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   917
        fun mk_goal c cps gcorec n k disc =
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   918
          mk_Trueprop_eq (disc $ (gcorec $ c),
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   919
            if n = 1 then @{const True}
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   920
            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
   921
55869
54ddb003e128 rationalized internals
blanchet
parents: 55868
diff changeset
   922
        val goalss = map6 (map2 oooo mk_goal) cs cpss gcorecs ns kss discss;
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   923
51828
67c6d6136915 whitespace tuning
blanchet
parents: 51827
diff changeset
   924
        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
   925
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   926
        val case_splitss' = map (map mk_case_split') cpss;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   927
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   928
        val tacss = map3 (map oo mk_disc_corec_iff_tac) case_splitss' corec_thmss disc_thmsss;
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   929
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   930
        fun prove goal tac =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   931
          Goal.prove_sorry lthy [] [] goal (tac o #context)
52357
a5d3730043c2 use right context when exporting variables (cf. AFP Coinductive_List failures)
blanchet
parents: 52356
diff changeset
   932
          |> singleton export_args
51829
3cc93eeac8cc signature tuning
blanchet
parents: 51828
diff changeset
   933
          |> singleton (Proof_Context.export names_lthy lthy)
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   934
          |> Thm.close_derivation;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   935
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   936
        fun proves [_] [_] = []
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   937
          | proves goals tacs = map2 prove goals tacs;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   938
      in
55856
bddaada24074 got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents: 55803
diff changeset
   939
        map2 proves goalss tacss
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   940
      end;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   941
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   942
    fun mk_disc_corec_thms corecs discIs = map (op RS) (corecs ~~ discIs);
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   943
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   944
    val disc_corec_thmss = map2 mk_disc_corec_thms corec_thmss discIss;
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   945
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   946
    fun mk_sel_corec_thm corec_thm sel sel_thm =
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   947
      let
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   948
        val (domT, ranT) = dest_funT (fastype_of sel);
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   949
        val arg_cong' =
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   950
          Drule.instantiate' (map (SOME o certifyT lthy) [domT, ranT])
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   951
            [NONE, NONE, SOME (certify lthy sel)] arg_cong
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   952
          |> Thm.varifyT_global;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   953
        val sel_thm' = sel_thm RSN (2, trans);
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   954
      in
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   955
        corec_thm RS arg_cong' RS sel_thm'
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   956
      end;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   957
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   958
    fun mk_sel_corec_thms corec_thmss =
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   959
      map3 (map3 (map2 o mk_sel_corec_thm)) corec_thmss selsss sel_thmsss;
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   960
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
   961
    val sel_corec_thmsss = mk_sel_corec_thms corec_thmss;
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   962
  in
57535
9b99b773acd4 made SML/NJ happier
blanchet
parents: 57525
diff changeset
   963
    ((coinduct_thms_pairs,
9b99b773acd4 made SML/NJ happier
blanchet
parents: 57525
diff changeset
   964
      mk_coinduct_attributes fpTs (map #ctrs ctr_sugars) (map #discs ctr_sugars) mss),
57489
8f0ba9f2d10f generate 'corec_code' theorem for codatatypes
desharna
parents: 57471
diff changeset
   965
     corec_thmss,
8f0ba9f2d10f generate 'corec_code' theorem for codatatypes
desharna
parents: 57471
diff changeset
   966
     disc_corec_thmss,
55856
bddaada24074 got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents: 55803
diff changeset
   967
     (disc_corec_iff_thmss, simp_attrs),
bddaada24074 got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents: 55803
diff changeset
   968
     (sel_corec_thmsss, simp_attrs))
51810
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   969
  end;
7b75fab5ebf5 factored out derivation of coinduction, unfold, corec
blanchet
parents: 51808
diff changeset
   970
52207
21026c312cc3 tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents: 52197
diff changeset
   971
fun define_co_datatypes prepare_constraint prepare_typ prepare_term fp construct_fp
57094
589ec121ce1a don't generate discriminators and selectors for 'datatype_new' unless the user asked for it
blanchet
parents: 57091
diff changeset
   972
    ((discs_sels0, no_code), specs) no_defs_lthy0 =
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   973
  let
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   974
    (* TODO: sanity checks on arguments *)
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   975
57094
589ec121ce1a don't generate discriminators and selectors for 'datatype_new' unless the user asked for it
blanchet
parents: 57091
diff changeset
   976
    val discs_sels = discs_sels0 orelse fp = Greatest_FP;
49278
718e4ad1517e added no_dests option
blanchet
parents: 49277
diff changeset
   977
49367
blanchet
parents: 49366
diff changeset
   978
    val nn = length specs;
55469
b19dd108f0c2 aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents: 55468
diff changeset
   979
    val fp_bs = map type_binding_of_spec specs;
49498
acc583e14167 tuned variable names
blanchet
parents: 49484
diff changeset
   980
    val fp_b_names = map Binding.name_of fp_bs;
acc583e14167 tuned variable names
blanchet
parents: 49484
diff changeset
   981
    val fp_common_name = mk_common_name fp_b_names;
55469
b19dd108f0c2 aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents: 55468
diff changeset
   982
    val map_bs = map map_binding_of_spec specs;
b19dd108f0c2 aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents: 55468
diff changeset
   983
    val rel_bs = map rel_binding_of_spec specs;
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   984
51758
55963309557b honor user-specified name for map function
blanchet
parents: 51757
diff changeset
   985
    fun prepare_type_arg (_, (ty, c)) =
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   986
      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
   987
        TFree (s, prepare_constraint no_defs_lthy0 c)
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   988
      end;
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   989
55469
b19dd108f0c2 aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents: 55468
diff changeset
   990
    val Ass0 = map (map prepare_type_arg o type_args_named_constrained_of_spec) specs;
56254
a2dd9200854d more antiquotations;
wenzelm
parents: 56049
diff changeset
   991
    val unsorted_Ass0 = map (map (resort_tfree @{sort type})) Ass0;
55700
cf6a029b28d8 more precise error message
blanchet
parents: 55699
diff changeset
   992
    val unsorted_As = Library.foldr1 (merge_type_args fp) unsorted_Ass0;
53266
89f7f1cc9ae3 cleaner handling of bootstrapping "fake" context, with fewer (no?) obscure bugs
blanchet
parents: 53264
diff changeset
   993
    val num_As = length unsorted_As;
55699
1f9cc432ecd4 reuse same parser for '(co)datatype(_new)' as for 'bnf_decl'
blanchet
parents: 55575
diff changeset
   994
1f9cc432ecd4 reuse same parser for '(co)datatype(_new)' as for 'bnf_decl'
blanchet
parents: 55575
diff changeset
   995
    val set_boss = map (map fst o type_args_named_constrained_of_spec) specs;
1f9cc432ecd4 reuse same parser for '(co)datatype(_new)' as for 'bnf_decl'
blanchet
parents: 55575
diff changeset
   996
    val set_bss = map (map (the_default Binding.empty)) set_boss;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   997
49585
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
   998
    val (((Bs0, Cs), Xs), no_defs_lthy) =
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   999
      no_defs_lthy0
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
  1000
      |> fold (Variable.declare_typ o resort_tfree dummyS) unsorted_As
53266
89f7f1cc9ae3 cleaner handling of bootstrapping "fake" context, with fewer (no?) obscure bugs
blanchet
parents: 53264
diff changeset
  1001
      |> mk_TFrees num_As
49585
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1002
      ||>> mk_TFrees nn
51858
7a08fe1e19b1 added and moved library functions (used in primrec code)
blanchet
parents: 51857
diff changeset
  1003
      ||>> variant_tfrees fp_b_names;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
  1004
55469
b19dd108f0c2 aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents: 55468
diff changeset
  1005
    fun add_fake_type spec =
b19dd108f0c2 aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents: 55468
diff changeset
  1006
      Typedecl.basic_typedecl (type_binding_of_spec spec, num_As, mixfix_of_spec spec);
51768
d2a236b10796 proper error generated for wrong mixfix
blanchet
parents: 51767
diff changeset
  1007
53268
de1dc709f9d4 handle type class annotations on (co)datatype parameters gracefully
blanchet
parents: 53266
diff changeset
  1008
    val (fake_T_names, fake_lthy) = fold_map add_fake_type specs no_defs_lthy0;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
  1009
53262
23927b18dce2 rationalize message generation + added a warning
blanchet
parents: 53260
diff changeset
  1010
    val qsoty = quote o Syntax.string_of_typ fake_lthy;
23927b18dce2 rationalize message generation + added a warning
blanchet
parents: 53260
diff changeset
  1011
54253
04cd231e2b9e nicer error message in case of duplicates
blanchet
parents: 54243
diff changeset
  1012
    val _ = (case Library.duplicates (op =) unsorted_As of [] => ()
53262
23927b18dce2 rationalize message generation + added a warning
blanchet
parents: 53260
diff changeset
  1013
      | A :: _ => error ("Duplicate type parameter " ^ qsoty A ^ " in " ^ co_prefix fp ^
23927b18dce2 rationalize message generation + added a warning
blanchet
parents: 53260
diff changeset
  1014
          "datatype specification"));
23927b18dce2 rationalize message generation + added a warning
blanchet
parents: 53260
diff changeset
  1015
23927b18dce2 rationalize message generation + added a warning
blanchet
parents: 53260
diff changeset
  1016
    val bad_args =
23927b18dce2 rationalize message generation + added a warning
blanchet
parents: 53260
diff changeset
  1017
      map (Logic.type_map (singleton (Variable.polymorphic no_defs_lthy0))) unsorted_As
23927b18dce2 rationalize message generation + added a warning
blanchet
parents: 53260
diff changeset
  1018
      |> filter_out Term.is_TVar;
23927b18dce2 rationalize message generation + added a warning
blanchet
parents: 53260
diff changeset
  1019
    val _ = null bad_args orelse
23927b18dce2 rationalize message generation + added a warning
blanchet
parents: 53260
diff changeset
  1020
      error ("Locally fixed type argument " ^ qsoty (hd bad_args) ^ " in " ^ co_prefix fp ^
23927b18dce2 rationalize message generation + added a warning
blanchet
parents: 53260
diff changeset
  1021
        "datatype specification");
23927b18dce2 rationalize message generation + added a warning
blanchet
parents: 53260
diff changeset
  1022
55469
b19dd108f0c2 aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents: 55468
diff changeset
  1023
    val mixfixes = map mixfix_of_spec specs;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
  1024
54253
04cd231e2b9e nicer error message in case of duplicates
blanchet
parents: 54243
diff changeset
  1025
    val _ = (case Library.duplicates Binding.eq_name fp_bs of [] => ()
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
  1026
      | b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b)));
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
  1027
55469
b19dd108f0c2 aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents: 55468
diff changeset
  1028
    val mx_ctr_specss = map mixfixed_ctr_specs_of_spec specs;
b19dd108f0c2 aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents: 55468
diff changeset
  1029
    val ctr_specss = map (map fst) mx_ctr_specss;
b19dd108f0c2 aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents: 55468
diff changeset
  1030
    val ctr_mixfixess = map (map snd) mx_ctr_specss;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
  1031
55469
b19dd108f0c2 aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents: 55468
diff changeset
  1032
    val disc_bindingss = map (map disc_of_ctr_spec) ctr_specss;
49336
blanchet
parents: 49330
diff changeset
  1033
    val ctr_bindingss =
55469
b19dd108f0c2 aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents: 55468
diff changeset
  1034
      map2 (fn fp_b_name => map (Binding.qualify false fp_b_name o ctr_of_ctr_spec)) fp_b_names
b19dd108f0c2 aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents: 55468
diff changeset
  1035
        ctr_specss;
b19dd108f0c2 aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents: 55468
diff changeset
  1036
    val ctr_argsss = map (map args_of_ctr_spec) ctr_specss;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
  1037
49336
blanchet
parents: 49330
diff changeset
  1038
    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
  1039
    val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss;
57200
aab87ffa60cc use 'where' clause for selector default value syntax
blanchet
parents: 57199
diff changeset
  1040
    val raw_sel_default_eqss = map sel_default_eqs_of_spec specs;
49286
dde4967c9233 added "defaults" option
blanchet
parents: 49280
diff changeset
  1041
49308
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents: 49302
diff changeset
  1042
    val (As :: _) :: fake_ctr_Tsss =
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
  1043
      burrow (burrow (Syntax.check_typs fake_lthy)) (Ass0 :: fake_ctr_Tsss0);
53262
23927b18dce2 rationalize message generation + added a warning
blanchet
parents: 53260
diff changeset
  1044
    val As' = map dest_TFree As;
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
  1045
49183
0cc46e2dee7e careful about constructor types w.r.t. fake context (third step of localization)
blanchet
parents: 49182
diff changeset
  1046
    val rhs_As' = fold (fold (fold Term.add_tfreesT)) fake_ctr_Tsss [];
53262
23927b18dce2 rationalize message generation + added a warning
blanchet
parents: 53260
diff changeset
  1047
    val _ = (case subtract (op =) As' rhs_As' of [] => ()
23927b18dce2 rationalize message generation + added a warning
blanchet
parents: 53260
diff changeset
  1048
      | extras => error ("Extra type variables on right-hand side: " ^
23927b18dce2 rationalize message generation + added a warning
blanchet
parents: 53260
diff changeset
  1049
          commas (map (qsoty o TFree) extras)));
49165
c6ccaf6df93c check type variables on rhs
blanchet
parents: 49161
diff changeset
  1050
53268
de1dc709f9d4 handle type class annotations on (co)datatype parameters gracefully
blanchet
parents: 53266
diff changeset
  1051
    val fake_Ts = map (fn s => Type (s, As)) fake_T_names;
de1dc709f9d4 handle type class annotations on (co)datatype parameters gracefully
blanchet
parents: 53266
diff changeset
  1052
53262
23927b18dce2 rationalize message generation + added a warning
blanchet
parents: 53260
diff changeset
  1053
    fun eq_fpT_check (T as Type (s, Ts)) (T' as Type (s', Ts')) =
23927b18dce2 rationalize message generation + added a warning
blanchet
parents: 53260
diff changeset
  1054
        s = s' andalso (Ts = Ts' orelse
23927b18dce2 rationalize message generation + added a warning
blanchet
parents: 53260
diff changeset
  1055
          error ("Wrong type arguments in " ^ co_prefix fp ^ "recursive type " ^ qsoty T ^
23927b18dce2 rationalize message generation + added a warning
blanchet
parents: 53260
diff changeset
  1056
            " (expected " ^ qsoty T' ^ ")"))
49591
91b228e26348 generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents: 49590
diff changeset
  1057
      | eq_fpT_check _ _ = false;
49146
e32b1f748854 added a check
blanchet
parents: 49135
diff changeset
  1058
53222
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1059
    fun freeze_fp (T as Type (s, Ts)) =
49591
91b228e26348 generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents: 49590
diff changeset
  1060
        (case find_index (eq_fpT_check T) fake_Ts of
53222
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1061
          ~1 => Type (s, map freeze_fp Ts)
49591
91b228e26348 generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents: 49590
diff changeset
  1062
        | kk => nth Xs kk)
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
  1063
      | freeze_fp T = T;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
  1064
53222
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1065
    val unfreeze_fp = Term.typ_subst_atomic (Xs ~~ fake_Ts);
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1066
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
  1067
    val ctrXs_Tsss = map (map (map freeze_fp)) fake_ctr_Tsss;
55966
972f0aa7091b balance tuples that represent curried functions
blanchet
parents: 55903
diff changeset
  1068
    val ctrXs_repTs = map mk_sumprodT_balanced ctrXs_Tsss;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
  1069
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
  1070
    val fp_eqs =
55803
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
  1071
      map dest_TFree Xs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctrXs_repTs;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
  1072
53262
23927b18dce2 rationalize message generation + added a warning
blanchet
parents: 53260
diff changeset
  1073
    val rhsXs_As' = fold (fold (fold Term.add_tfreesT)) ctrXs_Tsss [];
23927b18dce2 rationalize message generation + added a warning
blanchet
parents: 53260
diff changeset
  1074
    val _ = (case subtract (op =) rhsXs_As' As' of [] => ()
53266
89f7f1cc9ae3 cleaner handling of bootstrapping "fake" context, with fewer (no?) obscure bugs
blanchet
parents: 53264
diff changeset
  1075
      | extras => List.app (fn extra => warning ("Unused type variable on right-hand side of " ^
89f7f1cc9ae3 cleaner handling of bootstrapping "fake" context, with fewer (no?) obscure bugs
blanchet
parents: 53264
diff changeset
  1076
          co_prefix fp ^ "datatype definition: " ^ qsoty (TFree extra))) extras);
53262
23927b18dce2 rationalize message generation + added a warning
blanchet
parents: 53260
diff changeset
  1077
55701
38f75365fc2a added explicit killing
blanchet
parents: 55700
diff changeset
  1078
    val killed_As =
38f75365fc2a added explicit killing
blanchet
parents: 55700
diff changeset
  1079
      map_filter (fn (A, set_bos) => if exists is_none set_bos then SOME A else NONE)
38f75365fc2a added explicit killing
blanchet
parents: 55700
diff changeset
  1080
        (unsorted_As ~~ transpose set_boss);
38f75365fc2a added explicit killing
blanchet
parents: 55700
diff changeset
  1081
55803
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
  1082
    val ((pre_bnfs, absT_infos), (fp_res as {bnfs = fp_bnfs as any_fp_bnf :: _, ctors = ctors0,
55868
37b99986d435 rationalized internals
blanchet
parents: 55867
diff changeset
  1083
             dtors = dtors0, xtor_co_recs = xtor_co_recs0, xtor_co_induct, dtor_ctors,
55803
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
  1084
             ctor_dtors, ctor_injects, dtor_injects, xtor_map_thms, xtor_set_thmss, xtor_rel_thms,
57301
7b997028aaac generate 'rel_coinduct0' theorem for codatatypes
desharna
parents: 57279
diff changeset
  1085
             xtor_co_rec_thms, rel_xtor_co_induct_thm, ...},
53203
222ea6acbdd6 moved derivation of ctor_dtor_unfold to sugar (streamlines fp_result interface)
traytel
parents: 53143
diff changeset
  1086
           lthy)) =
55701
38f75365fc2a added explicit killing
blanchet
parents: 55700
diff changeset
  1087
      fp_bnf (construct_fp mixfixes map_bs rel_bs set_bss) fp_bs (map dest_TFree unsorted_As)
38f75365fc2a added explicit killing
blanchet
parents: 55700
diff changeset
  1088
        (map dest_TFree killed_As) fp_eqs no_defs_lthy0
53222
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1089
      handle BAD_DEAD (X, X_backdrop) =>
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1090
        (case X_backdrop of
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1091
          Type (bad_tc, _) =>
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1092
          let
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1093
            val fake_T = qsoty (unfreeze_fp X);
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1094
            val fake_T_backdrop = qsoty (unfreeze_fp X_backdrop);
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1095
            fun register_hint () =
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1096
              "\nUse the " ^ quote (fst (fst @{command_spec "bnf"})) ^ " command to register " ^
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1097
              quote bad_tc ^ " as a bounded natural functor to allow nested (co)recursion through \
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1098
              \it";
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1099
          in
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1100
            if is_some (bnf_of no_defs_lthy bad_tc) orelse
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1101
               is_some (fp_sugar_of no_defs_lthy bad_tc) then
53256
blanchet
parents: 53222
diff changeset
  1102
              error ("Inadmissible " ^ co_prefix fp ^ "recursive occurrence of type " ^ fake_T ^
blanchet
parents: 53222
diff changeset
  1103
                " in type expression " ^ fake_T_backdrop)
53222
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1104
            else if is_some (Datatype_Data.get_info (Proof_Context.theory_of no_defs_lthy)
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1105
                bad_tc) then
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1106
              error ("Unsupported " ^ co_prefix fp ^ "recursive occurrence of type " ^ fake_T ^
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1107
                " via the old-style datatype " ^ quote bad_tc ^ " in type expression " ^
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1108
                fake_T_backdrop ^ register_hint ())
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1109
            else
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1110
              error ("Unsupported " ^ co_prefix fp ^ "recursive occurrence of type " ^ fake_T ^
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1111
                " via type constructor " ^ quote bad_tc ^ " in type expression " ^ fake_T_backdrop ^
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1112
                register_hint ())
8b159677efb5 better error message
blanchet
parents: 53221
diff changeset
  1113
          end);
49585
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1114
55803
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
  1115
    val abss = map #abs absT_infos;
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
  1116
    val reps = map #rep absT_infos;
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
  1117
    val absTs = map #absT absT_infos;
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
  1118
    val repTs = map #repT absT_infos;
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
  1119
    val abs_injects = map #abs_inject absT_infos;
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
  1120
    val abs_inverses = map #abs_inverse absT_infos;
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
  1121
    val type_definitions = map #type_definition absT_infos;
74d3fe9031d8 joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents: 55772
diff changeset
  1122
53143
ba80154a1118 configuration option to control timing output for (co)datatypes
traytel
parents: 53126
diff changeset
  1123
    val time = time lthy;
49585
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1124
    val timer = time (Timer.startRealTimer ());
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
  1125
57397
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
  1126
    val fp_nesting_bnfs = nesting_bnfs lthy ctrXs_Tsss Xs;
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
  1127
    val live_nesting_bnfs = nesting_bnfs lthy ctrXs_Tsss As;
49226
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
  1128
49585
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1129
    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
  1130
    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
  1131
    val pre_rel_defs = map rel_def_of_bnf pre_bnfs;
57397
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
  1132
    val fp_nesting_set_maps = maps set_map_of_bnf fp_nesting_bnfs;
5004aca20821 tuned variable names
blanchet
parents: 57303
diff changeset
  1133
    val live_nesting_set_maps = maps set_map_of_bnf live_nesting_bnfs;
49585
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1134
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1135
    val live = live_of_bnf any_fp_bnf;
52961
bb8787b20437 added warning
blanchet
parents: 52960
diff changeset
  1136
    val _ =
bb8787b20437 added warning
blanchet
parents: 52960
diff changeset
  1137
      if live = 0 andalso exists (not o Binding.is_empty) (map_bs @ rel_bs) then
53266
89f7f1cc9ae3 cleaner handling of bootstrapping "fake" context, with fewer (no?) obscure bugs
blanchet
parents: 53264
diff changeset
  1138
        warning "Map function and relator names ignored"
52961
bb8787b20437 added warning
blanchet
parents: 52960
diff changeset
  1139
      else
bb8787b20437 added warning
blanchet
parents: 52960
diff changeset
  1140
        ();
49585
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1141
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1142
    val Bs =
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1143
      map3 (fn alive => fn A as TFree (_, S) => fn B => if alive then resort_tfree S B else A)
53266
89f7f1cc9ae3 cleaner handling of bootstrapping "fake" context, with fewer (no?) obscure bugs
blanchet
parents: 53264
diff changeset
  1144
        (liveness_of_fp_bnf num_As any_fp_bnf) As Bs0;
49585
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1145
5c4a12550491 generate high-level "maps", "sets", and "rels" properties
blanchet
parents: 49583
diff changeset
  1146
    val B_ify = Term.typ_subst_atomic (As ~~ Bs);
49167
68623861e0f2 print timing information
blanchet
parents: 49165
diff changeset
  1147
49501
acc9635a644a renamed "fld"/"unf" to "ctor"/"dtor"
blanchet
parents: 49498
diff changeset
  1148
    val ctors = map (mk_ctor As) ctors0;
acc9635a644a renamed "fld"/"unf" to "ctor"/"dtor"
blanchet
parents: 49498
diff changeset
  1149
    val dtors = map (mk_dtor As) dtors0;
49124
968e1b7de057 more work on FP sugar
blanchet
parents: 49123
diff changeset
  1150
49501
acc9635a644a renamed "fld"/"unf" to "ctor"/"dtor"
blanchet
parents: 49498
diff changeset
  1151
    val fpTs = map (domain_type o fastype_of) dtors;
56638
092a306bcc3d generate size instances for new-style datatypes
blanchet
parents: 56637
diff changeset
  1152
    val fpBTs = map B_ify fpTs;
49362
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
  1153
51780
67e4ed510dfb register coinductive type's coinduct rule
blanchet
parents: 51777
diff changeset
  1154
    fun massage_simple_notes base =
67e4ed510dfb register coinductive type's coinduct rule
blanchet
parents: 51777
diff changeset
  1155
      filter_out (null o #2)
67e4ed510dfb register coinductive type's coinduct rule
blanchet
parents: 51777
diff changeset
  1156
      #> map (fn (thmN, thms, attrs) =>
55410
54b09e82b9e1 killed 'rep_compat' option
blanchet
parents: 55409
diff changeset
  1157
        ((Binding.qualify true base (Binding.name thmN), attrs), [(thms, [])]));
51780
67e4ed510dfb register coinductive type's coinduct rule
blanchet
parents: 51777
diff changeset
  1158
67e4ed510dfb register coinductive type's coinduct rule
blanchet
parents: 51777
diff changeset
  1159
    val massage_multi_notes =
67e4ed510dfb register coinductive type's coinduct rule
blanchet
parents: 51777
diff changeset
  1160
      maps (fn (thmN, thmss, attrs) =>
53792
f0b273258d80 don't generate empty theorem collections
blanchet
parents: 53746
diff changeset
  1161
        map3 (fn fp_b_name => fn Type (T_name, _) => fn thms =>
55410
54b09e82b9e1 killed 'rep_compat' option
blanchet
parents: 55409
diff changeset
  1162
            ((Binding.qualify true fp_b_name (Binding.name thmN), attrs T_name), [(thms, [])]))
53792
f0b273258d80 don't generate empty theorem collections
blanchet
parents: 53746
diff changeset
  1163
          fp_b_names fpTs thmss)
f0b273258d80 don't generate empty theorem collections
blanchet
parents: 53746
diff changeset
  1164
      #> filter_out (null o fst o hd o snd);
51780
67e4ed510dfb register coinductive type's coinduct rule
blanchet
parents: 51777
diff changeset
  1165
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
  1166
    val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctrXs_Tsss;
49203
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
  1167
    val ns = map length ctr_Tsss;
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
  1168
    val kss = map (fn n => 1 upto n) ns;
49203
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
  1169
    val mss = map (map length) ctr_Tsss;
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
  1170
55867
79b915f26533 rationalized internals
blanchet
parents: 55865
diff changeset
  1171
    val ((xtor_co_recs, recs_args_types, corecs_args_types), lthy') =
55868
37b99986d435 rationalized internals
blanchet
parents: 55867
diff changeset
  1172
      mk_co_recs_prelims fp ctr_Tsss fpTs Cs absTs repTs ns mss xtor_co_recs0 lthy;
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
  1173
55803