src/Pure/Isar/locale.ML
author wenzelm
Wed Apr 13 18:34:22 2005 +0200 (2005-04-13)
changeset 15703 727ef1b8b3ee
parent 15696 1da4ce092c0b
child 15721 1071f41a8441
permissions -rw-r--r--
*** empty log message ***
wenzelm@12014
     1
(*  Title:      Pure/Isar/locale.ML
wenzelm@11896
     2
    ID:         $Id$
ballarin@15206
     3
    Author:     Clemens Ballarin, TU Muenchen; Markus Wenzel, LMU/TU Muenchen
wenzelm@11896
     4
wenzelm@12058
     5
Locales -- Isar proof contexts as meta-level predicates, with local
wenzelm@12529
     6
syntax and implicit structures.
wenzelm@12529
     7
ballarin@14215
     8
Draws some basic ideas from Florian Kammueller's original version of
wenzelm@12529
     9
locales, but uses the richer infrastructure of Isar instead of the raw
wenzelm@12529
    10
meta-logic.  Furthermore, we provide structured import of contexts
ballarin@14215
    11
(with merge and rename operations), as well as type-inference of the
wenzelm@13375
    12
signature parts, and predicate definitions of the specification text.
ballarin@14446
    13
ballarin@14446
    14
See also:
ballarin@14446
    15
ballarin@14446
    16
[1] Clemens Ballarin. Locales and Locale Expressions in Isabelle/Isar.
ballarin@14446
    17
    In Stefano Berardi et al., Types for Proofs and Programs: International
ballarin@15099
    18
    Workshop, TYPES 2003, Torino, Italy, LNCS 3085, pages 34-50, 2004.
wenzelm@11896
    19
*)
wenzelm@11896
    20
wenzelm@11896
    21
signature LOCALE =
wenzelm@11896
    22
sig
wenzelm@12046
    23
  type context
wenzelm@15703
    24
  datatype ('typ, 'term, 'fact) elem =
wenzelm@12058
    25
    Fixes of (string * 'typ option * mixfix option) list |
wenzelm@15703
    26
    Assumes of ((string * Attrib.src list) * ('term * ('term list * 'term list)) list) list |
wenzelm@15703
    27
    Defines of ((string * Attrib.src list) * ('term * 'term list)) list |
wenzelm@15703
    28
    Notes of ((string * Attrib.src list) * ('fact * Attrib.src list) list) list
wenzelm@12273
    29
  datatype expr =
wenzelm@12273
    30
    Locale of string |
wenzelm@12273
    31
    Rename of expr * string option list |
wenzelm@12273
    32
    Merge of expr list
wenzelm@12273
    33
  val empty: expr
ballarin@15206
    34
  datatype 'a elem_expr = Elem of 'a | Expr of expr
ballarin@15206
    35
ballarin@15206
    36
  (* Abstract interface to locales *)
wenzelm@15703
    37
  type element
wenzelm@15703
    38
  type element_i
wenzelm@12046
    39
  type locale
wenzelm@12046
    40
  val intern: Sign.sg -> xstring -> string
wenzelm@12014
    41
  val cond_extern: Sign.sg -> string -> xstring
wenzelm@12502
    42
  val the_locale: theory -> string -> locale
wenzelm@15703
    43
  val intern_attrib_elem: theory ->
wenzelm@15703
    44
    ('typ, 'term, 'fact) elem -> ('typ, 'term, 'fact) elem
wenzelm@15703
    45
  val intern_attrib_elem_expr: theory ->
wenzelm@15703
    46
    ('typ, 'term, 'fact) elem elem_expr -> ('typ, 'term, 'fact) elem elem_expr
ballarin@15206
    47
ballarin@15596
    48
  (* Processing of locale statements *)
wenzelm@15703
    49
  val read_context_statement: xstring option -> element elem_expr list ->
wenzelm@12529
    50
    (string * (string list * string list)) list list -> context ->
ballarin@15206
    51
    string option * (cterm list * cterm list) * context * context * 
ballarin@15206
    52
      (term * (term list * term list)) list list
wenzelm@15703
    53
  val cert_context_statement: string option -> element_i elem_expr list ->
wenzelm@12529
    54
    (term * (term list * term list)) list list -> context ->
ballarin@15206
    55
    string option * (cterm list * cterm list) * context * context *
ballarin@15206
    56
      (term * (term list * term list)) list list
ballarin@15596
    57
ballarin@15596
    58
  (* Diagnostic functions *)
wenzelm@12758
    59
  val print_locales: theory -> unit
wenzelm@15703
    60
  val print_locale: theory -> expr -> element list -> unit
ballarin@15624
    61
  val print_global_registrations: string -> theory -> unit
wenzelm@15703
    62
  val print_local_registrations': string -> context -> unit
ballarin@15624
    63
  val print_local_registrations: string -> context -> unit
ballarin@15596
    64
ballarin@15696
    65
  (* Storing results *)
wenzelm@15703
    66
  val add_locale: bool -> bstring -> expr -> element list -> theory -> theory
wenzelm@15703
    67
  val add_locale_i: bool -> bstring -> expr -> element_i list -> theory -> theory
wenzelm@15703
    68
  val smart_note_thmss: string -> string option ->
wenzelm@12958
    69
    ((bstring * theory attribute list) * (thm list * theory attribute list) list) list ->
wenzelm@12958
    70
    theory -> theory * (bstring * thm list) list
wenzelm@15703
    71
  val note_thmss: string -> xstring ->
wenzelm@15703
    72
    ((bstring * Attrib.src list) * (thmref * Attrib.src list) list) list ->
wenzelm@12711
    73
    theory -> theory * (bstring * thm list) list
wenzelm@15703
    74
  val note_thmss_i: string -> string ->
wenzelm@15703
    75
    ((bstring * Attrib.src list) * (thm list * Attrib.src list) list) list ->
wenzelm@12711
    76
    theory -> theory * (bstring * thm list) list
wenzelm@15703
    77
  val add_thmss: string -> string -> ((string * thm list) * Attrib.src list) list ->
wenzelm@13375
    78
    theory * context -> (theory * context) * (string * thm list) list
ballarin@15596
    79
ballarin@15624
    80
  (* Locale interpretation *)
ballarin@14528
    81
  val instantiate: string -> string * context attribute list
ballarin@14528
    82
    -> thm list option -> context -> context
ballarin@15624
    83
  val prep_global_registration:
wenzelm@15703
    84
    string * Attrib.src list -> expr -> string option list -> theory ->
ballarin@15596
    85
    theory * ((string * term list) * term list) list * (theory -> theory)
ballarin@15624
    86
  val prep_local_registration:
wenzelm@15703
    87
    string * Attrib.src list -> expr -> string option list -> context ->
ballarin@15624
    88
    context * ((string * term list) * term list) list * (context -> context)
ballarin@15624
    89
  val add_global_witness:
ballarin@15596
    90
    string * term list -> thm -> theory -> theory
ballarin@15624
    91
  val add_local_witness:
ballarin@15624
    92
    string * term list -> thm -> context -> context
ballarin@15596
    93
ballarin@15624
    94
  (* Theory setup for locales *)
wenzelm@11896
    95
  val setup: (theory -> theory) list
wenzelm@11896
    96
end;
wenzelm@12839
    97
wenzelm@12289
    98
structure Locale: LOCALE =
wenzelm@11896
    99
struct
wenzelm@11896
   100
wenzelm@12273
   101
(** locale elements and expressions **)
wenzelm@11896
   102
wenzelm@12014
   103
type context = ProofContext.context;
wenzelm@11896
   104
wenzelm@15703
   105
datatype ('typ, 'term, 'fact) elem =
wenzelm@12058
   106
  Fixes of (string * 'typ option * mixfix option) list |
wenzelm@15703
   107
  Assumes of ((string * Attrib.src list) * ('term * ('term list * 'term list)) list) list |
wenzelm@15703
   108
  Defines of ((string * Attrib.src list) * ('term * 'term list)) list |
wenzelm@15703
   109
  Notes of ((string * Attrib.src list) * ('fact * Attrib.src list) list) list;
wenzelm@12273
   110
wenzelm@12273
   111
datatype expr =
wenzelm@12273
   112
  Locale of string |
wenzelm@12273
   113
  Rename of expr * string option list |
wenzelm@12273
   114
  Merge of expr list;
wenzelm@11896
   115
wenzelm@12273
   116
val empty = Merge [];
wenzelm@12273
   117
ballarin@15206
   118
datatype 'a elem_expr =
ballarin@15206
   119
  Elem of 'a | Expr of expr;
wenzelm@12273
   120
wenzelm@15703
   121
type element = (string, string, thmref) elem;
wenzelm@15703
   122
type element_i = (typ, term, thm list) elem;
wenzelm@12070
   123
wenzelm@12070
   124
type locale =
ballarin@15206
   125
 {predicate: cterm list * thm list,
ballarin@15206
   126
    (* CB: For old-style locales with "(open)" this entry is ([], []).
ballarin@15206
   127
       For new-style locales, which declare predicates, if the locale declares
ballarin@15206
   128
       no predicates, this is also ([], []).
ballarin@15206
   129
       If the locale declares predicates, the record field is
ballarin@15206
   130
       ([statement], axioms), where statement is the locale predicate applied
ballarin@15206
   131
       to the (assumed) locale parameters.  Axioms contains the projections
ballarin@15206
   132
       from the locale predicate to the normalised assumptions of the locale
ballarin@15206
   133
       (cf. [1], normalisation of locale expressions.)
ballarin@15206
   134
    *)
ballarin@15206
   135
  import: expr,                                       (*dynamic import*)
wenzelm@15703
   136
  elems: (element_i * stamp) list,                    (*static content*)
ballarin@15206
   137
  params: (string * typ option) list * string list}   (*all/local params*)
wenzelm@12063
   138
wenzelm@11896
   139
wenzelm@15703
   140
(* CB: an internal (Int) locale element was either imported or included,
wenzelm@15703
   141
   an external (Ext) element appears directly in the locale text. *)
wenzelm@15703
   142
wenzelm@15703
   143
datatype ('a, 'b) int_ext = Int of 'a | Ext of 'b;
wenzelm@15703
   144
wenzelm@15703
   145
wenzelm@15703
   146
wenzelm@11896
   147
(** theory data **)
wenzelm@11896
   148
ballarin@15596
   149
structure Termlisttab = TableFun(type key = term list
ballarin@15596
   150
  val ord = Library.list_ord Term.term_ord);
ballarin@15596
   151
ballarin@15624
   152
structure GlobalLocalesArgs =
wenzelm@11896
   153
struct
wenzelm@12014
   154
  val name = "Isar/locales";
ballarin@15596
   155
  type T = NameSpace.T * locale Symtab.table *
wenzelm@15703
   156
      ((string * Attrib.src list) * thm list) Termlisttab.table
ballarin@15596
   157
        Symtab.table;
ballarin@15596
   158
    (* 1st entry: locale namespace,
ballarin@15596
   159
       2nd entry: locales of the theory,
ballarin@15596
   160
       3rd entry: registrations: theorems instantiating locale assumptions,
ballarin@15596
   161
         with prefix and attributes, indexed by locale name and parameter
ballarin@15596
   162
         instantiation *)
wenzelm@11896
   163
ballarin@15596
   164
  val empty = (NameSpace.empty, Symtab.empty, Symtab.empty);
wenzelm@12063
   165
  val copy = I;
wenzelm@12118
   166
  val prep_ext = I;
wenzelm@12289
   167
ballarin@15596
   168
  fun join_locs ({predicate, import, elems, params}: locale,
ballarin@15596
   169
      {elems = elems', ...}: locale) =
ballarin@15596
   170
    SOME {predicate = predicate, import = import,
ballarin@15596
   171
      elems = gen_merge_lists eq_snd elems elems',
ballarin@15206
   172
      params = params};
ballarin@15596
   173
  (* joining of registrations: prefix and attributes of left theory,
ballarin@15596
   174
     thmsss are equal *)
ballarin@15596
   175
  fun join_regs (reg, _) = SOME reg;
ballarin@15596
   176
  fun merge ((space1, locs1, regs1), (space2, locs2, regs2)) =
ballarin@15596
   177
    (NameSpace.merge (space1, space2), Symtab.join join_locs (locs1, locs2),
ballarin@15596
   178
     Symtab.join (SOME o Termlisttab.join join_regs) (regs1, regs2));
wenzelm@12289
   179
ballarin@15596
   180
  fun print _ (space, locs, _) =
wenzelm@12273
   181
    Pretty.strs ("locales:" :: map (NameSpace.cond_extern space o #1) (Symtab.dest locs))
wenzelm@12014
   182
    |> Pretty.writeln;
wenzelm@11896
   183
end;
wenzelm@11896
   184
ballarin@15624
   185
structure GlobalLocalesData = TheoryDataFun(GlobalLocalesArgs);
ballarin@15624
   186
ballarin@15624
   187
(** context data **)
wenzelm@11896
   188
ballarin@15624
   189
structure LocalLocalesArgs =
ballarin@15624
   190
struct
ballarin@15624
   191
  val name = "Isar/locales";
wenzelm@15703
   192
  type T = ((string * Args.src list) * thm list) Termlisttab.table
ballarin@15624
   193
           Symtab.table;
ballarin@15624
   194
    (* registrations: theorems instantiating locale assumptions,
ballarin@15624
   195
         with prefix and attributes, indexed by locale name and parameter
ballarin@15624
   196
         instantiation *)
ballarin@15624
   197
  fun init _ = Symtab.empty;
ballarin@15624
   198
  fun print _ _ = ();
ballarin@15624
   199
end;
ballarin@15624
   200
ballarin@15624
   201
structure LocalLocalesData = ProofDataFun(LocalLocalesArgs);
wenzelm@12289
   202
wenzelm@12277
   203
wenzelm@12277
   204
(* access locales *)
wenzelm@12277
   205
ballarin@15624
   206
val print_locales = GlobalLocalesData.print;
ballarin@15624
   207
ballarin@15624
   208
val intern = NameSpace.intern o #1 o GlobalLocalesData.get_sg;
ballarin@15624
   209
val cond_extern = NameSpace.cond_extern o #1 o GlobalLocalesData.get_sg;
ballarin@15624
   210
wenzelm@12063
   211
fun declare_locale name =
ballarin@15624
   212
  GlobalLocalesData.map (fn (space, locs, regs) =>
ballarin@15596
   213
    (NameSpace.extend (space, [name]), locs, regs));
wenzelm@11896
   214
ballarin@15596
   215
fun put_locale name loc =
ballarin@15624
   216
  GlobalLocalesData.map (fn (space, locs, regs) =>
ballarin@15596
   217
    (space, Symtab.update ((name, loc), locs), regs));
ballarin@15596
   218
ballarin@15624
   219
fun get_locale thy name = Symtab.lookup (#2 (GlobalLocalesData.get thy), name);
wenzelm@11896
   220
wenzelm@12014
   221
fun the_locale thy name =
wenzelm@12014
   222
  (case get_locale thy name of
skalberg@15531
   223
    SOME loc => loc
skalberg@15531
   224
  | NONE => error ("Unknown locale " ^ quote name));
wenzelm@11896
   225
wenzelm@12046
   226
ballarin@15596
   227
(* access registrations *)
ballarin@15596
   228
ballarin@15696
   229
(* Ids of global registrations are varified,
ballarin@15696
   230
   Ids of local registrations are not.
ballarin@15696
   231
   Thms of registrations are never varified. *)
ballarin@15696
   232
ballarin@15624
   233
(* retrieve registration from theory or context *)
ballarin@15624
   234
ballarin@15696
   235
fun gen_get_registrations get thy_ctxt name =
ballarin@15696
   236
  case Symtab.lookup (get thy_ctxt, name) of
ballarin@15696
   237
      NONE => []
ballarin@15696
   238
    | SOME tab => Termlisttab.dest tab;
ballarin@15696
   239
ballarin@15696
   240
val get_global_registrations =
ballarin@15696
   241
     gen_get_registrations (#3 o GlobalLocalesData.get);
ballarin@15696
   242
val get_local_registrations =
ballarin@15696
   243
     gen_get_registrations LocalLocalesData.get;
ballarin@15696
   244
ballarin@15624
   245
fun gen_get_registration get thy_ctxt (name, ps) =
ballarin@15624
   246
  case Symtab.lookup (get thy_ctxt, name) of
ballarin@15624
   247
      NONE => NONE
ballarin@15624
   248
    | SOME tab => Termlisttab.lookup (tab, ps);
ballarin@15624
   249
ballarin@15624
   250
val get_global_registration =
ballarin@15624
   251
     gen_get_registration (#3 o GlobalLocalesData.get);
ballarin@15624
   252
val get_local_registration =
ballarin@15624
   253
     gen_get_registration LocalLocalesData.get;
ballarin@15596
   254
ballarin@15624
   255
val test_global_registration = isSome oo get_global_registration;
ballarin@15624
   256
val test_local_registration = isSome oo get_local_registration;
ballarin@15624
   257
fun smart_test_registration ctxt id =
ballarin@15624
   258
  let
ballarin@15624
   259
    val thy = ProofContext.theory_of ctxt;
ballarin@15624
   260
  in
ballarin@15624
   261
    test_global_registration thy id orelse test_local_registration ctxt id
ballarin@15624
   262
  end;
ballarin@15624
   263
ballarin@15624
   264
ballarin@15624
   265
(* add registration to theory or context, ignored if already present *)
ballarin@15624
   266
ballarin@15624
   267
fun gen_put_registration map (name, ps) attn =
ballarin@15624
   268
  map (fn regs =>
ballarin@15624
   269
      let
ballarin@15596
   270
        val tab = getOpt (Symtab.lookup (regs, name), Termlisttab.empty);
ballarin@15596
   271
      in
ballarin@15596
   272
        Symtab.update ((name, Termlisttab.update_new ((ps, (attn, [])), tab)),
ballarin@15596
   273
          regs)
ballarin@15624
   274
      end handle Termlisttab.DUP _ => regs);
ballarin@15624
   275
ballarin@15624
   276
val put_global_registration =
ballarin@15624
   277
     gen_put_registration (fn f =>
ballarin@15624
   278
       GlobalLocalesData.map (fn (space, locs, regs) =>
ballarin@15624
   279
         (space, locs, f regs)));
ballarin@15624
   280
val put_local_registration = gen_put_registration LocalLocalesData.map;
ballarin@15596
   281
ballarin@15696
   282
(* TODO: needed? *)
ballarin@15624
   283
fun smart_put_registration id attn ctxt =
ballarin@15624
   284
  (* ignore registration if already present in theory *)
ballarin@15624
   285
     let
ballarin@15624
   286
       val thy = ProofContext.theory_of ctxt;
ballarin@15624
   287
     in case get_global_registration thy id of
ballarin@15624
   288
          NONE => put_local_registration id attn ctxt
ballarin@15624
   289
        | SOME _ => ctxt
ballarin@15624
   290
     end;
ballarin@15624
   291
ballarin@15624
   292
ballarin@15624
   293
(* add witness theorem to registration in theory or context,
ballarin@15596
   294
   ignored if registration not present *)
ballarin@15596
   295
ballarin@15624
   296
fun gen_add_witness map (name, ps) thm =
ballarin@15624
   297
  map (fn regs =>
ballarin@15624
   298
      let
ballarin@15596
   299
        val tab = valOf (Symtab.lookup (regs, name));
ballarin@15596
   300
        val (x, thms) = valOf (Termlisttab.lookup (tab, ps));
ballarin@15596
   301
      in
ballarin@15596
   302
        Symtab.update ((name, Termlisttab.update ((ps, (x, thm::thms)), tab)),
ballarin@15596
   303
          regs)
ballarin@15624
   304
      end handle Option => regs);
ballarin@15596
   305
ballarin@15624
   306
val add_global_witness =
ballarin@15624
   307
     gen_add_witness (fn f =>
ballarin@15624
   308
       GlobalLocalesData.map (fn (space, locs, regs) =>
ballarin@15624
   309
         (space, locs, f regs)));
ballarin@15624
   310
val add_local_witness = gen_add_witness LocalLocalesData.map;
ballarin@15596
   311
ballarin@15596
   312
ballarin@14215
   313
(* import hierarchy
ballarin@14215
   314
   implementation could be more efficient, eg. by maintaining a database
ballarin@14215
   315
   of dependencies *)
ballarin@14215
   316
ballarin@14215
   317
fun imports thy (upper, lower) =
ballarin@14215
   318
  let
ballarin@14215
   319
    val sign = sign_of thy;
ballarin@14215
   320
    fun imps (Locale name) low = (name = low) orelse
ballarin@14215
   321
      (case get_locale thy name of
skalberg@15531
   322
           NONE => false
skalberg@15531
   323
         | SOME {import, ...} => imps import low)
ballarin@14215
   324
      | imps (Rename (expr, _)) low = imps expr low
ballarin@14215
   325
      | imps (Merge es) low = exists (fn e => imps e low) es;
ballarin@14215
   326
  in
ballarin@14215
   327
    imps (Locale (intern sign upper)) (intern sign lower)
ballarin@14215
   328
  end;
ballarin@14215
   329
ballarin@14215
   330
ballarin@15624
   331
(* printing of registrations *)
ballarin@15596
   332
wenzelm@15703
   333
fun gen_print_registrations get_regs mk_ctxt msg loc thy_ctxt =
ballarin@15596
   334
  let
wenzelm@15703
   335
    val ctxt = mk_ctxt thy_ctxt;
wenzelm@15703
   336
    val thy = ProofContext.theory_of ctxt;
wenzelm@15703
   337
    val sg = Theory.sign_of thy;
wenzelm@15703
   338
wenzelm@15703
   339
    val prt_term = Pretty.quote o ProofContext.pretty_term ctxt;
wenzelm@15703
   340
    val prt_atts = Args.pretty_attribs ctxt;
wenzelm@15703
   341
    fun prt_inst (ts, (("", []), thms)) =
wenzelm@15703
   342
          Pretty.enclose "(" ")" (Pretty.breaks (map prt_term ts))
wenzelm@15703
   343
      | prt_inst (ts, ((prfx, atts), thms)) =
wenzelm@15703
   344
          Pretty.block (Pretty.breaks
wenzelm@15703
   345
            (Pretty.str prfx :: prt_atts atts @ [Pretty.str ":", Pretty.brk 1,
wenzelm@15703
   346
              Pretty.enclose "(" ")" (Pretty.breaks (map prt_term ts))]));
wenzelm@15703
   347
ballarin@15596
   348
    val loc_int = intern sg loc;
ballarin@15624
   349
    val regs = get_regs thy_ctxt;
ballarin@15596
   350
    val loc_regs = Symtab.lookup (regs, loc_int);
ballarin@15596
   351
  in
ballarin@15596
   352
    (case loc_regs of
ballarin@15624
   353
        NONE => Pretty.str ("No interpretations in " ^ msg ^ ".")
ballarin@15624
   354
      | SOME r => Pretty.big_list ("Interpretations in " ^ msg ^ ":")
ballarin@15596
   355
          (map prt_inst (Termlisttab.dest r)))
ballarin@15596
   356
    |> Pretty.writeln
ballarin@15596
   357
  end;
ballarin@15596
   358
ballarin@15624
   359
val print_global_registrations =
ballarin@15624
   360
     gen_print_registrations (#3 o GlobalLocalesData.get)
wenzelm@15703
   361
       ProofContext.init "theory";
ballarin@15624
   362
val print_local_registrations' =
ballarin@15624
   363
     gen_print_registrations LocalLocalesData.get
wenzelm@15703
   364
       I "context";
ballarin@15624
   365
fun print_local_registrations loc ctxt =
ballarin@15624
   366
  (print_global_registrations loc (ProofContext.theory_of ctxt);
ballarin@15624
   367
   print_local_registrations' loc ctxt);
ballarin@15624
   368
ballarin@15596
   369
wenzelm@12277
   370
(* diagnostics *)
wenzelm@12273
   371
wenzelm@12277
   372
fun err_in_locale ctxt msg ids =
wenzelm@12277
   373
  let
wenzelm@12529
   374
    val sign = ProofContext.sign_of ctxt;
wenzelm@12529
   375
    fun prt_id (name, parms) =
wenzelm@12529
   376
      [Pretty.block (Pretty.breaks (map Pretty.str (cond_extern sign name :: parms)))];
skalberg@15570
   377
    val prt_ids = List.concat (separate [Pretty.str " +", Pretty.brk 1] (map prt_id ids));
wenzelm@12502
   378
    val err_msg =
wenzelm@12529
   379
      if forall (equal "" o #1) ids then msg
wenzelm@12502
   380
      else msg ^ "\n" ^ Pretty.string_of (Pretty.block
wenzelm@12502
   381
        (Pretty.str "The error(s) above occurred in locale:" :: Pretty.brk 1 :: prt_ids));
wenzelm@12502
   382
  in raise ProofContext.CONTEXT (err_msg, ctxt) end;
wenzelm@12063
   383
ballarin@15206
   384
(* Version for identifiers with axioms *)
ballarin@15206
   385
ballarin@15206
   386
fun err_in_locale' ctxt msg ids' = err_in_locale ctxt msg (map fst ids');
wenzelm@12277
   387
wenzelm@12277
   388
wenzelm@12529
   389
(** primitives **)
wenzelm@12046
   390
wenzelm@15703
   391
(* map elements *)
wenzelm@15703
   392
wenzelm@15703
   393
fun map_elem {name, var, typ, term, fact, attrib} =
wenzelm@15703
   394
  fn Fixes fixes => Fixes (fixes |> map (fn (x, T, mx) =>
wenzelm@15703
   395
       let val (x', mx') = var (x, mx) in (x', Option.map typ T, mx') end))
wenzelm@15703
   396
   | Assumes asms => Assumes (asms |> map (fn ((a, atts), propps) =>
wenzelm@15703
   397
      ((name a, map attrib atts), propps |> map (fn (t, (ps, qs)) =>
wenzelm@15703
   398
        (term t, (map term ps, map term qs))))))
wenzelm@15703
   399
   | Defines defs => Defines (defs |> map (fn ((a, atts), (t, ps)) =>
wenzelm@15703
   400
      ((name a, map attrib atts), (term t, map term ps))))
wenzelm@15703
   401
   | Notes facts => Notes (facts |> map (fn ((a, atts), bs) =>
wenzelm@15703
   402
      ((name a, map attrib atts), bs |> map (fn (ths, btts) => (fact ths, map attrib btts)))));
wenzelm@15703
   403
wenzelm@15703
   404
fun map_values typ term thm = map_elem
wenzelm@15703
   405
  {name = I, var = I, typ = typ, term = term, fact = map thm,
wenzelm@15703
   406
    attrib = Args.map_values I typ term thm};
wenzelm@15703
   407
wenzelm@15703
   408
wenzelm@15703
   409
(* map attributes *)
wenzelm@15703
   410
wenzelm@15703
   411
fun map_attrib_specs f = map (apfst (apsnd (map f)));
wenzelm@15703
   412
fun map_attrib_facts f = map (apfst (apsnd (map f)) o apsnd (map (apsnd (map f))));
wenzelm@15703
   413
wenzelm@15703
   414
fun map_attrib_elem f = map_elem {name = I, var = I, typ = I, term = I, fact = I, attrib = f};
wenzelm@15703
   415
wenzelm@15703
   416
fun intern_attrib_elem thy = map_attrib_elem (Attrib.intern_src (Theory.sign_of thy));
wenzelm@15703
   417
wenzelm@15703
   418
fun intern_attrib_elem_expr thy (Elem elem) = Elem (intern_attrib_elem thy elem)
wenzelm@15703
   419
  | intern_attrib_elem_expr _ (Expr expr) = Expr expr;
wenzelm@15703
   420
wenzelm@15703
   421
wenzelm@12277
   422
(* renaming *)
wenzelm@12263
   423
skalberg@15570
   424
fun rename ren x = getOpt (assoc_string (ren, x), x);
wenzelm@12263
   425
wenzelm@15703
   426
fun rename_var ren (x, mx) =
wenzelm@15703
   427
  let val x' = rename ren x in
wenzelm@15703
   428
    if x = x' then (x, mx)
wenzelm@15703
   429
    else (x', if mx = NONE then mx else SOME Syntax.NoSyn)    (*drop syntax*)
wenzelm@15703
   430
  end;
wenzelm@15703
   431
wenzelm@12263
   432
fun rename_term ren (Free (x, T)) = Free (rename ren x, T)
wenzelm@12263
   433
  | rename_term ren (t $ u) = rename_term ren t $ rename_term ren u
wenzelm@12263
   434
  | rename_term ren (Abs (x, T, t)) = Abs (x, T, rename_term ren t)
wenzelm@12263
   435
  | rename_term _ a = a;
wenzelm@12263
   436
wenzelm@12263
   437
fun rename_thm ren th =
wenzelm@12263
   438
  let
wenzelm@12263
   439
    val {sign, hyps, prop, maxidx, ...} = Thm.rep_thm th;
wenzelm@12263
   440
    val cert = Thm.cterm_of sign;
skalberg@15570
   441
    val (xs, Ts) = Library.split_list (Library.foldl Term.add_frees ([], prop :: hyps));
wenzelm@12263
   442
    val xs' = map (rename ren) xs;
wenzelm@12263
   443
    fun cert_frees names = map (cert o Free) (names ~~ Ts);
wenzelm@12263
   444
    fun cert_vars names = map (cert o Var o apfst (rpair (maxidx + 1))) (names ~~ Ts);
wenzelm@12263
   445
  in
wenzelm@12263
   446
    if xs = xs' then th
wenzelm@12263
   447
    else
wenzelm@12263
   448
      th
wenzelm@12263
   449
      |> Drule.implies_intr_list (map cert hyps)
wenzelm@12263
   450
      |> Drule.forall_intr_list (cert_frees xs)
wenzelm@12263
   451
      |> Drule.forall_elim_list (cert_vars xs)
wenzelm@12263
   452
      |> Thm.instantiate ([], cert_vars xs ~~ cert_frees xs')
wenzelm@12263
   453
      |> (fn th' => Drule.implies_elim_list th' (map (Thm.assume o cert o rename_term ren) hyps))
wenzelm@12263
   454
  end;
wenzelm@12263
   455
wenzelm@15703
   456
fun rename_elem ren =
wenzelm@15703
   457
  map_values I (rename_term ren) (rename_thm ren) o
wenzelm@15703
   458
  map_elem {name = I, typ = I, term = I, fact = I, attrib = I, var = rename_var ren};
wenzelm@12263
   459
wenzelm@12529
   460
fun rename_facts prfx elem =
wenzelm@12307
   461
  let
wenzelm@12323
   462
    fun qualify (arg as ((name, atts), x)) =
wenzelm@13394
   463
      if prfx = "" orelse name = "" then arg
wenzelm@13375
   464
      else ((NameSpace.pack [prfx, name], atts), x);
wenzelm@12307
   465
  in
wenzelm@12307
   466
    (case elem of
wenzelm@12307
   467
      Fixes fixes => Fixes fixes
wenzelm@12307
   468
    | Assumes asms => Assumes (map qualify asms)
wenzelm@12307
   469
    | Defines defs => Defines (map qualify defs)
wenzelm@12307
   470
    | Notes facts => Notes (map qualify facts))
wenzelm@12307
   471
  end;
wenzelm@12307
   472
wenzelm@12263
   473
wenzelm@12502
   474
(* type instantiation *)
wenzelm@12502
   475
wenzelm@12502
   476
fun inst_type [] T = T
skalberg@15570
   477
  | inst_type env T = Term.map_type_tfree (fn v => getOpt (assoc (env, v), TFree v)) T;
wenzelm@12502
   478
wenzelm@12502
   479
fun inst_term [] t = t
wenzelm@12502
   480
  | inst_term env t = Term.map_term_types (inst_type env) t;
wenzelm@12502
   481
wenzelm@13211
   482
fun inst_thm _ [] th = th
wenzelm@13211
   483
  | inst_thm ctxt env th =
wenzelm@12502
   484
      let
wenzelm@13211
   485
        val sign = ProofContext.sign_of ctxt;
wenzelm@12575
   486
        val cert = Thm.cterm_of sign;
wenzelm@12575
   487
        val certT = Thm.ctyp_of sign;
wenzelm@13211
   488
        val {hyps, prop, maxidx, ...} = Thm.rep_thm th;
skalberg@15574
   489
        val tfrees = foldr Term.add_term_tfree_names [] (prop :: hyps);
skalberg@15570
   490
        val env' = List.filter (fn ((a, _), _) => a mem_string tfrees) env;
wenzelm@12502
   491
      in
wenzelm@12502
   492
        if null env' then th
wenzelm@12502
   493
        else
wenzelm@12502
   494
          th
wenzelm@12502
   495
          |> Drule.implies_intr_list (map cert hyps)
wenzelm@12575
   496
          |> Drule.tvars_intr_list (map (#1 o #1) env')
wenzelm@12502
   497
          |> (fn (th', al) => th' |>
skalberg@15570
   498
            Thm.instantiate ((map (fn ((a, _), T) => (valOf (assoc (al, a)), certT T)) env'), []))
wenzelm@12502
   499
          |> (fn th'' => Drule.implies_elim_list th''
wenzelm@12502
   500
              (map (Thm.assume o cert o inst_term env') hyps))
wenzelm@12502
   501
      end;
wenzelm@12502
   502
wenzelm@15703
   503
fun inst_elem ctxt env =
wenzelm@15703
   504
  map_values (inst_type env) (inst_term env) (inst_thm ctxt env);
wenzelm@12502
   505
wenzelm@12502
   506
ballarin@15696
   507
(* term and type instantiation, variant using symbol tables *)
ballarin@15696
   508
ballarin@15696
   509
(* instantiate TFrees *)
ballarin@15696
   510
ballarin@15696
   511
fun tinst_tab_type tinst T = if Symtab.is_empty tinst
ballarin@15696
   512
      then T
ballarin@15696
   513
      else Term.map_type_tfree
ballarin@15696
   514
        (fn (v as (x, _)) => getOpt (Symtab.lookup (tinst, x), (TFree v))) T;
ballarin@15696
   515
ballarin@15696
   516
fun tinst_tab_term tinst t = if Symtab.is_empty tinst
ballarin@15696
   517
      then t
ballarin@15696
   518
      else Term.map_term_types (tinst_tab_type tinst) t;
ballarin@15696
   519
ballarin@15696
   520
fun tinst_tab_thm sg tinst thm = if Symtab.is_empty tinst
ballarin@15696
   521
      then thm
ballarin@15696
   522
      else let
ballarin@15696
   523
          val cert = Thm.cterm_of sg;
ballarin@15696
   524
          val certT = Thm.ctyp_of sg;
ballarin@15696
   525
          val {hyps, prop, ...} = Thm.rep_thm thm;
ballarin@15696
   526
          val tfrees = foldr Term.add_term_tfree_names [] (prop :: hyps);
ballarin@15696
   527
          val tinst' = Symtab.dest tinst |>
ballarin@15696
   528
                List.filter (fn (a, _) => a mem_string tfrees);
ballarin@15696
   529
        in
ballarin@15696
   530
          if null tinst' then thm
ballarin@15696
   531
          else thm |> Drule.implies_intr_list (map cert hyps)
ballarin@15696
   532
            |> Drule.tvars_intr_list (map #1 tinst')
ballarin@15696
   533
            |> (fn (th, al) => th |> Thm.instantiate
ballarin@15696
   534
                ((map (fn (a, T) => (valOf (assoc (al, a)), certT T)) tinst'),
ballarin@15696
   535
                  []))
ballarin@15696
   536
            |> (fn th => Drule.implies_elim_list th
ballarin@15696
   537
                 (map (Thm.assume o cert o tinst_tab_term tinst) hyps))
ballarin@15696
   538
        end;
ballarin@15696
   539
ballarin@15696
   540
fun tinst_tab_elem _ tinst (Fixes fixes) =
ballarin@15696
   541
      Fixes (map (fn (x, T, mx) => (x, Option.map (tinst_tab_type tinst) T, mx)) fixes)
ballarin@15696
   542
  | tinst_tab_elem _ tinst (Assumes asms) =
ballarin@15696
   543
      Assumes (map (apsnd (map (fn (t, (ps, qs)) =>
ballarin@15696
   544
        (tinst_tab_term tinst t,
ballarin@15696
   545
          (map (tinst_tab_term tinst) ps, map (tinst_tab_term tinst) qs))))) asms)
ballarin@15696
   546
  | tinst_tab_elem _ tinst (Defines defs) =
ballarin@15696
   547
      Defines (map (apsnd (fn (t, ps) =>
ballarin@15696
   548
        (tinst_tab_term tinst t, map (tinst_tab_term tinst) ps))) defs)
ballarin@15696
   549
  | tinst_tab_elem sg tinst (Notes facts) =
ballarin@15696
   550
      Notes (map (apsnd (map (apfst (map (tinst_tab_thm sg tinst))))) facts);
ballarin@15696
   551
ballarin@15696
   552
(* instantiate TFrees and Frees *)
ballarin@15696
   553
ballarin@15696
   554
fun inst_tab_term (inst, tinst) = if Symtab.is_empty inst
ballarin@15696
   555
      then tinst_tab_term tinst
ballarin@15696
   556
      else (* instantiate terms and types simultaneously *)
ballarin@15696
   557
        let
ballarin@15696
   558
          fun instf (Const (x, T)) = Const (x, tinst_tab_type tinst T)
ballarin@15696
   559
            | instf (Free (x, T)) = (case Symtab.lookup (inst, x) of
ballarin@15696
   560
                 NONE => Free (x, tinst_tab_type tinst T)
ballarin@15696
   561
               | SOME t => t)
ballarin@15696
   562
            | instf (Var (xi, T)) = Var (xi, tinst_tab_type tinst T)
ballarin@15696
   563
            | instf (b as Bound _) = b
ballarin@15696
   564
            | instf (Abs (x, T, t)) = Abs (x, tinst_tab_type tinst T, instf t)
ballarin@15696
   565
            | instf (s $ t) = instf s $ instf t
ballarin@15696
   566
        in instf end;
ballarin@15696
   567
ballarin@15696
   568
fun inst_tab_thm sg (inst, tinst) thm = if Symtab.is_empty inst
ballarin@15696
   569
      then tinst_tab_thm sg tinst thm
ballarin@15696
   570
      else let
ballarin@15696
   571
          val cert = Thm.cterm_of sg;
ballarin@15696
   572
          val certT = Thm.ctyp_of sg;
ballarin@15696
   573
          val {hyps, prop, ...} = Thm.rep_thm thm;
ballarin@15696
   574
          (* type instantiations *)
ballarin@15696
   575
          val tfrees = foldr Term.add_term_tfree_names [] (prop :: hyps);
ballarin@15696
   576
          val tinst' = Symtab.dest tinst |>
ballarin@15696
   577
                List.filter (fn (a, _) => a mem_string tfrees);
ballarin@15696
   578
          (* term instantiations;
ballarin@15696
   579
             note: lhss are type instantiated, because
ballarin@15696
   580
                   type insts will be done first*)
ballarin@15696
   581
          val frees = foldr Term.add_term_frees [] (prop :: hyps);
ballarin@15696
   582
          val inst' = Symtab.dest inst |>
ballarin@15696
   583
                List.mapPartial (fn (a, t) =>
ballarin@15696
   584
                  get_first (fn (Free (x, T)) => 
ballarin@15696
   585
                    if a = x then SOME (Free (x, tinst_tab_type tinst T), t)
ballarin@15696
   586
                    else NONE) frees);
ballarin@15696
   587
        in
ballarin@15696
   588
          if null tinst' andalso null inst' then tinst_tab_thm sg tinst thm
ballarin@15696
   589
          else thm |> Drule.implies_intr_list (map cert hyps)
ballarin@15696
   590
            |> Drule.tvars_intr_list (map #1 tinst')
ballarin@15696
   591
            |> (fn (th, al) => th |> Thm.instantiate
ballarin@15696
   592
                ((map (fn (a, T) => (valOf (assoc (al, a)), certT T)) tinst'),
ballarin@15696
   593
                  []))
ballarin@15696
   594
            |> Drule.forall_intr_list (map (cert o #1) inst')
ballarin@15696
   595
            |> Drule.forall_elim_list (map (cert o #2) inst') 
ballarin@15696
   596
            |> (fn th => Drule.implies_elim_list th
ballarin@15696
   597
                 (map (Thm.assume o cert o inst_tab_term (inst, tinst)) hyps))
ballarin@15696
   598
        end;
ballarin@15696
   599
ballarin@15696
   600
fun inst_tab_elem _ (_, tinst) (Fixes fixes) =
ballarin@15696
   601
      Fixes (map (fn (x, T, mx) => (x, Option.map (tinst_tab_type tinst) T, mx)) fixes)
ballarin@15696
   602
  | inst_tab_elem _ inst (Assumes asms) =
ballarin@15696
   603
      Assumes (map (apsnd (map (fn (t, (ps, qs)) =>
ballarin@15696
   604
        (inst_tab_term inst t,
ballarin@15696
   605
          (map (inst_tab_term inst) ps, map (inst_tab_term inst) qs))))) asms)
ballarin@15696
   606
  | inst_tab_elem _ inst (Defines defs) =
ballarin@15696
   607
      Defines (map (apsnd (fn (t, ps) =>
ballarin@15696
   608
        (inst_tab_term inst t, map (inst_tab_term inst) ps))) defs)
ballarin@15696
   609
  | inst_tab_elem sg inst (Notes facts) =
ballarin@15696
   610
      Notes (map (apsnd (map (apfst (map (inst_tab_thm sg inst))))) facts);
ballarin@15696
   611
ballarin@15696
   612
fun inst_tab_elems sign inst ((n, ps), elems) =
ballarin@15696
   613
      ((n, map (inst_tab_term inst) ps), map (inst_tab_elem sign inst) elems);
ballarin@15696
   614
wenzelm@12529
   615
wenzelm@12529
   616
(** structured contexts: rename + merge + implicit type instantiation **)
wenzelm@12529
   617
wenzelm@12529
   618
(* parameter types *)
wenzelm@12529
   619
ballarin@14508
   620
(* CB: frozen_tvars has the following type:
ballarin@14508
   621
  ProofContext.context -> Term.typ list -> (Term.indexname * Term.typ) list *)
ballarin@14508
   622
wenzelm@12529
   623
fun frozen_tvars ctxt Ts =
wenzelm@12529
   624
  let
skalberg@15570
   625
    val tvars = rev (Library.foldl Term.add_tvarsT ([], Ts));
wenzelm@12529
   626
    val tfrees = map TFree
wenzelm@14695
   627
      (Term.invent_names (ProofContext.used_types ctxt) "'a" (length tvars) ~~ map #2 tvars);
wenzelm@12529
   628
  in map #1 tvars ~~ tfrees end;
wenzelm@12529
   629
wenzelm@12529
   630
fun unify_frozen ctxt maxidx Ts Us =
wenzelm@12529
   631
  let
skalberg@15531
   632
    fun paramify (i, NONE) = (i, NONE)
skalberg@15531
   633
      | paramify (i, SOME T) = apsnd SOME (TypeInfer.paramify_dummies (i, T));
wenzelm@12529
   634
wenzelm@12529
   635
    val (maxidx', Ts') = foldl_map paramify (maxidx, Ts);
wenzelm@12727
   636
    val (maxidx'', Us') = foldl_map paramify (maxidx', Us);
ballarin@14215
   637
    val tsig = Sign.tsig_of (ProofContext.sign_of ctxt);
ballarin@14215
   638
skalberg@15531
   639
    fun unify (env, (SOME T, SOME U)) = (Type.unify tsig env (U, T)
ballarin@14215
   640
          handle Type.TUNIFY =>
ballarin@14215
   641
            raise TYPE ("unify_frozen: failed to unify types", [U, T], []))
ballarin@14215
   642
      | unify (env, _) = env;
skalberg@15570
   643
    val (unifier, _) = Library.foldl unify ((Vartab.empty, maxidx''), Ts' ~~ Us');
skalberg@15570
   644
    val Vs = map (Option.map (Envir.norm_type unifier)) Us';
skalberg@15570
   645
    val unifier' = Vartab.extend (unifier, frozen_tvars ctxt (List.mapPartial I Vs));
skalberg@15570
   646
  in map (Option.map (Envir.norm_type unifier')) Vs end;
wenzelm@12529
   647
skalberg@15570
   648
fun params_of elemss = gen_distinct eq_fst (List.concat (map (snd o fst) elemss));
skalberg@15570
   649
fun params_of' elemss = gen_distinct eq_fst (List.concat (map (snd o fst o fst) elemss));
ballarin@14508
   650
ballarin@14508
   651
(* CB: param_types has the following type:
skalberg@15531
   652
  ('a * 'b option) list -> ('a * 'b) list *)
skalberg@15570
   653
fun param_types ps = List.mapPartial (fn (_, NONE) => NONE | (x, SOME T) => SOME (x, T)) ps;
wenzelm@12529
   654
wenzelm@12529
   655
wenzelm@12529
   656
(* flatten expressions *)
wenzelm@11896
   657
wenzelm@12510
   658
local
wenzelm@12502
   659
ballarin@15206
   660
(* CB: OUTDATED unique_parms has the following type:
ballarin@14508
   661
     'a ->
ballarin@14508
   662
     (('b * (('c * 'd) list * Symtab.key list)) * 'e) list ->
ballarin@14508
   663
     (('b * ('c * 'd) list) * 'e) list  *)
ballarin@14508
   664
wenzelm@12529
   665
fun unique_parms ctxt elemss =
wenzelm@12529
   666
  let
wenzelm@12529
   667
    val param_decls =
skalberg@15570
   668
      List.concat (map (fn (((name, (ps, qs)), _), _) => map (rpair (name, ps)) qs) elemss)
wenzelm@12529
   669
      |> Symtab.make_multi |> Symtab.dest;
wenzelm@12529
   670
  in
wenzelm@12529
   671
    (case find_first (fn (_, ids) => length ids > 1) param_decls of
skalberg@15531
   672
      SOME (q, ids) => err_in_locale ctxt ("Multiple declaration of parameter " ^ quote q)
wenzelm@12529
   673
          (map (apsnd (map fst)) ids)
skalberg@15531
   674
    | NONE => map (apfst (apfst (apsnd #1))) elemss)
wenzelm@12529
   675
  end;
wenzelm@12529
   676
ballarin@14508
   677
(* CB: unify_parms has the following type:
ballarin@14508
   678
     ProofContext.context ->
ballarin@14508
   679
     (string * Term.typ) list ->
skalberg@15531
   680
     (string * Term.typ option) list list ->
ballarin@14508
   681
     ((string * Term.sort) * Term.typ) list list *)
ballarin@14508
   682
wenzelm@12529
   683
fun unify_parms ctxt fixed_parms raw_parmss =
wenzelm@12502
   684
  let
ballarin@15206
   685
    val sign = ProofContext.sign_of ctxt;
ballarin@15206
   686
    val tsig = Sign.tsig_of sign;
wenzelm@12502
   687
    val maxidx = length raw_parmss;
wenzelm@12502
   688
    val idx_parmss = (0 upto maxidx - 1) ~~ raw_parmss;
wenzelm@12502
   689
wenzelm@12502
   690
    fun varify i = Term.map_type_tfree (fn (a, S) => TVar ((a, i), S));
wenzelm@12529
   691
    fun varify_parms (i, ps) = map (apsnd (varify i)) (param_types ps);
skalberg@15570
   692
    val parms = fixed_parms @ List.concat (map varify_parms idx_parmss);
wenzelm@12502
   693
ballarin@15206
   694
    fun unify T ((env, maxidx), U) =
ballarin@15206
   695
      Type.unify tsig (env, maxidx) (U, T)
ballarin@15206
   696
      handle Type.TUNIFY =>
ballarin@15206
   697
        let val prt = Sign.string_of_typ sign
ballarin@15206
   698
        in raise TYPE ("unify_parms: failed to unify types " ^
ballarin@15206
   699
          prt U ^ " and " ^ prt T, [U, T], [])
ballarin@15206
   700
        end
skalberg@15570
   701
    fun unify_list (envir, T :: Us) = Library.foldl (unify T) (envir, Us)
wenzelm@12502
   702
      | unify_list (envir, []) = envir;
skalberg@15570
   703
    val (unifier, _) = Library.foldl unify_list
wenzelm@12502
   704
      ((Vartab.empty, maxidx), map #2 (Symtab.dest (Symtab.make_multi parms)));
wenzelm@12502
   705
wenzelm@12502
   706
    val parms' = map (apsnd (Envir.norm_type unifier)) (gen_distinct eq_fst parms);
wenzelm@12502
   707
    val unifier' = Vartab.extend (unifier, frozen_tvars ctxt (map #2 parms'));
wenzelm@12502
   708
wenzelm@12502
   709
    fun inst_parms (i, ps) =
skalberg@15574
   710
      foldr Term.add_typ_tfrees [] (List.mapPartial snd ps)
skalberg@15570
   711
      |> List.mapPartial (fn (a, S) =>
wenzelm@12502
   712
          let val T = Envir.norm_type unifier' (TVar ((a, i), S))
skalberg@15531
   713
          in if T = TFree (a, S) then NONE else SOME ((a, S), T) end)
wenzelm@12502
   714
  in map inst_parms idx_parmss end;
wenzelm@12502
   715
wenzelm@12529
   716
in
wenzelm@12502
   717
ballarin@15206
   718
(* like unify_elemss, but does not touch axioms *)
ballarin@15206
   719
ballarin@15206
   720
fun unify_elemss' _ _ [] = []
ballarin@15206
   721
  | unify_elemss' _ [] [elems] = [elems]
ballarin@15206
   722
  | unify_elemss' ctxt fixed_parms elemss =
ballarin@15206
   723
      let
ballarin@15206
   724
        val envs = unify_parms ctxt fixed_parms (map (#2 o #1 o #1) elemss);
ballarin@15206
   725
        fun inst ((((name, ps), axs), elems), env) =
skalberg@15570
   726
          (((name, map (apsnd (Option.map (inst_type env))) ps),  axs),
ballarin@15206
   727
           map (inst_elem ctxt env) elems);
ballarin@15206
   728
      in map inst (elemss ~~ envs) end;
ballarin@15206
   729
wenzelm@12529
   730
fun unify_elemss _ _ [] = []
wenzelm@12529
   731
  | unify_elemss _ [] [elems] = [elems]
wenzelm@12529
   732
  | unify_elemss ctxt fixed_parms elemss =
wenzelm@12502
   733
      let
ballarin@15206
   734
        val envs = unify_parms ctxt fixed_parms (map (#2 o #1 o #1) elemss);
ballarin@15206
   735
        fun inst ((((name, ps), axs), elems), env) =
skalberg@15570
   736
          (((name, map (apsnd (Option.map (inst_type env))) ps), 
ballarin@15206
   737
            map (inst_thm ctxt env) axs), map (inst_elem ctxt env) elems);
wenzelm@12839
   738
      in map inst (elemss ~~ envs) end;
wenzelm@12502
   739
ballarin@15596
   740
(* flatten_expr:
ballarin@15596
   741
   Extend list of identifiers by those new in locale expression expr.
ballarin@15596
   742
   Compute corresponding list of lists of locale elements (one entry per
ballarin@15596
   743
   identifier).
ballarin@15596
   744
ballarin@15596
   745
   Identifiers represent locale fragments and are in an extended form:
ballarin@15596
   746
     ((name, ps), (ax_ps, axs))
ballarin@15596
   747
   (name, ps) is the locale name with all its parameters.
ballarin@15596
   748
   (ax_ps, axs) is the locale axioms with its parameters;
ballarin@15596
   749
     axs are always taken from the top level of the locale hierarchy,
ballarin@15596
   750
     hence axioms may contain additional parameters from later fragments:
ballarin@15596
   751
     ps subset of ax_ps.  axs is either singleton or empty.
ballarin@15596
   752
ballarin@15596
   753
   Elements are enriched by identifier-like information:
ballarin@15596
   754
     (((name, ax_ps), axs), elems)
ballarin@15596
   755
   The parameters in ax_ps are the axiom parameters, but enriched by type
ballarin@15596
   756
   info: now each entry is a pair of string and typ option.  Axioms are
ballarin@15596
   757
   type-instantiated.
ballarin@15596
   758
ballarin@15596
   759
*)
ballarin@15596
   760
wenzelm@12575
   761
fun flatten_expr ctxt (prev_idents, expr) =
wenzelm@12014
   762
  let
wenzelm@12014
   763
    val thy = ProofContext.theory_of ctxt;
ballarin@15596
   764
    (* thy used for retrieval of locale info,
ballarin@15596
   765
       ctxt for error messages, parameter unification and instantiation
ballarin@15596
   766
       of axioms *)
ballarin@15596
   767
    (* TODO: consider err_in_locale with thy argument *)
wenzelm@12263
   768
skalberg@15531
   769
    fun renaming (SOME x :: xs) (y :: ys) = (y, x) :: renaming xs ys
skalberg@15531
   770
      | renaming (NONE :: xs) (y :: ys) = renaming xs ys
wenzelm@12273
   771
      | renaming [] _ = []
wenzelm@12289
   772
      | renaming xs [] = raise ERROR_MESSAGE ("Too many arguments in renaming: " ^
skalberg@15531
   773
          commas (map (fn NONE => "_" | SOME x => quote x) xs));
wenzelm@12289
   774
ballarin@15206
   775
    fun rename_parms top ren ((name, ps), (parms, axs)) =
wenzelm@12289
   776
      let val ps' = map (rename ren) ps in
ballarin@15206
   777
        (case duplicates ps' of [] => ((name, ps'),
ballarin@15206
   778
          if top then (map (rename ren) parms, map (rename_thm ren) axs)
ballarin@15206
   779
          else (parms, axs))
wenzelm@12289
   780
        | dups => err_in_locale ctxt ("Duplicate parameters: " ^ commas_quote dups) [(name, ps')])
wenzelm@12289
   781
      end;
wenzelm@12263
   782
ballarin@15206
   783
    fun identify top (Locale name) =
ballarin@15596
   784
    (* CB: ids_ax is a list of tuples of the form ((name, ps), axs),
ballarin@15206
   785
       where name is a locale name, ps a list of parameter names and axs
ballarin@15206
   786
       a list of axioms relating to the identifier, axs is empty unless
ballarin@15206
   787
       identify at top level (top = true);
ballarin@14215
   788
       parms is accumulated list of parameters *)
wenzelm@12289
   789
          let
ballarin@15206
   790
            val {predicate = (_, axioms), import, params, ...} =
ballarin@15206
   791
              the_locale thy name;
wenzelm@12289
   792
            val ps = map #1 (#1 params);
ballarin@15206
   793
            val (ids', parms') = identify false import;
ballarin@15206
   794
                (* acyclic import dependencies *)
ballarin@15206
   795
            val ids'' = ids' @ [((name, ps), ([], []))];
ballarin@15206
   796
            val ids_ax = if top then snd
ballarin@15206
   797
                 (foldl_map (fn (axs, ((name, parms), _)) => let
ballarin@15206
   798
                   val {elems, ...} = the_locale thy name;
skalberg@15570
   799
                   val ts = List.concat (List.mapPartial (fn (Assumes asms, _) =>
skalberg@15570
   800
                     SOME (List.concat (map (map #1 o #2) asms)) | _ => NONE) elems);
ballarin@15206
   801
                   val (axs1, axs2) = splitAt (length ts, axs);
ballarin@15206
   802
                 in (axs2, ((name, parms), (ps, axs1))) end) (axioms, ids''))
ballarin@15206
   803
               else ids'';
ballarin@15206
   804
          in (ids_ax, merge_lists parms' ps) end
ballarin@15206
   805
      | identify top (Rename (e, xs)) =
wenzelm@12273
   806
          let
ballarin@15206
   807
            val (ids', parms') = identify top e;
wenzelm@12839
   808
            val ren = renaming xs parms'
ballarin@15206
   809
              handle ERROR_MESSAGE msg => err_in_locale' ctxt msg ids';
ballarin@15206
   810
            val ids'' = gen_distinct eq_fst (map (rename_parms top ren) ids');
skalberg@15570
   811
            val parms'' = distinct (List.concat (map (#2 o #1) ids''));
ballarin@15206
   812
          in (ids'', parms'') end
ballarin@15206
   813
      | identify top (Merge es) =
skalberg@15570
   814
          Library.foldl (fn ((ids, parms), e) => let
ballarin@15206
   815
                     val (ids', parms') = identify top e
ballarin@15206
   816
                   in (gen_merge_lists eq_fst ids ids',
ballarin@15206
   817
                       merge_lists parms parms') end)
ballarin@15206
   818
            (([], []), es);
wenzelm@12014
   819
ballarin@15206
   820
    (* CB: enrich identifiers by parameter types and 
ballarin@15206
   821
       the corresponding elements (with renamed parameters) *)
ballarin@15206
   822
ballarin@15206
   823
    fun eval ((name, xs), axs) =
wenzelm@12273
   824
      let
wenzelm@13308
   825
        val {params = (ps, qs), elems, ...} = the_locale thy name;
wenzelm@12307
   826
        val ren = filter_out (op =) (map #1 ps ~~ xs);
wenzelm@13308
   827
        val (params', elems') =
wenzelm@13308
   828
          if null ren then ((ps, qs), map #1 elems)
wenzelm@12502
   829
          else ((map (apfst (rename ren)) ps, map (rename ren) qs),
wenzelm@13308
   830
            map (rename_elem ren o #1) elems);
wenzelm@13375
   831
        val elems'' = map (rename_facts (space_implode "_" xs)) elems';
ballarin@15206
   832
      in (((name, params'), axs), elems'') end;
wenzelm@12307
   833
ballarin@15206
   834
    (* compute identifiers, merge with previous ones *)
ballarin@15206
   835
    val idents = gen_rems eq_fst (#1 (identify true expr), prev_idents);
ballarin@15206
   836
    (* add types to params, check for unique params and unify them *)
wenzelm@12575
   837
    val raw_elemss = unique_parms ctxt (map eval idents);
ballarin@15206
   838
    val elemss = unify_elemss' ctxt [] raw_elemss;
ballarin@15206
   839
    (* replace params in ids by params from axioms,
ballarin@15206
   840
       adjust types in axioms *)
ballarin@15206
   841
    val all_params' = params_of' elemss;
ballarin@15206
   842
    val all_params = param_types all_params';
ballarin@15206
   843
    val elemss' = map (fn (((name, _), (ps, axs)), elems) =>
ballarin@15206
   844
         (((name, map (fn p => (p, assoc (all_params, p))) ps), axs), elems))
ballarin@15206
   845
         elemss;
ballarin@15206
   846
    fun inst_ax th = let
ballarin@15206
   847
         val {hyps, prop, ...} = Thm.rep_thm th;
skalberg@15570
   848
         val ps = map (apsnd SOME) (Library.foldl Term.add_frees ([], prop :: hyps));
ballarin@15206
   849
         val [env] = unify_parms ctxt all_params [ps];
ballarin@15206
   850
         val th' = inst_thm ctxt env th;
ballarin@15206
   851
       in th' end;
ballarin@15206
   852
    val final_elemss = map (fn ((id, axs), elems) =>
ballarin@15206
   853
         ((id, map inst_ax axs), elems)) elemss';
ballarin@15206
   854
  in (prev_idents @ idents, final_elemss) end;
wenzelm@12046
   855
wenzelm@12510
   856
end;
wenzelm@12510
   857
wenzelm@12070
   858
wenzelm@12529
   859
(* activate elements *)
wenzelm@12273
   860
wenzelm@12510
   861
local
wenzelm@12510
   862
wenzelm@13399
   863
fun export_axioms axs _ hyps th =
wenzelm@13399
   864
  th |> Drule.satisfy_hyps axs
ballarin@15206
   865
     (* CB: replace meta-hyps, using axs, by a single meta-hyp. *)
wenzelm@13399
   866
  |> Drule.implies_intr_list (Library.drop (length axs, hyps))
ballarin@15206
   867
     (* CB: turn remaining hyps into assumptions. *)
ballarin@15206
   868
  |> Seq.single
wenzelm@12263
   869
wenzelm@14643
   870
fun activate_elem _ ((ctxt, axs), Fixes fixes) =
wenzelm@14643
   871
      ((ctxt |> ProofContext.add_fixes fixes, axs), [])
wenzelm@13399
   872
  | activate_elem _ ((ctxt, axs), Assumes asms) =
wenzelm@13399
   873
      let
wenzelm@15703
   874
        val asms' = map_attrib_specs (Attrib.context_attribute_i ctxt) asms;
wenzelm@15703
   875
        val ts = List.concat (map (map #1 o #2) asms');
wenzelm@15703
   876
        val (ps, qs) = splitAt (length ts, axs);
wenzelm@13420
   877
        val (ctxt', _) =
wenzelm@13399
   878
          ctxt |> ProofContext.fix_frees ts
wenzelm@15703
   879
          |> ProofContext.assume_i (export_axioms ps) asms';
nipkow@13629
   880
      in ((ctxt', qs), []) end
wenzelm@13399
   881
  | activate_elem _ ((ctxt, axs), Defines defs) =
ballarin@15596
   882
      let
wenzelm@15703
   883
        val defs' = map_attrib_specs (Attrib.context_attribute_i ctxt) defs;
ballarin@15596
   884
        val (ctxt', _) =
wenzelm@13399
   885
        ctxt |> ProofContext.assume_i ProofContext.export_def
wenzelm@15703
   886
          (defs' |> map (fn ((name, atts), (t, ps)) =>
wenzelm@13399
   887
            let val (c, t') = ProofContext.cert_def ctxt t
wenzelm@13399
   888
            in ((if name = "" then Thm.def_name c else name, atts), [(t', (ps, []))]) end))
wenzelm@13420
   889
      in ((ctxt', axs), []) end
wenzelm@13399
   890
  | activate_elem is_ext ((ctxt, axs), Notes facts) =
ballarin@15596
   891
      let
wenzelm@15703
   892
        val facts' = map_attrib_facts (Attrib.context_attribute_i ctxt) facts;
wenzelm@15703
   893
        val (ctxt', res) = ctxt |> ProofContext.note_thmss_i facts';
wenzelm@13420
   894
      in ((ctxt', axs), if is_ext then res else []) end;
wenzelm@12502
   895
ballarin@15206
   896
fun activate_elems (((name, ps), axs), elems) ctxt =
ballarin@15206
   897
  let val ((ctxt', _), res) =
wenzelm@13399
   898
    foldl_map (activate_elem (name = "")) ((ProofContext.qualified true ctxt, axs), elems)
wenzelm@13399
   899
      handle ProofContext.CONTEXT (msg, ctxt) => err_in_locale ctxt msg [(name, map fst ps)]
ballarin@15696
   900
    val ctxt'' = if name = "" then ctxt'
ballarin@15696
   901
          else let
ballarin@15696
   902
              val ps' = map (fn (n, SOME T) => Free (n, T)) ps;
ballarin@15696
   903
              val ctxt'' = put_local_registration (name, ps') ("", []) ctxt'
ballarin@15696
   904
            in foldl (fn (ax, ctxt) =>
ballarin@15696
   905
              add_local_witness (name, ps') (Thm.assume (Thm.cprop_of ax)) ctxt) ctxt'' axs
ballarin@15696
   906
            end
ballarin@15696
   907
  in (ProofContext.restore_qualified ctxt ctxt'', res) end;
wenzelm@13399
   908
ballarin@15206
   909
fun activate_elemss prep_facts = foldl_map (fn (ctxt, (((name, ps), axs), raw_elems)) =>
wenzelm@12834
   910
  let
wenzelm@12834
   911
    val elems = map (prep_facts ctxt) raw_elems;
skalberg@15570
   912
    val (ctxt', res) = apsnd List.concat (activate_elems (((name, ps), axs), elems) ctxt);
wenzelm@15703
   913
    val elems' = map (map_attrib_elem Args.closure) elems;
wenzelm@15703
   914
  in (ctxt', (((name, ps), elems'), res)) end);
wenzelm@12834
   915
wenzelm@12546
   916
in
wenzelm@12546
   917
ballarin@15206
   918
(* CB: activate_facts prep_facts (ctxt, elemss),
ballarin@15206
   919
   where elemss is a list of pairs consisting of identifiers and
ballarin@15206
   920
   context elements, extends ctxt by the context elements yielding
ballarin@15206
   921
   ctxt' and returns (ctxt', (elemss', facts)).
ballarin@15206
   922
   Identifiers in the argument are of the form ((name, ps), axs) and
ballarin@15206
   923
   assumptions use the axioms in the identifiers to set up exporters
ballarin@15206
   924
   in ctxt'.  elemss' does not contain identifiers and is obtained
ballarin@15206
   925
   from elemss and the intermediate context with prep_facts.
wenzelm@15703
   926
   If read_facts or cert_facts is used for prep_facts, these also remove
ballarin@14508
   927
   the internal/external markers from elemss. *)
ballarin@14508
   928
wenzelm@13399
   929
fun activate_facts prep_facts arg =
skalberg@15570
   930
  apsnd (apsnd List.concat o Library.split_list) (activate_elemss prep_facts arg);
wenzelm@12546
   931
wenzelm@15703
   932
fun activate_note prep_facts (ctxt, args) =
wenzelm@15703
   933
  let
wenzelm@15703
   934
    val (ctxt', ([(_, [Notes args'])], facts)) =
wenzelm@15703
   935
      activate_facts prep_facts (ctxt, [((("", []), []), [Ext (Notes args)])]);
wenzelm@15703
   936
  in (ctxt', (args', facts)) end;
wenzelm@15703
   937
wenzelm@12510
   938
end;
wenzelm@12510
   939
wenzelm@12307
   940
ballarin@15696
   941
(* register elements *)
ballarin@15696
   942
ballarin@15696
   943
fun register_elems (((_, ps), (((name, ax_ps), axs), _)), ctxt) =
ballarin@15696
   944
  if name = "" then ctxt
ballarin@15696
   945
      else let val ps' = map (fn (n, SOME T) => Free (n, T)) ax_ps
ballarin@15696
   946
          val ctxt' = put_local_registration (name, ps') ("", []) ctxt
ballarin@15696
   947
        in foldl (fn (ax, ctxt) =>
ballarin@15696
   948
          add_local_witness (name, ps') ax ctxt) ctxt' axs
ballarin@15696
   949
        end;
ballarin@15696
   950
ballarin@15696
   951
fun register_elemss id_elemss ctxt = 
ballarin@15696
   952
  foldl register_elems ctxt id_elemss;
ballarin@15696
   953
ballarin@15696
   954
wenzelm@12529
   955
(** prepare context elements **)
wenzelm@12529
   956
wenzelm@12529
   957
(* expressions *)
wenzelm@12529
   958
wenzelm@12529
   959
fun intern_expr sg (Locale xname) = Locale (intern sg xname)
wenzelm@12529
   960
  | intern_expr sg (Merge exprs) = Merge (map (intern_expr sg) exprs)
wenzelm@12529
   961
  | intern_expr sg (Rename (expr, xs)) = Rename (intern_expr sg expr, xs);
wenzelm@12529
   962
wenzelm@12529
   963
wenzelm@12529
   964
(* parameters *)
wenzelm@12502
   965
wenzelm@12502
   966
local
wenzelm@12502
   967
wenzelm@12529
   968
fun prep_fixes prep_vars ctxt fixes =
wenzelm@12529
   969
  let val vars = snd (foldl_map prep_vars (ctxt, map (fn (x, T, _) => ([x], T)) fixes))
wenzelm@12529
   970
  in map (fn (([x'], T'), (_, _, mx)) => (x', T', mx)) (vars ~~ fixes) end;
wenzelm@12529
   971
wenzelm@12529
   972
in
wenzelm@12529
   973
wenzelm@12529
   974
fun read_fixes x = prep_fixes ProofContext.read_vars x;
wenzelm@12529
   975
fun cert_fixes x = prep_fixes ProofContext.cert_vars x;
wenzelm@12529
   976
wenzelm@12529
   977
end;
wenzelm@12529
   978
wenzelm@12529
   979
wenzelm@12529
   980
(* propositions and bindings *)
wenzelm@12529
   981
ballarin@15596
   982
(* flatten (ids, expr) normalises expr (which is either a locale
ballarin@14508
   983
   expression or a single context element) wrt.
ballarin@14508
   984
   to the list ids of already accumulated identifiers.
ballarin@14508
   985
   It returns (ids', elemss) where ids' is an extension of ids
ballarin@14508
   986
   with identifiers generated for expr, and elemss is the list of
ballarin@15596
   987
   context elements generated from expr.  For details, see flatten_expr.
ballarin@15596
   988
   Additionally, for a locale expression, the elems are grouped into a single
ballarin@15596
   989
   Int; individual context elements are marked Ext.  In this case, the
ballarin@15596
   990
   identifier-like information of the element is as follows:
ballarin@15596
   991
   - for Fixes: (("", ps), []) where the ps have type info NONE
ballarin@15596
   992
   - for other elements: (("", []), []).
ballarin@15206
   993
   The implementation of activate_facts relies on identifier names being
ballarin@15206
   994
   empty strings for external elements.
ballarin@15596
   995
*)
ballarin@14508
   996
ballarin@14508
   997
fun flatten _ (ids, Elem (Fixes fixes)) =
ballarin@15696
   998
      (ids @ [(("", map #1 fixes), ([], []))], [((("", map (rpair NONE o #1) fixes), []), Ext (Fixes fixes))])
ballarin@15696
   999
  | flatten _ (ids, Elem elem) = (ids @ [(("", []), ([], []))], [((("", []), []), Ext elem)])
ballarin@14508
  1000
  | flatten (ctxt, prep_expr) (ids, Expr expr) =
ballarin@14508
  1001
      apsnd (map (apsnd Int)) (flatten_expr ctxt (ids, prep_expr expr));
ballarin@14508
  1002
wenzelm@12529
  1003
local
wenzelm@12529
  1004
wenzelm@12839
  1005
local
wenzelm@12839
  1006
wenzelm@12727
  1007
fun declare_int_elem (ctxt, Fixes fixes) =
wenzelm@12575
  1008
      (ctxt |> ProofContext.add_fixes (map (fn (x, T, mx) =>
skalberg@15570
  1009
        (x, Option.map (Term.map_type_tfree (TypeInfer.param 0)) T, mx)) fixes), [])
wenzelm@12727
  1010
  | declare_int_elem (ctxt, _) = (ctxt, []);
wenzelm@12529
  1011
wenzelm@12529
  1012
fun declare_ext_elem prep_fixes (ctxt, Fixes fixes) =
wenzelm@12575
  1013
      (ctxt |> ProofContext.add_fixes (prep_fixes ctxt fixes), [])
wenzelm@12529
  1014
  | declare_ext_elem _ (ctxt, Assumes asms) = (ctxt, map #2 asms)
wenzelm@12529
  1015
  | declare_ext_elem _ (ctxt, Defines defs) = (ctxt, map (fn (_, (t, ps)) => [(t, (ps, []))]) defs)
wenzelm@12529
  1016
  | declare_ext_elem _ (ctxt, Notes facts) = (ctxt, []);
wenzelm@12529
  1017
ballarin@15206
  1018
fun declare_elems prep_fixes (ctxt, (((name, ps), _), elems)) =
wenzelm@12529
  1019
  let val (ctxt', propps) =
wenzelm@12529
  1020
    (case elems of
wenzelm@13308
  1021
      Int es => foldl_map declare_int_elem (ctxt, es)
wenzelm@12546
  1022
    | Ext e => foldl_map (declare_ext_elem prep_fixes) (ctxt, [e]))
wenzelm@12529
  1023
    handle ProofContext.CONTEXT (msg, ctxt) => err_in_locale ctxt msg [(name, map fst ps)]
wenzelm@12727
  1024
  in (ctxt', propps) end;
wenzelm@12727
  1025
wenzelm@12839
  1026
in
wenzelm@12839
  1027
ballarin@14215
  1028
(* CB: only called by prep_elemss. *)
ballarin@14215
  1029
wenzelm@12727
  1030
fun declare_elemss prep_fixes fixed_params raw_elemss ctxt =
wenzelm@12727
  1031
  let
ballarin@14215
  1032
    (* CB: fix of type bug of goal in target with context elements.
ballarin@14215
  1033
       Parameters new in context elements must receive types that are
ballarin@14215
  1034
       distinct from types of parameters in target (fixed_params).  *)
ballarin@14215
  1035
    val ctxt_with_fixed =
ballarin@14215
  1036
      ProofContext.declare_terms (map Free fixed_params) ctxt;
wenzelm@12727
  1037
    val int_elemss =
wenzelm@12727
  1038
      raw_elemss
skalberg@15570
  1039
      |> List.mapPartial (fn (id, Int es) => SOME (id, es) | _ => NONE)
ballarin@14215
  1040
      |> unify_elemss ctxt_with_fixed fixed_params;
wenzelm@12727
  1041
    val (_, raw_elemss') =
wenzelm@12727
  1042
      foldl_map (fn ((_, es) :: elemss, (id, Int _)) => (elemss, (id, Int es)) | x => x)
wenzelm@12727
  1043
        (int_elemss, raw_elemss);
wenzelm@12727
  1044
  in foldl_map (declare_elems prep_fixes) (ctxt, raw_elemss') end;
wenzelm@12529
  1045
wenzelm@12839
  1046
end;
wenzelm@12529
  1047
wenzelm@12839
  1048
local
wenzelm@12839
  1049
ballarin@15596
  1050
(* CB: normalise Assumes and Defines wrt. previous definitions *)
ballarin@14508
  1051
wenzelm@12839
  1052
val norm_term = Envir.beta_norm oo Term.subst_atomic;
wenzelm@12839
  1053
ballarin@15596
  1054
(* CB: following code (abstract_term, abstract_thm, bind_def)
ballarin@15596
  1055
   used in eval_text for Defines elements. *)
ballarin@15596
  1056
wenzelm@13336
  1057
fun abstract_term eq =    (*assumes well-formedness according to ProofContext.cert_def*)
wenzelm@12839
  1058
  let
wenzelm@12839
  1059
    val body = Term.strip_all_body eq;
wenzelm@12839
  1060
    val vars = map Free (Term.rename_wrt_term body (Term.strip_all_vars eq));
wenzelm@12839
  1061
    val (lhs, rhs) = Logic.dest_equals (Term.subst_bounds (vars, body));
wenzelm@12839
  1062
    val (f, xs) = Term.strip_comb lhs;
wenzelm@13336
  1063
    val eq' = Term.list_abs_free (map Term.dest_Free xs, rhs);
wenzelm@13336
  1064
  in (Term.dest_Free f, eq') end;
wenzelm@13336
  1065
wenzelm@13336
  1066
fun abstract_thm sign eq =
wenzelm@13336
  1067
  Thm.assume (Thm.cterm_of sign eq) |> Drule.gen_all |> Drule.abs_def;
wenzelm@12502
  1068
wenzelm@13336
  1069
fun bind_def ctxt (name, ps) ((xs, env, ths), eq) =
wenzelm@12839
  1070
  let
wenzelm@13336
  1071
    val ((y, T), b) = abstract_term eq;
wenzelm@13308
  1072
    val b' = norm_term env b;
wenzelm@13336
  1073
    val th = abstract_thm (ProofContext.sign_of ctxt) eq;
wenzelm@13308
  1074
    fun err msg = err_in_locale ctxt (msg ^ ": " ^ quote y) [(name, map fst ps)];
wenzelm@12839
  1075
  in
wenzelm@13308
  1076
    conditional (exists (equal y o #1) xs) (fn () =>
wenzelm@13308
  1077
      err "Attempt to define previously specified variable");
wenzelm@13308
  1078
    conditional (exists (fn (Free (y', _), _) => y = y' | _ => false) env) (fn () =>
wenzelm@13308
  1079
      err "Attempt to redefine variable");
wenzelm@13336
  1080
    (Term.add_frees (xs, b'), (Free (y, T), b') :: env, th :: ths)
wenzelm@12839
  1081
  end;
wenzelm@12575
  1082
ballarin@15206
  1083
(* CB: for finish_elems (Int and Ext) *)
ballarin@15206
  1084
wenzelm@13308
  1085
fun eval_text _ _ _ (text, Fixes _) = text
wenzelm@13394
  1086
  | eval_text _ _ is_ext ((((exts, exts'), (ints, ints')), (xs, env, defs)), Assumes asms) =
wenzelm@13394
  1087
      let
skalberg@15570
  1088
        val ts = List.concat (map (map #1 o #2) asms);
wenzelm@13394
  1089
        val ts' = map (norm_term env) ts;
wenzelm@13394
  1090
        val spec' =
wenzelm@13394
  1091
          if is_ext then ((exts @ ts, exts' @ ts'), (ints, ints'))
wenzelm@13394
  1092
          else ((exts, exts'), (ints @ ts, ints' @ ts'));
skalberg@15570
  1093
      in (spec', (Library.foldl Term.add_frees (xs, ts'), env, defs)) end
ballarin@15206
  1094
  | eval_text ctxt (id, _) _ ((spec, binds), Defines defs) =
skalberg@15570
  1095
      (spec, Library.foldl (bind_def ctxt id) (binds, map (#1 o #2) defs))
wenzelm@13308
  1096
  | eval_text _ _ _ (text, Notes _) = text;
wenzelm@13308
  1097
ballarin@15206
  1098
(* CB: for finish_elems (Ext) *)
ballarin@15206
  1099
wenzelm@13308
  1100
fun closeup _ false elem = elem
wenzelm@13308
  1101
  | closeup ctxt true elem =
wenzelm@12839
  1102
      let
wenzelm@13308
  1103
        fun close_frees t =
wenzelm@13308
  1104
          let val frees = rev (filter_out (ProofContext.is_fixed ctxt o #1)
wenzelm@13308
  1105
            (Term.add_frees ([], t)))
wenzelm@13308
  1106
          in Term.list_all_free (frees, t) end;
wenzelm@13308
  1107
wenzelm@13308
  1108
        fun no_binds [] = []
wenzelm@13308
  1109
          | no_binds _ =
wenzelm@13308
  1110
              raise ProofContext.CONTEXT ("Illegal term bindings in locale element", ctxt);
wenzelm@13308
  1111
      in
wenzelm@13308
  1112
        (case elem of
wenzelm@13308
  1113
          Assumes asms => Assumes (asms |> map (fn (a, propps) =>
wenzelm@13308
  1114
            (a, map (fn (t, (ps, qs)) => (close_frees t, (no_binds ps, no_binds qs))) propps)))
wenzelm@13308
  1115
        | Defines defs => Defines (defs |> map (fn (a, (t, ps)) =>
wenzelm@13308
  1116
            (a, (close_frees (#2 (ProofContext.cert_def ctxt t)), no_binds ps))))
wenzelm@13308
  1117
        | e => e)
wenzelm@13308
  1118
      end;
wenzelm@12839
  1119
wenzelm@12502
  1120
wenzelm@12839
  1121
fun finish_ext_elem parms _ (Fixes fixes, _) = Fixes (map (fn (x, _, mx) =>
wenzelm@12727
  1122
      (x, assoc_string (parms, x), mx)) fixes)
wenzelm@12839
  1123
  | finish_ext_elem _ close (Assumes asms, propp) =
wenzelm@12839
  1124
      close (Assumes (map #1 asms ~~ propp))
wenzelm@12839
  1125
  | finish_ext_elem _ close (Defines defs, propp) =
wenzelm@12727
  1126
      close (Defines (map #1 defs ~~ map (fn [(t, (ps, []))] => (t, ps)) propp))
wenzelm@12839
  1127
  | finish_ext_elem _ _ (Notes facts, _) = Notes facts;
wenzelm@12839
  1128
ballarin@15206
  1129
(* CB: finish_parms introduces type info from parms to identifiers *)
skalberg@15531
  1130
(* CB: only needed for types that have been NONE so far???
ballarin@15206
  1131
   If so, which are these??? *)
ballarin@15206
  1132
ballarin@15206
  1133
fun finish_parms parms (((name, ps), axs), elems) =
ballarin@15206
  1134
  (((name, map (fn (x, _) => (x, assoc (parms, x))) ps), axs), elems);
wenzelm@12839
  1135
wenzelm@13375
  1136
fun finish_elems ctxt parms _ (text, ((id, Int e), _)) =
wenzelm@12839
  1137
      let
ballarin@15206
  1138
        val [(id', es)] = unify_elemss ctxt parms [(id, e)];
skalberg@15570
  1139
        val text' = Library.foldl (eval_text ctxt id' false) (text, es);
ballarin@15206
  1140
      in (text', (id', map Int es)) end
wenzelm@13375
  1141
  | finish_elems ctxt parms do_close (text, ((id, Ext e), [propp])) =
wenzelm@13308
  1142
      let
wenzelm@13308
  1143
        val e' = finish_ext_elem parms (closeup ctxt do_close) (e, propp);
wenzelm@13375
  1144
        val text' = eval_text ctxt id true (text, e');
wenzelm@13308
  1145
      in (text', (id, [Ext e'])) end;
wenzelm@12839
  1146
wenzelm@12839
  1147
in
wenzelm@12510
  1148
ballarin@15206
  1149
(* CB: only called by prep_elemss *)
ballarin@15206
  1150
wenzelm@13375
  1151
fun finish_elemss ctxt parms do_close =
wenzelm@13375
  1152
  foldl_map (apsnd (finish_parms parms) o finish_elems ctxt parms do_close);
wenzelm@12839
  1153
wenzelm@12839
  1154
end;
wenzelm@12839
  1155
ballarin@15127
  1156
(* CB: type inference and consistency checks for locales *)
ballarin@15127
  1157
wenzelm@13375
  1158
fun prep_elemss prep_fixes prepp do_close context fixed_params raw_elemss raw_concl =
wenzelm@12529
  1159
  let
ballarin@15127
  1160
    (* CB: contexts computed in the course of this function are discarded.
ballarin@15127
  1161
       They are used for type inference and consistency checks only. *)
ballarin@15206
  1162
    (* CB: fixed_params are the parameters (with types) of the target locale,
ballarin@15206
  1163
       empty list if there is no target. *)
ballarin@14508
  1164
    (* CB: raw_elemss are list of pairs consisting of identifiers and
ballarin@14508
  1165
       context elements, the latter marked as internal or external. *)
wenzelm@12727
  1166
    val (raw_ctxt, raw_proppss) = declare_elemss prep_fixes fixed_params raw_elemss context;
ballarin@14508
  1167
    (* CB: raw_ctxt is context with additional fixed variables derived from
ballarin@14508
  1168
       the fixes elements in raw_elemss,
ballarin@14508
  1169
       raw_proppss contains assumptions and definitions from the
ballarin@15206
  1170
       external elements in raw_elemss. *)
skalberg@15570
  1171
    val raw_propps = map List.concat raw_proppss;
skalberg@15570
  1172
    val raw_propp = List.concat raw_propps;
ballarin@15206
  1173
ballarin@15206
  1174
    (* CB: add type information from fixed_params to context (declare_terms) *)
ballarin@15206
  1175
    (* CB: process patterns (conclusion and external elements only) *)
wenzelm@12529
  1176
    val (ctxt, all_propp) =
wenzelm@12529
  1177
      prepp (ProofContext.declare_terms (map Free fixed_params) raw_ctxt, raw_concl @ raw_propp);
ballarin@15206
  1178
    (* CB: add type information from conclusion and external elements
ballarin@15206
  1179
       to context *)
skalberg@15570
  1180
    val ctxt = ProofContext.declare_terms (List.concat (map (map fst) all_propp)) ctxt;
wenzelm@12502
  1181
ballarin@15206
  1182
    (* CB: resolve schematic variables (patterns) in conclusion and external
ballarin@15206
  1183
       elements. *)
wenzelm@12529
  1184
    val all_propp' = map2 (op ~~)
wenzelm@12529
  1185
      (#1 (#2 (ProofContext.bind_propp_schematic_i (ctxt, all_propp))), map (map snd) all_propp);
nipkow@13629
  1186
    val (concl, propp) = splitAt(length raw_concl, all_propp');
wenzelm@12529
  1187
    val propps = unflat raw_propps propp;
wenzelm@12839
  1188
    val proppss = map (uncurry unflat) (raw_proppss ~~ propps);
wenzelm@12502
  1189
ballarin@15206
  1190
    (* CB: obtain all parameters from identifier part of raw_elemss *)
ballarin@15206
  1191
    val xs = map #1 (params_of' raw_elemss);
wenzelm@12727
  1192
    val typing = unify_frozen ctxt 0
wenzelm@12529
  1193
      (map (ProofContext.default_type raw_ctxt) xs)
wenzelm@12529
  1194
      (map (ProofContext.default_type ctxt) xs);
wenzelm@12529
  1195
    val parms = param_types (xs ~~ typing);
ballarin@14508
  1196
    (* CB: parms are the parameters from raw_elemss, with correct typing. *)
wenzelm@12273
  1197
ballarin@14508
  1198
    (* CB: extract information from assumes and defines elements
ballarin@14508
  1199
       (fixes and notes in raw_elemss don't have an effect on text and elemss),
ballarin@14508
  1200
       compute final form of context elements. *)
wenzelm@13394
  1201
    val (text, elemss) = finish_elemss ctxt parms do_close
wenzelm@13394
  1202
      (((([], []), ([], [])), ([], [], [])), raw_elemss ~~ proppss);
ballarin@14508
  1203
    (* CB: text has the following structure:
ballarin@14508
  1204
           (((exts, exts'), (ints, ints')), (xs, env, defs))
ballarin@14508
  1205
       where
ballarin@14508
  1206
         exts: external assumptions (terms in external assumes elements)
ballarin@14508
  1207
         exts': dito, normalised wrt. env
ballarin@14508
  1208
         ints: internal assumptions (terms in internal assumes elements)
ballarin@14508
  1209
         ints': dito, normalised wrt. env
ballarin@14508
  1210
         xs: the free variables in exts' and ints' and rhss of definitions,
ballarin@14508
  1211
           this includes parameters except defined parameters
ballarin@14508
  1212
         env: list of term pairs encoding substitutions, where the first term
ballarin@14508
  1213
           is a free variable; substitutions represent defines elements and
ballarin@14508
  1214
           the rhs is normalised wrt. the previous env
ballarin@14508
  1215
         defs: theorems representing the substitutions from defines elements
ballarin@14508
  1216
           (thms are normalised wrt. env).
ballarin@14508
  1217
       elemss is an updated version of raw_elemss:
ballarin@14508
  1218
         - type info added to Fixes
ballarin@14508
  1219
         - axiom and definition statement replaced by corresponding one
ballarin@14508
  1220
           from proppss in Assumes and Defines
ballarin@14508
  1221
         - Facts unchanged
ballarin@14508
  1222
       *)
wenzelm@13308
  1223
  in ((parms, elemss, concl), text) end;
wenzelm@12502
  1224
wenzelm@12502
  1225
in
wenzelm@12502
  1226
wenzelm@12529
  1227
fun read_elemss x = prep_elemss read_fixes ProofContext.read_propp_schematic x;
wenzelm@12529
  1228
fun cert_elemss x = prep_elemss cert_fixes ProofContext.cert_propp_schematic x;
wenzelm@12529
  1229
wenzelm@12529
  1230
end;
wenzelm@12529
  1231
wenzelm@12529
  1232
wenzelm@15703
  1233
(* facts and attributes *)
wenzelm@12529
  1234
wenzelm@12529
  1235
local
wenzelm@12529
  1236
wenzelm@15703
  1237
fun prep_name ctxt name =
ballarin@15206
  1238
  (* CB: reject qualified theorem names in locale declarations *)
wenzelm@12529
  1239
  if NameSpace.is_qualified name then
wenzelm@12529
  1240
    raise ProofContext.CONTEXT ("Illegal qualified name: " ^ quote name, ctxt)
wenzelm@15703
  1241
  else name;
wenzelm@12529
  1242
wenzelm@15703
  1243
fun prep_facts _ _ ctxt (Int elem) =
wenzelm@15703
  1244
      map_values I I (Thm.transfer (ProofContext.theory_of ctxt)) elem
wenzelm@15703
  1245
  | prep_facts get intern ctxt (Ext elem) = elem |> map_elem
wenzelm@15703
  1246
     {var = I, typ = I, term = I,
wenzelm@15703
  1247
      name = prep_name ctxt,
wenzelm@15703
  1248
      fact = get ctxt,
wenzelm@15703
  1249
      attrib = Args.assignable o intern (ProofContext.sign_of ctxt)};
wenzelm@12529
  1250
wenzelm@12529
  1251
in
wenzelm@12529
  1252
wenzelm@15703
  1253
fun read_facts x = prep_facts ProofContext.get_thms Attrib.intern_src x;
wenzelm@15703
  1254
fun cert_facts x = prep_facts (K I) (K I) x;
wenzelm@12529
  1255
wenzelm@12529
  1256
end;
wenzelm@12529
  1257
wenzelm@12529
  1258
wenzelm@12546
  1259
(* full context statements: import + elements + conclusion *)
wenzelm@12529
  1260
wenzelm@12529
  1261
local
wenzelm@12529
  1262
wenzelm@12529
  1263
fun prep_context_statement prep_expr prep_elemss prep_facts
ballarin@15206
  1264
    do_close fixed_params import elements raw_concl context =
wenzelm@12529
  1265
  let
wenzelm@12529
  1266
    val sign = ProofContext.sign_of context;
wenzelm@13375
  1267
ballarin@14508
  1268
    val (import_ids, raw_import_elemss) = flatten (context, prep_expr sign) ([], Expr import);
ballarin@14215
  1269
    (* CB: normalise "includes" among elements *)
ballarin@15696
  1270
    val (ids, raw_elemsss) = foldl_map (flatten (context, prep_expr sign))
ballarin@15696
  1271
      (import_ids, elements);
ballarin@15696
  1272
ballarin@15696
  1273
    val raw_elemss = List.concat raw_elemsss;
ballarin@14508
  1274
    (* CB: raw_import_elemss @ raw_elemss is the normalised list of
ballarin@14508
  1275
       context elements obtained from import and elements. *)
wenzelm@13375
  1276
    val ((parms, all_elemss, concl), (spec, (_, _, defs))) = prep_elemss do_close
wenzelm@13336
  1277
      context fixed_params (raw_import_elemss @ raw_elemss) raw_concl;
ballarin@15696
  1278
    (* replace extended ids (for axioms) by ids *)
ballarin@15696
  1279
    val all_elemss' = map (fn (((_, ps), _), (((n, ps'), ax), elems)) =>
ballarin@15696
  1280
        (((n, List.filter (fn (p, _) => p mem ps) ps'), ax), elems))
ballarin@15696
  1281
      (ids ~~ all_elemss);
ballarin@15696
  1282
ballarin@15206
  1283
    (* CB: all_elemss and parms contain the correct parameter types *)
ballarin@15696
  1284
    val (ps,qs) = splitAt(length raw_import_elemss, all_elemss')
ballarin@15206
  1285
    val (import_ctxt, (import_elemss, _)) =
ballarin@15206
  1286
      activate_facts prep_facts (context, ps);
ballarin@14215
  1287
ballarin@15206
  1288
    val (ctxt, (elemss, _)) =
ballarin@15206
  1289
      activate_facts prep_facts (import_ctxt, qs);
ballarin@15212
  1290
    val stmt = gen_distinct Term.aconv
skalberg@15570
  1291
       (List.concat (map (fn ((_, axs), _) =>
skalberg@15570
  1292
         List.concat (map (#hyps o Thm.rep_thm) axs)) qs));
ballarin@15206
  1293
    val cstmt = map (cterm_of sign) stmt;
wenzelm@12834
  1294
  in
ballarin@15206
  1295
    ((((import_ctxt, import_elemss), (ctxt, elemss)), (parms, spec, defs)), (cstmt, concl))
wenzelm@12834
  1296
  end;
wenzelm@12529
  1297
wenzelm@15703
  1298
val gen_context = prep_context_statement intern_expr read_elemss read_facts;
wenzelm@15703
  1299
val gen_context_i = prep_context_statement (K I) cert_elemss cert_facts;
wenzelm@12529
  1300
wenzelm@12529
  1301
fun gen_statement prep_locale prep_ctxt raw_locale elems concl ctxt =
wenzelm@12529
  1302
  let
wenzelm@12529
  1303
    val thy = ProofContext.theory_of ctxt;
skalberg@15570
  1304
    val locale = Option.map (prep_locale (Theory.sign_of thy)) raw_locale;
ballarin@15206
  1305
    val (target_stmt, fixed_params, import) =
skalberg@15531
  1306
      (case locale of NONE => ([], [], empty)
skalberg@15531
  1307
      | SOME name =>
ballarin@15206
  1308
          let val {predicate = (stmt, _), params = (ps, _), ...} =
ballarin@15206
  1309
            the_locale thy name
ballarin@15206
  1310
          in (stmt, param_types ps, Locale name) end);
ballarin@15696
  1311
    val ((((locale_ctxt, locale_elemss), (elems_ctxt, _)), _), (elems_stmt, concl')) =
ballarin@15206
  1312
      prep_ctxt false fixed_params import elems concl ctxt;
ballarin@15206
  1313
  in (locale, (target_stmt, elems_stmt), locale_ctxt, elems_ctxt, concl') end;
wenzelm@13399
  1314
wenzelm@12529
  1315
in
wenzelm@12529
  1316
ballarin@15127
  1317
(* CB: processing of locales for add_locale(_i) and print_locale *)
ballarin@15127
  1318
  (* CB: arguments are: x->import, y->body (elements), z->context *)
ballarin@15206
  1319
fun read_context x y z = #1 (gen_context true [] x (map Elem y) [] z);
ballarin@15206
  1320
fun cert_context x y z = #1 (gen_context_i true [] x (map Elem y) [] z);
ballarin@14215
  1321
ballarin@15127
  1322
(* CB: processing of locales for note_thmss(_i),
ballarin@15127
  1323
   Proof.multi_theorem(_i) and antiquotations with option "locale" *)
wenzelm@12529
  1324
val read_context_statement = gen_statement intern gen_context;
wenzelm@12529
  1325
val cert_context_statement = gen_statement (K I) gen_context_i;
wenzelm@12502
  1326
wenzelm@12502
  1327
end;
wenzelm@11896
  1328
wenzelm@11896
  1329
ballarin@14508
  1330
(** CB: experimental instantiation mechanism **)
ballarin@14508
  1331
ballarin@14528
  1332
fun instantiate loc_name (prfx, attribs) raw_inst ctxt =
ballarin@14508
  1333
  let
ballarin@14508
  1334
    val thy = ProofContext.theory_of ctxt;
ballarin@14508
  1335
    val sign = Theory.sign_of thy;
ballarin@14508
  1336
    val tsig = Sign.tsig_of sign;
ballarin@14508
  1337
    val cert = cterm_of sign;
ballarin@14508
  1338
ballarin@14508
  1339
    (** process the locale **)
ballarin@14508
  1340
ballarin@15206
  1341
    val {predicate = (_, axioms), params = (ps, _), ...} =
ballarin@14508
  1342
      the_locale thy (intern sign loc_name);
ballarin@14508
  1343
    val fixed_params = param_types ps;
ballarin@14528
  1344
    val init = ProofContext.init thy;
ballarin@15596
  1345
    val (_, raw_elemss) =
ballarin@14528
  1346
          flatten (init, intern_expr sign) ([], Expr (Locale loc_name));
ballarin@14508
  1347
    val ((parms, all_elemss, concl),
ballarin@14508
  1348
         (spec as (_, (ints, _)), (xs, env, defs))) =
ballarin@14528
  1349
      read_elemss false (* do_close *) init
ballarin@14508
  1350
        fixed_params (* could also put [] here??? *) raw_elemss
ballarin@14508
  1351
        [] (* concl *);
ballarin@14508
  1352
ballarin@14508
  1353
    (** analyse the instantiation theorem inst **)
ballarin@14508
  1354
ballarin@14508
  1355
    val inst = case raw_inst of
skalberg@15531
  1356
        NONE => if null ints
skalberg@15531
  1357
	  then NONE
ballarin@14508
  1358
	  else error "Locale has assumptions but no chained fact was found"
skalberg@15531
  1359
      | SOME [] => if null ints
skalberg@15531
  1360
	  then NONE
ballarin@14508
  1361
	  else error "Locale has assumptions but no chained fact was found"
skalberg@15531
  1362
      | SOME [thm] => if null ints
skalberg@15531
  1363
	  then (warning "Locale has no assumptions: fact ignored"; NONE)
skalberg@15531
  1364
	  else SOME thm
skalberg@15531
  1365
      | SOME _ => error "Multiple facts are not allowed";
ballarin@14508
  1366
ballarin@14508
  1367
    val args = case inst of
skalberg@15531
  1368
            NONE => []
skalberg@15531
  1369
          | SOME thm => thm |> prop_of |> ObjectLogic.drop_judgment sign
ballarin@14528
  1370
              |> Term.strip_comb
ballarin@14528
  1371
              |>> (fn t as (Const (s, _)) => if (intern sign loc_name = s)
ballarin@14528
  1372
                        then t
ballarin@14528
  1373
                        else error ("Constant " ^ quote loc_name ^
ballarin@14528
  1374
                          " expected but constant " ^ quote s ^ " was found")
ballarin@14528
  1375
                    | t => error ("Constant " ^ quote loc_name ^ " expected \
ballarin@14528
  1376
                          \but term " ^ quote (Sign.string_of_term sign t) ^
ballarin@14528
  1377
                          " was found"))
ballarin@14528
  1378
              |> snd;
ballarin@14508
  1379
    val cargs = map cert args;
ballarin@14508
  1380
ballarin@14508
  1381
    (* process parameters: match their types with those of arguments *)
ballarin@14508
  1382
ballarin@14508
  1383
    val def_names = map (fn (Free (s, _), _) => s) env;
skalberg@15570
  1384
    val (defined, assumed) = List.partition
ballarin@14508
  1385
          (fn (s, _) => s mem def_names) fixed_params;
ballarin@14508
  1386
    val cassumed = map (cert o Free) assumed;
ballarin@14508
  1387
    val cdefined = map (cert o Free) defined;
ballarin@14508
  1388
ballarin@14508
  1389
    val param_types = map snd assumed;
ballarin@14508
  1390
    val v_param_types = map Type.varifyT param_types;
ballarin@14508
  1391
    val arg_types = map Term.fastype_of args;
skalberg@15570
  1392
    val Tenv = Library.foldl (Type.typ_match tsig)
ballarin@14508
  1393
          (Vartab.empty, v_param_types ~~ arg_types)
skalberg@15570
  1394
          handle UnequalLengths => error "Number of parameters does not \
ballarin@14528
  1395
            \match number of arguments of chained fact";
ballarin@14508
  1396
    (* get their sorts *)
skalberg@15574
  1397
    val tfrees = foldr Term.add_typ_tfrees [] param_types
ballarin@14508
  1398
    val Tenv' = map
skalberg@15570
  1399
          (fn ((a, i), T) => ((a, valOf (assoc_string (tfrees, a))), T))
ballarin@14508
  1400
          (Vartab.dest Tenv);
ballarin@14508
  1401
ballarin@14508
  1402
    (* process (internal) elements *)
ballarin@14508
  1403
ballarin@14508
  1404
    fun inst_type [] T = T
ballarin@14508
  1405
      | inst_type env T =
skalberg@15570
  1406
          Term.map_type_tfree (fn v => getOpt (assoc (env, v), TFree v)) T;
ballarin@14508
  1407
ballarin@14508
  1408
    fun inst_term [] t = t
ballarin@14508
  1409
      | inst_term env t = Term.map_term_types (inst_type env) t;
ballarin@14508
  1410
ballarin@14508
  1411
    (* parameters with argument types *)
ballarin@14508
  1412
ballarin@14508
  1413
    val cparams' = map (cterm_of sign o inst_term Tenv' o term_of) cassumed;
ballarin@14508
  1414
    val cdefined' = map (cert o inst_term Tenv' o term_of) cdefined;
ballarin@14508
  1415
    val cdefining = map (cert o inst_term Tenv' o snd) env;
ballarin@14508
  1416
ballarin@14508
  1417
    fun inst_thm _ [] th = th
ballarin@14508
  1418
      | inst_thm ctxt Tenv th =
ballarin@14508
  1419
	  let
ballarin@14508
  1420
	    val sign = ProofContext.sign_of ctxt;
ballarin@14508
  1421
	    val cert = Thm.cterm_of sign;
ballarin@14508
  1422
	    val certT = Thm.ctyp_of sign;
ballarin@14508
  1423
	    val {hyps, prop, maxidx, ...} = Thm.rep_thm th;
skalberg@15574
  1424
	    val tfrees = foldr Term.add_term_tfree_names [] (prop :: hyps);
skalberg@15570
  1425
	    val Tenv' = List.filter (fn ((a, _), _) => a mem_string tfrees) Tenv;
ballarin@14508
  1426
	  in
ballarin@14508
  1427
	    if null Tenv' then th
ballarin@14508
  1428
	    else
ballarin@14508
  1429
	      th
ballarin@14508
  1430
	      |> Drule.implies_intr_list (map cert hyps)
ballarin@14508
  1431
	      |> Drule.tvars_intr_list (map (#1 o #1) Tenv')
ballarin@14508
  1432
	      |> (fn (th', al) => th' |>
ballarin@14508
  1433
		Thm.instantiate ((map (fn ((a, _), T) =>
skalberg@15570
  1434
                  (valOf (assoc (al, a)), certT T)) Tenv'), []))
ballarin@14508
  1435
	      |> (fn th'' => Drule.implies_elim_list th''
ballarin@14508
  1436
		  (map (Thm.assume o cert o inst_term Tenv') hyps))
ballarin@14508
  1437
	  end;
ballarin@14508
  1438
wenzelm@15703
  1439
    val inst_type' = inst_type Tenv';
wenzelm@15703
  1440
wenzelm@15703
  1441
    val inst_term' = Term.subst_atomic
wenzelm@15703
  1442
        (map (pairself term_of) ((cparams' @ cdefined') ~~ (cargs @ cdefining)))
wenzelm@15703
  1443
      o inst_term Tenv';
wenzelm@15703
  1444
ballarin@14508
  1445
    fun inst_thm' thm =
ballarin@14508
  1446
      let
ballarin@14508
  1447
        (* not all axs are normally applicable *)
ballarin@14508
  1448
        val hyps = #hyps (rep_thm thm);
ballarin@14508
  1449
        val ass = map (fn ax => (prop_of ax, ax)) axioms;
skalberg@15570
  1450
        val axs' = Library.foldl (fn (axs, hyp) => 
skalberg@15531
  1451
              (case gen_assoc (op aconv) (ass, hyp) of NONE => axs
skalberg@15531
  1452
                 | SOME ax => axs @ [ax])) ([], hyps);
ballarin@14508
  1453
        val thm' = Drule.satisfy_hyps axs' thm;
ballarin@14508
  1454
        (* instantiate types *)
ballarin@14508
  1455
        val thm'' = inst_thm ctxt Tenv' thm';
ballarin@14508
  1456
        (* substitute arguments and discharge hypotheses *)
ballarin@14508
  1457
        val thm''' = case inst of
skalberg@15531
  1458
                NONE => thm''
skalberg@15531
  1459
              | SOME inst_thm => let
ballarin@14508
  1460
		    val hyps = #hyps (rep_thm thm'');
ballarin@14508
  1461
		    val th = thm'' |> implies_intr_hyps
ballarin@14508
  1462
		      |> forall_intr_list (cparams' @ cdefined')
ballarin@14508
  1463
		      |> forall_elim_list (cargs @ cdefining)
ballarin@14508
  1464
		    (* th has premises of the form either inst_thm or x==x *)
ballarin@14508
  1465
		    fun mk hyp = if Logic.is_equals hyp
ballarin@14508
  1466
			  then hyp |> Logic.dest_equals |> snd |> cert
ballarin@14508
  1467
				 |> reflexive
ballarin@14508
  1468
			  else inst_thm
ballarin@14508
  1469
                  in implies_elim_list th (map mk hyps)
ballarin@14508
  1470
                  end;
wenzelm@15703
  1471
      in thm''' end
wenzelm@15703
  1472
      handle THM (msg, n, thms) => error ("Exception THM " ^
wenzelm@15703
  1473
        string_of_int n ^ " raised\n" ^
wenzelm@15703
  1474
	  "Note: instantiate does not support old-style locales \
wenzelm@15703
  1475
          \declared with (open)\n" ^ msg ^ "\n" ^
wenzelm@15703
  1476
	cat_lines (map string_of_thm thms));
ballarin@14508
  1477
ballarin@14528
  1478
    val prefix_fact =
ballarin@14528
  1479
      if prfx = "" then I
ballarin@14528
  1480
      else (fn "" => ""
ballarin@14528
  1481
             | s => NameSpace.append prfx s);
ballarin@14528
  1482
ballarin@14508
  1483
    fun inst_elem (ctxt, (Ext _)) = ctxt
ballarin@14508
  1484
      | inst_elem (ctxt, (Int (Notes facts))) =
ballarin@14508
  1485
              (* instantiate fact *)
wenzelm@15703
  1486
          let
wenzelm@15703
  1487
              val facts = facts |> map_attrib_facts
wenzelm@15703
  1488
                (Attrib.context_attribute_i ctxt o
wenzelm@15703
  1489
                  Args.map_values I inst_type' inst_term' inst_thm');
ballarin@15596
  1490
              val facts' =
ballarin@14528
  1491
                map (apsnd (map (apfst (map inst_thm')))) facts
ballarin@14508
  1492
              (* rename fact *)
ballarin@14528
  1493
              val facts'' = map (apfst (apfst prefix_fact)) facts'
ballarin@14528
  1494
              (* add attributes *)
ballarin@14528
  1495
              val facts''' = map (apfst (apsnd (fn atts => atts @ attribs))) facts''
wenzelm@14564
  1496
          in fst (ProofContext.note_thmss_i facts''' ctxt)
ballarin@14508
  1497
          end
ballarin@14508
  1498
      | inst_elem (ctxt, (Int _)) = ctxt;
ballarin@14508
  1499
skalberg@15570
  1500
    fun inst_elems (ctxt, (id, elems)) = Library.foldl inst_elem (ctxt, elems);
ballarin@14508
  1501
skalberg@15570
  1502
    fun inst_elemss ctxt elemss = Library.foldl inst_elems (ctxt, elemss);
ballarin@14508
  1503
ballarin@14508
  1504
    (* main part *)
ballarin@14508
  1505
ballarin@14508
  1506
    val ctxt' = ProofContext.qualified true ctxt;
ballarin@14508
  1507
  in ProofContext.restore_qualified ctxt (inst_elemss ctxt' all_elemss)
ballarin@14508
  1508
  end;
ballarin@14508
  1509
wenzelm@11896
  1510
wenzelm@13336
  1511
(** define locales **)
wenzelm@13336
  1512
wenzelm@13336
  1513
(* print locale *)
wenzelm@12070
  1514
wenzelm@12758
  1515
fun print_locale thy import body =
wenzelm@12070
  1516
  let
wenzelm@12289
  1517
    val thy_ctxt = ProofContext.init thy;
wenzelm@13420
  1518
    val (((_, import_elemss), (ctxt, elemss)), _) = read_context import body thy_ctxt;
skalberg@15570
  1519
    val all_elems = List.concat (map #2 (import_elemss @ elemss));
wenzelm@12070
  1520
wenzelm@12307
  1521
    val prt_typ = Pretty.quote o ProofContext.pretty_typ ctxt;
wenzelm@12307
  1522
    val prt_term = Pretty.quote o ProofContext.pretty_term ctxt;
wenzelm@12307
  1523
    val prt_thm = Pretty.quote o ProofContext.pretty_thm ctxt;
wenzelm@15703
  1524
    val prt_atts = Args.pretty_attribs ctxt;
wenzelm@12070
  1525
wenzelm@12070
  1526
    fun prt_syn syn =
skalberg@15531
  1527
      let val s = (case syn of NONE => "(structure)" | SOME mx => Syntax.string_of_mixfix mx)
wenzelm@12575
  1528
      in if s = "" then [] else [Pretty.brk 2, Pretty.str s] end;
skalberg@15531
  1529
    fun prt_fix (x, SOME T, syn) = Pretty.block (Pretty.str (x ^ " ::") :: Pretty.brk 1 ::
wenzelm@12070
  1530
          prt_typ T :: Pretty.brk 1 :: prt_syn syn)
skalberg@15531
  1531
      | prt_fix (x, NONE, syn) = Pretty.block (Pretty.str x :: Pretty.brk 1 :: prt_syn syn);
wenzelm@12070
  1532
wenzelm@15703
  1533
    fun prt_name name = Pretty.str (ProofContext.cond_extern ctxt name);
wenzelm@15703
  1534
    fun prt_name_atts (name, atts) =
wenzelm@15703
  1535
      if name = "" andalso null atts then []
wenzelm@15703
  1536
      else [Pretty.block (Pretty.breaks (prt_name name :: prt_atts atts @ [Pretty.str ":"]))];
wenzelm@15703
  1537
wenzelm@15703
  1538
    fun prt_asm (a, ts) =
wenzelm@15703
  1539
      Pretty.block (Pretty.breaks (prt_name_atts a @ map (prt_term o fst) ts));
wenzelm@15703
  1540
    fun prt_def (a, (t, _)) =
wenzelm@15703
  1541
      Pretty.block (Pretty.breaks (prt_name_atts a @ [prt_term t]));
wenzelm@15703
  1542
wenzelm@15703
  1543
    fun prt_fact (ths, []) = map prt_thm ths
wenzelm@15703
  1544
      | prt_fact (ths, atts) =
wenzelm@15703
  1545
          Pretty.enclose "(" ")" (Pretty.breaks (map prt_thm ths)) :: prt_atts atts;
wenzelm@15703
  1546
    fun prt_note (a, ths) =
wenzelm@15703
  1547
      Pretty.block (Pretty.breaks (List.concat (prt_name_atts a :: map prt_fact ths)));
wenzelm@12070
  1548
wenzelm@12289
  1549
    fun items _ [] = []
wenzelm@12289
  1550
      | items prfx (x :: xs) = Pretty.block [Pretty.str prfx, Pretty.brk 1, x] :: items "  and" xs;
wenzelm@12289
  1551
    fun prt_elem (Fixes fixes) = items "fixes" (map prt_fix fixes)
wenzelm@12289
  1552
      | prt_elem (Assumes asms) = items "assumes" (map prt_asm asms)
wenzelm@12289
  1553
      | prt_elem (Defines defs) = items "defines" (map prt_def defs)
wenzelm@15703
  1554
      | prt_elem (Notes facts) = items "notes" (map prt_note facts);
wenzelm@12277
  1555
  in
wenzelm@13336
  1556
    Pretty.big_list "context elements:" (map (Pretty.chunks o prt_elem) all_elems)
wenzelm@13336
  1557
    |> Pretty.writeln
wenzelm@12277
  1558
  end;
wenzelm@12070
  1559
wenzelm@12070
  1560
wenzelm@12730
  1561
(* store results *)
wenzelm@11896
  1562
wenzelm@12706
  1563
local
wenzelm@12706
  1564
wenzelm@12702
  1565
fun hide_bound_names names thy =
wenzelm@12702
  1566
  thy |> PureThy.hide_thms false
wenzelm@12702
  1567
    (map (Sign.full_name (Theory.sign_of thy)) (filter_out (equal "") names));
wenzelm@12702
  1568
wenzelm@12958
  1569
in
wenzelm@12958
  1570
ballarin@15696
  1571
(* store exported theorem in theory *)
ballarin@15696
  1572
wenzelm@14564
  1573
fun note_thmss_qualified kind name args thy =
wenzelm@12706
  1574
  thy
wenzelm@13375
  1575
  |> Theory.add_path (Sign.base_name name)
wenzelm@14564
  1576
  |> PureThy.note_thmss_i (Drule.kind kind) args
wenzelm@12706
  1577
  |>> hide_bound_names (map (#1 o #1) args)
wenzelm@12706
  1578
  |>> Theory.parent_path;
wenzelm@12706
  1579
ballarin@15696
  1580
(* accesses of interpreted theorems *)
ballarin@15696
  1581
ballarin@15696
  1582
(* fully qualified name in theory is T.p.r.n where
ballarin@15696
  1583
   T: theory name, p: interpretation prefix, r: renaming prefix, n: name *)
ballarin@15696
  1584
ballarin@15696
  1585
fun global_accesses prfx name =
ballarin@15696
  1586
     if prfx = "" then
ballarin@15696
  1587
       case NameSpace.unpack name of
ballarin@15696
  1588
	   [] => [""]
ballarin@15696
  1589
	 | [T, n] => map NameSpace.pack [[T, n], [n]]
ballarin@15696
  1590
	 | [T, r, n] => map NameSpace.pack [[T, r, n], [T, n], [r, n], [n]]
ballarin@15696
  1591
	 | _ => error ("Locale accesses: illegal name " ^ quote name)
ballarin@15696
  1592
     else case NameSpace.unpack name of
ballarin@15696
  1593
           [] => [""]
ballarin@15696
  1594
         | [T, p, n] => map NameSpace.pack [[T, p, n], [p, n]]
ballarin@15696
  1595
         | [T, p, r, n] => map NameSpace.pack
ballarin@15696
  1596
             [[T, p, r, n], [T, p, n], [p, r, n], [p, n]]
ballarin@15696
  1597
         | _ => error ("Locale accesses: illegal name " ^ quote name);
ballarin@15696
  1598
ballarin@15696
  1599
(* fully qualified name in context is p.r.n where
ballarin@15696
  1600
   p: interpretation prefix, r: renaming prefix, n: name *)
ballarin@15696
  1601
ballarin@15696
  1602
fun local_accesses prfx name =
ballarin@15696
  1603
     if prfx = "" then
ballarin@15696
  1604
       case NameSpace.unpack name of
ballarin@15696
  1605
	   [] => [""]
ballarin@15696
  1606
	 | [n] => map NameSpace.pack [[n]]
ballarin@15696
  1607
	 | [r, n] => map NameSpace.pack [[r, n], [n]]
ballarin@15696
  1608
	 | _ => error ("Locale accesses: illegal name " ^ quote name)
ballarin@15696
  1609
     else case NameSpace.unpack name of
ballarin@15696
  1610
           [] => [""]
ballarin@15696
  1611
         | [p, n] => map NameSpace.pack [[p, n]]
ballarin@15696
  1612
         | [p, r, n] => map NameSpace.pack [[p, r, n], [p, n]]
ballarin@15696
  1613
         | _ => error ("Locale accesses: illegal name " ^ quote name);
ballarin@15696
  1614
ballarin@15696
  1615
ballarin@15696
  1616
(* store instantiations of args for all registered interpretations
ballarin@15696
  1617
   of the theory *)
ballarin@15696
  1618
ballarin@15696
  1619
fun note_thmss_registrations kind target args thy =
ballarin@15596
  1620
  let
ballarin@15696
  1621
    val ctxt = ProofContext.init thy;
ballarin@15696
  1622
    val sign = Theory.sign_of thy;
ballarin@15696
  1623
ballarin@15696
  1624
    val (parms, parmTs_o) =
ballarin@15696
  1625
          the_locale thy target |> #params |> fst |> split_list;
ballarin@15696
  1626
    val parmvTs = map (Type.varifyT o valOf) parmTs_o;
ballarin@15696
  1627
    val ids = flatten (ctxt, intern_expr sign) ([], Expr (Locale target))
ballarin@15696
  1628
          |> fst |> map fst;
ballarin@15696
  1629
ballarin@15696
  1630
    val regs = get_global_registrations thy target;
ballarin@15696
  1631
ballarin@15696
  1632
    (* add args to thy for all registrations *)
ballarin@15596
  1633
ballarin@15696
  1634
    fun activate (thy, (vts, ((prfx, atts2), _))) =
ballarin@15696
  1635
      let
ballarin@15696
  1636
        val ts = map Logic.unvarify vts;
ballarin@15696
  1637
        (* type instantiation *)
ballarin@15696
  1638
        val vtinst = Library.foldl (Type.typ_match (Sign.tsig_of sign))
ballarin@15696
  1639
             (Vartab.empty, (parmvTs ~~ map Term.fastype_of ts));
ballarin@15696
  1640
        val tinst = Vartab.dest vtinst |> map (fn ((x, 0), T) => (x, T))
ballarin@15696
  1641
             |> Symtab.make;            
ballarin@15696
  1642
        (* replace parameter names in ids by instantiations *)
ballarin@15696
  1643
        val vinst = Symtab.make (parms ~~ vts);
ballarin@15696
  1644
        fun vinst_names ps = map (fn p => Symtab.lookup (vinst, p) |> valOf) ps;
ballarin@15696
  1645
        val inst = Symtab.make (parms ~~ ts);
ballarin@15696
  1646
        val ids' = map (apsnd vinst_names) ids;
ballarin@15696
  1647
        val prems = List.concat (map (snd o valOf o get_global_registration thy) ids');
ballarin@15696
  1648
        val args' = map (fn ((n, atts), [(ths, [])]) =>
wenzelm@15703
  1649
            ((if prfx = "" orelse n = "" then "" else NameSpace.pack [prfx, n],
wenzelm@15703
  1650
              map (Attrib.global_attribute_i thy) (atts @ atts2)),
ballarin@15696
  1651
             [(map (Drule.standard o Drule.satisfy_hyps prems o inst_tab_thm sign (inst, tinst)) ths, [])]))
ballarin@15696
  1652
          args;
ballarin@15696
  1653
      in
ballarin@15696
  1654
        PureThy.note_thmss_accesses_i (global_accesses prfx) (Drule.kind kind) args' thy |> fst
ballarin@15696
  1655
      end;
ballarin@15696
  1656
  in Library.foldl activate (thy, regs) end;
ballarin@15596
  1657
ballarin@15596
  1658
skalberg@15531
  1659
fun smart_note_thmss kind NONE = PureThy.note_thmss_i (Drule.kind kind)
wenzelm@15703
  1660
  | smart_note_thmss kind (SOME loc) = note_thmss_qualified kind loc;
wenzelm@12958
  1661
wenzelm@12958
  1662
end;
wenzelm@12958
  1663
wenzelm@12958
  1664
local
wenzelm@12958
  1665
ballarin@15696
  1666
(* add facts to locale in theory *)
ballarin@15696
  1667
wenzelm@12958
  1668
fun put_facts loc args thy =
wenzelm@12958
  1669
  let
ballarin@15206
  1670
    val {predicate, import, elems, params} = the_locale thy loc;
wenzelm@15703
  1671
    val note = Notes (map (fn ((a, atts), bs) =>
wenzelm@15703
  1672
      ((a, atts), map (apfst (map (curry Thm.name_thm a))) bs)) args);
wenzelm@15703
  1673
  in
wenzelm@15703
  1674
    thy |> put_locale loc {predicate = predicate, import = import,
wenzelm@15703
  1675
      elems = elems @ [(note, stamp ())], params = params}
wenzelm@15703
  1676
  end;
wenzelm@12958
  1677
ballarin@15696
  1678
(* add theorem to locale and theory,
ballarin@15696
  1679
   base for theorems (in loc) and declare (in loc) *)
ballarin@15696
  1680
wenzelm@15703
  1681
fun gen_note_thmss prep_locale prep_facts kind raw_loc args thy =
wenzelm@12706
  1682
  let
wenzelm@12706
  1683
    val thy_ctxt = ProofContext.init thy;
wenzelm@12706
  1684
    val loc = prep_locale (Theory.sign_of thy) raw_loc;
wenzelm@15703
  1685
    val (_, (stmt, _), loc_ctxt, _, _) = cert_context_statement (SOME loc) [] [] thy_ctxt;
ballarin@15206
  1686
    val export = ProofContext.export_standard stmt loc_ctxt thy_ctxt;
wenzelm@15703
  1687
wenzelm@15703
  1688
    val (args', facts) = #2 (activate_note prep_facts (loc_ctxt, args));
wenzelm@15703
  1689
    val facts' =
wenzelm@15703
  1690
      map (rpair [] o #1 o #1) args' ~~
wenzelm@15703
  1691
      map (single o Thm.no_attributes o map export o #2) facts;
wenzelm@12706
  1692
  in
wenzelm@12706
  1693
    thy
wenzelm@15703
  1694
    |> put_facts loc args'
wenzelm@15703
  1695
    |> note_thmss_registrations kind loc args'
wenzelm@15703
  1696
    |> note_thmss_qualified kind loc facts'
wenzelm@12706
  1697
  end;
wenzelm@12706
  1698
wenzelm@12706
  1699
in
wenzelm@12706
  1700
wenzelm@15703
  1701
val note_thmss = gen_note_thmss intern read_facts;
wenzelm@15703
  1702
val note_thmss_i = gen_note_thmss (K I) cert_facts;
wenzelm@12711
  1703
ballarin@15696
  1704
fun add_thmss kind loc args (thy, ctxt) =
wenzelm@12958
  1705
  let
wenzelm@15703
  1706
    val (ctxt', (args', facts)) = activate_note cert_facts
wenzelm@15703
  1707
      (ctxt, args |> map (fn ((a, ths), atts) => ((a, atts), [(ths, [])])));
wenzelm@15703
  1708
    val thy' =
wenzelm@15703
  1709
      thy
wenzelm@15703
  1710
      |> put_facts loc args'
wenzelm@15703
  1711
      |> note_thmss_registrations kind loc args';
wenzelm@15703
  1712
  in ((thy', ctxt'), facts) end;
wenzelm@12702
  1713
wenzelm@12706
  1714
end;
wenzelm@12063
  1715
wenzelm@11896
  1716
wenzelm@13336
  1717
(* predicate text *)
ballarin@15596
  1718
(* CB: generate locale predicates and delta predicates *)
wenzelm@13336
  1719
wenzelm@13375
  1720
local
wenzelm@13375
  1721
ballarin@15206
  1722
(* introN: name of theorems for introduction rules of locale and
ballarin@15206
  1723
     delta predicates;
ballarin@15206
  1724
   axiomsN: name of theorem set with destruct rules for locale predicates,
ballarin@15206
  1725
     also name suffix of delta predicates. *)
ballarin@15206
  1726
wenzelm@13375
  1727
val introN = "intro";
ballarin@15206
  1728
val axiomsN = "axioms";
wenzelm@13375
  1729
wenzelm@13375
  1730
fun atomize_spec sign ts =
wenzelm@13375
  1731
  let
skalberg@15574
  1732
    val t = foldr1 Logic.mk_conjunction ts;
wenzelm@13375
  1733
    val body = ObjectLogic.atomize_term sign t;
wenzelm@13375
  1734
    val bodyT = Term.fastype_of body;
wenzelm@13375
  1735
  in
wenzelm@13375
  1736
    if bodyT = propT then (t, propT, Thm.reflexive (Thm.cterm_of sign t))
wenzelm@13375
  1737
    else (body, bodyT, ObjectLogic.atomize_rule sign (Thm.cterm_of sign t))
wenzelm@13375
  1738
  end;
wenzelm@13375
  1739
wenzelm@13394
  1740
fun aprop_tr' n c = (c, fn args =>
wenzelm@13394
  1741
  if length args = n then Syntax.const "_aprop" $ Term.list_comb (Syntax.free c, args)
wenzelm@13394
  1742
  else raise Match);
wenzelm@13336
  1743
ballarin@15104
  1744
(* CB: define one predicate including its intro rule and axioms
ballarin@15104
  1745
   - bname: predicate name
ballarin@15104
  1746
   - parms: locale parameters
ballarin@15104
  1747
   - defs: thms representing substitutions from defines elements
ballarin@15104
  1748
   - ts: terms representing locale assumptions (not normalised wrt. defs)
ballarin@15104
  1749
   - norm_ts: terms representing locale assumptions (normalised wrt. defs)
ballarin@15104
  1750
   - thy: the theory
ballarin@15104
  1751
*)
ballarin@15104
  1752
wenzelm@13420
  1753
fun def_pred bname parms defs ts norm_ts thy =
wenzelm@13375
  1754
  let
wenzelm@13375
  1755
    val sign = Theory.sign_of thy;
wenzelm@13375
  1756
    val name = Sign.full_name sign bname;
wenzelm@13375
  1757
wenzelm@13420
  1758
    val (body, bodyT, body_eq) = atomize_spec sign norm_ts;
wenzelm@13394
  1759
    val env = Term.add_term_free_names (body, []);
skalberg@15570
  1760
    val xs = List.filter (fn (x, _) => x mem_string env) parms;
wenzelm@13394
  1761
    val Ts = map #2 xs;
skalberg@15574
  1762
    val extraTs = (Term.term_tfrees body \\ foldr Term.add_typ_tfrees [] Ts)
wenzelm@13394
  1763
      |> Library.sort_wrt #1 |> map TFree;
wenzelm@13399
  1764
    val predT = map Term.itselfT extraTs ---> Ts ---> bodyT;
wenzelm@13336
  1765
wenzelm@13394
  1766
    val args = map Logic.mk_type extraTs @ map Free xs;
wenzelm@13394
  1767
    val head = Term.list_comb (Const (name, predT), args);
wenzelm@13375
  1768
    val statement = ObjectLogic.assert_propT sign head;
wenzelm@13375
  1769
wenzelm@13375
  1770
    val (defs_thy, [pred_def]) =
wenzelm@13375
  1771
      thy
wenzelm@13394
  1772
      |> (if bodyT <> propT then I else
wenzelm@13394
  1773
        Theory.add_trfuns ([], [], map (aprop_tr' (length args)) (NameSpace.accesses' name), []))
wenzelm@13375
  1774
      |> Theory.add_consts_i [(bname, predT, Syntax.NoSyn)]
wenzelm@13375
  1775
      |> PureThy.add_defs_i false [((Thm.def_name bname, Logic.mk_equals (head, body)), [])];
wenzelm@13394
  1776
wenzelm@13375
  1777
    val defs_sign = Theory.sign_of defs_thy;
wenzelm@13375
  1778
    val cert = Thm.cterm_of defs_sign;
wenzelm@13375
  1779
wenzelm@13420
  1780
    val intro = Tactic.prove_standard defs_sign [] norm_ts statement (fn _ =>
wenzelm@13375
  1781
      Tactic.rewrite_goals_tac [pred_def] THEN
wenzelm@13375
  1782
      Tactic.compose_tac (false, body_eq RS Drule.equal_elim_rule1, 1) 1 THEN
wenzelm@13420
  1783
      Tactic.compose_tac (false, Drule.conj_intr_list (map (Thm.assume o cert) norm_ts), 0) 1);
wenzelm@13375
  1784
wenzelm@13375
  1785
    val conjuncts =
wenzelm@13399
  1786
      Drule.equal_elim_rule1 OF [Thm.symmetric body_eq,
wenzelm@13399
  1787
        Tactic.rewrite_rule [pred_def] (Thm.assume (cert statement))]
wenzelm@13375
  1788
      |> Drule.conj_elim_precise (length ts);
wenzelm@13394
  1789
    val axioms = (ts ~~ conjuncts) |> map (fn (t, ax) =>
wenzelm@13375
  1790
      Tactic.prove defs_sign [] [] t (fn _ =>
wenzelm@13375
  1791
        Tactic.rewrite_goals_tac defs THEN
wenzelm@13375
  1792
        Tactic.compose_tac (false, ax, 0) 1));
wenzelm@13394
  1793
  in (defs_thy, (statement, intro, axioms)) end;
wenzelm@13375
  1794
ballarin@15104
  1795
(* CB: modify the locale elements:
ballarin@15623
  1796
   - assumes elements become notes elements,
ballarin@15104
  1797
   - notes elements are lifted
ballarin@15104
  1798
*)
ballarin@15104
  1799
wenzelm@15703
  1800
fun change_elem (axms, Assumes asms) =
wenzelm@13394
  1801
      apsnd Notes ((axms, asms) |> foldl_map (fn (axs, (a, spec)) =>
nipkow@13629
  1802
        let val (ps,qs) = splitAt(length spec, axs)
nipkow@13629
  1803
        in (qs, (a, [(ps, [])])) end))
wenzelm@15703
  1804
  | change_elem e = e;
wenzelm@13394
  1805
ballarin@15206
  1806
(* CB: changes only "new" elems, these have identifier ("", _). *)
ballarin@15206
  1807
wenzelm@13394
  1808
fun change_elemss axioms elemss = (axioms, elemss) |> foldl_map
wenzelm@13394
  1809
  (fn (axms, (id as ("", _), es)) =>
wenzelm@15703
  1810
    foldl_map change_elem (axms, map (map_values I I (Drule.satisfy_hyps axioms)) es)
wenzelm@15703
  1811
    |> apsnd (pair id)
wenzelm@13394
  1812
  | x => x) |> #2;
wenzelm@13394
  1813
wenzelm@13394
  1814
in
wenzelm@13375
  1815
ballarin@15104
  1816
(* CB: main predicate definition function *)
ballarin@15104
  1817
wenzelm@13394
  1818
fun define_preds bname (parms, ((exts, exts'), (ints, ints')), defs) elemss thy =
wenzelm@13394
  1819
  let
wenzelm@13394
  1820
    val (thy', (elemss', more_ts)) =
skalberg@15531
  1821
      if null exts then (thy, (elemss, []))
wenzelm@13394
  1822
      else
wenzelm@13394
  1823
        let
skalberg@15531
  1824
          val aname = if null ints then bname else bname ^ "_" ^ axiomsN;
wenzelm@13394
  1825
          val (def_thy, (statement, intro, axioms)) =
wenzelm@13394
  1826
            thy |> def_pred aname parms defs exts exts';
wenzelm@13394
  1827
          val elemss' = change_elemss axioms elemss @
wenzelm@13420
  1828
            [(("", []), [Assumes [((bname ^ "_" ^ axiomsN, []), [(statement, ([], []))])]])];
wenzelm@13394
  1829
        in
wenzelm@14564
  1830
          def_thy |> note_thmss_qualified "" aname
ballarin@14254
  1831
            [((introN, []), [([intro], [])])]
wenzelm@13394
  1832
          |> #1 |> rpair (elemss', [statement])
wenzelm@13394
  1833
        end;
ballarin@15206
  1834
    val (thy'', predicate) =
skalberg@15531
  1835
      if null ints then (thy', ([], []))
wenzelm@13394
  1836
      else
wenzelm@13394
  1837
        let
wenzelm@13394
  1838
          val (def_thy, (statement, intro, axioms)) =
wenzelm@13394
  1839
            thy' |> def_pred bname parms defs (ints @ more_ts) (ints' @ more_ts);
wenzelm@13399
  1840
          val cstatement = Thm.cterm_of (Theory.sign_of def_thy) statement;
wenzelm@13394
  1841
        in
wenzelm@14564
  1842
          def_thy |> note_thmss_qualified "" bname
ballarin@14254
  1843
            [((introN, []), [([intro], [])]),
ballarin@14254
  1844
             ((axiomsN, []), [(map Drule.standard axioms, [])])]
wenzelm@13415
  1845
          |> #1 |> rpair ([cstatement], axioms)
wenzelm@13394
  1846
        end;
ballarin@15206
  1847
  in (thy'', (elemss', predicate)) end;
wenzelm@13375
  1848
wenzelm@13375
  1849
end;
wenzelm@13336
  1850
wenzelm@13336
  1851
wenzelm@13297
  1852
(* add_locale(_i) *)
wenzelm@13297
  1853
wenzelm@13297
  1854
local
wenzelm@13297
  1855
wenzelm@13394
  1856
fun gen_add_locale prep_ctxt prep_expr do_pred bname raw_import raw_body thy =
ballarin@15596
  1857
  (* CB: do_pred controls generation of predicates.
ballarin@15596
  1858
         true -> with, false -> without predicates. *)
wenzelm@13297
  1859
  let
wenzelm@13297
  1860
    val sign = Theory.sign_of thy;
wenzelm@13297
  1861
    val name = Sign.full_name sign bname;
skalberg@15570
  1862
    val _ = conditional (isSome (get_locale thy name)) (fn () =>
wenzelm@13297
  1863
      error ("Duplicate definition of locale " ^ quote name));
wenzelm@13297
  1864
wenzelm@13297
  1865
    val thy_ctxt = ProofContext.init thy;
wenzelm@13420
  1866
    val (((import_ctxt, import_elemss), (body_ctxt, body_elemss)), text) =
wenzelm@13375
  1867
      prep_ctxt raw_import raw_body thy_ctxt;
wenzelm@13375
  1868
    val elemss = import_elemss @ body_elemss;
wenzelm@13297
  1869
ballarin@15206
  1870
    val (pred_thy, (elemss', predicate as (predicate_statement, predicate_axioms))) =
wenzelm@13394
  1871
      if do_pred then thy |> define_preds bname text elemss
wenzelm@13415
  1872
      else (thy, (elemss, ([], [])));
wenzelm@13375
  1873
    val pred_ctxt = ProofContext.init pred_thy;
wenzelm@13420
  1874
ballarin@15206
  1875
    fun axiomify axioms elemss = 
ballarin@15206
  1876
      (axioms, elemss) |> foldl_map (fn (axs, (id, elems)) => let
skalberg@15570
  1877
                   val ts = List.concat (List.mapPartial (fn (Assumes asms) =>
skalberg@15570
  1878
                     SOME (List.concat (map (map #1 o #2) asms)) | _ => NONE) elems);
ballarin@15206
  1879
                   val (axs1, axs2) = splitAt (length ts, axs);
ballarin@15206
  1880
                 in (axs2, ((id, axs1), elems)) end)
ballarin@15206
  1881
        |> snd;
ballarin@15206
  1882
    val (ctxt, (_, facts)) = activate_facts (K I)
ballarin@15206
  1883
      (pred_ctxt, axiomify predicate_axioms elemss');
ballarin@15206
  1884
    val export = ProofContext.export_standard predicate_statement ctxt pred_ctxt;
wenzelm@13420
  1885
    val facts' = facts |> map (fn (a, ths) => ((a, []), [(map export ths, [])]));
wenzelm@13297
  1886
  in
wenzelm@13375
  1887
    pred_thy
wenzelm@14564
  1888
    |> note_thmss_qualified "" name facts' |> #1
wenzelm@13297
  1889
    |> declare_locale name
ballarin@15206
  1890
    |> put_locale name {predicate = predicate, import = prep_expr sign raw_import,
skalberg@15570
  1891
        elems = map (fn e => (e, stamp ())) (List.concat (map #2 (List.filter (equal "" o #1 o #1) elemss'))),
ballarin@15206
  1892
        params = (params_of elemss', map #1 (params_of body_elemss))}
wenzelm@13297
  1893
  end;
wenzelm@13297
  1894
wenzelm@13297
  1895
in
wenzelm@13297
  1896
wenzelm@13297
  1897
val add_locale = gen_add_locale read_context intern_expr;
ballarin@14215
  1898
wenzelm@13297
  1899
val add_locale_i = gen_add_locale cert_context (K I);
wenzelm@13297
  1900
wenzelm@13297
  1901
end;
wenzelm@13297
  1902
wenzelm@13297
  1903
wenzelm@12730
  1904
ballarin@15598
  1905
(** Interpretation commands **)
ballarin@15596
  1906
ballarin@15596
  1907
local
ballarin@15596
  1908
ballarin@15596
  1909
(** instantiate free vars **)
ballarin@15596
  1910
ballarin@15596
  1911
(* extract proof obligations (assms and defs) from elements *)
ballarin@15596
  1912
ballarin@15596
  1913
(* check if defining equation has become t == t, these are dropped
ballarin@15596
  1914
   in extract_asms_elem, as they lead to trivial proof obligations *)
ballarin@15596
  1915
(* currently disabled *)
ballarin@15596
  1916
fun check_def (_, (def, _)) = SOME def;
ballarin@15596
  1917
(*
ballarin@15596
  1918
fun check_def (_, (def, _)) =
ballarin@15596
  1919
      if def |> Logic.dest_equals |> op aconv
ballarin@15596
  1920
      then NONE else SOME def;
ballarin@15596
  1921
*)
ballarin@15596
  1922
ballarin@15596
  1923
fun extract_asms_elem (ts, Fixes _) = ts
ballarin@15596
  1924
  | extract_asms_elem (ts, Assumes asms) =
ballarin@15596
  1925
      ts @ List.concat (map (fn (_, ams) => map (fn (t, _) => t) ams) asms)
ballarin@15596
  1926
  | extract_asms_elem (ts, Defines defs) =
ballarin@15596
  1927
      ts @ List.mapPartial check_def defs
ballarin@15596
  1928
  | extract_asms_elem (ts, Notes _) = ts;
ballarin@15596
  1929
ballarin@15596
  1930
fun extract_asms_elems (id, elems) =
ballarin@15596
  1931
      (id, Library.foldl extract_asms_elem ([], elems));
ballarin@15596
  1932
ballarin@15596
  1933
fun extract_asms_elemss elemss =
ballarin@15596
  1934
      map extract_asms_elems elemss;
ballarin@15596
  1935
ballarin@15624
  1936
(* activate instantiated facts in theory or context *)
ballarin@15596
  1937
ballarin@15624
  1938
fun activate_facts_elem _ _ _ _ (thy_ctxt, Fixes _) = thy_ctxt
ballarin@15624
  1939
  | activate_facts_elem _ _ _ _ (thy_ctxt, Assumes _) = thy_ctxt
ballarin@15624
  1940
  | activate_facts_elem _ _ _ _ (thy_ctxt, Defines _) = thy_ctxt
wenzelm@15703
  1941
  | activate_facts_elem note_thmss attrib
ballarin@15624
  1942
        disch (prfx, atts) (thy_ctxt, Notes facts) =
ballarin@15596
  1943
      let
wenzelm@15703
  1944
        val reg_atts = map (attrib thy_ctxt) atts;
wenzelm@15703
  1945
        val facts = map_attrib_facts (attrib thy_ctxt) facts;
wenzelm@15703
  1946
        val facts' = map (apfst (apsnd (fn a => a @ reg_atts))) facts;
wenzelm@15703
  1947
        (* discharge hyps *)
ballarin@15624
  1948
        val facts'' = map (apsnd (map (apfst (map disch)))) facts';
ballarin@15624
  1949
        (* prefix names *)
ballarin@15624
  1950
        val facts''' = map (apfst (apfst (fn name =>
ballarin@15624
  1951
          if prfx = "" orelse name = "" then name
ballarin@15624
  1952
          else NameSpace.pack [prfx, name]))) facts'';
ballarin@15596
  1953
      in
ballarin@15624
  1954
        fst (note_thmss prfx facts''' thy_ctxt)
ballarin@15596
  1955
      end;
ballarin@15596
  1956
wenzelm@15703
  1957
fun activate_facts_elems get_reg note_thmss attrib
ballarin@15624
  1958
        disch (thy_ctxt, (id, elems)) =
ballarin@15596
  1959
      let
ballarin@15624
  1960
        val ((prfx, atts2), _) = valOf (get_reg thy_ctxt id)
ballarin@15596
  1961
          handle Option => error ("(internal) unknown registration of " ^
ballarin@15596
  1962
            quote (fst id) ^ " while activating facts.");
ballarin@15596
  1963
      in
wenzelm@15703
  1964
        Library.foldl (activate_facts_elem note_thmss attrib
ballarin@15624
  1965
          disch (prfx, atts2)) (thy_ctxt, elems)
ballarin@15596
  1966
      end;
ballarin@15596
  1967
wenzelm@15703
  1968
fun gen_activate_facts_elemss get_reg note_thmss attrib standard
ballarin@15624
  1969
        all_elemss new_elemss thy_ctxt =
ballarin@15596
  1970
      let
ballarin@15596
  1971
        val prems = List.concat (List.mapPartial (fn (id, _) =>
ballarin@15624
  1972
              Option.map snd (get_reg thy_ctxt id)
ballarin@15596
  1973
                handle Option => error ("(internal) unknown registration of " ^
ballarin@15596
  1974
                  quote (fst id) ^ " while activating facts.")) all_elemss);
wenzelm@15703
  1975
      in Library.foldl (activate_facts_elems get_reg note_thmss attrib
ballarin@15624
  1976
        (standard o Drule.satisfy_hyps prems)) (thy_ctxt, new_elemss) end;
ballarin@15596
  1977
ballarin@15624
  1978
val global_activate_facts_elemss = gen_activate_facts_elemss
ballarin@15696
  1979
      (fn thy => fn (name, ps) =>
ballarin@15696
  1980
        get_global_registration thy (name, map Logic.varify ps))
ballarin@15696
  1981
      (fn prfx => PureThy.note_thmss_accesses_i (global_accesses prfx)
ballarin@15624
  1982
        (Drule.kind ""))
wenzelm@15703
  1983
      Attrib.global_attribute_i Drule.standard;
ballarin@15624
  1984
val local_activate_facts_elemss = gen_activate_facts_elemss
ballarin@15696
  1985
      get_local_registration
ballarin@15696
  1986
      (fn prfx => ProofContext.note_thmss_accesses_i (local_accesses prfx))
wenzelm@15703
  1987
      Attrib.context_attribute_i I;
ballarin@15624
  1988
ballarin@15696
  1989
fun gen_prep_registration mk_ctxt is_local read_terms test_reg put_reg activate
ballarin@15624
  1990
    attn expr insts thy_ctxt =
ballarin@15596
  1991
  let
ballarin@15624
  1992
    val ctxt = mk_ctxt thy_ctxt;
ballarin@15624
  1993
    val sign = ProofContext.sign_of ctxt;
ballarin@15596
  1994
ballarin@15696
  1995
    val ctxt' = ctxt |> ProofContext.theory_of |> ProofContext.init;
ballarin@15696
  1996
    val (ids, raw_elemss) = flatten (ctxt', intern_expr sign) ([], Expr expr);
ballarin@15596
  1997
    val do_close = false;  (* effect unknown *)
ballarin@15596
  1998
    val ((parms, all_elemss, _), (spec, (xs, defs, _))) =
ballarin@15696
  1999
          read_elemss do_close ctxt' [] raw_elemss [];
ballarin@15596
  2000
ballarin@15596
  2001
ballarin@15596
  2002
    (** compute instantiation **)
ballarin@15596
  2003
ballarin@15696
  2004
    (* user input *)
ballarin@15596
  2005
    val insts = if length parms < length insts
ballarin@15596
  2006
         then error "More arguments than parameters in instantiation."
ballarin@15596
  2007
         else insts @ replicate (length parms - length insts) NONE;
ballarin@15596
  2008
    val (ps, pTs) = split_list parms;
ballarin@15596
  2009
    val pvTs = map Type.varifyT pTs;
ballarin@15598
  2010
ballarin@15598
  2011
    (* instantiations given by user *)
ballarin@15596
  2012
    val given = List.mapPartial (fn (_, (NONE, _)) => NONE
ballarin@15596
  2013
         | (x, (SOME inst, T)) => SOME (x, (inst, T))) (ps ~~ (insts ~~ pvTs));
ballarin@15596
  2014
    val (given_ps, given_insts) = split_list given;
ballarin@15596
  2015
    val tvars = foldr Term.add_typ_tvars [] pvTs;
ballarin@15596
  2016
    val used = foldr Term.add_typ_varnames [] pvTs;
ballarin@15596
  2017
    fun sorts (a, i) = assoc (tvars, (a, i));
ballarin@15624
  2018
    val (vs, vinst) = read_terms thy_ctxt sorts used given_insts;
ballarin@15696
  2019
    val vars = foldl Term.add_term_tvar_ixns [] vs \\ map fst tvars;
ballarin@15696
  2020
    val vars' = Library.foldl Term.add_term_varnames (vars, vs);
ballarin@15696
  2021
    val _ = if null vars' then ()
ballarin@15696
  2022
         else error ("Illegal schematic variable(s) in instantiation: " ^
ballarin@15696
  2023
           commas_quote (map Syntax.string_of_vname vars'));
ballarin@15598
  2024
    (* replace new types (which are TFrees) by ones with new names *)
ballarin@15598
  2025
    val new_Tnames = foldr Term.add_term_tfree_names [] vs;
ballarin@15598
  2026
    val new_Tnames' = Term.invent_names used "'a" (length new_Tnames);
ballarin@15696
  2027
    val renameT =
ballarin@15696
  2028
          if is_local then I
ballarin@15696
  2029
          else Type.unvarifyT o Term.map_type_tfree (fn (a, s) =>
ballarin@15696
  2030
            TFree (valOf (assoc (new_Tnames ~~ new_Tnames', a)), s));
ballarin@15696
  2031
    val rename =
ballarin@15696
  2032
          if is_local then I
ballarin@15696
  2033
          else Term.map_term_types renameT;
ballarin@15598
  2034
ballarin@15598
  2035
    val tinst = Symtab.make (map
ballarin@15696
  2036
                (fn ((x, 0), T) => (x, T |> renameT)
ballarin@15696
  2037
                  | ((_, n), _) => error "Internal error var in prep_registration") vinst);
ballarin@15696
  2038
    val inst = Symtab.make (given_ps ~~ map rename vs);
ballarin@15596
  2039
ballarin@15596
  2040
    (* defined params without user input *)
ballarin@15596
  2041
    val not_given = List.mapPartial (fn (x, (NONE, T)) => SOME (x, T)
ballarin@15596
  2042
         | (_, (SOME _, _)) => NONE) (ps ~~ (insts ~~ pTs));
ballarin@15596
  2043
    fun add_def ((inst, tinst), (p, pT)) =
ballarin@15596
  2044
      let
ballarin@15596
  2045
        val (t, T) = case find_first (fn (Free (a, _), _) => a = p) defs of
ballarin@15596
  2046
               NONE => error ("Instance missing for parameter " ^ quote p)
ballarin@15596
  2047
             | SOME (Free (_, T), t) => (t, T);
ballarin@15696
  2048
        val d = t |> inst_tab_term (inst, tinst) |> Envir.beta_norm;
ballarin@15596
  2049
      in (Symtab.update_new ((p, d), inst), tinst) end;
ballarin@15596
  2050
    val (inst, tinst) = Library.foldl add_def ((inst, tinst), not_given);
ballarin@15696
  2051
    (* Note: inst and tinst contain no vars. *)
ballarin@15596
  2052
ballarin@15596
  2053
    (** compute proof obligations **)
ballarin@15596
  2054
ballarin@15598
  2055
    (* restore "small" ids *)
ballarin@15596
  2056
    val ids' = map (fn ((n, ps), _) =>
ballarin@15596
  2057
          (n, map (fn p => Free (p, valOf (assoc (parms, p)))) ps)) ids;
ballarin@15596
  2058
ballarin@15596
  2059
    (* instantiate ids and elements *)
ballarin@15596
  2060
    val inst_elemss = map
ballarin@15696
  2061
          (fn (id, (_, elems)) => inst_tab_elems sign (inst, tinst) (id, 
ballarin@15596
  2062
            map (fn Int e => e) elems)) 
ballarin@15596
  2063
          (ids' ~~ all_elemss);
ballarin@15596
  2064
ballarin@15624
  2065
    (* remove fragments already registered with theory or context *)
ballarin@15596
  2066
    val new_inst_elemss = List.filter (fn (id, _) =>
ballarin@15624
  2067
          not (test_reg thy_ctxt id)) inst_elemss;
wenzelm@15703
  2068
    val new_ids = map #1 new_inst_elemss;
ballarin@15596
  2069
ballarin@15596
  2070
    val propss = extract_asms_elemss new_inst_elemss;
ballarin@15596
  2071
wenzelm@15703
  2072
    val bind_attrib = Attrib.crude_closure ctxt o Args.assignable;
wenzelm@15703
  2073
    val attn' = apsnd (map (bind_attrib o Attrib.intern_src sign)) attn;
ballarin@15596
  2074
ballarin@15696
  2075
    (** add registrations to theory or context,
ballarin@15596
  2076
        without theorems, these are added after the proof **)
ballarin@15696
  2077
    (* TODO: this is potentially problematic, since a proof of the
ballarin@15696
  2078
       interpretation might contain a reference to the incomplete
ballarin@15696
  2079
       registration. *)
ballarin@15596
  2080
ballarin@15624
  2081
    val thy_ctxt' = Library.foldl (fn (thy_ctxt, (id, _)) =>
wenzelm@15703
  2082
          put_reg id attn' thy_ctxt) (thy_ctxt, new_inst_elemss);
ballarin@15624
  2083
ballarin@15624
  2084
  in (thy_ctxt', propss, activate inst_elemss new_inst_elemss) end;
ballarin@15624
  2085
ballarin@15624
  2086
in
ballarin@15596
  2087
ballarin@15624
  2088
val prep_global_registration = gen_prep_registration
ballarin@15696
  2089
     ProofContext.init false
ballarin@15624
  2090
     (fn thy => fn sorts => fn used =>
ballarin@15624
  2091
       Sign.read_def_terms (Theory.sign_of thy, K NONE, sorts) used true)
ballarin@15696
  2092
     (fn thy => fn (name, ps) =>
ballarin@15696
  2093
       test_global_registration thy (name, map Logic.varify ps))
ballarin@15696
  2094
     (fn (name, ps) => put_global_registration (name, map Logic.varify ps))
ballarin@15624
  2095
     global_activate_facts_elemss;
ballarin@15624
  2096
ballarin@15624
  2097
val prep_local_registration = gen_prep_registration
ballarin@15696
  2098
     I true
ballarin@15624
  2099
     (fn ctxt => ProofContext.read_termTs ctxt (K false) (K NONE))
ballarin@15624
  2100
     smart_test_registration
ballarin@15624
  2101
     put_local_registration
ballarin@15624
  2102
     local_activate_facts_elemss;
ballarin@15596
  2103
ballarin@15596
  2104
end;  (* local *)
ballarin@15596
  2105
ballarin@15596
  2106
ballarin@15596
  2107
wenzelm@11896
  2108
(** locale theory setup **)
wenzelm@12063
  2109
wenzelm@11896
  2110
val setup =
ballarin@15624
  2111
 [GlobalLocalesData.init, LocalLocalesData.init,
skalberg@15531
  2112
  add_locale_i true "var" empty [Fixes [(Syntax.internal "x", NONE, SOME Syntax.NoSyn)]],
skalberg@15531
  2113
  add_locale_i true "struct" empty [Fixes [(Syntax.internal "S", NONE, NONE)]]];
wenzelm@11896
  2114
wenzelm@11896
  2115
end;