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