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