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