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