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