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