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