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