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