src/Pure/Isar/code.ML
author haftmann
Tue, 20 Jun 2017 08:01:56 +0200
changeset 66125 28e782dd0278
parent 66024 77d9334830ec
child 66126 60bf6934fabd
permissions -rw-r--r--
tuned whitespace
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
24219
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
     1
(*  Title:      Pure/Isar/code.ML
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
     2
    Author:     Florian Haftmann, TU Muenchen
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
     3
34173
458ced35abb8 reduced code generator cache to the baremost minimum
haftmann
parents: 33977
diff changeset
     4
Abstract executable ingredients of theory.  Management of data
458ced35abb8 reduced code generator cache to the baremost minimum
haftmann
parents: 33977
diff changeset
     5
dependent on executable ingredients as synchronized cache; purged
458ced35abb8 reduced code generator cache to the baremost minimum
haftmann
parents: 33977
diff changeset
     6
on any change of underlying executable ingredients.
24219
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
     7
*)
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
     8
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
     9
signature CODE =
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
    10
sig
31957
a9742afd403e tuned interface of structure Code
haftmann
parents: 31890
diff changeset
    11
  (*constants*)
a9742afd403e tuned interface of structure Code
haftmann
parents: 31890
diff changeset
    12
  val check_const: theory -> term -> string
a9742afd403e tuned interface of structure Code
haftmann
parents: 31890
diff changeset
    13
  val read_const: theory -> string -> string
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
    14
  val string_of_const: theory -> string -> string
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
    15
  val args_number: theory -> string -> int
31957
a9742afd403e tuned interface of structure Code
haftmann
parents: 31890
diff changeset
    16
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
    17
  (*constructor sets*)
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
    18
  val constrset_of_consts: theory -> (string * typ) list
40726
16dcfedc4eb7 keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents: 40564
diff changeset
    19
    -> string * ((string * sort) list * (string * ((string * sort) list * typ list)) list)
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
    20
34874
89c230bf8feb added code certificates
haftmann
parents: 34272
diff changeset
    21
  (*code equations and certificates*)
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
    22
  val assert_eqn: theory -> thm * bool -> thm * bool
55722
b6ed5f896ce9 publish a useful function
kuncar
parents: 55721
diff changeset
    23
  val assert_abs_eqn: theory -> string option -> thm -> thm * string
34895
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
    24
  type cert
34874
89c230bf8feb added code certificates
haftmann
parents: 34272
diff changeset
    25
  val constrain_cert: theory -> sort list -> cert -> cert
49971
8b50286c36d3 close code theorems explicitly after preprocessing
haftmann
parents: 49904
diff changeset
    26
  val conclude_cert: cert -> cert
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
    27
  val typargs_deps_of_cert: theory -> cert -> (string * sort) list * (string * typ list) list
36209
566be5d48090 more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents: 36202
diff changeset
    28
  val equations_of_cert: theory -> cert -> ((string * sort) list * typ)
54889
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
    29
    * (((term * string option) list * (term * string option)) * (thm option * bool)) list option
34895
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
    30
  val pretty_cert: theory -> cert -> Pretty.T list
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
    31
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
    32
  (*executable code*)
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
    33
  val add_datatype: (string * typ) list -> theory -> theory
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
    34
  val add_datatype_cmd: string list -> theory -> theory
35299
4f4d5bf4ea08 proper distinction of code datatypes and abstypes
haftmann
parents: 35226
diff changeset
    35
  val datatype_interpretation:
40726
16dcfedc4eb7 keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents: 40564
diff changeset
    36
    (string * ((string * sort) list * (string * ((string * sort) list * typ list)) list)
35299
4f4d5bf4ea08 proper distinction of code datatypes and abstypes
haftmann
parents: 35226
diff changeset
    37
      -> theory -> theory) -> theory -> theory
36112
7fa17a225852 user interface for abstract datatypes is an attribute, not a command
haftmann
parents: 35845
diff changeset
    38
  val add_abstype: thm -> theory -> theory
59458
9de8ac92cafa abstract code equation may also be default
haftmann
parents: 59058
diff changeset
    39
  val add_abstype_default: thm -> theory -> theory
35299
4f4d5bf4ea08 proper distinction of code datatypes and abstypes
haftmann
parents: 35226
diff changeset
    40
  val abstype_interpretation:
40726
16dcfedc4eb7 keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents: 40564
diff changeset
    41
    (string * ((string * sort) list * ((string * ((string * sort) list * typ)) * (string * thm)))
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
    42
      -> theory -> theory) -> theory -> theory
63239
d562c9948dee explicit tagging of code equations de-baroquifies interface
haftmann
parents: 63238
diff changeset
    43
  type kind
d562c9948dee explicit tagging of code equations de-baroquifies interface
haftmann
parents: 63238
diff changeset
    44
  val Equation: kind
d562c9948dee explicit tagging of code equations de-baroquifies interface
haftmann
parents: 63238
diff changeset
    45
  val Nbe: kind
d562c9948dee explicit tagging of code equations de-baroquifies interface
haftmann
parents: 63238
diff changeset
    46
  val Abstract: kind
d562c9948dee explicit tagging of code equations de-baroquifies interface
haftmann
parents: 63238
diff changeset
    47
  val add_eqn: kind * bool -> thm -> theory -> theory
d562c9948dee explicit tagging of code equations de-baroquifies interface
haftmann
parents: 63238
diff changeset
    48
  val add_default_eqn_attribute: kind -> attribute
d562c9948dee explicit tagging of code equations de-baroquifies interface
haftmann
parents: 63238
diff changeset
    49
  val add_default_eqn_attrib: kind -> Token.src
64430
1d85ac286c72 avoid code generator warnings when deleting equations in BNF commands (e.g., datatype) in locales with assumptions and similar
blanchet
parents: 63244
diff changeset
    50
  val del_eqn_silent: thm -> theory -> theory
28368
8437fb395294 clarified function transformator interface
haftmann
parents: 28359
diff changeset
    51
  val del_eqn: thm -> theory -> theory
8437fb395294 clarified function transformator interface
haftmann
parents: 28359
diff changeset
    52
  val del_eqns: string -> theory -> theory
54889
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
    53
  val del_exception: string -> theory -> theory
24844
98c006a30218 certificates for code generator case expressions
haftmann
parents: 24837
diff changeset
    54
  val add_case: thm -> theory -> theory
98c006a30218 certificates for code generator case expressions
haftmann
parents: 24837
diff changeset
    55
  val add_undefined: string -> theory -> theory
40726
16dcfedc4eb7 keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents: 40564
diff changeset
    56
  val get_type: theory -> string
16dcfedc4eb7 keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents: 40564
diff changeset
    57
    -> ((string * sort) list * (string * ((string * sort) list * typ list)) list) * bool
35299
4f4d5bf4ea08 proper distinction of code datatypes and abstypes
haftmann
parents: 35226
diff changeset
    58
  val get_type_of_constr_or_abstr: theory -> string -> (string * bool) option
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
    59
  val is_constr: theory -> string -> bool
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
    60
  val is_abstr: theory -> string -> bool
57429
4aef934d43ad tuned interface
haftmann
parents: 56811
diff changeset
    61
  val get_cert: Proof.context -> ((thm * bool) list -> (thm * bool) list option) list
4aef934d43ad tuned interface
haftmann
parents: 56811
diff changeset
    62
    -> string -> cert
47437
4625ee486ff6 generalise case certificates to allow ignored parameters
Andreas Lochbihler
parents: 46513
diff changeset
    63
  val get_case_scheme: theory -> string -> (int * (int * string option list)) option
37438
4906ab970316 maintain cong rules for case combinators
haftmann
parents: 37425
diff changeset
    64
  val get_case_cong: theory -> string -> thm option
31890
e943b039f0ac an intermediate step towards a refined translation of cases
haftmann
parents: 31642
diff changeset
    65
  val undefineds: theory -> string list
24219
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
    66
  val print_codesetup: theory -> unit
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
    67
end;
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
    68
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
    69
signature CODE_DATA_ARGS =
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
    70
sig
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
    71
  type T
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
    72
  val empty: T
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
    73
end;
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
    74
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
    75
signature CODE_DATA =
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
    76
sig
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
    77
  type T
39397
9b0a8d72edc8 ignore code cache optionally
haftmann
parents: 39134
diff changeset
    78
  val change: theory option -> (T -> T) -> T
9b0a8d72edc8 ignore code cache optionally
haftmann
parents: 39134
diff changeset
    79
  val change_yield: theory option -> (T -> 'a * T) -> 'a * T
24219
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
    80
end;
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
    81
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
    82
signature PRIVATE_CODE =
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
    83
sig
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
    84
  include CODE
51368
2ea5c7c2d825 tuned signature -- prefer terminology of Scala and Axiom;
wenzelm
parents: 49971
diff changeset
    85
  val declare_data: Any.T -> serial
2ea5c7c2d825 tuned signature -- prefer terminology of Scala and Axiom;
wenzelm
parents: 49971
diff changeset
    86
  val change_yield_data: serial * ('a -> Any.T) * (Any.T -> 'a)
34251
cd642bb91f64 code cache only persists on equal theories
haftmann
parents: 34244
diff changeset
    87
    -> theory -> ('a -> 'b * 'a) -> 'b * 'a
24219
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
    88
end;
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
    89
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
    90
structure Code : PRIVATE_CODE =
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
    91
struct
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
    92
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
    93
(** auxiliary **)
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
    94
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
    95
(* printing *)
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
    96
39134
917b4b6ba3d2 turned show_sorts/show_types into proper configuration options;
wenzelm
parents: 39020
diff changeset
    97
fun string_of_typ thy =
917b4b6ba3d2 turned show_sorts/show_types into proper configuration options;
wenzelm
parents: 39020
diff changeset
    98
  Syntax.string_of_typ (Config.put show_sorts true (Syntax.init_pretty_global thy));
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
    99
42359
6ca5407863ed prefer local name spaces;
wenzelm
parents: 41493
diff changeset
   100
fun string_of_const thy c =
42360
da8817d01e7c modernized structure Proof_Context;
wenzelm
parents: 42359
diff changeset
   101
  let val ctxt = Proof_Context.init_global thy in
51685
385ef6706252 more standard module name Axclass (according to file name);
wenzelm
parents: 51584
diff changeset
   102
    case Axclass.inst_of_param thy c of
42359
6ca5407863ed prefer local name spaces;
wenzelm
parents: 41493
diff changeset
   103
      SOME (c, tyco) =>
42360
da8817d01e7c modernized structure Proof_Context;
wenzelm
parents: 42359
diff changeset
   104
        Proof_Context.extern_const ctxt c ^ " " ^ enclose "[" "]"
da8817d01e7c modernized structure Proof_Context;
wenzelm
parents: 42359
diff changeset
   105
          (Proof_Context.extern_type ctxt tyco)
da8817d01e7c modernized structure Proof_Context;
wenzelm
parents: 42359
diff changeset
   106
    | NONE => Proof_Context.extern_const ctxt c
42359
6ca5407863ed prefer local name spaces;
wenzelm
parents: 41493
diff changeset
   107
  end;
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   108
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   109
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   110
(* constants *)
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   111
49534
791e6fc53f73 more strict typscheme_equiv check: must fix variables of more specific type;
haftmann
parents: 49533
diff changeset
   112
fun const_typ thy = Type.strip_sorts o Sign.the_const_type thy;
791e6fc53f73 more strict typscheme_equiv check: must fix variables of more specific type;
haftmann
parents: 49533
diff changeset
   113
791e6fc53f73 more strict typscheme_equiv check: must fix variables of more specific type;
haftmann
parents: 49533
diff changeset
   114
fun args_number thy = length o binder_types o const_typ thy;
791e6fc53f73 more strict typscheme_equiv check: must fix variables of more specific type;
haftmann
parents: 49533
diff changeset
   115
791e6fc53f73 more strict typscheme_equiv check: must fix variables of more specific type;
haftmann
parents: 49533
diff changeset
   116
fun devarify ty =
791e6fc53f73 more strict typscheme_equiv check: must fix variables of more specific type;
haftmann
parents: 49533
diff changeset
   117
  let
791e6fc53f73 more strict typscheme_equiv check: must fix variables of more specific type;
haftmann
parents: 49533
diff changeset
   118
    val tys = fold_atyps (fn TVar vi_sort => AList.update (op =) vi_sort) ty [];
791e6fc53f73 more strict typscheme_equiv check: must fix variables of more specific type;
haftmann
parents: 49533
diff changeset
   119
    val vs = Name.invent Name.context Name.aT (length tys);
791e6fc53f73 more strict typscheme_equiv check: must fix variables of more specific type;
haftmann
parents: 49533
diff changeset
   120
    val mapping = map2 (fn v => fn (vi, sort) => (vi, TFree (v, sort))) vs tys;
791e6fc53f73 more strict typscheme_equiv check: must fix variables of more specific type;
haftmann
parents: 49533
diff changeset
   121
  in Term.typ_subst_TVars mapping ty end;
791e6fc53f73 more strict typscheme_equiv check: must fix variables of more specific type;
haftmann
parents: 49533
diff changeset
   122
791e6fc53f73 more strict typscheme_equiv check: must fix variables of more specific type;
haftmann
parents: 49533
diff changeset
   123
fun typscheme thy (c, ty) =
791e6fc53f73 more strict typscheme_equiv check: must fix variables of more specific type;
haftmann
parents: 49533
diff changeset
   124
  (map dest_TFree (Sign.const_typargs thy (c, ty)), Type.strip_sorts ty);
791e6fc53f73 more strict typscheme_equiv check: must fix variables of more specific type;
haftmann
parents: 49533
diff changeset
   125
791e6fc53f73 more strict typscheme_equiv check: must fix variables of more specific type;
haftmann
parents: 49533
diff changeset
   126
fun typscheme_equiv (ty1, ty2) =
791e6fc53f73 more strict typscheme_equiv check: must fix variables of more specific type;
haftmann
parents: 49533
diff changeset
   127
  Type.raw_instance (devarify ty1, ty2) andalso Type.raw_instance (devarify ty2, ty1);
791e6fc53f73 more strict typscheme_equiv check: must fix variables of more specific type;
haftmann
parents: 49533
diff changeset
   128
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   129
fun check_bare_const thy t = case try dest_Const t
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   130
 of SOME c_ty => c_ty
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   131
  | NONE => error ("Not a constant: " ^ Syntax.string_of_term_global thy t);
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   132
40362
82a066bff182 Code.check_const etc.: reject too specific types
haftmann
parents: 40316
diff changeset
   133
fun check_unoverload thy (c, ty) =
82a066bff182 Code.check_const etc.: reject too specific types
haftmann
parents: 40316
diff changeset
   134
  let
51685
385ef6706252 more standard module name Axclass (according to file name);
wenzelm
parents: 51584
diff changeset
   135
    val c' = Axclass.unoverload_const thy (c, ty);
54604
1512fa5fe531 prefer sort-stripping const_typ over Sign.the_const_type whenever appropriate
haftmann
parents: 54603
diff changeset
   136
    val ty_decl = const_typ thy c';
45344
e209da839ff4 added Logic.varify_types_global/unvarify_types_global, which avoids somewhat expensive Term.map_types;
wenzelm
parents: 45211
diff changeset
   137
  in
49534
791e6fc53f73 more strict typscheme_equiv check: must fix variables of more specific type;
haftmann
parents: 49533
diff changeset
   138
    if typscheme_equiv (ty_decl, Logic.varifyT_global ty)
45344
e209da839ff4 added Logic.varify_types_global/unvarify_types_global, which avoids somewhat expensive Term.map_types;
wenzelm
parents: 45211
diff changeset
   139
    then c'
e209da839ff4 added Logic.varify_types_global/unvarify_types_global, which avoids somewhat expensive Term.map_types;
wenzelm
parents: 45211
diff changeset
   140
    else
e209da839ff4 added Logic.varify_types_global/unvarify_types_global, which avoids somewhat expensive Term.map_types;
wenzelm
parents: 45211
diff changeset
   141
      error ("Type\n" ^ string_of_typ thy ty ^
e209da839ff4 added Logic.varify_types_global/unvarify_types_global, which avoids somewhat expensive Term.map_types;
wenzelm
parents: 45211
diff changeset
   142
        "\nof constant " ^ quote c ^
e209da839ff4 added Logic.varify_types_global/unvarify_types_global, which avoids somewhat expensive Term.map_types;
wenzelm
parents: 45211
diff changeset
   143
        "\nis too specific compared to declared type\n" ^
e209da839ff4 added Logic.varify_types_global/unvarify_types_global, which avoids somewhat expensive Term.map_types;
wenzelm
parents: 45211
diff changeset
   144
        string_of_typ thy ty_decl)
40362
82a066bff182 Code.check_const etc.: reject too specific types
haftmann
parents: 40316
diff changeset
   145
  end; 
82a066bff182 Code.check_const etc.: reject too specific types
haftmann
parents: 40316
diff changeset
   146
82a066bff182 Code.check_const etc.: reject too specific types
haftmann
parents: 40316
diff changeset
   147
fun check_const thy = check_unoverload thy o check_bare_const thy;
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   148
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   149
fun read_bare_const thy = check_bare_const thy o Syntax.read_term_global thy;
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   150
40362
82a066bff182 Code.check_const etc.: reject too specific types
haftmann
parents: 40316
diff changeset
   151
fun read_const thy = check_unoverload thy o read_bare_const thy;
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   152
32872
019201eb7e07 variables in type schemes must be renamed simultaneously with variables in equations
haftmann
parents: 32738
diff changeset
   153
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   154
(** data store **)
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   155
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   156
(* datatypes *)
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   157
43634
93cd6dd1a1c6 index cases for constructors
haftmann
parents: 43329
diff changeset
   158
datatype typ_spec = Constructors of (string * ((string * sort) list * typ list)) list *
93cd6dd1a1c6 index cases for constructors
haftmann
parents: 43329
diff changeset
   159
      string list (*references to associated case constructors*)
40726
16dcfedc4eb7 keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents: 40564
diff changeset
   160
  | Abstractor of (string * ((string * sort) list * typ)) * (string * thm);
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   161
43634
93cd6dd1a1c6 index cases for constructors
haftmann
parents: 43329
diff changeset
   162
fun constructors_of (Constructors (cos, _)) = (cos, false)
40726
16dcfedc4eb7 keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents: 40564
diff changeset
   163
  | constructors_of (Abstractor ((co, (vs, ty)), _)) = ([(co, (vs, [ty]))], true);
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   164
43638
b2ccc49429b7 remove illegal case combinators after merge
haftmann
parents: 43637
diff changeset
   165
fun case_consts_of (Constructors (_, case_consts)) = case_consts
b2ccc49429b7 remove illegal case combinators after merge
haftmann
parents: 43637
diff changeset
   166
  | case_consts_of (Abstractor _) = [];
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   167
66125
28e782dd0278 tuned whitespace
haftmann
parents: 66024
diff changeset
   168
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   169
(* functions *)
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   170
59458
9de8ac92cafa abstract code equation may also be default
haftmann
parents: 59058
diff changeset
   171
datatype fun_spec = Eqns_Default of (thm * bool) list * (thm * bool) list lazy
43634
93cd6dd1a1c6 index cases for constructors
haftmann
parents: 43329
diff changeset
   172
      (* (cache for default equations, lazy computation of default equations)
93cd6dd1a1c6 index cases for constructors
haftmann
parents: 43329
diff changeset
   173
         -- helps to restore natural order of default equations *)
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   174
  | Eqns of (thm * bool) list
54889
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   175
  | None
59458
9de8ac92cafa abstract code equation may also be default
haftmann
parents: 59058
diff changeset
   176
  | Proj of (term * string) * bool
9de8ac92cafa abstract code equation may also be default
haftmann
parents: 59058
diff changeset
   177
  | Abstr of (thm * string) * bool;
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   178
59458
9de8ac92cafa abstract code equation may also be default
haftmann
parents: 59058
diff changeset
   179
val initial_fun_spec = Eqns_Default ([], Lazy.value []);
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   180
59458
9de8ac92cafa abstract code equation may also be default
haftmann
parents: 59058
diff changeset
   181
fun is_default (Eqns_Default _) = true
9de8ac92cafa abstract code equation may also be default
haftmann
parents: 59058
diff changeset
   182
  | is_default (Proj (_, default)) = default
9de8ac92cafa abstract code equation may also be default
haftmann
parents: 59058
diff changeset
   183
  | is_default (Abstr (_, default)) = default
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   184
  | is_default _ = false;
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   185
59458
9de8ac92cafa abstract code equation may also be default
haftmann
parents: 59058
diff changeset
   186
fun associated_abstype (Abstr ((_, tyco), _)) = SOME tyco
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   187
  | associated_abstype _ = NONE;
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   188
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   189
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   190
(* executable code data *)
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   191
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   192
datatype spec = Spec of {
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   193
  history_concluded: bool,
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   194
  functions: ((bool * fun_spec) * (serial * fun_spec) list) Symtab.table
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   195
    (*with explicit history*),
35299
4f4d5bf4ea08 proper distinction of code datatypes and abstypes
haftmann
parents: 35226
diff changeset
   196
  types: ((serial * ((string * sort) list * typ_spec)) list) Symtab.table
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   197
    (*with explicit history*),
66024
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
   198
  cases: ((int * (int * string option list)) * thm) Symtab.table,
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
   199
  undefineds: unit Symtab.table
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   200
};
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   201
66024
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
   202
fun make_spec (history_concluded, (functions, (types, (cases, undefineds)))) =
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
   203
  Spec { history_concluded = history_concluded, functions = functions, types = types,
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
   204
    cases = cases, undefineds = undefineds };
45987
9ba44b49859b dropped disfruitful `constant signatures`
haftmann
parents: 45430
diff changeset
   205
fun map_spec f (Spec { history_concluded = history_concluded,
66024
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
   206
  functions = functions, types = types, cases = cases, undefineds = undefineds }) =
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
   207
  make_spec (f (history_concluded, (functions, (types, (cases, undefineds)))));
45987
9ba44b49859b dropped disfruitful `constant signatures`
haftmann
parents: 45430
diff changeset
   208
fun merge_spec (Spec { history_concluded = _, functions = functions1,
66024
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
   209
    types = types1, cases = cases1, undefineds = undefineds1 },
45987
9ba44b49859b dropped disfruitful `constant signatures`
haftmann
parents: 45430
diff changeset
   210
  Spec { history_concluded = _, functions = functions2,
66024
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
   211
    types = types2, cases = cases2, undefineds = undefineds2 }) =
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   212
  let
42707
42d607a9ae65 improving merge of code specifications by removing code equations of constructors after merging two theories
bulwahn
parents: 42375
diff changeset
   213
    val types = Symtab.join (K (AList.merge (op =) (K true))) (types1, types2);
43639
9cba66fb109a correction: do not assume that case const index covered all cases
haftmann
parents: 43638
diff changeset
   214
    val case_consts_of' = (maps case_consts_of o map (snd o snd o hd o snd) o Symtab.dest);
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   215
    fun merge_functions ((_, history1), (_, history2)) =
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   216
      let
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   217
        val raw_history = AList.merge (op = : serial * serial -> bool)
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   218
          (K true) (history1, history2);
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   219
        val filtered_history = filter_out (is_default o snd) raw_history;
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   220
        val history = if null filtered_history
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   221
          then raw_history else filtered_history;
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   222
      in ((false, (snd o hd) history), history) end;
43638
b2ccc49429b7 remove illegal case combinators after merge
haftmann
parents: 43637
diff changeset
   223
    val all_datatype_specs = map (snd o snd o hd o snd) (Symtab.dest types);
b2ccc49429b7 remove illegal case combinators after merge
haftmann
parents: 43637
diff changeset
   224
    val all_constructors = maps (map fst o fst o constructors_of) all_datatype_specs;
43639
9cba66fb109a correction: do not assume that case const index covered all cases
haftmann
parents: 43638
diff changeset
   225
    val invalidated_case_consts = union (op =) (case_consts_of' types1) (case_consts_of' types2)
9cba66fb109a correction: do not assume that case const index covered all cases
haftmann
parents: 43638
diff changeset
   226
      |> subtract (op =) (maps case_consts_of all_datatype_specs)
42707
42d607a9ae65 improving merge of code specifications by removing code equations of constructors after merging two theories
bulwahn
parents: 42375
diff changeset
   227
    val functions = Symtab.join (K merge_functions) (functions1, functions2)
54887
83bf0ae03c50 more precise wording
haftmann
parents: 54886
diff changeset
   228
      |> fold (fn c => Symtab.map_entry c (apfst (K (true, initial_fun_spec)))) all_constructors;
66024
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
   229
    val cases = Symtab.merge (K true) (cases1, cases2)
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
   230
      |> fold Symtab.delete invalidated_case_consts;
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
   231
    val undefineds = Symtab.merge (K true) (undefineds1, undefineds2);
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
   232
  in make_spec (false, (functions, (types, (cases, undefineds)))) end;
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   233
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   234
fun history_concluded (Spec { history_concluded, ... }) = history_concluded;
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   235
fun the_functions (Spec { functions, ... }) = functions;
35299
4f4d5bf4ea08 proper distinction of code datatypes and abstypes
haftmann
parents: 35226
diff changeset
   236
fun the_types (Spec { types, ... }) = types;
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   237
fun the_cases (Spec { cases, ... }) = cases;
66024
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
   238
fun the_undefineds (Spec { undefineds, ... }) = undefineds;
32544
e129333b9df0 moved eq handling in nbe into separate oracle
haftmann
parents: 32354
diff changeset
   239
val map_history_concluded = map_spec o apfst;
45987
9ba44b49859b dropped disfruitful `constant signatures`
haftmann
parents: 45430
diff changeset
   240
val map_functions = map_spec o apsnd o apfst;
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   241
val map_typs = map_spec o apsnd o apsnd o apfst;
66024
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
   242
val map_cases = map_spec o apsnd o apsnd o apsnd o apfst;
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
   243
val map_undefineds = map_spec o apsnd o apsnd o apsnd o apsnd;
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   244
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   245
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   246
(* data slots dependent on executable code *)
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   247
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   248
(*private copy avoids potential conflict of table exceptions*)
31971
8c1b845ed105 renamed functor TableFun to Table, and GraphFun to Graph;
wenzelm
parents: 31962
diff changeset
   249
structure Datatab = Table(type key = int val ord = int_ord);
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   250
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   251
local
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   252
51368
2ea5c7c2d825 tuned signature -- prefer terminology of Scala and Axiom;
wenzelm
parents: 49971
diff changeset
   253
type kind = { empty: Any.T };
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   254
43684
85388f5570c4 prefer Synchronized.var;
wenzelm
parents: 43639
diff changeset
   255
val kinds = Synchronized.var "Code_Data" (Datatab.empty: kind Datatab.table);
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   256
43684
85388f5570c4 prefer Synchronized.var;
wenzelm
parents: 43639
diff changeset
   257
fun invoke f k =
85388f5570c4 prefer Synchronized.var;
wenzelm
parents: 43639
diff changeset
   258
  (case Datatab.lookup (Synchronized.value kinds) k of
85388f5570c4 prefer Synchronized.var;
wenzelm
parents: 43639
diff changeset
   259
    SOME kind => f kind
85388f5570c4 prefer Synchronized.var;
wenzelm
parents: 43639
diff changeset
   260
  | NONE => raise Fail "Invalid code data identifier");
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   261
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   262
in
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   263
34173
458ced35abb8 reduced code generator cache to the baremost minimum
haftmann
parents: 33977
diff changeset
   264
fun declare_data empty =
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   265
  let
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   266
    val k = serial ();
34173
458ced35abb8 reduced code generator cache to the baremost minimum
haftmann
parents: 33977
diff changeset
   267
    val kind = { empty = empty };
43684
85388f5570c4 prefer Synchronized.var;
wenzelm
parents: 43639
diff changeset
   268
    val _ = Synchronized.change kinds (Datatab.update (k, kind));
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   269
  in k end;
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   270
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   271
fun invoke_init k = invoke (fn kind => #empty kind) k;
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   272
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   273
end; (*local*)
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   274
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   275
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   276
(* theory store *)
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   277
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   278
local
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   279
51368
2ea5c7c2d825 tuned signature -- prefer terminology of Scala and Axiom;
wenzelm
parents: 49971
diff changeset
   280
type data = Any.T Datatab.table;
52788
da1fdbfebd39 type theory is purely value-oriented;
wenzelm
parents: 52781
diff changeset
   281
fun empty_dataref () = Synchronized.var "code data" (NONE : (data * theory) option);
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   282
34244
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
   283
structure Code_Data = Theory_Data
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   284
(
52788
da1fdbfebd39 type theory is purely value-oriented;
wenzelm
parents: 52781
diff changeset
   285
  type T = spec * (data * theory) option Synchronized.var;
45987
9ba44b49859b dropped disfruitful `constant signatures`
haftmann
parents: 45430
diff changeset
   286
  val empty = (make_spec (false, (Symtab.empty,
34244
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
   287
    (Symtab.empty, (Symtab.empty, Symtab.empty)))), empty_dataref ());
49556
47e4178f9a94 made smlnj even happier
haftmann
parents: 49535
diff changeset
   288
  val extend : T -> T = apsnd (K (empty_dataref ()));
34244
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
   289
  fun merge ((spec1, _), (spec2, _)) =
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
   290
    (merge_spec (spec1, spec2), empty_dataref ());
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   291
);
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   292
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   293
in
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   294
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   295
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   296
(* access to executable code *)
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   297
49535
e016736fbe0a make smlnj happy
haftmann
parents: 49534
diff changeset
   298
val the_exec : theory -> spec = fst o Code_Data.get;
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   299
34244
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
   300
fun map_exec_purge f = Code_Data.map (fn (exec, _) => (f exec, empty_dataref ()));
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   301
54886
3774542df61b uniform bookkeeping also in the case of deletion
haftmann
parents: 54884
diff changeset
   302
fun change_fun_spec c f = (map_exec_purge o map_functions
54887
83bf0ae03c50 more precise wording
haftmann
parents: 54886
diff changeset
   303
  o (Symtab.map_default (c, ((false, initial_fun_spec), [])))
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   304
    o apfst) (fn (_, spec) => (true, f spec));
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   305
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   306
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   307
(* tackling equation history *)
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   308
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   309
fun continue_history thy = if (history_concluded o the_exec) thy
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   310
  then thy
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   311
    |> (Code_Data.map o apfst o map_history_concluded) (K false)
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   312
    |> SOME
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   313
  else NONE;
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   314
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   315
fun conclude_history thy = if (history_concluded o the_exec) thy
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   316
  then NONE
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   317
  else thy
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   318
    |> (Code_Data.map o apfst)
39020
ac0f24f850c9 replaced Table.map' by Table.map
haftmann
parents: 38667
diff changeset
   319
        ((map_functions o Symtab.map) (fn _ => fn ((changed, current), history) =>
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   320
          ((false, current),
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   321
            if changed then (serial (), current) :: history else history))
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   322
        #> map_history_concluded (K true))
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   323
    |> SOME;
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   324
53171
a5e54d4d9081 added Theory.setup convenience;
wenzelm
parents: 52788
diff changeset
   325
val _ = Theory.setup
a5e54d4d9081 added Theory.setup convenience;
wenzelm
parents: 52788
diff changeset
   326
  (Theory.at_begin continue_history #> Theory.at_end conclude_history);
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   327
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   328
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   329
(* access to data dependent on abstract executable code *)
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   330
34244
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
   331
fun change_yield_data (kind, mk, dest) theory f =
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   332
  let
34244
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
   333
    val dataref = (snd o Code_Data.get) theory;
52788
da1fdbfebd39 type theory is purely value-oriented;
wenzelm
parents: 52781
diff changeset
   334
    val (datatab, thy) = case Synchronized.value dataref
da1fdbfebd39 type theory is purely value-oriented;
wenzelm
parents: 52781
diff changeset
   335
     of SOME (datatab, thy) =>
60948
b710a5087116 prefer theory_id operations;
wenzelm
parents: 60805
diff changeset
   336
        if Context.eq_thy (theory, thy)
52788
da1fdbfebd39 type theory is purely value-oriented;
wenzelm
parents: 52781
diff changeset
   337
          then (datatab, thy)
da1fdbfebd39 type theory is purely value-oriented;
wenzelm
parents: 52781
diff changeset
   338
          else (Datatab.empty, theory)
da1fdbfebd39 type theory is purely value-oriented;
wenzelm
parents: 52781
diff changeset
   339
      | NONE => (Datatab.empty, theory)
34244
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
   340
    val data = case Datatab.lookup datatab kind
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
   341
     of SOME data => data
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
   342
      | NONE => invoke_init kind;
40758
4f2c3e842ef8 consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents: 40726
diff changeset
   343
    val result as (_, data') = f (dest data);
34244
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
   344
    val _ = Synchronized.change dataref
52788
da1fdbfebd39 type theory is purely value-oriented;
wenzelm
parents: 52781
diff changeset
   345
      ((K o SOME) (Datatab.update (kind, mk data') datatab, thy));
34244
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
   346
  in result end;
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   347
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   348
end; (*local*)
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   349
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   350
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   351
(** foundation **)
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   352
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   353
(* datatypes *)
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   354
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   355
fun no_constr thy s (c, ty) = error ("Not a datatype constructor:\n" ^ string_of_const thy c
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   356
  ^ " :: " ^ string_of_typ thy ty ^ "\n" ^ enclose "(" ")" s);
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   357
45987
9ba44b49859b dropped disfruitful `constant signatures`
haftmann
parents: 45430
diff changeset
   358
fun analyze_constructor thy (c, ty) =
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   359
  let
59621
291934bac95e Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents: 59458
diff changeset
   360
    val _ = Thm.global_cterm_of thy (Const (c, ty));
54603
89d5b69e5a08 prefer name-normalizing devarify over unvarifyT whenever appropriate
haftmann
parents: 53171
diff changeset
   361
    val ty_decl = devarify (const_typ thy c);
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   362
    fun last_typ c_ty ty =
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   363
      let
33531
2c0a4adbcf13 tuned error messages; tuned code
haftmann
parents: 33522
diff changeset
   364
        val tfrees = Term.add_tfreesT ty [];
40844
5895c525739d more direct use of binder_types/body_type;
wenzelm
parents: 40803
diff changeset
   365
        val (tyco, vs) = (apsnd o map) dest_TFree (dest_Type (body_type ty))
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   366
          handle TYPE _ => no_constr thy "bad type" c_ty
36112
7fa17a225852 user interface for abstract datatypes is an attribute, not a command
haftmann
parents: 35845
diff changeset
   367
        val _ = if tyco = "fun" then no_constr thy "bad type" c_ty else ();
45344
e209da839ff4 added Logic.varify_types_global/unvarify_types_global, which avoids somewhat expensive Term.map_types;
wenzelm
parents: 45211
diff changeset
   368
        val _ =
e209da839ff4 added Logic.varify_types_global/unvarify_types_global, which avoids somewhat expensive Term.map_types;
wenzelm
parents: 45211
diff changeset
   369
          if has_duplicates (eq_fst (op =)) vs
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   370
          then no_constr thy "duplicate type variables in datatype" c_ty else ();
45344
e209da839ff4 added Logic.varify_types_global/unvarify_types_global, which avoids somewhat expensive Term.map_types;
wenzelm
parents: 45211
diff changeset
   371
        val _ =
e209da839ff4 added Logic.varify_types_global/unvarify_types_global, which avoids somewhat expensive Term.map_types;
wenzelm
parents: 45211
diff changeset
   372
          if length tfrees <> length vs
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   373
          then no_constr thy "type variables missing in datatype" c_ty else ();
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   374
      in (tyco, vs) end;
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   375
    val (tyco, _) = last_typ (c, ty) ty_decl;
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   376
    val (_, vs) = last_typ (c, ty) ty;
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   377
  in ((tyco, map snd vs), (c, (map fst vs, ty))) end;
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   378
49904
2df2786ac7b7 no sort constraints on datatype constructors in internal bookkeeping
haftmann
parents: 49760
diff changeset
   379
fun constrset_of_consts thy consts =
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   380
  let
51685
385ef6706252 more standard module name Axclass (according to file name);
wenzelm
parents: 51584
diff changeset
   381
    val _ = map (fn (c, _) => if (is_some o Axclass.class_of_param thy) c
49904
2df2786ac7b7 no sort constraints on datatype constructors in internal bookkeeping
haftmann
parents: 49760
diff changeset
   382
      then error ("Is a class parameter: " ^ string_of_const thy c) else ()) consts;
2df2786ac7b7 no sort constraints on datatype constructors in internal bookkeeping
haftmann
parents: 49760
diff changeset
   383
    val raw_constructors = map (analyze_constructor thy) consts;
2df2786ac7b7 no sort constraints on datatype constructors in internal bookkeeping
haftmann
parents: 49760
diff changeset
   384
    val tyco = case distinct (op =) (map (fst o fst) raw_constructors)
2df2786ac7b7 no sort constraints on datatype constructors in internal bookkeeping
haftmann
parents: 49760
diff changeset
   385
     of [tyco] => tyco
2df2786ac7b7 no sort constraints on datatype constructors in internal bookkeeping
haftmann
parents: 49760
diff changeset
   386
      | [] => error "Empty constructor set"
2df2786ac7b7 no sort constraints on datatype constructors in internal bookkeeping
haftmann
parents: 49760
diff changeset
   387
      | tycos => error ("Different type constructors in constructor set: " ^ commas_quote tycos)
2df2786ac7b7 no sort constraints on datatype constructors in internal bookkeeping
haftmann
parents: 49760
diff changeset
   388
    val vs = Name.invent Name.context Name.aT (Sign.arity_number thy tyco);
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   389
    fun inst vs' (c, (vs, ty)) =
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   390
      let
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   391
        val the_v = the o AList.lookup (op =) (vs ~~ vs');
49904
2df2786ac7b7 no sort constraints on datatype constructors in internal bookkeeping
haftmann
parents: 49760
diff changeset
   392
        val ty' = map_type_tfree (fn (v, _) => TFree (the_v v, [])) ty;
2df2786ac7b7 no sort constraints on datatype constructors in internal bookkeeping
haftmann
parents: 49760
diff changeset
   393
        val (vs'', ty'') = typscheme thy (c, ty');
2df2786ac7b7 no sort constraints on datatype constructors in internal bookkeeping
haftmann
parents: 49760
diff changeset
   394
      in (c, (vs'', binder_types ty'')) end;
2df2786ac7b7 no sort constraints on datatype constructors in internal bookkeeping
haftmann
parents: 49760
diff changeset
   395
    val constructors = map (inst vs o snd) raw_constructors;
2df2786ac7b7 no sort constraints on datatype constructors in internal bookkeeping
haftmann
parents: 49760
diff changeset
   396
  in (tyco, (map (rpair []) vs, constructors)) end;
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   397
35299
4f4d5bf4ea08 proper distinction of code datatypes and abstypes
haftmann
parents: 35226
diff changeset
   398
fun get_type_entry thy tyco = case these (Symtab.lookup ((the_types o the_exec) thy) tyco)
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   399
 of (_, entry) :: _ => SOME entry
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   400
  | _ => NONE;
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   401
40726
16dcfedc4eb7 keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents: 40564
diff changeset
   402
fun get_type thy tyco = case get_type_entry thy tyco
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   403
 of SOME (vs, spec) => apfst (pair vs) (constructors_of spec)
45987
9ba44b49859b dropped disfruitful `constant signatures`
haftmann
parents: 45430
diff changeset
   404
  | NONE => Sign.arity_number thy tyco
43329
84472e198515 tuned signature: Name.invent and Name.invent_names;
wenzelm
parents: 43326
diff changeset
   405
      |> Name.invent Name.context Name.aT
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   406
      |> map (rpair [])
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   407
      |> rpair []
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   408
      |> rpair false;
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   409
35299
4f4d5bf4ea08 proper distinction of code datatypes and abstypes
haftmann
parents: 35226
diff changeset
   410
fun get_abstype_spec thy tyco = case get_type_entry thy tyco
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   411
 of SOME (vs, Abstractor spec) => (vs, spec)
36122
45f8898fe4cf more accurate pattern match
haftmann
parents: 36112
diff changeset
   412
  | _ => error ("Not an abstract type: " ^ tyco);
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   413
 
35299
4f4d5bf4ea08 proper distinction of code datatypes and abstypes
haftmann
parents: 35226
diff changeset
   414
fun get_type_of_constr_or_abstr thy c =
40844
5895c525739d more direct use of binder_types/body_type;
wenzelm
parents: 40803
diff changeset
   415
  case (body_type o const_typ thy) c
40758
4f2c3e842ef8 consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents: 40726
diff changeset
   416
   of Type (tyco, _) => let val ((_, cos), abstract) = get_type thy tyco
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   417
        in if member (op =) (map fst cos) c then SOME (tyco, abstract) else NONE end
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   418
    | _ => NONE;
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   419
35299
4f4d5bf4ea08 proper distinction of code datatypes and abstypes
haftmann
parents: 35226
diff changeset
   420
fun is_constr thy c = case get_type_of_constr_or_abstr thy c
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   421
 of SOME (_, false) => true
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   422
   | _ => false;
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   423
35299
4f4d5bf4ea08 proper distinction of code datatypes and abstypes
haftmann
parents: 35226
diff changeset
   424
fun is_abstr thy c = case get_type_of_constr_or_abstr thy c
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   425
 of SOME (_, true) => true
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   426
   | _ => false;
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   427
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   428
34874
89c230bf8feb added code certificates
haftmann
parents: 34272
diff changeset
   429
(* bare code equations *)
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   430
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   431
(* convention for variables:
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   432
    ?x ?'a   for free-floating theorems (e.g. in the data store)
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   433
    ?x  'a   for certificates
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   434
     x  'a   for final representation of equations
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   435
*)
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   436
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   437
exception BAD_THM of string;
63244
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   438
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   439
fun bad_thm msg = raise BAD_THM msg;
63244
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   440
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   441
datatype strictness = Silent | Liberal | Strict
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   442
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   443
fun handle_strictness thm_of f strictness thy x = SOME (f x)
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   444
  handle BAD_THM msg => case strictness of
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   445
    Silent => NONE
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   446
  | Liberal => (warning (msg ^ ", in theorem:\n" ^ Thm.string_of_thm_global thy (thm_of x)); NONE)
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   447
  | Strict => error (msg ^ ", in theorem:\n" ^ Thm.string_of_thm_global thy (thm_of x));
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   448
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   449
fun is_linear thm =
63244
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   450
  let
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   451
    val (_, args) = (strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of) thm
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   452
  in
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   453
    not (has_duplicates (op =) ((fold o fold_aterms)
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   454
      (fn Var (v, _) => cons v | _ => I) args []))
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   455
  end;
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   456
36209
566be5d48090 more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents: 36202
diff changeset
   457
fun check_decl_ty thy (c, ty) =
566be5d48090 more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents: 36202
diff changeset
   458
  let
54604
1512fa5fe531 prefer sort-stripping const_typ over Sign.the_const_type whenever appropriate
haftmann
parents: 54603
diff changeset
   459
    val ty_decl = const_typ thy c;
49534
791e6fc53f73 more strict typscheme_equiv check: must fix variables of more specific type;
haftmann
parents: 49533
diff changeset
   460
  in if typscheme_equiv (ty_decl, ty) then ()
36209
566be5d48090 more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents: 36202
diff changeset
   461
    else bad_thm ("Type\n" ^ string_of_typ thy ty
566be5d48090 more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents: 36202
diff changeset
   462
      ^ "\nof constant " ^ quote c
40362
82a066bff182 Code.check_const etc.: reject too specific types
haftmann
parents: 40316
diff changeset
   463
      ^ "\nis too specific compared to declared type\n"
36209
566be5d48090 more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents: 36202
diff changeset
   464
      ^ string_of_typ thy ty_decl)
566be5d48090 more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents: 36202
diff changeset
   465
  end; 
566be5d48090 more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents: 36202
diff changeset
   466
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   467
fun check_eqn thy { allow_nonlinear, allow_consts, allow_pats } thm (lhs, rhs) =
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   468
  let
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   469
    fun vars_of t = fold_aterms (fn Var (v, _) => insert (op =) v
49760
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   470
      | Free _ => bad_thm "Illegal free variable"
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   471
      | _ => I) t [];
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   472
    fun tvars_of t = fold_term_types (fn _ =>
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   473
      fold_atyps (fn TVar (v, _) => insert (op =) v
49760
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   474
        | TFree _ => bad_thm "Illegal free type variable")) t [];
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   475
    val lhs_vs = vars_of lhs;
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   476
    val rhs_vs = vars_of rhs;
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   477
    val lhs_tvs = tvars_of lhs;
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   478
    val rhs_tvs = tvars_of rhs;
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   479
    val _ = if null (subtract (op =) lhs_vs rhs_vs)
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   480
      then ()
49760
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   481
      else bad_thm "Free variables on right hand side of equation";
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   482
    val _ = if null (subtract (op =) lhs_tvs rhs_tvs)
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   483
      then ()
49760
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   484
      else bad_thm "Free type variables on right hand side of equation";
34894
fadbdd350dd1 corrected error messages; tuned
haftmann
parents: 34891
diff changeset
   485
    val (head, args) = strip_comb lhs;
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   486
    val (c, ty) = case head
51685
385ef6706252 more standard module name Axclass (according to file name);
wenzelm
parents: 51584
diff changeset
   487
     of Const (c_ty as (_, ty)) => (Axclass.unoverload_const thy c_ty, ty)
49760
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   488
      | _ => bad_thm "Equation not headed by constant";
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   489
    fun check _ (Abs _) = bad_thm "Abstraction on left hand side of equation"
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   490
      | check 0 (Var _) = ()
49760
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   491
      | check _ (Var _) = bad_thm "Variable with application on left hand side of equation"
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   492
      | check n (t1 $ t2) = (check (n+1) t1; check 0 t2)
34894
fadbdd350dd1 corrected error messages; tuned
haftmann
parents: 34891
diff changeset
   493
      | check n (Const (c_ty as (c, ty))) =
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   494
          if allow_pats then let
51685
385ef6706252 more standard module name Axclass (according to file name);
wenzelm
parents: 51584
diff changeset
   495
            val c' = Axclass.unoverload_const thy c_ty
45987
9ba44b49859b dropped disfruitful `constant signatures`
haftmann
parents: 45430
diff changeset
   496
          in if n = (length o binder_types) ty
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   497
            then if allow_consts orelse is_constr thy c'
33940
317933ce3712 crude support for type aliasses and corresponding constant signatures
haftmann
parents: 33756
diff changeset
   498
              then ()
49760
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   499
              else bad_thm (quote c ^ " is not a constructor, on left hand side of equation")
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   500
            else bad_thm ("Partially applied constant " ^ quote c ^ " on left hand side of equation")
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   501
          end else bad_thm ("Pattern not allowed here, but constant " ^ quote c ^ " encountered on left hand side of equation")
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   502
    val _ = map (check 0) args;
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   503
    val _ = if allow_nonlinear orelse is_linear thm then ()
49760
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   504
      else bad_thm "Duplicate variables on left hand side of equation";
51685
385ef6706252 more standard module name Axclass (according to file name);
wenzelm
parents: 51584
diff changeset
   505
    val _ = if (is_none o Axclass.class_of_param thy) c then ()
49760
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   506
      else bad_thm "Overloaded constant as head in equation";
34894
fadbdd350dd1 corrected error messages; tuned
haftmann
parents: 34891
diff changeset
   507
    val _ = if not (is_constr thy c) then ()
49760
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   508
      else bad_thm "Constructor as head in equation";
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   509
    val _ = if not (is_abstr thy c) then ()
49760
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   510
      else bad_thm "Abstractor as head in equation";
36209
566be5d48090 more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents: 36202
diff changeset
   511
    val _ = check_decl_ty thy (c, ty);
52475
445ae7a4e4e1 sort out code equations headed by a projection of a abstract datatype
haftmann
parents: 51717
diff changeset
   512
    val _ = case strip_type ty
445ae7a4e4e1 sort out code equations headed by a projection of a abstract datatype
haftmann
parents: 51717
diff changeset
   513
     of (Type (tyco, _) :: _, _) => (case get_type_entry thy tyco
445ae7a4e4e1 sort out code equations headed by a projection of a abstract datatype
haftmann
parents: 51717
diff changeset
   514
       of SOME (_, Abstractor (_, (proj, _))) => if c = proj
445ae7a4e4e1 sort out code equations headed by a projection of a abstract datatype
haftmann
parents: 51717
diff changeset
   515
            then bad_thm "Projection as head in equation"
445ae7a4e4e1 sort out code equations headed by a projection of a abstract datatype
haftmann
parents: 51717
diff changeset
   516
            else ()
445ae7a4e4e1 sort out code equations headed by a projection of a abstract datatype
haftmann
parents: 51717
diff changeset
   517
        | _ => ())
445ae7a4e4e1 sort out code equations headed by a projection of a abstract datatype
haftmann
parents: 51717
diff changeset
   518
      | _ => ();
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   519
  in () end;
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   520
63244
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   521
local
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   522
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   523
fun raw_assert_eqn thy check_patterns (thm, proper) =
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   524
  let
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   525
    val (lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm
49760
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   526
      handle TERM _ => bad_thm "Not an equation"
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   527
           | THM _ => bad_thm "Not a proper equation";
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   528
    val _ = check_eqn thy { allow_nonlinear = not proper,
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   529
      allow_consts = not (proper andalso check_patterns), allow_pats = true } thm (lhs, rhs);
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   530
  in (thm, proper) end;
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   531
63244
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   532
fun raw_assert_abs_eqn thy some_tyco thm =
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   533
  let
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   534
    val (full_lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm
49760
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   535
      handle TERM _ => bad_thm "Not an equation"
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   536
           | THM _ => bad_thm "Not a proper equation";
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   537
    val (rep, lhs) = dest_comb full_lhs
49760
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   538
      handle TERM _ => bad_thm "Not an abstract equation";
46513
2659ee0128c2 more explicit error on malformed abstract equation; dropped dead code; tuned signature
haftmann
parents: 45987
diff changeset
   539
    val (rep_const, ty) = dest_Const rep
49760
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   540
      handle TERM _ => bad_thm "Not an abstract equation";
40187
9b6e918682d5 more general treatment of type argument in code certificates for operations on abstract types
haftmann
parents: 39811
diff changeset
   541
    val (tyco, Ts) = (dest_Type o domain_type) ty
49760
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   542
      handle TERM _ => bad_thm "Not an abstract equation"
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   543
           | TYPE _ => bad_thm "Not an abstract equation";
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   544
    val _ = case some_tyco of SOME tyco' => if tyco = tyco' then ()
49760
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   545
          else bad_thm ("Abstract type mismatch:" ^ quote tyco ^ " vs. " ^ quote tyco')
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   546
      | NONE => ();
52637
1501ebe39711 attribute "code" declares concrete and abstract code equations uniformly; added explicit "code equation" instead
haftmann
parents: 52475
diff changeset
   547
    val (vs', (_, (rep', _))) = case try (get_abstype_spec thy) tyco
1501ebe39711 attribute "code" declares concrete and abstract code equations uniformly; added explicit "code equation" instead
haftmann
parents: 52475
diff changeset
   548
     of SOME data => data
1501ebe39711 attribute "code" declares concrete and abstract code equations uniformly; added explicit "code equation" instead
haftmann
parents: 52475
diff changeset
   549
      | NONE => bad_thm ("Not an abstract type: " ^ tyco);
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   550
    val _ = if rep_const = rep' then ()
49760
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   551
      else bad_thm ("Projection mismatch: " ^ quote rep_const ^ " vs. " ^ quote rep');
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   552
    val _ = check_eqn thy { allow_nonlinear = false,
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   553
      allow_consts = false, allow_pats = false } thm (lhs, rhs);
58635
010b610eb55d eliminated some exotic combinators;
wenzelm
parents: 58559
diff changeset
   554
    val _ = if ListPair.all (fn (T, (_, sort)) => Sign.of_sort thy (T, sort)) (Ts, vs') then ()
40187
9b6e918682d5 more general treatment of type argument in code certificates for operations on abstract types
haftmann
parents: 39811
diff changeset
   555
      else error ("Type arguments do not satisfy sort constraints of abstype certificate.");
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   556
  in (thm, tyco) end;
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   557
63244
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   558
in
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   559
63244
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   560
fun generic_assert_eqn strictness thy check_patterns thm_proper =
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   561
  handle_strictness fst (raw_assert_eqn thy check_patterns) strictness thy thm_proper;
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   562
63244
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   563
fun generic_assert_abs_eqn strictness thy check_patterns thm =
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   564
  handle_strictness I (raw_assert_abs_eqn thy check_patterns) strictness thy thm;
52637
1501ebe39711 attribute "code" declares concrete and abstract code equations uniformly; added explicit "code equation" instead
haftmann
parents: 52475
diff changeset
   565
63244
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   566
end;
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   567
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   568
fun assert_eqn thy = the o generic_assert_eqn Strict thy true;
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   569
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   570
fun assert_abs_eqn thy some_tyco = the o generic_assert_abs_eqn Strict thy some_tyco;
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   571
33940
317933ce3712 crude support for type aliasses and corresponding constant signatures
haftmann
parents: 33756
diff changeset
   572
val head_eqn = dest_Const o fst o strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of;
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   573
31957
a9742afd403e tuned interface of structure Code
haftmann
parents: 31890
diff changeset
   574
fun const_typ_eqn thy thm =
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   575
  let
32640
ba6531df2c64 corrected order of type variables in code equations; more precise certificate for cases
haftmann
parents: 32544
diff changeset
   576
    val (c, ty) = head_eqn thm;
51685
385ef6706252 more standard module name Axclass (according to file name);
wenzelm
parents: 51584
diff changeset
   577
    val c' = Axclass.unoverload_const thy (c, ty);
33940
317933ce3712 crude support for type aliasses and corresponding constant signatures
haftmann
parents: 33756
diff changeset
   578
      (*permissive wrt. to overloaded constants!*)
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   579
  in (c', ty) end;
33940
317933ce3712 crude support for type aliasses and corresponding constant signatures
haftmann
parents: 33756
diff changeset
   580
31957
a9742afd403e tuned interface of structure Code
haftmann
parents: 31890
diff changeset
   581
fun const_eqn thy = fst o const_typ_eqn thy;
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   582
51685
385ef6706252 more standard module name Axclass (according to file name);
wenzelm
parents: 51584
diff changeset
   583
fun const_abs_eqn thy = Axclass.unoverload_const thy o dest_Const o fst o strip_comb o snd
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   584
  o dest_comb o fst o Logic.dest_equals o Thm.plain_prop_of;
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   585
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   586
fun mk_proj tyco vs ty abs rep =
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   587
  let
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   588
    val ty_abs = Type (tyco, map TFree vs);
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   589
    val xarg = Var (("x", 0), ty);
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   590
  in Logic.mk_equals (Const (rep, ty_abs --> ty) $ (Const (abs, ty --> ty_abs) $ xarg), xarg) end;
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   591
34895
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   592
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   593
(* technical transformations of code equations *)
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   594
63244
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   595
fun meta_rewrite thy = Local_Defs.meta_rewrite_rule (Proof_Context.init_global thy);
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   596
34895
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   597
fun expand_eta thy k thm =
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   598
  let
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   599
    val (lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm;
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   600
    val (_, args) = strip_comb lhs;
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   601
    val l = if k = ~1
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   602
      then (length o fst o strip_abs) rhs
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   603
      else Int.max (0, k - length args);
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   604
    val (raw_vars, _) = Term.strip_abs_eta l rhs;
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   605
    val vars = burrow_fst (Name.variant_list (map (fst o fst) (Term.add_vars lhs [])))
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   606
      raw_vars;
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   607
    fun expand (v, ty) thm = Drule.fun_cong_rule thm
59621
291934bac95e Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents: 59458
diff changeset
   608
      (Thm.global_cterm_of thy (Var ((v, 0), ty)));
34895
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   609
  in
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   610
    thm
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   611
    |> fold expand vars
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   612
    |> Conv.fconv_rule Drule.beta_eta_conversion
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   613
  end;
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   614
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   615
fun same_arity thy thms =
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   616
  let
34895
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   617
    val num_args_of = length o snd o strip_comb o fst o Logic.dest_equals;
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   618
    val k = fold (Integer.max o num_args_of o Thm.prop_of) thms 0;
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   619
  in map (expand_eta thy k) thms end;
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   620
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   621
fun mk_desymbolization pre post mk vs =
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   622
  let
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   623
    val names = map (pre o fst o fst) vs
56811
b66639331db5 optional case enforcement
haftmann
parents: 56375
diff changeset
   624
      |> map (Name.desymbolize (SOME false))
34895
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   625
      |> Name.variant_list []
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   626
      |> map post;
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   627
  in map_filter (fn (((v, i), x), v') =>
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   628
    if v = v' andalso i = 0 then NONE
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   629
    else SOME (((v, i), x), mk ((v', 0), x))) (vs ~~ names)
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   630
  end;
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   631
60367
e201bd8973db clarified context;
wenzelm
parents: 59787
diff changeset
   632
fun desymbolize_tvars thy thms =
34895
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   633
  let
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   634
    val tvs = fold (Term.add_tvars o Thm.prop_of) thms [];
60805
4cc49ead6e75 tuned signature;
wenzelm
parents: 60367
diff changeset
   635
    val instT =
4cc49ead6e75 tuned signature;
wenzelm
parents: 60367
diff changeset
   636
      mk_desymbolization (unprefix "'") (prefix "'") (Thm.global_ctyp_of thy o TVar) tvs;
4cc49ead6e75 tuned signature;
wenzelm
parents: 60367
diff changeset
   637
  in map (Thm.instantiate (instT, [])) thms end;
34895
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   638
60367
e201bd8973db clarified context;
wenzelm
parents: 59787
diff changeset
   639
fun desymbolize_vars thy thm =
34895
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   640
  let
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   641
    val vs = Term.add_vars (Thm.prop_of thm) [];
60805
4cc49ead6e75 tuned signature;
wenzelm
parents: 60367
diff changeset
   642
    val inst = mk_desymbolization I I (Thm.global_cterm_of thy o Var) vs;
4cc49ead6e75 tuned signature;
wenzelm
parents: 60367
diff changeset
   643
  in Thm.instantiate ([], inst) thm end;
34895
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   644
60367
e201bd8973db clarified context;
wenzelm
parents: 59787
diff changeset
   645
fun canonize_thms thy = desymbolize_tvars thy #> same_arity thy #> map (desymbolize_vars thy);
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   646
34874
89c230bf8feb added code certificates
haftmann
parents: 34272
diff changeset
   647
36112
7fa17a225852 user interface for abstract datatypes is an attribute, not a command
haftmann
parents: 35845
diff changeset
   648
(* abstype certificates *)
7fa17a225852 user interface for abstract datatypes is an attribute, not a command
haftmann
parents: 35845
diff changeset
   649
63244
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   650
local
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   651
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   652
fun raw_abstype_cert thy proto_thm =
36112
7fa17a225852 user interface for abstract datatypes is an attribute, not a command
haftmann
parents: 35845
diff changeset
   653
  let
63073
413184c7a2a2 clarified context, notably for internal use of Simplifier;
wenzelm
parents: 61268
diff changeset
   654
    val thm = (Axclass.unoverload (Proof_Context.init_global thy) o meta_rewrite thy) proto_thm;
36112
7fa17a225852 user interface for abstract datatypes is an attribute, not a command
haftmann
parents: 35845
diff changeset
   655
    val (lhs, rhs) = Logic.dest_equals (Thm.plain_prop_of thm)
49760
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   656
      handle TERM _ => bad_thm "Not an equation"
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   657
           | THM _ => bad_thm "Not a proper equation";
36209
566be5d48090 more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents: 36202
diff changeset
   658
    val ((abs, raw_ty), ((rep, rep_ty), param)) = (apsnd (apfst dest_Const o dest_comb)
36112
7fa17a225852 user interface for abstract datatypes is an attribute, not a command
haftmann
parents: 35845
diff changeset
   659
        o apfst dest_Const o dest_comb) lhs
49760
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   660
      handle TERM _ => bad_thm "Not an abstype certificate";
59058
a78612c67ec0 renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents: 58666
diff changeset
   661
    val _ = apply2 (fn c => if (is_some o Axclass.class_of_param thy) c
36209
566be5d48090 more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents: 36202
diff changeset
   662
      then error ("Is a class parameter: " ^ string_of_const thy c) else ()) (abs, rep);
566be5d48090 more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents: 36202
diff changeset
   663
    val _ = check_decl_ty thy (abs, raw_ty);
566be5d48090 more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents: 36202
diff changeset
   664
    val _ = check_decl_ty thy (rep, rep_ty);
48068
04aeda922be2 explicit check for correct number of arguments for abstract constructor
haftmann
parents: 47555
diff changeset
   665
    val _ = if length (binder_types raw_ty) = 1
04aeda922be2 explicit check for correct number of arguments for abstract constructor
haftmann
parents: 47555
diff changeset
   666
      then ()
49760
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   667
      else bad_thm "Bad type for abstract constructor";
40758
4f2c3e842ef8 consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents: 40726
diff changeset
   668
    val _ = (fst o dest_Var) param
49760
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   669
      handle TERM _ => bad_thm "Not an abstype certificate";
0721b1311327 more consistent error messages on malformed code equations
haftmann
parents: 49556
diff changeset
   670
    val _ = if param = rhs then () else bad_thm "Not an abstype certificate";
45344
e209da839ff4 added Logic.varify_types_global/unvarify_types_global, which avoids somewhat expensive Term.map_types;
wenzelm
parents: 45211
diff changeset
   671
    val ((tyco, sorts), (abs, (vs, ty'))) =
54603
89d5b69e5a08 prefer name-normalizing devarify over unvarifyT whenever appropriate
haftmann
parents: 53171
diff changeset
   672
      analyze_constructor thy (abs, devarify raw_ty);
36112
7fa17a225852 user interface for abstract datatypes is an attribute, not a command
haftmann
parents: 35845
diff changeset
   673
    val ty = domain_type ty';
49534
791e6fc53f73 more strict typscheme_equiv check: must fix variables of more specific type;
haftmann
parents: 49533
diff changeset
   674
    val (vs', _) = typscheme thy (abs, ty');
40726
16dcfedc4eb7 keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents: 40564
diff changeset
   675
  in (tyco, (vs ~~ sorts, ((abs, (vs', ty)), (rep, thm)))) end;
36112
7fa17a225852 user interface for abstract datatypes is an attribute, not a command
haftmann
parents: 35845
diff changeset
   676
63244
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   677
in
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   678
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   679
fun check_abstype_cert strictness thy proto_thm =
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   680
  handle_strictness I (raw_abstype_cert thy) strictness thy proto_thm;
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   681
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   682
end;
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
   683
36112
7fa17a225852 user interface for abstract datatypes is an attribute, not a command
haftmann
parents: 35845
diff changeset
   684
34874
89c230bf8feb added code certificates
haftmann
parents: 34272
diff changeset
   685
(* code equation certificates *)
89c230bf8feb added code certificates
haftmann
parents: 34272
diff changeset
   686
34895
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   687
fun build_head thy (c, ty) =
59621
291934bac95e Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents: 59458
diff changeset
   688
  Thm.global_cterm_of thy (Logic.mk_equals (Free ("HEAD", ty), Const (c, ty)));
34874
89c230bf8feb added code certificates
haftmann
parents: 34272
diff changeset
   689
34895
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   690
fun get_head thy cert_thm =
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   691
  let
60949
ccbf9379e355 added Thm.chyps_of;
wenzelm
parents: 60948
diff changeset
   692
    val [head] = Thm.chyps_of cert_thm;
34895
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   693
    val (_, Const (c, ty)) = (Logic.dest_equals o Thm.term_of) head;
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   694
  in (typscheme thy (c, ty), head) end;
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   695
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   696
fun typscheme_projection thy =
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   697
  typscheme thy o dest_Const o fst o dest_comb o fst o Logic.dest_equals;
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   698
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   699
fun typscheme_abs thy =
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   700
  typscheme thy o dest_Const o fst o strip_comb o snd o dest_comb o fst o Logic.dest_equals o Thm.prop_of;
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   701
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   702
fun constrain_thm thy vs sorts thm =
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   703
  let
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   704
    val mapping = map2 (fn (v, sort) => fn sort' =>
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   705
      (v, Sorts.inter_sort (Sign.classes_of thy) (sort, sort'))) vs sorts;
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   706
    val inst = map2 (fn (v, sort) => fn (_, sort') =>
60805
4cc49ead6e75 tuned signature;
wenzelm
parents: 60367
diff changeset
   707
      (((v, 0), sort), Thm.global_ctyp_of thy (TFree (v, sort')))) vs mapping;
40803
haftmann
parents: 40764
diff changeset
   708
    val subst = (map_types o map_type_tfree)
haftmann
parents: 40764
diff changeset
   709
      (fn (v, _) => TFree (v, the (AList.lookup (op =) mapping v)));
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   710
  in
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   711
    thm
35845
e5980f0ad025 renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents: 35624
diff changeset
   712
    |> Thm.varifyT_global
60805
4cc49ead6e75 tuned signature;
wenzelm
parents: 60367
diff changeset
   713
    |> Thm.instantiate (inst, [])
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   714
    |> pair subst
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   715
  end;
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   716
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   717
fun concretify_abs thy tyco abs_thm =
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   718
  let
40758
4f2c3e842ef8 consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents: 40726
diff changeset
   719
    val (_, ((c, _), (_, cert))) = get_abstype_spec thy tyco;
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   720
    val lhs = (fst o Logic.dest_equals o Thm.prop_of) abs_thm
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   721
    val ty = fastype_of lhs;
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   722
    val ty_abs = (fastype_of o snd o dest_comb) lhs;
59621
291934bac95e Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents: 59458
diff changeset
   723
    val abs = Thm.global_cterm_of thy (Const (c, ty --> ty_abs));
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   724
    val raw_concrete_thm = Drule.transitive_thm OF [Thm.symmetric cert, Thm.combination (Thm.reflexive abs) abs_thm];
35845
e5980f0ad025 renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents: 35624
diff changeset
   725
  in (c, (Thm.varifyT_global o zero_var_indexes) raw_concrete_thm) end;
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   726
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   727
fun add_rhss_of_eqn thy t =
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   728
  let
45987
9ba44b49859b dropped disfruitful `constant signatures`
haftmann
parents: 45430
diff changeset
   729
    val (args, rhs) = (apfst (snd o strip_comb) o Logic.dest_equals) t;
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   730
    fun add_const (Const (c, ty)) = insert (op =) (c, Sign.const_typargs thy (c, ty))
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   731
      | add_const _ = I
39568
839a0446630b corrected long-overlooked slip: the Pure equality of a code equation is no part of the code equation itself
haftmann
parents: 39552
diff changeset
   732
    val add_consts = fold_aterms add_const
839a0446630b corrected long-overlooked slip: the Pure equality of a code equation is no part of the code equation itself
haftmann
parents: 39552
diff changeset
   733
  in add_consts rhs o fold add_consts args end;
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   734
46513
2659ee0128c2 more explicit error on malformed abstract equation; dropped dead code; tuned signature
haftmann
parents: 45987
diff changeset
   735
val dest_eqn = apfst (snd o strip_comb) o Logic.dest_equals o Logic.unvarify_global;
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   736
54889
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   737
abstype cert = Nothing of thm
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   738
  | Equations of thm * bool list
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   739
  | Projection of term * string
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   740
  | Abstract of thm * string
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   741
with
34891
99b9a6290446 code certificates as integral part of code generation
haftmann
parents: 34874
diff changeset
   742
55364
4d26690379b1 build up preprocessing context only once
haftmann
parents: 55363
diff changeset
   743
fun dummy_thm ctxt c =
34891
99b9a6290446 code certificates as integral part of code generation
haftmann
parents: 34874
diff changeset
   744
  let
55364
4d26690379b1 build up preprocessing context only once
haftmann
parents: 55363
diff changeset
   745
    val thy = Proof_Context.theory_of ctxt;
54603
89d5b69e5a08 prefer name-normalizing devarify over unvarifyT whenever appropriate
haftmann
parents: 53171
diff changeset
   746
    val raw_ty = devarify (const_typ thy c);
49534
791e6fc53f73 more strict typscheme_equiv check: must fix variables of more specific type;
haftmann
parents: 49533
diff changeset
   747
    val (vs, _) = typscheme thy (c, raw_ty);
51685
385ef6706252 more standard module name Axclass (according to file name);
wenzelm
parents: 51584
diff changeset
   748
    val sortargs = case Axclass.class_of_param thy c
40761
1ef64dcb24b7 corrected: use canonical variables of type scheme uniformly
haftmann
parents: 40758
diff changeset
   749
     of SOME class => [[class]]
1ef64dcb24b7 corrected: use canonical variables of type scheme uniformly
haftmann
parents: 40758
diff changeset
   750
      | NONE => (case get_type_of_constr_or_abstr thy c
1ef64dcb24b7 corrected: use canonical variables of type scheme uniformly
haftmann
parents: 40758
diff changeset
   751
         of SOME (tyco, _) => (map snd o fst o the)
1ef64dcb24b7 corrected: use canonical variables of type scheme uniformly
haftmann
parents: 40758
diff changeset
   752
              (AList.lookup (op =) ((snd o fst o get_type thy) tyco) c)
1ef64dcb24b7 corrected: use canonical variables of type scheme uniformly
haftmann
parents: 40758
diff changeset
   753
          | NONE => replicate (length vs) []);
1ef64dcb24b7 corrected: use canonical variables of type scheme uniformly
haftmann
parents: 40758
diff changeset
   754
    val the_sort = the o AList.lookup (op =) (map fst vs ~~ sortargs);
1ef64dcb24b7 corrected: use canonical variables of type scheme uniformly
haftmann
parents: 40758
diff changeset
   755
    val ty = map_type_tfree (fn (v, _) => TFree (v, the_sort v)) raw_ty
34895
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   756
    val chead = build_head thy (c, ty);
54889
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   757
  in Thm.weaken chead Drule.dummy_thm end;
34891
99b9a6290446 code certificates as integral part of code generation
haftmann
parents: 34874
diff changeset
   758
55364
4d26690379b1 build up preprocessing context only once
haftmann
parents: 55363
diff changeset
   759
fun nothing_cert ctxt c = Nothing (dummy_thm ctxt c);
54889
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   760
55364
4d26690379b1 build up preprocessing context only once
haftmann
parents: 55363
diff changeset
   761
fun cert_of_eqns ctxt c [] = Equations (dummy_thm ctxt c, [])
4d26690379b1 build up preprocessing context only once
haftmann
parents: 55363
diff changeset
   762
  | cert_of_eqns ctxt c raw_eqns = 
34874
89c230bf8feb added code certificates
haftmann
parents: 34272
diff changeset
   763
      let
55364
4d26690379b1 build up preprocessing context only once
haftmann
parents: 55363
diff changeset
   764
        val thy = Proof_Context.theory_of ctxt;
34895
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   765
        val eqns = burrow_fst (canonize_thms thy) raw_eqns;
63240
f82c0b803bda more correct exception handling
haftmann
parents: 63239
diff changeset
   766
        val _ = map (assert_eqn thy) eqns;
34891
99b9a6290446 code certificates as integral part of code generation
haftmann
parents: 34874
diff changeset
   767
        val (thms, propers) = split_list eqns;
34895
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   768
        val _ = map (fn thm => if c = const_eqn thy thm then ()
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   769
          else error ("Wrong head of code equation,\nexpected constant "
61268
abe08fb15a12 moved remaining display.ML to more_thm.ML;
wenzelm
parents: 60949
diff changeset
   770
            ^ string_of_const thy c ^ "\n" ^ Thm.string_of_thm_global thy thm)) thms;
34891
99b9a6290446 code certificates as integral part of code generation
haftmann
parents: 34874
diff changeset
   771
        fun tvars_of T = rev (Term.add_tvarsT T []);
99b9a6290446 code certificates as integral part of code generation
haftmann
parents: 34874
diff changeset
   772
        val vss = map (tvars_of o snd o head_eqn) thms;
99b9a6290446 code certificates as integral part of code generation
haftmann
parents: 34874
diff changeset
   773
        fun inter_sorts vs =
99b9a6290446 code certificates as integral part of code generation
haftmann
parents: 34874
diff changeset
   774
          fold (curry (Sorts.inter_sort (Sign.classes_of thy)) o snd) vs [];
99b9a6290446 code certificates as integral part of code generation
haftmann
parents: 34874
diff changeset
   775
        val sorts = map_transpose inter_sorts vss;
43329
84472e198515 tuned signature: Name.invent and Name.invent_names;
wenzelm
parents: 43326
diff changeset
   776
        val vts = Name.invent_names Name.context Name.aT sorts;
40758
4f2c3e842ef8 consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents: 40726
diff changeset
   777
        val thms' =
60805
4cc49ead6e75 tuned signature;
wenzelm
parents: 60367
diff changeset
   778
          map2 (fn vs => Thm.instantiate (vs ~~ map (Thm.ctyp_of ctxt o TFree) vts, [])) vss thms;
40758
4f2c3e842ef8 consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents: 40726
diff changeset
   779
        val head_thm = Thm.symmetric (Thm.assume (build_head thy (head_eqn (hd thms'))));
34874
89c230bf8feb added code certificates
haftmann
parents: 34272
diff changeset
   780
        fun head_conv ct = if can Thm.dest_comb ct
89c230bf8feb added code certificates
haftmann
parents: 34272
diff changeset
   781
          then Conv.fun_conv head_conv ct
89c230bf8feb added code certificates
haftmann
parents: 34272
diff changeset
   782
          else Conv.rewr_conv head_thm ct;
89c230bf8feb added code certificates
haftmann
parents: 34272
diff changeset
   783
        val rewrite_head = Conv.fconv_rule (Conv.arg1_conv head_conv);
40758
4f2c3e842ef8 consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents: 40726
diff changeset
   784
        val cert_thm = Conjunction.intr_balanced (map rewrite_head thms');
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   785
      in Equations (cert_thm, propers) end;
34891
99b9a6290446 code certificates as integral part of code generation
haftmann
parents: 34874
diff changeset
   786
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   787
fun cert_of_proj thy c tyco =
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   788
  let
40758
4f2c3e842ef8 consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents: 40726
diff changeset
   789
    val (vs, ((abs, (_, ty)), (rep, _))) = get_abstype_spec thy tyco;
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   790
    val _ = if c = rep then () else
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   791
      error ("Wrong head of projection,\nexpected constant " ^ string_of_const thy rep);
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   792
  in Projection (mk_proj tyco vs ty abs rep, tyco) end;
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   793
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   794
fun cert_of_abs thy tyco c raw_abs_thm =
34874
89c230bf8feb added code certificates
haftmann
parents: 34272
diff changeset
   795
  let
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   796
    val abs_thm = singleton (canonize_thms thy) raw_abs_thm;
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   797
    val _ = assert_abs_eqn thy (SOME tyco) abs_thm;
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   798
    val _ = if c = const_abs_eqn thy abs_thm then ()
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   799
      else error ("Wrong head of abstract code equation,\nexpected constant "
61268
abe08fb15a12 moved remaining display.ML to more_thm.ML;
wenzelm
parents: 60949
diff changeset
   800
        ^ string_of_const thy c ^ "\n" ^ Thm.string_of_thm_global thy abs_thm);
36615
88756a5a92fc renamed Thm.freezeT to Thm.legacy_freezeT -- it is based on Type.legacy_freeze;
wenzelm
parents: 36610
diff changeset
   801
  in Abstract (Thm.legacy_freezeT abs_thm, tyco) end;
34874
89c230bf8feb added code certificates
haftmann
parents: 34272
diff changeset
   802
54889
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   803
fun constrain_cert_thm thy sorts cert_thm =
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   804
  let
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   805
    val ((vs, _), head) = get_head thy cert_thm;
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   806
    val (subst, cert_thm') = cert_thm
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   807
      |> Thm.implies_intr head
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   808
      |> constrain_thm thy vs sorts;
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   809
    val head' = Thm.term_of head
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   810
      |> subst
59621
291934bac95e Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents: 59458
diff changeset
   811
      |> Thm.global_cterm_of thy;
54889
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   812
    val cert_thm'' = cert_thm'
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   813
      |> Thm.elim_implies (Thm.assume head');
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   814
  in cert_thm'' end;
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   815
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   816
fun constrain_cert thy sorts (Nothing cert_thm) =
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   817
      Nothing (constrain_cert_thm thy sorts cert_thm)
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   818
  | constrain_cert thy sorts (Equations (cert_thm, propers)) =
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   819
      Equations (constrain_cert_thm thy sorts cert_thm, propers)
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   820
  | constrain_cert thy _ (cert as Projection _) =
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   821
      cert
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   822
  | constrain_cert thy sorts (Abstract (abs_thm, tyco)) =
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   823
      Abstract (snd (constrain_thm thy (fst (typscheme_abs thy abs_thm)) sorts abs_thm), tyco);
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   824
54889
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   825
fun conclude_cert (Nothing cert_thm) =
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   826
      Nothing (Thm.close_derivation cert_thm)
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   827
  | conclude_cert (Equations (cert_thm, propers)) =
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   828
      Equations (Thm.close_derivation cert_thm, propers)
49971
8b50286c36d3 close code theorems explicitly after preprocessing
haftmann
parents: 49904
diff changeset
   829
  | conclude_cert (cert as Projection _) =
8b50286c36d3 close code theorems explicitly after preprocessing
haftmann
parents: 49904
diff changeset
   830
      cert
8b50286c36d3 close code theorems explicitly after preprocessing
haftmann
parents: 49904
diff changeset
   831
  | conclude_cert (Abstract (abs_thm, tyco)) =
54889
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   832
      Abstract (Thm.close_derivation abs_thm, tyco);
49971
8b50286c36d3 close code theorems explicitly after preprocessing
haftmann
parents: 49904
diff changeset
   833
54889
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   834
fun typscheme_of_cert thy (Nothing cert_thm) =
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   835
      fst (get_head thy cert_thm)
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   836
  | typscheme_of_cert thy (Equations (cert_thm, _)) =
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   837
      fst (get_head thy cert_thm)
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   838
  | typscheme_of_cert thy (Projection (proj, _)) =
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   839
      typscheme_projection thy proj
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   840
  | typscheme_of_cert thy (Abstract (abs_thm, _)) =
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   841
      typscheme_abs thy abs_thm;
34874
89c230bf8feb added code certificates
haftmann
parents: 34272
diff changeset
   842
54889
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   843
fun typargs_deps_of_cert thy (Nothing cert_thm) =
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   844
      let
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   845
        val vs = (fst o fst) (get_head thy cert_thm);
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   846
      in (vs, []) end
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   847
  | typargs_deps_of_cert thy (Equations (cert_thm, propers)) =
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   848
      let
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   849
        val vs = (fst o fst) (get_head thy cert_thm);
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   850
        val equations = if null propers then [] else
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   851
          Thm.prop_of cert_thm
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   852
          |> Logic.dest_conjunction_balanced (length propers);
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   853
      in (vs, fold (add_rhss_of_eqn thy) equations []) end
40758
4f2c3e842ef8 consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents: 40726
diff changeset
   854
  | typargs_deps_of_cert thy (Projection (t, _)) =
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   855
      (fst (typscheme_projection thy t), add_rhss_of_eqn thy t [])
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   856
  | typargs_deps_of_cert thy (Abstract (abs_thm, tyco)) =
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   857
      let
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   858
        val vs = fst (typscheme_abs thy abs_thm);
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   859
        val (_, concrete_thm) = concretify_abs thy tyco abs_thm;
45344
e209da839ff4 added Logic.varify_types_global/unvarify_types_global, which avoids somewhat expensive Term.map_types;
wenzelm
parents: 45211
diff changeset
   860
      in (vs, add_rhss_of_eqn thy (Logic.unvarify_types_global (Thm.prop_of concrete_thm)) []) end;
34895
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   861
54889
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   862
fun equations_of_cert thy (cert as Nothing _) =
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   863
      (typscheme_of_cert thy cert, NONE)
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   864
  | equations_of_cert thy (cert as Equations (cert_thm, propers)) =
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   865
      let
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   866
        val tyscm = typscheme_of_cert thy cert;
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   867
        val thms = if null propers then [] else
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   868
          cert_thm
35624
c4e29a0bb8c1 modernized structure Local_Defs;
wenzelm
parents: 35376
diff changeset
   869
          |> Local_Defs.expand [snd (get_head thy cert_thm)]
35845
e5980f0ad025 renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents: 35624
diff changeset
   870
          |> Thm.varifyT_global
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   871
          |> Conjunction.elim_balanced (length propers);
36209
566be5d48090 more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents: 36202
diff changeset
   872
        fun abstractions (args, rhs) = (map (rpair NONE) args, (rhs, NONE));
54889
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   873
      in (tyscm, SOME (map (abstractions o dest_eqn o Thm.prop_of) thms ~~ (map SOME thms ~~ propers))) end
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   874
  | equations_of_cert thy (Projection (t, tyco)) =
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   875
      let
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   876
        val (_, ((abs, _), _)) = get_abstype_spec thy tyco;
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   877
        val tyscm = typscheme_projection thy t;
45344
e209da839ff4 added Logic.varify_types_global/unvarify_types_global, which avoids somewhat expensive Term.map_types;
wenzelm
parents: 45211
diff changeset
   878
        val t' = Logic.varify_types_global t;
36209
566be5d48090 more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents: 36202
diff changeset
   879
        fun abstractions (args, rhs) = (map (rpair (SOME abs)) args, (rhs, NONE));
54889
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   880
      in (tyscm, SOME [((abstractions o dest_eqn) t', (NONE, true))]) end
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   881
  | equations_of_cert thy (Abstract (abs_thm, tyco)) =
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   882
      let
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   883
        val tyscm = typscheme_abs thy abs_thm;
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   884
        val (abs, concrete_thm) = concretify_abs thy tyco abs_thm;
36209
566be5d48090 more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents: 36202
diff changeset
   885
        fun abstractions (args, rhs) = (map (rpair NONE) args, (rhs, (SOME abs)));
35845
e5980f0ad025 renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents: 35624
diff changeset
   886
      in
54889
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   887
        (tyscm, SOME [((abstractions o dest_eqn o Thm.prop_of) concrete_thm,
36209
566be5d48090 more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents: 36202
diff changeset
   888
          (SOME (Thm.varifyT_global abs_thm), true))])
35845
e5980f0ad025 renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents: 35624
diff changeset
   889
      end;
34895
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   890
54889
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   891
fun pretty_cert thy (cert as Nothing _) =
66022
cc8e9289a6c4 clarified message
haftmann
parents: 64430
diff changeset
   892
      [Pretty.str "(no equations)"]
54889
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   893
  | pretty_cert thy (cert as Equations _) =
63073
413184c7a2a2 clarified context, notably for internal use of Simplifier;
wenzelm
parents: 61268
diff changeset
   894
      (map_filter
413184c7a2a2 clarified context, notably for internal use of Simplifier;
wenzelm
parents: 61268
diff changeset
   895
        (Option.map (Thm.pretty_thm_global thy o
413184c7a2a2 clarified context, notably for internal use of Simplifier;
wenzelm
parents: 61268
diff changeset
   896
            Axclass.overload (Proof_Context.init_global thy)) o fst o snd)
54889
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   897
         o these o snd o equations_of_cert thy) cert
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   898
  | pretty_cert thy (Projection (t, _)) =
45344
e209da839ff4 added Logic.varify_types_global/unvarify_types_global, which avoids somewhat expensive Term.map_types;
wenzelm
parents: 45211
diff changeset
   899
      [Syntax.pretty_term_global thy (Logic.varify_types_global t)]
40758
4f2c3e842ef8 consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents: 40726
diff changeset
   900
  | pretty_cert thy (Abstract (abs_thm, _)) =
63073
413184c7a2a2 clarified context, notably for internal use of Simplifier;
wenzelm
parents: 61268
diff changeset
   901
      [(Thm.pretty_thm_global thy o
413184c7a2a2 clarified context, notably for internal use of Simplifier;
wenzelm
parents: 61268
diff changeset
   902
         Axclass.overload (Proof_Context.init_global thy) o Thm.varifyT_global) abs_thm];
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   903
34895
19fd499cddff explicit abstract type of code certificates
haftmann
parents: 34894
diff changeset
   904
end;
34891
99b9a6290446 code certificates as integral part of code generation
haftmann
parents: 34874
diff changeset
   905
34874
89c230bf8feb added code certificates
haftmann
parents: 34272
diff changeset
   906
57430
020cea57eaa4 tracing facilities for the code generator preprocessor
haftmann
parents: 57429
diff changeset
   907
(* code certificate access with preprocessing *)
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   908
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   909
fun retrieve_raw thy c =
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   910
  Symtab.lookup ((the_functions o the_exec) thy) c
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
   911
  |> Option.map (snd o fst)
54889
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
   912
  |> the_default None
34874
89c230bf8feb added code certificates
haftmann
parents: 34272
diff changeset
   913
48075
ec5e62b868eb apply preprocessing simpset also to rhs of abstract code equations
haftmann
parents: 48068
diff changeset
   914
fun eqn_conv conv ct =
ec5e62b868eb apply preprocessing simpset also to rhs of abstract code equations
haftmann
parents: 48068
diff changeset
   915
  let
ec5e62b868eb apply preprocessing simpset also to rhs of abstract code equations
haftmann
parents: 48068
diff changeset
   916
    fun lhs_conv ct = if can Thm.dest_comb ct
ec5e62b868eb apply preprocessing simpset also to rhs of abstract code equations
haftmann
parents: 48068
diff changeset
   917
      then Conv.combination_conv lhs_conv conv ct
ec5e62b868eb apply preprocessing simpset also to rhs of abstract code equations
haftmann
parents: 48068
diff changeset
   918
      else Conv.all_conv ct;
ec5e62b868eb apply preprocessing simpset also to rhs of abstract code equations
haftmann
parents: 48068
diff changeset
   919
  in Conv.combination_conv (Conv.arg_conv lhs_conv) conv ct end;
ec5e62b868eb apply preprocessing simpset also to rhs of abstract code equations
haftmann
parents: 48068
diff changeset
   920
55364
4d26690379b1 build up preprocessing context only once
haftmann
parents: 55363
diff changeset
   921
fun rewrite_eqn conv ctxt =
4d26690379b1 build up preprocessing context only once
haftmann
parents: 55363
diff changeset
   922
  singleton (Variable.trade (K (map (Conv.fconv_rule (conv (Simplifier.rewrite ctxt))))) ctxt)
48075
ec5e62b868eb apply preprocessing simpset also to rhs of abstract code equations
haftmann
parents: 48068
diff changeset
   923
55364
4d26690379b1 build up preprocessing context only once
haftmann
parents: 55363
diff changeset
   924
fun preprocess conv ctxt =
63073
413184c7a2a2 clarified context, notably for internal use of Simplifier;
wenzelm
parents: 61268
diff changeset
   925
  Thm.transfer (Proof_Context.theory_of ctxt)
413184c7a2a2 clarified context, notably for internal use of Simplifier;
wenzelm
parents: 61268
diff changeset
   926
  #> rewrite_eqn conv ctxt
413184c7a2a2 clarified context, notably for internal use of Simplifier;
wenzelm
parents: 61268
diff changeset
   927
  #> Axclass.unoverload ctxt;
55363
haftmann
parents: 54889
diff changeset
   928
55364
4d26690379b1 build up preprocessing context only once
haftmann
parents: 55363
diff changeset
   929
fun cert_of_eqns_preprocess ctxt functrans c =
58559
d230e7075bcf code preprocessor tracing also for function transformers
haftmann
parents: 58011
diff changeset
   930
  let
d230e7075bcf code preprocessor tracing also for function transformers
haftmann
parents: 58011
diff changeset
   931
    fun trace_eqns s eqns = (Pretty.writeln o Pretty.chunks)
61268
abe08fb15a12 moved remaining display.ML to more_thm.ML;
wenzelm
parents: 60949
diff changeset
   932
      (Pretty.str s :: map (Thm.pretty_thm ctxt o fst) eqns);
58559
d230e7075bcf code preprocessor tracing also for function transformers
haftmann
parents: 58011
diff changeset
   933
    val tracing = if Config.get ctxt simp_trace then trace_eqns else (K o K) ();
d230e7075bcf code preprocessor tracing also for function transformers
haftmann
parents: 58011
diff changeset
   934
  in
d230e7075bcf code preprocessor tracing also for function transformers
haftmann
parents: 58011
diff changeset
   935
    tap (tracing "before function transformation")
d230e7075bcf code preprocessor tracing also for function transformers
haftmann
parents: 58011
diff changeset
   936
    #> (perhaps o perhaps_loop o perhaps_apply) functrans
d230e7075bcf code preprocessor tracing also for function transformers
haftmann
parents: 58011
diff changeset
   937
    #> tap (tracing "after function transformation")
d230e7075bcf code preprocessor tracing also for function transformers
haftmann
parents: 58011
diff changeset
   938
    #> (map o apfst) (preprocess eqn_conv ctxt)
d230e7075bcf code preprocessor tracing also for function transformers
haftmann
parents: 58011
diff changeset
   939
    #> cert_of_eqns ctxt c
d230e7075bcf code preprocessor tracing also for function transformers
haftmann
parents: 58011
diff changeset
   940
  end;
48075
ec5e62b868eb apply preprocessing simpset also to rhs of abstract code equations
haftmann
parents: 48068
diff changeset
   941
57429
4aef934d43ad tuned interface
haftmann
parents: 56811
diff changeset
   942
fun get_cert ctxt functrans c =
55364
4d26690379b1 build up preprocessing context only once
haftmann
parents: 55363
diff changeset
   943
  let
57429
4aef934d43ad tuned interface
haftmann
parents: 56811
diff changeset
   944
    val thy = Proof_Context.theory_of ctxt;
55364
4d26690379b1 build up preprocessing context only once
haftmann
parents: 55363
diff changeset
   945
  in
4d26690379b1 build up preprocessing context only once
haftmann
parents: 55363
diff changeset
   946
    case retrieve_raw thy c of
59458
9de8ac92cafa abstract code equation may also be default
haftmann
parents: 59058
diff changeset
   947
      Eqns_Default (_, eqns_lazy) => Lazy.force eqns_lazy
55364
4d26690379b1 build up preprocessing context only once
haftmann
parents: 55363
diff changeset
   948
        |> cert_of_eqns_preprocess ctxt functrans c
48075
ec5e62b868eb apply preprocessing simpset also to rhs of abstract code equations
haftmann
parents: 48068
diff changeset
   949
    | Eqns eqns => eqns
55364
4d26690379b1 build up preprocessing context only once
haftmann
parents: 55363
diff changeset
   950
        |> cert_of_eqns_preprocess ctxt functrans c
4d26690379b1 build up preprocessing context only once
haftmann
parents: 55363
diff changeset
   951
    | None => nothing_cert ctxt c
59458
9de8ac92cafa abstract code equation may also be default
haftmann
parents: 59058
diff changeset
   952
    | Proj ((_, tyco), _) => cert_of_proj thy c tyco
9de8ac92cafa abstract code equation may also be default
haftmann
parents: 59058
diff changeset
   953
    | Abstr ((abs_thm, tyco), _) => abs_thm
55364
4d26690379b1 build up preprocessing context only once
haftmann
parents: 55363
diff changeset
   954
       |> preprocess Conv.arg_conv ctxt
4d26690379b1 build up preprocessing context only once
haftmann
parents: 55363
diff changeset
   955
       |> cert_of_abs thy tyco c
4d26690379b1 build up preprocessing context only once
haftmann
parents: 55363
diff changeset
   956
  end;
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   957
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   958
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
   959
(* cases *)
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   960
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   961
fun case_certificate thm =
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   962
  let
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   963
    val ((head, raw_case_expr), cases) = (apfst Logic.dest_equals
32640
ba6531df2c64 corrected order of type variables in code equations; more precise certificate for cases
haftmann
parents: 32544
diff changeset
   964
      o apsnd Logic.dest_conjunctions o Logic.dest_implies o Thm.plain_prop_of) thm;
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   965
    val _ = case head of Free _ => true
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   966
      | Var _ => true
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   967
      | _ => raise TERM ("case_cert", []);
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   968
    val ([(case_var, _)], case_expr) = Term.strip_abs_eta 1 raw_case_expr;
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   969
    val (Const (case_const, _), raw_params) = strip_comb case_expr;
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   970
    val n = find_index (fn Free (v, _) => v = case_var | _ => false) raw_params;
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   971
    val _ = if n = ~1 then raise TERM ("case_cert", []) else ();
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   972
    val params = map (fst o dest_Var) (nth_drop n raw_params);
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   973
    fun dest_case t =
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   974
      let
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   975
        val (head' $ t_co, rhs) = Logic.dest_equals t;
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   976
        val _ = if head' = head then () else raise TERM ("case_cert", []);
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   977
        val (Const (co, _), args) = strip_comb t_co;
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   978
        val (Var (param, _), args') = strip_comb rhs;
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   979
        val _ = if args' = args then () else raise TERM ("case_cert", []);
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   980
      in (param, co) end;
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   981
    fun analyze_cases cases =
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   982
      let
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   983
        val co_list = fold (AList.update (op =) o dest_case) cases [];
47437
4625ee486ff6 generalise case certificates to allow ignored parameters
Andreas Lochbihler
parents: 46513
diff changeset
   984
      in map (AList.lookup (op =) co_list) params end;
31156
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   985
    fun analyze_let t =
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   986
      let
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   987
        val (head' $ arg, Var (param', _) $ arg') = Logic.dest_equals t;
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   988
        val _ = if head' = head then () else raise TERM ("case_cert", []);
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   989
        val _ = if arg' = arg then () else raise TERM ("case_cert", []);
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   990
        val _ = if [param'] = params then () else raise TERM ("case_cert", []);
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   991
      in [] end;
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   992
    fun analyze (cases as [let_case]) =
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   993
          (analyze_cases cases handle Bind => analyze_let let_case)
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   994
      | analyze cases = analyze_cases cases;
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   995
  in (case_const, (n, analyze cases)) end;
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   996
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   997
fun case_cert thm = case_certificate thm
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   998
  handle Bind => error "bad case certificate"
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
   999
       | TERM _ => error "bad case certificate";
90fed3d4430f merged module code_unit.ML into code.ML
haftmann
parents: 31152
diff changeset
  1000
66024
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
  1001
fun get_case_scheme thy =
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
  1002
  Option.map fst o (Symtab.lookup o the_cases o the_exec) thy;
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
  1003
fun get_case_cong thy =
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
  1004
  Option.map snd o (Symtab.lookup o the_cases o the_exec) thy;
24219
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
  1005
66024
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
  1006
val undefineds = Symtab.keys o the_undefineds o the_exec;
24219
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
  1007
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
  1008
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
  1009
(* diagnostic *)
24219
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
  1010
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
  1011
fun print_codesetup thy =
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
  1012
  let
42360
da8817d01e7c modernized structure Proof_Context;
wenzelm
parents: 42359
diff changeset
  1013
    val ctxt = Proof_Context.init_global thy;
24844
98c006a30218 certificates for code generator case expressions
haftmann
parents: 24837
diff changeset
  1014
    val exec = the_exec thy;
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1015
    fun pretty_equations const thms =
51584
98029ceda8ce more item markup;
wenzelm
parents: 51580
diff changeset
  1016
      (Pretty.block o Pretty.fbreaks)
61268
abe08fb15a12 moved remaining display.ML to more_thm.ML;
wenzelm
parents: 60949
diff changeset
  1017
        (Pretty.str (string_of_const thy const) :: map (Thm.pretty_thm_item ctxt) thms);
59458
9de8ac92cafa abstract code equation may also be default
haftmann
parents: 59058
diff changeset
  1018
    fun pretty_function (const, Eqns_Default (_, eqns_lazy)) =
51580
64ef8260dc60 Pretty.item markup for improved readability of lists of items;
wenzelm
parents: 51551
diff changeset
  1019
          pretty_equations const (map fst (Lazy.force eqns_lazy))
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1020
      | pretty_function (const, Eqns eqns) = pretty_equations const (map fst eqns)
54889
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
  1021
      | pretty_function (const, None) = pretty_equations const []
59458
9de8ac92cafa abstract code equation may also be default
haftmann
parents: 59058
diff changeset
  1022
      | pretty_function (const, Proj ((proj, _), _)) = Pretty.block
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1023
          [Pretty.str (string_of_const thy const), Pretty.fbrk, Syntax.pretty_term ctxt proj]
59458
9de8ac92cafa abstract code equation may also be default
haftmann
parents: 59058
diff changeset
  1024
      | pretty_function (const, Abstr ((thm, _), _)) = pretty_equations const [thm];
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1025
    fun pretty_typ (tyco, vs) = Pretty.str
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1026
      (string_of_typ thy (Type (tyco, map TFree vs)));
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1027
    fun pretty_typspec (typ, (cos, abstract)) = if null cos
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1028
      then pretty_typ typ
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1029
      else (Pretty.block o Pretty.breaks) (
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1030
        pretty_typ typ
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1031
        :: Pretty.str "="
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1032
        :: (if abstract then [Pretty.str "(abstract)"] else [])
40726
16dcfedc4eb7 keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents: 40564
diff changeset
  1033
        @ separate (Pretty.str "|") (map (fn (c, (_, [])) => Pretty.str (string_of_const thy c)
16dcfedc4eb7 keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents: 40564
diff changeset
  1034
             | (c, (_, tys)) =>
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1035
                 (Pretty.block o Pretty.breaks)
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1036
                    (Pretty.str (string_of_const thy c)
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1037
                      :: Pretty.str "of"
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1038
                      :: map (Pretty.quote o Syntax.pretty_typ_global thy) tys)) cos)
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1039
      );
47555
haftmann
parents: 47437
diff changeset
  1040
    fun pretty_caseparam NONE = "<ignored>"
haftmann
parents: 47437
diff changeset
  1041
      | pretty_caseparam (SOME c) = string_of_const thy c
37438
4906ab970316 maintain cong rules for case combinators
haftmann
parents: 37425
diff changeset
  1042
    fun pretty_case (const, ((_, (_, [])), _)) = Pretty.str (string_of_const thy const)
4906ab970316 maintain cong rules for case combinators
haftmann
parents: 37425
diff changeset
  1043
      | pretty_case (const, ((_, (_, cos)), _)) = (Pretty.block o Pretty.breaks) [
34901
0d6a2ae86525 printing of cases
haftmann
parents: 34895
diff changeset
  1044
          Pretty.str (string_of_const thy const), Pretty.str "with",
47555
haftmann
parents: 47437
diff changeset
  1045
          (Pretty.block o Pretty.commas o map (Pretty.str o pretty_caseparam)) cos];
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1046
    val functions = the_functions exec
24423
ae9cd0e92423 overloaded definitions accompanied by explicit constants
haftmann
parents: 24283
diff changeset
  1047
      |> Symtab.dest
28695
f7a06d7284c8 explicit history for equations; tuned
haftmann
parents: 28673
diff changeset
  1048
      |> (map o apsnd) (snd o fst)
59058
a78612c67ec0 renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents: 58666
diff changeset
  1049
      |> sort (string_ord o apply2 fst);
35299
4f4d5bf4ea08 proper distinction of code datatypes and abstypes
haftmann
parents: 35226
diff changeset
  1050
    val datatypes = the_types exec
24219
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
  1051
      |> Symtab.dest
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1052
      |> map (fn (tyco, (_, (vs, spec)) :: _) =>
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1053
          ((tyco, vs), constructors_of spec))
59058
a78612c67ec0 renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents: 58666
diff changeset
  1054
      |> sort (string_ord o apply2 (fst o fst));
66024
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
  1055
    val cases = Symtab.dest ((the_cases o the_exec) thy);
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
  1056
    val undefineds = Symtab.keys ((the_undefineds o the_exec) thy);
24219
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
  1057
  in
56334
6b3739fee456 some shortcuts for chunks, which sometimes avoid bulky string output;
wenzelm
parents: 56204
diff changeset
  1058
    Pretty.writeln_chunks [
24219
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
  1059
      Pretty.block (
34901
0d6a2ae86525 printing of cases
haftmann
parents: 34895
diff changeset
  1060
        Pretty.str "code equations:" :: Pretty.fbrk
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1061
        :: (Pretty.fbreaks o map pretty_function) functions
24219
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
  1062
      ),
25968
66cfe1d00be0 print postprocessor equations
haftmann
parents: 25597
diff changeset
  1063
      Pretty.block (
34901
0d6a2ae86525 printing of cases
haftmann
parents: 34895
diff changeset
  1064
        Pretty.str "datatypes:" :: Pretty.fbrk
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1065
        :: (Pretty.fbreaks o map pretty_typspec) datatypes
34901
0d6a2ae86525 printing of cases
haftmann
parents: 34895
diff changeset
  1066
      ),
0d6a2ae86525 printing of cases
haftmann
parents: 34895
diff changeset
  1067
      Pretty.block (
0d6a2ae86525 printing of cases
haftmann
parents: 34895
diff changeset
  1068
        Pretty.str "cases:" :: Pretty.fbrk
0d6a2ae86525 printing of cases
haftmann
parents: 34895
diff changeset
  1069
        :: (Pretty.fbreaks o map pretty_case) cases
0d6a2ae86525 printing of cases
haftmann
parents: 34895
diff changeset
  1070
      ),
0d6a2ae86525 printing of cases
haftmann
parents: 34895
diff changeset
  1071
      Pretty.block (
0d6a2ae86525 printing of cases
haftmann
parents: 34895
diff changeset
  1072
        Pretty.str "undefined:" :: Pretty.fbrk
0d6a2ae86525 printing of cases
haftmann
parents: 34895
diff changeset
  1073
        :: (Pretty.commas o map (Pretty.str o string_of_const thy)) undefineds
24219
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
  1074
      )
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
  1075
    ]
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
  1076
  end;
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
  1077
e558fe311376 new structure for code generator modules
haftmann
parents:
diff changeset
  1078
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
  1079
(** declaring executable ingredients **)
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
  1080
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
  1081
(* code equations *)
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
  1082
63239
d562c9948dee explicit tagging of code equations de-baroquifies interface
haftmann
parents: 63238
diff changeset
  1083
(*
d562c9948dee explicit tagging of code equations de-baroquifies interface
haftmann
parents: 63238
diff changeset
  1084
  external distinction:
d562c9948dee explicit tagging of code equations de-baroquifies interface
haftmann
parents: 63238
diff changeset
  1085
    kind * default
d562c9948dee explicit tagging of code equations de-baroquifies interface
haftmann
parents: 63238
diff changeset
  1086
  processual distinction:
d562c9948dee explicit tagging of code equations de-baroquifies interface
haftmann
parents: 63238
diff changeset
  1087
    thm * proper  for concrete equations
d562c9948dee explicit tagging of code equations de-baroquifies interface
haftmann
parents: 63238
diff changeset
  1088
    thm  for abstract equations
63244
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1089
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1090
  strictness wrt. shape of theorem propositions:
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1091
    * default attributes: silent
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1092
    * user attributes: warnings (after morphism application!)
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1093
    * Isabelle/ML functions: strict
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1094
    * internal processing after storage: strict
63239
d562c9948dee explicit tagging of code equations de-baroquifies interface
haftmann
parents: 63238
diff changeset
  1095
*)
d562c9948dee explicit tagging of code equations de-baroquifies interface
haftmann
parents: 63238
diff changeset
  1096
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1097
fun gen_add_eqn default (raw_thm, proper) thy =
33075
f654dafa021e close thm derivations explicitly
haftmann
parents: 33006
diff changeset
  1098
  let
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1099
    val thm = Thm.close_derivation raw_thm;
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1100
    val c = const_eqn thy thm;
52788
da1fdbfebd39 type theory is purely value-oriented;
wenzelm
parents: 52781
diff changeset
  1101
    fun update_subsume verbose (thm, proper) eqns = 
37460
910b2422571d drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents: 37448
diff changeset
  1102
      let
48902
44a6967240b7 prefer classic take_prefix/take_suffix over chop_while (cf. 0659e84bdc5f);
wenzelm
parents: 48075
diff changeset
  1103
        val args_of = snd o take_prefix is_Var o rev o snd o strip_comb
39791
a91430778479 redundancy check: drop trailing Var arguments (avoids eta problems with equations)
haftmann
parents: 39568
diff changeset
  1104
          o map_types Type.strip_sorts o fst o Logic.dest_equals o Thm.plain_prop_of;
37460
910b2422571d drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents: 37448
diff changeset
  1105
        val args = args_of thm;
59787
6e2a20486897 local fixes may depend on goal params;
wenzelm
parents: 59621
diff changeset
  1106
        val incr_idx = Logic.incr_indexes ([], [], Thm.maxidx_of thm + 1);
39794
51451d73c3d4 corrected subsumption check: arguments have been reversed; addition of default equations to non-default equations is identity
haftmann
parents: 39791
diff changeset
  1107
        fun matches_args args' =
51451d73c3d4 corrected subsumption check: arguments have been reversed; addition of default equations to non-default equations is identity
haftmann
parents: 39791
diff changeset
  1108
          let
51451d73c3d4 corrected subsumption check: arguments have been reversed; addition of default equations to non-default equations is identity
haftmann
parents: 39791
diff changeset
  1109
            val k = length args' - length args
51451d73c3d4 corrected subsumption check: arguments have been reversed; addition of default equations to non-default equations is identity
haftmann
parents: 39791
diff changeset
  1110
          in if k >= 0
51451d73c3d4 corrected subsumption check: arguments have been reversed; addition of default equations to non-default equations is identity
haftmann
parents: 39791
diff changeset
  1111
            then Pattern.matchess thy (args, (map incr_idx o drop k) args')
51451d73c3d4 corrected subsumption check: arguments have been reversed; addition of default equations to non-default equations is identity
haftmann
parents: 39791
diff changeset
  1112
            else false
51451d73c3d4 corrected subsumption check: arguments have been reversed; addition of default equations to non-default equations is identity
haftmann
parents: 39791
diff changeset
  1113
          end;
37460
910b2422571d drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents: 37448
diff changeset
  1114
        fun drop (thm', proper') = if (proper orelse not proper')
910b2422571d drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents: 37448
diff changeset
  1115
          andalso matches_args (args_of thm') then 
52781
e78c3023162b silenced subsumption warnings for default code equations entirely
haftmann
parents: 52637
diff changeset
  1116
            (if verbose then warning ("Code generator: dropping subsumed code equation\n" ^
61268
abe08fb15a12 moved remaining display.ML to more_thm.ML;
wenzelm
parents: 60949
diff changeset
  1117
                Thm.string_of_thm_global thy thm') else (); true)
37460
910b2422571d drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents: 37448
diff changeset
  1118
          else false;
910b2422571d drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents: 37448
diff changeset
  1119
      in (thm, proper) :: filter_out drop eqns end;
52788
da1fdbfebd39 type theory is purely value-oriented;
wenzelm
parents: 52781
diff changeset
  1120
    fun natural_order eqns =
da1fdbfebd39 type theory is purely value-oriented;
wenzelm
parents: 52781
diff changeset
  1121
      (eqns, Lazy.lazy (fn () => fold (update_subsume false) eqns []))
59458
9de8ac92cafa abstract code equation may also be default
haftmann
parents: 59058
diff changeset
  1122
    fun add_eqn' true (Eqns_Default (eqns, _)) = Eqns_Default (natural_order ((thm, proper) :: eqns))
37460
910b2422571d drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents: 37448
diff changeset
  1123
          (*this restores the natural order and drops syntactic redundancies*)
59458
9de8ac92cafa abstract code equation may also be default
haftmann
parents: 59058
diff changeset
  1124
      | add_eqn' true None = Eqns_Default (natural_order [(thm, proper)])
39794
51451d73c3d4 corrected subsumption check: arguments have been reversed; addition of default equations to non-default equations is identity
haftmann
parents: 39791
diff changeset
  1125
      | add_eqn' true fun_spec = fun_spec
52788
da1fdbfebd39 type theory is purely value-oriented;
wenzelm
parents: 52781
diff changeset
  1126
      | add_eqn' false (Eqns eqns) = Eqns (update_subsume true (thm, proper) eqns)
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1127
      | add_eqn' false _ = Eqns [(thm, proper)];
54886
3774542df61b uniform bookkeeping also in the case of deletion
haftmann
parents: 54884
diff changeset
  1128
  in change_fun_spec c (add_eqn' default) thy end;
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
  1129
59458
9de8ac92cafa abstract code equation may also be default
haftmann
parents: 59058
diff changeset
  1130
fun gen_add_abs_eqn default raw_thm thy =
52637
1501ebe39711 attribute "code" declares concrete and abstract code equations uniformly; added explicit "code equation" instead
haftmann
parents: 52475
diff changeset
  1131
  let
1501ebe39711 attribute "code" declares concrete and abstract code equations uniformly; added explicit "code equation" instead
haftmann
parents: 52475
diff changeset
  1132
    val (abs_thm, tyco) = apfst Thm.close_derivation raw_thm;
1501ebe39711 attribute "code" declares concrete and abstract code equations uniformly; added explicit "code equation" instead
haftmann
parents: 52475
diff changeset
  1133
    val c = const_abs_eqn thy abs_thm;
59458
9de8ac92cafa abstract code equation may also be default
haftmann
parents: 59058
diff changeset
  1134
  in change_fun_spec c (K (Abstr ((abs_thm, tyco), default))) thy end;
52637
1501ebe39711 attribute "code" declares concrete and abstract code equations uniformly; added explicit "code equation" instead
haftmann
parents: 52475
diff changeset
  1135
63239
d562c9948dee explicit tagging of code equations de-baroquifies interface
haftmann
parents: 63238
diff changeset
  1136
datatype kind = Equation | Nbe | Abstract;
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
  1137
63244
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1138
fun mk_eqn strictness thy = generic_assert_eqn strictness thy false o
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1139
  apfst (meta_rewrite thy);
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1140
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1141
fun mk_abs_eqn strictness thy = generic_assert_abs_eqn strictness thy NONE o
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1142
  meta_rewrite thy;
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1143
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1144
fun mk_maybe_abs_eqn thy raw_thm =
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1145
  let
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1146
    val thm = meta_rewrite thy raw_thm;
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1147
    val some_abs_thm = generic_assert_abs_eqn Silent thy NONE thm;
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1148
  in case some_abs_thm
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1149
   of SOME (thm, tyco) => SOME ((thm, true), SOME tyco)
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1150
    | NONE => Option.map (fn (thm, _) => ((thm, is_linear thm), NONE))
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1151
        (generic_assert_eqn Liberal thy false (thm, false))
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1152
  end;
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1153
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1154
fun generic_add_eqn strictness (kind, default) thm thy =
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1155
  case kind of
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1156
    Equation => fold (gen_add_eqn default)
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1157
      (the_list (mk_eqn strictness thy (thm, true))) thy
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1158
  | Nbe => fold (gen_add_eqn default)
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1159
      (the_list (mk_eqn strictness thy (thm, false))) thy
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1160
  | Abstract => fold (gen_add_abs_eqn default)
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1161
      (the_list (mk_abs_eqn strictness thy thm)) thy;
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1162
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1163
val add_eqn = generic_add_eqn Strict;
37425
b5492f611129 explicitly name and note equations for class eq
haftmann
parents: 36615
diff changeset
  1164
63239
d562c9948dee explicit tagging of code equations de-baroquifies interface
haftmann
parents: 63238
diff changeset
  1165
fun lift_attribute f = Thm.declaration_attribute
d562c9948dee explicit tagging of code equations de-baroquifies interface
haftmann
parents: 63238
diff changeset
  1166
  (fn thm => Context.mapping (f thm) I);
37425
b5492f611129 explicitly name and note equations for class eq
haftmann
parents: 36615
diff changeset
  1167
63239
d562c9948dee explicit tagging of code equations de-baroquifies interface
haftmann
parents: 63238
diff changeset
  1168
fun add_default_eqn_attribute kind =
63244
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1169
  lift_attribute (generic_add_eqn Silent (kind, true));
52637
1501ebe39711 attribute "code" declares concrete and abstract code equations uniformly; added explicit "code equation" instead
haftmann
parents: 52475
diff changeset
  1170
63239
d562c9948dee explicit tagging of code equations de-baroquifies interface
haftmann
parents: 63238
diff changeset
  1171
fun add_default_eqn_attrib kind =
d562c9948dee explicit tagging of code equations de-baroquifies interface
haftmann
parents: 63238
diff changeset
  1172
  Attrib.internal (K (add_default_eqn_attribute kind));
55720
f3a2931a6656 add missing attributes
kuncar
parents: 55364
diff changeset
  1173
63244
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1174
fun add_maybe_abs_eqn_liberal thm thy =
9986559617ee clear distinction between different situations concerning strictness of code equations
haftmann
parents: 63241
diff changeset
  1175
  case mk_maybe_abs_eqn thy thm
52637
1501ebe39711 attribute "code" declares concrete and abstract code equations uniformly; added explicit "code equation" instead
haftmann
parents: 52475
diff changeset
  1176
   of SOME (eqn, NONE) => gen_add_eqn false eqn thy
59458
9de8ac92cafa abstract code equation may also be default
haftmann
parents: 59058
diff changeset
  1177
    | SOME ((thm, _), SOME tyco) => gen_add_abs_eqn false (thm, tyco) thy
52637
1501ebe39711 attribute "code" declares concrete and abstract code equations uniformly; added explicit "code equation" instead
haftmann
parents: 52475
diff changeset
  1178
    | NONE => thy;
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1179
64430
1d85ac286c72 avoid code generator warnings when deleting equations in BNF commands (e.g., datatype) in locales with assumptions and similar
blanchet
parents: 63244
diff changeset
  1180
fun generic_del_eqn strictness thm thy = case mk_eqn strictness thy (thm, true)
54888
6edabf38d929 tuned whitespace
haftmann
parents: 54887
diff changeset
  1181
 of SOME (thm, _) =>
6edabf38d929 tuned whitespace
haftmann
parents: 54887
diff changeset
  1182
      let
59458
9de8ac92cafa abstract code equation may also be default
haftmann
parents: 59058
diff changeset
  1183
        fun del_eqn' (Eqns_Default _) = initial_fun_spec
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1184
          | del_eqn' (Eqns eqns) =
54889
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
  1185
              let
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
  1186
                val eqns' = filter_out (fn (thm', _) => Thm.eq_thm_prop (thm, thm')) eqns
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
  1187
              in if null eqns' then None else Eqns eqns' end
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1188
          | del_eqn' spec = spec
54886
3774542df61b uniform bookkeeping also in the case of deletion
haftmann
parents: 54884
diff changeset
  1189
      in change_fun_spec (const_eqn thy thm) del_eqn' thy end
31962
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
  1190
  | NONE => thy;
baa8dce5bc45 tuned structure Code internally
haftmann
parents: 31957
diff changeset
  1191
64430
1d85ac286c72 avoid code generator warnings when deleting equations in BNF commands (e.g., datatype) in locales with assumptions and similar
blanchet
parents: 63244
diff changeset
  1192
val del_eqn_silent = generic_del_eqn Silent;
1d85ac286c72 avoid code generator warnings when deleting equations in BNF commands (e.g., datatype) in locales with assumptions and similar
blanchet
parents: 63244
diff changeset
  1193
val del_eqn = generic_del_eqn Liberal;
1d85ac286c72 avoid code generator warnings when deleting equations in BNF commands (e.g., datatype) in locales with assumptions and similar
blanchet
parents: 63244
diff changeset
  1194
54889
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
  1195
fun del_eqns c = change_fun_spec c (K None);
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
  1196
4121d64fde90 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents: 54888
diff changeset
  1197
fun del_exception c = change_fun_spec c (K (Eqns []));
34244
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
  1198
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
  1199
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
  1200
(* cases *)
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
  1201
40758
4f2c3e842ef8 consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents: 40726
diff changeset
  1202
fun case_cong thy case_const (num_args, (pos, _)) =
37438
4906ab970316 maintain cong rules for case combinators
haftmann
parents: 37425
diff changeset
  1203
  let
43326
47cf4bc789aa simplified Name.variant -- discontinued builtin fold_map;
wenzelm
parents: 42707
diff changeset
  1204
    val ([x, y], ctxt) = fold_map Name.variant ["A", "A'"] Name.context;
47cf4bc789aa simplified Name.variant -- discontinued builtin fold_map;
wenzelm
parents: 42707
diff changeset
  1205
    val (zs, _) = fold_map Name.variant (replicate (num_args - 1) "") ctxt;
37438
4906ab970316 maintain cong rules for case combinators
haftmann
parents: 37425
diff changeset
  1206
    val (ws, vs) = chop pos zs;
54604
1512fa5fe531 prefer sort-stripping const_typ over Sign.the_const_type whenever appropriate
haftmann
parents: 54603
diff changeset
  1207
    val T = devarify (const_typ thy case_const);
40844
5895c525739d more direct use of binder_types/body_type;
wenzelm
parents: 40803
diff changeset
  1208
    val Ts = binder_types T;
37438
4906ab970316 maintain cong rules for case combinators
haftmann
parents: 37425
diff changeset
  1209
    val T_cong = nth Ts pos;
4906ab970316 maintain cong rules for case combinators
haftmann
parents: 37425
diff changeset
  1210
    fun mk_prem z = Free (z, T_cong);
4906ab970316 maintain cong rules for case combinators
haftmann
parents: 37425
diff changeset
  1211
    fun mk_concl z = list_comb (Const (case_const, T), map2 (curry Free) (ws @ z :: vs) Ts);
59058
a78612c67ec0 renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents: 58666
diff changeset
  1212
    val (prem, concl) = apply2 Logic.mk_equals (apply2 mk_prem (x, y), apply2 mk_concl (x, y));
54742
7a86358a3c0b proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents: 54604
diff changeset
  1213
  in
7a86358a3c0b proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents: 54604
diff changeset
  1214
    Goal.prove_sorry_global thy (x :: y :: zs) [prem] concl
7a86358a3c0b proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents: 54604
diff changeset
  1215
      (fn {context = ctxt', prems} =>
7a86358a3c0b proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents: 54604
diff changeset
  1216
        Simplifier.rewrite_goals_tac ctxt' prems
7a86358a3c0b proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents: 54604
diff changeset
  1217
        THEN ALLGOALS (Proof_Context.fact_tac ctxt' [Drule.reflexive_thm]))
7a86358a3c0b proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents: 54604
diff changeset
  1218
  end;
37438
4906ab970316 maintain cong rules for case combinators
haftmann
parents: 37425
diff changeset
  1219
34244
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
  1220
fun add_case thm thy =
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
  1221
  let
43634
93cd6dd1a1c6 index cases for constructors
haftmann
parents: 43329
diff changeset
  1222
    val (case_const, (k, cos)) = case_cert thm;
47555
haftmann
parents: 47437
diff changeset
  1223
    val _ = case (filter_out (is_constr thy) o map_filter I) cos
34244
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
  1224
     of [] => ()
45430
b8eb7a791dac misc tuning;
wenzelm
parents: 45344
diff changeset
  1225
      | cs => error ("Non-constructor(s) in case certificate: " ^ commas_quote cs);
43634
93cd6dd1a1c6 index cases for constructors
haftmann
parents: 43329
diff changeset
  1226
    val entry = (1 + Int.max (1, length cos), (k, cos));
66024
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
  1227
    fun register_case cong = map_cases
43634
93cd6dd1a1c6 index cases for constructors
haftmann
parents: 43329
diff changeset
  1228
      (Symtab.update (case_const, (entry, cong)));
93cd6dd1a1c6 index cases for constructors
haftmann
parents: 43329
diff changeset
  1229
    fun register_for_constructors (Constructors (cos', cases)) =
93cd6dd1a1c6 index cases for constructors
haftmann
parents: 43329
diff changeset
  1230
         Constructors (cos',
47437
4625ee486ff6 generalise case certificates to allow ignored parameters
Andreas Lochbihler
parents: 46513
diff changeset
  1231
           if exists (fn (co, _) => member (op =) cos (SOME co)) cos'
43634
93cd6dd1a1c6 index cases for constructors
haftmann
parents: 43329
diff changeset
  1232
           then insert (op =) case_const cases
93cd6dd1a1c6 index cases for constructors
haftmann
parents: 43329
diff changeset
  1233
           else cases)
93cd6dd1a1c6 index cases for constructors
haftmann
parents: 43329
diff changeset
  1234
      | register_for_constructors (x as Abstractor _) = x;
93cd6dd1a1c6 index cases for constructors
haftmann
parents: 43329
diff changeset
  1235
    val register_type = (map_typs o Symtab.map)
93cd6dd1a1c6 index cases for constructors
haftmann
parents: 43329
diff changeset
  1236
      (K ((map o apsnd o apsnd) register_for_constructors));
37438
4906ab970316 maintain cong rules for case combinators
haftmann
parents: 37425
diff changeset
  1237
  in
4906ab970316 maintain cong rules for case combinators
haftmann
parents: 37425
diff changeset
  1238
    thy
4906ab970316 maintain cong rules for case combinators
haftmann
parents: 37425
diff changeset
  1239
    |> `(fn thy => case_cong thy case_const entry)
43634
93cd6dd1a1c6 index cases for constructors
haftmann
parents: 43329
diff changeset
  1240
    |-> (fn cong => map_exec_purge (register_case cong #> register_type))
37438
4906ab970316 maintain cong rules for case combinators
haftmann
parents: 37425
diff changeset
  1241
  end;
34244
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
  1242
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
  1243
fun add_undefined c thy =
66024
77d9334830ec decomposed tuple
haftmann
parents: 66023
diff changeset
  1244
  (map_exec_purge o map_undefineds) (Symtab.update (c, ())) thy;
34244
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
  1245
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
  1246
35299
4f4d5bf4ea08 proper distinction of code datatypes and abstypes
haftmann
parents: 35226
diff changeset
  1247
(* types *)
34244
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
  1248
35299
4f4d5bf4ea08 proper distinction of code datatypes and abstypes
haftmann
parents: 35226
diff changeset
  1249
fun register_type (tyco, vs_spec) thy =
34244
03f8dcab55f3 code cache without copy; tuned
haftmann
parents: 34184
diff changeset
  1250
  let
35226
b987b803616d a simple concept for datatype invariants
haftmann
parents: 34901
diff changeset
  1251
    val (old_constrs, some_old_proj) =
35299
4f4d5bf4ea08 proper distinction of code datatypes and abstypes
haftmann
parents: 35226
diff changeset
  1252
      case these (Symtab.lookup ((the_types o the_exec) thy) tyco)
43634
93cd6dd1a1c6 index cases for constructors
haftmann
parents: 43329
diff changeset
  1253
       of (_, (_, Constructors (cos, _))) :: _ => (map fst cos, NONE)
36209
566be5d48090 more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents: 36202
diff changeset