src/Pure/Isar/locale.ML
author haftmann
Tue Jul 29 08:15:44 2008 +0200 (2008-07-29)
changeset 27692 c9d461aad7f3
parent 27686 d1dbe31655be
child 27709 2ba55d217705
permissions -rw-r--r--
tuned; explicit export of element accessors
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@19942
     8
Draws basic ideas from Florian Kammueller's original version of
wenzelm@12529
     9
locales, but uses the richer infrastructure of Isar instead of the raw
ballarin@20035
    10
meta-logic.  Furthermore, structured import of contexts (with merge
ballarin@20035
    11
and rename operations) are provided, as well as type-inference of the
wenzelm@13375
    12
signature parts, and predicate definitions of the specification text.
ballarin@14446
    13
ballarin@17437
    14
Interpretation enables the reuse of theorems of locales in other
ballarin@17437
    15
contexts, namely those defined by theories, structured proofs and
ballarin@17437
    16
locales themselves.
ballarin@17437
    17
ballarin@14446
    18
See also:
ballarin@14446
    19
ballarin@14446
    20
[1] Clemens Ballarin. Locales and Locale Expressions in Isabelle/Isar.
ballarin@14446
    21
    In Stefano Berardi et al., Types for Proofs and Programs: International
ballarin@15099
    22
    Workshop, TYPES 2003, Torino, Italy, LNCS 3085, pages 34-50, 2004.
ballarin@19942
    23
[2] Clemens Ballarin. Interpretation of Locales in Isabelle: Managing
ballarin@19942
    24
    Dependencies between Locales. Technical Report TUM-I0607, Technische
ballarin@19942
    25
    Universitaet Muenchen, 2006.
ballarin@19942
    26
[3] Clemens Ballarin. Interpretation of Locales in Isabelle: Theories and
ballarin@19942
    27
    Proof Contexts. In J.M. Borwein and W.M. Farmer, MKM 2006, LNAI 4108,
ballarin@19942
    28
    pages 31-43, 2006.
wenzelm@11896
    29
*)
wenzelm@11896
    30
ballarin@16169
    31
(* TODO:
ballarin@16169
    32
- beta-eta normalisation of interpretation parameters
ballarin@16169
    33
- dangling type frees in locales
ballarin@16620
    34
- test subsumption of interpretations when merging theories
ballarin@16169
    35
*)
ballarin@16169
    36
wenzelm@11896
    37
signature LOCALE =
wenzelm@11896
    38
sig
wenzelm@12273
    39
  datatype expr =
wenzelm@12273
    40
    Locale of string |
ballarin@16102
    41
    Rename of expr * (string * mixfix option) option list |
wenzelm@12273
    42
    Merge of expr list
wenzelm@12273
    43
  val empty: expr
wenzelm@18137
    44
  datatype 'a element = Elem of 'a | Expr of expr
wenzelm@21035
    45
  val map_elem: ('a -> 'b) -> 'a element -> 'b element
ballarin@15206
    46
wenzelm@16458
    47
  val intern: theory -> xstring -> string
haftmann@24751
    48
  val intern_expr: theory -> expr -> expr
wenzelm@16458
    49
  val extern: theory -> string -> xstring
ballarin@19991
    50
  val init: string -> theory -> Proof.context
ballarin@15206
    51
ballarin@18795
    52
  (* The specification of a locale *)
ballarin@18795
    53
  val parameters_of: theory -> string ->
haftmann@18917
    54
    ((string * typ) * mixfix) list
ballarin@19276
    55
  val parameters_of_expr: theory -> expr ->
ballarin@19276
    56
    ((string * typ) * mixfix) list
ballarin@18795
    57
  val local_asms_of: theory -> string ->
ballarin@18795
    58
    ((string * Attrib.src list) * term list) list
ballarin@18795
    59
  val global_asms_of: theory -> string ->
ballarin@18795
    60
    ((string * Attrib.src list) * term list) list
haftmann@25619
    61
  val intros: theory -> string -> thm list * thm list
haftmann@25619
    62
  val dests: theory -> string -> thm list
haftmann@27692
    63
  val elems: theory -> string -> Element.context_i list
ballarin@18795
    64
wenzelm@18899
    65
  (* Processing of locale statements *)
wenzelm@18137
    66
  val read_context_statement: xstring option -> Element.context element list ->
wenzelm@19585
    67
    (string * string list) list list -> Proof.context ->
ballarin@19991
    68
    string option * Proof.context * Proof.context * (term * term list) list list
wenzelm@21035
    69
  val read_context_statement_i: string option -> Element.context element list ->
wenzelm@21035
    70
    (string * string list) list list -> Proof.context ->
wenzelm@21035
    71
    string option * Proof.context * Proof.context * (term * term list) list list
wenzelm@18137
    72
  val cert_context_statement: string option -> Element.context_i element list ->
wenzelm@19585
    73
    (term * term list) list list -> Proof.context ->
ballarin@19991
    74
    string option * Proof.context * Proof.context * (term * term list) list list
wenzelm@19780
    75
  val read_expr: expr -> Element.context list -> Proof.context ->
wenzelm@19780
    76
    Element.context_i list * Proof.context
wenzelm@19780
    77
  val cert_expr: expr -> Element.context_i list -> Proof.context ->
wenzelm@19780
    78
    Element.context_i list * Proof.context
ballarin@15596
    79
ballarin@15596
    80
  (* Diagnostic functions *)
wenzelm@12758
    81
  val print_locales: theory -> unit
wenzelm@18137
    82
  val print_locale: theory -> bool -> expr -> Element.context list -> unit
ballarin@24787
    83
  val print_registrations: bool -> string -> Proof.context -> unit
wenzelm@18137
    84
haftmann@27681
    85
  val add_locale: string -> bstring -> expr -> Element.context list -> theory
wenzelm@20965
    86
    -> string * Proof.context
haftmann@27681
    87
  val add_locale_i: string -> bstring -> expr -> Element.context_i list -> theory
wenzelm@20965
    88
    -> string * Proof.context
ballarin@15596
    89
schirmer@21225
    90
  (* Tactics *)
schirmer@21225
    91
  val intro_locales_tac: bool -> Proof.context -> thm list -> tactic
schirmer@21225
    92
ballarin@15696
    93
  (* Storing results *)
wenzelm@18806
    94
  val add_thmss: string -> string ->
wenzelm@18806
    95
    ((string * Attrib.src list) * (thm list * Attrib.src list) list) list ->
wenzelm@21582
    96
    Proof.context -> Proof.context
wenzelm@24020
    97
  val add_type_syntax: string -> declaration -> Proof.context -> Proof.context
wenzelm@24020
    98
  val add_term_syntax: string -> declaration -> Proof.context -> Proof.context
wenzelm@24020
    99
  val add_declaration: string -> declaration -> Proof.context -> Proof.context
wenzelm@18137
   100
haftmann@22300
   101
  val interpretation_i: (Proof.context -> Proof.context) ->
ballarin@22658
   102
    (bool * string) * Attrib.src list -> expr ->
ballarin@25095
   103
    term option list * ((bstring * Attrib.src list) * term) list ->
haftmann@22300
   104
    theory -> Proof.state
wenzelm@21005
   105
  val interpretation: (Proof.context -> Proof.context) ->
ballarin@22658
   106
    (bool * string) * Attrib.src list -> expr ->
ballarin@25095
   107
    string option list * ((bstring * Attrib.src list) * string) list ->
wenzelm@21005
   108
    theory -> Proof.state
wenzelm@21005
   109
  val interpretation_in_locale: (Proof.context -> Proof.context) ->
wenzelm@21005
   110
    xstring * expr -> theory -> Proof.state
haftmann@22300
   111
  val interpret_i: (Proof.state -> Proof.state Seq.seq) ->
ballarin@22658
   112
    (bool * string) * Attrib.src list -> expr ->
ballarin@25095
   113
    term option list * ((bstring * Attrib.src list) * term) list ->
haftmann@22300
   114
    bool -> Proof.state -> Proof.state
wenzelm@21005
   115
  val interpret: (Proof.state -> Proof.state Seq.seq) ->
ballarin@22658
   116
    (bool * string) * Attrib.src list -> expr ->
ballarin@25095
   117
    string option list * ((bstring * Attrib.src list) * string) list ->
wenzelm@21005
   118
    bool -> Proof.state -> Proof.state
wenzelm@11896
   119
end;
wenzelm@12839
   120
wenzelm@12289
   121
structure Locale: LOCALE =
wenzelm@11896
   122
struct
wenzelm@11896
   123
wenzelm@23228
   124
(* legacy operations *)
wenzelm@23228
   125
haftmann@27681
   126
fun merge_lists _ xs [] = xs
haftmann@27681
   127
  | merge_lists _ [] ys = ys
haftmann@27681
   128
  | merge_lists eq xs ys = xs @ filter_out (member eq xs) ys;
haftmann@27681
   129
haftmann@27681
   130
fun merge_alists eq xs = merge_lists (eq_fst eq) xs;
wenzelm@19780
   131
wenzelm@20307
   132
wenzelm@12273
   133
(** locale elements and expressions **)
wenzelm@11896
   134
wenzelm@18137
   135
datatype ctxt = datatype Element.ctxt;
wenzelm@17355
   136
wenzelm@12273
   137
datatype expr =
wenzelm@12273
   138
  Locale of string |
ballarin@16102
   139
  Rename of expr * (string * mixfix option) option list |
wenzelm@12273
   140
  Merge of expr list;
wenzelm@11896
   141
wenzelm@12273
   142
val empty = Merge [];
wenzelm@12273
   143
wenzelm@18137
   144
datatype 'a element =
ballarin@15206
   145
  Elem of 'a | Expr of expr;
wenzelm@12273
   146
wenzelm@18137
   147
fun map_elem f (Elem e) = Elem (f e)
wenzelm@18137
   148
  | map_elem _ (Expr e) = Expr e;
wenzelm@18137
   149
wenzelm@24020
   150
type decl = declaration * stamp;
wenzelm@21499
   151
wenzelm@12070
   152
type locale =
ballarin@19931
   153
 {axiom: Element.witness list,
ballarin@19942
   154
    (* For locales that define predicates this is [A [A]], where A is the locale
ballarin@20317
   155
       specification.  Otherwise [].
ballarin@20317
   156
       Only required to generate the right witnesses for locales with predicates. *)
wenzelm@22573
   157
  imports: expr,                                                     (*dynamic imports*)
ballarin@19783
   158
  elems: (Element.context_i * stamp) list,
ballarin@19783
   159
    (* Static content, neither Fixes nor Constrains elements *)
wenzelm@21499
   160
  params: ((string * typ) * mixfix) list,                             (*all params*)
ballarin@19931
   161
  lparams: string list,                                             (*local params*)
wenzelm@21665
   162
  decls: decl list * decl list,                    (*type/term_syntax declarations*)
ballarin@19931
   163
  regs: ((string * string list) * Element.witness list) list,
wenzelm@19780
   164
    (* Registrations: indentifiers and witnesses of locales interpreted in the locale. *)
haftmann@25619
   165
  intros: thm list * thm list,
ballarin@19931
   166
    (* Introduction rules: of delta predicate and locale predicate. *)
haftmann@25619
   167
  dests: thm list}
haftmann@25619
   168
    (* Destruction rules relative to canonical order in locale context. *)
wenzelm@11896
   169
wenzelm@15703
   170
(* CB: an internal (Int) locale element was either imported or included,
wenzelm@15703
   171
   an external (Ext) element appears directly in the locale text. *)
wenzelm@15703
   172
wenzelm@15703
   173
datatype ('a, 'b) int_ext = Int of 'a | Ext of 'b;
wenzelm@15703
   174
wenzelm@15703
   175
wenzelm@15703
   176
ballarin@25286
   177
(** substitutions on Frees and Vars -- clone from element.ML **)
ballarin@25286
   178
ballarin@25286
   179
(* instantiate types *)
ballarin@25286
   180
ballarin@25286
   181
fun var_instT_type env =
ballarin@25286
   182
  if Vartab.is_empty env then I
ballarin@25286
   183
  else Term.map_type_tvar (fn (x, S) => the_default (TVar (x, S)) (Vartab.lookup env x));
ballarin@25286
   184
ballarin@25286
   185
fun var_instT_term env =
ballarin@25286
   186
  if Vartab.is_empty env then I
ballarin@25286
   187
  else Term.map_types (var_instT_type env);
ballarin@25286
   188
ballarin@25286
   189
fun var_inst_term (envT, env) =
ballarin@25286
   190
  if Vartab.is_empty env then var_instT_term envT
ballarin@25286
   191
  else
ballarin@25286
   192
    let
ballarin@25286
   193
      val instT = var_instT_type envT;
ballarin@25286
   194
      fun inst (Const (x, T)) = Const (x, instT T)
ballarin@25286
   195
        | inst (Free (x, T)) = Free(x, instT T)
ballarin@25286
   196
        | inst (Var (xi, T)) =
ballarin@25286
   197
            (case Vartab.lookup env xi of
ballarin@25286
   198
              NONE => Var (xi, instT T)
ballarin@25286
   199
            | SOME t => t)
ballarin@25286
   200
        | inst (b as Bound _) = b
ballarin@25286
   201
        | inst (Abs (x, T, t)) = Abs (x, instT T, inst t)
ballarin@25286
   202
        | inst (t $ u) = inst t $ inst u;
ballarin@25286
   203
    in Envir.beta_norm o inst end;
ballarin@25286
   204
ballarin@25286
   205
ballarin@16736
   206
(** management of registrations in theories and proof contexts **)
wenzelm@11896
   207
ballarin@15837
   208
structure Registrations :
ballarin@15837
   209
  sig
ballarin@15837
   210
    type T
ballarin@15837
   211
    val empty: T
ballarin@15837
   212
    val join: T * T -> T
ballarin@20069
   213
    val dest: theory -> T ->
ballarin@22658
   214
      (term list *
ballarin@25286
   215
        (((bool * string) * Attrib.src list) *
ballarin@25286
   216
         (Morphism.morphism * ((typ Vartab.table * typ list) * (term Vartab.table * term list))) *
ballarin@25286
   217
         Element.witness list *
ballarin@25095
   218
         thm Termtab.table)) list
ballarin@25286
   219
    val test: theory -> T * term list -> bool
ballarin@25286
   220
    val lookup: theory ->
ballarin@25286
   221
      T * (term list * ((typ Vartab.table * typ list) * (term Vartab.table * term list))) ->
ballarin@25286
   222
      (((bool * string) * Attrib.src list) *
ballarin@25286
   223
        Element.witness list *
ballarin@25286
   224
        thm Termtab.table) option
ballarin@25286
   225
    val insert: theory -> term list -> ((bool * string) * Attrib.src list) ->
ballarin@25286
   226
        (Morphism.morphism * ((typ Vartab.table * typ list) * (term Vartab.table * term list))) -> T ->
haftmann@22351
   227
      T * (term list * (((bool * string) * Attrib.src list) * Element.witness list)) list
wenzelm@19780
   228
    val add_witness: term list -> Element.witness -> T -> T
ballarin@25095
   229
    val add_equation: term list -> thm -> T -> T
ballarin@15837
   230
  end =
ballarin@15837
   231
struct
ballarin@22658
   232
  (* A registration is indexed by parameter instantiation.  Its components are:
ballarin@22658
   233
     - parameters and prefix
ballarin@22658
   234
       (if the Boolean flag is set, only accesses containing the prefix are generated,
wenzelm@23418
   235
        otherwise the prefix may be omitted when accessing theorems etc.)
ballarin@25286
   236
     - pair of export and import morphisms, export maps content to its originating
ballarin@25286
   237
       context, import is its inverse
ballarin@22658
   238
     - theorems (actually witnesses) instantiating locale assumptions
ballarin@25286
   239
     - theorems (equations) interpreting derived concepts and indexed by lhs.
ballarin@25286
   240
     NB: index is exported while content is internalised.
ballarin@22658
   241
  *)
ballarin@25286
   242
  type T = (((bool * string) * Attrib.src list) *
ballarin@25286
   243
            (Morphism.morphism * ((typ Vartab.table * typ list) * (term Vartab.table * term list))) *
ballarin@25286
   244
            Element.witness list *
ballarin@25095
   245
            thm Termtab.table) Termtab.table;
ballarin@15837
   246
ballarin@15837
   247
  val empty = Termtab.empty;
ballarin@15837
   248
ballarin@15837
   249
  (* term list represented as single term, for simultaneous matching *)
ballarin@15837
   250
  fun termify ts =
wenzelm@18343
   251
    Term.list_comb (Const ("", map fastype_of ts ---> propT), ts);
ballarin@15837
   252
  fun untermify t =
ballarin@15837
   253
    let fun ut (Const _) ts = ts
ballarin@15837
   254
          | ut (s $ t) ts = ut s (t::ts)
ballarin@15837
   255
    in ut t [] end;
ballarin@15837
   256
ballarin@22658
   257
  (* joining of registrations:
ballarin@25286
   258
     - prefix, attributes and morphisms of right theory;
ballarin@22658
   259
     - witnesses are equal, no attempt to subsumption testing;
ballarin@22658
   260
     - union of equalities, if conflicting (i.e. two eqns with equal lhs)
ballarin@22658
   261
       eqn of right theory takes precedence *)
ballarin@25286
   262
  fun join (r1, r2) = Termtab.join (fn _ => fn ((_, _, _, e1), (n, m, w, e2)) =>
ballarin@25286
   263
      (n, m, w, Termtab.join (fn _ => fn (_, e) => e) (e1, e2))) (r1, r2);
ballarin@15837
   264
ballarin@20069
   265
  fun dest_transfer thy regs =
ballarin@25286
   266
    Termtab.dest regs |> map (apsnd (fn (n, m, ws, es) =>
ballarin@25286
   267
      (n, m, map (Element.transfer_witness thy) ws, Termtab.map (transfer thy) es)));
ballarin@20069
   268
ballarin@20069
   269
  fun dest thy regs = dest_transfer thy regs |> map (apfst untermify);
ballarin@15837
   270
ballarin@15837
   271
  (* registrations that subsume t *)
wenzelm@17203
   272
  fun subsumers thy t regs =
ballarin@20069
   273
    filter (fn (t', _) => Pattern.matches thy (t', t)) (dest_transfer thy regs);
ballarin@15837
   274
ballarin@25286
   275
  (* test if registration that subsumes the query is present *)
ballarin@25286
   276
  fun test thy (regs, ts) =
ballarin@25286
   277
    not (null (subsumers thy (termify ts) regs));
ballarin@25286
   278
      
ballarin@15837
   279
  (* look up registration, pick one that subsumes the query *)
ballarin@25286
   280
  fun lookup thy (regs, (ts, ((impT, _), (imp, _)))) =
ballarin@15837
   281
    let
ballarin@15837
   282
      val t = termify ts;
wenzelm@19780
   283
      val subs = subsumers thy t regs;
wenzelm@21483
   284
    in
wenzelm@21483
   285
      (case subs of
ballarin@15837
   286
        [] => NONE
ballarin@25286
   287
      | ((t', ((prfx, atts), (exp', ((impT', domT'), (imp', dom'))), thms, eqns)) :: _) =>
wenzelm@21483
   288
          let
wenzelm@19780
   289
            val (tinst, inst) = Pattern.match thy (t', t) (Vartab.empty, Vartab.empty);
ballarin@25286
   290
            val tinst' = domT' |> map (fn (T as TFree (x, _)) =>
ballarin@25286
   291
                (x, T |> Morphism.typ exp' |> Envir.typ_subst_TVars tinst
ballarin@25286
   292
                      |> var_instT_type impT)) |> Symtab.make;
ballarin@25286
   293
            val inst' = dom' |> map (fn (t as Free (x, _)) =>
ballarin@25286
   294
                (x, t |> Morphism.term exp' |> Envir.subst_vars (tinst, inst)
ballarin@25286
   295
                      |> var_inst_term (impT, imp))) |> Symtab.make;
ballarin@25286
   296
            val inst'_morph = Element.inst_morphism thy (tinst', inst');
ballarin@25286
   297
          in SOME ((prfx, map (Args.morph_values inst'_morph) atts),
ballarin@25286
   298
            map (Element.morph_witness inst'_morph) thms,
ballarin@25286
   299
            Termtab.map (Morphism.thm inst'_morph) eqns)
ballarin@23918
   300
          end)
ballarin@15837
   301
    end;
ballarin@15837
   302
ballarin@15837
   303
  (* add registration if not subsumed by ones already present,
ballarin@15837
   304
     additionally returns registrations that are strictly subsumed *)
ballarin@25286
   305
  fun insert thy ts attn m regs =
ballarin@15837
   306
    let
ballarin@15837
   307
      val t = termify ts;
ballarin@20069
   308
      val subs = subsumers thy t regs ;
ballarin@15837
   309
    in (case subs of
ballarin@15837
   310
        [] => let
ballarin@15837
   311
                val sups =
ballarin@20069
   312
                  filter (fn (t', _) => Pattern.matches thy (t, t')) (dest_transfer thy regs);
ballarin@25286
   313
                val sups' = map (apfst untermify) sups |> map (fn (ts, (n, _, w, _)) => (ts, (n, w)))
ballarin@25286
   314
              in (Termtab.update (t, (attn, m, [], Termtab.empty)) regs, sups') end
ballarin@15837
   315
      | _ => (regs, []))
ballarin@15837
   316
    end;
ballarin@15837
   317
haftmann@25669
   318
  fun gen_add f ts regs =
ballarin@23918
   319
    let
ballarin@23918
   320
      val t = termify ts;
ballarin@23918
   321
    in
haftmann@25669
   322
      Termtab.update (t, f (the (Termtab.lookup regs t))) regs
ballarin@23918
   323
    end;
ballarin@23918
   324
ballarin@15837
   325
  (* add witness theorem to registration,
ballarin@16169
   326
     only if instantiation is exact, otherwise exception Option raised *)
haftmann@25669
   327
  fun add_witness ts wit regs =
haftmann@25669
   328
    gen_add (fn (x, m, wits, eqns) => (x, m, Element.close_witness wit :: wits, eqns))
haftmann@25669
   329
      ts regs;
ballarin@22658
   330
ballarin@22658
   331
  (* add equation to registration, replaces previous equation with same lhs;
ballarin@22658
   332
     only if instantiation is exact, otherwise exception Option raised;
ballarin@22658
   333
     exception TERM raised if not a meta equality *)
ballarin@22658
   334
  fun add_equation ts thm regs =
haftmann@25669
   335
    gen_add (fn (x, m, thms, eqns) =>
wenzelm@26634
   336
      (x, m, thms, Termtab.update (thm |> prop_of |> Logic.dest_equals |> fst, Thm.close_derivation thm) eqns))
haftmann@25669
   337
      ts regs;
ballarin@15837
   338
end;
ballarin@15837
   339
ballarin@16736
   340
ballarin@24787
   341
(** theory data : locales **)
ballarin@24787
   342
ballarin@24787
   343
structure LocalesData = TheoryDataFun
wenzelm@22846
   344
(
ballarin@24787
   345
  type T = NameSpace.T * locale Symtab.table;
ballarin@15596
   346
    (* 1st entry: locale namespace,
ballarin@24787
   347
       2nd entry: locales of the theory *)
ballarin@24787
   348
ballarin@24787
   349
  val empty = (NameSpace.empty, Symtab.empty);
wenzelm@12063
   350
  val copy = I;
wenzelm@16458
   351
  val extend = I;
wenzelm@12289
   352
wenzelm@21665
   353
  fun join_locales _
haftmann@25619
   354
    ({axiom, imports, elems, params, lparams, decls = (decls1, decls2), regs, intros, dests}: locale,
wenzelm@21665
   355
      {elems = elems', decls = (decls1', decls2'), regs = regs', ...}: locale) =
ballarin@19931
   356
     {axiom = axiom,
wenzelm@22573
   357
      imports = imports,
haftmann@27681
   358
      elems = merge_lists (eq_snd (op =)) elems elems',
ballarin@16736
   359
      params = params,
ballarin@19278
   360
      lparams = lparams,
wenzelm@21499
   361
      decls =
wenzelm@21665
   362
       (Library.merge (eq_snd (op =)) (decls1, decls1'),
wenzelm@21665
   363
        Library.merge (eq_snd (op =)) (decls2, decls2')),
haftmann@27681
   364
      regs = merge_alists (op =) regs regs',
haftmann@25619
   365
      intros = intros,
haftmann@25619
   366
      dests = dests};
ballarin@24787
   367
  fun merge _ ((space1, locs1), (space2, locs2)) =
ballarin@24787
   368
    (NameSpace.merge (space1, space2), Symtab.join join_locales (locs1, locs2));
wenzelm@22846
   369
);
wenzelm@15801
   370
wenzelm@15801
   371
ballarin@15624
   372
ballarin@24787
   373
(** context data : registrations **)
ballarin@24787
   374
ballarin@24787
   375
structure RegistrationsData = GenericDataFun
wenzelm@22846
   376
(
wenzelm@22846
   377
  type T = Registrations.T Symtab.table;  (*registrations, indexed by locale name*)
ballarin@24787
   378
  val empty = Symtab.empty;
ballarin@24787
   379
  val extend = I;
ballarin@24787
   380
  fun merge _ = Symtab.join (K Registrations.join);
wenzelm@22846
   381
);
wenzelm@12289
   382
wenzelm@12277
   383
ballarin@24787
   384
(** access locales **)
wenzelm@12277
   385
ballarin@24787
   386
val intern = NameSpace.intern o #1 o LocalesData.get;
ballarin@24787
   387
val extern = NameSpace.extern o #1 o LocalesData.get;
ballarin@15624
   388
haftmann@27681
   389
fun get_locale thy name = Symtab.lookup (#2 (LocalesData.get thy)) name;
haftmann@27681
   390
haftmann@27681
   391
fun the_locale thy name = case get_locale thy name
haftmann@27681
   392
 of SOME loc => loc
haftmann@27681
   393
  | NONE => error ("Unknown locale " ^ quote name);
haftmann@27681
   394
haftmann@27686
   395
fun register_locale name loc thy =
ballarin@24787
   396
  thy |> LocalesData.map (fn (space, locs) =>
haftmann@27681
   397
    (Sign.declare_name thy name space, Symtab.update (name, loc) locs));
wenzelm@11896
   398
wenzelm@18806
   399
fun change_locale name f thy =
wenzelm@18806
   400
  let
haftmann@25619
   401
    val {axiom, imports, elems, params, lparams, decls, regs, intros, dests} =
ballarin@19931
   402
        the_locale thy name;
haftmann@25619
   403
    val (axiom', imports', elems', params', lparams', decls', regs', intros', dests') =
haftmann@25619
   404
      f (axiom, imports, elems, params, lparams, decls, regs, intros, dests);
wenzelm@18806
   405
  in
haftmann@27681
   406
    thy
haftmann@27681
   407
    |> (LocalesData.map o apsnd) (Symtab.update (name, {axiom = axiom',
haftmann@27681
   408
          imports = imports', elems = elems', params = params', lparams = lparams',
haftmann@27681
   409
          decls = decls', regs = regs', intros = intros', dests = dests'}))
haftmann@27681
   410
  end;
haftmann@27681
   411
haftmann@27681
   412
fun print_locales thy =
haftmann@27681
   413
  let val (space, locs) = LocalesData.get thy in
haftmann@27681
   414
    Pretty.strs ("locales:" :: map #1 (NameSpace.extern_table (space, locs)))
haftmann@27681
   415
    |> Pretty.writeln
wenzelm@18806
   416
  end;
wenzelm@18806
   417
wenzelm@12046
   418
ballarin@15596
   419
(* access registrations *)
ballarin@15596
   420
ballarin@15624
   421
(* retrieve registration from theory or context *)
ballarin@15624
   422
ballarin@24787
   423
fun get_registrations ctxt name =
ballarin@24787
   424
  case Symtab.lookup (RegistrationsData.get ctxt) name of
ballarin@15696
   425
      NONE => []
ballarin@24787
   426
    | SOME reg => Registrations.dest (Context.theory_of ctxt) reg;
ballarin@24787
   427
ballarin@24787
   428
fun get_global_registrations thy = get_registrations (Context.Theory thy);
ballarin@24787
   429
fun get_local_registrations ctxt = get_registrations (Context.Proof ctxt);
ballarin@24787
   430
ballarin@24787
   431
wenzelm@25357
   432
fun get_registration ctxt imprt (name, ps) =
ballarin@24787
   433
  case Symtab.lookup (RegistrationsData.get ctxt) name of
ballarin@15624
   434
      NONE => NONE
wenzelm@25357
   435
    | SOME reg => Registrations.lookup (Context.theory_of ctxt) (reg, (ps, imprt));
ballarin@24787
   436
ballarin@24787
   437
fun get_global_registration thy = get_registration (Context.Theory thy);
ballarin@24787
   438
fun get_local_registration ctxt = get_registration (Context.Proof ctxt);
ballarin@15596
   439
ballarin@25286
   440
ballarin@25286
   441
fun test_registration ctxt (name, ps) =
ballarin@25286
   442
  case Symtab.lookup (RegistrationsData.get ctxt) name of
ballarin@25286
   443
      NONE => false
ballarin@25286
   444
    | SOME reg => Registrations.test (Context.theory_of ctxt) (reg, ps);
ballarin@25286
   445
ballarin@25286
   446
fun test_global_registration thy = test_registration (Context.Theory thy);
ballarin@25286
   447
fun test_local_registration ctxt = test_registration (Context.Proof ctxt);
ballarin@25286
   448
ballarin@15624
   449
ballarin@15837
   450
(* add registration to theory or context, ignored if subsumed *)
ballarin@15624
   451
ballarin@25286
   452
fun put_registration (name, ps) attn morphs ctxt =
ballarin@24787
   453
  RegistrationsData.map (fn regs =>
ballarin@15837
   454
    let
ballarin@24787
   455
      val thy = Context.theory_of ctxt;
wenzelm@18343
   456
      val reg = the_default Registrations.empty (Symtab.lookup regs name);
ballarin@25286
   457
      val (reg', sups) = Registrations.insert thy ps attn morphs reg;
ballarin@15837
   458
      val _ = if not (null sups) then warning
ballarin@15837
   459
                ("Subsumed interpretation(s) of locale " ^
wenzelm@16458
   460
                 quote (extern thy name) ^
ballarin@22658
   461
                 "\nwith the following prefix(es):" ^
haftmann@22351
   462
                  commas_quote (map (fn (_, (((_, s), _), _)) => s) sups))
ballarin@15837
   463
              else ();
ballarin@24787
   464
    in Symtab.update (name, reg') regs end) ctxt;
ballarin@24787
   465
ballarin@25286
   466
fun put_global_registration id attn morphs =
ballarin@25286
   467
  Context.theory_map (put_registration id attn morphs);
ballarin@25286
   468
fun put_local_registration id attn morphs =
ballarin@25286
   469
  Context.proof_map (put_registration id attn morphs);
ballarin@24787
   470
ballarin@15596
   471
wenzelm@18806
   472
fun put_registration_in_locale name id =
haftmann@25619
   473
  change_locale name (fn (axiom, imports, elems, params, lparams, decls, regs, intros, dests) =>
haftmann@25619
   474
    (axiom, imports, elems, params, lparams, decls, regs @ [(id, [])], intros, dests));
ballarin@17000
   475
ballarin@15624
   476
ballarin@22658
   477
(* add witness theorem to registration, ignored if registration not present *)
ballarin@15596
   478
wenzelm@18123
   479
fun add_witness (name, ps) thm =
ballarin@24787
   480
  RegistrationsData.map (Symtab.map_entry name (Registrations.add_witness ps thm));
ballarin@24787
   481
ballarin@24787
   482
fun add_global_witness id thm = Context.theory_map (add_witness id thm);
ballarin@24787
   483
fun add_local_witness id thm = Context.proof_map (add_witness id thm);
ballarin@24787
   484
ballarin@15596
   485
wenzelm@18806
   486
fun add_witness_in_locale name id thm =
haftmann@25619
   487
  change_locale name (fn (axiom, imports, elems, params, lparams, decls, regs, intros, dests) =>
ballarin@17000
   488
    let
ballarin@17000
   489
      fun add (id', thms) =
wenzelm@18806
   490
        if id = id' then (id', thm :: thms) else (id', thms);
haftmann@25619
   491
    in (axiom, imports, elems, params, lparams, decls, map add regs, intros, dests) end);
ballarin@15596
   492
ballarin@14215
   493
ballarin@22658
   494
(* add equation to registration, ignored if registration not present *)
ballarin@22658
   495
ballarin@22658
   496
fun add_equation (name, ps) thm =
ballarin@24787
   497
  RegistrationsData.map (Symtab.map_entry name (Registrations.add_equation ps thm));
ballarin@24787
   498
ballarin@24787
   499
fun add_global_equation id thm = Context.theory_map (add_equation id thm);
ballarin@24787
   500
fun add_local_equation id thm = Context.proof_map (add_equation id thm);
ballarin@22658
   501
ballarin@22658
   502
ballarin@15624
   503
(* printing of registrations *)
ballarin@15596
   504
ballarin@24787
   505
fun print_registrations show_wits loc ctxt =
ballarin@15596
   506
  let
wenzelm@15703
   507
    val thy = ProofContext.theory_of ctxt;
wenzelm@24920
   508
    val prt_term = Pretty.quote o Syntax.pretty_term ctxt;
ballarin@25095
   509
    fun prt_term' t = if !show_types
ballarin@25095
   510
          then Pretty.block [prt_term t, Pretty.brk 1, Pretty.str "::",
ballarin@25095
   511
            Pretty.brk 1, (Pretty.quote o Syntax.pretty_typ ctxt) (type_of t)]
ballarin@25095
   512
          else prt_term t;
ballarin@23918
   513
    val prt_thm = prt_term o prop_of;
ballarin@17096
   514
    fun prt_inst ts =
ballarin@25095
   515
        Pretty.enclose "(" ")" (Pretty.breaks (map prt_term' ts));
ballarin@22658
   516
    fun prt_attn ((false, prfx), atts) =
ballarin@22658
   517
        Pretty.breaks (Pretty.str prfx :: Pretty.str "(optional)" ::
ballarin@22658
   518
          Attrib.pretty_attribs ctxt atts)
ballarin@22658
   519
      | prt_attn ((true, prfx), atts) =
ballarin@22658
   520
        Pretty.breaks (Pretty.str prfx :: Attrib.pretty_attribs ctxt atts);
ballarin@22658
   521
    fun prt_eqns [] = Pretty.str "no equations."
ballarin@22658
   522
      | prt_eqns eqns = Pretty.block (Pretty.str "equations:" :: Pretty.brk 1 ::
ballarin@23918
   523
          Pretty.breaks (map prt_thm eqns));
ballarin@22658
   524
    fun prt_core ts eqns =
ballarin@22658
   525
          [prt_inst ts, Pretty.fbrk, prt_eqns (Termtab.dest eqns |> map snd)];
ballarin@22658
   526
    fun prt_witns [] = Pretty.str "no witnesses."
ballarin@22658
   527
      | prt_witns witns = Pretty.block (Pretty.str "witnesses:" :: Pretty.brk 1 ::
ballarin@22658
   528
          Pretty.breaks (map (Element.pretty_witness ctxt) witns))
ballarin@25286
   529
    fun prt_reg (ts, (((_, ""), []), _, witns, eqns)) =
ballarin@17138
   530
        if show_wits
ballarin@22658
   531
          then Pretty.block (prt_core ts eqns @ [Pretty.fbrk, prt_witns witns])
ballarin@22658
   532
          else Pretty.block (prt_core ts eqns)
ballarin@25286
   533
      | prt_reg (ts, (attn, _, witns, eqns)) =
ballarin@17138
   534
        if show_wits
ballarin@22658
   535
          then Pretty.block ((prt_attn attn @ [Pretty.str ":", Pretty.brk 1] @
ballarin@22658
   536
            prt_core ts eqns @ [Pretty.fbrk, prt_witns witns]))
ballarin@17096
   537
          else Pretty.block ((prt_attn attn @
ballarin@22658
   538
            [Pretty.str ":", Pretty.brk 1] @ prt_core ts eqns));
wenzelm@15703
   539
wenzelm@16458
   540
    val loc_int = intern thy loc;
ballarin@24787
   541
    val regs = RegistrationsData.get (Context.Proof ctxt);
wenzelm@17412
   542
    val loc_regs = Symtab.lookup regs loc_int;
ballarin@15596
   543
  in
ballarin@15596
   544
    (case loc_regs of
ballarin@24787
   545
        NONE => Pretty.str ("no interpretations")
ballarin@15763
   546
      | SOME r => let
ballarin@20069
   547
            val r' = Registrations.dest thy r;
ballarin@25286
   548
            val r'' = Library.sort_wrt (fn (_, (((_, prfx), _), _, _, _)) => prfx) r';
ballarin@24787
   549
          in Pretty.big_list ("interpretations:") (map prt_reg r'') end)
ballarin@15596
   550
    |> Pretty.writeln
ballarin@15596
   551
  end;
ballarin@15596
   552
ballarin@15596
   553
wenzelm@12277
   554
(* diagnostics *)
wenzelm@12273
   555
wenzelm@12277
   556
fun err_in_locale ctxt msg ids =
wenzelm@12277
   557
  let
wenzelm@16458
   558
    val thy = ProofContext.theory_of ctxt;
wenzelm@12529
   559
    fun prt_id (name, parms) =
wenzelm@16458
   560
      [Pretty.block (Pretty.breaks (map Pretty.str (extern thy name :: parms)))];
wenzelm@19482
   561
    val prt_ids = flat (separate [Pretty.str " +", Pretty.brk 1] (map prt_id ids));
wenzelm@12502
   562
    val err_msg =
wenzelm@12529
   563
      if forall (equal "" o #1) ids then msg
wenzelm@12502
   564
      else msg ^ "\n" ^ Pretty.string_of (Pretty.block
wenzelm@12502
   565
        (Pretty.str "The error(s) above occurred in locale:" :: Pretty.brk 1 :: prt_ids));
wenzelm@18678
   566
  in error err_msg end;
wenzelm@12063
   567
ballarin@15206
   568
fun err_in_locale' ctxt msg ids' = err_in_locale ctxt msg (map fst ids');
wenzelm@12277
   569
wenzelm@12277
   570
ballarin@19783
   571
fun pretty_ren NONE = Pretty.str "_"
ballarin@19783
   572
  | pretty_ren (SOME (x, NONE)) = Pretty.str x
ballarin@19783
   573
  | pretty_ren (SOME (x, SOME syn)) =
ballarin@19783
   574
      Pretty.block [Pretty.str x, Pretty.brk 1, Syntax.pretty_mixfix syn];
ballarin@19783
   575
ballarin@19783
   576
fun pretty_expr thy (Locale name) = Pretty.str (extern thy name)
ballarin@19783
   577
  | pretty_expr thy (Rename (expr, xs)) =
ballarin@19783
   578
      Pretty.block [pretty_expr thy expr, Pretty.brk 1, Pretty.block (map pretty_ren xs |> Pretty.breaks)]
ballarin@19783
   579
  | pretty_expr thy (Merge es) =
ballarin@19783
   580
      Pretty.separate "+" (map (pretty_expr thy) es) |> Pretty.block;
ballarin@19783
   581
ballarin@19783
   582
fun err_in_expr _ msg (Merge []) = error msg
ballarin@19783
   583
  | err_in_expr ctxt msg expr =
ballarin@19783
   584
    error (msg ^ "\n" ^ Pretty.string_of (Pretty.block
ballarin@19783
   585
      [Pretty.str "The error(s) above occured in locale expression:", Pretty.brk 1,
ballarin@19783
   586
       pretty_expr (ProofContext.theory_of ctxt) expr]));
ballarin@19783
   587
wenzelm@12046
   588
wenzelm@12529
   589
(** structured contexts: rename + merge + implicit type instantiation **)
wenzelm@12529
   590
wenzelm@12529
   591
(* parameter types *)
wenzelm@12529
   592
wenzelm@12529
   593
fun frozen_tvars ctxt Ts =
wenzelm@19914
   594
  #1 (Variable.importT_inst (map Logic.mk_type Ts) ctxt)
wenzelm@19900
   595
  |> map (fn ((xi, S), T) => (xi, (S, T)));
wenzelm@12529
   596
wenzelm@12529
   597
fun unify_frozen ctxt maxidx Ts Us =
wenzelm@12529
   598
  let
wenzelm@18343
   599
    fun paramify NONE i = (NONE, i)
wenzelm@18343
   600
      | paramify (SOME T) i = apfst SOME (TypeInfer.paramify_dummies T i);
wenzelm@12529
   601
wenzelm@18343
   602
    val (Ts', maxidx') = fold_map paramify Ts maxidx;
wenzelm@18343
   603
    val (Us', maxidx'') = fold_map paramify Us maxidx';
wenzelm@16947
   604
    val thy = ProofContext.theory_of ctxt;
ballarin@14215
   605
wenzelm@18190
   606
    fun unify (SOME T, SOME U) env = (Sign.typ_unify thy (U, T) env
wenzelm@18190
   607
          handle Type.TUNIFY => raise TYPE ("unify_frozen: failed to unify types", [U, T], []))
wenzelm@18190
   608
      | unify _ env = env;
wenzelm@18190
   609
    val (unifier, _) = fold unify (Ts' ~~ Us') (Vartab.empty, maxidx'');
skalberg@15570
   610
    val Vs = map (Option.map (Envir.norm_type unifier)) Us';
wenzelm@19482
   611
    val unifier' = Vartab.extend (unifier, frozen_tvars ctxt (map_filter I Vs));
skalberg@15570
   612
  in map (Option.map (Envir.norm_type unifier')) Vs end;
wenzelm@12529
   613
wenzelm@21665
   614
fun params_of elemss =
wenzelm@21665
   615
  distinct (eq_fst (op = : string * string -> bool)) (maps (snd o fst) elemss);
wenzelm@21665
   616
wenzelm@21665
   617
fun params_of' elemss =
wenzelm@21665
   618
  distinct (eq_fst (op = : string * string -> bool)) (maps (snd o fst o fst) elemss);
wenzelm@21665
   619
wenzelm@21665
   620
ballarin@26645
   621
fun params_qualified params name =
ballarin@26645
   622
  NameSpace.qualified (space_implode "_" params) name;
ballarin@16102
   623
ballarin@14508
   624
ballarin@14508
   625
(* CB: param_types has the following type:
skalberg@15531
   626
  ('a * 'b option) list -> ('a * 'b) list *)
wenzelm@19482
   627
fun param_types ps = map_filter (fn (_, NONE) => NONE | (x, SOME T) => SOME (x, T)) ps;
wenzelm@12529
   628
wenzelm@12529
   629
haftmann@19932
   630
fun merge_syntax ctxt ids ss = Symtab.merge (op = : mixfix * mixfix -> bool) ss
wenzelm@23655
   631
  handle Symtab.DUP x => err_in_locale ctxt
wenzelm@23655
   632
    ("Conflicting syntax for parameter: " ^ quote x) (map fst ids);
ballarin@16102
   633
ballarin@16102
   634
ballarin@17000
   635
(* Distinction of assumed vs. derived identifiers.
ballarin@17000
   636
   The former may have axioms relating assumptions of the context to
ballarin@17000
   637
   assumptions of the specification fragment (for locales with
wenzelm@19780
   638
   predicates).  The latter have witnesses relating assumptions of the
ballarin@17000
   639
   specification fragment to assumptions of other (assumed) specification
ballarin@17000
   640
   fragments. *)
ballarin@17000
   641
ballarin@17000
   642
datatype 'a mode = Assumed of 'a | Derived of 'a;
ballarin@17000
   643
ballarin@17000
   644
fun map_mode f (Assumed x) = Assumed (f x)
ballarin@17000
   645
  | map_mode f (Derived x) = Derived (f x);
ballarin@17000
   646
wenzelm@18123
   647
wenzelm@12529
   648
(* flatten expressions *)
wenzelm@11896
   649
wenzelm@12510
   650
local
wenzelm@12502
   651
wenzelm@18137
   652
fun unify_parms ctxt fixed_parms raw_parmss =
wenzelm@12502
   653
  let
wenzelm@16458
   654
    val thy = ProofContext.theory_of ctxt;
wenzelm@12502
   655
    val maxidx = length raw_parmss;
wenzelm@12502
   656
    val idx_parmss = (0 upto maxidx - 1) ~~ raw_parmss;
wenzelm@12502
   657
wenzelm@12502
   658
    fun varify i = Term.map_type_tfree (fn (a, S) => TVar ((a, i), S));
wenzelm@12529
   659
    fun varify_parms (i, ps) = map (apsnd (varify i)) (param_types ps);
wenzelm@19482
   660
    val parms = fixed_parms @ maps varify_parms idx_parmss;
wenzelm@12502
   661
wenzelm@18137
   662
    fun unify T U envir = Sign.typ_unify thy (U, T) envir
ballarin@15206
   663
      handle Type.TUNIFY =>
wenzelm@23418
   664
        let
schirmer@22339
   665
          val T' = Envir.norm_type (fst envir) T;
schirmer@22339
   666
          val U' = Envir.norm_type (fst envir) U;
wenzelm@26948
   667
          val prt = Syntax.string_of_typ ctxt;
schirmer@22339
   668
        in
wenzelm@18137
   669
          raise TYPE ("unify_parms: failed to unify types " ^
schirmer@22339
   670
            prt U' ^ " and " ^ prt T', [U', T'], [])
wenzelm@18137
   671
        end;
wenzelm@18137
   672
    fun unify_list (T :: Us) = fold (unify T) Us
wenzelm@18137
   673
      | unify_list [] = I;
wenzelm@18952
   674
    val (unifier, _) = fold unify_list (map #2 (Symtab.dest (Symtab.make_list parms)))
wenzelm@18137
   675
      (Vartab.empty, maxidx);
wenzelm@12502
   676
wenzelm@19061
   677
    val parms' = map (apsnd (Envir.norm_type unifier)) (distinct (eq_fst (op =)) parms);
wenzelm@12502
   678
    val unifier' = Vartab.extend (unifier, frozen_tvars ctxt (map #2 parms'));
wenzelm@12502
   679
wenzelm@12502
   680
    fun inst_parms (i, ps) =
wenzelm@23178
   681
      List.foldr Term.add_typ_tfrees [] (map_filter snd ps)
wenzelm@19482
   682
      |> map_filter (fn (a, S) =>
wenzelm@12502
   683
          let val T = Envir.norm_type unifier' (TVar ((a, i), S))
wenzelm@18137
   684
          in if T = TFree (a, S) then NONE else SOME (a, T) end)
wenzelm@18137
   685
      |> Symtab.make;
wenzelm@18137
   686
  in map inst_parms idx_parmss end;
wenzelm@12502
   687
wenzelm@12529
   688
in
wenzelm@12502
   689
wenzelm@12529
   690
fun unify_elemss _ _ [] = []
wenzelm@12529
   691
  | unify_elemss _ [] [elems] = [elems]
wenzelm@12529
   692
  | unify_elemss ctxt fixed_parms elemss =
wenzelm@12502
   693
      let
wenzelm@18137
   694
        val thy = ProofContext.theory_of ctxt;
wenzelm@21483
   695
        val phis = unify_parms ctxt fixed_parms (map (snd o fst o fst) elemss)
wenzelm@21483
   696
          |> map (Element.instT_morphism thy);
wenzelm@21483
   697
        fun inst ((((name, ps), mode), elems), phi) =
wenzelm@21483
   698
          (((name, map (apsnd (Option.map (Morphism.typ phi))) ps),
wenzelm@21483
   699
              map_mode (map (Element.morph_witness phi)) mode),
wenzelm@21483
   700
            map (Element.morph_ctxt phi) elems);
wenzelm@21483
   701
      in map inst (elemss ~~ phis) end;
wenzelm@12502
   702
ballarin@17000
   703
wenzelm@19810
   704
fun renaming xs parms = zip_options parms xs
wenzelm@19810
   705
  handle Library.UnequalLengths =>
wenzelm@19810
   706
    error ("Too many arguments in renaming: " ^
wenzelm@19810
   707
      commas (map (fn NONE => "_" | SOME x => quote (fst x)) xs));
wenzelm@19810
   708
wenzelm@19810
   709
ballarin@19783
   710
(* params_of_expr:
ballarin@19783
   711
   Compute parameters (with types and syntax) of locale expression.
ballarin@19783
   712
*)
ballarin@19783
   713
ballarin@19783
   714
fun params_of_expr ctxt fixed_params expr (prev_parms, prev_types, prev_syn) =
ballarin@19783
   715
  let
ballarin@19783
   716
    val thy = ProofContext.theory_of ctxt;
ballarin@19783
   717
ballarin@19783
   718
    fun merge_tenvs fixed tenv1 tenv2 =
ballarin@19783
   719
        let
ballarin@19783
   720
          val [env1, env2] = unify_parms ctxt fixed
ballarin@19783
   721
                [tenv1 |> Symtab.dest |> map (apsnd SOME),
ballarin@19783
   722
                 tenv2 |> Symtab.dest |> map (apsnd SOME)]
ballarin@19783
   723
        in
ballarin@19783
   724
          Symtab.merge (op =) (Symtab.map (Element.instT_type env1) tenv1,
ballarin@19783
   725
            Symtab.map (Element.instT_type env2) tenv2)
ballarin@19783
   726
        end;
ballarin@19783
   727
ballarin@19783
   728
    fun merge_syn expr syn1 syn2 =
haftmann@19932
   729
        Symtab.merge (op = : mixfix * mixfix -> bool) (syn1, syn2)
wenzelm@23655
   730
        handle Symtab.DUP x => err_in_expr ctxt
wenzelm@23655
   731
          ("Conflicting syntax for parameter: " ^ quote x) expr;
wenzelm@20366
   732
ballarin@19783
   733
    fun params_of (expr as Locale name) =
ballarin@19783
   734
          let
wenzelm@22573
   735
            val {imports, params, ...} = the_locale thy name;
ballarin@19783
   736
            val parms = map (fst o fst) params;
wenzelm@22573
   737
            val (parms', types', syn') = params_of imports;
haftmann@27681
   738
            val all_parms = merge_lists (op =) parms' parms;
ballarin@19783
   739
            val all_types = merge_tenvs [] types' (params |> map fst |> Symtab.make);
ballarin@19783
   740
            val all_syn = merge_syn expr syn' (params |> map (apfst fst) |> Symtab.make);
ballarin@19783
   741
          in (all_parms, all_types, all_syn) end
ballarin@19783
   742
      | params_of (expr as Rename (e, xs)) =
ballarin@19783
   743
          let
ballarin@19783
   744
            val (parms', types', syn') = params_of e;
ballarin@19783
   745
            val ren = renaming xs parms';
ballarin@19783
   746
            (* renaming may reduce number of parameters *)
ballarin@19783
   747
            val new_parms = map (Element.rename ren) parms' |> distinct (op =);
ballarin@19783
   748
            val ren_syn = syn' |> Symtab.dest |> map (Element.rename_var ren);
ballarin@19783
   749
            val new_syn = fold (Symtab.insert (op =)) ren_syn Symtab.empty
ballarin@19783
   750
                handle Symtab.DUP x =>
ballarin@19783
   751
                  err_in_expr ctxt ("Conflicting syntax for parameter: " ^ quote x) expr;
wenzelm@22700
   752
            val syn_types = map (apsnd (fn mx =>
wenzelm@22700
   753
                SOME (Type.freeze_type (#1 (TypeInfer.paramify_dummies (Syntax.mixfixT mx) 0)))))
wenzelm@22700
   754
              (Symtab.dest new_syn);
ballarin@19783
   755
            val ren_types = types' |> Symtab.dest |> map (apfst (Element.rename ren));
wenzelm@20366
   756
            val (env :: _) = unify_parms ctxt []
ballarin@19783
   757
                ((ren_types |> map (apsnd SOME)) :: map single syn_types);
ballarin@19783
   758
            val new_types = fold (Symtab.insert (op =))
ballarin@19783
   759
                (map (apsnd (Element.instT_type env)) ren_types) Symtab.empty;
ballarin@19783
   760
          in (new_parms, new_types, new_syn) end
ballarin@19783
   761
      | params_of (Merge es) =
ballarin@19783
   762
          fold (fn e => fn (parms, types, syn) =>
ballarin@19783
   763
                   let
ballarin@19783
   764
                     val (parms', types', syn') = params_of e
ballarin@19783
   765
                   in
haftmann@27681
   766
                     (merge_lists (op =) parms parms', merge_tenvs [] types types',
ballarin@19783
   767
                      merge_syn e syn syn')
ballarin@19783
   768
                   end)
ballarin@19783
   769
            es ([], Symtab.empty, Symtab.empty)
ballarin@19783
   770
ballarin@19783
   771
      val (parms, types, syn) = params_of expr;
ballarin@19783
   772
    in
haftmann@27681
   773
      (merge_lists (op =) prev_parms parms, merge_tenvs fixed_params prev_types types,
ballarin@19783
   774
       merge_syn expr prev_syn syn)
ballarin@19783
   775
    end;
ballarin@19783
   776
ballarin@19783
   777
fun make_params_ids params = [(("", params), ([], Assumed []))];
ballarin@19783
   778
fun make_raw_params_elemss (params, tenv, syn) =
ballarin@19783
   779
    [((("", map (fn p => (p, Symtab.lookup tenv p)) params), Assumed []),
ballarin@19783
   780
      Int [Fixes (map (fn p =>
ballarin@19783
   781
        (p, Symtab.lookup tenv p, Symtab.lookup syn p |> the)) params)])];
ballarin@19783
   782
ballarin@19783
   783
ballarin@15596
   784
(* flatten_expr:
ballarin@15596
   785
   Extend list of identifiers by those new in locale expression expr.
ballarin@15596
   786
   Compute corresponding list of lists of locale elements (one entry per
ballarin@15596
   787
   identifier).
ballarin@15596
   788
ballarin@15596
   789
   Identifiers represent locale fragments and are in an extended form:
ballarin@15596
   790
     ((name, ps), (ax_ps, axs))
ballarin@15596
   791
   (name, ps) is the locale name with all its parameters.
ballarin@15596
   792
   (ax_ps, axs) is the locale axioms with its parameters;
ballarin@15596
   793
     axs are always taken from the top level of the locale hierarchy,
ballarin@15596
   794
     hence axioms may contain additional parameters from later fragments:
ballarin@15596
   795
     ps subset of ax_ps.  axs is either singleton or empty.
ballarin@15596
   796
ballarin@15596
   797
   Elements are enriched by identifier-like information:
ballarin@15596
   798
     (((name, ax_ps), axs), elems)
ballarin@15596
   799
   The parameters in ax_ps are the axiom parameters, but enriched by type
ballarin@15596
   800
   info: now each entry is a pair of string and typ option.  Axioms are
ballarin@15596
   801
   type-instantiated.
ballarin@15596
   802
ballarin@15596
   803
*)
ballarin@15596
   804
ballarin@16102
   805
fun flatten_expr ctxt ((prev_idents, prev_syntax), expr) =
wenzelm@12014
   806
  let
wenzelm@12014
   807
    val thy = ProofContext.theory_of ctxt;
wenzelm@12263
   808
ballarin@17000
   809
    fun rename_parms top ren ((name, ps), (parms, mode)) =
ballarin@19783
   810
        ((name, map (Element.rename ren) ps),
ballarin@19783
   811
         if top
ballarin@19783
   812
         then (map (Element.rename ren) parms,
wenzelm@21483
   813
               map_mode (map (Element.morph_witness (Element.rename_morphism ren))) mode)
ballarin@19783
   814
         else (parms, mode));
wenzelm@12263
   815
ballarin@20167
   816
    (* add (name, ps) and its registrations, recursively; adjust hyps of witnesses *)
ballarin@17000
   817
ballarin@20167
   818
    fun add_with_regs ((name, pTs), mode) (wits, ids, visited) =
ballarin@20167
   819
        if member (fn (a, (b, _)) => a = b) visited (name, map #1 pTs)
ballarin@20167
   820
        then (wits, ids, visited)
ballarin@20167
   821
        else
wenzelm@20366
   822
          let
wenzelm@20366
   823
            val {params, regs, ...} = the_locale thy name;
wenzelm@20366
   824
            val pTs' = map #1 params;
wenzelm@20366
   825
            val ren = map #1 pTs' ~~ map (fn (x, _) => (x, NONE)) pTs;
wenzelm@20366
   826
              (* dummy syntax, since required by rename *)
wenzelm@20366
   827
            val pTs'' = map (fn ((p, _), (_, T)) => (p, T)) (pTs ~~ pTs');
wenzelm@20366
   828
            val [env] = unify_parms ctxt pTs [map (apsnd SOME) pTs''];
wenzelm@20366
   829
              (* propagate parameter types, to keep them consistent *)
wenzelm@20366
   830
            val regs' = map (fn ((name, ps), wits) =>
wenzelm@20366
   831
                ((name, map (Element.rename ren) ps),
wenzelm@20366
   832
                 map (Element.transfer_witness thy) wits)) regs;
wenzelm@20366
   833
            val new_regs = regs';
wenzelm@20366
   834
            val new_ids = map fst new_regs;
wenzelm@21483
   835
            val new_idTs =
wenzelm@21483
   836
              map (apsnd (map (fn p => (p, (the o AList.lookup (op =) pTs) p)))) new_ids;
ballarin@17096
   837
wenzelm@20366
   838
            val new_wits = new_regs |> map (#2 #> map
wenzelm@21483
   839
              (Element.morph_witness
wenzelm@21483
   840
                (Element.instT_morphism thy env $>
wenzelm@21483
   841
                  Element.rename_morphism ren $>
haftmann@25669
   842
                  Element.satisfy_morphism wits)
haftmann@25669
   843
                #> Element.close_witness));
wenzelm@20366
   844
            val new_ids' = map (fn (id, wits) =>
wenzelm@20366
   845
                (id, ([], Derived wits))) (new_ids ~~ new_wits);
wenzelm@20366
   846
            val new_idTs' = map (fn ((n, pTs), (_, ([], mode))) =>
wenzelm@20366
   847
                ((n, pTs), mode)) (new_idTs ~~ new_ids');
wenzelm@20366
   848
            val new_id = ((name, map #1 pTs), ([], mode));
wenzelm@20366
   849
            val (wits', ids', visited') = fold add_with_regs new_idTs'
ballarin@20167
   850
              (wits @ flat new_wits, ids, visited @ [new_id]);
wenzelm@20366
   851
          in
wenzelm@20366
   852
            (wits', ids' @ [new_id], visited')
wenzelm@20366
   853
          end;
ballarin@17000
   854
ballarin@17000
   855
    (* distribute top-level axioms over assumed ids *)
ballarin@17000
   856
ballarin@17000
   857
    fun axiomify all_ps ((name, parms), (_, Assumed _)) axioms =
ballarin@17000
   858
        let
ballarin@17000
   859
          val {elems, ...} = the_locale thy name;
wenzelm@19482
   860
          val ts = maps
wenzelm@19482
   861
            (fn (Assumes asms, _) => maps (map #1 o #2) asms
ballarin@17000
   862
              | _ => [])
wenzelm@19482
   863
            elems;
wenzelm@19018
   864
          val (axs1, axs2) = chop (length ts) axioms;
ballarin@17000
   865
        in (((name, parms), (all_ps, Assumed axs1)), axs2) end
ballarin@17000
   866
      | axiomify all_ps (id, (_, Derived ths)) axioms =
ballarin@17000
   867
          ((id, (all_ps, Derived ths)), axioms);
ballarin@17000
   868
ballarin@17096
   869
    (* identifiers of an expression *)
ballarin@17096
   870
ballarin@15206
   871
    fun identify top (Locale name) =
ballarin@15596
   872
    (* CB: ids_ax is a list of tuples of the form ((name, ps), axs),
ballarin@15206
   873
       where name is a locale name, ps a list of parameter names and axs
ballarin@15206
   874
       a list of axioms relating to the identifier, axs is empty unless
ballarin@15206
   875
       identify at top level (top = true);
ballarin@14215
   876
       parms is accumulated list of parameters *)
wenzelm@12289
   877
          let
wenzelm@22573
   878
            val {axiom, imports, params, ...} = the_locale thy name;
ballarin@19278
   879
            val ps = map (#1 o #1) params;
wenzelm@22573
   880
            val (ids', parms') = identify false imports;
ballarin@15206
   881
                (* acyclic import dependencies *)
ballarin@19931
   882
ballarin@20167
   883
            val (_, ids'', _) = add_with_regs ((name, map #1 params), Assumed []) ([], ids', ids');
ballarin@20167
   884
            val ids_ax = if top then fst (fold_map (axiomify ps) ids'' axiom) else ids'';
haftmann@27681
   885
            in (ids_ax, merge_lists (op =) parms' ps) end
ballarin@15206
   886
      | identify top (Rename (e, xs)) =
wenzelm@12273
   887
          let
ballarin@20035
   888
            val (ids', parms') = identify top e;
wenzelm@12839
   889
            val ren = renaming xs parms'
wenzelm@18678
   890
              handle ERROR msg => err_in_locale' ctxt msg ids';
ballarin@17096
   891
wenzelm@19061
   892
            val ids'' = distinct (eq_fst (op =)) (map (rename_parms top ren) ids');
wenzelm@19482
   893
            val parms'' = distinct (op =) (maps (#2 o #1) ids'');
ballarin@20035
   894
          in (ids'', parms'') end
ballarin@15206
   895
      | identify top (Merge es) =
ballarin@20035
   896
          fold (fn e => fn (ids, parms) =>
ballarin@17000
   897
                   let
ballarin@20035
   898
                     val (ids', parms') = identify top e
ballarin@17000
   899
                   in
haftmann@27681
   900
                     (merge_alists (op =) ids ids', merge_lists (op =) parms parms')
ballarin@17000
   901
                   end)
ballarin@20035
   902
            es ([], []);
ballarin@15206
   903
ballarin@20035
   904
    fun inst_wit all_params (t, th) = let
ballarin@15206
   905
         val {hyps, prop, ...} = Thm.rep_thm th;
wenzelm@16861
   906
         val ps = map (apsnd SOME) (fold Term.add_frees (prop :: hyps) []);
ballarin@15206
   907
         val [env] = unify_parms ctxt all_params [ps];
wenzelm@18137
   908
         val t' = Element.instT_term env t;
wenzelm@18137
   909
         val th' = Element.instT_thm thy env th;
wenzelm@18123
   910
       in (t', th') end;
ballarin@17000
   911
ballarin@20035
   912
    fun eval all_params tenv syn ((name, params), (locale_params, mode)) =
ballarin@20035
   913
      let
ballarin@20035
   914
        val {params = ps_mx, elems = elems_stamped, ...} = the_locale thy name;
ballarin@20035
   915
        val elems = map fst elems_stamped;
ballarin@20035
   916
        val ps = map fst ps_mx;
ballarin@20035
   917
        fun lookup_syn x = (case Symtab.lookup syn x of SOME Structure => NONE | opt => opt);
ballarin@20035
   918
        val locale_params' = map (fn p => (p, Symtab.lookup tenv p |> the)) locale_params;
ballarin@20035
   919
        val mode' = map_mode (map (Element.map_witness (inst_wit all_params))) mode;
ballarin@20035
   920
        val ren = map fst ps ~~ map (fn p => (p, lookup_syn p)) params;
ballarin@20035
   921
        val [env] = unify_parms ctxt all_params [map (apfst (Element.rename ren) o apsnd SOME) ps];
wenzelm@21499
   922
        val elem_morphism =
wenzelm@21499
   923
          Element.rename_morphism ren $>
ballarin@26645
   924
          Morphism.name_morphism (params_qualified params) $>
wenzelm@21499
   925
          Element.instT_morphism thy env;
wenzelm@21499
   926
        val elems' = map (Element.morph_ctxt elem_morphism) elems;
wenzelm@21499
   927
      in (((name, map (apsnd SOME) locale_params'), mode'), elems') end;
ballarin@20035
   928
ballarin@20035
   929
    (* parameters, their types and syntax *)
ballarin@20035
   930
    val (all_params', tenv, syn) = params_of_expr ctxt [] expr ([], Symtab.empty, Symtab.empty);
ballarin@20035
   931
    val all_params = map (fn p => (p, Symtab.lookup tenv p |> the)) all_params';
ballarin@20035
   932
    (* compute identifiers and syntax, merge with previous ones *)
ballarin@20035
   933
    val (ids, _) = identify true expr;
haftmann@20951
   934
    val idents = subtract (eq_fst (op =)) prev_idents ids;
ballarin@20035
   935
    val syntax = merge_syntax ctxt ids (syn, prev_syntax);
ballarin@20035
   936
    (* type-instantiate elements *)
ballarin@20035
   937
    val final_elemss = map (eval all_params tenv syntax) idents;
ballarin@16102
   938
  in ((prev_idents @ idents, syntax), final_elemss) end;
wenzelm@12046
   939
wenzelm@12510
   940
end;
wenzelm@12510
   941
wenzelm@12070
   942
wenzelm@12529
   943
(* activate elements *)
wenzelm@12273
   944
wenzelm@12510
   945
local
wenzelm@12510
   946
wenzelm@21686
   947
fun axioms_export axs _ As =
wenzelm@21686
   948
  (Element.satisfy_thm axs #> Drule.implies_intr_list (Library.drop (length axs, As)), fn t => t);
wenzelm@12263
   949
ballarin@17000
   950
ballarin@17000
   951
(* NB: derived ids contain only facts at this stage *)
ballarin@17000
   952
haftmann@27681
   953
fun activate_elem _ _ (Fixes fixes) (ctxt, mode) =
haftmann@27681
   954
      ([], (ctxt |> ProofContext.add_fixes_i fixes |> snd, mode))
haftmann@27681
   955
  | activate_elem _ _ (Constrains _) (ctxt, mode) =
haftmann@27681
   956
      ([], (ctxt, mode))
haftmann@27681
   957
  | activate_elem ax_in_ctxt _ (Assumes asms) (ctxt, Assumed axs) =
wenzelm@13399
   958
      let
wenzelm@18728
   959
        val asms' = Attrib.map_specs (Attrib.attribute_i (ProofContext.theory_of ctxt)) asms;
wenzelm@19482
   960
        val ts = maps (map #1 o #2) asms';
wenzelm@19018
   961
        val (ps, qs) = chop (length ts) axs;
wenzelm@17856
   962
        val (_, ctxt') =
wenzelm@21370
   963
          ctxt |> fold Variable.auto_fixes ts
ballarin@19931
   964
          |> ProofContext.add_assms_i (axioms_export (if ax_in_ctxt then ps else [])) asms';
haftmann@27681
   965
      in ([], (ctxt', Assumed qs)) end
haftmann@27681
   966
  | activate_elem _ _ (Assumes asms) (ctxt, Derived ths) =
haftmann@27681
   967
      ([], (ctxt, Derived ths))
haftmann@27681
   968
  | activate_elem _ _ (Defines defs) (ctxt, Assumed axs) =
ballarin@15596
   969
      let
wenzelm@18728
   970
        val defs' = Attrib.map_specs (Attrib.attribute_i (ProofContext.theory_of ctxt)) defs;
wenzelm@19732
   971
        val asms = defs' |> map (fn ((name, atts), (t, ps)) =>
wenzelm@19732
   972
            let val ((c, _), t') = LocalDefs.cert_def ctxt t
wenzelm@20872
   973
            in (t', ((Thm.def_name_optional c name, atts), [(t', ps)])) end);
wenzelm@17856
   974
        val (_, ctxt') =
wenzelm@21370
   975
          ctxt |> fold (Variable.auto_fixes o #1) asms
wenzelm@19732
   976
          |> ProofContext.add_assms_i LocalDefs.def_export (map #2 asms);
haftmann@27681
   977
      in ([], (ctxt', Assumed axs)) end
haftmann@27681
   978
  | activate_elem _ _ (Defines defs) (ctxt, Derived ths) =
haftmann@27681
   979
      ([], (ctxt, Derived ths))
haftmann@27681
   980
  | activate_elem _ is_ext (Notes (kind, facts)) (ctxt, mode) =
ballarin@15596
   981
      let
wenzelm@18728
   982
        val facts' = Attrib.map_facts (Attrib.attribute_i (ProofContext.theory_of ctxt)) facts;
wenzelm@21441
   983
        val (res, ctxt') = ctxt |> ProofContext.note_thmss_i kind facts';
haftmann@27681
   984
      in (if is_ext then res else [], (ctxt', mode)) end;
wenzelm@12502
   985
ballarin@19931
   986
fun activate_elems ax_in_ctxt (((name, ps), mode), elems) ctxt =
ballarin@17033
   987
  let
wenzelm@18123
   988
    val thy = ProofContext.theory_of ctxt;
haftmann@27681
   989
    val (res, (ctxt', _)) = fold_map (activate_elem ax_in_ctxt (name = ""))
haftmann@27681
   990
        elems (ProofContext.qualified_names ctxt, mode)
wenzelm@21441
   991
      handle ERROR msg => err_in_locale ctxt msg [(name, map fst ps)];
ballarin@15696
   992
    val ctxt'' = if name = "" then ctxt'
ballarin@15696
   993
          else let
ballarin@15696
   994
              val ps' = map (fn (n, SOME T) => Free (n, T)) ps;
ballarin@24787
   995
            in if test_local_registration ctxt' (name, ps') then ctxt'
ballarin@24787
   996
              else let
ballarin@25286
   997
                  val ctxt'' = put_local_registration (name, ps') ((true, ""), [])
ballarin@25286
   998
                    (Morphism.identity, ((Vartab.empty, []), (Vartab.empty, []) )) ctxt'
ballarin@24787
   999
                in case mode of
ballarin@24787
  1000
                    Assumed axs =>
ballarin@24787
  1001
                      fold (add_local_witness (name, ps') o
ballarin@24787
  1002
                        Element.assume_witness thy o Element.witness_prop) axs ctxt''
haftmann@25669
  1003
                  | Derived ths =>
haftmann@25669
  1004
                     fold (add_local_witness (name, ps')) ths ctxt''
ballarin@24787
  1005
                end
ballarin@15696
  1006
            end
wenzelm@16144
  1007
  in (ProofContext.restore_naming ctxt ctxt'', res) end;
wenzelm@13399
  1008
ballarin@19931
  1009
fun activate_elemss ax_in_ctxt prep_facts =
ballarin@17000
  1010
    fold_map (fn (((name, ps), mode), raw_elems) => fn ctxt =>
ballarin@17000
  1011
      let
ballarin@17000
  1012
        val elems = map (prep_facts ctxt) raw_elems;
wenzelm@19482
  1013
        val (ctxt', res) = apsnd flat
ballarin@19931
  1014
            (activate_elems ax_in_ctxt (((name, ps), mode), elems) ctxt);
wenzelm@21530
  1015
        val elems' = elems |> map (Element.map_ctxt_attrib Args.closure);
ballarin@19931
  1016
      in (((((name, ps), mode), elems'), res), ctxt') end);
wenzelm@12834
  1017
wenzelm@12546
  1018
in
wenzelm@12546
  1019
haftmann@27681
  1020
(* CB: activate_facts prep_facts elemss ctxt,
ballarin@15206
  1021
   where elemss is a list of pairs consisting of identifiers and
ballarin@15206
  1022
   context elements, extends ctxt by the context elements yielding
haftmann@27681
  1023
   ctxt' and returns ((elemss', facts), ctxt').
ballarin@15206
  1024
   Identifiers in the argument are of the form ((name, ps), axs) and
ballarin@15206
  1025
   assumptions use the axioms in the identifiers to set up exporters
ballarin@15206
  1026
   in ctxt'.  elemss' does not contain identifiers and is obtained
ballarin@15206
  1027
   from elemss and the intermediate context with prep_facts.
wenzelm@15703
  1028
   If read_facts or cert_facts is used for prep_facts, these also remove
ballarin@14508
  1029
   the internal/external markers from elemss. *)
ballarin@14508
  1030
haftmann@27681
  1031
fun activate_facts ax_in_ctxt prep_facts args =
haftmann@27681
  1032
  activate_elemss ax_in_ctxt prep_facts args
haftmann@27681
  1033
  #>> (apsnd flat o split_list);
wenzelm@15703
  1034
wenzelm@12510
  1035
end;
wenzelm@12510
  1036
wenzelm@12307
  1037
ballarin@15696
  1038
wenzelm@18137
  1039
(** prepare locale elements **)
wenzelm@12529
  1040
wenzelm@12529
  1041
(* expressions *)
wenzelm@12529
  1042
wenzelm@16458
  1043
fun intern_expr thy (Locale xname) = Locale (intern thy xname)
wenzelm@16458
  1044
  | intern_expr thy (Merge exprs) = Merge (map (intern_expr thy) exprs)
wenzelm@16458
  1045
  | intern_expr thy (Rename (expr, xs)) = Rename (intern_expr thy expr, xs);
wenzelm@12529
  1046
wenzelm@12529
  1047
wenzelm@12529
  1048
(* propositions and bindings *)
wenzelm@12529
  1049
ballarin@17000
  1050
(* flatten (ctxt, prep_expr) ((ids, syn), expr)
ballarin@17000
  1051
   normalises expr (which is either a locale
ballarin@14508
  1052
   expression or a single context element) wrt.
ballarin@14508
  1053
   to the list ids of already accumulated identifiers.
ballarin@19783
  1054
   It returns ((ids', syn'), elemss) where ids' is an extension of ids
ballarin@14508
  1055
   with identifiers generated for expr, and elemss is the list of
ballarin@16102
  1056
   context elements generated from expr.
ballarin@16102
  1057
   syn and syn' are symtabs mapping parameter names to their syntax.  syn'
ballarin@16102
  1058
   is an extension of syn.
ballarin@16102
  1059
   For details, see flatten_expr.
ballarin@16102
  1060
ballarin@15596
  1061
   Additionally, for a locale expression, the elems are grouped into a single
ballarin@15596
  1062
   Int; individual context elements are marked Ext.  In this case, the
ballarin@15596
  1063
   identifier-like information of the element is as follows:
ballarin@15596
  1064
   - for Fixes: (("", ps), []) where the ps have type info NONE
ballarin@15596
  1065
   - for other elements: (("", []), []).
ballarin@15206
  1066
   The implementation of activate_facts relies on identifier names being
ballarin@15206
  1067
   empty strings for external elements.
ballarin@15596
  1068
*)
ballarin@14508
  1069
ballarin@16102
  1070
fun flatten (ctxt, _) ((ids, syn), Elem (Fixes fixes)) = let
wenzelm@18137
  1071
        val ids' = ids @ [(("", map #1 fixes), ([], Assumed []))]
ballarin@16102
  1072
      in
wenzelm@18137
  1073
        ((ids',
wenzelm@18137
  1074
         merge_syntax ctxt ids'
wenzelm@18137
  1075
           (syn, Symtab.make (map (fn fx => (#1 fx, #3 fx)) fixes))
wenzelm@23655
  1076
           handle Symtab.DUP x => err_in_locale ctxt
wenzelm@23655
  1077
             ("Conflicting syntax for parameter: " ^ quote x)
ballarin@16102
  1078
             (map #1 ids')),
wenzelm@18137
  1079
         [((("", map (rpair NONE o #1) fixes), Assumed []), Ext (Fixes fixes))])
ballarin@16102
  1080
      end
ballarin@16102
  1081
  | flatten _ ((ids, syn), Elem elem) =
ballarin@17000
  1082
      ((ids @ [(("", []), ([], Assumed []))], syn), [((("", []), Assumed []), Ext elem)])
ballarin@16102
  1083
  | flatten (ctxt, prep_expr) ((ids, syn), Expr expr) =
ballarin@16102
  1084
      apsnd (map (apsnd Int)) (flatten_expr ctxt ((ids, syn), prep_expr expr));
ballarin@14508
  1085
wenzelm@12529
  1086
local
wenzelm@12529
  1087
wenzelm@12839
  1088
local
wenzelm@12839
  1089
haftmann@27681
  1090
fun declare_int_elem (Fixes fixes) ctxt =
haftmann@27681
  1091
      ([], ctxt |> ProofContext.add_fixes_i (map (fn (x, T, mx) =>
haftmann@27681
  1092
        (x, Option.map (Term.map_type_tfree (TypeInfer.param 0)) T, mx)) fixes) |> snd)
haftmann@27681
  1093
  | declare_int_elem _ ctxt = ([], ctxt);
haftmann@27681
  1094
haftmann@27681
  1095
fun declare_ext_elem prep_vars (Fixes fixes) ctxt =
wenzelm@18671
  1096
      let val (vars, _) = prep_vars fixes ctxt
haftmann@27681
  1097
      in ([], ctxt |> ProofContext.add_fixes_i vars |> snd) end
haftmann@27681
  1098
  | declare_ext_elem prep_vars (Constrains csts) ctxt =
wenzelm@18671
  1099
      let val (_, ctxt') = prep_vars (map (fn (x, T) => (x, SOME T, NoSyn)) csts) ctxt
haftmann@27681
  1100
      in ([], ctxt') end
haftmann@27681
  1101
  | declare_ext_elem _ (Assumes asms) ctxt = (map #2 asms, ctxt)
haftmann@27681
  1102
  | declare_ext_elem _ (Defines defs) ctxt = (map (fn (_, (t, ps)) => [(t, ps)]) defs, ctxt)
haftmann@27681
  1103
  | declare_ext_elem _ (Notes _) ctxt = ([], ctxt);
haftmann@27681
  1104
haftmann@27681
  1105
fun declare_elems prep_vars (((name, ps), Assumed _), elems) ctxt = ((case elems
haftmann@27681
  1106
     of Int es => fold_map declare_int_elem es ctxt
haftmann@27681
  1107
      | Ext e => declare_ext_elem prep_vars e ctxt |>> single)
haftmann@27681
  1108
          handle ERROR msg => err_in_locale ctxt msg [(name, map fst ps)])
haftmann@27681
  1109
  | declare_elems _ ((_, Derived _), elems) ctxt = ([], ctxt);
wenzelm@12727
  1110
wenzelm@12839
  1111
in
wenzelm@12839
  1112
wenzelm@18671
  1113
fun declare_elemss prep_vars fixed_params raw_elemss ctxt =
wenzelm@12727
  1114
  let
ballarin@14215
  1115
    (* CB: fix of type bug of goal in target with context elements.
ballarin@14215
  1116
       Parameters new in context elements must receive types that are
ballarin@14215
  1117
       distinct from types of parameters in target (fixed_params).  *)
ballarin@14215
  1118
    val ctxt_with_fixed =
wenzelm@19900
  1119
      fold Variable.declare_term (map Free fixed_params) ctxt;
wenzelm@12727
  1120
    val int_elemss =
wenzelm@12727
  1121
      raw_elemss
wenzelm@19482
  1122
      |> map_filter (fn (id, Int es) => SOME (id, es) | _ => NONE)
ballarin@14215
  1123
      |> unify_elemss ctxt_with_fixed fixed_params;
haftmann@27681
  1124
    val (raw_elemss', _) =
haftmann@27681
  1125
      fold_map (curry (fn ((id, Int _), (_, es) :: elemss) => ((id, Int es), elemss) | x => x))
haftmann@27681
  1126
        raw_elemss int_elemss;
haftmann@27681
  1127
  in fold_map (declare_elems prep_vars) raw_elemss' ctxt end;
wenzelm@12529
  1128
wenzelm@12839
  1129
end;
wenzelm@12529
  1130
wenzelm@12839
  1131
local
wenzelm@12839
  1132
wenzelm@12839
  1133
val norm_term = Envir.beta_norm oo Term.subst_atomic;
wenzelm@12839
  1134
wenzelm@16458
  1135
fun abstract_thm thy eq =
wenzelm@16458
  1136
  Thm.assume (Thm.cterm_of thy eq) |> Drule.gen_all |> Drule.abs_def;
wenzelm@12502
  1137
wenzelm@18190
  1138
fun bind_def ctxt (name, ps) eq (xs, env, ths) =
wenzelm@12839
  1139
  let
wenzelm@18831
  1140
    val ((y, T), b) = LocalDefs.abs_def eq;
wenzelm@13308
  1141
    val b' = norm_term env b;
wenzelm@16458
  1142
    val th = abstract_thm (ProofContext.theory_of ctxt) eq;
wenzelm@13308
  1143
    fun err msg = err_in_locale ctxt (msg ^ ": " ^ quote y) [(name, map fst ps)];
wenzelm@12839
  1144
  in
wenzelm@21962
  1145
    exists (equal y o #1) xs andalso
wenzelm@21962
  1146
      err "Attempt to define previously specified variable";
wenzelm@21962
  1147
    exists (fn (Free (y', _), _) => y = y' | _ => false) env andalso
wenzelm@21962
  1148
      err "Attempt to redefine variable";
wenzelm@16861
  1149
    (Term.add_frees b' xs, (Free (y, T), b') :: env, th :: ths)
wenzelm@12839
  1150
  end;
wenzelm@12575
  1151
ballarin@17000
  1152
ballarin@17000
  1153
(* CB: for finish_elems (Int and Ext),
ballarin@17000
  1154
   extracts specification, only of assumed elements *)
ballarin@15206
  1155
wenzelm@18190
  1156
fun eval_text _ _ _ (Fixes _) text = text
wenzelm@18190
  1157
  | eval_text _ _ _ (Constrains _) text = text
wenzelm@18190
  1158
  | eval_text _ (_, Assumed _) is_ext (Assumes asms)
wenzelm@18190
  1159
        (((exts, exts'), (ints, ints')), (xs, env, defs)) =
wenzelm@13394
  1160
      let
wenzelm@19482
  1161
        val ts = maps (map #1 o #2) asms;
wenzelm@13394
  1162
        val ts' = map (norm_term env) ts;
wenzelm@13394
  1163
        val spec' =
wenzelm@13394
  1164
          if is_ext then ((exts @ ts, exts' @ ts'), (ints, ints'))
wenzelm@13394
  1165
          else ((exts, exts'), (ints @ ts, ints' @ ts'));
wenzelm@16861
  1166
      in (spec', (fold Term.add_frees ts' xs, env, defs)) end
wenzelm@18190
  1167
  | eval_text _ (_, Derived _) _ (Assumes _) text = text
wenzelm@18190
  1168
  | eval_text ctxt (id, Assumed _) _ (Defines defs) (spec, binds) =
wenzelm@18190
  1169
      (spec, fold (bind_def ctxt id o #1 o #2) defs binds)
wenzelm@18190
  1170
  | eval_text _ (_, Derived _) _ (Defines _) text = text
wenzelm@18190
  1171
  | eval_text _ _ _ (Notes _) text = text;
wenzelm@13308
  1172
ballarin@17000
  1173
ballarin@17000
  1174
(* for finish_elems (Int),
ballarin@17000
  1175
   remove redundant elements of derived identifiers,
ballarin@17000
  1176
   turn assumptions and definitions into facts,
wenzelm@21483
  1177
   satisfy hypotheses of facts *)
ballarin@17000
  1178
ballarin@17096
  1179
fun finish_derived _ _ (Assumed _) (Fixes fixes) = SOME (Fixes fixes)
ballarin@17096
  1180
  | finish_derived _ _ (Assumed _) (Constrains csts) = SOME (Constrains csts)
ballarin@17096
  1181
  | finish_derived _ _ (Assumed _) (Assumes asms) = SOME (Assumes asms)
ballarin@17096
  1182
  | finish_derived _ _ (Assumed _) (Defines defs) = SOME (Defines defs)
ballarin@17096
  1183
ballarin@17000
  1184
  | finish_derived _ _ (Derived _) (Fixes _) = NONE
ballarin@17000
  1185
  | finish_derived _ _ (Derived _) (Constrains _) = NONE
wenzelm@21483
  1186
  | finish_derived sign satisfy (Derived _) (Assumes asms) = asms
ballarin@17096
  1187
      |> map (apsnd (map (fn (a, _) => ([Thm.assume (cterm_of sign a)], []))))
wenzelm@21441
  1188
      |> pair Thm.assumptionK |> Notes
wenzelm@21483
  1189
      |> Element.morph_ctxt satisfy |> SOME
wenzelm@21483
  1190
  | finish_derived sign satisfy (Derived _) (Defines defs) = defs
ballarin@17096
  1191
      |> map (apsnd (fn (d, _) => [([Thm.assume (cterm_of sign d)], [])]))
wenzelm@21441
  1192
      |> pair Thm.definitionK |> Notes
wenzelm@21483
  1193
      |> Element.morph_ctxt satisfy |> SOME
ballarin@17000
  1194
wenzelm@21483
  1195
  | finish_derived _ satisfy _ (Notes facts) = Notes facts
wenzelm@21483
  1196
      |> Element.morph_ctxt satisfy |> SOME;
ballarin@17000
  1197
ballarin@15206
  1198
(* CB: for finish_elems (Ext) *)
ballarin@15206
  1199
wenzelm@13308
  1200
fun closeup _ false elem = elem
wenzelm@13308
  1201
  | closeup ctxt true elem =
wenzelm@12839
  1202
      let
wenzelm@13308
  1203
        fun close_frees t =
wenzelm@26206
  1204
          let
wenzelm@26206
  1205
            val rev_frees =
wenzelm@26206
  1206
              Term.fold_aterms (fn Free (x, T) =>
wenzelm@26206
  1207
                if Variable.is_fixed ctxt x then I else insert (op =) (x, T) | _ => I) t [];
wenzelm@26299
  1208
          in Term.list_all_free (rev rev_frees, t) end;
wenzelm@13308
  1209
wenzelm@13308
  1210
        fun no_binds [] = []
wenzelm@18678
  1211
          | no_binds _ = error "Illegal term bindings in locale element";
wenzelm@13308
  1212
      in
wenzelm@13308
  1213
        (case elem of
wenzelm@13308
  1214
          Assumes asms => Assumes (asms |> map (fn (a, propps) =>
wenzelm@19585
  1215
            (a, map (fn (t, ps) => (close_frees t, no_binds ps)) propps)))
wenzelm@13308
  1216
        | Defines defs => Defines (defs |> map (fn (a, (t, ps)) =>
wenzelm@18831
  1217
            (a, (close_frees (#2 (LocalDefs.cert_def ctxt t)), no_binds ps))))
wenzelm@13308
  1218
        | e => e)
wenzelm@13308
  1219
      end;
wenzelm@12839
  1220
wenzelm@12502
  1221
wenzelm@12839
  1222
fun finish_ext_elem parms _ (Fixes fixes, _) = Fixes (map (fn (x, _, mx) =>
haftmann@17271
  1223
      (x, AList.lookup (op =) parms x, mx)) fixes)
wenzelm@18899
  1224
  | finish_ext_elem parms _ (Constrains _, _) = Constrains []
wenzelm@12839
  1225
  | finish_ext_elem _ close (Assumes asms, propp) =
wenzelm@12839
  1226
      close (Assumes (map #1 asms ~~ propp))
wenzelm@12839
  1227
  | finish_ext_elem _ close (Defines defs, propp) =
wenzelm@19585
  1228
      close (Defines (map #1 defs ~~ map (fn [(t, ps)] => (t, ps)) propp))
wenzelm@12839
  1229
  | finish_ext_elem _ _ (Notes facts, _) = Notes facts;
wenzelm@12839
  1230
ballarin@17000
  1231
ballarin@15206
  1232
(* CB: finish_parms introduces type info from parms to identifiers *)
skalberg@15531
  1233
(* CB: only needed for types that have been NONE so far???
ballarin@15206
  1234
   If so, which are these??? *)
ballarin@15206
  1235
ballarin@17000
  1236
fun finish_parms parms (((name, ps), mode), elems) =
haftmann@19932
  1237
  (((name, map (fn (x, _) => (x, AList.lookup (op = : string * string -> bool) parms x)) ps), mode), elems);
wenzelm@12839
  1238
ballarin@17000
  1239
fun finish_elems ctxt parms _ ((text, wits), ((id, Int e), _)) =
wenzelm@12839
  1240
      let
ballarin@17000
  1241
        val [(id' as (_, mode), es)] = unify_elemss ctxt parms [(id, e)];
ballarin@17000
  1242
        val wits' = case mode of Assumed _ => wits | Derived ths => wits @ ths;
wenzelm@18190
  1243
        val text' = fold (eval_text ctxt id' false) es text;
wenzelm@19482
  1244
        val es' = map_filter
wenzelm@21483
  1245
          (finish_derived (ProofContext.theory_of ctxt) (Element.satisfy_morphism wits') mode) es;
ballarin@17000
  1246
      in ((text', wits'), (id', map Int es')) end
ballarin@17000
  1247
  | finish_elems ctxt parms do_close ((text, wits), ((id, Ext e), [propp])) =
wenzelm@13308
  1248
      let
wenzelm@13308
  1249
        val e' = finish_ext_elem parms (closeup ctxt do_close) (e, propp);
wenzelm@18190
  1250
        val text' = eval_text ctxt id true e' text;
ballarin@17000
  1251
      in ((text', wits), (id, [Ext e'])) end
wenzelm@12839
  1252
wenzelm@12839
  1253
in
wenzelm@12510
  1254
ballarin@15206
  1255
(* CB: only called by prep_elemss *)
ballarin@15206
  1256
wenzelm@13375
  1257
fun finish_elemss ctxt parms do_close =
wenzelm@13375
  1258
  foldl_map (apsnd (finish_parms parms) o finish_elems ctxt parms do_close);
wenzelm@12839
  1259
wenzelm@12839
  1260
end;
wenzelm@12839
  1261
ballarin@16736
  1262
ballarin@19942
  1263
(* Remove duplicate Defines elements: temporary workaround to fix Afp/Category. *)
ballarin@19942
  1264
ballarin@19942
  1265
fun defs_ord (defs1, defs2) =
ballarin@19942
  1266
    list_ord (fn ((_, (d1, _)), (_, (d2, _))) =>
ballarin@19942
  1267
      Term.fast_term_ord (d1, d2)) (defs1, defs2);
ballarin@19942
  1268
structure Defstab =
ballarin@19942
  1269
    TableFun(type key = ((string * Attrib.src list) * (term * term list)) list
ballarin@19942
  1270
        val ord = defs_ord);
ballarin@19942
  1271
ballarin@19942
  1272
fun rem_dup_defs es ds =
ballarin@19942
  1273
    fold_map (fn e as (Defines defs) => (fn ds =>
ballarin@19942
  1274
                 if Defstab.defined ds defs
ballarin@19942
  1275
                 then (Defines [], ds)
ballarin@19942
  1276
                 else (e, Defstab.update (defs, ()) ds))
ballarin@19942
  1277
               | e => (fn ds => (e, ds))) es ds;
ballarin@19942
  1278
fun rem_dup_elemss (Int es) ds = apfst Int (rem_dup_defs es ds)
ballarin@19942
  1279
  | rem_dup_elemss (Ext e) ds = (Ext e, ds);
ballarin@19942
  1280
fun rem_dup_defines raw_elemss =
ballarin@19942
  1281
    fold_map (fn (id as (_, (Assumed _)), es) => (fn ds =>
ballarin@19942
  1282
                     apfst (pair id) (rem_dup_elemss es ds))
ballarin@19942
  1283
               | (id as (_, (Derived _)), es) => (fn ds =>
ballarin@19942
  1284
                     ((id, es), ds))) raw_elemss Defstab.empty |> #1;
ballarin@19942
  1285
ballarin@16736
  1286
(* CB: type inference and consistency checks for locales.
ballarin@16736
  1287
ballarin@16736
  1288
   Works by building a context (through declare_elemss), extracting the
ballarin@16736
  1289
   required information and adjusting the context elements (finish_elemss).
ballarin@16736
  1290
   Can also universally close free vars in assms and defs.  This is only
ballarin@17000
  1291
   needed for Ext elements and controlled by parameter do_close.
ballarin@17000
  1292
ballarin@17000
  1293
   Only elements of assumed identifiers are considered.
ballarin@16736
  1294
*)
ballarin@15127
  1295
wenzelm@18671
  1296
fun prep_elemss prep_vars prepp do_close context fixed_params raw_elemss raw_concl =
wenzelm@12529
  1297
  let
ballarin@15127
  1298
    (* CB: contexts computed in the course of this function are discarded.
ballarin@15127
  1299
       They are used for type inference and consistency checks only. *)
ballarin@15206
  1300
    (* CB: fixed_params are the parameters (with types) of the target locale,
ballarin@15206
  1301
       empty list if there is no target. *)
ballarin@14508
  1302
    (* CB: raw_elemss are list of pairs consisting of identifiers and
ballarin@14508
  1303
       context elements, the latter marked as internal or external. *)
ballarin@19942
  1304
    val raw_elemss = rem_dup_defines raw_elemss;
haftmann@27681
  1305
    val (raw_proppss, raw_ctxt) = declare_elemss prep_vars fixed_params raw_elemss context;
ballarin@14508
  1306
    (* CB: raw_ctxt is context with additional fixed variables derived from
ballarin@14508
  1307
       the fixes elements in raw_elemss,
ballarin@14508
  1308
       raw_proppss contains assumptions and definitions from the
ballarin@15206
  1309
       external elements in raw_elemss. *)
haftmann@18550
  1310
    fun prep_prop raw_propp (raw_ctxt, raw_concl)  =
haftmann@18450
  1311
      let
haftmann@18450
  1312
        (* CB: add type information from fixed_params to context (declare_term) *)
haftmann@18450
  1313
        (* CB: process patterns (conclusion and external elements only) *)
haftmann@18450
  1314
        val (ctxt, all_propp) =
wenzelm@19900
  1315
          prepp (fold Variable.declare_term (map Free fixed_params) raw_ctxt, raw_concl @ raw_propp);
haftmann@18450
  1316
        (* CB: add type information from conclusion and external elements to context *)
wenzelm@19900
  1317
        val ctxt = fold Variable.declare_term (maps (map fst) all_propp) ctxt;
haftmann@18450
  1318
        (* CB: resolve schematic variables (patterns) in conclusion and external elements. *)
haftmann@18450
  1319
        val all_propp' = map2 (curry (op ~~))
haftmann@18450
  1320
          (#1 (#2 (ProofContext.bind_propp_schematic_i (ctxt, all_propp)))) (map (map snd) all_propp);
wenzelm@19018
  1321
        val (concl, propp) = chop (length raw_concl) all_propp';
haftmann@18550
  1322
      in (propp, (ctxt, concl)) end
ballarin@15206
  1323
haftmann@18550
  1324
    val (proppss, (ctxt, concl)) =
haftmann@18550
  1325
      (fold_burrow o fold_burrow) prep_prop raw_proppss (raw_ctxt, raw_concl);
wenzelm@12502
  1326
ballarin@15206
  1327
    (* CB: obtain all parameters from identifier part of raw_elemss *)
ballarin@15206
  1328
    val xs = map #1 (params_of' raw_elemss);
wenzelm@12727
  1329
    val typing = unify_frozen ctxt 0
wenzelm@19900
  1330
      (map (Variable.default_type raw_ctxt) xs)
wenzelm@19900
  1331
      (map (Variable.default_type ctxt) xs);
wenzelm@12529
  1332
    val parms = param_types (xs ~~ typing);
ballarin@14508
  1333
    (* CB: parms are the parameters from raw_elemss, with correct typing. *)
wenzelm@12273
  1334
ballarin@14508
  1335
    (* CB: extract information from assumes and defines elements
ballarin@16169
  1336
       (fixes, constrains and notes in raw_elemss don't have an effect on
ballarin@16169
  1337
       text and elemss), compute final form of context elements. *)
ballarin@17000
  1338
    val ((text, _), elemss) = finish_elemss ctxt parms do_close
ballarin@17000
  1339
      ((((([], []), ([], [])), ([], [], [])), []), raw_elemss ~~ proppss);
ballarin@14508
  1340
    (* CB: text has the following structure:
ballarin@14508
  1341
           (((exts, exts'), (ints, ints')), (xs, env, defs))
ballarin@14508
  1342
       where
ballarin@14508
  1343
         exts: external assumptions (terms in external assumes elements)
ballarin@14508
  1344
         exts': dito, normalised wrt. env
ballarin@14508
  1345
         ints: internal assumptions (terms in internal assumes elements)
ballarin@14508
  1346
         ints': dito, normalised wrt. env
ballarin@14508
  1347
         xs: the free variables in exts' and ints' and rhss of definitions,
ballarin@14508
  1348
           this includes parameters except defined parameters
ballarin@14508
  1349
         env: list of term pairs encoding substitutions, where the first term
ballarin@14508
  1350
           is a free variable; substitutions represent defines elements and
ballarin@14508
  1351
           the rhs is normalised wrt. the previous env
ballarin@14508
  1352
         defs: theorems representing the substitutions from defines elements
ballarin@14508
  1353
           (thms are normalised wrt. env).
ballarin@14508
  1354
       elemss is an updated version of raw_elemss:
ballarin@16169
  1355
         - type info added to Fixes and modified in Constrains
ballarin@14508
  1356
         - axiom and definition statement replaced by corresponding one
ballarin@14508
  1357
           from proppss in Assumes and Defines
ballarin@14508
  1358
         - Facts unchanged
ballarin@14508
  1359
       *)
wenzelm@13308
  1360
  in ((parms, elemss, concl), text) end;
wenzelm@12502
  1361
wenzelm@12502
  1362
in
wenzelm@12502
  1363
wenzelm@18671
  1364
fun read_elemss x = prep_elemss ProofContext.read_vars ProofContext.read_propp_schematic x;
wenzelm@18671
  1365
fun cert_elemss x = prep_elemss ProofContext.cert_vars ProofContext.cert_propp_schematic x;
wenzelm@12529
  1366
wenzelm@12529
  1367
end;
wenzelm@12529
  1368
wenzelm@12529
  1369
wenzelm@15703
  1370
(* facts and attributes *)
wenzelm@12529
  1371
wenzelm@12529
  1372
local
wenzelm@12529
  1373
wenzelm@20965
  1374
fun check_name name =
wenzelm@18678
  1375
  if NameSpace.is_qualified name then error ("Illegal qualified name: " ^ quote name)
wenzelm@15703
  1376
  else name;
wenzelm@12529
  1377
wenzelm@21499
  1378
fun prep_facts _ _ _ ctxt (Int elem) = elem
wenzelm@21499
  1379
      |> Element.morph_ctxt (Morphism.thm_morphism (Thm.transfer (ProofContext.theory_of ctxt)))
wenzelm@20965
  1380
  | prep_facts prep_name get intern ctxt (Ext elem) = elem |> Element.map_ctxt
wenzelm@15703
  1381
     {var = I, typ = I, term = I,
wenzelm@18678
  1382
      name = prep_name,
wenzelm@15703
  1383
      fact = get ctxt,
wenzelm@16458
  1384
      attrib = Args.assignable o intern (ProofContext.theory_of ctxt)};
wenzelm@12529
  1385
wenzelm@12529
  1386
in
wenzelm@12529
  1387
wenzelm@26345
  1388
fun read_facts x = prep_facts check_name ProofContext.get_fact Attrib.intern_src x;
wenzelm@20965
  1389
fun cert_facts x = prep_facts I (K I) (K I) x;
wenzelm@12529
  1390
wenzelm@12529
  1391
end;
wenzelm@12529
  1392
wenzelm@12529
  1393
ballarin@19931
  1394
(* Get the specification of a locale *)
ballarin@18795
  1395
wenzelm@19780
  1396
(*The global specification is made from the parameters and global
wenzelm@19780
  1397
  assumptions, the local specification from the parameters and the
wenzelm@19780
  1398
  local assumptions.*)
ballarin@18795
  1399
ballarin@18795
  1400
local
ballarin@18795
  1401
ballarin@18795
  1402
fun gen_asms_of get thy name =
ballarin@18795
  1403
  let
ballarin@18795
  1404
    val ctxt = ProofContext.init thy;
ballarin@18795
  1405
    val (_, raw_elemss) = flatten (ctxt, I) (([], Symtab.empty), Expr (Locale name));
ballarin@18795
  1406
    val ((_, elemss, _), _) = read_elemss false ctxt [] raw_elemss [];
ballarin@18795
  1407
  in
ballarin@18890
  1408
    elemss |> get
wenzelm@19780
  1409
      |> maps (fn (_, es) => map (fn Int e => e) es)
wenzelm@19780
  1410
      |> maps (fn Assumes asms => asms | _ => [])
ballarin@18795
  1411
      |> map (apsnd (map fst))
ballarin@18795
  1412
  end;
ballarin@18795
  1413
ballarin@18795
  1414
in
ballarin@18795
  1415
haftmann@25619
  1416
fun parameters_of thy = #params o the_locale thy;
haftmann@25619
  1417
haftmann@25619
  1418
fun intros thy = #intros o the_locale thy;
haftmann@25619
  1419
  (*returns introduction rule for delta predicate and locale predicate
haftmann@25619
  1420
    as a pair of singleton lists*)
haftmann@25619
  1421
haftmann@25619
  1422
fun dests thy = #dests o the_locale thy;
haftmann@25619
  1423
haftmann@27692
  1424
fun elems thy = map fst o #elems o the_locale thy;
ballarin@18795
  1425
ballarin@19276
  1426
fun parameters_of_expr thy expr =
ballarin@19276
  1427
  let
ballarin@19276
  1428
    val ctxt = ProofContext.init thy;
ballarin@19783
  1429
    val pts = params_of_expr ctxt [] (intern_expr thy expr)
ballarin@19783
  1430
        ([], Symtab.empty, Symtab.empty);
ballarin@19783
  1431
    val raw_params_elemss = make_raw_params_elemss pts;
ballarin@19276
  1432
    val ((_, syn), raw_elemss) = flatten (ctxt, intern_expr thy)
ballarin@19276
  1433
        (([], Symtab.empty), Expr expr);
ballarin@19783
  1434
    val ((parms, _, _), _) =
ballarin@19783
  1435
        read_elemss false ctxt [] (raw_params_elemss @ raw_elemss) [];
ballarin@19276
  1436
  in map (fn p as (n, _) => (p, Symtab.lookup syn n |> the)) parms end;
ballarin@19276
  1437
ballarin@18795
  1438
fun local_asms_of thy name =
ballarin@18890
  1439
  gen_asms_of (single o Library.last_elem) thy name;
ballarin@18795
  1440
ballarin@18795
  1441
fun global_asms_of thy name =
ballarin@18890
  1442
  gen_asms_of I thy name;
ballarin@18795
  1443
wenzelm@19780
  1444
end;
ballarin@18795
  1445
ballarin@18795
  1446
wenzelm@22573
  1447
(* full context statements: imports + elements + conclusion *)
wenzelm@12529
  1448
wenzelm@12529
  1449
local
wenzelm@12529
  1450
wenzelm@12529
  1451
fun prep_context_statement prep_expr prep_elemss prep_facts
wenzelm@22573
  1452
    do_close fixed_params imports elements raw_concl context =
wenzelm@12529
  1453
  let
wenzelm@16458
  1454
    val thy = ProofContext.theory_of context;
wenzelm@13375
  1455
ballarin@19783
  1456
    val (import_params, import_tenv, import_syn) =
wenzelm@22573
  1457
      params_of_expr context fixed_params (prep_expr thy imports)
ballarin@19783
  1458
        ([], Symtab.empty, Symtab.empty);
ballarin@19783
  1459
    val includes = map_filter (fn Expr e => SOME e | Elem _ => NONE) elements;
ballarin@19783
  1460
    val (incl_params, incl_tenv, incl_syn) = fold (params_of_expr context fixed_params)
ballarin@19783
  1461
      (map (prep_expr thy) includes) (import_params, import_tenv, import_syn);
ballarin@19783
  1462
ballarin@19783
  1463
    val ((import_ids, _), raw_import_elemss) =
wenzelm@22573
  1464
      flatten (context, prep_expr thy) (([], Symtab.empty), Expr imports);
ballarin@14215
  1465
    (* CB: normalise "includes" among elements *)
wenzelm@16458
  1466
    val ((ids, syn), raw_elemsss) = foldl_map (flatten (context, prep_expr thy))
ballarin@19783
  1467
      ((import_ids, incl_syn), elements);
ballarin@15696
  1468
wenzelm@19482
  1469
    val raw_elemss = flat raw_elemsss;
ballarin@14508
  1470
    (* CB: raw_import_elemss @ raw_elemss is the normalised list of
ballarin@14508
  1471
       context elements obtained from import and elements. *)
ballarin@19783
  1472
    (* Now additional elements for parameters are inserted. *)
ballarin@19783
  1473
    val import_params_ids = make_params_ids import_params;
ballarin@19783
  1474
    val incl_params_ids =
ballarin@19783
  1475
        make_params_ids (incl_params \\ import_params);
ballarin@19783
  1476
    val raw_import_params_elemss =
ballarin@19783
  1477
        make_raw_params_elemss (import_params, incl_tenv, incl_syn);
ballarin@19783
  1478
    val raw_incl_params_elemss =
ballarin@19783
  1479
        make_raw_params_elemss (incl_params \\ import_params, incl_tenv, incl_syn);
wenzelm@13375
  1480
    val ((parms, all_elemss, concl), (spec, (_, _, defs))) = prep_elemss do_close
ballarin@19783
  1481
      context fixed_params
ballarin@19783
  1482
      (raw_import_params_elemss @ raw_import_elemss @ raw_incl_params_elemss @ raw_elemss) raw_concl;
ballarin@19783
  1483
ballarin@15696
  1484
    (* replace extended ids (for axioms) by ids *)
ballarin@19783
  1485
    val (import_ids', incl_ids) = chop (length import_ids) ids;
ballarin@20035
  1486
    val all_ids = import_params_ids @ import_ids' @ incl_params_ids @ incl_ids;
ballarin@17000
  1487
    val all_elemss' = map (fn (((_, ps), _), (((n, ps'), mode), elems)) =>
haftmann@17485
  1488
        (((n, map (fn p => (p, (the o AList.lookup (op =) ps') p)) ps), mode), elems))
ballarin@20035
  1489
      (all_ids ~~ all_elemss);
ballarin@19783
  1490
    (* CB: all_elemss and parms contain the correct parameter types *)
ballarin@15696
  1491
ballarin@19783
  1492
    val (ps, qs) = chop (length raw_import_params_elemss + length raw_import_elemss) all_elemss';
haftmann@27681
  1493
    val ((import_elemss, _), import_ctxt) =
haftmann@27681
  1494
      activate_facts false prep_facts ps context;
haftmann@27681
  1495
haftmann@27681
  1496
    val ((elemss, _), ctxt) =
haftmann@27681
  1497
      activate_facts false prep_facts qs (ProofContext.set_stmt true import_ctxt);
wenzelm@12834
  1498
  in
ballarin@19783
  1499
    ((((import_ctxt, import_elemss), (ctxt, elemss, syn)),
ballarin@19991
  1500
      (parms, spec, defs)), concl)
wenzelm@12834
  1501
  end;
wenzelm@12529
  1502
wenzelm@18806
  1503
fun prep_statement prep_locale prep_ctxt raw_locale elems concl ctxt =
wenzelm@12529
  1504
  let
wenzelm@12529
  1505
    val thy = ProofContext.theory_of ctxt;
wenzelm@16458
  1506
    val locale = Option.map (prep_locale thy) raw_locale;
wenzelm@22573
  1507
    val (fixed_params, imports) =
wenzelm@18806
  1508
      (case locale of
ballarin@19931
  1509
        NONE => ([], empty)
skalberg@15531
  1510
      | SOME name =>
ballarin@19931
  1511
          let val {params = ps, ...} = the_locale thy name
ballarin@19931
  1512
          in (map fst ps, Locale name) end);
ballarin@19991
  1513
    val ((((locale_ctxt, _), (elems_ctxt, _, _)), _), concl') =
wenzelm@22573
  1514
      prep_ctxt false fixed_params imports elems concl ctxt;
ballarin@19991
  1515
  in (locale, locale_ctxt, elems_ctxt, concl') end;
wenzelm@13399
  1516
wenzelm@22573
  1517
fun prep_expr prep imports body ctxt =
wenzelm@19780
  1518
  let
wenzelm@22573
  1519
    val (((_, import_elemss), (ctxt', elemss, _)), _) = prep imports body ctxt;
wenzelm@19780
  1520
    val all_elems = maps snd (import_elemss @ elemss);
wenzelm@19780
  1521
  in (all_elems, ctxt') end;
wenzelm@19780
  1522
wenzelm@12529
  1523
in
wenzelm@12529
  1524
wenzelm@18806
  1525
val read_ctxt = prep_context_statement intern_expr read_elemss read_facts;
wenzelm@18806
  1526
val cert_ctxt = prep_context_statement (K I) cert_elemss cert_facts;
ballarin@14215
  1527
wenzelm@22573
  1528
fun read_context imports body ctxt = #1 (read_ctxt true [] imports (map Elem body) [] ctxt);
wenzelm@22573
  1529
fun cert_context imports body ctxt = #1 (cert_ctxt true [] imports (map Elem body) [] ctxt);
wenzelm@12502
  1530
wenzelm@19780
  1531
val read_expr = prep_expr read_context;
wenzelm@19780
  1532
val cert_expr = prep_expr cert_context;
wenzelm@19780
  1533
wenzelm@21035
  1534
fun read_context_statement loc = prep_statement intern read_ctxt loc;
wenzelm@21035
  1535
fun read_context_statement_i loc = prep_statement (K I) read_ctxt loc;
wenzelm@21035
  1536
fun cert_context_statement loc = prep_statement (K I) cert_ctxt loc;
wenzelm@18806
  1537
wenzelm@12502
  1538
end;
wenzelm@11896
  1539
wenzelm@11896
  1540
wenzelm@21665
  1541
(* init *)
wenzelm@21665
  1542
wenzelm@21665
  1543
fun init loc =
wenzelm@21665
  1544
  ProofContext.init
haftmann@25669
  1545
  #> #2 o cert_context_statement (SOME loc) [] [];
wenzelm@21665
  1546
wenzelm@21665
  1547
wenzelm@13336
  1548
(* print locale *)
wenzelm@12070
  1549
wenzelm@22573
  1550
fun print_locale thy show_facts imports body =
wenzelm@22573
  1551
  let val (all_elems, ctxt) = read_expr imports body (ProofContext.init thy) in
wenzelm@18137
  1552
    Pretty.big_list "locale elements:" (all_elems
ballarin@17316
  1553
      |> (if show_facts then I else filter (fn Notes _ => false | _ => true))
wenzelm@21701
  1554
      |> map (Element.pretty_ctxt ctxt) |> filter_out null
wenzelm@21701
  1555
      |> map Pretty.chunks)
wenzelm@13336
  1556
    |> Pretty.writeln
wenzelm@12277
  1557
  end;
wenzelm@12070
  1558
wenzelm@12070
  1559
wenzelm@12706
  1560
wenzelm@16144
  1561
(** store results **)
wenzelm@12702
  1562
wenzelm@19018
  1563
(* naming of interpreted theorems *)
ballarin@15696
  1564
ballarin@26645
  1565
fun global_note_prefix_i kind loc (fully_qualified, prfx) args thy =
wenzelm@16144
  1566
  thy
wenzelm@22796
  1567
  |> Sign.qualified_names
ballarin@26645
  1568
  |> Sign.add_path (NameSpace.base loc ^ "_locale")
wenzelm@22796
  1569
  |> (if fully_qualified then Sign.sticky_prefix prfx else Sign.add_path prfx)
haftmann@27692
  1570
  |> PureThy.note_thmss kind args
wenzelm@22796
  1571
  ||> Sign.restore_naming thy;
ballarin@15696
  1572
ballarin@26645
  1573
fun local_note_prefix_i kind loc (fully_qualified, prfx) args ctxt =
wenzelm@16144
  1574
  ctxt
wenzelm@19061
  1575
  |> ProofContext.qualified_names
ballarin@26645
  1576
  |> ProofContext.add_path (NameSpace.base loc ^ "_locale")
haftmann@22351
  1577
  |> (if fully_qualified then ProofContext.sticky_prefix prfx else ProofContext.add_path prfx)
wenzelm@21441
  1578
  |> ProofContext.note_thmss_i kind args
wenzelm@19780
  1579
  ||> ProofContext.restore_naming ctxt;
wenzelm@16144
  1580
ballarin@15696
  1581
ballarin@23918
  1582
(* join equations of an id with already accumulated ones *)
ballarin@23918
  1583
ballarin@23918
  1584
fun join_eqns get_reg prep_id ctxt id eqns =
ballarin@23918
  1585
  let
ballarin@23918
  1586
    val id' = prep_id id
ballarin@23918
  1587
    val eqns' = case get_reg id'
ballarin@23918
  1588
      of NONE => eqns
ballarin@23918
  1589
	| SOME (_, _, eqns') => Termtab.join (fn t => fn (_, e) => e) (eqns, eqns')
ballarin@23918
  1590
            handle Termtab.DUP t =>
ballarin@23918
  1591
	      error ("Conflicting interpreting equations for term " ^
wenzelm@24920
  1592
		quote (Syntax.string_of_term ctxt t))
ballarin@23918
  1593
  in ((id', eqns'), eqns') end;
ballarin@23918
  1594
ballarin@23918
  1595
ballarin@22658
  1596
(* collect witnesses and equations up to a particular target for global
ballarin@22658
  1597
   registration; requires parameters and flattened list of identifiers
ballarin@17138
  1598
   instead of recomputing it from the target *)
ballarin@17138
  1599
wenzelm@25357
  1600
fun collect_global_witnesses thy imprt parms ids vts = let
ballarin@17138
  1601
    val ts = map Logic.unvarify vts;
ballarin@17138
  1602
    val (parms, parmTs) = split_list parms;
wenzelm@19810
  1603
    val parmvTs = map Logic.varifyT parmTs;
ballarin@17138
  1604
    val vtinst = fold (Sign.typ_match thy) (parmvTs ~~ map Term.fastype_of ts) Vartab.empty;
ballarin@17138
  1605
    val tinst = Vartab.dest vtinst |> map (fn ((x, 0), (_, T)) => (x, T))
wenzelm@18137
  1606
        |> Symtab.make;
ballarin@17138
  1607
    (* replace parameter names in ids by instantiations *)
ballarin@17138
  1608
    val vinst = Symtab.make (parms ~~ vts);
wenzelm@17412
  1609
    fun vinst_names ps = map (the o Symtab.lookup vinst) ps;
ballarin@17138
  1610
    val inst = Symtab.make (parms ~~ ts);
ballarin@22658
  1611
    val inst_ids = map (apfst (apsnd vinst_names)) ids;
ballarin@22658
  1612
    val assumed_ids' = map_filter (fn (id, (_, Assumed _)) => SOME id | _ => NONE) inst_ids;
wenzelm@25357
  1613
    val wits = maps (#2 o the o get_global_registration thy imprt) assumed_ids';
ballarin@22658
  1614
ballarin@22658
  1615
    val ids' = map fst inst_ids;
ballarin@23918
  1616
    val eqns =
wenzelm@25357
  1617
      fold_map (join_eqns (get_global_registration thy imprt) I (ProofContext.init thy))
ballarin@23918
  1618
        ids' Termtab.empty |> snd |> Termtab.dest |> map snd;
ballarin@25286
  1619
  in ((tinst, inst), wits, eqns) end;
ballarin@25286
  1620
ballarin@25286
  1621
ballarin@25286
  1622
(* standardise export morphism *)
ballarin@25286
  1623
ballarin@25286
  1624
(* clone from Element.generalize_facts *)
ballarin@25286
  1625
fun standardize thy export facts =
ballarin@25286
  1626
  let
ballarin@25286
  1627
    val exp_fact = Drule.zero_var_indexes_list o map Thm.strip_shyps o Morphism.fact export;
ballarin@25286
  1628
    val exp_term = TermSubst.zero_var_indexes o Morphism.term export;
ballarin@25286
  1629
      (* FIXME sync with exp_fact *)
ballarin@25286
  1630
    val exp_typ = Logic.type_map exp_term;
ballarin@25286
  1631
    val morphism =
ballarin@25286
  1632
      Morphism.morphism {name = I, var = I, typ = exp_typ, term = exp_term, fact = exp_fact};
ballarin@25286
  1633
  in Element.facts_map (Element.morph_ctxt morphism) facts end;
ballarin@25286
  1634
ballarin@25286
  1635
ballarin@25286
  1636
(* suppress application of name morphism: workaroud for class package *) (* FIXME *)
ballarin@25286
  1637
ballarin@25286
  1638
fun morph_ctxt' phi = Element.map_ctxt
ballarin@25286
  1639
  {name = I,
ballarin@25286
  1640
   var = Morphism.var phi,
ballarin@25286
  1641
   typ = Morphism.typ phi,
ballarin@25286
  1642
   term = Morphism.term phi,
ballarin@25286
  1643
   fact = Morphism.fact phi,
ballarin@25286
  1644
   attrib = Args.morph_values phi};
ballarin@25286
  1645
ballarin@25286
  1646
ballarin@25286
  1647
(* compute morphism and apply to args *)
ballarin@25286
  1648
ballarin@25286
  1649
fun interpret_args thy prfx insts prems eqns atts2 exp attrib args =
ballarin@25286
  1650
  let
ballarin@25286
  1651
    val inst = Morphism.name_morphism (NameSpace.qualified prfx) $>
ballarin@25286
  1652
      Element.inst_morphism thy insts $> Element.satisfy_morphism prems $>
ballarin@25286
  1653
      Morphism.term_morphism (MetaSimplifier.rewrite_term thy eqns []) $>
ballarin@25286
  1654
      Morphism.thm_morphism (MetaSimplifier.rewrite_rule eqns)
ballarin@25286
  1655
  in
ballarin@25286
  1656
    args |> Element.facts_map (morph_ctxt' inst) |>
ballarin@25286
  1657
      map (fn (attn, bs) => (attn,
ballarin@25286
  1658
        bs |> map (fn (ths, atts) => (ths, (atts @ atts2))))) |>
ballarin@25286
  1659
      standardize thy exp |> Attrib.map_facts attrib
ballarin@25286
  1660
  end;
ballarin@17138
  1661
ballarin@17138
  1662
ballarin@15696
  1663
(* store instantiations of args for all registered interpretations
ballarin@15696
  1664
   of the theory *)
ballarin@15696
  1665
wenzelm@21441
  1666
fun note_thmss_registrations target (kind, args) thy =
ballarin@15596
  1667
  let
ballarin@19278
  1668
    val parms = the_locale thy target |> #params |> map fst;
wenzelm@16458
  1669
    val ids = flatten (ProofContext.init thy, intern_expr thy)
ballarin@22658
  1670
      (([], Symtab.empty), Expr (Locale target)) |> fst |> fst;
ballarin@15696
  1671
ballarin@15696
  1672
    val regs = get_global_registrations thy target;
ballarin@15696
  1673
    (* add args to thy for all registrations *)
ballarin@15596
  1674
ballarin@25286
  1675
    fun activate (vts, (((fully_qualified, prfx), atts2), (exp, imp), _, _)) thy =
ballarin@15696
  1676
      let
ballarin@25286
  1677
        val (insts, prems, eqns) = collect_global_witnesses thy imp parms ids vts;
wenzelm@20911
  1678
        val attrib = Attrib.attribute_i thy;
ballarin@25286
  1679
        val args' = interpret_args thy prfx insts prems eqns atts2 exp attrib args;
ballarin@26645
  1680
      in global_note_prefix_i kind target (fully_qualified, prfx) args' thy |> snd end;
wenzelm@18190
  1681
  in fold activate regs thy end;
ballarin@15596
  1682
ballarin@15596
  1683
wenzelm@20911
  1684
(* locale results *)
wenzelm@12958
  1685
wenzelm@21441
  1686
fun add_thmss loc kind args ctxt =
wenzelm@12706
  1687
  let
haftmann@27681
  1688
    val (([(_, [Notes args'])], _), ctxt') =
wenzelm@21441
  1689
      activate_facts true cert_facts
haftmann@27681
  1690
        [((("", []), Assumed []), [Ext (Notes (kind, args))])] ctxt;
wenzelm@20911
  1691
    val ctxt'' = ctxt' |> ProofContext.theory
wenzelm@20911
  1692
      (change_locale loc
haftmann@25619
  1693
        (fn (axiom, imports, elems, params, lparams, decls, regs, intros, dests) =>
wenzelm@22573
  1694
          (axiom, imports, elems @ [(Notes args', stamp ())],
haftmann@25619
  1695
            params, lparams, decls, regs, intros, dests))
wenzelm@21441
  1696
      #> note_thmss_registrations loc args');
wenzelm@21582
  1697
  in ctxt'' end;
wenzelm@15703
  1698
wenzelm@11896
  1699
wenzelm@21665
  1700
(* declarations *)
wenzelm@21665
  1701
wenzelm@21665
  1702
local
wenzelm@21665
  1703
wenzelm@21665
  1704
fun decl_attrib decl phi = Thm.declaration_attribute (K (decl phi));
wenzelm@21665
  1705
wenzelm@21665
  1706
fun add_decls add loc decl =
wenzelm@21665
  1707
  ProofContext.theory (change_locale loc
haftmann@25619
  1708
    (fn (axiom, imports, elems, params, lparams, decls, regs, intros, dests) =>
haftmann@25619
  1709
      (axiom, imports, elems, params, lparams, add (decl, stamp ()) decls, regs, intros, dests))) #>
wenzelm@24006
  1710
  add_thmss loc Thm.internalK
wenzelm@24006
  1711
    [(("", [Attrib.internal (decl_attrib decl)]), [([Drule.dummy_thm], [])])];
wenzelm@21665
  1712
wenzelm@23418
  1713
in
wenzelm@21665
  1714
wenzelm@21665
  1715
val add_type_syntax = add_decls (apfst o cons);
wenzelm@21665
  1716
val add_term_syntax = add_decls (apsnd o cons);
wenzelm@21665
  1717
val add_declaration = add_decls (K I);
wenzelm@21665
  1718
wenzelm@21665
  1719
end;
wenzelm@21665
  1720
wenzelm@21665
  1721
wenzelm@18137
  1722
wenzelm@18137
  1723
(** define locales **)
wenzelm@18137
  1724
wenzelm@13336
  1725
(* predicate text *)
ballarin@15596
  1726
(* CB: generate locale predicates and delta predicates *)
wenzelm@13336
  1727
wenzelm@13375
  1728
local
wenzelm@13375
  1729
ballarin@15206
  1730
(* introN: name of theorems for introduction rules of locale and
ballarin@15206
  1731
     delta predicates;
ballarin@15206
  1732
   axiomsN: name of theorem set with destruct rules for locale predicates,
ballarin@15206
  1733
     also name suffix of delta predicates. *)
ballarin@15206
  1734
wenzelm@13375
  1735
val introN = "intro";
ballarin@15206
  1736
val axiomsN = "axioms";
wenzelm@13375
  1737
wenzelm@16458
  1738
fun atomize_spec thy ts =
wenzelm@13375
  1739
  let
wenzelm@23418
  1740
    val t = Logic.mk_conjunction_balanced ts;
wenzelm@16458
  1741
    val body = ObjectLogic.atomize_term thy t;
wenzelm@13375
  1742
    val bodyT = Term.fastype_of body;
wenzelm@13375
  1743
  in
wenzelm@16458
  1744
    if bodyT = propT then (t, propT, Thm.reflexive (Thm.cterm_of thy t))
wenzelm@23591
  1745
    else (body, bodyT, ObjectLogic.atomize (Thm.cterm_of thy t))
wenzelm@13375
  1746
  end;
wenzelm@13375
  1747
wenzelm@25073
  1748
fun aprop_tr' n c = (Syntax.constN ^ c, fn ctxt => fn args =>
wenzelm@25073
  1749
  if length args = n then
wenzelm@25073
  1750
    Syntax.const "_aprop" $
wenzelm@25073
  1751
      Term.list_comb (Syntax.free (Consts.extern (ProofContext.consts_of ctxt) c), args)
wenzelm@13394
  1752
  else raise Match);
wenzelm@13336
  1753
ballarin@15104
  1754
(* CB: define one predicate including its intro rule and axioms
ballarin@15104
  1755
   - bname: predicate name
ballarin@15104
  1756
   - parms: locale parameters
ballarin@15104
  1757
   - defs: thms representing substitutions from defines elements
ballarin@15104
  1758
   - ts: terms representing locale assumptions (not normalised wrt. defs)
ballarin@15104
  1759
   - norm_ts: terms representing locale assumptions (normalised wrt. defs)
ballarin@15104
  1760
   - thy: the theory
ballarin@15104
  1761
*)
ballarin@15104
  1762
wenzelm@13420
  1763
fun def_pred bname parms defs ts norm_ts thy =
wenzelm@13375
  1764
  let
wenzelm@16458
  1765
    val name = Sign.full_name thy bname;
wenzelm@13375
  1766
wenzelm@16458
  1767
    val (body, bodyT, body_eq) = atomize_spec thy norm_ts;
wenzelm@13394
  1768
    val env = Term.add_term_free_names (body, []);
wenzelm@20664
  1769
    val xs = filter (member (op =) env o #1) parms;
wenzelm@13394
  1770
    val Ts = map #2 xs;
wenzelm@23178
  1771
    val extraTs = (Term.term_tfrees body \\ List.foldr Term.add_typ_tfrees [] Ts)
wenzelm@13394
  1772
      |> Library.sort_wrt #1 |> map TFree;
wenzelm@13399
  1773
    val predT = map Term.itselfT extraTs ---> Ts ---> bodyT;
wenzelm@13336
  1774
wenzelm@13394
  1775
    val args = map Logic.mk_type extraTs @ map Free xs;
wenzelm@13394
  1776
    val head = Term.list_comb (Const (name, predT), args);
wenzelm@18123
  1777
    val statement = ObjectLogic.ensure_propT thy head;
wenzelm@13375
  1778
haftmann@18358
  1779
    val ([pred_def], defs_thy) =
wenzelm@13375
  1780
      thy
wenzelm@25073
  1781
      |> bodyT = propT ? Sign.add_advanced_trfuns ([], [], [aprop_tr' (length args) name], [])
wenzelm@25073
  1782
      |> Sign.declare_const [] (bname, predT, NoSyn) |> snd
haftmann@27692
  1783
      |> PureThy.add_defs false
wenzelm@26634
  1784
        [((Thm.def_name bname, Logic.mk_equals (head, body)), [PureThy.kind_internal])];
wenzelm@20059
  1785
    val defs_ctxt = ProofContext.init defs_thy |> Variable.declare_term head;
wenzelm@13394
  1786
wenzelm@16458
  1787
    val cert = Thm.cterm_of defs_thy;
wenzelm@13375
  1788
wenzelm@20059
  1789
    val intro = Goal.prove_global defs_thy [] norm_ts statement (fn _ =>
wenzelm@21708
  1790
      MetaSimplifier.rewrite_goals_tac [pred_def] THEN
wenzelm@13375
  1791
      Tactic.compose_tac (false, body_eq RS Drule.equal_elim_rule1, 1) 1 THEN
wenzelm@23418
  1792
      Tactic.compose_tac (false,
wenzelm@23418
  1793
        Conjunction.intr_balanced (map (Thm.assume o cert) norm_ts), 0) 1);
wenzelm@13375
  1794
wenzelm@13375
  1795
    val conjuncts =
wenzelm@19423
  1796
      (Drule.equal_elim_rule2 OF [body_eq,
wenzelm@21708
  1797
        MetaSimplifier.rewrite_rule [pred_def] (Thm.assume (cert statement))])
wenzelm@23418
  1798
      |> Conjunction.elim_balanced (length ts);
haftmann@17257
  1799
    val axioms = ts ~~ conjuncts |> map (fn (t, ax) =>
wenzelm@20059
  1800
      Element.prove_witness defs_ctxt t
wenzelm@21708
  1801
       (MetaSimplifier.rewrite_goals_tac defs THEN
wenzelm@13375
  1802
        Tactic.compose_tac (false, ax, 0) 1));
haftmann@18550
  1803
  in ((statement, intro, axioms), defs_thy) end;
wenzelm@13375
  1804
haftmann@18550
  1805
fun assumes_to_notes (Assumes asms) axms =
wenzelm@21441
  1806
      fold_map (fn (a, spec) => fn axs =>
wenzelm@21441
  1807
          let val (ps, qs) = chop (length spec) axs
wenzelm@21441
  1808
          in ((a, [(ps, [])]), qs) end) asms axms
wenzelm@21441
  1809
      |> apfst (curry Notes Thm.assumptionK)
haftmann@18550
  1810
  | assumes_to_notes e axms = (e, axms);
wenzelm@13394
  1811
ballarin@19931
  1812
(* CB: the following two change only "new" elems, these have identifier ("", _). *)
ballarin@19931
  1813
ballarin@19931
  1814
(* turn Assumes into Notes elements *)
ballarin@15206
  1815
ballarin@19931
  1816
fun change_assumes_elemss axioms elemss =
haftmann@18550
  1817
  let
wenzelm@21483
  1818
    val satisfy = Element.morph_ctxt (Element.satisfy_morphism axioms);
ballarin@19931
  1819
    fun change (id as ("", _), es) =
wenzelm@21483
  1820
          fold_map assumes_to_notes (map satisfy es)
haftmann@18550
  1821
          #-> (fn es' => pair (id, es'))
haftmann@18550
  1822
      | change e = pair e;
haftmann@18550
  1823
  in
wenzelm@19780
  1824
    fst (fold_map change elemss (map Element.conclude_witness axioms))
haftmann@18550
  1825
  end;
wenzelm@13394
  1826
ballarin@19931
  1827
(* adjust hyps of Notes elements *)
ballarin@19931
  1828
ballarin@19931
  1829
fun change_elemss_hyps axioms elemss =
ballarin@19931
  1830
  let
wenzelm@21483
  1831
    val satisfy = Element.morph_ctxt (Element.satisfy_morphism axioms);
wenzelm@21483
  1832
    fun change (id as ("", _), es) = (id, map (fn e as Notes _ => satisfy e | e => e) es)
ballarin@19931
  1833
      | change e = e;
ballarin@19931
  1834
  in map change elemss end;
ballarin@19931
  1835
wenzelm@13394
  1836
in
wenzelm@13375
  1837
ballarin@15104
  1838
(* CB: main predicate definition function *)
ballarin@15104
  1839
haftmann@22351
  1840
fun define_preds pname (parms, ((exts, exts'), (ints, ints')), defs) elemss thy =
wenzelm@13394
  1841
  let
haftmann@22351
  1842
    val ((elemss', more_ts), a_elem, a_intro, thy'') =
ballarin@19931
  1843
      if null exts then ((elemss, []), [], [], thy)
wenzelm@13394
  1844
      else
wenzelm@13394
  1845
        let
haftmann@22351
  1846
          val aname = if null ints then pname else pname ^ "_" ^ axiomsN;
haftmann@22351
  1847
          val ((statement, intro, axioms), thy') =
haftmann@22351
  1848
            thy
haftmann@22351
  1849
            |> def_pred aname parms defs exts exts';
ballarin@19931
  1850
          val elemss' = change_assumes_elemss axioms elemss;
haftmann@22351
  1851
          val a_elem = [(("", []), [Assumes [((pname ^ "_" ^ axiomsN, []), [(statement, [])])]])];
haftmann@22351
  1852
          val (_, thy'') =
haftmann@22351
  1853
            thy'
haftmann@27692
  1854
            |> Sign.add_path aname
haftmann@27692
  1855
            |> Sign.no_base_names
haftmann@27692
  1856
            |> PureThy.note_thmss Thm.internalK [((introN, []), [([intro], [])])]
haftmann@27692
  1857
            ||> Sign.restore_naming thy';
haftmann@22351
  1858
        in ((elemss', [statement]), a_elem, [intro], thy'') end;
haftmann@22351
  1859
    val (predicate, stmt', elemss'', b_intro, thy'''') =
haftmann@22351
  1860
      if null ints then (([], []), more_ts, elemss' @ a_elem, [], thy'')
wenzelm@13394
  1861
      else
wenzelm@13394
  1862
        let
haftmann@22351
  1863
          val ((statement, intro, axioms), thy''') =
haftmann@22351
  1864
            thy''
haftmann@22351
  1865
            |> def_pred pname parms defs (ints @ more_ts) (ints' @ more_ts);
haftmann@22351
  1866
          val cstatement = Thm.cterm_of thy''' statement;
ballarin@19931
  1867
          val elemss'' = change_elemss_hyps axioms elemss';
ballarin@19931
  1868
          val b_elem = [(("", []),
haftmann@22351
  1869
               [Assumes [((pname ^ "_" ^ axiomsN, []), [(statement, [])])]])];
haftmann@22351
  1870
          val (_, thy'''') =
haftmann@22351
  1871
            thy'''
haftmann@27692
  1872
            |> Sign.add_path pname
haftmann@27692
  1873
            |> Sign.no_base_names
haftmann@27692
  1874
            |> PureThy.note_thmss Thm.internalK
haftmann@22351
  1875
                 [((introN, []), [([intro], [])]),
haftmann@27692
  1876
                  ((axiomsN, []), [(map (Drule.standard o Element.conclude_witness) axioms, [])])]
haftmann@27692
  1877
            ||> Sign.restore_naming thy''';
haftmann@22351
  1878
        in (([cstatement], axioms), [statement], elemss'' @ b_elem, [intro], thy'''') end;
haftmann@22351
  1879
  in (((elemss'', predicate, stmt'), (a_intro, b_intro)), thy'''') end;
wenzelm@13375
  1880
wenzelm@13375
  1881
end;
wenzelm@13336
  1882
wenzelm@13336
  1883
wenzelm@13297
  1884
(* add_locale(_i) *)
wenzelm@13297
  1885
wenzelm@13297
  1886
local
wenzelm@13297
  1887
ballarin@19931
  1888
(* turn Defines into Notes elements, accumulate definition terms *)
ballarin@19931
  1889
ballarin@19942
  1890
fun defines_to_notes is_ext thy (Defines defs) defns =
ballarin@19942
  1891
    let
ballarin@19942
  1892
      val defs' = map (fn (_, (def, _)) => (("", []), (def, []))) defs
ballarin@19942
  1893
      val notes = map (fn (a, (def, _)) =>
ballarin@19942
  1894
        (a, [([assume (cterm_of thy def)], [])])) defs
wenzelm@21441
  1895
    in
wenzelm@21441
  1896
      (if is_ext then SOME (Notes (Thm.definitionK, notes)) else NONE, defns @ [Defines defs'])
wenzelm@21441
  1897
    end
ballarin@19942
  1898
  | defines_to_notes _ _ e defns = (SOME e, defns);
ballarin@19931
  1899
ballarin@19942
  1900
fun change_defines_elemss thy elemss defns =
ballarin@19931
  1901
  let
ballarin@19942
  1902
    fun change (id as (n, _), es) defns =
ballarin@19931
  1903
        let
ballarin@19942
  1904
          val (es', defns') = fold_map (defines_to_notes (n="") thy) es defns
ballarin@19942
  1905
        in ((id, map_filter I es'), defns') end
ballarin@19942
  1906
  in fold_map change elemss defns end;
ballarin@19931
  1907
wenzelm@18343
  1908
fun gen_add_locale prep_ctxt prep_expr
wenzelm@22573
  1909
    predicate_name bname raw_imports raw_body thy =
haftmann@27681
  1910
    (* predicate_name: "" - locale with predicate named as locale
haftmann@27681
  1911
        "name" - locale with predicate named "name" *)
wenzelm@13297
  1912
  let
haftmann@27681
  1913
    val thy_ctxt = ProofContext.init thy;
wenzelm@16458
  1914
    val name = Sign.full_name thy bname;
wenzelm@21962
  1915
    val _ = is_some (get_locale thy name) andalso
wenzelm@21962
  1916
      error ("Duplicate definition of locale " ^ quote name);
wenzelm@13297
  1917
ballarin@17228
  1918
    val (((import_ctxt, import_elemss), (body_ctxt, body_elemss, syn)),
ballarin@19931
  1919
      text as (parms, ((_, exts'), _), defs)) =
haftmann@27681
  1920
        prep_ctxt raw_imports raw_body thy_ctxt;
ballarin@19931
  1921
    val elemss = import_elemss @ body_elemss |>
haftmann@27681
  1922
      map_filter (fn ((id, Assumed axs), elems) => SOME (id, elems) | _ => NONE);
wenzelm@22573
  1923
    val imports = prep_expr thy raw_imports;
wenzelm@13297
  1924
wenzelm@23178
  1925
    val extraTs = List.foldr Term.add_term_tfrees [] exts' \\
wenzelm@23178
  1926
      List.foldr Term.add_typ_tfrees [] (map snd parms);
ballarin@17228
  1927
    val _ = if null extraTs then ()
ballarin@17437
  1928
      else warning ("Additional type variable(s) in locale specification " ^ quote bname);
ballarin@17228
  1929
haftmann@27681
  1930
    val predicate_name' = case predicate_name of "" => bname | _ => predicate_name;
haftmann@27692
  1931
    val (elemss', defns) = change_defines_elemss thy elemss [];
haftmann@27692
  1932
    val elemss'' = elemss' @ [(("", []), defns)];
haftmann@27692
  1933
    val (((elemss''', predicate as (pred_statement, pred_axioms), stmt'), intros), thy') =
haftmann@27692
  1934
      define_preds predicate_name' text elemss'' thy;
haftmann@27692
  1935
    val regs = pred_axioms
haftmann@27692
  1936
      |> fold_map (fn (id, elems) => fn wts => let
haftmann@27692
  1937
             val ts = flat (map_filter (fn (Assumes asms) =>
haftmann@27692
  1938
               SOME (maps (map #1 o #2) asms) | _ => NONE) elems);
haftmann@27692
  1939
             val (wts1, wts2) = chop (length ts) wts;
haftmann@27692
  1940
           in ((apsnd (map fst) id, wts1), wts2) end) elemss'''
haftmann@27692
  1941
      |> fst
haftmann@27681
  1942
      |> map_filter (fn (("", _), _) => NONE | e => SOME e);
wenzelm@18137
  1943
    fun axiomify axioms elemss =
ballarin@15206
  1944
      (axioms, elemss) |> foldl_map (fn (axs, (id, elems)) => let
wenzelm@19482
  1945
                   val ts = flat (map_filter (fn (Assumes asms) =>
wenzelm@19482
  1946
                     SOME (maps (map #1 o #2) asms) | _ => NONE) elems);
wenzelm@19018
  1947
                   val (axs1, axs2) = chop (length ts) axs;
ballarin@17000
  1948
                 in (axs2, ((id, Assumed axs1), elems)) end)
haftmann@27692
  1949
      |> snd;
haftmann@27681
  1950
    val ((_, facts), ctxt) = activate_facts true (K I)
haftmann@27692
  1951
      (axiomify pred_axioms elemss''') (ProofContext.init thy');
haftmann@27681
  1952
    val view_ctxt = Assumption.add_view thy_ctxt pred_statement ctxt;
wenzelm@26634
  1953
    val export = Thm.close_derivation o Goal.norm_result o
wenzelm@21602
  1954
      singleton (ProofContext.export view_ctxt thy_ctxt);
wenzelm@13420
  1955
    val facts' = facts |> map (fn (a, ths) => ((a, []), [(map export ths, [])]));
haftmann@27692
  1956
    val elems' = maps #2 (filter (equal "" o #1 o #1) elemss''');
ballarin@19783
  1957
    val elems'' = map_filter (fn (Fixes _) => NONE | e => SOME e) elems';
haftmann@27681
  1958
    val axs' = map (Element.assume_witness thy') stmt';
haftmann@27681
  1959
    val loc_ctxt = thy'
haftmann@27692
  1960
      |> Sign.add_path bname
haftmann@27692
  1961
      |> Sign.no_base_names
haftmann@27692
  1962
      |> PureThy.note_thmss Thm.assumptionK facts' |> snd
haftmann@27692
  1963
      |> Sign.restore_naming thy'
haftmann@27686
  1964
      |> register_locale name {axiom = axs',
haftmann@27681
  1965
        imports = empty,
ballarin@19783
  1966
        elems = map (fn e => (e, stamp ())) elems'',
haftmann@27692
  1967
        params = params_of elemss''' |> map (fn (x, SOME T) => ((x, T), the (Symtab.lookup syn x))),
ballarin@19931
  1968
        lparams = map #1 (params_of' body_elemss),
wenzelm@21665
  1969
        decls = ([], []),
ballarin@19931
  1970
        regs = regs,
haftmann@25619
  1971
        intros = intros,
haftmann@27681
  1972
        dests = map Element.conclude_witness pred_axioms}
wenzelm@21393
  1973
      |> init name;
wenzelm@21393
  1974
  in (name, loc_ctxt) end;
wenzelm@13297
  1975
wenzelm@13297
  1976
in
wenzelm@13297
  1977
haftmann@18917
  1978
val add_locale = gen_add_locale read_context intern_expr;
haftmann@18917
  1979
val add_locale_i = gen_add_locale cert_context (K I);
wenzelm@13297
  1980
wenzelm@13297
  1981
end;
wenzelm@13297
  1982
wenzelm@26463
  1983
val _ = Context.>> (Context.map_theory
haftmann@27681
  1984
 (add_locale_i "" "var" empty [Fixes [(Name.internal "x", NONE, NoSyn)]] #>
wenzelm@20965
  1985
  snd #> ProofContext.theory_of #>
haftmann@27681
  1986
  add_locale_i "" "struct" empty [Fixes [(Name.internal "S", NONE, Structure)]] #>
wenzelm@26463
  1987
  snd #> ProofContext.theory_of));
wenzelm@15801
  1988
wenzelm@13297
  1989
wenzelm@12730
  1990
wenzelm@17355
  1991
ballarin@19931
  1992
(** Normalisation of locale statements ---
ballarin@19931
  1993
    discharges goals implied by interpretations **)
ballarin@19931
  1994
ballarin@19931
  1995
local
ballarin@19931
  1996
ballarin@19931
  1997
fun locale_assm_intros thy =
ballarin@19931
  1998
  Symtab.fold (fn (_, {intros = (a, _), ...}) => fn intros => (a @ intros))
ballarin@24787
  1999
    (#2 (LocalesData.get thy)) [];
ballarin@19931
  2000
fun locale_base_intros thy =
ballarin@19931
  2001
  Symtab.fold (fn (_, {intros = (_, b), ...}) => fn intros => (b @ intros))
ballarin@24787
  2002
    (#2 (LocalesData.get thy)) [];
ballarin@19931
  2003
ballarin@19931
  2004
fun all_witnesses ctxt =
ballarin@19931
  2005
  let
ballarin@19931
  2006
    val thy = ProofContext.theory_of ctxt;
ballarin@19931
  2007
    fun get registrations = Symtab.fold (fn (_, regs) => fn thms =>
ballarin@25286
  2008
        (Registrations.dest thy regs |> map (fn (_, (_, (exp, _), wits, _)) =>
ballarin@25286
  2009
          map (Element.conclude_witness #> Morphism.thm exp) wits) |> flat) @ thms)
ballarin@19931
  2010
      registrations [];
ballarin@24787
  2011
  in get (RegistrationsData.get (Context.Proof ctxt)) end;
ballarin@19931
  2012
ballarin@19931
  2013
in
ballarin@19931
  2014
ballarin@19984
  2015
fun intro_locales_tac eager ctxt facts st =
ballarin@19931
  2016
  let
ballarin@25286
  2017
    val wits = all_witnesses ctxt;
ballarin@19931
  2018
    val thy = ProofContext.theory_of ctxt;
ballarin@19931
  2019
    val intros = locale_base_intros thy @ (if eager then locale_assm_intros thy else []);
ballarin@19931
  2020
  in
haftmann@25270
  2021
    Method.intros_tac (wits @ intros) facts st
ballarin@19931
  2022
  end;
ballarin@19931
  2023
wenzelm@26463
  2024
val _ = Context.>> (Context.map_theory
wenzelm@26463
  2025
  (Method.add_methods
wenzelm@26463
  2026
    [("intro_locales",
wenzelm@26463
  2027
      Method.ctxt_args (fn ctxt => Method.METHOD (intro_locales_tac false ctxt)),
wenzelm@26463
  2028
      "back-chain introduction rules of locales without unfolding predicates"),
wenzelm@26463
  2029
     ("unfold_locales",
wenzelm@26463
  2030
      Method.ctxt_args (fn ctxt => Method.METHOD (intro_locales_tac true ctxt)),
wenzelm@26463
  2031
      "back-chain all introduction rules of locales")]));
ballarin@19931
  2032
ballarin@19931
  2033
end;
ballarin@19931
  2034
wenzelm@19780
  2035
ballarin@15598
  2036
(** Interpretation commands **)
ballarin@15596
  2037
ballarin@15596
  2038
local
ballarin@15596
  2039
ballarin@15596
  2040
(* extract proof obligations (assms and defs) from elements *)
ballarin@15596
  2041
wenzelm@19780
  2042
fun extract_asms_elems ((id, Assumed _), elems) = (id, maps Element.prems_of elems)
ballarin@17138
  2043
  | extract_asms_elems ((id, Derived _), _) = (id, []);
ballarin@15596
  2044
ballarin@15596
  2045
ballarin@15624
  2046
(* activate instantiated facts in theory or context *)
ballarin@15596
  2047
ballarin@22658
  2048
structure Idtab =
ballarin@22658
  2049
  TableFun(type key = string * term list
ballarin@22658
  2050
    val ord = prod_ord string_ord (list_ord Term.fast_term_ord));
ballarin@22658
  2051
ballarin@25286
  2052
fun gen_activate_facts_elemss mk_ctxt get_reg note note_interp attrib put_reg add_wit add_eqn
ballarin@25286
  2053
        attn all_elemss new_elemss propss eq_attns (exp, imp) thmss thy_ctxt =
wenzelm@21499
  2054
  let
ballarin@22658
  2055
    val ctxt = mk_ctxt thy_ctxt;
ballarin@22658
  2056
    val (propss, eq_props) = chop (length new_elemss) propss;
ballarin@22658
  2057
    val (thmss, eq_thms) = chop (length new_elemss) thmss;
ballarin@22658
  2058
ballarin@26645
  2059
    fun activate_elem prems eqns exp loc ((fully_qualified, prfx), atts) (Notes (kind, facts)) thy_ctxt =
wenzelm@21499
  2060
        let
ballarin@22658
  2061
          val ctxt = mk_ctxt thy_ctxt;
ballarin@25286
  2062
          val facts' = interpret_args (ProofContext.theory_of ctxt) prfx
ballarin@25286
  2063
              (Symtab.empty, Symtab.empty) prems eqns atts
ballarin@25286
  2064
              exp (attrib thy_ctxt) facts;
ballarin@26645
  2065
        in snd (note_interp kind loc (fully_qualified, prfx) facts' thy_ctxt) end
ballarin@26645
  2066
      | activate_elem _ _ _ _ _ _ thy_ctxt = thy_ctxt;
ballarin@25286
  2067
ballarin@25286
  2068
    fun activate_elems prems eqns exp ((id, _), elems) thy_ctxt =
wenzelm@21499
  2069
      let
ballarin@25286
  2070
        val (prfx_atts, _, _) = case get_reg thy_ctxt imp id
haftmann@22351
  2071
         of SOME x => x
haftmann@22351
  2072
          | NONE => sys_error ("Unknown registration of " ^ quote (fst id)
haftmann@22351
  2073
              ^ " while activating facts.");
ballarin@26645
  2074
      in fold (activate_elem prems (the (Idtab.lookup eqns id)) exp (fst id) prfx_atts) elems thy_ctxt end;
ballarin@17033
  2075
wenzelm@21499
  2076
    val thy_ctxt' = thy_ctxt
wenzelm@21499
  2077
      (* add registrations *)
ballarin@25286
  2078
      |> fold (fn ((id, _), _) => put_reg id attn (exp, imp)) new_elemss
ballarin@22658
  2079
      (* add witnesses of Assumed elements (only those generate proof obligations) *)
ballarin@22658
  2080
      |> fold (fn (id, thms) => fold (add_wit id) thms) (map fst propss ~~ thmss)
ballarin@22658
  2081
      (* add equations *)
wenzelm@24693
  2082
      |> fold (fn (id, thms) => fold (add_eqn id) thms) (map fst eq_props ~~
wenzelm@24952
  2083
          (map o map) (Drule.abs_def o LocalDefs.meta_rewrite_rule ctxt o
ballarin@23918
  2084
            Element.conclude_witness) eq_thms);
ballarin@15596
  2085
wenzelm@21499
  2086
    val prems = flat (map_filter
ballarin@25286
  2087
          (fn ((id, Assumed _), _) => Option.map #2 (get_reg thy_ctxt' imp id)
wenzelm@21499
  2088
            | ((_, Derived _), _) => NONE) all_elemss);
wenzelm@21499
  2089
    val thy_ctxt'' = thy_ctxt'
wenzelm@21499
  2090
      (* add witnesses of Derived elements *)
ballarin@25286
  2091
      |> fold (fn (id, thms) => fold (add_wit id o Element.morph_witness (Element.satisfy_morphism prems)) thms)
wenzelm@21499
  2092
         (map_filter (fn ((_, Assumed _), _) => NONE
wenzelm@21499
  2093
            | ((id, Derived thms), _) => SOME (id, thms)) new_elemss)
wenzelm@19780
  2094
ballarin@22658
  2095
    (* Accumulate equations *)
ballarin@23918
  2096
    val all_eqns =
ballarin@25286
  2097
      fold_map (join_eqns (get_reg thy_ctxt'' imp) (fst o fst) ctxt) all_elemss Termtab.empty
ballarin@23918
  2098
      |> fst
ballarin@23918
  2099
      |> map (apsnd (map snd o Termtab.dest))
ballarin@22658
  2100
      |> (fn xs => fold Idtab.update xs Idtab.empty)
ballarin@23918
  2101
      (* Idtab.make wouldn't work here: can have conflicting duplicates,
ballarin@22658
  2102
         because instantiation may equate ids and equations are accumulated! *)
wenzelm@21499
  2103
  in
wenzelm@21499
  2104
    thy_ctxt''
ballarin@25095
  2105
    (* add equations *)
ballarin@25095
  2106
    |> fold (fn (attns, thms) =>
ballarin@25095
  2107
         fold (fn (attn, thm) => note "lemma"
ballarin@25095
  2108
           [(apsnd (map (attrib thy_ctxt'')) attn,
ballarin@25095
  2109
             [([Element.conclude_witness thm], [])])] #> snd)
ballarin@25095
  2110
           (attns ~~ thms)) (unflat eq_thms eq_attns ~~ eq_thms)
ballarin@25095
  2111
    (* add facts *)
ballarin@25286
  2112
    |> fold (activate_elems prems all_eqns exp) new_elemss
wenzelm@21499
  2113
  end;
ballarin@15596
  2114
wenzelm@17355
  2115
fun global_activate_facts_elemss x = gen_activate_facts_elemss
ballarin@22658
  2116
      ProofContext.init
ballarin@25286
  2117
      get_global_registration
haftmann@27692
  2118
      PureThy.note_thmss
wenzelm@21441
  2119
      global_note_prefix_i
ballarin@25286
  2120
      Attrib.attribute_i
ballarin@25286
  2121
      put_global_registration add_global_witness add_global_equation
ballarin@22658
  2122
      x;
wenzelm@17355
  2123
wenzelm@17355
  2124
fun local_activate_facts_elemss x = gen_activate_facts_elemss
ballarin@22658
  2125
      I
ballarin@15696
  2126
      get_local_registration
ballarin@25095
  2127
      ProofContext.note_thmss_i
wenzelm@19018
  2128
      local_note_prefix_i
ballarin@25286
  2129
      (Attrib.attribute_i o ProofContext.theory_of)
ballarin@17033
  2130
      put_local_registration
ballarin@22658
  2131
      add_local_witness
ballarin@22658
  2132
      add_local_equation
ballarin@22658
  2133
      x;
ballarin@22658
  2134
wenzelm@25067
  2135
fun prep_instantiations parse_term parse_prop ctxt parms (insts, eqns) =
ballarin@15596
  2136
  let
ballarin@24941
  2137
    (* parameters *)
ballarin@24941
  2138
    val (parm_names, parm_types) = parms |> split_list
ballarin@24941
  2139
      ||> map (TypeInfer.paramify_vars o Logic.varifyT);
haftmann@25038
  2140
    val type_parms = fold Term.add_tvarsT parm_types [] |> map (Logic.mk_type o TVar);
ballarin@24941
  2141
    val type_parm_names = fold Term.add_tfreesT (map snd parms) [] |> map fst;
wenzelm@22772
  2142
wenzelm@22772
  2143
    (* parameter instantiations *)
wenzelm@22772
  2144
    val d = length parms - length insts;
wenzelm@22772
  2145
    val insts =
wenzelm@22772
  2146
      if d < 0 then error "More arguments than parameters in instantiation."
wenzelm@22772
  2147
      else insts @ replicate d NONE;
ballarin@24941
  2148
    val (given_ps, given_insts) =
ballarin@24941
  2149
      ((parm_names ~~ parm_types) ~~ insts) |> map_filter
ballarin@24941
  2150
          (fn (_, NONE) => NONE
ballarin@24941
  2151
            | ((n, T), SOME inst) => SOME ((n, T), inst))
ballarin@24941
  2152
        |> split_list;
ballarin@24941
  2153
    val (given_parm_names, given_parm_types) = given_ps |> split_list;
ballarin@24941
  2154
wenzelm@25067
  2155
    (* parse insts / eqns *)
wenzelm@25067
  2156
    val given_insts' = map (parse_term ctxt) given_insts;
wenzelm@25067
  2157
    val eqns' = map (parse_prop ctxt) eqns;
wenzelm@25067
  2158
ballarin@25286
  2159
    (* type inference and contexts *)
ballarin@25286
  2160
    val arg = type_parms @ map2 TypeInfer.constrain given_parm_types given_insts' @ eqns';
ballarin@25286
  2161
    val res = Syntax.check_terms ctxt arg;
ballarin@24941
  2162
    val ctxt' = ctxt |> fold Variable.auto_fixes res;
ballarin@24941
  2163
ballarin@25286
  2164
    (* instantiation *)
ballarin@24941
  2165
    val (type_parms'', res') = chop (length type_parms) res;
ballarin@24941
  2166
    val (given_insts'', eqns'') = chop (length given_insts) res';
ballarin@24941
  2167
    val instT = Symtab.make (type_parm_names ~~ map Logic.dest_type type_parms'');
ballarin@24941
  2168
    val inst = Symtab.make (given_parm_names ~~ given_insts'');
ballarin@25286
  2169
ballarin@25286
  2170
    (* export from eigencontext *)
ballarin@25286
  2171
    val export = Variable.export_morphism ctxt' ctxt;
ballarin@25286
  2172
ballarin@25286
  2173
    (* import, its inverse *)
ballarin@25286
  2174
    val domT = fold Term.add_tfrees res [] |> map TFree;
ballarin@25286
  2175
    val importT = domT |> map (fn x => (Morphism.typ export x, x))
ballarin@25286
  2176
      |> map_filter (fn (TFree _, _) => NONE  (* fixed point of export *)
ballarin@25286
  2177
               | (TVar y, x) => SOME (fst y, x)
ballarin@25286
  2178
               | _ => error "internal: illegal export in interpretation")
ballarin@25286
  2179
      |> Vartab.make;
ballarin@25286
  2180
    val dom = fold Term.add_frees res [] |> map Free;
wenzelm@25357
  2181
    val imprt = dom |> map (fn x => (Morphism.term export x, x))
ballarin@25286
  2182
      |> map_filter (fn (Free _, _) => NONE  (* fixed point of export *)
ballarin@25286
  2183
               | (Var y, x) => SOME (fst y, x)
ballarin@25286
  2184
               | _ => error "internal: illegal export in interpretation")
ballarin@25286
  2185
      |> Vartab.make;
wenzelm@25357
  2186
  in (((instT, inst), eqns''), (export, ((importT, domT), (imprt, dom)))) end;
ballarin@24941
  2187
ballarin@24941
  2188
val read_instantiations = prep_instantiations Syntax.parse_term Syntax.parse_prop;
wenzelm@25067
  2189
val check_instantiations = prep_instantiations (K I) (K I);
ballarin@15598
  2190
wenzelm@22772
  2191
fun gen_prep_registration mk_ctxt test_reg activate
ballarin@22658
  2192
    prep_attr prep_expr prep_insts
haftmann@22300
  2193
    thy_ctxt raw_attn raw_expr raw_insts =
haftmann@22300
  2194
  let
haftmann@22300
  2195
    val ctxt = mk_ctxt thy_ctxt;
haftmann@22300
  2196
    val thy = ProofContext.theory_of ctxt;
haftmann@22300
  2197
    val ctxt' = ProofContext.init thy;
ballarin@25095
  2198
    fun prep_attn attn = (apsnd o map)
ballarin@25095
  2199
      (Attrib.crude_closure ctxt o Args.assignable o prep_attr thy) attn;
ballarin@25095
  2200
ballarin@25095
  2201
    val attn = prep_attn raw_attn;
haftmann@22300
  2202
    val expr = prep_expr thy raw_expr;
ballarin@15596
  2203
haftmann@22300
  2204
    val pts = params_of_expr ctxt' [] expr ([], Symtab.empty, Symtab.empty);
haftmann@22300
  2205
    val params_ids = make_params_ids (#1 pts);
haftmann@22300
  2206
    val raw_params_elemss = make_raw_params_elemss pts;
haftmann@22300
  2207
    val ((ids, _), raw_elemss) = flatten (ctxt', I) (([], Symtab.empty), Expr expr);
haftmann@22300
  2208
    val ((parms, all_elemss, _), (_, (_, defs, _))) =
haftmann@22300
  2209
      read_elemss false ctxt' [] (raw_params_elemss @ raw_elemss) [];
haftmann@22300
  2210
haftmann@22300
  2211
    (** compute instantiation **)
haftmann@22300
  2212
ballarin@22658
  2213
    (* consistency check: equations need to be stored in a particular locale,
ballarin@22658
  2214
       therefore if equations are present locale expression must be a name *)
ballarin@22658
  2215
ballarin@22658
  2216
    val _ = case (expr, snd raw_insts) of
ballarin@22658
  2217
        (Locale _, _) => () | (_, []) => ()
ballarin@22658
  2218
      | (_, _) => error "Interpretations with `where' only permitted if locale expression is a name.";
ballarin@22658
  2219
ballarin@22658
  2220
    (* read or certify instantiation *)
ballarin@25095
  2221
    val (raw_insts', raw_eqns) = raw_insts;
ballarin@25095
  2222
    val (raw_eq_attns, raw_eqns') = split_list raw_eqns;
ballarin@25286
  2223
    val (((instT, inst1), eqns), morphs) = prep_insts ctxt parms (raw_insts', raw_eqns');
ballarin@25095
  2224
    val eq_attns = map prep_attn raw_eq_attns;
haftmann@22300
  2225
haftmann@22300
  2226
    (* defined params without given instantiation *)
haftmann@22300
  2227
    val not_given = filter_out (Symtab.defined inst1 o fst) parms;
wenzelm@18137
  2228
    fun add_def (p, pT) inst =
ballarin@15596
  2229
      let
ballarin@15596
  2230
        val (t, T) = case find_first (fn (Free (a, _), _) => a = p) defs of
ballarin@15596
  2231
               NONE => error ("Instance missing for parameter " ^ quote p)
ballarin@15596
  2232
             | SOME (Free (_, T), t) => (t, T);
haftmann@22300
  2233
        val d = Element.inst_term (instT, inst) t;
wenzelm@18137
  2234
      in Symtab.update_new (p, d) inst end;
haftmann@22300
  2235
    val inst2 = fold add_def not_given inst1;
haftmann@22300
  2236
    val inst_morphism = Element.inst_morphism thy (instT, inst2);
wenzelm@18137
  2237
    (* Note: insts contain no vars. *)
ballarin@15596
  2238
ballarin@15596
  2239
    (** compute proof obligations **)
ballarin@15596
  2240
ballarin@15598
  2241
    (* restore "small" ids *)
ballarin@17000
  2242
    val ids' = map (fn ((n, ps), (_, mode)) =>
ballarin@19783
  2243
          ((n, map (fn p => Free (p, (the o AList.lookup (op =) parms) p)) ps), mode))
ballarin@19931
  2244
        ids;
ballarin@19931
  2245
    val (_, all_elemss') = chop (length raw_params_elemss) all_elemss
ballarin@15596
  2246
    (* instantiate ids and elements *)
ballarin@19931
  2247
    val inst_elemss = (ids' ~~ all_elemss') |> map (fn (((n, ps), _), ((_, mode), elems)) =>
ballarin@25286
  2248
      ((n, map (Morphism.term (inst_morphism $> fst morphs)) ps),
wenzelm@21483
  2249
        map (fn Int e => Element.morph_ctxt inst_morphism e) elems)
wenzelm@21483
  2250
      |> apfst (fn id => (id, map_mode (map (Element.morph_witness inst_morphism)) mode)));
ballarin@15596
  2251
ballarin@15624
  2252
    (* remove fragments already registered with theory or context *)
ballarin@22658
  2253
    val new_inst_elemss = filter_out (fn ((id, _), _) =>
ballarin@22658
  2254
          test_reg thy_ctxt id) inst_elemss;
ballarin@22658
  2255
ballarin@22658
  2256
    (* equations *)
ballarin@23918
  2257
    val eqn_elems = if null eqns then []
ballarin@23918
  2258
      else [(Library.last_elem inst_elemss |> fst |> fst, eqns)];
ballarin@22658
  2259
ballarin@22658
  2260
    val propss = map extract_asms_elems new_inst_elemss @ eqn_elems;
ballarin@15596
  2261
ballarin@25286
  2262
  in (propss, activate attn inst_elemss new_inst_elemss propss eq_attns morphs) end;
ballarin@15596
  2263
ballarin@22756
  2264
fun gen_prep_global_registration mk_ctxt = gen_prep_registration ProofContext.init
ballarin@25286
  2265
  test_global_registration
haftmann@22300
  2266
  global_activate_facts_elemss mk_ctxt;
ballarin@15624
  2267
ballarin@22756
  2268
fun gen_prep_local_registration mk_ctxt = gen_prep_registration I
ballarin@24787
  2269
  test_local_registration
haftmann@22300
  2270
  local_activate_facts_elemss mk_ctxt;
ballarin@15624
  2271
haftmann@22300
  2272
val prep_global_registration = gen_prep_global_registration
haftmann@22300
  2273
  Attrib.intern_src intern_expr read_instantiations;
ballarin@24941
  2274
val prep_global_registration_i = gen_prep_global_registration
wenzelm@25067
  2275
  (K I) (K I) check_instantiations;
haftmann@22300
  2276
haftmann@22300
  2277
val prep_local_registration = gen_prep_local_registration
haftmann@22300
  2278
  Attrib.intern_src intern_expr read_instantiations;
ballarin@24941
  2279
val prep_local_registration_i = gen_prep_local_registration
wenzelm@25067
  2280
  (K I) (K I) check_instantiations;
ballarin@15596
  2281
ballarin@17000
  2282
fun prep_registration_in_locale target expr thy =
ballarin@17000
  2283
  (* target already in internal form *)
ballarin@17000
  2284
  let
ballarin@17000
  2285
    val ctxt = ProofContext.init thy;
ballarin@17138
  2286
    val ((raw_target_ids, target_syn), _) = flatten (ctxt, I)
ballarin@17000
  2287
        (([], Symtab.empty), Expr (Locale target));
ballarin@19278
  2288
    val fixed = the_locale thy target |> #params |> map #1;
ballarin@17000
  2289
    val ((all_ids, syn), raw_elemss) = flatten (ctxt, intern_expr thy)
ballarin@17138
  2290
        ((raw_target_ids, target_syn), Expr expr);
wenzelm@19018
  2291
    val (target_ids, ids) = chop (length raw_target_ids) all_ids;
ballarin@17138
  2292
    val ((parms, elemss, _), _) = read_elemss false ctxt fixed raw_elemss [];
ballarin@17000
  2293
ballarin@17000
  2294
    (** compute proof obligations **)
ballarin@17000
  2295
ballarin@17000
  2296
    (* restore "small" ids, with mode *)
ballarin@17000
  2297
    val ids' = map (apsnd snd) ids;
ballarin@17000
  2298
    (* remove Int markers *)
ballarin@17000
  2299
    val elemss' = map (fn (_, es) =>
ballarin@17000
  2300
        map (fn Int e => e) es) elemss
ballarin@17000
  2301
    (* extract assumptions and defs *)
ballarin@17138
  2302
    val ids_elemss = ids' ~~ elemss';
wenzelm@19780
  2303
    val propss = map extract_asms_elems ids_elemss;
ballarin@17000
  2304
ballarin@17138
  2305
    (** activation function:
ballarin@17138
  2306
        - add registrations to the target locale
ballarin@17138
  2307
        - add induced registrations for all global registrations of
ballarin@17138
  2308
          the target, unless already present
ballarin@17138
  2309
        - add facts of induced registrations to theory **)
ballarin@17138
  2310
wenzelm@18123
  2311
    fun activate thmss thy = let
wenzelm@19780
  2312
        val satisfy = Element.satisfy_thm (flat thmss);
wenzelm@18123
  2313
        val ids_elemss_thmss = ids_elemss ~~ thmss;
ballarin@17138
  2314
        val regs = get_global_registrations thy target;
ballarin@17138
  2315
ballarin@17138
  2316
        fun activate_id (((id, Assumed _), _), thms) thy =
ballarin@17033
  2317
            thy |> put_registration_in_locale target id
ballarin@17138
  2318
                |> fold (add_witness_in_locale target id) thms
ballarin@17138
  2319
          | activate_id _ thy = thy;
ballarin@17138
  2320
ballarin@25286
  2321
        fun activate_reg (vts, (((fully_qualified, prfx), atts2), (exp, imp), _, _)) thy =
wenzelm@21483
  2322
          let
ballarin@25286
  2323
            val (insts, wits, _) = collect_global_witnesses thy imp fixed target_ids vts;
wenzelm@18137
  2324
            fun inst_parms ps = map
haftmann@17485
  2325
                  (the o AList.lookup (op =) (map #1 fixed ~~ vts)) ps;
wenzelm@19780
  2326
            val disch = Element.satisfy_thm wits;
wenzelm@19482
  2327
            val new_elemss = filter (fn (((name, ps), _), _) =>
ballarin@17138
  2328
                not (test_global_registration thy (name, inst_parms ps))) (ids_elemss);
ballarin@17138
  2329
            fun activate_assumed_id (((_, Derived _), _), _) thy = thy
ballarin@17138
  2330
              | activate_assumed_id ((((name, ps), Assumed _), _), thms) thy = let
ballarin@17138
  2331
                val ps' = inst_parms ps;
ballarin@17138
  2332
              in
ballarin@17138
  2333
                if test_global_registration thy (name, ps')
ballarin@17138
  2334
                then thy
ballarin@17138
  2335
                else thy
ballarin@25286
  2336
                  |> put_global_registration (name, ps') ((fully_qualified, prfx), atts2) (exp, imp)
wenzelm@19780
  2337
                  |> fold (fn witn => fn thy => add_global_witness (name, ps')
ballarin@25286
  2338
                     (Element.morph_witness (Element.inst_morphism thy insts) witn) thy) thms
ballarin@17138
  2339
              end;
ballarin@17138
  2340
ballarin@17138
  2341
            fun activate_derived_id ((_, Assumed _), _) thy = thy
ballarin@17138
  2342
              | activate_derived_id (((name, ps), Derived ths), _) thy = let
ballarin@17138
  2343
                val ps' = inst_parms ps;
ballarin@17138
  2344
              in
ballarin@17138
  2345
                if test_global_registration thy (name, ps')
ballarin@17138
  2346
                then thy
ballarin@17138
  2347
                else thy
ballarin@25286
  2348
                  |> put_global_registration (name, ps') ((fully_qualified, prfx), atts2) (exp, imp)
wenzelm@19780
  2349
                  |> fold (fn witn => fn thy => add_global_witness (name, ps')
wenzelm@19780
  2350
                       (witn |> Element.map_witness (fn (t, th) =>  (* FIXME *)
wenzelm@18137
  2351
                       (Element.inst_term insts t,
wenzelm@19780
  2352
                        disch (Element.inst_thm thy insts (satisfy th))))) thy) ths
ballarin@17138
  2353
              end;
ballarin@17138
  2354
ballarin@26645
  2355
            fun activate_elem (loc, ps) (Notes (kind, facts)) thy =
ballarin@17138
  2356
                let
wenzelm@21523
  2357
                  val att_morphism =
wenzelm@22241
  2358
                    Morphism.name_morphism (NameSpace.qualified prfx) $>
wenzelm@21523
  2359
                    Morphism.thm_morphism satisfy $>
wenzelm@21523
  2360
                    Element.inst_morphism thy insts $>
wenzelm@21523
  2361
                    Morphism.thm_morphism disch;
ballarin@17138
  2362
                  val facts' = facts
wenzelm@21523
  2363
                    |> Attrib.map_facts (Attrib.attribute_i thy o Args.morph_values att_morphism)
wenzelm@21523
  2364
                    |> map (apfst (apsnd (fn a => a @ map (Attrib.attribute thy) atts2)))
wenzelm@21523
  2365
                    |> map (apsnd (map (apfst (map (disch o Element.inst_thm thy insts o satisfy)))))
ballarin@17138
  2366
                in
haftmann@18377
  2367
                  thy
ballarin@26645
  2368
                  |> global_note_prefix_i kind loc (fully_qualified, prfx) facts'
haftmann@18377
  2369
                  |> snd
ballarin@17138
  2370
                end
ballarin@26645
  2371
              | activate_elem _ _ thy = thy;
ballarin@26645
  2372
ballarin@26645
  2373
            fun activate_elems ((id, _), elems) thy = fold (activate_elem id) elems thy;
ballarin@17138
  2374
ballarin@17138
  2375
          in thy |> fold activate_assumed_id ids_elemss_thmss
ballarin@17138
  2376
                 |> fold activate_derived_id ids_elemss
ballarin@17138
  2377
                 |> fold activate_elems new_elemss end;
ballarin@17033
  2378
      in
ballarin@17138
  2379
        thy |> fold activate_id ids_elemss_thmss
ballarin@17138
  2380
            |> fold activate_reg regs
ballarin@17033
  2381
      end;
ballarin@17000
  2382
ballarin@17033
  2383
  in (propss, activate) end;
ballarin@17000
  2384
wenzelm@21005
  2385
fun prep_propp propss = propss |> map (fn (_, props) =>
wenzelm@21361
  2386
  map (rpair [] o Element.mark_witness) props);
wenzelm@18123
  2387
wenzelm@18123
  2388
fun prep_result propps thmss =
wenzelm@19780
  2389
  ListPair.map (fn ((_, props), thms) => map2 Element.make_witness props thms) (propps, thmss);
ballarin@17437
  2390
haftmann@22300
  2391
fun gen_interpretation prep_registration after_qed (prfx, raw_atts) raw_expr raw_insts thy =
haftmann@22351
  2392
  (* prfx = (flag indicating full qualification, name prefix) *)
wenzelm@17355
  2393
  let
haftmann@22300
  2394
    val (propss, activate) = prep_registration thy (prfx, raw_atts) raw_expr raw_insts;
wenzelm@20366
  2395
    fun after_qed' results =
wenzelm@20366
  2396
      ProofContext.theory (activate (prep_result propss results))
wenzelm@20366
  2397
      #> after_qed;
wenzelm@18123
  2398
  in
haftmann@22300
  2399
    thy
wenzelm@23418
  2400
    |> ProofContext.init
wenzelm@21441
  2401
    |> Proof.theorem_i NONE after_qed' (prep_propp propss)
haftmann@22300
  2402
    |> Element.refine_witness
haftmann@22300
  2403
    |> Seq.hd
haftmann@22300
  2404
  end;
haftmann@22300
  2405
haftmann@22300
  2406
fun gen_interpret prep_registration after_qed (prfx, atts) expr insts int state =
haftmann@22351
  2407
  (* prfx = (flag indicating full qualification, name prefix) *)
haftmann@22300
  2408
  let
haftmann@22300
  2409
    val _ = Proof.assert_forward_or_chain state;
haftmann@22300
  2410
    val ctxt = Proof.context_of state;
haftmann@22300
  2411
    val (propss, activate) = prep_registration ctxt (prfx, atts) expr insts;
haftmann@22300
  2412
    fun after_qed' results =
haftmann@22300
  2413
      Proof.map_context (K (ctxt |> activate (prep_result propss results)))
haftmann@22300
  2414
      #> Proof.put_facts NONE
haftmann@22300
  2415
      #> after_qed;
haftmann@22300
  2416
  in
haftmann@22300
  2417
    state
haftmann@22300
  2418
    |> Proof.local_goal (ProofDisplay.print_results int) (K I) ProofContext.bind_propp_i
haftmann@22300
  2419
      "interpret" NONE after_qed' (map (pair ("", [])) (prep_propp propss))
wenzelm@19810
  2420
    |> Element.refine_witness |> Seq.hd
wenzelm@18123
  2421
  end;
wenzelm@17355
  2422
haftmann@22300
  2423
in
haftmann@22300
  2424
haftmann@22351
  2425
val interpretation_i = gen_interpretation prep_global_registration_i;
haftmann@22300
  2426
val interpretation = gen_interpretation prep_global_registration;
haftmann@22351
  2427
haftmann@22300
  2428
wenzelm@20366
  2429
fun interpretation_in_locale after_qed (raw_target, expr) thy =
wenzelm@17355
  2430
  let