src/Pure/Isar/locale.ML
author wenzelm
Wed Jun 07 02:01:33 2006 +0200 (2006-06-07)
changeset 19810 dae765e552ce
parent 19783 82f365a14960
child 19873 588329441a78
permissions -rw-r--r--
renamed Type.(un)varifyT to Logic.(un)varifyT;
made (un)varify strict wrt. global context -- may use legacy_(un)varify as workaround;
renaming: removed duplicate, use zip_options;
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@14215
     8
Draws some basic ideas from Florian Kammueller's original version of
wenzelm@12529
     9
locales, but uses the richer infrastructure of Isar instead of the raw
wenzelm@12529
    10
meta-logic.  Furthermore, we provide structured import of contexts
ballarin@14215
    11
(with merge and rename operations), 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.
wenzelm@11896
    23
*)
wenzelm@11896
    24
ballarin@16169
    25
(* TODO:
ballarin@16169
    26
- beta-eta normalisation of interpretation parameters
ballarin@16169
    27
- dangling type frees in locales
ballarin@16620
    28
- test subsumption of interpretations when merging theories
ballarin@17138
    29
- var vs. fixes in locale to be interpreted (interpretation in locale)
ballarin@17138
    30
  (implicit locale expressions generated by multiple registrations)
ballarin@16169
    31
*)
ballarin@16169
    32
wenzelm@11896
    33
signature LOCALE =
wenzelm@11896
    34
sig
wenzelm@12273
    35
  datatype expr =
wenzelm@12273
    36
    Locale of string |
ballarin@16102
    37
    Rename of expr * (string * mixfix option) option list |
wenzelm@12273
    38
    Merge of expr list
wenzelm@12273
    39
  val empty: expr
wenzelm@18137
    40
  datatype 'a element = Elem of 'a | Expr of expr
ballarin@15206
    41
wenzelm@16458
    42
  val intern: theory -> xstring -> string
wenzelm@16458
    43
  val extern: theory -> string -> xstring
wenzelm@18806
    44
  val init: string -> theory -> cterm list * Proof.context
ballarin@15206
    45
ballarin@18795
    46
  (* The specification of a locale *)
ballarin@18795
    47
ballarin@18795
    48
  val parameters_of: theory -> string ->
haftmann@18917
    49
    ((string * typ) * mixfix) list
ballarin@19276
    50
  val parameters_of_expr: theory -> expr ->
ballarin@19276
    51
    ((string * typ) * mixfix) list
ballarin@18795
    52
  val local_asms_of: theory -> string ->
ballarin@18795
    53
    ((string * Attrib.src list) * term list) list
ballarin@18795
    54
  val global_asms_of: theory -> string ->
ballarin@18795
    55
    ((string * Attrib.src list) * term list) list
ballarin@18795
    56
wenzelm@18899
    57
  (* Processing of locale statements *)
wenzelm@18137
    58
  val read_context_statement: xstring option -> Element.context element list ->
wenzelm@19585
    59
    (string * string list) list list -> Proof.context ->
wenzelm@18806
    60
    string option * (cterm list * Proof.context) * (cterm list * Proof.context) *
wenzelm@19585
    61
      (term * term list) list list
wenzelm@18137
    62
  val cert_context_statement: string option -> Element.context_i element list ->
wenzelm@19585
    63
    (term * term list) list list -> Proof.context ->
wenzelm@18806
    64
    string option * (cterm list * Proof.context) * (cterm list * Proof.context) *
wenzelm@19585
    65
      (term * term list) list list
wenzelm@19780
    66
  val read_expr: expr -> Element.context list -> Proof.context ->
wenzelm@19780
    67
    Element.context_i list * Proof.context
wenzelm@19780
    68
  val cert_expr: expr -> Element.context_i list -> Proof.context ->
wenzelm@19780
    69
    Element.context_i list * Proof.context
ballarin@15596
    70
ballarin@15596
    71
  (* Diagnostic functions *)
wenzelm@12758
    72
  val print_locales: theory -> unit
wenzelm@18137
    73
  val print_locale: theory -> bool -> expr -> Element.context list -> unit
ballarin@17138
    74
  val print_global_registrations: bool -> string -> theory -> unit
wenzelm@18617
    75
  val print_local_registrations': bool -> string -> Proof.context -> unit
wenzelm@18617
    76
  val print_local_registrations: bool -> string -> Proof.context -> unit
wenzelm@18137
    77
haftmann@18917
    78
  val add_locale: bool -> bstring -> expr -> Element.context list -> theory
ballarin@19293
    79
    -> (string * Proof.context (*body context!*)) * theory
haftmann@18917
    80
  val add_locale_i: bool -> bstring -> expr -> Element.context_i list -> theory
ballarin@19293
    81
    -> (string * Proof.context (*body context!*)) * theory
ballarin@15596
    82
ballarin@15696
    83
  (* Storing results *)
wenzelm@15703
    84
  val note_thmss: string -> xstring ->
wenzelm@18806
    85
    ((string * Attrib.src list) * (thmref * Attrib.src list) list) list ->
wenzelm@18806
    86
    theory -> ((string * thm list) list * (string * thm list) list) * (Proof.context * theory)
wenzelm@15703
    87
  val note_thmss_i: string -> string ->
wenzelm@18806
    88
    ((string * Attrib.src list) * (thm list * Attrib.src list) list) list ->
wenzelm@18806
    89
    theory -> ((string * thm list) list * (string * thm list) list) * (Proof.context * theory)
wenzelm@18806
    90
  val add_thmss: string -> string ->
wenzelm@18806
    91
    ((string * Attrib.src list) * (thm list * Attrib.src list) list) list ->
wenzelm@18806
    92
    cterm list * Proof.context ->
wenzelm@18806
    93
    ((string * thm list) list * (string * thm list) list) * Proof.context
wenzelm@19662
    94
  val add_term_syntax: string -> (Proof.context -> Proof.context) ->
wenzelm@19018
    95
    cterm list * Proof.context -> Proof.context
wenzelm@18137
    96
wenzelm@18123
    97
  val theorem: string -> Method.text option -> (thm list list -> theory -> theory) ->
wenzelm@18899
    98
    string * Attrib.src list -> Element.context element list -> Element.statement ->
wenzelm@17355
    99
    theory -> Proof.state
wenzelm@18123
   100
  val theorem_i: string -> Method.text option -> (thm list list -> theory -> theory) ->
wenzelm@18907
   101
    string * Attrib.src list -> Element.context_i element list -> Element.statement_i ->
wenzelm@17355
   102
    theory -> Proof.state
wenzelm@17856
   103
  val theorem_in_locale: string -> Method.text option ->
wenzelm@18123
   104
    (thm list list -> thm list list -> theory -> theory) ->
wenzelm@18899
   105
    xstring -> string * Attrib.src list -> Element.context element list -> Element.statement ->
wenzelm@17355
   106
    theory -> Proof.state
wenzelm@17856
   107
  val theorem_in_locale_i: string -> Method.text option ->
wenzelm@18123
   108
    (thm list list -> thm list list -> theory -> theory) ->
wenzelm@18137
   109
    string -> string * Attrib.src list -> Element.context_i element list ->
wenzelm@18907
   110
    Element.statement_i -> theory -> Proof.state
wenzelm@17355
   111
  val smart_theorem: string -> xstring option ->
wenzelm@18899
   112
    string * Attrib.src list -> Element.context element list -> Element.statement ->
wenzelm@17355
   113
    theory -> Proof.state
wenzelm@17355
   114
  val interpretation: string * Attrib.src list -> expr -> string option list ->
wenzelm@17355
   115
    theory -> Proof.state
wenzelm@17355
   116
  val interpretation_in_locale: xstring * expr -> theory -> Proof.state
wenzelm@17355
   117
  val interpret: string * Attrib.src list -> expr -> string option list ->
wenzelm@17355
   118
    bool -> Proof.state -> Proof.state
wenzelm@11896
   119
end;
wenzelm@12839
   120
wenzelm@12289
   121
structure Locale: LOCALE =
wenzelm@11896
   122
struct
wenzelm@11896
   123
wenzelm@19780
   124
wenzelm@12273
   125
(** locale elements and expressions **)
wenzelm@11896
   126
wenzelm@18137
   127
datatype ctxt = datatype Element.ctxt;
wenzelm@17355
   128
wenzelm@12273
   129
datatype expr =
wenzelm@12273
   130
  Locale of string |
ballarin@16102
   131
  Rename of expr * (string * mixfix option) option list |
wenzelm@12273
   132
  Merge of expr list;
wenzelm@11896
   133
wenzelm@12273
   134
val empty = Merge [];
wenzelm@12273
   135
wenzelm@18137
   136
datatype 'a element =
ballarin@15206
   137
  Elem of 'a | Expr of expr;
wenzelm@12273
   138
wenzelm@18137
   139
fun map_elem f (Elem e) = Elem (f e)
wenzelm@18137
   140
  | map_elem _ (Expr e) = Expr e;
wenzelm@18137
   141
wenzelm@12070
   142
type locale =
wenzelm@19780
   143
 {predicate: cterm list * Element.witness list,
ballarin@16736
   144
    (* CB: For locales with "(open)" this entry is ([], []).
ballarin@15206
   145
       For new-style locales, which declare predicates, if the locale declares
ballarin@15206
   146
       no predicates, this is also ([], []).
ballarin@15206
   147
       If the locale declares predicates, the record field is
ballarin@15206
   148
       ([statement], axioms), where statement is the locale predicate applied
ballarin@15206
   149
       to the (assumed) locale parameters.  Axioms contains the projections
ballarin@15206
   150
       from the locale predicate to the normalised assumptions of the locale
ballarin@15206
   151
       (cf. [1], normalisation of locale expressions.)
ballarin@15206
   152
    *)
wenzelm@19018
   153
  import: expr,                                                     (*dynamic import*)
ballarin@19783
   154
  elems: (Element.context_i * stamp) list,
ballarin@19783
   155
    (* Static content, neither Fixes nor Constrains elements *)
ballarin@19278
   156
  params: ((string * typ) * mixfix) list,                           (*all params*)
ballarin@19278
   157
  lparams: string list,                                             (*local parmas*)
wenzelm@19662
   158
  term_syntax: ((Proof.context -> Proof.context) * stamp) list, (* FIXME depend on morphism *)
wenzelm@19780
   159
  regs: ((string * string list) * Element.witness list) list}
wenzelm@19780
   160
    (* Registrations: indentifiers and witnesses of locales interpreted in the locale. *)
wenzelm@12063
   161
wenzelm@11896
   162
wenzelm@15703
   163
(* CB: an internal (Int) locale element was either imported or included,
wenzelm@15703
   164
   an external (Ext) element appears directly in the locale text. *)
wenzelm@15703
   165
wenzelm@15703
   166
datatype ('a, 'b) int_ext = Int of 'a | Ext of 'b;
wenzelm@15703
   167
wenzelm@15703
   168
wenzelm@15703
   169
ballarin@16736
   170
(** management of registrations in theories and proof contexts **)
wenzelm@11896
   171
ballarin@15837
   172
structure Registrations :
ballarin@15837
   173
  sig
ballarin@15837
   174
    type T
ballarin@15837
   175
    val empty: T
ballarin@15837
   176
    val join: T * T -> T
wenzelm@19780
   177
    val dest: T -> (term list * ((string * Attrib.src list) * Element.witness list)) list
wenzelm@16458
   178
    val lookup: theory -> T * term list ->
wenzelm@19780
   179
      ((string * Attrib.src list) * Element.witness list) option
wenzelm@16458
   180
    val insert: theory -> term list * (string * Attrib.src list) -> T ->
wenzelm@19780
   181
      T * (term list * ((string * Attrib.src list) * Element.witness list)) list
wenzelm@19780
   182
    val add_witness: term list -> Element.witness -> T -> T
ballarin@15837
   183
  end =
ballarin@15837
   184
struct
ballarin@15837
   185
  (* a registration consists of theorems instantiating locale assumptions
ballarin@15837
   186
     and prefix and attributes, indexed by parameter instantiation *)
wenzelm@19780
   187
  type T = ((string * Attrib.src list) * Element.witness list) Termtab.table;
ballarin@15837
   188
ballarin@15837
   189
  val empty = Termtab.empty;
ballarin@15837
   190
ballarin@15837
   191
  (* term list represented as single term, for simultaneous matching *)
ballarin@15837
   192
  fun termify ts =
wenzelm@18343
   193
    Term.list_comb (Const ("", map fastype_of ts ---> propT), ts);
ballarin@15837
   194
  fun untermify t =
ballarin@15837
   195
    let fun ut (Const _) ts = ts
ballarin@15837
   196
          | ut (s $ t) ts = ut s (t::ts)
ballarin@15837
   197
    in ut t [] end;
ballarin@15837
   198
ballarin@16620
   199
  (* joining of registrations: prefix and attributes of left theory,
ballarin@15837
   200
     thms are equal, no attempt to subsumption testing *)
wenzelm@19025
   201
  fun join (r1, r2) = Termtab.join (fn _ => fn (reg, _) => reg) (r1, r2);
ballarin@15837
   202
ballarin@15837
   203
  fun dest regs = map (apfst untermify) (Termtab.dest regs);
ballarin@15837
   204
ballarin@15837
   205
  (* registrations that subsume t *)
wenzelm@17203
   206
  fun subsumers thy t regs =
wenzelm@19482
   207
    filter (fn (t', _) => Pattern.matches thy (t', t)) (Termtab.dest regs);
ballarin@15837
   208
ballarin@15837
   209
  (* look up registration, pick one that subsumes the query *)
wenzelm@19780
   210
  fun lookup thy (regs, ts) =
ballarin@15837
   211
    let
ballarin@15837
   212
      val t = termify ts;
wenzelm@19780
   213
      val subs = subsumers thy t regs;
ballarin@15837
   214
    in (case subs of
ballarin@15837
   215
        [] => NONE
ballarin@15837
   216
      | ((t', (attn, thms)) :: _) => let
wenzelm@19780
   217
            val (tinst, inst) = Pattern.match thy (t', t) (Vartab.empty, Vartab.empty);
ballarin@15837
   218
            (* thms contain Frees, not Vars *)
ballarin@15837
   219
            val tinst' = tinst |> Vartab.dest
wenzelm@19810
   220
                 |> map (fn ((x, 0), (_, T)) => (x, Logic.legacy_unvarifyT T))
ballarin@15837
   221
                 |> Symtab.make;
ballarin@15837
   222
            val inst' = inst |> Vartab.dest
wenzelm@19810
   223
                 |> map (fn ((x, 0), (_, t)) => (x, Logic.legacy_unvarify t))
ballarin@15837
   224
                 |> Symtab.make;
ballarin@15837
   225
          in
wenzelm@19780
   226
            SOME (attn, map (Element.inst_witness thy (tinst', inst')) thms)
ballarin@15837
   227
          end)
ballarin@15837
   228
    end;
ballarin@15837
   229
ballarin@15837
   230
  (* add registration if not subsumed by ones already present,
ballarin@15837
   231
     additionally returns registrations that are strictly subsumed *)
ballarin@15837
   232
  fun insert sign (ts, attn) regs =
ballarin@15837
   233
    let
ballarin@15837
   234
      val t = termify ts;
wenzelm@17203
   235
      val subs = subsumers sign t regs ;
ballarin@15837
   236
    in (case subs of
ballarin@15837
   237
        [] => let
ballarin@15837
   238
                val sups =
wenzelm@19482
   239
                  filter (fn (t', _) => Pattern.matches sign (t, t')) (Termtab.dest regs);
ballarin@15837
   240
                val sups' = map (apfst untermify) sups
wenzelm@17412
   241
              in (Termtab.update (t, (attn, [])) regs, sups') end
ballarin@15837
   242
      | _ => (regs, []))
ballarin@15837
   243
    end;
ballarin@15837
   244
ballarin@15837
   245
  (* add witness theorem to registration,
ballarin@16169
   246
     only if instantiation is exact, otherwise exception Option raised *)
ballarin@15837
   247
  fun add_witness ts thm regs =
ballarin@15837
   248
    let
ballarin@15837
   249
      val t = termify ts;
wenzelm@18343
   250
      val (x, thms) = the (Termtab.lookup regs t);
ballarin@15837
   251
    in
wenzelm@17412
   252
      Termtab.update (t, (x, thm::thms)) regs
ballarin@15837
   253
    end;
ballarin@15837
   254
end;
ballarin@15837
   255
ballarin@16736
   256
ballarin@15837
   257
(** theory data **)
ballarin@15596
   258
wenzelm@16458
   259
structure GlobalLocalesData = TheoryDataFun
wenzelm@16458
   260
(struct
wenzelm@12014
   261
  val name = "Isar/locales";
ballarin@15837
   262
  type T = NameSpace.T * locale Symtab.table * Registrations.T Symtab.table;
ballarin@15596
   263
    (* 1st entry: locale namespace,
ballarin@15596
   264
       2nd entry: locales of the theory,
ballarin@15837
   265
       3rd entry: registrations, indexed by locale name *)
wenzelm@11896
   266
ballarin@15596
   267
  val empty = (NameSpace.empty, Symtab.empty, Symtab.empty);
wenzelm@12063
   268
  val copy = I;
wenzelm@16458
   269
  val extend = I;
wenzelm@12289
   270
wenzelm@19662
   271
  fun join_locs _ ({predicate, import, elems, params, lparams, term_syntax, regs}: locale,
wenzelm@19662
   272
      {elems = elems', term_syntax = term_syntax', regs = regs', ...}: locale) =
wenzelm@19018
   273
     {predicate = predicate,
wenzelm@19018
   274
      import = import,
haftmann@17496
   275
      elems = gen_merge_lists (eq_snd (op =)) elems elems',
ballarin@16736
   276
      params = params,
ballarin@19278
   277
      lparams = lparams,
wenzelm@19662
   278
      term_syntax = Library.merge (eq_snd (op =)) (term_syntax, term_syntax'),
ballarin@16736
   279
      regs = merge_alists regs regs'};
wenzelm@16458
   280
  fun merge _ ((space1, locs1, regs1), (space2, locs2, regs2)) =
ballarin@15596
   281
    (NameSpace.merge (space1, space2), Symtab.join join_locs (locs1, locs2),
wenzelm@19025
   282
     Symtab.join (K Registrations.join) (regs1, regs2));
wenzelm@12289
   283
ballarin@15596
   284
  fun print _ (space, locs, _) =
wenzelm@16346
   285
    Pretty.strs ("locales:" :: map #1 (NameSpace.extern_table (space, locs)))
wenzelm@12014
   286
    |> Pretty.writeln;
wenzelm@16458
   287
end);
wenzelm@11896
   288
wenzelm@18708
   289
val _ = Context.add_setup GlobalLocalesData.init;
wenzelm@15801
   290
wenzelm@15801
   291
ballarin@15624
   292
ballarin@15624
   293
(** context data **)
wenzelm@11896
   294
wenzelm@16458
   295
structure LocalLocalesData = ProofDataFun
wenzelm@16458
   296
(struct
ballarin@15624
   297
  val name = "Isar/locales";
ballarin@15837
   298
  type T = Registrations.T Symtab.table;
ballarin@15837
   299
    (* registrations, indexed by locale name *)
ballarin@15624
   300
  fun init _ = Symtab.empty;
ballarin@15624
   301
  fun print _ _ = ();
wenzelm@16458
   302
end);
ballarin@15624
   303
wenzelm@18708
   304
val _ = Context.add_setup LocalLocalesData.init;
wenzelm@12289
   305
wenzelm@12277
   306
wenzelm@12277
   307
(* access locales *)
wenzelm@12277
   308
ballarin@15624
   309
val print_locales = GlobalLocalesData.print;
ballarin@15624
   310
wenzelm@16458
   311
val intern = NameSpace.intern o #1 o GlobalLocalesData.get;
wenzelm@16458
   312
val extern = NameSpace.extern o #1 o GlobalLocalesData.get;
ballarin@15624
   313
wenzelm@16144
   314
fun declare_locale name thy =
wenzelm@16144
   315
  thy |> GlobalLocalesData.map (fn (space, locs, regs) =>
wenzelm@16458
   316
    (Sign.declare_name thy name space, locs, regs));
wenzelm@11896
   317
ballarin@15596
   318
fun put_locale name loc =
ballarin@15624
   319
  GlobalLocalesData.map (fn (space, locs, regs) =>
wenzelm@17412
   320
    (space, Symtab.update (name, loc) locs, regs));
wenzelm@17412
   321
wenzelm@17412
   322
fun get_locale thy name = Symtab.lookup (#2 (GlobalLocalesData.get thy)) name;
wenzelm@11896
   323
wenzelm@12014
   324
fun the_locale thy name =
wenzelm@12014
   325
  (case get_locale thy name of
skalberg@15531
   326
    SOME loc => loc
skalberg@15531
   327
  | NONE => error ("Unknown locale " ^ quote name));
wenzelm@11896
   328
wenzelm@18806
   329
fun change_locale name f thy =
wenzelm@18806
   330
  let
wenzelm@19662
   331
    val {predicate, import, elems, params, lparams, term_syntax, regs} = the_locale thy name;
wenzelm@19662
   332
    val (predicate', import', elems', params', lparams', term_syntax', regs') =
wenzelm@19662
   333
      f (predicate, import, elems, params, lparams, term_syntax, regs);
wenzelm@18806
   334
  in
wenzelm@18806
   335
    put_locale name {predicate = predicate', import = import', elems = elems',
wenzelm@19662
   336
      params = params', lparams = lparams', term_syntax = term_syntax', regs = regs'} thy
wenzelm@18806
   337
  end;
wenzelm@18806
   338
wenzelm@12046
   339
ballarin@15596
   340
(* access registrations *)
ballarin@15596
   341
ballarin@15696
   342
(* Ids of global registrations are varified,
ballarin@15696
   343
   Ids of local registrations are not.
ballarin@15696
   344
   Thms of registrations are never varified. *)
ballarin@15696
   345
ballarin@15624
   346
(* retrieve registration from theory or context *)
ballarin@15624
   347
ballarin@15696
   348
fun gen_get_registrations get thy_ctxt name =
wenzelm@17412
   349
  case Symtab.lookup (get thy_ctxt) name of
ballarin@15696
   350
      NONE => []
ballarin@15837
   351
    | SOME reg => Registrations.dest reg;
ballarin@15696
   352
ballarin@15696
   353
val get_global_registrations =
ballarin@15696
   354
     gen_get_registrations (#3 o GlobalLocalesData.get);
ballarin@15696
   355
val get_local_registrations =
ballarin@15696
   356
     gen_get_registrations LocalLocalesData.get;
ballarin@15696
   357
wenzelm@16458
   358
fun gen_get_registration get thy_of thy_ctxt (name, ps) =
wenzelm@17412
   359
  case Symtab.lookup (get thy_ctxt) name of
ballarin@15624
   360
      NONE => NONE
wenzelm@16458
   361
    | SOME reg => Registrations.lookup (thy_of thy_ctxt) (reg, ps);
ballarin@15624
   362
ballarin@15624
   363
val get_global_registration =
wenzelm@16458
   364
     gen_get_registration (#3 o GlobalLocalesData.get) I;
ballarin@15624
   365
val get_local_registration =
wenzelm@16458
   366
     gen_get_registration LocalLocalesData.get ProofContext.theory_of;
ballarin@15596
   367
wenzelm@18343
   368
val test_global_registration = is_some oo get_global_registration;
wenzelm@18343
   369
val test_local_registration = is_some oo get_local_registration;
ballarin@15624
   370
fun smart_test_registration ctxt id =
ballarin@15624
   371
  let
ballarin@15624
   372
    val thy = ProofContext.theory_of ctxt;
ballarin@15624
   373
  in
ballarin@15624
   374
    test_global_registration thy id orelse test_local_registration ctxt id
ballarin@15624
   375
  end;
ballarin@15624
   376
ballarin@15624
   377
ballarin@15837
   378
(* add registration to theory or context, ignored if subsumed *)
ballarin@15624
   379
wenzelm@16458
   380
fun gen_put_registration map_data thy_of (name, ps) attn thy_ctxt =
ballarin@15837
   381
  map_data (fn regs =>
ballarin@15837
   382
    let
wenzelm@16458
   383
      val thy = thy_of thy_ctxt;
wenzelm@18343
   384
      val reg = the_default Registrations.empty (Symtab.lookup regs name);
wenzelm@16458
   385
      val (reg', sups) = Registrations.insert thy (ps, attn) reg;
ballarin@15837
   386
      val _ = if not (null sups) then warning
ballarin@15837
   387
                ("Subsumed interpretation(s) of locale " ^
wenzelm@16458
   388
                 quote (extern thy name) ^
ballarin@15837
   389
                 "\nby interpretation(s) with the following prefix(es):\n" ^
ballarin@15837
   390
                  commas_quote (map (fn (_, ((s, _), _)) => s) sups))
ballarin@15837
   391
              else ();
wenzelm@17412
   392
    in Symtab.update (name, reg') regs end) thy_ctxt;
ballarin@15624
   393
ballarin@15624
   394
val put_global_registration =
ballarin@15624
   395
     gen_put_registration (fn f =>
wenzelm@16458
   396
       GlobalLocalesData.map (fn (space, locs, regs) => (space, locs, f regs))) I;
ballarin@15837
   397
val put_local_registration =
wenzelm@16458
   398
     gen_put_registration LocalLocalesData.map ProofContext.theory_of;
ballarin@15596
   399
wenzelm@18806
   400
fun put_registration_in_locale name id =
wenzelm@19662
   401
  change_locale name (fn (predicate, import, elems, params, lparams, term_syntax, regs) =>
wenzelm@19662
   402
    (predicate, import, elems, params, lparams, term_syntax, regs @ [(id, [])]));
ballarin@17000
   403
ballarin@15624
   404
ballarin@15624
   405
(* add witness theorem to registration in theory or context,
ballarin@15596
   406
   ignored if registration not present *)
ballarin@15596
   407
wenzelm@18123
   408
fun add_witness (name, ps) thm =
wenzelm@18123
   409
  Symtab.map_entry name (Registrations.add_witness ps thm);
wenzelm@18123
   410
wenzelm@18123
   411
fun add_global_witness id thm =
wenzelm@18123
   412
  GlobalLocalesData.map (fn (space, locs, regs) => (space, locs, add_witness id thm regs));
wenzelm@18123
   413
wenzelm@18123
   414
val add_local_witness = LocalLocalesData.map oo add_witness;
ballarin@15596
   415
wenzelm@18806
   416
fun add_witness_in_locale name id thm =
wenzelm@19662
   417
  change_locale name (fn (predicate, import, elems, params, lparams, term_syntax, regs) =>
ballarin@17000
   418
    let
ballarin@17000
   419
      fun add (id', thms) =
wenzelm@18806
   420
        if id = id' then (id', thm :: thms) else (id', thms);
wenzelm@19662
   421
    in (predicate, import, elems, params, lparams, term_syntax, map add regs) end);
ballarin@15596
   422
ballarin@14215
   423
ballarin@15624
   424
(* printing of registrations *)
ballarin@15596
   425
ballarin@17138
   426
fun gen_print_registrations get_regs mk_ctxt msg show_wits loc thy_ctxt =
ballarin@15596
   427
  let
wenzelm@15703
   428
    val ctxt = mk_ctxt thy_ctxt;
wenzelm@15703
   429
    val thy = ProofContext.theory_of ctxt;
wenzelm@15703
   430
wenzelm@15703
   431
    val prt_term = Pretty.quote o ProofContext.pretty_term ctxt;
ballarin@17096
   432
    fun prt_inst ts =
ballarin@17096
   433
        Pretty.enclose "(" ")" (Pretty.breaks (map prt_term ts));
ballarin@17096
   434
    fun prt_attn (prfx, atts) =
ballarin@17096
   435
        Pretty.breaks (Pretty.str prfx :: Args.pretty_attribs ctxt atts);
wenzelm@19780
   436
    fun prt_witns witns = Pretty.enclose "[" "]"
wenzelm@19780
   437
      (Pretty.breaks (map (prt_term o Element.witness_prop) witns));
wenzelm@19780
   438
    fun prt_reg (ts, (("", []), witns)) =
ballarin@17138
   439
        if show_wits
wenzelm@19780
   440
          then Pretty.block [prt_inst ts, Pretty.fbrk, prt_witns witns]
ballarin@17096
   441
          else prt_inst ts
wenzelm@19780
   442
      | prt_reg (ts, (attn, witns)) =
ballarin@17138
   443
        if show_wits
ballarin@17096
   444
          then Pretty.block ((prt_attn attn @
ballarin@17096
   445
            [Pretty.str ":", Pretty.brk 1, prt_inst ts, Pretty.fbrk,
wenzelm@19780
   446
              prt_witns witns]))
ballarin@17096
   447
          else Pretty.block ((prt_attn attn @
ballarin@17096
   448
            [Pretty.str ":", Pretty.brk 1, prt_inst ts]));
wenzelm@15703
   449
wenzelm@16458
   450
    val loc_int = intern thy loc;
ballarin@15624
   451
    val regs = get_regs thy_ctxt;
wenzelm@17412
   452
    val loc_regs = Symtab.lookup regs loc_int;
ballarin@15596
   453
  in
ballarin@15596
   454
    (case loc_regs of
wenzelm@17355
   455
        NONE => Pretty.str ("no interpretations in " ^ msg)
ballarin@15763
   456
      | SOME r => let
ballarin@15837
   457
            val r' = Registrations.dest r;
ballarin@15763
   458
            val r'' = Library.sort_wrt (fn (_, ((prfx, _), _)) => prfx) r';
wenzelm@17355
   459
          in Pretty.big_list ("interpretations in " ^ msg ^ ":")
ballarin@17096
   460
            (map prt_reg r'')
ballarin@15763
   461
          end)
ballarin@15596
   462
    |> Pretty.writeln
ballarin@15596
   463
  end;
ballarin@15596
   464
ballarin@15624
   465
val print_global_registrations =
ballarin@15624
   466
     gen_print_registrations (#3 o GlobalLocalesData.get)
wenzelm@15703
   467
       ProofContext.init "theory";
ballarin@15624
   468
val print_local_registrations' =
ballarin@15624
   469
     gen_print_registrations LocalLocalesData.get
wenzelm@15703
   470
       I "context";
ballarin@17138
   471
fun print_local_registrations show_wits loc ctxt =
ballarin@17138
   472
  (print_global_registrations show_wits loc (ProofContext.theory_of ctxt);
ballarin@17138
   473
   print_local_registrations' show_wits loc ctxt);
ballarin@15624
   474
ballarin@15596
   475
wenzelm@12277
   476
(* diagnostics *)
wenzelm@12273
   477
wenzelm@12277
   478
fun err_in_locale ctxt msg ids =
wenzelm@12277
   479
  let
wenzelm@16458
   480
    val thy = ProofContext.theory_of ctxt;
wenzelm@12529
   481
    fun prt_id (name, parms) =
wenzelm@16458
   482
      [Pretty.block (Pretty.breaks (map Pretty.str (extern thy name :: parms)))];
wenzelm@19482
   483
    val prt_ids = flat (separate [Pretty.str " +", Pretty.brk 1] (map prt_id ids));
wenzelm@12502
   484
    val err_msg =
wenzelm@12529
   485
      if forall (equal "" o #1) ids then msg
wenzelm@12502
   486
      else msg ^ "\n" ^ Pretty.string_of (Pretty.block
wenzelm@12502
   487
        (Pretty.str "The error(s) above occurred in locale:" :: Pretty.brk 1 :: prt_ids));
wenzelm@18678
   488
  in error err_msg end;
wenzelm@12063
   489
ballarin@15206
   490
fun err_in_locale' ctxt msg ids' = err_in_locale ctxt msg (map fst ids');
wenzelm@12277
   491
wenzelm@12277
   492
ballarin@19783
   493
fun pretty_ren NONE = Pretty.str "_"
ballarin@19783
   494
  | pretty_ren (SOME (x, NONE)) = Pretty.str x
ballarin@19783
   495
  | pretty_ren (SOME (x, SOME syn)) =
ballarin@19783
   496
      Pretty.block [Pretty.str x, Pretty.brk 1, Syntax.pretty_mixfix syn];
ballarin@19783
   497
ballarin@19783
   498
fun pretty_expr thy (Locale name) = Pretty.str (extern thy name)
ballarin@19783
   499
  | pretty_expr thy (Rename (expr, xs)) =
ballarin@19783
   500
      Pretty.block [pretty_expr thy expr, Pretty.brk 1, Pretty.block (map pretty_ren xs |> Pretty.breaks)]
ballarin@19783
   501
  | pretty_expr thy (Merge es) =
ballarin@19783
   502
      Pretty.separate "+" (map (pretty_expr thy) es) |> Pretty.block;
ballarin@19783
   503
ballarin@19783
   504
fun err_in_expr _ msg (Merge []) = error msg
ballarin@19783
   505
  | err_in_expr ctxt msg expr =
ballarin@19783
   506
    error (msg ^ "\n" ^ Pretty.string_of (Pretty.block
ballarin@19783
   507
      [Pretty.str "The error(s) above occured in locale expression:", Pretty.brk 1,
ballarin@19783
   508
       pretty_expr (ProofContext.theory_of ctxt) expr]));
ballarin@19783
   509
wenzelm@12046
   510
wenzelm@12529
   511
(** structured contexts: rename + merge + implicit type instantiation **)
wenzelm@12529
   512
wenzelm@12529
   513
(* parameter types *)
wenzelm@12529
   514
wenzelm@12529
   515
fun frozen_tvars ctxt Ts =
wenzelm@12529
   516
  let
wenzelm@16861
   517
    val tvars = rev (fold Term.add_tvarsT Ts []);
wenzelm@12529
   518
    val tfrees = map TFree
wenzelm@14695
   519
      (Term.invent_names (ProofContext.used_types ctxt) "'a" (length tvars) ~~ map #2 tvars);
wenzelm@18343
   520
  in map (fn ((xi, S), T) => (xi, (S, T))) (tvars ~~ tfrees) end;
wenzelm@12529
   521
wenzelm@12529
   522
fun unify_frozen ctxt maxidx Ts Us =
wenzelm@12529
   523
  let
wenzelm@18343
   524
    fun paramify NONE i = (NONE, i)
wenzelm@18343
   525
      | paramify (SOME T) i = apfst SOME (TypeInfer.paramify_dummies T i);
wenzelm@12529
   526
wenzelm@18343
   527
    val (Ts', maxidx') = fold_map paramify Ts maxidx;
wenzelm@18343
   528
    val (Us', maxidx'') = fold_map paramify Us maxidx';
wenzelm@16947
   529
    val thy = ProofContext.theory_of ctxt;
ballarin@14215
   530
wenzelm@18190
   531
    fun unify (SOME T, SOME U) env = (Sign.typ_unify thy (U, T) env
wenzelm@18190
   532
          handle Type.TUNIFY => raise TYPE ("unify_frozen: failed to unify types", [U, T], []))
wenzelm@18190
   533
      | unify _ env = env;
wenzelm@18190
   534
    val (unifier, _) = fold unify (Ts' ~~ Us') (Vartab.empty, maxidx'');
skalberg@15570
   535
    val Vs = map (Option.map (Envir.norm_type unifier)) Us';
wenzelm@19482
   536
    val unifier' = Vartab.extend (unifier, frozen_tvars ctxt (map_filter I Vs));
skalberg@15570
   537
  in map (Option.map (Envir.norm_type unifier')) Vs end;
wenzelm@12529
   538
wenzelm@19482
   539
fun params_of elemss = distinct (eq_fst (op =)) (maps (snd o fst) elemss);
wenzelm@19482
   540
fun params_of' elemss = distinct (eq_fst (op =)) (maps (snd o fst o fst) elemss);
ballarin@16102
   541
fun params_syn_of syn elemss =
wenzelm@19482
   542
  distinct (eq_fst (op =)) (maps (snd o fst) elemss) |>
wenzelm@18343
   543
    map (apfst (fn x => (x, the (Symtab.lookup syn x))));
ballarin@16102
   544
ballarin@14508
   545
ballarin@14508
   546
(* CB: param_types has the following type:
skalberg@15531
   547
  ('a * 'b option) list -> ('a * 'b) list *)
wenzelm@19482
   548
fun param_types ps = map_filter (fn (_, NONE) => NONE | (x, SOME T) => SOME (x, T)) ps;
wenzelm@12529
   549
wenzelm@12529
   550
ballarin@16102
   551
fun merge_syntax ctxt ids ss = Symtab.merge (op =) ss
ballarin@16102
   552
  handle Symtab.DUPS xs => err_in_locale ctxt
ballarin@16105
   553
    ("Conflicting syntax for parameter(s): " ^ commas_quote xs) (map fst ids);
ballarin@16102
   554
ballarin@16102
   555
ballarin@17000
   556
(* Distinction of assumed vs. derived identifiers.
ballarin@17000
   557
   The former may have axioms relating assumptions of the context to
ballarin@17000
   558
   assumptions of the specification fragment (for locales with
wenzelm@19780
   559
   predicates).  The latter have witnesses relating assumptions of the
ballarin@17000
   560
   specification fragment to assumptions of other (assumed) specification
ballarin@17000
   561
   fragments. *)
ballarin@17000
   562
ballarin@17000
   563
datatype 'a mode = Assumed of 'a | Derived of 'a;
ballarin@17000
   564
ballarin@17000
   565
fun map_mode f (Assumed x) = Assumed (f x)
ballarin@17000
   566
  | map_mode f (Derived x) = Derived (f x);
ballarin@17000
   567
wenzelm@18123
   568
wenzelm@12529
   569
(* flatten expressions *)
wenzelm@11896
   570
wenzelm@12510
   571
local
wenzelm@12502
   572
wenzelm@18137
   573
fun unify_parms ctxt fixed_parms raw_parmss =
wenzelm@12502
   574
  let
wenzelm@16458
   575
    val thy = ProofContext.theory_of ctxt;
wenzelm@12502
   576
    val maxidx = length raw_parmss;
wenzelm@12502
   577
    val idx_parmss = (0 upto maxidx - 1) ~~ raw_parmss;
wenzelm@12502
   578
wenzelm@12502
   579
    fun varify i = Term.map_type_tfree (fn (a, S) => TVar ((a, i), S));
wenzelm@12529
   580
    fun varify_parms (i, ps) = map (apsnd (varify i)) (param_types ps);
wenzelm@19482
   581
    val parms = fixed_parms @ maps varify_parms idx_parmss;
wenzelm@12502
   582
wenzelm@18137
   583
    fun unify T U envir = Sign.typ_unify thy (U, T) envir
ballarin@15206
   584
      handle Type.TUNIFY =>
wenzelm@18137
   585
        let val prt = Sign.string_of_typ thy in
wenzelm@18137
   586
          raise TYPE ("unify_parms: failed to unify types " ^
wenzelm@18137
   587
            prt U ^ " and " ^ prt T, [U, T], [])
wenzelm@18137
   588
        end;
wenzelm@18137
   589
    fun unify_list (T :: Us) = fold (unify T) Us
wenzelm@18137
   590
      | unify_list [] = I;
wenzelm@18952
   591
    val (unifier, _) = fold unify_list (map #2 (Symtab.dest (Symtab.make_list parms)))
wenzelm@18137
   592
      (Vartab.empty, maxidx);
wenzelm@12502
   593
wenzelm@19061
   594
    val parms' = map (apsnd (Envir.norm_type unifier)) (distinct (eq_fst (op =)) parms);
wenzelm@12502
   595
    val unifier' = Vartab.extend (unifier, frozen_tvars ctxt (map #2 parms'));
wenzelm@12502
   596
wenzelm@12502
   597
    fun inst_parms (i, ps) =
wenzelm@19482
   598
      foldr Term.add_typ_tfrees [] (map_filter snd ps)
wenzelm@19482
   599
      |> map_filter (fn (a, S) =>
wenzelm@12502
   600
          let val T = Envir.norm_type unifier' (TVar ((a, i), S))
wenzelm@18137
   601
          in if T = TFree (a, S) then NONE else SOME (a, T) end)
wenzelm@18137
   602
      |> Symtab.make;
wenzelm@18137
   603
  in map inst_parms idx_parmss end;
wenzelm@12502
   604
wenzelm@12529
   605
in
wenzelm@12502
   606
wenzelm@12529
   607
fun unify_elemss _ _ [] = []
wenzelm@12529
   608
  | unify_elemss _ [] [elems] = [elems]
wenzelm@12529
   609
  | unify_elemss ctxt fixed_parms elemss =
wenzelm@12502
   610
      let
wenzelm@18137
   611
        val thy = ProofContext.theory_of ctxt;
wenzelm@17756
   612
        val envs = unify_parms ctxt fixed_parms (map (snd o fst o fst) elemss);
ballarin@17000
   613
        fun inst ((((name, ps), mode), elems), env) =
wenzelm@18137
   614
          (((name, map (apsnd (Option.map (Element.instT_type env))) ps),
wenzelm@19780
   615
              map_mode (map (Element.instT_witness thy env)) mode),
wenzelm@18137
   616
            map (Element.instT_ctxt thy env) elems);
wenzelm@12839
   617
      in map inst (elemss ~~ envs) end;
wenzelm@12502
   618
ballarin@17000
   619
(* like unify_elemss, but does not touch mode, additional
ballarin@16736
   620
   parameter c_parms for enforcing further constraints (eg. syntax) *)
wenzelm@19810
   621
(* FIXME avoid code duplication *)
ballarin@16102
   622
ballarin@16102
   623
fun unify_elemss' _ _ [] [] = []
ballarin@16102
   624
  | unify_elemss' _ [] [elems] [] = [elems]
ballarin@16102
   625
  | unify_elemss' ctxt fixed_parms elemss c_parms =
ballarin@16102
   626
      let
wenzelm@18137
   627
        val thy = ProofContext.theory_of ctxt;
wenzelm@18137
   628
        val envs =
wenzelm@18137
   629
          unify_parms ctxt fixed_parms (map (snd o fst o fst) elemss @ map single c_parms);
ballarin@17033
   630
        fun inst ((((name, ps), (ps', mode)), elems), env) =
wenzelm@18137
   631
          (((name, map (apsnd (Option.map (Element.instT_type env))) ps), (ps', mode)),
wenzelm@18137
   632
           map (Element.instT_ctxt thy env) elems);
wenzelm@18343
   633
      in map inst (elemss ~~ Library.take (length elemss, envs)) end;
ballarin@16102
   634
ballarin@17000
   635
wenzelm@19810
   636
fun renaming xs parms = zip_options parms xs
wenzelm@19810
   637
  handle Library.UnequalLengths =>
wenzelm@19810
   638
    error ("Too many arguments in renaming: " ^
wenzelm@19810
   639
      commas (map (fn NONE => "_" | SOME x => quote (fst x)) xs));
wenzelm@19810
   640
wenzelm@19810
   641
ballarin@19783
   642
(* params_of_expr:
ballarin@19783
   643
   Compute parameters (with types and syntax) of locale expression.
ballarin@19783
   644
*)
ballarin@19783
   645
ballarin@19783
   646
fun params_of_expr ctxt fixed_params expr (prev_parms, prev_types, prev_syn) =
ballarin@19783
   647
  let
ballarin@19783
   648
    val thy = ProofContext.theory_of ctxt;
ballarin@19783
   649
ballarin@19783
   650
    fun merge_tenvs fixed tenv1 tenv2 =
ballarin@19783
   651
        let
ballarin@19783
   652
          val [env1, env2] = unify_parms ctxt fixed
ballarin@19783
   653
                [tenv1 |> Symtab.dest |> map (apsnd SOME),
ballarin@19783
   654
                 tenv2 |> Symtab.dest |> map (apsnd SOME)]
ballarin@19783
   655
        in
ballarin@19783
   656
          Symtab.merge (op =) (Symtab.map (Element.instT_type env1) tenv1,
ballarin@19783
   657
            Symtab.map (Element.instT_type env2) tenv2)
ballarin@19783
   658
        end;
ballarin@19783
   659
ballarin@19783
   660
    fun merge_syn expr syn1 syn2 =
ballarin@19783
   661
        Symtab.merge (op =) (syn1, syn2)
ballarin@19783
   662
        handle Symtab.DUPS xs => err_in_expr ctxt
ballarin@19783
   663
          ("Conflicting syntax for parameter(s): " ^ commas_quote xs) expr;
ballarin@19783
   664
            
ballarin@19783
   665
    fun params_of (expr as Locale name) =
ballarin@19783
   666
          let
ballarin@19783
   667
            val {import, params, ...} = the_locale thy name;
ballarin@19783
   668
            val parms = map (fst o fst) params;
ballarin@19783
   669
            val (parms', types', syn') = params_of import;
ballarin@19783
   670
            val all_parms = merge_lists parms' parms;
ballarin@19783
   671
            val all_types = merge_tenvs [] types' (params |> map fst |> Symtab.make);
ballarin@19783
   672
            val all_syn = merge_syn expr syn' (params |> map (apfst fst) |> Symtab.make);
ballarin@19783
   673
          in (all_parms, all_types, all_syn) end
ballarin@19783
   674
      | params_of (expr as Rename (e, xs)) =
ballarin@19783
   675
          let
ballarin@19783
   676
            val (parms', types', syn') = params_of e;
ballarin@19783
   677
            val ren = renaming xs parms';
ballarin@19783
   678
            (* renaming may reduce number of parameters *)
ballarin@19783
   679
            val new_parms = map (Element.rename ren) parms' |> distinct (op =);
ballarin@19783
   680
            val ren_syn = syn' |> Symtab.dest |> map (Element.rename_var ren);
ballarin@19783
   681
            val new_syn = fold (Symtab.insert (op =)) ren_syn Symtab.empty
ballarin@19783
   682
                handle Symtab.DUP x =>
ballarin@19783
   683
                  err_in_expr ctxt ("Conflicting syntax for parameter: " ^ quote x) expr;
ballarin@19783
   684
            val syn_types = map (apsnd (fn mx => SOME (Type.freeze_type (#1 (TypeInfer.paramify_dummies (TypeInfer.mixfixT mx) 0))))) (Symtab.dest new_syn);
ballarin@19783
   685
            val ren_types = types' |> Symtab.dest |> map (apfst (Element.rename ren));
ballarin@19783
   686
            val (env :: _) = unify_parms ctxt [] 
ballarin@19783
   687
                ((ren_types |> map (apsnd SOME)) :: map single syn_types);
ballarin@19783
   688
            val new_types = fold (Symtab.insert (op =))
ballarin@19783
   689
                (map (apsnd (Element.instT_type env)) ren_types) Symtab.empty;
ballarin@19783
   690
          in (new_parms, new_types, new_syn) end
ballarin@19783
   691
      | params_of (Merge es) =
ballarin@19783
   692
          fold (fn e => fn (parms, types, syn) =>
ballarin@19783
   693
                   let
ballarin@19783
   694
                     val (parms', types', syn') = params_of e
ballarin@19783
   695
                   in
ballarin@19783
   696
                     (merge_lists parms parms', merge_tenvs [] types types',
ballarin@19783
   697
                      merge_syn e syn syn')
ballarin@19783
   698
                   end)
ballarin@19783
   699
            es ([], Symtab.empty, Symtab.empty)
ballarin@19783
   700
ballarin@19783
   701
      val (parms, types, syn) = params_of expr;
ballarin@19783
   702
    in
ballarin@19783
   703
      (merge_lists prev_parms parms, merge_tenvs fixed_params prev_types types,
ballarin@19783
   704
       merge_syn expr prev_syn syn)
ballarin@19783
   705
    end;
ballarin@19783
   706
ballarin@19783
   707
fun make_params_ids params = [(("", params), ([], Assumed []))];
ballarin@19783
   708
fun make_raw_params_elemss (params, tenv, syn) =
ballarin@19783
   709
    [((("", map (fn p => (p, Symtab.lookup tenv p)) params), Assumed []),
ballarin@19783
   710
      Int [Fixes (map (fn p =>
ballarin@19783
   711
        (p, Symtab.lookup tenv p, Symtab.lookup syn p |> the)) params)])];
ballarin@19783
   712
ballarin@19783
   713
ballarin@15596
   714
(* flatten_expr:
ballarin@15596
   715
   Extend list of identifiers by those new in locale expression expr.
ballarin@15596
   716
   Compute corresponding list of lists of locale elements (one entry per
ballarin@15596
   717
   identifier).
ballarin@15596
   718
ballarin@15596
   719
   Identifiers represent locale fragments and are in an extended form:
ballarin@15596
   720
     ((name, ps), (ax_ps, axs))
ballarin@15596
   721
   (name, ps) is the locale name with all its parameters.
ballarin@15596
   722
   (ax_ps, axs) is the locale axioms with its parameters;
ballarin@15596
   723
     axs are always taken from the top level of the locale hierarchy,
ballarin@15596
   724
     hence axioms may contain additional parameters from later fragments:
ballarin@15596
   725
     ps subset of ax_ps.  axs is either singleton or empty.
ballarin@15596
   726
ballarin@15596
   727
   Elements are enriched by identifier-like information:
ballarin@15596
   728
     (((name, ax_ps), axs), elems)
ballarin@15596
   729
   The parameters in ax_ps are the axiom parameters, but enriched by type
ballarin@15596
   730
   info: now each entry is a pair of string and typ option.  Axioms are
ballarin@15596
   731
   type-instantiated.
ballarin@15596
   732
ballarin@15596
   733
*)
ballarin@15596
   734
ballarin@16102
   735
fun flatten_expr ctxt ((prev_idents, prev_syntax), expr) =
wenzelm@12014
   736
  let
wenzelm@12014
   737
    val thy = ProofContext.theory_of ctxt;
wenzelm@12263
   738
ballarin@17000
   739
    fun rename_parms top ren ((name, ps), (parms, mode)) =
ballarin@19783
   740
        ((name, map (Element.rename ren) ps),
ballarin@19783
   741
         if top
ballarin@19783
   742
         then (map (Element.rename ren) parms,
ballarin@19783
   743
               map_mode (map (Element.rename_witness ren)) mode)
ballarin@19783
   744
         else (parms, mode));
wenzelm@12263
   745
wenzelm@19780
   746
    (* add registrations of (name, ps), recursively; adjust hyps of witnesses *)
ballarin@17000
   747
ballarin@17000
   748
    fun add_regs (name, ps) (ths, ids) =
ballarin@17000
   749
        let
ballarin@17000
   750
          val {params, regs, ...} = the_locale thy name;
ballarin@19278
   751
          val ps' = map #1 params;
ballarin@17096
   752
          val ren = map #1 ps' ~~ map (fn (x, _) => (x, NONE)) ps;
ballarin@17000
   753
            (* dummy syntax, since required by rename *)
ballarin@17096
   754
          val ps'' = map (fn ((p, _), (_, T)) => (p, T)) (ps ~~ ps');
ballarin@17096
   755
          val [env] = unify_parms ctxt ps [map (apsnd SOME) ps''];
ballarin@17096
   756
            (* propagate parameter types, to keep them consistent *)
ballarin@17000
   757
          val regs' = map (fn ((name, ps), ths) =>
wenzelm@18137
   758
              ((name, map (Element.rename ren) ps), ths)) regs;
haftmann@17496
   759
          val new_regs = gen_rems (eq_fst (op =)) (regs', ids);
ballarin@17000
   760
          val new_ids = map fst new_regs;
haftmann@17485
   761
          val new_idTs = map (apsnd (map (fn p => (p, (the o AList.lookup (op =) ps) p)))) new_ids;
ballarin@17096
   762
wenzelm@19780
   763
          val new_ths = new_regs |> map (#2 #> map
wenzelm@19780
   764
            (Element.instT_witness thy env #>
wenzelm@19780
   765
              Element.rename_witness ren #>
wenzelm@19780
   766
              Element.satisfy_witness ths));
ballarin@17000
   767
          val new_ids' = map (fn (id, ths) =>
ballarin@17000
   768
              (id, ([], Derived ths))) (new_ids ~~ new_ths);
ballarin@17000
   769
        in
wenzelm@19482
   770
          fold add_regs new_idTs (ths @ flat new_ths, ids @ new_ids')
ballarin@17000
   771
        end;
ballarin@17000
   772
ballarin@17000
   773
    (* distribute top-level axioms over assumed ids *)
ballarin@17000
   774
ballarin@17000
   775
    fun axiomify all_ps ((name, parms), (_, Assumed _)) axioms =
ballarin@17000
   776
        let
ballarin@17000
   777
          val {elems, ...} = the_locale thy name;
wenzelm@19482
   778
          val ts = maps
wenzelm@19482
   779
            (fn (Assumes asms, _) => maps (map #1 o #2) asms
ballarin@17000
   780
              | _ => [])
wenzelm@19482
   781
            elems;
wenzelm@19018
   782
          val (axs1, axs2) = chop (length ts) axioms;
ballarin@17000
   783
        in (((name, parms), (all_ps, Assumed axs1)), axs2) end
ballarin@17000
   784
      | axiomify all_ps (id, (_, Derived ths)) axioms =
ballarin@17000
   785
          ((id, (all_ps, Derived ths)), axioms);
ballarin@17000
   786
ballarin@17096
   787
    (* identifiers of an expression *)
ballarin@17096
   788
ballarin@15206
   789
    fun identify top (Locale name) =
ballarin@15596
   790
    (* CB: ids_ax is a list of tuples of the form ((name, ps), axs),
ballarin@15206
   791
       where name is a locale name, ps a list of parameter names and axs
ballarin@15206
   792
       a list of axioms relating to the identifier, axs is empty unless
ballarin@15206
   793
       identify at top level (top = true);
ballarin@14215
   794
       parms is accumulated list of parameters *)
wenzelm@12289
   795
          let
ballarin@15206
   796
            val {predicate = (_, axioms), import, params, ...} =
ballarin@15206
   797
              the_locale thy name;
ballarin@19278
   798
            val ps = map (#1 o #1) params;
ballarin@17096
   799
            val (ids', parms', _) = identify false import;
ballarin@15206
   800
                (* acyclic import dependencies *)
ballarin@17000
   801
            val ids'' = ids' @ [((name, ps), ([], Assumed []))];
ballarin@19278
   802
            val (_, ids''') = add_regs (name, map #1 params) ([], ids'');
ballarin@17000
   803
ballarin@17000
   804
            val ids_ax = if top then fst
ballarin@17000
   805
                 (fold_map (axiomify ps) ids''' axioms)
ballarin@17000
   806
              else ids''';
ballarin@19278
   807
            val syn = Symtab.make (map (apfst fst) params);
ballarin@17096
   808
            in (ids_ax, merge_lists parms' ps, syn) end
ballarin@15206
   809
      | identify top (Rename (e, xs)) =
wenzelm@12273
   810
          let
ballarin@17096
   811
            val (ids', parms', syn') = identify top e;
wenzelm@12839
   812
            val ren = renaming xs parms'
wenzelm@18678
   813
              handle ERROR msg => err_in_locale' ctxt msg ids';
ballarin@17096
   814
wenzelm@19061
   815
            val ids'' = distinct (eq_fst (op =)) (map (rename_parms top ren) ids');
wenzelm@19482
   816
            val parms'' = distinct (op =) (maps (#2 o #1) ids'');
ballarin@19783
   817
            val syn'' = fold (Symtab.insert (op =))
ballarin@19783
   818
                (map (Element.rename_var ren) (Symtab.dest syn')) Symtab.empty;
ballarin@17096
   819
          in (ids'', parms'', syn'') end
ballarin@15206
   820
      | identify top (Merge es) =
ballarin@17096
   821
          fold (fn e => fn (ids, parms, syn) =>
ballarin@17000
   822
                   let
ballarin@17096
   823
                     val (ids', parms', syn') = identify top e
ballarin@17000
   824
                   in
ballarin@17000
   825
                     (merge_alists ids ids',
ballarin@17000
   826
                      merge_lists parms parms',
ballarin@17096
   827
                      merge_syntax ctxt ids' (syn, syn'))
ballarin@17000
   828
                   end)
ballarin@17096
   829
            es ([], [], Symtab.empty);
ballarin@17000
   830
wenzelm@12014
   831
wenzelm@18137
   832
    (* CB: enrich identifiers by parameter types and
ballarin@16102
   833
       the corresponding elements (with renamed parameters),
ballarin@16102
   834
       also takes care of parameter syntax *)
ballarin@15206
   835
ballarin@16102
   836
    fun eval syn ((name, xs), axs) =
wenzelm@12273
   837
      let
ballarin@19278
   838
        val {params = ps, lparams = qs, elems, ...} = the_locale thy name;
ballarin@16620
   839
        val ps' = map (apsnd SOME o #1) ps;
wenzelm@18671
   840
        fun lookup_syn x = (case Symtab.lookup syn x of SOME Structure => NONE | opt => opt);
wenzelm@18671
   841
        val ren = map #1 ps' ~~ map (fn x => (x, lookup_syn x)) xs;
wenzelm@13308
   842
        val (params', elems') =
ballarin@19783
   843
          if null ren then ((ps'(*, qs*)), map #1 elems)
ballarin@19783
   844
          else ((map (apfst (Element.rename ren)) ps'(*, map (Element.rename ren) qs*)),
wenzelm@18137
   845
            map (Element.rename_ctxt ren o #1) elems);
wenzelm@18137
   846
        val elems'' = elems' |> map (Element.map_ctxt
wenzelm@18137
   847
          {var = I, typ = I, term = I, fact = I, attrib = I,
wenzelm@18137
   848
            name = NameSpace.qualified (space_implode "_" xs)});
ballarin@15206
   849
      in (((name, params'), axs), elems'') end;
wenzelm@12307
   850
ballarin@16102
   851
    (* type constraint for renamed parameter with syntax *)
wenzelm@18343
   852
    fun mixfix_type mx =
wenzelm@18671
   853
      SOME (Type.freeze_type (#1 (TypeInfer.paramify_dummies (TypeInfer.mixfixT mx) 0)));
ballarin@16102
   854
ballarin@16102
   855
    (* compute identifiers and syntax, merge with previous ones *)
ballarin@17096
   856
    val (ids, _, syn) = identify true expr;
haftmann@17496
   857
    val idents = gen_rems (eq_fst (op =)) (ids, prev_idents);
ballarin@16102
   858
    val syntax = merge_syntax ctxt ids (syn, prev_syntax);
ballarin@19783
   859
    (* add types to params and unify them *)
ballarin@19783
   860
    val raw_elemss = (*unique_parms ctxt*) (map (eval syntax) idents);
wenzelm@18671
   861
    val elemss = unify_elemss' ctxt [] raw_elemss (map (apsnd mixfix_type) (Symtab.dest syntax));
ballarin@15206
   862
    (* replace params in ids by params from axioms,
ballarin@17033
   863
       adjust types in mode *)
ballarin@15206
   864
    val all_params' = params_of' elemss;
ballarin@15206
   865
    val all_params = param_types all_params';
ballarin@17000
   866
    val elemss' = map (fn (((name, _), (ps, mode)), elems) =>
haftmann@17485
   867
         (((name, map (fn p => (p, AList.lookup (op =) all_params p)) ps), mode), elems))
ballarin@15206
   868
         elemss;
wenzelm@18123
   869
    fun inst_th (t, th) = let
ballarin@15206
   870
         val {hyps, prop, ...} = Thm.rep_thm th;
wenzelm@16861
   871
         val ps = map (apsnd SOME) (fold Term.add_frees (prop :: hyps) []);
ballarin@15206
   872
         val [env] = unify_parms ctxt all_params [ps];
wenzelm@18137
   873
         val t' = Element.instT_term env t;
wenzelm@18137
   874
         val th' = Element.instT_thm thy env th;
wenzelm@18123
   875
       in (t', th') end;
ballarin@17000
   876
    val final_elemss = map (fn ((id, mode), elems) =>
wenzelm@19780
   877
         ((id, map_mode (map (Element.map_witness inst_th)) mode), elems)) elemss';
ballarin@17000
   878
ballarin@16102
   879
  in ((prev_idents @ idents, syntax), final_elemss) end;
wenzelm@12046
   880
wenzelm@12510
   881
end;
wenzelm@12510
   882
wenzelm@12070
   883
wenzelm@12529
   884
(* activate elements *)
wenzelm@12273
   885
wenzelm@12510
   886
local
wenzelm@12510
   887
wenzelm@18671
   888
fun axioms_export axs _ hyps =
wenzelm@19780
   889
  Element.satisfy_thm axs
wenzelm@18123
   890
  #> Drule.implies_intr_list (Library.drop (length axs, hyps))
wenzelm@18123
   891
  #> Seq.single;
wenzelm@12263
   892
ballarin@17000
   893
ballarin@17000
   894
(* NB: derived ids contain only facts at this stage *)
ballarin@17000
   895
ballarin@17000
   896
fun activate_elem _ ((ctxt, mode), Fixes fixes) =
wenzelm@18671
   897
      ((ctxt |> ProofContext.add_fixes_i fixes |> snd, mode), [])
ballarin@17000
   898
  | activate_elem _ ((ctxt, mode), Constrains _) =
ballarin@17000
   899
      ((ctxt, mode), [])
ballarin@17000
   900
  | activate_elem _ ((ctxt, Assumed axs), Assumes asms) =
wenzelm@13399
   901
      let
wenzelm@18728
   902
        val asms' = Attrib.map_specs (Attrib.attribute_i (ProofContext.theory_of ctxt)) asms;
wenzelm@19482
   903
        val ts = maps (map #1 o #2) asms';
wenzelm@19018
   904
        val (ps, qs) = chop (length ts) axs;
wenzelm@17856
   905
        val (_, ctxt') =
wenzelm@18671
   906
          ctxt |> fold ProofContext.fix_frees ts
wenzelm@18671
   907
          |> ProofContext.add_assms_i (axioms_export ps) asms';
ballarin@17000
   908
      in ((ctxt', Assumed qs), []) end
ballarin@17000
   909
  | activate_elem _ ((ctxt, Derived ths), Assumes asms) =
ballarin@17000
   910
      ((ctxt, Derived ths), [])
ballarin@17000
   911
  | activate_elem _ ((ctxt, Assumed axs), Defines defs) =
ballarin@15596
   912
      let
wenzelm@18728
   913
        val defs' = Attrib.map_specs (Attrib.attribute_i (ProofContext.theory_of ctxt)) defs;
wenzelm@19732
   914
        val asms = defs' |> map (fn ((name, atts), (t, ps)) =>
wenzelm@19732
   915
            let val ((c, _), t') = LocalDefs.cert_def ctxt t
wenzelm@19732
   916
            in (t', ((if name = "" then Thm.def_name c else name, atts), [(t', ps)])) end);
wenzelm@17856
   917
        val (_, ctxt') =
wenzelm@19732
   918
          ctxt |> fold (ProofContext.fix_frees o #1) asms
wenzelm@19732
   919
          |> ProofContext.add_assms_i LocalDefs.def_export (map #2 asms);
ballarin@17000
   920
      in ((ctxt', Assumed axs), []) end
ballarin@17000
   921
  | activate_elem _ ((ctxt, Derived ths), Defines defs) =
ballarin@17000
   922
      ((ctxt, Derived ths), [])
ballarin@17000
   923
  | activate_elem is_ext ((ctxt, mode), Notes facts) =
ballarin@15596
   924
      let
wenzelm@18728
   925
        val facts' = Attrib.map_facts (Attrib.attribute_i (ProofContext.theory_of ctxt)) facts;
wenzelm@17856
   926
        val (res, ctxt') = ctxt |> ProofContext.note_thmss_i facts';
ballarin@17000
   927
      in ((ctxt', mode), if is_ext then res else []) end;
wenzelm@12502
   928
ballarin@17000
   929
fun activate_elems (((name, ps), mode), elems) ctxt =
ballarin@17033
   930
  let
wenzelm@18123
   931
    val thy = ProofContext.theory_of ctxt;
ballarin@17033
   932
    val ((ctxt', _), res) =
ballarin@17033
   933
        foldl_map (activate_elem (name = "")) ((ProofContext.qualified_names ctxt, mode), elems)
wenzelm@18678
   934
      handle ERROR msg => err_in_locale ctxt msg [(name, map fst ps)]
ballarin@15696
   935
    val ctxt'' = if name = "" then ctxt'
ballarin@15696
   936
          else let
ballarin@15696
   937
              val ps' = map (fn (n, SOME T) => Free (n, T)) ps;
ballarin@15696
   938
              val ctxt'' = put_local_registration (name, ps') ("", []) ctxt'
ballarin@17000
   939
            in case mode of
wenzelm@18123
   940
                Assumed axs =>
wenzelm@19780
   941
                  fold (add_local_witness (name, ps') o
wenzelm@19780
   942
                    Element.assume_witness thy o Element.witness_prop) axs ctxt''
wenzelm@18123
   943
              | Derived ths => fold (add_local_witness (name, ps')) ths ctxt''
ballarin@15696
   944
            end
wenzelm@16144
   945
  in (ProofContext.restore_naming ctxt ctxt'', res) end;
wenzelm@13399
   946
ballarin@17000
   947
fun activate_elemss prep_facts =
ballarin@17000
   948
    fold_map (fn (((name, ps), mode), raw_elems) => fn ctxt =>
ballarin@17000
   949
      let
ballarin@17000
   950
        val elems = map (prep_facts ctxt) raw_elems;
wenzelm@19482
   951
        val (ctxt', res) = apsnd flat
ballarin@17000
   952
            (activate_elems (((name, ps), mode), elems) ctxt);
wenzelm@18137
   953
        val elems' = elems |> map (Element.map_ctxt
wenzelm@18137
   954
          {name = I, var = I, typ = I, term = I, fact = I, attrib = Args.closure});
ballarin@17000
   955
      in ((((name, ps), elems'), res), ctxt') end);
wenzelm@12834
   956
wenzelm@12546
   957
in
wenzelm@12546
   958
ballarin@15206
   959
(* CB: activate_facts prep_facts (ctxt, elemss),
ballarin@15206
   960
   where elemss is a list of pairs consisting of identifiers and
ballarin@15206
   961
   context elements, extends ctxt by the context elements yielding
ballarin@15206
   962
   ctxt' and returns (ctxt', (elemss', facts)).
ballarin@15206
   963
   Identifiers in the argument are of the form ((name, ps), axs) and
ballarin@15206
   964
   assumptions use the axioms in the identifiers to set up exporters
ballarin@15206
   965
   in ctxt'.  elemss' does not contain identifiers and is obtained
ballarin@15206
   966
   from elemss and the intermediate context with prep_facts.
wenzelm@15703
   967
   If read_facts or cert_facts is used for prep_facts, these also remove
ballarin@14508
   968
   the internal/external markers from elemss. *)
ballarin@14508
   969
ballarin@17000
   970
fun activate_facts prep_facts (ctxt, args) =
wenzelm@18806
   971
  let val ((elemss, factss), ctxt') = activate_elemss prep_facts args ctxt |>> split_list
wenzelm@19482
   972
  in (ctxt', (elemss, flat factss)) end;
wenzelm@15703
   973
wenzelm@12510
   974
end;
wenzelm@12510
   975
wenzelm@12307
   976
ballarin@15696
   977
wenzelm@18137
   978
(** prepare locale elements **)
wenzelm@12529
   979
wenzelm@12529
   980
(* expressions *)
wenzelm@12529
   981
wenzelm@16458
   982
fun intern_expr thy (Locale xname) = Locale (intern thy xname)
wenzelm@16458
   983
  | intern_expr thy (Merge exprs) = Merge (map (intern_expr thy) exprs)
wenzelm@16458
   984
  | intern_expr thy (Rename (expr, xs)) = Rename (intern_expr thy expr, xs);
wenzelm@12529
   985
wenzelm@12529
   986
wenzelm@12529
   987
(* propositions and bindings *)
wenzelm@12529
   988
ballarin@17000
   989
(* flatten (ctxt, prep_expr) ((ids, syn), expr)
ballarin@17000
   990
   normalises expr (which is either a locale
ballarin@14508
   991
   expression or a single context element) wrt.
ballarin@14508
   992
   to the list ids of already accumulated identifiers.
ballarin@19783
   993
   It returns ((ids', syn'), elemss) where ids' is an extension of ids
ballarin@14508
   994
   with identifiers generated for expr, and elemss is the list of
ballarin@16102
   995
   context elements generated from expr.
ballarin@16102
   996
   syn and syn' are symtabs mapping parameter names to their syntax.  syn'
ballarin@16102
   997
   is an extension of syn.
ballarin@16102
   998
   For details, see flatten_expr.
ballarin@16102
   999
ballarin@15596
  1000
   Additionally, for a locale expression, the elems are grouped into a single
ballarin@15596
  1001
   Int; individual context elements are marked Ext.  In this case, the
ballarin@15596
  1002
   identifier-like information of the element is as follows:
ballarin@15596
  1003
   - for Fixes: (("", ps), []) where the ps have type info NONE
ballarin@15596
  1004
   - for other elements: (("", []), []).
ballarin@15206
  1005
   The implementation of activate_facts relies on identifier names being
ballarin@15206
  1006
   empty strings for external elements.
ballarin@15596
  1007
*)
ballarin@14508
  1008
ballarin@16102
  1009
fun flatten (ctxt, _) ((ids, syn), Elem (Fixes fixes)) = let
wenzelm@18137
  1010
        val ids' = ids @ [(("", map #1 fixes), ([], Assumed []))]
ballarin@16102
  1011
      in
wenzelm@18137
  1012
        ((ids',
wenzelm@18137
  1013
         merge_syntax ctxt ids'
wenzelm@18137
  1014
           (syn, Symtab.make (map (fn fx => (#1 fx, #3 fx)) fixes))
wenzelm@18137
  1015
           handle Symtab.DUPS xs => err_in_locale ctxt
ballarin@19783
  1016
             ("Conflicting syntax (3) for parameters: " ^ commas_quote xs)
ballarin@16102
  1017
             (map #1 ids')),
wenzelm@18137
  1018
         [((("", map (rpair NONE o #1) fixes), Assumed []), Ext (Fixes fixes))])
ballarin@16102
  1019
      end
ballarin@16102
  1020
  | flatten _ ((ids, syn), Elem elem) =
ballarin@17000
  1021
      ((ids @ [(("", []), ([], Assumed []))], syn), [((("", []), Assumed []), Ext elem)])
ballarin@16102
  1022
  | flatten (ctxt, prep_expr) ((ids, syn), Expr expr) =
ballarin@16102
  1023
      apsnd (map (apsnd Int)) (flatten_expr ctxt ((ids, syn), prep_expr expr));
ballarin@14508
  1024
wenzelm@12529
  1025
local
wenzelm@12529
  1026
wenzelm@12839
  1027
local
wenzelm@12839
  1028
wenzelm@12727
  1029
fun declare_int_elem (ctxt, Fixes fixes) =
wenzelm@18671
  1030
      (ctxt |> ProofContext.add_fixes_i (map (fn (x, T, mx) =>
wenzelm@18671
  1031
        (x, Option.map (Term.map_type_tfree (TypeInfer.param 0)) T, mx)) fixes) |> snd, [])
wenzelm@12727
  1032
  | declare_int_elem (ctxt, _) = (ctxt, []);
wenzelm@12529
  1033
wenzelm@18671
  1034
fun declare_ext_elem prep_vars (ctxt, Fixes fixes) =
wenzelm@18671
  1035
      let val (vars, _) = prep_vars fixes ctxt
wenzelm@18671
  1036
      in (ctxt |> ProofContext.add_fixes_i vars |> snd, []) end
wenzelm@18671
  1037
  | declare_ext_elem prep_vars (ctxt, Constrains csts) =
wenzelm@18671
  1038
      let val (_, ctxt') = prep_vars (map (fn (x, T) => (x, SOME T, NoSyn)) csts) ctxt
wenzelm@18671
  1039
      in (ctxt', []) end
wenzelm@12529
  1040
  | declare_ext_elem _ (ctxt, Assumes asms) = (ctxt, map #2 asms)
wenzelm@19585
  1041
  | declare_ext_elem _ (ctxt, Defines defs) = (ctxt, map (fn (_, (t, ps)) => [(t, ps)]) defs)
wenzelm@12529
  1042
  | declare_ext_elem _ (ctxt, Notes facts) = (ctxt, []);
wenzelm@12529
  1043
wenzelm@18671
  1044
fun declare_elems prep_vars (ctxt, (((name, ps), Assumed _), elems)) =
ballarin@17000
  1045
    let val (ctxt', propps) =
ballarin@17000
  1046
      (case elems of
ballarin@17000
  1047
        Int es => foldl_map declare_int_elem (ctxt, es)
wenzelm@18671
  1048
      | Ext e => foldl_map (declare_ext_elem prep_vars) (ctxt, [e]))
wenzelm@18678
  1049
      handle ERROR msg => err_in_locale ctxt msg [(name, map fst ps)]
ballarin@17000
  1050
    in (ctxt', propps) end
ballarin@17000
  1051
  | declare_elems _ (ctxt, ((_, Derived _), elems)) = (ctxt, []);
wenzelm@12727
  1052
wenzelm@12839
  1053
in
wenzelm@12839
  1054
wenzelm@18671
  1055
fun declare_elemss prep_vars fixed_params raw_elemss ctxt =
wenzelm@12727
  1056
  let
ballarin@14215
  1057
    (* CB: fix of type bug of goal in target with context elements.
ballarin@14215
  1058
       Parameters new in context elements must receive types that are
ballarin@14215
  1059
       distinct from types of parameters in target (fixed_params).  *)
ballarin@14215
  1060
    val ctxt_with_fixed =
wenzelm@16028
  1061
      fold ProofContext.declare_term (map Free fixed_params) ctxt;
wenzelm@12727
  1062
    val int_elemss =
wenzelm@12727
  1063
      raw_elemss
wenzelm@19482
  1064
      |> map_filter (fn (id, Int es) => SOME (id, es) | _ => NONE)
ballarin@14215
  1065
      |> unify_elemss ctxt_with_fixed fixed_params;
wenzelm@12727
  1066
    val (_, raw_elemss') =
wenzelm@12727
  1067
      foldl_map (fn ((_, es) :: elemss, (id, Int _)) => (elemss, (id, Int es)) | x => x)
wenzelm@12727
  1068
        (int_elemss, raw_elemss);
wenzelm@18671
  1069
  in foldl_map (declare_elems prep_vars) (ctxt, raw_elemss') end;
wenzelm@12529
  1070
wenzelm@12839
  1071
end;
wenzelm@12529
  1072
wenzelm@12839
  1073
local
wenzelm@12839
  1074
wenzelm@12839
  1075
val norm_term = Envir.beta_norm oo Term.subst_atomic;
wenzelm@12839
  1076
wenzelm@16458
  1077
fun abstract_thm thy eq =
wenzelm@16458
  1078
  Thm.assume (Thm.cterm_of thy eq) |> Drule.gen_all |> Drule.abs_def;
wenzelm@12502
  1079
wenzelm@18190
  1080
fun bind_def ctxt (name, ps) eq (xs, env, ths) =
wenzelm@12839
  1081
  let
wenzelm@18831
  1082
    val ((y, T), b) = LocalDefs.abs_def eq;
wenzelm@13308
  1083
    val b' = norm_term env b;
wenzelm@16458
  1084
    val th = abstract_thm (ProofContext.theory_of ctxt) eq;
wenzelm@13308
  1085
    fun err msg = err_in_locale ctxt (msg ^ ": " ^ quote y) [(name, map fst ps)];
wenzelm@12839
  1086
  in
wenzelm@13308
  1087
    conditional (exists (equal y o #1) xs) (fn () =>
wenzelm@13308
  1088
      err "Attempt to define previously specified variable");
wenzelm@13308
  1089
    conditional (exists (fn (Free (y', _), _) => y = y' | _ => false) env) (fn () =>
wenzelm@13308
  1090
      err "Attempt to redefine variable");
wenzelm@16861
  1091
    (Term.add_frees b' xs, (Free (y, T), b') :: env, th :: ths)
wenzelm@12839
  1092
  end;
wenzelm@12575
  1093
ballarin@17000
  1094
ballarin@17000
  1095
(* CB: for finish_elems (Int and Ext),
ballarin@17000
  1096
   extracts specification, only of assumed elements *)
ballarin@15206
  1097
wenzelm@18190
  1098
fun eval_text _ _ _ (Fixes _) text = text
wenzelm@18190
  1099
  | eval_text _ _ _ (Constrains _) text = text
wenzelm@18190
  1100
  | eval_text _ (_, Assumed _) is_ext (Assumes asms)
wenzelm@18190
  1101
        (((exts, exts'), (ints, ints')), (xs, env, defs)) =
wenzelm@13394
  1102
      let
wenzelm@19482
  1103
        val ts = maps (map #1 o #2) asms;
wenzelm@13394
  1104
        val ts' = map (norm_term env) ts;
wenzelm@13394
  1105
        val spec' =
wenzelm@13394
  1106
          if is_ext then ((exts @ ts, exts' @ ts'), (ints, ints'))
wenzelm@13394
  1107
          else ((exts, exts'), (ints @ ts, ints' @ ts'));
wenzelm@16861
  1108
      in (spec', (fold Term.add_frees ts' xs, env, defs)) end
wenzelm@18190
  1109
  | eval_text _ (_, Derived _) _ (Assumes _) text = text
wenzelm@18190
  1110
  | eval_text ctxt (id, Assumed _) _ (Defines defs) (spec, binds) =
wenzelm@18190
  1111
      (spec, fold (bind_def ctxt id o #1 o #2) defs binds)
wenzelm@18190
  1112
  | eval_text _ (_, Derived _) _ (Defines _) text = text
wenzelm@18190
  1113
  | eval_text _ _ _ (Notes _) text = text;
wenzelm@13308
  1114
ballarin@17000
  1115
ballarin@17000
  1116
(* for finish_elems (Int),
ballarin@17000
  1117
   remove redundant elements of derived identifiers,
ballarin@17000
  1118
   turn assumptions and definitions into facts,
wenzelm@19780
  1119
   adjust hypotheses of facts using witnesses *)
ballarin@17000
  1120
ballarin@17096
  1121
fun finish_derived _ _ (Assumed _) (Fixes fixes) = SOME (Fixes fixes)
ballarin@17096
  1122
  | finish_derived _ _ (Assumed _) (Constrains csts) = SOME (Constrains csts)
ballarin@17096
  1123
  | finish_derived _ _ (Assumed _) (Assumes asms) = SOME (Assumes asms)
ballarin@17096
  1124
  | finish_derived _ _ (Assumed _) (Defines defs) = SOME (Defines defs)
ballarin@17096
  1125
ballarin@17000
  1126
  | finish_derived _ _ (Derived _) (Fixes _) = NONE
ballarin@17000
  1127
  | finish_derived _ _ (Derived _) (Constrains _) = NONE
ballarin@17000
  1128
  | finish_derived sign wits (Derived _) (Assumes asms) = asms
ballarin@17096
  1129
      |> map (apsnd (map (fn (a, _) => ([Thm.assume (cterm_of sign a)], []))))
wenzelm@19780
  1130
      |> Notes |> Element.map_ctxt_values I I (Element.satisfy_thm wits) |> SOME
ballarin@17000
  1131
  | finish_derived sign wits (Derived _) (Defines defs) = defs
ballarin@17096
  1132
      |> map (apsnd (fn (d, _) => [([Thm.assume (cterm_of sign d)], [])]))
wenzelm@19780
  1133
      |> Notes |> Element.map_ctxt_values I I (Element.satisfy_thm wits) |> SOME
ballarin@17000
  1134
ballarin@17096
  1135
  | finish_derived _ wits _ (Notes facts) = (Notes facts)
wenzelm@19780
  1136
      |> Element.map_ctxt_values I I (Element.satisfy_thm wits) |> SOME;
ballarin@17000
  1137
ballarin@15206
  1138
(* CB: for finish_elems (Ext) *)
ballarin@15206
  1139
wenzelm@13308
  1140
fun closeup _ false elem = elem
wenzelm@13308
  1141
  | closeup ctxt true elem =
wenzelm@12839
  1142
      let
wenzelm@13308
  1143
        fun close_frees t =
wenzelm@13308
  1144
          let val frees = rev (filter_out (ProofContext.is_fixed ctxt o #1)
wenzelm@16861
  1145
            (Term.add_frees t []))
wenzelm@13308
  1146
          in Term.list_all_free (frees, t) end;
wenzelm@13308
  1147
wenzelm@13308
  1148
        fun no_binds [] = []
wenzelm@18678
  1149
          | no_binds _ = error "Illegal term bindings in locale element";
wenzelm@13308
  1150
      in
wenzelm@13308
  1151
        (case elem of
wenzelm@13308
  1152
          Assumes asms => Assumes (asms |> map (fn (a, propps) =>
wenzelm@19585
  1153
            (a, map (fn (t, ps) => (close_frees t, no_binds ps)) propps)))
wenzelm@13308
  1154
        | Defines defs => Defines (defs |> map (fn (a, (t, ps)) =>
wenzelm@18831
  1155
            (a, (close_frees (#2 (LocalDefs.cert_def ctxt t)), no_binds ps))))
wenzelm@13308
  1156
        | e => e)
wenzelm@13308
  1157
      end;
wenzelm@12839
  1158
wenzelm@12502
  1159
wenzelm@12839
  1160
fun finish_ext_elem parms _ (Fixes fixes, _) = Fixes (map (fn (x, _, mx) =>
haftmann@17271
  1161
      (x, AList.lookup (op =) parms x, mx)) fixes)
wenzelm@18899
  1162
  | finish_ext_elem parms _ (Constrains _, _) = Constrains []
wenzelm@12839
  1163
  | finish_ext_elem _ close (Assumes asms, propp) =
wenzelm@12839
  1164
      close (Assumes (map #1 asms ~~ propp))
wenzelm@12839
  1165
  | finish_ext_elem _ close (Defines defs, propp) =
wenzelm@19585
  1166
      close (Defines (map #1 defs ~~ map (fn [(t, ps)] => (t, ps)) propp))
wenzelm@12839
  1167
  | finish_ext_elem _ _ (Notes facts, _) = Notes facts;
wenzelm@12839
  1168
ballarin@17000
  1169
ballarin@15206
  1170
(* CB: finish_parms introduces type info from parms to identifiers *)
skalberg@15531
  1171
(* CB: only needed for types that have been NONE so far???
ballarin@15206
  1172
   If so, which are these??? *)
ballarin@15206
  1173
ballarin@17000
  1174
fun finish_parms parms (((name, ps), mode), elems) =
haftmann@17485
  1175
  (((name, map (fn (x, _) => (x, AList.lookup (op =) parms x)) ps), mode), elems);
wenzelm@12839
  1176
ballarin@17000
  1177
fun finish_elems ctxt parms _ ((text, wits), ((id, Int e), _)) =
wenzelm@12839
  1178
      let
ballarin@17000
  1179
        val [(id' as (_, mode), es)] = unify_elemss ctxt parms [(id, e)];
ballarin@17000
  1180
        val wits' = case mode of Assumed _ => wits | Derived ths => wits @ ths;
wenzelm@18190
  1181
        val text' = fold (eval_text ctxt id' false) es text;
wenzelm@19482
  1182
        val es' = map_filter
ballarin@17000
  1183
              (finish_derived (ProofContext.theory_of ctxt) wits' mode) es;
ballarin@17000
  1184
      in ((text', wits'), (id', map Int es')) end
ballarin@17000
  1185
  | finish_elems ctxt parms do_close ((text, wits), ((id, Ext e), [propp])) =
wenzelm@13308
  1186
      let
wenzelm@13308
  1187
        val e' = finish_ext_elem parms (closeup ctxt do_close) (e, propp);
wenzelm@18190
  1188
        val text' = eval_text ctxt id true e' text;
ballarin@17000
  1189
      in ((text', wits), (id, [Ext e'])) end
wenzelm@12839
  1190
wenzelm@12839
  1191
in
wenzelm@12510
  1192
ballarin@15206
  1193
(* CB: only called by prep_elemss *)
ballarin@15206
  1194
wenzelm@13375
  1195
fun finish_elemss ctxt parms do_close =
wenzelm@13375
  1196
  foldl_map (apsnd (finish_parms parms) o finish_elems ctxt parms do_close);
wenzelm@12839
  1197
wenzelm@12839
  1198
end;
wenzelm@12839
  1199
ballarin@16736
  1200
ballarin@16736
  1201
(* CB: type inference and consistency checks for locales.
ballarin@16736
  1202
ballarin@16736
  1203
   Works by building a context (through declare_elemss), extracting the
ballarin@16736
  1204
   required information and adjusting the context elements (finish_elemss).
ballarin@16736
  1205
   Can also universally close free vars in assms and defs.  This is only
ballarin@17000
  1206
   needed for Ext elements and controlled by parameter do_close.
ballarin@17000
  1207
ballarin@17000
  1208
   Only elements of assumed identifiers are considered.
ballarin@16736
  1209
*)
ballarin@15127
  1210
wenzelm@18671
  1211
fun prep_elemss prep_vars prepp do_close context fixed_params raw_elemss raw_concl =
wenzelm@12529
  1212
  let
ballarin@15127
  1213
    (* CB: contexts computed in the course of this function are discarded.
ballarin@15127
  1214
       They are used for type inference and consistency checks only. *)
ballarin@15206
  1215
    (* CB: fixed_params are the parameters (with types) of the target locale,
ballarin@15206
  1216
       empty list if there is no target. *)
ballarin@14508
  1217
    (* CB: raw_elemss are list of pairs consisting of identifiers and
ballarin@14508
  1218
       context elements, the latter marked as internal or external. *)
wenzelm@18671
  1219
    val (raw_ctxt, raw_proppss) = declare_elemss prep_vars fixed_params raw_elemss context;
ballarin@14508
  1220
    (* CB: raw_ctxt is context with additional fixed variables derived from
ballarin@14508
  1221
       the fixes elements in raw_elemss,
ballarin@14508
  1222
       raw_proppss contains assumptions and definitions from the
ballarin@15206
  1223
       external elements in raw_elemss. *)
haftmann@18550
  1224
    fun prep_prop raw_propp (raw_ctxt, raw_concl)  =
haftmann@18450
  1225
      let
haftmann@18450
  1226
        (* CB: add type information from fixed_params to context (declare_term) *)
haftmann@18450
  1227
        (* CB: process patterns (conclusion and external elements only) *)
haftmann@18450
  1228
        val (ctxt, all_propp) =
haftmann@18450
  1229
          prepp (fold ProofContext.declare_term (map Free fixed_params) raw_ctxt, raw_concl @ raw_propp);
haftmann@18450
  1230
        (* CB: add type information from conclusion and external elements to context *)
wenzelm@19482
  1231
        val ctxt = fold ProofContext.declare_term (maps (map fst) all_propp) ctxt;
haftmann@18450
  1232
        (* CB: resolve schematic variables (patterns) in conclusion and external elements. *)
haftmann@18450
  1233
        val all_propp' = map2 (curry (op ~~))
haftmann@18450
  1234
          (#1 (#2 (ProofContext.bind_propp_schematic_i (ctxt, all_propp)))) (map (map snd) all_propp);
wenzelm@19018
  1235
        val (concl, propp) = chop (length raw_concl) all_propp';
haftmann@18550
  1236
      in (propp, (ctxt, concl)) end
ballarin@15206
  1237
haftmann@18550
  1238
    val (proppss, (ctxt, concl)) =
haftmann@18550
  1239
      (fold_burrow o fold_burrow) prep_prop raw_proppss (raw_ctxt, raw_concl);
wenzelm@12502
  1240
ballarin@15206
  1241
    (* CB: obtain all parameters from identifier part of raw_elemss *)
ballarin@15206
  1242
    val xs = map #1 (params_of' raw_elemss);
wenzelm@12727
  1243
    val typing = unify_frozen ctxt 0
wenzelm@12529
  1244
      (map (ProofContext.default_type raw_ctxt) xs)
wenzelm@12529
  1245
      (map (ProofContext.default_type ctxt) xs);
wenzelm@12529
  1246
    val parms = param_types (xs ~~ typing);
ballarin@14508
  1247
    (* CB: parms are the parameters from raw_elemss, with correct typing. *)
wenzelm@12273
  1248
ballarin@14508
  1249
    (* CB: extract information from assumes and defines elements
ballarin@16169
  1250
       (fixes, constrains and notes in raw_elemss don't have an effect on
ballarin@16169
  1251
       text and elemss), compute final form of context elements. *)
ballarin@17000
  1252
    val ((text, _), elemss) = finish_elemss ctxt parms do_close
ballarin@17000
  1253
      ((((([], []), ([], [])), ([], [], [])), []), raw_elemss ~~ proppss);
ballarin@14508
  1254
    (* CB: text has the following structure:
ballarin@14508
  1255
           (((exts, exts'), (ints, ints')), (xs, env, defs))
ballarin@14508
  1256
       where
ballarin@14508
  1257
         exts: external assumptions (terms in external assumes elements)
ballarin@14508
  1258
         exts': dito, normalised wrt. env
ballarin@14508
  1259
         ints: internal assumptions (terms in internal assumes elements)
ballarin@14508
  1260
         ints': dito, normalised wrt. env
ballarin@14508
  1261
         xs: the free variables in exts' and ints' and rhss of definitions,
ballarin@14508
  1262
           this includes parameters except defined parameters
ballarin@14508
  1263
         env: list of term pairs encoding substitutions, where the first term
ballarin@14508
  1264
           is a free variable; substitutions represent defines elements and
ballarin@14508
  1265
           the rhs is normalised wrt. the previous env
ballarin@14508
  1266
         defs: theorems representing the substitutions from defines elements
ballarin@14508
  1267
           (thms are normalised wrt. env).
ballarin@14508
  1268
       elemss is an updated version of raw_elemss:
ballarin@16169
  1269
         - type info added to Fixes and modified in Constrains
ballarin@14508
  1270
         - axiom and definition statement replaced by corresponding one
ballarin@14508
  1271
           from proppss in Assumes and Defines
ballarin@14508
  1272
         - Facts unchanged
ballarin@14508
  1273
       *)
wenzelm@13308
  1274
  in ((parms, elemss, concl), text) end;
wenzelm@12502
  1275
wenzelm@12502
  1276
in
wenzelm@12502
  1277
wenzelm@18671
  1278
fun read_elemss x = prep_elemss ProofContext.read_vars ProofContext.read_propp_schematic x;
wenzelm@18671
  1279
fun cert_elemss x = prep_elemss ProofContext.cert_vars ProofContext.cert_propp_schematic x;
wenzelm@12529
  1280
wenzelm@12529
  1281
end;
wenzelm@12529
  1282
wenzelm@12529
  1283
wenzelm@15703
  1284
(* facts and attributes *)
wenzelm@12529
  1285
wenzelm@12529
  1286
local
wenzelm@12529
  1287
wenzelm@18678
  1288
fun prep_name name =
wenzelm@18678
  1289
  if NameSpace.is_qualified name then error ("Illegal qualified name: " ^ quote name)
wenzelm@15703
  1290
  else name;
wenzelm@12529
  1291
wenzelm@15703
  1292
fun prep_facts _ _ ctxt (Int elem) =
wenzelm@18137
  1293
      Element.map_ctxt_values I I (Thm.transfer (ProofContext.theory_of ctxt)) elem
wenzelm@18137
  1294
  | prep_facts get intern ctxt (Ext elem) = elem |> Element.map_ctxt
wenzelm@15703
  1295
     {var = I, typ = I, term = I,
wenzelm@18678
  1296
      name = prep_name,
wenzelm@15703
  1297
      fact = get ctxt,
wenzelm@16458
  1298
      attrib = Args.assignable o intern (ProofContext.theory_of ctxt)};
wenzelm@12529
  1299
wenzelm@12529
  1300
in
wenzelm@12529
  1301
wenzelm@15703
  1302
fun read_facts x = prep_facts ProofContext.get_thms Attrib.intern_src x;
wenzelm@15703
  1303
fun cert_facts x = prep_facts (K I) (K I) x;
wenzelm@12529
  1304
wenzelm@12529
  1305
end;
wenzelm@12529
  1306
wenzelm@12529
  1307
wenzelm@19780
  1308
(* specification of a locale *)
ballarin@18795
  1309
wenzelm@19780
  1310
(*The global specification is made from the parameters and global
wenzelm@19780
  1311
  assumptions, the local specification from the parameters and the
wenzelm@19780
  1312
  local assumptions.*)
ballarin@18795
  1313
ballarin@18795
  1314
local
ballarin@18795
  1315
ballarin@18795
  1316
fun gen_asms_of get thy name =
ballarin@18795
  1317
  let
ballarin@18795
  1318
    val ctxt = ProofContext.init thy;
ballarin@18795
  1319
    val (_, raw_elemss) = flatten (ctxt, I) (([], Symtab.empty), Expr (Locale name));
ballarin@18795
  1320
    val ((_, elemss, _), _) = read_elemss false ctxt [] raw_elemss [];
ballarin@18795
  1321
  in
ballarin@18890
  1322
    elemss |> get
wenzelm@19780
  1323
      |> maps (fn (_, es) => map (fn Int e => e) es)
wenzelm@19780
  1324
      |> maps (fn Assumes asms => asms | _ => [])
ballarin@18795
  1325
      |> map (apsnd (map fst))
ballarin@18795
  1326
  end;
ballarin@18795
  1327
ballarin@18795
  1328
in
ballarin@18795
  1329
ballarin@18795
  1330
fun parameters_of thy name =
ballarin@19278
  1331
  the_locale thy name |> #params;
ballarin@18795
  1332
ballarin@19276
  1333
fun parameters_of_expr thy expr =
ballarin@19276
  1334
  let
ballarin@19276
  1335
    val ctxt = ProofContext.init thy;
ballarin@19783
  1336
    val pts = params_of_expr ctxt [] (intern_expr thy expr)
ballarin@19783
  1337
        ([], Symtab.empty, Symtab.empty);
ballarin@19783
  1338
    val raw_params_elemss = make_raw_params_elemss pts;
ballarin@19276
  1339
    val ((_, syn), raw_elemss) = flatten (ctxt, intern_expr thy)
ballarin@19276
  1340
        (([], Symtab.empty), Expr expr);
ballarin@19783
  1341
    val ((parms, _, _), _) =
ballarin@19783
  1342
        read_elemss false ctxt [] (raw_params_elemss @ raw_elemss) [];
ballarin@19276
  1343
  in map (fn p as (n, _) => (p, Symtab.lookup syn n |> the)) parms end;
ballarin@19276
  1344
ballarin@18795
  1345
fun local_asms_of thy name =
ballarin@18890
  1346
  gen_asms_of (single o Library.last_elem) thy name;
ballarin@18795
  1347
ballarin@18795
  1348
fun global_asms_of thy name =
ballarin@18890
  1349
  gen_asms_of I thy name;
ballarin@18795
  1350
wenzelm@19780
  1351
end;
ballarin@18795
  1352
ballarin@18795
  1353
wenzelm@12546
  1354
(* full context statements: import + elements + conclusion *)
wenzelm@12529
  1355
wenzelm@12529
  1356
local
wenzelm@12529
  1357
wenzelm@12529
  1358
fun prep_context_statement prep_expr prep_elemss prep_facts
ballarin@15206
  1359
    do_close fixed_params import elements raw_concl context =
wenzelm@12529
  1360
  let
wenzelm@16458
  1361
    val thy = ProofContext.theory_of context;
wenzelm@13375
  1362
ballarin@19783
  1363
    val (import_params, import_tenv, import_syn) =
ballarin@19783
  1364
      params_of_expr context fixed_params (prep_expr thy import)
ballarin@19783
  1365
        ([], Symtab.empty, Symtab.empty);
ballarin@19783
  1366
    val includes = map_filter (fn Expr e => SOME e | Elem _ => NONE) elements;
ballarin@19783
  1367
    val (incl_params, incl_tenv, incl_syn) = fold (params_of_expr context fixed_params)
ballarin@19783
  1368
      (map (prep_expr thy) includes) (import_params, import_tenv, import_syn);
ballarin@19783
  1369
ballarin@19783
  1370
    val ((import_ids, _), raw_import_elemss) =
wenzelm@16458
  1371
      flatten (context, prep_expr thy) (([], Symtab.empty), Expr import);
ballarin@14215
  1372
    (* CB: normalise "includes" among elements *)
wenzelm@16458
  1373
    val ((ids, syn), raw_elemsss) = foldl_map (flatten (context, prep_expr thy))
ballarin@19783
  1374
      ((import_ids, incl_syn), elements);
ballarin@15696
  1375
wenzelm@19482
  1376
    val raw_elemss = flat raw_elemsss;
ballarin@14508
  1377
    (* CB: raw_import_elemss @ raw_elemss is the normalised list of
ballarin@14508
  1378
       context elements obtained from import and elements. *)
ballarin@19783
  1379
    (* Now additional elements for parameters are inserted. *)
ballarin@19783
  1380
    val import_params_ids = make_params_ids import_params;
ballarin@19783
  1381
    val incl_params_ids =
ballarin@19783
  1382
        make_params_ids (incl_params \\ import_params);
ballarin@19783
  1383
    val raw_import_params_elemss =
ballarin@19783
  1384
        make_raw_params_elemss (import_params, incl_tenv, incl_syn);
ballarin@19783
  1385
    val raw_incl_params_elemss =
ballarin@19783
  1386
        make_raw_params_elemss (incl_params \\ import_params, incl_tenv, incl_syn);
wenzelm@13375
  1387
    val ((parms, all_elemss, concl), (spec, (_, _, defs))) = prep_elemss do_close
ballarin@19783
  1388
      context fixed_params
ballarin@19783
  1389
      (raw_import_params_elemss @ raw_import_elemss @ raw_incl_params_elemss @ raw_elemss) raw_concl;
ballarin@19783
  1390
ballarin@15696
  1391
    (* replace extended ids (for axioms) by ids *)
ballarin@19783
  1392
    val (import_ids', incl_ids) = chop (length import_ids) ids;
ballarin@19783
  1393
    val add_ids = import_params_ids @ import_ids' @ incl_params_ids @ incl_ids;
ballarin@17000
  1394
    val all_elemss' = map (fn (((_, ps), _), (((n, ps'), mode), elems)) =>
haftmann@17485
  1395
        (((n, map (fn p => (p, (the o AList.lookup (op =) ps') p)) ps), mode), elems))
ballarin@19783
  1396
      (add_ids ~~ all_elemss);
ballarin@19783
  1397
    (* CB: all_elemss and parms contain the correct parameter types *)
ballarin@15696
  1398
ballarin@19783
  1399
    val (ps, qs) = chop (length raw_import_params_elemss + length raw_import_elemss) all_elemss';
ballarin@15206
  1400
    val (import_ctxt, (import_elemss, _)) =
ballarin@15206
  1401
      activate_facts prep_facts (context, ps);
ballarin@14215
  1402
ballarin@15206
  1403
    val (ctxt, (elemss, _)) =
ballarin@15206
  1404
      activate_facts prep_facts (import_ctxt, qs);
wenzelm@19061
  1405
    val stmt = distinct Term.aconv
wenzelm@19780
  1406
       (maps (fn ((_, Assumed axs), _) => maps Element.witness_hyps axs
wenzelm@19482
  1407
                           | ((_, Derived _), _) => []) qs);
wenzelm@16458
  1408
    val cstmt = map (cterm_of thy) stmt;
wenzelm@12834
  1409
  in
ballarin@19783
  1410
    ((((import_ctxt, import_elemss), (ctxt, elemss, syn)),
ballarin@19783
  1411
      (parms, spec, defs)), (cstmt, concl))
wenzelm@12834
  1412
  end;
wenzelm@12529
  1413
wenzelm@18806
  1414
fun prep_statement prep_locale prep_ctxt raw_locale elems concl ctxt =
wenzelm@12529
  1415
  let
wenzelm@12529
  1416
    val thy = ProofContext.theory_of ctxt;
wenzelm@16458
  1417
    val locale = Option.map (prep_locale thy) raw_locale;
wenzelm@18806
  1418
    val (locale_stmt, fixed_params, import) =
wenzelm@18806
  1419
      (case locale of
wenzelm@18806
  1420
        NONE => ([], [], empty)
skalberg@15531
  1421
      | SOME name =>
ballarin@19278
  1422
          let val {predicate = (stmt, _), params = ps, ...} = the_locale thy name
ballarin@16620
  1423
          in (stmt, map fst ps, Locale name) end);
wenzelm@18806
  1424
    val ((((locale_ctxt, _), (elems_ctxt, _, _)), _), (elems_stmt, concl')) =
ballarin@15206
  1425
      prep_ctxt false fixed_params import elems concl ctxt;
wenzelm@18806
  1426
  in (locale, (locale_stmt, locale_ctxt), (elems_stmt, elems_ctxt), concl') end;
wenzelm@13399
  1427
wenzelm@19780
  1428
fun prep_expr prep import body ctxt =
wenzelm@19780
  1429
  let
wenzelm@19780
  1430
    val (((_, import_elemss), (ctxt', elemss, _)), _) = prep import body ctxt;
wenzelm@19780
  1431
    val all_elems = maps snd (import_elemss @ elemss);
wenzelm@19780
  1432
  in (all_elems, ctxt') end;
wenzelm@19780
  1433
wenzelm@12529
  1434
in
wenzelm@12529
  1435
wenzelm@18806
  1436
val read_ctxt = prep_context_statement intern_expr read_elemss read_facts;
wenzelm@18806
  1437
val cert_ctxt = prep_context_statement (K I) cert_elemss cert_facts;
ballarin@14215
  1438
wenzelm@18806
  1439
fun read_context import body ctxt = #1 (read_ctxt true [] import (map Elem body) [] ctxt);
wenzelm@18806
  1440
fun cert_context import body ctxt = #1 (cert_ctxt true [] import (map Elem body) [] ctxt);
wenzelm@12502
  1441
wenzelm@19780
  1442
val read_expr = prep_expr read_context;
wenzelm@19780
  1443
val cert_expr = prep_expr cert_context;
wenzelm@19780
  1444
wenzelm@18806
  1445
val read_context_statement = prep_statement intern read_ctxt;
wenzelm@18806
  1446
val cert_context_statement = prep_statement (K I) cert_ctxt;
wenzelm@18806
  1447
wenzelm@12502
  1448
end;
wenzelm@11896
  1449
wenzelm@11896
  1450
wenzelm@13336
  1451
(* print locale *)
wenzelm@12070
  1452
ballarin@17228
  1453
fun print_locale thy show_facts import body =
wenzelm@12070
  1454
  let
wenzelm@19780
  1455
    val (all_elems, ctxt) = read_expr import body (ProofContext.init thy);
wenzelm@18137
  1456
    val prt_elem = Element.pretty_ctxt ctxt;
wenzelm@12277
  1457
  in
wenzelm@18137
  1458
    Pretty.big_list "locale elements:" (all_elems
ballarin@17316
  1459
      |> (if show_facts then I else filter (fn Notes _ => false | _ => true))
ballarin@17316
  1460
      |> map (Pretty.chunks o prt_elem))
wenzelm@13336
  1461
    |> Pretty.writeln
wenzelm@12277
  1462
  end;
wenzelm@12070
  1463
wenzelm@12070
  1464
wenzelm@12706
  1465
wenzelm@16144
  1466
(** store results **)
wenzelm@12702
  1467
wenzelm@19018
  1468
(* naming of interpreted theorems *)
ballarin@15696
  1469
wenzelm@19018
  1470
fun global_note_prefix_i kind prfx args thy =
wenzelm@16144
  1471
  thy
wenzelm@19061
  1472
  |> Theory.qualified_names
wenzelm@19061
  1473
  |> Theory.sticky_prefix prfx
wenzelm@16144
  1474
  |> PureThy.note_thmss_i kind args
haftmann@18377
  1475
  ||> Theory.restore_naming thy;
ballarin@15696
  1476
wenzelm@19018
  1477
fun local_note_prefix_i prfx args ctxt =
wenzelm@16144
  1478
  ctxt
wenzelm@19061
  1479
  |> ProofContext.qualified_names
wenzelm@19061
  1480
  |> ProofContext.sticky_prefix prfx
wenzelm@19780
  1481
  |> ProofContext.note_thmss_i args
wenzelm@19780
  1482
  ||> ProofContext.restore_naming ctxt;
wenzelm@16144
  1483
ballarin@15696
  1484
wenzelm@19780
  1485
(* collect witnesses for global registration;
ballarin@17138
  1486
   requires parameters and flattened list of (assumed!) identifiers
ballarin@17138
  1487
   instead of recomputing it from the target *)
ballarin@17138
  1488
ballarin@17138
  1489
fun collect_global_witnesses thy parms ids vts = let
ballarin@17138
  1490
    val ts = map Logic.unvarify vts;
ballarin@17138
  1491
    val (parms, parmTs) = split_list parms;
wenzelm@19810
  1492
    val parmvTs = map Logic.varifyT parmTs;
ballarin@17138
  1493
    val vtinst = fold (Sign.typ_match thy) (parmvTs ~~ map Term.fastype_of ts) Vartab.empty;
ballarin@17138
  1494
    val tinst = Vartab.dest vtinst |> map (fn ((x, 0), (_, T)) => (x, T))
wenzelm@18137
  1495
        |> Symtab.make;
ballarin@17138
  1496
    (* replace parameter names in ids by instantiations *)
ballarin@17138
  1497
    val vinst = Symtab.make (parms ~~ vts);
wenzelm@17412
  1498
    fun vinst_names ps = map (the o Symtab.lookup vinst) ps;
ballarin@17138
  1499
    val inst = Symtab.make (parms ~~ ts);
ballarin@17138
  1500
    val ids' = map (apsnd vinst_names) ids;
wenzelm@19482
  1501
    val wits = maps (snd o the o get_global_registration thy) ids';
wenzelm@18137
  1502
  in ((tinst, inst), wits) end;
ballarin@17138
  1503
ballarin@17138
  1504
ballarin@15696
  1505
(* store instantiations of args for all registered interpretations
ballarin@15696
  1506
   of the theory *)
ballarin@15696
  1507
ballarin@15696
  1508
fun note_thmss_registrations kind target args thy =
ballarin@15596
  1509
  let
ballarin@19278
  1510
    val parms = the_locale thy target |> #params |> map fst;
wenzelm@16458
  1511
    val ids = flatten (ProofContext.init thy, intern_expr thy)
ballarin@17033
  1512
      (([], Symtab.empty), Expr (Locale target)) |> fst |> fst
wenzelm@19482
  1513
      |> map_filter (fn (id, (_, Assumed _)) => SOME id | _ => NONE)
ballarin@15696
  1514
ballarin@15696
  1515
    val regs = get_global_registrations thy target;
ballarin@15696
  1516
ballarin@15696
  1517
    (* add args to thy for all registrations *)
ballarin@15596
  1518
wenzelm@18190
  1519
    fun activate (vts, ((prfx, atts2), _)) thy =
ballarin@15696
  1520
      let
wenzelm@18137
  1521
        val (insts, prems) = collect_global_witnesses thy parms ids vts;
wenzelm@18137
  1522
        val inst_atts =
wenzelm@18137
  1523
          Args.map_values I (Element.instT_type (#1 insts))
wenzelm@18137
  1524
            (Element.inst_term insts) (Element.inst_thm thy insts);
wenzelm@18137
  1525
        val args' = args |> map (fn ((n, atts), [(ths, [])]) =>
wenzelm@19061
  1526
            ((n, map (Attrib.attribute_i thy) (map inst_atts atts @ atts2)),
wenzelm@19780
  1527
             [(map (Drule.standard o Element.satisfy_thm prems o
wenzelm@18137
  1528
            Element.inst_thm thy insts) ths, [])]));
wenzelm@19018
  1529
      in global_note_prefix_i kind prfx args' thy |> snd end;
wenzelm@18190
  1530
  in fold activate regs thy end;
ballarin@15596
  1531
ballarin@15596
  1532
wenzelm@19662
  1533
(* term syntax *)
wenzelm@19018
  1534
wenzelm@19662
  1535
fun add_term_syntax loc syn =
wenzelm@19662
  1536
  snd #> syn #> ProofContext.map_theory (change_locale loc
wenzelm@19662
  1537
    (fn (predicate, import, elems, params, lparams, term_syntax, regs) =>
wenzelm@19662
  1538
      (predicate, import, elems, params, lparams, (syn, stamp ()) :: term_syntax, regs)));
wenzelm@19018
  1539
wenzelm@19662
  1540
fun init_term_syntax loc ctxt =
wenzelm@19662
  1541
  fold_rev (fn (f, _) => fn ctxt' => f ctxt')
wenzelm@19662
  1542
    (#term_syntax (the_locale (ProofContext.theory_of ctxt) loc)) ctxt;
wenzelm@19018
  1543
wenzelm@19018
  1544
fun init loc =
wenzelm@19018
  1545
  ProofContext.init
wenzelm@19662
  1546
  #> init_term_syntax loc
wenzelm@19018
  1547
  #> (#2 o cert_context_statement (SOME loc) [] []);
wenzelm@19018
  1548
wenzelm@19018
  1549
wenzelm@18806
  1550
(* theory/locale results *)
wenzelm@12958
  1551
wenzelm@18806
  1552
fun theory_results kind prefix results (view, ctxt) thy =
wenzelm@18806
  1553
  let
wenzelm@18806
  1554
    val thy_ctxt = ProofContext.init thy;
wenzelm@18806
  1555
    val export = ProofContext.export_view view ctxt thy_ctxt;
wenzelm@18806
  1556
    val facts = map (fn (name, ths) => ((name, []), [(map export ths, [])])) results;
wenzelm@18806
  1557
  in thy |> PureThy.note_thmss_qualified kind prefix facts end;
wenzelm@12958
  1558
wenzelm@12958
  1559
local
wenzelm@12958
  1560
wenzelm@18806
  1561
fun gen_thmss prep_facts global_results kind loc args (view, ctxt) thy =
wenzelm@12706
  1562
  let
wenzelm@18806
  1563
    val (ctxt', ([(_, [Notes args'])], facts)) =
wenzelm@18806
  1564
      activate_facts prep_facts (ctxt, [((("", []), Assumed []), [Ext (Notes args)])]);
wenzelm@18806
  1565
    val (facts', thy') =
wenzelm@18806
  1566
      thy
wenzelm@19662
  1567
      |> change_locale loc (fn (predicate, import, elems, params, lparams, term_syntax, regs) =>
wenzelm@19662
  1568
        (predicate, import, elems @ [(Notes args', stamp ())], params, lparams, term_syntax, regs))
wenzelm@18806
  1569
      |> note_thmss_registrations kind loc args'
wenzelm@18806
  1570
      |> global_results (map (#1 o #1) args' ~~ map #2 facts) (view, ctxt);
wenzelm@18806
  1571
  in ((facts, facts'), (ProofContext.transfer thy' ctxt', thy')) end;
wenzelm@15703
  1572
wenzelm@18806
  1573
fun gen_note prep_locale prep_facts kind raw_loc args thy =
wenzelm@18806
  1574
  let
wenzelm@18806
  1575
    val loc = prep_locale thy raw_loc;
wenzelm@18806
  1576
    val prefix = Sign.base_name loc;
wenzelm@18806
  1577
  in gen_thmss prep_facts (theory_results kind prefix) kind loc args (init loc thy) thy end;
wenzelm@12706
  1578
wenzelm@12706
  1579
in
wenzelm@12706
  1580
wenzelm@18806
  1581
val note_thmss = gen_note intern read_facts;
wenzelm@18806
  1582
val note_thmss_i = gen_note (K I) cert_facts;
wenzelm@12711
  1583
wenzelm@18806
  1584
fun add_thmss kind loc args (view, ctxt) =
wenzelm@18806
  1585
  gen_thmss cert_facts (theory_results kind "")
wenzelm@18806
  1586
    kind loc args (view, ctxt) (ProofContext.theory_of ctxt)
wenzelm@18806
  1587
  ||> #1;
wenzelm@18806
  1588
wenzelm@18806
  1589
fun locale_results kind loc args (ctxt, thy) =
wenzelm@18806
  1590
  thy |> gen_thmss cert_facts (K (K (pair [])))
wenzelm@18806
  1591
    kind loc (map (apsnd Thm.simple_fact) args) ([], ctxt)
wenzelm@18806
  1592
  |>> #1;
wenzelm@12702
  1593
wenzelm@12706
  1594
end;
wenzelm@12063
  1595
wenzelm@11896
  1596
wenzelm@18137
  1597
wenzelm@18137
  1598
(** define locales **)
wenzelm@18137
  1599
wenzelm@13336
  1600
(* predicate text *)
ballarin@15596
  1601
(* CB: generate locale predicates and delta predicates *)
wenzelm@13336
  1602
wenzelm@13375
  1603
local
wenzelm@13375
  1604
ballarin@15206
  1605
(* introN: name of theorems for introduction rules of locale and
ballarin@15206
  1606
     delta predicates;
ballarin@15206
  1607
   axiomsN: name of theorem set with destruct rules for locale predicates,
ballarin@15206
  1608
     also name suffix of delta predicates. *)
ballarin@15206
  1609
wenzelm@13375
  1610
val introN = "intro";
ballarin@15206
  1611
val axiomsN = "axioms";
wenzelm@13375
  1612
wenzelm@16458
  1613
fun atomize_spec thy ts =
wenzelm@13375
  1614
  let
wenzelm@18502
  1615
    val t = Logic.mk_conjunction_list ts;
wenzelm@16458
  1616
    val body = ObjectLogic.atomize_term thy t;
wenzelm@13375
  1617
    val bodyT = Term.fastype_of body;
wenzelm@13375
  1618
  in
wenzelm@16458
  1619
    if bodyT = propT then (t, propT, Thm.reflexive (Thm.cterm_of thy t))
wenzelm@18782
  1620
    else (body, bodyT, ObjectLogic.atomize_cterm (Thm.cterm_of thy t))
wenzelm@13375
  1621
  end;
wenzelm@13375
  1622
wenzelm@13394
  1623
fun aprop_tr' n c = (c, fn args =>
wenzelm@13394
  1624
  if length args = n then Syntax.const "_aprop" $ Term.list_comb (Syntax.free c, args)
wenzelm@13394
  1625
  else raise Match);
wenzelm@13336
  1626
ballarin@15104
  1627
(* CB: define one predicate including its intro rule and axioms
ballarin@15104
  1628
   - bname: predicate name
ballarin@15104
  1629
   - parms: locale parameters
ballarin@15104
  1630
   - defs: thms representing substitutions from defines elements
ballarin@15104
  1631
   - ts: terms representing locale assumptions (not normalised wrt. defs)
ballarin@15104
  1632
   - norm_ts: terms representing locale assumptions (normalised wrt. defs)
ballarin@15104
  1633
   - thy: the theory
ballarin@15104
  1634
*)
ballarin@15104
  1635
wenzelm@13420
  1636
fun def_pred bname parms defs ts norm_ts thy =
wenzelm@13375
  1637
  let
wenzelm@16458
  1638
    val name = Sign.full_name thy bname;
wenzelm@13375
  1639
wenzelm@16458
  1640
    val (body, bodyT, body_eq) = atomize_spec thy norm_ts;
wenzelm@13394
  1641
    val env = Term.add_term_free_names (body, []);
wenzelm@19482
  1642
    val xs = filter (fn (x, _) => x mem_string env) parms;
wenzelm@13394
  1643
    val Ts = map #2 xs;
skalberg@15574
  1644
    val extraTs = (Term.term_tfrees body \\ foldr Term.add_typ_tfrees [] Ts)
wenzelm@13394
  1645
      |> Library.sort_wrt #1 |> map TFree;
wenzelm@13399
  1646
    val predT = map Term.itselfT extraTs ---> Ts ---> bodyT;
wenzelm@13336
  1647
wenzelm@13394
  1648
    val args = map Logic.mk_type extraTs @ map Free xs;
wenzelm@13394
  1649
    val head = Term.list_comb (Const (name, predT), args);
wenzelm@18123
  1650
    val statement = ObjectLogic.ensure_propT thy head;
wenzelm@13375
  1651
haftmann@18358
  1652
    val ([pred_def], defs_thy) =
wenzelm@13375
  1653
      thy
wenzelm@13394
  1654
      |> (if bodyT <> propT then I else
wenzelm@13394
  1655
        Theory.add_trfuns ([], [], map (aprop_tr' (length args)) (NameSpace.accesses' name), []))
wenzelm@18671
  1656
      |> Theory.add_consts_i [(bname, predT, NoSyn)]
wenzelm@13375
  1657
      |> PureThy.add_defs_i false [((Thm.def_name bname, Logic.mk_equals (head, body)), [])];
wenzelm@13394
  1658
wenzelm@16458
  1659
    val cert = Thm.cterm_of defs_thy;
wenzelm@13375
  1660
wenzelm@17973
  1661
    val intro = Drule.standard (Goal.prove defs_thy [] norm_ts statement (fn _ =>
wenzelm@13375
  1662
      Tactic.rewrite_goals_tac [pred_def] THEN
wenzelm@13375
  1663
      Tactic.compose_tac (false, body_eq RS Drule.equal_elim_rule1, 1) 1 THEN
wenzelm@19423
  1664
      Tactic.compose_tac (false, Conjunction.intr_list (map (Thm.assume o cert) norm_ts), 0) 1));
wenzelm@13375
  1665
wenzelm@13375
  1666
    val conjuncts =
wenzelm@19423
  1667
      (Drule.equal_elim_rule2 OF [body_eq,
haftmann@17257
  1668
        Tactic.rewrite_rule [pred_def] (Thm.assume (cert statement))])
wenzelm@19423
  1669
      |> Conjunction.elim_precise [length ts] |> hd;
haftmann@17257
  1670
    val axioms = ts ~~ conjuncts |> map (fn (t, ax) =>
wenzelm@19780
  1671
      Element.prove_witness defs_thy t
wenzelm@18123
  1672
       (Tactic.rewrite_goals_tac defs THEN
wenzelm@13375
  1673
        Tactic.compose_tac (false, ax, 0) 1));
haftmann@18550
  1674
  in ((statement, intro, axioms), defs_thy) end;
wenzelm@13375
  1675
haftmann@18550
  1676
fun assumes_to_notes (Assumes asms) axms =
haftmann@18550
  1677
       axms
haftmann@18550
  1678
       |> fold_map (fn (a, spec) => fn axs =>
wenzelm@19018
  1679
            let val (ps, qs) = chop (length spec) axs
wenzelm@19018
  1680
            in ((a, [(ps, [])]), qs) end) asms
wenzelm@19018
  1681
       |-> (pair o Notes)
haftmann@18550
  1682
  | assumes_to_notes e axms = (e, axms);
wenzelm@13394
  1683
ballarin@15206
  1684
(* CB: changes only "new" elems, these have identifier ("", _). *)
ballarin@15206
  1685
haftmann@18917
  1686
fun change_elemss axioms elemss =
haftmann@18550
  1687
  let
haftmann@18550
  1688
    fun change (id as ("", _), es)=
haftmann@18550
  1689
          fold_map assumes_to_notes
wenzelm@19780
  1690
            (map (Element.map_ctxt_values I I (Element.satisfy_thm axioms)) es)
haftmann@18550
  1691
          #-> (fn es' => pair (id, es'))
haftmann@18550
  1692
      | change e = pair e;
haftmann@18550
  1693
  in
wenzelm@19780
  1694
    fst (fold_map change elemss (map Element.conclude_witness axioms))
haftmann@18550
  1695
  end;
wenzelm@13394
  1696
wenzelm@13394
  1697
in
wenzelm@13375
  1698
ballarin@15104
  1699
(* CB: main predicate definition function *)
ballarin@15104
  1700
wenzelm@13394
  1701
fun define_preds bname (parms, ((exts, exts'), (ints, ints')), defs) elemss thy =
wenzelm@13394
  1702
  let
haftmann@18550
  1703
    val ((elemss', more_ts), thy') =
haftmann@18550
  1704
      if null exts then ((elemss, []), thy)
wenzelm@13394
  1705
      else
wenzelm@13394
  1706
        let
skalberg@15531
  1707
          val aname = if null ints then bname else bname ^ "_" ^ axiomsN;
haftmann@18550
  1708
          val ((statement, intro, axioms), def_thy) =
wenzelm@13394
  1709
            thy |> def_pred aname parms defs exts exts';
haftmann@18550
  1710
          val elemss' =
haftmann@18917
  1711
            change_elemss axioms elemss
wenzelm@19585
  1712
            @ [(("", []), [Assumes [((bname ^ "_" ^ axiomsN, []), [(statement, [])])]])];
wenzelm@13394
  1713
        in
haftmann@18377
  1714
          def_thy
wenzelm@18806
  1715
          |> PureThy.note_thmss_qualified "" aname [((introN, []), [([intro], [])])]
haftmann@18377
  1716
          |> snd
haftmann@18550
  1717
          |> pair (elemss', [statement])
wenzelm@13394
  1718
        end;
haftmann@18550
  1719
    val (predicate, thy'') =
haftmann@18550
  1720
      if null ints then (([], []), thy')
wenzelm@13394
  1721
      else
wenzelm@13394
  1722
        let
haftmann@18550
  1723
          val ((statement, intro, axioms), def_thy) =
wenzelm@13394
  1724
            thy' |> def_pred bname parms defs (ints @ more_ts) (ints' @ more_ts);
wenzelm@16458
  1725
          val cstatement = Thm.cterm_of def_thy statement;
wenzelm@13394
  1726
        in
haftmann@18377
  1727
          def_thy
wenzelm@18806
  1728
          |> PureThy.note_thmss_qualified "" bname
haftmann@18377
  1729
               [((introN, []), [([intro], [])]),
wenzelm@19780
  1730
                ((axiomsN, []), [(map (Drule.standard o Element.conclude_witness) axioms, [])])]
haftmann@18377
  1731
          |> snd
haftmann@18550
  1732
          |> pair ([cstatement], axioms)
wenzelm@13394
  1733
        end;
haftmann@18550
  1734
  in ((elemss', predicate), thy'') end;
wenzelm@13375
  1735
wenzelm@13375
  1736
end;
wenzelm@13336
  1737
wenzelm@13336
  1738
wenzelm@13297
  1739
(* add_locale(_i) *)
wenzelm@13297
  1740
wenzelm@13297
  1741
local
wenzelm@13297
  1742
wenzelm@18343
  1743
fun gen_add_locale prep_ctxt prep_expr
wenzelm@18343
  1744
    do_predicate bname raw_import raw_body thy =
wenzelm@13297
  1745
  let
wenzelm@16458
  1746
    val name = Sign.full_name thy bname;
wenzelm@18343
  1747
    val _ = conditional (is_some (get_locale thy name)) (fn () =>
wenzelm@13297
  1748
      error ("Duplicate definition of locale " ^ quote name));
wenzelm@13297
  1749
wenzelm@13297
  1750
    val thy_ctxt = ProofContext.init thy;
ballarin@17228
  1751
    val (((import_ctxt, import_elemss), (body_ctxt, body_elemss, syn)),
ballarin@17228
  1752
      text as (parms, ((_, exts'), _), _)) =
wenzelm@13375
  1753
      prep_ctxt raw_import raw_body thy_ctxt;
haftmann@18917
  1754
    val elemss = import_elemss @ body_elemss;
wenzelm@16458
  1755
    val import = prep_expr thy raw_import;
wenzelm@13297
  1756
ballarin@17228
  1757
    val extraTs = foldr Term.add_term_tfrees [] exts' \\
wenzelm@17756
  1758
      foldr Term.add_typ_tfrees [] (map snd parms);
ballarin@17228
  1759
    val _ = if null extraTs then ()
ballarin@17437
  1760
      else warning ("Additional type variable(s) in locale specification " ^ quote bname);
ballarin@17228
  1761
haftmann@18550
  1762
    val ((elemss', predicate as (predicate_statement, predicate_axioms)), pred_thy) =
wenzelm@18343
  1763
      if do_predicate then thy |> define_preds bname text elemss
haftmann@18550
  1764
      else ((elemss, ([], [])), thy);
wenzelm@13420
  1765
wenzelm@18137
  1766
    fun axiomify axioms elemss =
ballarin@15206
  1767
      (axioms, elemss) |> foldl_map (fn (axs, (id, elems)) => let
wenzelm@19482
  1768
                   val ts = flat (map_filter (fn (Assumes asms) =>
wenzelm@19482
  1769
                     SOME (maps (map #1 o #2) asms) | _ => NONE) elems);
wenzelm@19018
  1770
                   val (axs1, axs2) = chop (length ts) axs;
ballarin@17000
  1771
                 in (axs2, ((id, Assumed axs1), elems)) end)
ballarin@15206
  1772
        |> snd;
haftmann@18569
  1773
    val pred_ctxt = ProofContext.init pred_thy;
ballarin@15206
  1774
    val (ctxt, (_, facts)) = activate_facts (K I)
haftmann@18917
  1775
      (pred_ctxt, axiomify predicate_axioms elemss');
wenzelm@18546
  1776
    val export = ProofContext.export_view predicate_statement ctxt thy_ctxt;
wenzelm@13420
  1777
    val facts' = facts |> map (fn (a, ths) => ((a, []), [(map export ths, [])]));
wenzelm@19482
  1778
    val elems' = maps #2 (filter (equal "" o #1 o #1) elemss');
ballarin@19783
  1779
    val elems'' = map_filter (fn (Fixes _) => NONE | e => SOME e) elems';
wenzelm@19061
  1780
    val thy' = pred_thy
wenzelm@19061
  1781
      |> PureThy.note_thmss_qualified "" bname facts' |> snd
wenzelm@19061
  1782
      |> declare_locale name
wenzelm@19061
  1783
      |> put_locale name
wenzelm@19061
  1784
       {predicate = predicate,
wenzelm@19061
  1785
        import = import,
ballarin@19783
  1786
        elems = map (fn e => (e, stamp ())) elems'',
ballarin@19278
  1787
        params = params_of elemss' |> map (fn (x, SOME T) => ((x, T), the (Symtab.lookup syn x))),
ballarin@19278
  1788
        lparams = map #1 (params_of body_elemss),
wenzelm@19662
  1789
        term_syntax = [],
wenzelm@19061
  1790
        regs = []};
ballarin@19293
  1791
  in ((name, ProofContext.transfer thy' body_ctxt), thy') end;
wenzelm@13297
  1792
wenzelm@13297
  1793
in
wenzelm@13297
  1794
haftmann@18917
  1795
val add_locale = gen_add_locale read_context intern_expr;
haftmann@18917
  1796
val add_locale_i = gen_add_locale cert_context (K I);
wenzelm@13297
  1797
wenzelm@13297
  1798
end;
wenzelm@13297
  1799
wenzelm@19018
  1800
val _ = Context.add_setup
ballarin@19293
  1801
 (add_locale_i true "var" empty [Fixes [(Syntax.internal "x", NONE, NoSyn)]] #> snd #>
ballarin@19293
  1802
  add_locale_i true "struct" empty [Fixes [(Syntax.internal "S", NONE, Structure)]] #> snd);
wenzelm@15801
  1803
wenzelm@13297
  1804
wenzelm@12730
  1805
wenzelm@17355
  1806
(** locale goals **)
wenzelm@17355
  1807
wenzelm@17355
  1808
local
wenzelm@17355
  1809
wenzelm@18137
  1810
fun intern_attrib thy = map_elem (Element.map_ctxt
wenzelm@18137
  1811
  {name = I, var = I, typ = I, term = I, fact = I, attrib = Attrib.intern_src thy});
wenzelm@18137
  1812
wenzelm@18907
  1813
val global_goal = Proof.global_goal ProofDisplay.present_results
wenzelm@18907
  1814
  Attrib.attribute_i ProofContext.bind_propp_schematic_i;
wenzelm@18899
  1815
wenzelm@18907
  1816
fun conclusion prep_att (Element.Shows concl) =
wenzelm@18907
  1817
      (([], concl), fn stmt => fn ctxt => ((Attrib.map_specs prep_att stmt, []), ctxt))
wenzelm@18907
  1818
  | conclusion _ (Element.Obtains cases) = apfst (apfst (map Elem)) (Obtain.statement cases);
wenzelm@18899
  1819
wenzelm@18907
  1820
fun gen_theorem prep_src prep_elem prep_stmt
wenzelm@18907
  1821
    kind before_qed after_qed (name, raw_atts) raw_elems raw_concl thy =
wenzelm@17355
  1822
  let
wenzelm@18907
  1823
    val atts = map (prep_src thy) raw_atts;
wenzelm@18907
  1824
    val ((concl_elems, concl), mk_stmt) = conclusion (prep_src thy) raw_concl;
wenzelm@17355
  1825
    val thy_ctxt = ProofContext.init thy;
wenzelm@18899
  1826
    val elems = map (prep_elem thy) (raw_elems @ concl_elems);
wenzelm@18806
  1827
    val (_, _, (view, ctxt), propp) = prep_stmt NONE elems (map snd concl) thy_ctxt;
wenzelm@18899
  1828
    val ((stmt, facts), goal_ctxt) = ctxt
wenzelm@18899
  1829
      |> ProofContext.add_view thy_ctxt view
wenzelm@18899
  1830
      |> mk_stmt (map fst concl ~~ propp);
wenzelm@18899
  1831
  in
wenzelm@18907
  1832
    global_goal kind before_qed after_qed (SOME "") (name, atts) stmt goal_ctxt
wenzelm@18907
  1833
    |> Proof.refine_insert facts
wenzelm@18899
  1834
  end;
wenzelm@17449
  1835
wenzelm@17449
  1836
fun gen_theorem_in_locale prep_locale prep_src prep_elem prep_stmt no_target
wenzelm@18899
  1837
    kind before_qed after_qed raw_loc (name, atts) raw_elems raw_concl thy =
wenzelm@17355
  1838
  let
wenzelm@18907
  1839
    val ((concl_elems, concl), mk_stmt) = conclusion (prep_src thy) raw_concl;
wenzelm@18806
  1840
    val loc = prep_locale thy raw_loc;
wenzelm@18806
  1841
    val loc_atts = map (prep_src thy) atts;
wenzelm@18806
  1842
    val loc_attss = map (map (prep_src thy) o snd o fst) concl;
wenzelm@18806
  1843
    val target = if no_target then NONE else SOME (extern thy loc);
wenzelm@18899
  1844
    val elems = map (prep_elem thy) (raw_elems @ concl_elems);
wenzelm@17355
  1845
    val names = map (fst o fst) concl;
wenzelm@17355
  1846
wenzelm@19662
  1847
    val thy_ctxt = init_term_syntax loc (ProofContext.init thy);
wenzelm@18806
  1848
    val (_, (loc_view, loc_ctxt), (elems_view, elems_ctxt), propp) =
wenzelm@18806
  1849
      prep_stmt (SOME raw_loc) elems (map snd concl) thy_ctxt;
wenzelm@18123
  1850
    val elems_ctxt' = elems_ctxt
wenzelm@18806
  1851
      |> ProofContext.add_view loc_ctxt elems_view
wenzelm@18806
  1852
      |> ProofContext.add_view thy_ctxt loc_view;
wenzelm@18806
  1853
    val loc_ctxt' = loc_ctxt
wenzelm@18806
  1854
      |> ProofContext.add_view thy_ctxt loc_view;
wenzelm@18137
  1855
wenzelm@18899
  1856
    val ((stmt, facts), goal_ctxt) =
wenzelm@18899
  1857
      elems_ctxt' |> mk_stmt (map (apsnd (K []) o fst) concl ~~ propp);
wenzelm@17355
  1858
wenzelm@18123
  1859
    fun after_qed' results =
wenzelm@18806
  1860
      let val loc_results = results |> (map o map)
wenzelm@18899
  1861
          (ProofContext.export_standard goal_ctxt loc_ctxt') in
wenzelm@18806
  1862
        curry (locale_results kind loc ((names ~~ loc_attss) ~~ loc_results)) loc_ctxt
wenzelm@18123
  1863
        #-> (fn res =>
wenzelm@18806
  1864
          if name = "" andalso null loc_atts then I
wenzelm@19482
  1865
          else #2 o locale_results kind loc [((name, loc_atts), maps #2 res)])
wenzelm@17355
  1866
        #> #2
wenzelm@18806
  1867
        #> after_qed loc_results results
wenzelm@17355
  1868
      end;
wenzelm@18899
  1869
  in
wenzelm@18907
  1870
    global_goal kind before_qed after_qed' target (name, []) stmt goal_ctxt
wenzelm@18907
  1871
    |> Proof.refine_insert facts
wenzelm@18899
  1872
  end;
wenzelm@17355
  1873
wenzelm@17355
  1874
in
wenzelm@17355
  1875
wenzelm@18907
  1876
val theorem = gen_theorem Attrib.intern_src intern_attrib read_context_statement;
wenzelm@17355
  1877
val theorem_i = gen_theorem (K I) (K I) cert_context_statement;
wenzelm@18137
  1878
wenzelm@18137
  1879
val theorem_in_locale = gen_theorem_in_locale intern Attrib.intern_src intern_attrib
wenzelm@18137
  1880
  read_context_statement false;
wenzelm@18137
  1881
wenzelm@18137
  1882
val theorem_in_locale_i = gen_theorem_in_locale (K I) (K I) (K I)
wenzelm@18137
  1883
  cert_context_statement false;
wenzelm@18137
  1884
wenzelm@18137
  1885
val theorem_in_locale_no_target = gen_theorem_in_locale (K I) (K I) (K I)
wenzelm@18137
  1886
  cert_context_statement true;
wenzelm@17355
  1887
wenzelm@18899
  1888
fun smart_theorem kind NONE a [] (Element.Shows concl) =
wenzelm@18123
  1889
      Proof.theorem kind NONE (K I) (SOME "") a concl o ProofContext.init
wenzelm@17355
  1890
  | smart_theorem kind NONE a elems concl =
wenzelm@18123
  1891
      theorem kind NONE (K I) a elems concl
wenzelm@17355
  1892
  | smart_theorem kind (SOME loc) a elems concl =
wenzelm@17856
  1893
      theorem_in_locale kind NONE (K (K I)) loc a elems concl;
wenzelm@17355
  1894
wenzelm@17355
  1895
end;
wenzelm@17355
  1896
wenzelm@17355
  1897
wenzelm@19780
  1898
ballarin@15598
  1899
(** Interpretation commands **)
ballarin@15596
  1900
ballarin@15596
  1901
local
ballarin@15596
  1902
ballarin@15596
  1903
(* extract proof obligations (assms and defs) from elements *)
ballarin@15596
  1904
wenzelm@19780
  1905
fun extract_asms_elems ((id, Assumed _), elems) = (id, maps Element.prems_of elems)
ballarin@17138
  1906
  | extract_asms_elems ((id, Derived _), _) = (id, []);
ballarin@15596
  1907
ballarin@15596
  1908
ballarin@15624
  1909
(* activate instantiated facts in theory or context *)
ballarin@15596
  1910
ballarin@17138
  1911
fun gen_activate_facts_elemss get_reg note attrib std put_reg add_wit
wenzelm@18123
  1912
        attn all_elemss new_elemss propss thmss thy_ctxt =
ballarin@17033
  1913
    let
ballarin@17033
  1914
      fun activate_elem disch (prfx, atts) (Notes facts) thy_ctxt =
ballarin@17033
  1915
          let
ballarin@17033
  1916
            val facts' = facts
ballarin@17033
  1917
              (* discharge hyps in attributes *)
wenzelm@17109
  1918
              |> Attrib.map_facts (attrib thy_ctxt o Args.map_values I I I disch)
ballarin@17033
  1919
              (* insert interpretation attributes *)
ballarin@17033
  1920
              |> map (apfst (apsnd (fn a => a @ map (attrib thy_ctxt) atts)))
ballarin@17033
  1921
              (* discharge hyps *)
wenzelm@19061
  1922
              |> map (apsnd (map (apfst (map disch))));
wenzelm@19780
  1923
          in snd (note prfx facts' thy_ctxt) end
ballarin@17033
  1924
        | activate_elem _ _ _ thy_ctxt = thy_ctxt;
ballarin@17033
  1925
ballarin@17138
  1926
      fun activate_elems disch ((id, _), elems) thy_ctxt =
ballarin@17033
  1927
          let
wenzelm@18343
  1928
            val ((prfx, atts2), _) = the (get_reg thy_ctxt id)
ballarin@17033
  1929
                handle Option => sys_error ("Unknown registration of " ^
ballarin@17033
  1930
                  quote (fst id) ^ " while activating facts.");
ballarin@17033
  1931
          in
ballarin@17033
  1932
            fold (activate_elem disch (prfx, atts2)) elems thy_ctxt
ballarin@17033
  1933
          end;
ballarin@15596
  1934
ballarin@17033
  1935
      val thy_ctxt' = thy_ctxt
ballarin@17033
  1936
        (* add registrations *)
ballarin@17033
  1937
        |> fold (fn ((id, _), _) => put_reg id attn) new_elemss
ballarin@17033
  1938
        (* add witnesses of Assumed elements *)
wenzelm@19780
  1939
        |> fold (fn (id, thms) => fold (add_wit id) thms) (map fst propss ~~ thmss);
ballarin@15596
  1940
wenzelm@19482
  1941
      val prems = flat (map_filter
ballarin@17033
  1942
            (fn ((id, Assumed _), _) => Option.map snd (get_reg thy_ctxt' id)
ballarin@17033
  1943
              | ((_, Derived _), _) => NONE) all_elemss);
ballarin@17033
  1944
      val thy_ctxt'' = thy_ctxt'
ballarin@17033
  1945
        (* add witnesses of Derived elements *)
wenzelm@19780
  1946
        |> fold (fn (id, thms) => fold (add_wit id o Element.satisfy_witness prems) thms)
wenzelm@19482
  1947
           (map_filter (fn ((_, Assumed _), _) => NONE
ballarin@17033
  1948
              | ((id, Derived thms), _) => SOME (id, thms)) all_elemss)
wenzelm@19780
  1949
wenzelm@19780
  1950
      val disch' = std o Element.satisfy_thm prems;  (* FIXME *)
ballarin@17033
  1951
    in
ballarin@17033
  1952
      thy_ctxt''
ballarin@17033
  1953
        (* add facts to theory or context *)
ballarin@17033
  1954
        |> fold (activate_elems disch') new_elemss
ballarin@17033
  1955
    end;
ballarin@15596
  1956
wenzelm@17355
  1957
fun global_activate_facts_elemss x = gen_activate_facts_elemss
ballarin@15696
  1958
      (fn thy => fn (name, ps) =>
ballarin@15696
  1959
        get_global_registration thy (name, map Logic.varify ps))
wenzelm@19780
  1960
      (global_note_prefix_i "")
wenzelm@18728
  1961
      Attrib.attribute_i Drule.standard
ballarin@17033
  1962
      (fn (name, ps) => put_global_registration (name, map Logic.varify ps))
wenzelm@19780
  1963
      (fn (n, ps) => add_global_witness (n, map Logic.varify ps) o
wenzelm@19810
  1964
        Element.map_witness (fn (t, th) => (Logic.legacy_unvarify t, Drule.freeze_all th))
wenzelm@19780
  1965
        (* FIXME *)) x;
wenzelm@17355
  1966
wenzelm@17355
  1967
fun local_activate_facts_elemss x = gen_activate_facts_elemss
ballarin@15696
  1968
      get_local_registration
wenzelm@19018
  1969
      local_note_prefix_i
wenzelm@18728
  1970
      (Attrib.attribute_i o ProofContext.theory_of) I
ballarin@17033
  1971
      put_local_registration
wenzelm@17355
  1972
      add_local_witness x;
ballarin@15624
  1973
ballarin@17033
  1974
fun gen_prep_registration mk_ctxt is_local read_terms test_reg activate
ballarin@15624
  1975
    attn expr insts thy_ctxt =
ballarin@15596
  1976
  let
ballarin@15624
  1977
    val ctxt = mk_ctxt thy_ctxt;
wenzelm@16458
  1978
    val thy = ProofContext.theory_of ctxt;
ballarin@15596
  1979
ballarin@15696
  1980
    val ctxt' = ctxt |> ProofContext.theory_of |> ProofContext.init;
ballarin@19783
  1981
    val pts = params_of_expr ctxt' [] (intern_expr thy expr)
ballarin@19783
  1982
          ([], Symtab.empty, Symtab.empty);
ballarin@19783
  1983
    val params_ids = make_params_ids (#1 pts);
ballarin@19783
  1984
    val raw_params_elemss = make_raw_params_elemss pts;
wenzelm@16458
  1985
    val ((ids, _), raw_elemss) = flatten (ctxt', intern_expr thy)
ballarin@16102
  1986
          (([], Symtab.empty), Expr expr);
ballarin@17000
  1987
    val ((parms, all_elemss, _), (_, (_, defs, _))) =
ballarin@19783
  1988
          read_elemss false ctxt' [] (raw_params_elemss @ raw_elemss) [];
ballarin@15596
  1989
ballarin@15596
  1990
    (** compute instantiation **)
ballarin@15596
  1991
ballarin@15696
  1992
    (* user input *)
ballarin@15596
  1993
    val insts = if length parms < length insts
ballarin@15596
  1994
         then error "More arguments than parameters in instantiation."
ballarin@15596
  1995
         else insts @ replicate (length parms - length insts) NONE;
ballarin@15596
  1996
    val (ps, pTs) = split_list parms;
wenzelm@19810
  1997
    val pvTs = map Logic.legacy_varifyT pTs;
ballarin@15598
  1998
ballarin@15598
  1999
    (* instantiations given by user *)
wenzelm@19482
  2000
    val given = map_filter (fn (_, (NONE, _)) => NONE
ballarin@15596
  2001
         | (x, (SOME inst, T)) => SOME (x, (inst, T))) (ps ~~ (insts ~~ pvTs));
ballarin@15596
  2002
    val (given_ps, given_insts) = split_list given;
ballarin@15596
  2003
    val tvars = foldr Term.add_typ_tvars [] pvTs;
ballarin@15596
  2004
    val used = foldr Term.add_typ_varnames [] pvTs;
haftmann@17485
  2005
    fun sorts (a, i) = AList.lookup (op =) tvars (a, i);
ballarin@15624
  2006
    val (vs, vinst) = read_terms thy_ctxt sorts used given_insts;
ballarin@15696
  2007
    val vars = foldl Term.add_term_tvar_ixns [] vs \\ map fst tvars;
wenzelm@16861
  2008
    val vars' = fold Term.add_term_varnames vs vars;
ballarin@15696
  2009
    val _ = if null vars' then ()
ballarin@15696
  2010
         else error ("Illegal schematic variable(s) in instantiation: " ^
ballarin@15696
  2011
           commas_quote (map Syntax.string_of_vname vars'));
ballarin@15598
  2012
    (* replace new types (which are TFrees) by ones with new names *)
ballarin@15598
  2013
    val new_Tnames = foldr Term.add_term_tfree_names [] vs;
ballarin@15598
  2014
    val new_Tnames' = Term.invent_names used "'a" (length new_Tnames);
ballarin@15696
  2015
    val renameT =
ballarin@15696
  2016
          if is_local then I
wenzelm@19810
  2017
          else Logic.legacy_unvarifyT o Term.map_type_tfree (fn (a, s) =>
haftmann@17485
  2018
            TFree ((the o AList.lookup (op =) (new_Tnames ~~ new_Tnames')) a, s));
ballarin@15696
  2019
    val rename =
ballarin@15696
  2020
          if is_local then I
ballarin@15696
  2021
          else Term.map_term_types renameT;
ballarin@15598
  2022
ballarin@15598
  2023
    val tinst = Symtab.make (map
ballarin@15696
  2024
                (fn ((x, 0), T) => (x, T |> renameT)
wenzelm@16850
  2025
                  | ((_, n), _) => sys_error "Internal error var in prep_registration") vinst);
ballarin@15696
  2026
    val inst = Symtab.make (given_ps ~~ map rename vs);
ballarin@15596
  2027
ballarin@15596
  2028
    (* defined params without user input *)
wenzelm@19482
  2029
    val not_given = map_filter (fn (x, (NONE, T)) => SOME (x, T)
ballarin@15596
  2030
         | (_, (SOME _, _)) => NONE) (ps ~~ (insts ~~ pTs));
wenzelm@18137
  2031
    fun add_def (p, pT) inst =
ballarin@15596
  2032
      let
ballarin@15596
  2033
        val (t, T) = case find_first (fn (Free (a, _), _) => a = p) defs of
ballarin@15596
  2034
               NONE => error ("Instance missing for parameter " ^ quote p)
ballarin@15596
  2035
             | SOME (Free (_, T), t) => (t, T);
wenzelm@18137
  2036
        val d = Element.inst_term (tinst, inst) t;
wenzelm@18137
  2037
      in Symtab.update_new (p, d) inst end;
wenzelm@18137
  2038
    val inst = fold add_def not_given inst;
wenzelm@18137
  2039
    val insts = (tinst, inst);
wenzelm@18137
  2040
    (* Note: insts contain no vars. *)
ballarin@15596
  2041
ballarin@19783
  2042
ballarin@15596
  2043
    (** compute proof obligations **)
ballarin@15596
  2044
ballarin@15598
  2045
    (* restore "small" ids *)
ballarin@17000
  2046
    val ids' = map (fn ((n, ps), (_, mode)) =>
ballarin@19783
  2047
          ((n, map (fn p => Free (p, (the o AList.lookup (op =) parms) p)) ps), mode))
ballarin@19783
  2048
        (params_ids @ ids);
ballarin@15596
  2049
    (* instantiate ids and elements *)
wenzelm@18137
  2050
    val inst_elemss = (ids' ~~ all_elemss) |> map (fn (((n, ps), _), ((_, mode), elems)) =>
wenzelm@18137
  2051
      ((n, map (Element.inst_term insts) ps),
wenzelm@18137
  2052
        map (fn Int e => Element.inst_ctxt thy insts e) elems)
wenzelm@19780
  2053
      |> apfst (fn id => (id, map_mode (map (Element.inst_witness thy insts)) mode)));
ballarin@15596
  2054
ballarin@15624
  2055
    (* remove fragments already registered with theory or context *)
wenzelm@19482
  2056
    val new_inst_elemss = filter (fn ((id, _), _) =>
ballarin@15624
  2057
          not (test_reg thy_ctxt id)) inst_elemss;
wenzelm@15703
  2058
    val new_ids = map #1 new_inst_elemss;
ballarin@15596
  2059
wenzelm@19780
  2060
    val propss = map extract_asms_elems new_inst_elemss;
ballarin@15596
  2061
wenzelm@15703
  2062
    val bind_attrib = Attrib.crude_closure ctxt o Args.assignable;
wenzelm@16458
  2063
    val attn' = apsnd (map (bind_attrib o Attrib.intern_src thy)) attn;
ballarin@15596
  2064
ballarin@17033
  2065
  in (propss, activate attn' inst_elemss new_inst_elemss propss) end;
ballarin@15624
  2066
ballarin@15624
  2067
val prep_global_registration = gen_prep_registration
ballarin@15696
  2068
     ProofContext.init false
ballarin@15624
  2069
     (fn thy => fn sorts => fn used =>
wenzelm@16458
  2070
       Sign.read_def_terms (thy, K NONE, sorts) used true)
ballarin@15696
  2071
     (fn thy => fn (name, ps) =>
ballarin@15696
  2072
       test_global_registration thy (name, map Logic.varify ps))
ballarin@15624
  2073
     global_activate_facts_elemss;
ballarin@15624
  2074
ballarin@15624
  2075
val prep_local_registration = gen_prep_registration
ballarin@15696
  2076
     I true
ballarin@15624
  2077
     (fn ctxt => ProofContext.read_termTs ctxt (K false) (K NONE))
ballarin@15624
  2078
     smart_test_registration
ballarin@15624
  2079
     local_activate_facts_elemss;
ballarin@15596
  2080
ballarin@17000
  2081
fun prep_registration_in_locale target expr thy =
ballarin@17000
  2082
  (* target already in internal form *)
ballarin@17000
  2083
  let
ballarin@17000
  2084
    val ctxt = ProofContext.init thy;
ballarin@17138
  2085
    val ((raw_target_ids, target_syn), _) = flatten (ctxt, I)
ballarin@17000
  2086
        (([], Symtab.empty), Expr (Locale target));
ballarin@19278
  2087
    val fixed = the_locale thy target |> #params |> map #1;
ballarin@17000
  2088
    val ((all_ids, syn), raw_elemss) = flatten (ctxt, intern_expr thy)
ballarin@17138
  2089
        ((raw_target_ids, target_syn), Expr expr);
wenzelm@19018
  2090
    val (target_ids, ids) = chop (length raw_target_ids) all_ids;
ballarin@17138
  2091
    val ((parms, elemss, _), _) = read_elemss false ctxt fixed raw_elemss [];
ballarin@17000
  2092
ballarin@17000
  2093
    (** compute proof obligations **)
ballarin@17000
  2094
ballarin@17000
  2095
    (* restore "small" ids, with mode *)
ballarin@17000
  2096
    val ids' = map (apsnd snd) ids;
ballarin@17000
  2097
    (* remove Int markers *)
ballarin@17000
  2098
    val elemss' = map (fn (_, es) =>
ballarin@17000
  2099
        map (fn Int e => e) es) elemss
ballarin@17000
  2100
    (* extract assumptions and defs *)
ballarin@17138
  2101
    val ids_elemss = ids' ~~ elemss';
wenzelm@19780
  2102
    val propss = map extract_asms_elems ids_elemss;
ballarin@17000
  2103
ballarin@17138
  2104
    (** activation function:
ballarin@17138
  2105
        - add registrations to the target locale
ballarin@17138
  2106
        - add induced registrations for all global registrations of
ballarin@17138
  2107
          the target, unless already present
ballarin@17138
  2108
        - add facts of induced registrations to theory **)
ballarin@17138
  2109
wenzelm@19482
  2110
    val t_ids = map_filter
ballarin@17138
  2111
        (fn (id, (_, Assumed _)) => SOME id | _ => NONE) target_ids;
ballarin@17138
  2112
wenzelm@18123
  2113
    fun activate thmss thy = let
wenzelm@19780
  2114
        val satisfy = Element.satisfy_thm (flat thmss);
wenzelm@18123
  2115
        val ids_elemss_thmss = ids_elemss ~~ thmss;
ballarin@17138
  2116
        val regs = get_global_registrations thy target;
ballarin@17138
  2117
ballarin@17138
  2118
        fun activate_id (((id, Assumed _), _), thms) thy =
ballarin@17033
  2119
            thy |> put_registration_in_locale target id
ballarin@17138
  2120
                |> fold (add_witness_in_locale target id) thms
ballarin@17138
  2121
          | activate_id _ thy = thy;
ballarin@17138
  2122
ballarin@17138
  2123
        fun activate_reg (vts, ((prfx, atts2), _)) thy = let
wenzelm@18137
  2124
            val (insts, wits) = collect_global_witnesses thy fixed t_ids vts;
wenzelm@18137
  2125
            fun inst_parms ps = map
haftmann@17485
  2126
                  (the o AList.lookup (op =) (map #1 fixed ~~ vts)) ps;
wenzelm@19780
  2127
            val disch = Element.satisfy_thm wits;
wenzelm@19482
  2128
            val new_elemss = filter (fn (((name, ps), _), _) =>
ballarin@17138
  2129
                not (test_global_registration thy (name, inst_parms ps))) (ids_elemss);
ballarin@17138
  2130
            fun activate_assumed_id (((_, Derived _), _), _) thy = thy
ballarin@17138
  2131
              | activate_assumed_id ((((name, ps), Assumed _), _), thms) thy = let
ballarin@17138
  2132
                val ps' = inst_parms ps;
ballarin@17138
  2133
              in
ballarin@17138
  2134
                if test_global_registration thy (name, ps')
ballarin@17138
  2135
                then thy
ballarin@17138
  2136
                else thy
ballarin@17138
  2137
                  |> put_global_registration (name, ps') (prfx, atts2)
wenzelm@19780
  2138
                  |> fold (fn witn => fn thy => add_global_witness (name, ps')
wenzelm@19780
  2139
                     (Element.inst_witness thy insts witn) thy) thms
ballarin@17138
  2140
              end;
ballarin@17138
  2141
ballarin@17138
  2142
            fun activate_derived_id ((_, Assumed _), _) thy = thy
ballarin@17138
  2143
              | activate_derived_id (((name, ps), Derived ths), _) thy = let
ballarin@17138
  2144
                val ps' = inst_parms ps;
ballarin@17138
  2145
              in
ballarin@17138
  2146
                if test_global_registration thy (name, ps')
ballarin@17138
  2147
                then thy
ballarin@17138
  2148
                else thy
ballarin@17138
  2149
                  |> put_global_registration (name, ps') (prfx, atts2)
wenzelm@19780
  2150
                  |> fold (fn witn => fn thy => add_global_witness (name, ps')
wenzelm@19780
  2151
                       (witn |> Element.map_witness (fn (t, th) =>  (* FIXME *)
wenzelm@18137
  2152
                       (Element.inst_term insts t,
wenzelm@19780
  2153
                        disch (Element.inst_thm thy insts (satisfy th))))) thy) ths
ballarin@17138
  2154
              end;
ballarin@17138
  2155
ballarin@17138
  2156
            fun activate_elem (Notes facts) thy =
ballarin@17138
  2157
                let
ballarin@17138
  2158
                  val facts' = facts
wenzelm@18728
  2159
                      |> Attrib.map_facts (Attrib.attribute_i thy o
wenzelm@18137
  2160
                         Args.map_values I (Element.instT_type (#1 insts))
wenzelm@18137
  2161
                           (Element.inst_term insts)
wenzelm@18137
  2162
                           (disch o Element.inst_thm thy insts o satisfy))
wenzelm@18728
  2163
                      |> map (apfst (apsnd (fn a => a @ map (Attrib.attribute thy) atts2)))
wenzelm@18137
  2164
                      |> map (apsnd (map (apfst (map (disch o Element.inst_thm thy insts o satisfy)))))
ballarin@17138
  2165
                in
haftmann@18377
  2166
                  thy
wenzelm@19018
  2167
                  |> global_note_prefix_i "" prfx facts'
haftmann@18377
  2168
                  |> snd
ballarin@17138
  2169
                end
ballarin@17138
  2170
              | activate_elem _ thy = thy;
ballarin@17138
  2171
ballarin@17138
  2172
            fun activate_elems (_, elems) thy = fold activate_elem elems thy;
ballarin@17138
  2173
ballarin@17138
  2174
          in thy |> fold activate_assumed_id ids_elemss_thmss
ballarin@17138
  2175
                 |> fold activate_derived_id ids_elemss
ballarin@17138
  2176
                 |> fold activate_elems new_elemss end;
ballarin@17033
  2177
      in
ballarin@17138
  2178
        thy |> fold activate_id ids_elemss_thmss
ballarin@17138
  2179
            |> fold activate_reg regs
ballarin@17033
  2180
      end;
ballarin@17000
  2181
ballarin@17033
  2182
  in (propss, activate) end;
ballarin@17000
  2183
wenzelm@17355
  2184
fun prep_propp propss = propss |> map (fn ((name, _), props) =>
wenzelm@19780
  2185
  (("", []), map (rpair [] o Element.mark_witness) props));
wenzelm@18123
  2186
wenzelm@18123
  2187
fun prep_result propps thmss =
wenzelm@19780
  2188
  ListPair.map (fn ((_, props), thms) => map2 Element.make_witness props thms) (propps, thmss);
ballarin@17437
  2189
ballarin@17438
  2190
fun goal_name thy kind target propss =
ballarin@17438
  2191
    kind ^ Proof.goal_names (Option.map (extern thy) target) ""
ballarin@17438
  2192
      (propss |> map (fn ((name, _), _) => extern thy name));
wenzelm@17355
  2193
wenzelm@17355
  2194
in
wenzelm@17355
  2195
wenzelm@17355
  2196
fun interpretation (prfx, atts) expr insts thy =
wenzelm@17355
  2197
  let
wenzelm@17355
  2198
    val (propss, activate) = prep_global_registration (prfx, atts) expr insts thy;
wenzelm@17449
  2199
    val kind = goal_name thy "interpretation" NONE propss;
wenzelm@18502
  2200
    val after_qed = activate o prep_result propss;
wenzelm@18123
  2201
  in
wenzelm@18137
  2202
    ProofContext.init thy
wenzelm@18123
  2203
    |> Proof.theorem_i kind NONE after_qed NONE ("", []) (prep_propp propss)
wenzelm@19810
  2204
    |> Element.refine_witness |> Seq.hd
wenzelm@18123
  2205
  end;
wenzelm@17355
  2206
wenzelm@17355
  2207
fun interpretation_in_locale (raw_target, expr) thy =
wenzelm@17355
  2208
  let
wenzelm@17355
  2209
    val target = intern thy raw_target;
wenzelm@17355
  2210
    val (propss, activate) = prep_registration_in_locale target expr thy;
wenzelm@17449
  2211
    val kind = goal_name thy "interpretation" (SOME target) propss;
wenzelm@18137
  2212
    val after_qed = K (activate o prep_result propss);
wenzelm@18123
  2213
  in
wenzelm@18123
  2214
    thy
wenzelm@18899
  2215
    |> theorem_in_locale_no_target kind NONE after_qed target ("", []) []
wenzelm@18899
  2216
      (Element.Shows (prep_propp propss))
wenzelm@19810
  2217
    |> Element.refine_witness |> Seq.hd
wenzelm@18123
  2218
  end;
wenzelm@17449
  2219
wenzelm@17449
  2220
fun interpret (prfx, atts) expr insts int state =
wenzelm@17449
  2221
  let
wenzelm@19296
  2222
    val _ = Proof.assert_forward_or_chain state;
wenzelm@17449
  2223
    val ctxt = Proof.context_of state;
wenzelm@17449
  2224
    val (propss, activate) = prep_local_registration (prfx, atts) expr insts ctxt;
wenzelm@17449
  2225
    val kind = goal_name (Proof.theory_of state) "interpret" NONE propss;
wenzelm@18123
  2226
    fun after_qed results =
wenzelm@18123
  2227
      Proof.map_context (K (ctxt |> activate (prep_result propss results)))
wenzelm@17449
  2228
      #> Proof.put_facts NONE
wenzelm@17449
  2229
      #> Seq.single;
wenzelm@17355
  2230
  in
wenzelm@18123
  2231
    state
wenzelm@18123
  2232
    |> Proof.local_goal (ProofDisplay.print_results int) (K I) ProofContext.bind_propp_i
wenzelm@18123
  2233
      kind NONE after_qed (prep_propp propss)
wenzelm@19810
  2234
    |> Element.refine_witness |> Seq.hd
ballarin@17437
  2235
  end;
ballarin@15596
  2236
wenzelm@11896
  2237
end;
wenzelm@17355
  2238
wenzelm@17355
  2239
end;