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