src/Pure/Isar/expression.ML
author wenzelm
Thu Mar 19 13:28:55 2009 +0100 (2009-03-19)
changeset 30585 6b2ba4666336
parent 30469 de9e8f1d927c
child 30725 c23a5b3cd1b9
permissions -rw-r--r--
use Name.of_binding for basic logical entities without name space (fixes, case names etc.);
ballarin@28697
     1
(*  Title:      Pure/Isar/expression.ML
ballarin@28697
     2
    Author:     Clemens Ballarin, TU Muenchen
ballarin@28697
     3
haftmann@29360
     4
Locale expressions.
ballarin@28697
     5
*)
ballarin@28697
     6
ballarin@28697
     7
signature EXPRESSION =
ballarin@28697
     8
sig
haftmann@29501
     9
  (* Locale expressions *)
haftmann@29501
    10
  datatype 'term map = Positional of 'term option list | Named of (string * 'term) list
haftmann@29501
    11
  type 'term expr = (string * ((string * bool) * 'term map)) list
haftmann@29578
    12
  type expression_i = term expr * (binding * typ option * mixfix) list
haftmann@29578
    13
  type expression = string expr * (binding * string option * mixfix) list
ballarin@28697
    14
ballarin@28898
    15
  (* Processing of context statements *)
haftmann@29441
    16
  val cert_statement: Element.context_i list -> (term * term list) list list ->
haftmann@29501
    17
    Proof.context -> (term * term list) list list * Proof.context
ballarin@28879
    18
  val read_statement: Element.context list -> (string * string list) list list ->
haftmann@29501
    19
    Proof.context -> (term * term list) list list * Proof.context
ballarin@28879
    20
ballarin@28795
    21
  (* Declaring locales *)
haftmann@29702
    22
  val cert_declaration: expression_i -> (Proof.context -> Proof.context) -> Element.context_i list ->
haftmann@29702
    23
    Proof.context -> ((binding * typ option * mixfix) list * (string * morphism) list
haftmann@29501
    24
      * Element.context_i list) * ((string * typ) list * Proof.context)
haftmann@29702
    25
  val cert_read_declaration: expression_i -> (Proof.context -> Proof.context) -> Element.context list ->
haftmann@29702
    26
    Proof.context -> ((binding * typ option * mixfix) list * (string * morphism) list
haftmann@29501
    27
      * Element.context_i list) * ((string * typ) list * Proof.context)
haftmann@29501
    28
      (*FIXME*)
haftmann@29702
    29
  val read_declaration: expression -> (Proof.context -> Proof.context) -> Element.context list ->
haftmann@29702
    30
    Proof.context -> ((binding * typ option * mixfix) list * (string * morphism) list
haftmann@29501
    31
      * Element.context_i list) * ((string * typ) list * Proof.context)
wenzelm@30344
    32
  val add_locale: binding -> binding -> expression_i -> Element.context_i list ->
haftmann@29501
    33
    theory -> string * local_theory
wenzelm@30344
    34
  val add_locale_cmd: binding -> binding -> expression -> Element.context list ->
haftmann@29501
    35
    theory -> string * local_theory
ballarin@28885
    36
ballarin@28895
    37
  (* Interpretation *)
haftmann@29441
    38
  val cert_goal_expression: expression_i -> Proof.context ->
haftmann@29501
    39
    (term list list * (string * morphism) list * morphism) * Proof.context
haftmann@29496
    40
  val read_goal_expression: expression -> Proof.context ->
haftmann@29501
    41
    (term list list * (string * morphism) list * morphism) * Proof.context
haftmann@29501
    42
  val sublocale: string -> expression_i -> theory -> Proof.state
haftmann@29501
    43
  val sublocale_cmd: string -> expression -> theory -> Proof.state
wenzelm@30344
    44
  val interpretation: expression_i -> (Attrib.binding * term) list -> theory -> Proof.state
wenzelm@30344
    45
  val interpretation_cmd: expression -> (Attrib.binding * string) list -> theory -> Proof.state
haftmann@29501
    46
  val interpret: expression_i -> bool -> Proof.state -> Proof.state
haftmann@29501
    47
  val interpret_cmd: expression -> bool -> Proof.state -> Proof.state
ballarin@28697
    48
end;
ballarin@28697
    49
ballarin@28885
    50
structure Expression : EXPRESSION =
ballarin@28697
    51
struct
ballarin@28697
    52
ballarin@28795
    53
datatype ctxt = datatype Element.ctxt;
ballarin@28795
    54
ballarin@28795
    55
ballarin@28795
    56
(*** Expressions ***)
ballarin@28697
    57
ballarin@28872
    58
datatype 'term map =
ballarin@28872
    59
  Positional of 'term option list |
ballarin@28872
    60
  Named of (string * 'term) list;
ballarin@28697
    61
ballarin@29214
    62
type 'term expr = (string * ((string * bool) * 'term map)) list;
ballarin@28697
    63
haftmann@29578
    64
type expression = string expr * (binding * string option * mixfix) list;
haftmann@29578
    65
type expression_i = term expr * (binding * typ option * mixfix) list;
ballarin@28795
    66
ballarin@28697
    67
ballarin@28859
    68
(** Internalise locale names in expr **)
ballarin@28697
    69
haftmann@29360
    70
fun intern thy instances =  map (apfst (Locale.intern thy)) instances;
ballarin@28697
    71
ballarin@28697
    72
ballarin@28859
    73
(** Parameters of expression.
ballarin@28697
    74
ballarin@28895
    75
   Sanity check of instantiations and extraction of implicit parameters.
ballarin@28895
    76
   The latter only occurs iff strict = false.
ballarin@28895
    77
   Positional instantiations are extended to match full length of parameter list
ballarin@28895
    78
   of instantiated locale. **)
ballarin@28895
    79
ballarin@28895
    80
fun parameters_of thy strict (expr, fixed) =
ballarin@28697
    81
  let
ballarin@28697
    82
    fun reject_dups message xs =
ballarin@28697
    83
      let val dups = duplicates (op =) xs
ballarin@28697
    84
      in
ballarin@28697
    85
        if null dups then () else error (message ^ commas dups)
ballarin@28697
    86
      end;
ballarin@28697
    87
wenzelm@30223
    88
    fun match_bind (n, b) = (n = Binding.name_of b);
wenzelm@29288
    89
    fun parm_eq ((b1, mx1: mixfix), (b2, mx2)) =
wenzelm@30344
    90
      Binding.eq_name (b1, b2) andalso
wenzelm@30220
    91
        (mx1 = mx2 orelse
wenzelm@30220
    92
          error ("Conflicting syntax for parameter " ^ quote (Binding.str_of b1) ^ " in expression"));
wenzelm@30344
    93
ballarin@28795
    94
    fun params_loc loc =
haftmann@29797
    95
      (Locale.params_of thy loc |> map (fn (p, _, mx) => (p, mx)), loc);
ballarin@28795
    96
    fun params_inst (expr as (loc, (prfx, Positional insts))) =
ballarin@28697
    97
          let
ballarin@28795
    98
            val (ps, loc') = params_loc loc;
haftmann@29358
    99
            val d = length ps - length insts;
haftmann@29358
   100
            val insts' =
haftmann@29358
   101
              if d < 0 then error ("More arguments than parameters in instantiation of locale " ^
haftmann@29360
   102
                quote (Locale.extern thy loc))
haftmann@29358
   103
              else insts @ replicate d NONE;
ballarin@28697
   104
            val ps' = (ps ~~ insts') |>
ballarin@28697
   105
              map_filter (fn (p, NONE) => SOME p | (_, SOME _) => NONE);
ballarin@28885
   106
          in (ps', (loc', (prfx, Positional insts'))) end
ballarin@28795
   107
      | params_inst (expr as (loc, (prfx, Named insts))) =
ballarin@28697
   108
          let
ballarin@28697
   109
            val _ = reject_dups "Duplicate instantiation of the following parameter(s): "
ballarin@28859
   110
              (map fst insts);
ballarin@28697
   111
ballarin@28795
   112
            val (ps, loc') = params_loc loc;
ballarin@28697
   113
            val ps' = fold (fn (p, _) => fn ps =>
ballarin@28795
   114
              if AList.defined match_bind ps p then AList.delete match_bind p ps
ballarin@28859
   115
              else error (quote p ^" not a parameter of instantiated expression.")) insts ps;
ballarin@28885
   116
          in (ps', (loc', (prfx, Named insts))) end;
ballarin@28885
   117
    fun params_expr is =
ballarin@28697
   118
          let
ballarin@28697
   119
            val (is', ps') = fold_map (fn i => fn ps =>
ballarin@28697
   120
              let
ballarin@28795
   121
                val (ps', i') = params_inst i;
ballarin@29030
   122
                val ps'' = distinct parm_eq (ps @ ps');
ballarin@28697
   123
              in (i', ps'') end) is []
ballarin@28885
   124
          in (ps', is') end;
ballarin@28697
   125
ballarin@28895
   126
    val (implicit, expr') = params_expr expr;
ballarin@28697
   127
wenzelm@30585
   128
    val implicit' = map (#1 #> Name.of_binding) implicit;
wenzelm@30585
   129
    val fixed' = map (#1 #> Name.of_binding) fixed;
ballarin@28697
   130
    val _ = reject_dups "Duplicate fixed parameter(s): " fixed';
wenzelm@30344
   131
    val implicit'' =
wenzelm@30344
   132
      if strict then []
wenzelm@30344
   133
      else
wenzelm@30344
   134
        let val _ = reject_dups
ballarin@28895
   135
          "Parameter(s) declared simultaneously in expression and for clause: " (implicit' @ fixed')
ballarin@28895
   136
        in map (fn (b, mx) => (b, NONE, mx)) implicit end;
ballarin@28697
   137
ballarin@28895
   138
  in (expr', implicit'' @ fixed) end;
ballarin@28697
   139
ballarin@28795
   140
ballarin@28795
   141
(** Read instantiation **)
ballarin@28795
   142
ballarin@28872
   143
(* Parse positional or named instantiation *)
ballarin@28872
   144
ballarin@28859
   145
local
ballarin@28859
   146
haftmann@29797
   147
fun prep_inst prep_term ctxt parms (Positional insts) =
ballarin@28872
   148
      (insts ~~ parms) |> map (fn
haftmann@29797
   149
        (NONE, p) => Free (p, dummyT) |
haftmann@29797
   150
        (SOME t, _) => prep_term ctxt t)
haftmann@29797
   151
  | prep_inst prep_term ctxt parms (Named insts) =
ballarin@28872
   152
      parms |> map (fn p => case AList.lookup (op =) insts p of
haftmann@29797
   153
        SOME t => prep_term ctxt t |
haftmann@29797
   154
        NONE => Free (p, dummyT));
ballarin@28872
   155
ballarin@28872
   156
in
ballarin@28872
   157
ballarin@28872
   158
fun parse_inst x = prep_inst Syntax.parse_term x;
ballarin@28872
   159
fun make_inst x = prep_inst (K I) x;
ballarin@28872
   160
ballarin@28872
   161
end;
ballarin@28872
   162
ballarin@28872
   163
ballarin@28872
   164
(* Instantiation morphism *)
ballarin@28872
   165
ballarin@29214
   166
fun inst_morph (parm_names, parm_types) ((prfx, strict), insts') ctxt =
ballarin@28795
   167
  let
ballarin@28795
   168
    (* parameters *)
ballarin@28795
   169
    val type_parm_names = fold Term.add_tfreesT parm_types [] |> map fst;
ballarin@28795
   170
ballarin@28795
   171
    (* type inference and contexts *)
ballarin@28795
   172
    val parm_types' = map (TypeInfer.paramify_vars o Logic.varifyT) parm_types;
ballarin@28795
   173
    val type_parms = fold Term.add_tvarsT parm_types' [] |> map (Logic.mk_type o TVar);
ballarin@28795
   174
    val arg = type_parms @ map2 TypeInfer.constrain parm_types' insts';
ballarin@28795
   175
    val res = Syntax.check_terms ctxt arg;
ballarin@28795
   176
    val ctxt' = ctxt |> fold Variable.auto_fixes res;
wenzelm@30344
   177
ballarin@28795
   178
    (* instantiation *)
ballarin@28795
   179
    val (type_parms'', res') = chop (length type_parms) res;
ballarin@28795
   180
    val insts'' = (parm_names ~~ res') |> map_filter
ballarin@28795
   181
      (fn (inst as (x, Free (y, _))) => if x = y then NONE else SOME inst |
ballarin@28795
   182
        inst => SOME inst);
ballarin@28795
   183
    val instT = Symtab.make (type_parm_names ~~ map Logic.dest_type type_parms'');
ballarin@28795
   184
    val inst = Symtab.make insts'';
ballarin@28795
   185
  in
ballarin@28795
   186
    (Element.inst_morphism (ProofContext.theory_of ctxt) (instT, inst) $>
wenzelm@30335
   187
      Morphism.binding_morphism (Binding.prefix strict prfx), ctxt')
ballarin@28795
   188
  end;
ballarin@28859
   189
ballarin@28795
   190
ballarin@28795
   191
(*** Locale processing ***)
ballarin@28795
   192
ballarin@28852
   193
(** Parsing **)
ballarin@28852
   194
wenzelm@29604
   195
fun parse_elem prep_typ prep_term ctxt =
wenzelm@29604
   196
  Element.map_ctxt
wenzelm@29604
   197
   {binding = I,
wenzelm@29604
   198
    typ = prep_typ ctxt,
wenzelm@29604
   199
    term = prep_term (ProofContext.set_mode ProofContext.mode_schematic ctxt),
wenzelm@29604
   200
    pattern = prep_term (ProofContext.set_mode ProofContext.mode_pattern ctxt),
wenzelm@29604
   201
    fact = I,
wenzelm@29604
   202
    attrib = I};
ballarin@28852
   203
ballarin@28852
   204
fun parse_concl prep_term ctxt concl =
ballarin@28852
   205
  (map o map) (fn (t, ps) =>
ballarin@29215
   206
    (prep_term (ProofContext.set_mode ProofContext.mode_schematic ctxt) t, (* FIXME ?? *)
ballarin@29215
   207
      map (prep_term (ProofContext.set_mode ProofContext.mode_pattern ctxt)) ps)) concl;
ballarin@28852
   208
ballarin@28852
   209
ballarin@28885
   210
(** Simultaneous type inference: instantiations + elements + conclusion **)
ballarin@28885
   211
ballarin@28885
   212
local
ballarin@28885
   213
ballarin@28885
   214
fun mk_type T = (Logic.mk_type T, []);
ballarin@28885
   215
fun mk_term t = (t, []);
ballarin@28885
   216
fun mk_propp (p, pats) = (Syntax.type_constraint propT p, pats);
ballarin@28852
   217
ballarin@28885
   218
fun dest_type (T, []) = Logic.dest_type T;
ballarin@28885
   219
fun dest_term (t, []) = t;
ballarin@28885
   220
fun dest_propp (p, pats) = (p, pats);
ballarin@28885
   221
ballarin@28885
   222
fun extract_inst (_, (_, ts)) = map mk_term ts;
ballarin@28885
   223
fun restore_inst ((l, (p, _)), cs) = (l, (p, map dest_term cs));
ballarin@28885
   224
ballarin@28885
   225
fun extract_elem (Fixes fixes) = map (#2 #> the_list #> map mk_type) fixes
ballarin@28885
   226
  | extract_elem (Constrains csts) = map (#2 #> single #> map mk_type) csts
ballarin@28885
   227
  | extract_elem (Assumes asms) = map (#2 #> map mk_propp) asms
ballarin@28885
   228
  | extract_elem (Defines defs) = map (fn (_, (t, ps)) => [mk_propp (t, ps)]) defs
ballarin@28852
   229
  | extract_elem (Notes _) = [];
ballarin@28795
   230
ballarin@28885
   231
fun restore_elem (Fixes fixes, css) =
ballarin@28885
   232
      (fixes ~~ css) |> map (fn ((x, _, mx), cs) =>
ballarin@28885
   233
        (x, cs |> map dest_type |> try hd, mx)) |> Fixes
ballarin@28885
   234
  | restore_elem (Constrains csts, css) =
ballarin@28885
   235
      (csts ~~ css) |> map (fn ((x, _), cs) =>
ballarin@28885
   236
        (x, cs |> map dest_type |> hd)) |> Constrains
ballarin@28885
   237
  | restore_elem (Assumes asms, css) =
ballarin@28885
   238
      (asms ~~ css) |> map (fn ((b, _), cs) => (b, map dest_propp cs)) |> Assumes
ballarin@28885
   239
  | restore_elem (Defines defs, css) =
ballarin@28885
   240
      (defs ~~ css) |> map (fn ((b, _), [c]) => (b, dest_propp c)) |> Defines
ballarin@28852
   241
  | restore_elem (Notes notes, _) = Notes notes;
ballarin@28852
   242
ballarin@28885
   243
fun check cs context =
ballarin@28885
   244
  let
ballarin@28885
   245
    fun prep (_, pats) (ctxt, t :: ts) =
ballarin@28885
   246
      let val ctxt' = Variable.auto_fixes t ctxt
ballarin@28885
   247
      in
ballarin@28885
   248
        ((t, Syntax.check_props (ProofContext.set_mode ProofContext.mode_pattern ctxt') pats),
ballarin@28885
   249
          (ctxt', ts))
ballarin@28885
   250
      end
ballarin@28885
   251
    val (cs', (context', _)) = fold_map prep cs
ballarin@28885
   252
      (context, Syntax.check_terms
ballarin@28885
   253
        (ProofContext.set_mode ProofContext.mode_schematic context) (map fst cs));
ballarin@28885
   254
  in (cs', context') end;
ballarin@28885
   255
ballarin@28885
   256
in
ballarin@28885
   257
ballarin@28872
   258
fun check_autofix insts elems concl ctxt =
ballarin@28852
   259
  let
ballarin@28885
   260
    val inst_cs = map extract_inst insts;
ballarin@28885
   261
    val elem_css = map extract_elem elems;
ballarin@28885
   262
    val concl_cs = (map o map) mk_propp concl;
ballarin@28885
   263
    (* Type inference *)
ballarin@28885
   264
    val (inst_cs' :: css', ctxt') =
ballarin@28885
   265
      (fold_burrow o fold_burrow) check (inst_cs :: elem_css @ [concl_cs]) ctxt;
ballarin@28936
   266
    val (elem_css', [concl_cs']) = chop (length elem_css) css';
ballarin@28885
   267
  in
ballarin@28936
   268
    (map restore_inst (insts ~~ inst_cs'), map restore_elem (elems ~~ elem_css'),
ballarin@28936
   269
      concl_cs', ctxt')
ballarin@28885
   270
  end;
ballarin@28885
   271
ballarin@28885
   272
end;
ballarin@28852
   273
ballarin@28852
   274
ballarin@28852
   275
(** Prepare locale elements **)
ballarin@28795
   276
ballarin@28795
   277
fun declare_elem prep_vars (Fixes fixes) ctxt =
ballarin@28795
   278
      let val (vars, _) = prep_vars fixes ctxt
ballarin@28852
   279
      in ctxt |> ProofContext.add_fixes_i vars |> snd end
ballarin@28795
   280
  | declare_elem prep_vars (Constrains csts) ctxt =
haftmann@28965
   281
      ctxt |> prep_vars (map (fn (x, T) => (Binding.name x, SOME T, NoSyn)) csts) |> snd
ballarin@28872
   282
  | declare_elem _ (Assumes _) ctxt = ctxt
ballarin@28872
   283
  | declare_elem _ (Defines _) ctxt = ctxt
ballarin@28852
   284
  | declare_elem _ (Notes _) ctxt = ctxt;
ballarin@28795
   285
ballarin@29221
   286
(** Finish locale elements **)
ballarin@28795
   287
ballarin@28852
   288
fun closeup _ _ false elem = elem
ballarin@28852
   289
  | closeup ctxt parms true elem =
ballarin@28795
   290
      let
ballarin@28795
   291
        fun close_frees t =
ballarin@28795
   292
          let
ballarin@28795
   293
            val rev_frees =
ballarin@28795
   294
              Term.fold_aterms (fn Free (x, T) =>
ballarin@28852
   295
                if AList.defined (op =) parms x then I else insert (op =) (x, T) | _ => I) t [];
ballarin@29021
   296
          in Term.list_all_free (rev rev_frees, t) end; (* FIXME use fold Logic.all *)
ballarin@29019
   297
  (* FIXME consider closing in syntactic phase *)
ballarin@28795
   298
ballarin@28795
   299
        fun no_binds [] = []
ballarin@28852
   300
          | no_binds _ = error "Illegal term bindings in context element";
ballarin@28795
   301
      in
ballarin@28795
   302
        (case elem of
ballarin@28795
   303
          Assumes asms => Assumes (asms |> map (fn (a, propps) =>
ballarin@28795
   304
            (a, map (fn (t, ps) => (close_frees t, no_binds ps)) propps)))
ballarin@29022
   305
        | Defines defs => Defines (defs |> map (fn ((name, atts), (t, ps)) =>
ballarin@29022
   306
            let val ((c, _), t') = LocalDefs.cert_def ctxt (close_frees t)
wenzelm@30434
   307
            in ((Thm.def_binding_optional (Binding.name c) name, atts), (t', no_binds ps)) end))
ballarin@28795
   308
        | e => e)
ballarin@28795
   309
      end;
ballarin@28795
   310
ballarin@28872
   311
fun finish_primitive parms _ (Fixes fixes) = Fixes (map (fn (binding, _, mx) =>
wenzelm@30223
   312
      let val x = Binding.name_of binding
ballarin@28795
   313
      in (binding, AList.lookup (op =) parms x, mx) end) fixes)
ballarin@28872
   314
  | finish_primitive _ _ (Constrains _) = Constrains []
ballarin@28872
   315
  | finish_primitive _ close (Assumes asms) = close (Assumes asms)
ballarin@28872
   316
  | finish_primitive _ close (Defines defs) = close (Defines defs)
ballarin@28872
   317
  | finish_primitive _ _ (Notes facts) = Notes facts;
ballarin@28872
   318
ballarin@29221
   319
fun finish_inst ctxt parms do_close (loc, (prfx, inst)) =
ballarin@28872
   320
  let
ballarin@28872
   321
    val thy = ProofContext.theory_of ctxt;
haftmann@29360
   322
    val (parm_names, parm_types) = Locale.params_of thy loc |>
wenzelm@30223
   323
      map_split (fn (b, SOME T, _) => (Binding.name_of b, T));
ballarin@28872
   324
    val (morph, _) = inst_morph (parm_names, parm_types) (prfx, inst) ctxt;
ballarin@29221
   325
  in (loc, morph) end;
ballarin@28795
   326
ballarin@29221
   327
fun finish_elem ctxt parms do_close elem =
ballarin@28795
   328
  let
ballarin@28872
   329
    val elem' = finish_primitive parms (closeup ctxt parms do_close) elem;
ballarin@29221
   330
  in elem' end
wenzelm@30344
   331
ballarin@29221
   332
fun finish ctxt parms do_close insts elems =
ballarin@28872
   333
  let
ballarin@29221
   334
    val deps = map (finish_inst ctxt parms do_close) insts;
ballarin@29221
   335
    val elems' = map (finish_elem ctxt parms do_close) elems;
ballarin@29221
   336
  in (deps, elems') end;
ballarin@28795
   337
ballarin@28795
   338
ballarin@28895
   339
(** Process full context statement: instantiations + elements + conclusion **)
ballarin@28895
   340
ballarin@28895
   341
(* Interleave incremental parsing and type inference over entire parsed stretch. *)
ballarin@28895
   342
ballarin@28795
   343
local
ballarin@28795
   344
haftmann@29797
   345
fun prep_full_context_statement parse_typ parse_prop prep_vars_elem prep_inst prep_vars_inst prep_expr
haftmann@29702
   346
    strict do_close raw_import init_body raw_elems raw_concl ctxt1 =
ballarin@28795
   347
  let
haftmann@29358
   348
    val thy = ProofContext.theory_of ctxt1;
ballarin@28872
   349
ballarin@28895
   350
    val (raw_insts, fixed) = parameters_of thy strict (apfst (prep_expr thy) raw_import);
ballarin@28895
   351
haftmann@29797
   352
    fun prep_insts (loc, (prfx, inst)) (i, insts, ctxt) =
ballarin@28872
   353
      let
haftmann@29360
   354
        val (parm_names, parm_types) = Locale.params_of thy loc |>
wenzelm@30585
   355
          map_split (fn (b, SOME T, _) => (Name.of_binding b, T))
haftmann@29510
   356
            (*FIXME return value of Locale.params_of has strange type*)
haftmann@29797
   357
        val inst' = prep_inst ctxt parm_names inst;
ballarin@28885
   358
        val parm_types' = map (TypeInfer.paramify_vars o
ballarin@28885
   359
          Term.map_type_tvar (fn ((x, _), S) => TVar ((x, i), S)) o Logic.varifyT) parm_types;
ballarin@28872
   360
        val inst'' = map2 TypeInfer.constrain parm_types' inst';
ballarin@28872
   361
        val insts' = insts @ [(loc, (prfx, inst''))];
ballarin@28951
   362
        val (insts'', _, _, ctxt' (* FIXME not used *) ) = check_autofix insts' [] [] ctxt;
ballarin@28872
   363
        val inst''' = insts'' |> List.last |> snd |> snd;
ballarin@28872
   364
        val (morph, _) = inst_morph (parm_names, parm_types) (prfx, inst''') ctxt;
haftmann@29360
   365
        val ctxt'' = Locale.activate_declarations thy (loc, morph) ctxt;
ballarin@28951
   366
      in (i+1, insts', ctxt'') end;
wenzelm@30344
   367
haftmann@29501
   368
    fun prep_elem insts raw_elem (elems, ctxt) =
ballarin@28852
   369
      let
haftmann@29501
   370
        val ctxt' = declare_elem prep_vars_elem raw_elem ctxt;
ballarin@28852
   371
        val elems' = elems @ [parse_elem parse_typ parse_prop ctxt' raw_elem];
ballarin@28872
   372
        val (_, _, _, ctxt'') = check_autofix insts elems' [] ctxt';
haftmann@29501
   373
      in (elems', ctxt') end;
ballarin@28795
   374
ballarin@28872
   375
    fun prep_concl raw_concl (insts, elems, ctxt) =
ballarin@28795
   376
      let
ballarin@29215
   377
        val concl = parse_concl parse_prop ctxt raw_concl;
ballarin@28872
   378
      in check_autofix insts elems concl ctxt end;
ballarin@28795
   379
haftmann@29501
   380
    val fors = prep_vars_inst fixed ctxt1 |> fst;
haftmann@29358
   381
    val ctxt2 = ctxt1 |> ProofContext.add_fixes_i fors |> snd;
haftmann@29797
   382
    val (_, insts', ctxt3) = fold prep_insts raw_insts (0, [], ctxt2);
haftmann@29702
   383
    val ctxt4 = init_body ctxt3;
haftmann@29702
   384
    val (elems, ctxt5) = fold (prep_elem insts') raw_elems ([], ctxt4);
haftmann@29702
   385
    val (insts, elems', concl, ctxt6) =
haftmann@29702
   386
      prep_concl raw_concl (insts', elems, ctxt5);
ballarin@28795
   387
ballarin@28872
   388
    (* Retrieve parameter types *)
wenzelm@30585
   389
    val xs = fold (fn Fixes fixes => (fn ps => ps @ map (Name.of_binding o #1) fixes)
haftmann@29501
   390
      | _ => fn ps => ps) (Fixes fors :: elems') [];
wenzelm@30344
   391
    val (Ts, ctxt7) = fold_map ProofContext.inferred_param xs ctxt6;
ballarin@28895
   392
    val parms = xs ~~ Ts;  (* params from expression and elements *)
ballarin@28795
   393
ballarin@28872
   394
    val Fixes fors' = finish_primitive parms I (Fixes fors);
haftmann@29501
   395
    val (deps, elems'') = finish ctxt6 parms do_close insts elems';
ballarin@28852
   396
haftmann@29702
   397
  in ((fors', deps, elems'', concl), (parms, ctxt7)) end
ballarin@28795
   398
ballarin@28795
   399
in
ballarin@28795
   400
haftmann@29501
   401
fun cert_full_context_statement x =
haftmann@29501
   402
  prep_full_context_statement (K I) (K I) ProofContext.cert_vars
haftmann@29501
   403
  make_inst ProofContext.cert_vars (K I) x;
haftmann@29501
   404
fun cert_read_full_context_statement x =
haftmann@29501
   405
  prep_full_context_statement Syntax.parse_typ Syntax.parse_prop ProofContext.read_vars
haftmann@29501
   406
  make_inst ProofContext.cert_vars (K I) x;
ballarin@28895
   407
fun read_full_context_statement x =
haftmann@29501
   408
  prep_full_context_statement Syntax.parse_typ Syntax.parse_prop ProofContext.read_vars
haftmann@29501
   409
  parse_inst ProofContext.read_vars intern x;
ballarin@28795
   410
ballarin@28795
   411
end;
ballarin@28795
   412
ballarin@28795
   413
ballarin@28898
   414
(* Context statement: elements + conclusion *)
ballarin@28795
   415
ballarin@28795
   416
local
ballarin@28795
   417
ballarin@28898
   418
fun prep_statement prep activate raw_elems raw_concl context =
ballarin@28898
   419
  let
haftmann@29358
   420
     val ((_, _, elems, concl), _) =
haftmann@29702
   421
       prep true false ([], []) I raw_elems raw_concl context;
haftmann@29501
   422
     val (_, context') = context |>
haftmann@29501
   423
       ProofContext.set_stmt true |>
haftmann@29501
   424
       activate elems;
ballarin@28898
   425
  in (concl, context') end;
ballarin@28898
   426
ballarin@28898
   427
in
ballarin@28898
   428
haftmann@29501
   429
fun cert_statement x = prep_statement cert_full_context_statement Element.activate_i x;
ballarin@28898
   430
fun read_statement x = prep_statement read_full_context_statement Element.activate x;
ballarin@28898
   431
ballarin@28898
   432
end;
ballarin@28898
   433
ballarin@28898
   434
ballarin@28898
   435
(* Locale declaration: import + elements *)
ballarin@28898
   436
ballarin@28898
   437
local
ballarin@28898
   438
haftmann@29702
   439
fun prep_declaration prep activate raw_import init_body raw_elems context =
ballarin@28795
   440
  let
haftmann@29358
   441
    val ((fixed, deps, elems, _), (parms, ctxt')) =
haftmann@29702
   442
      prep false true raw_import init_body raw_elems [] context ;
ballarin@28898
   443
    (* Declare parameters and imported facts *)
ballarin@28898
   444
    val context' = context |>
ballarin@28898
   445
      ProofContext.add_fixes_i fixed |> snd |>
haftmann@29360
   446
      fold Locale.activate_local_facts deps;
haftmann@29501
   447
    val (elems', _) = context' |>
haftmann@29501
   448
      ProofContext.set_stmt true |>
haftmann@29501
   449
      activate elems;
ballarin@29221
   450
  in ((fixed, deps, elems'), (parms, ctxt')) end;
ballarin@28795
   451
ballarin@28795
   452
in
ballarin@28795
   453
haftmann@29501
   454
fun cert_declaration x = prep_declaration cert_full_context_statement Element.activate_i x;
haftmann@29501
   455
fun cert_read_declaration x = prep_declaration cert_read_full_context_statement Element.activate x;
ballarin@28898
   456
fun read_declaration x = prep_declaration read_full_context_statement Element.activate x;
ballarin@28898
   457
ballarin@28898
   458
end;
ballarin@28898
   459
ballarin@28898
   460
ballarin@28898
   461
(* Locale expression to set up a goal *)
ballarin@28898
   462
ballarin@28898
   463
local
ballarin@28898
   464
ballarin@28898
   465
fun props_of thy (name, morph) =
ballarin@28898
   466
  let
haftmann@29360
   467
    val (asm, defs) = Locale.specification_of thy name;
ballarin@28898
   468
  in
ballarin@28898
   469
    (case asm of NONE => defs | SOME asm => asm :: defs) |> map (Morphism.term morph)
ballarin@28898
   470
  end;
ballarin@28898
   471
ballarin@28898
   472
fun prep_goal_expression prep expression context =
ballarin@28898
   473
  let
ballarin@28898
   474
    val thy = ProofContext.theory_of context;
ballarin@28879
   475
haftmann@29358
   476
    val ((fixed, deps, _, _), _) =
haftmann@29702
   477
      prep true true expression I [] [] context;
ballarin@28898
   478
    (* proof obligations *)
ballarin@28898
   479
    val propss = map (props_of thy) deps;
ballarin@28898
   480
ballarin@28898
   481
    val goal_ctxt = context |>
ballarin@28898
   482
      ProofContext.add_fixes_i fixed |> snd |>
ballarin@28898
   483
      (fold o fold) Variable.auto_fixes propss;
ballarin@28898
   484
ballarin@28898
   485
    val export = Variable.export_morphism goal_ctxt context;
ballarin@28898
   486
    val exp_fact = Drule.zero_var_indexes_list o map Thm.strip_shyps o Morphism.fact export;
ballarin@29245
   487
    val exp_term = TermSubst.zero_var_indexes o Morphism.term export;
ballarin@28898
   488
    val exp_typ = Logic.type_map exp_term;
wenzelm@29604
   489
    val export' = Morphism.morphism {binding = I, typ = exp_typ, term = exp_term, fact = exp_fact};
ballarin@28898
   490
  in ((propss, deps, export'), goal_ctxt) end;
wenzelm@30344
   491
ballarin@28898
   492
in
ballarin@28898
   493
haftmann@29501
   494
fun cert_goal_expression x = prep_goal_expression cert_full_context_statement x;
ballarin@28898
   495
fun read_goal_expression x = prep_goal_expression read_full_context_statement x;
ballarin@28879
   496
ballarin@28795
   497
end;
ballarin@28795
   498
ballarin@28795
   499
ballarin@28795
   500
(*** Locale declarations ***)
ballarin@28795
   501
ballarin@29221
   502
(* extract specification text *)
ballarin@29221
   503
ballarin@29221
   504
val norm_term = Envir.beta_norm oo Term.subst_atomic;
ballarin@29221
   505
ballarin@29221
   506
fun bind_def ctxt eq (xs, env, eqs) =
ballarin@29221
   507
  let
ballarin@29221
   508
    val _ = LocalDefs.cert_def ctxt eq;
ballarin@29221
   509
    val ((y, T), b) = LocalDefs.abs_def eq;
ballarin@29221
   510
    val b' = norm_term env b;
ballarin@29221
   511
    fun err msg = error (msg ^ ": " ^ quote y);
ballarin@29221
   512
  in
ballarin@29250
   513
    case filter (fn (Free (y', _), _) => y = y' | _ => false) env of
ballarin@29250
   514
      [] => (Term.add_frees b' xs, (Free (y, T), b') :: env, eq :: eqs) |
ballarin@29250
   515
      dups => if forall (fn (_, b'') => b' aconv b'') dups
ballarin@29250
   516
        then (xs, env, eqs)
ballarin@29250
   517
        else err "Attempt to redefine variable"
ballarin@29221
   518
  end;
ballarin@29221
   519
ballarin@29221
   520
(* text has the following structure:
ballarin@29221
   521
       (((exts, exts'), (ints, ints')), (xs, env, defs))
ballarin@29221
   522
   where
ballarin@29221
   523
     exts: external assumptions (terms in assumes elements)
ballarin@29221
   524
     exts': dito, normalised wrt. env
ballarin@29221
   525
     ints: internal assumptions (terms in assumptions from insts)
ballarin@29221
   526
     ints': dito, normalised wrt. env
ballarin@29221
   527
     xs: the free variables in exts' and ints' and rhss of definitions,
ballarin@29221
   528
       this includes parameters except defined parameters
ballarin@29221
   529
     env: list of term pairs encoding substitutions, where the first term
ballarin@29221
   530
       is a free variable; substitutions represent defines elements and
ballarin@29221
   531
       the rhs is normalised wrt. the previous env
ballarin@29221
   532
     defs: the equations from the defines elements
ballarin@29221
   533
   *)
ballarin@29221
   534
ballarin@29221
   535
fun eval_text _ _ (Fixes _) text = text
ballarin@29221
   536
  | eval_text _ _ (Constrains _) text = text
ballarin@29221
   537
  | eval_text _ is_ext (Assumes asms)
ballarin@29221
   538
        (((exts, exts'), (ints, ints')), (xs, env, defs)) =
ballarin@29221
   539
      let
ballarin@29221
   540
        val ts = maps (map #1 o #2) asms;
ballarin@29221
   541
        val ts' = map (norm_term env) ts;
ballarin@29221
   542
        val spec' =
ballarin@29221
   543
          if is_ext then ((exts @ ts, exts' @ ts'), (ints, ints'))
ballarin@29221
   544
          else ((exts, exts'), (ints @ ts, ints' @ ts'));
ballarin@29221
   545
      in (spec', (fold Term.add_frees ts' xs, env, defs)) end
ballarin@29221
   546
  | eval_text ctxt _ (Defines defs) (spec, binds) =
ballarin@29221
   547
      (spec, fold (bind_def ctxt o #1 o #2) defs binds)
ballarin@29221
   548
  | eval_text _ _ (Notes _) text = text;
ballarin@29221
   549
ballarin@29221
   550
fun eval_inst ctxt (loc, morph) text =
ballarin@29221
   551
  let
ballarin@29221
   552
    val thy = ProofContext.theory_of ctxt;
haftmann@29360
   553
    val (asm, defs) = Locale.specification_of thy loc;
ballarin@29221
   554
    val asm' = Option.map (Morphism.term morph) asm;
ballarin@29221
   555
    val defs' = map (Morphism.term morph) defs;
ballarin@29221
   556
    val text' = text |>
ballarin@29221
   557
      (if is_some asm
ballarin@29221
   558
        then eval_text ctxt false (Assumes [(Attrib.empty_binding, [(the asm', [])])])
ballarin@29221
   559
        else I) |>
ballarin@29221
   560
      (if not (null defs)
ballarin@29221
   561
        then eval_text ctxt false (Defines (map (fn def => (Attrib.empty_binding, (def, []))) defs'))
ballarin@29221
   562
        else I)
haftmann@29360
   563
(* FIXME clone from locale.ML *)
ballarin@29221
   564
  in text' end;
ballarin@29221
   565
ballarin@29221
   566
fun eval_elem ctxt elem text =
ballarin@29221
   567
  let
ballarin@29221
   568
    val text' = eval_text ctxt true elem text;
ballarin@29221
   569
  in text' end;
ballarin@29221
   570
ballarin@29221
   571
fun eval ctxt deps elems =
ballarin@29221
   572
  let
ballarin@29221
   573
    val text' = fold (eval_inst ctxt) deps ((([], []), ([], [])), ([], [], []));
ballarin@29221
   574
    val ((spec, (_, _, defs))) = fold (eval_elem ctxt) elems text';
ballarin@29221
   575
  in (spec, defs) end;
ballarin@29221
   576
ballarin@28903
   577
(* axiomsN: name of theorem set with destruct rules for locale predicates,
ballarin@28903
   578
     also name suffix of delta predicates and assumptions. *)
ballarin@28903
   579
ballarin@28903
   580
val axiomsN = "axioms";
ballarin@28903
   581
ballarin@28795
   582
local
ballarin@28795
   583
ballarin@28795
   584
(* introN: name of theorems for introduction rules of locale and
ballarin@28903
   585
     delta predicates *)
ballarin@28795
   586
ballarin@28795
   587
val introN = "intro";
ballarin@28795
   588
ballarin@28795
   589
fun atomize_spec thy ts =
ballarin@28795
   590
  let
ballarin@28795
   591
    val t = Logic.mk_conjunction_balanced ts;
ballarin@28795
   592
    val body = ObjectLogic.atomize_term thy t;
ballarin@28795
   593
    val bodyT = Term.fastype_of body;
ballarin@28795
   594
  in
ballarin@28795
   595
    if bodyT = propT then (t, propT, Thm.reflexive (Thm.cterm_of thy t))
ballarin@28795
   596
    else (body, bodyT, ObjectLogic.atomize (Thm.cterm_of thy t))
ballarin@28795
   597
  end;
ballarin@28795
   598
ballarin@28795
   599
(* achieve plain syntax for locale predicates (without "PROP") *)
ballarin@28795
   600
ballarin@28795
   601
fun aprop_tr' n c = (Syntax.constN ^ c, fn ctxt => fn args =>
ballarin@28795
   602
  if length args = n then
ballarin@28795
   603
    Syntax.const "_aprop" $
ballarin@28795
   604
      Term.list_comb (Syntax.free (Consts.extern (ProofContext.consts_of ctxt) c), args)
ballarin@28795
   605
  else raise Match);
ballarin@28795
   606
ballarin@28898
   607
(* define one predicate including its intro rule and axioms
ballarin@28795
   608
   - bname: predicate name
ballarin@28795
   609
   - parms: locale parameters
ballarin@28795
   610
   - defs: thms representing substitutions from defines elements
ballarin@28795
   611
   - ts: terms representing locale assumptions (not normalised wrt. defs)
ballarin@28795
   612
   - norm_ts: terms representing locale assumptions (normalised wrt. defs)
ballarin@28795
   613
   - thy: the theory
ballarin@28795
   614
*)
ballarin@28795
   615
ballarin@28795
   616
fun def_pred bname parms defs ts norm_ts thy =
ballarin@28795
   617
  let
wenzelm@30344
   618
    val name = Sign.full_name thy bname;
ballarin@28795
   619
ballarin@28795
   620
    val (body, bodyT, body_eq) = atomize_spec thy norm_ts;
wenzelm@29272
   621
    val env = Term.add_free_names body [];
ballarin@28795
   622
    val xs = filter (member (op =) env o #1) parms;
ballarin@28795
   623
    val Ts = map #2 xs;
wenzelm@29272
   624
    val extraTs =
wenzelm@29272
   625
      (Term.add_tfrees body [] \\ fold Term.add_tfreesT Ts [])
ballarin@28795
   626
      |> Library.sort_wrt #1 |> map TFree;
ballarin@28795
   627
    val predT = map Term.itselfT extraTs ---> Ts ---> bodyT;
ballarin@28795
   628
ballarin@28795
   629
    val args = map Logic.mk_type extraTs @ map Free xs;
ballarin@28795
   630
    val head = Term.list_comb (Const (name, predT), args);
ballarin@28795
   631
    val statement = ObjectLogic.ensure_propT thy head;
ballarin@28795
   632
ballarin@28795
   633
    val ([pred_def], defs_thy) =
ballarin@28795
   634
      thy
ballarin@28795
   635
      |> bodyT = propT ? Sign.add_advanced_trfuns ([], [], [aprop_tr' (length args) name], [])
wenzelm@30344
   636
      |> Sign.declare_const [] ((bname, predT), NoSyn) |> snd
ballarin@28795
   637
      |> PureThy.add_defs false
wenzelm@30344
   638
        [((Binding.map_name Thm.def_name bname, Logic.mk_equals (head, body)), [Thm.kind_internal])];
ballarin@28795
   639
    val defs_ctxt = ProofContext.init defs_thy |> Variable.declare_term head;
ballarin@28795
   640
ballarin@28795
   641
    val cert = Thm.cterm_of defs_thy;
ballarin@28795
   642
ballarin@28795
   643
    val intro = Goal.prove_global defs_thy [] norm_ts statement (fn _ =>
ballarin@28795
   644
      MetaSimplifier.rewrite_goals_tac [pred_def] THEN
ballarin@28795
   645
      Tactic.compose_tac (false, body_eq RS Drule.equal_elim_rule1, 1) 1 THEN
ballarin@28795
   646
      Tactic.compose_tac (false,
ballarin@28795
   647
        Conjunction.intr_balanced (map (Thm.assume o cert) norm_ts), 0) 1);
ballarin@28795
   648
ballarin@28795
   649
    val conjuncts =
ballarin@28795
   650
      (Drule.equal_elim_rule2 OF [body_eq,
ballarin@28795
   651
        MetaSimplifier.rewrite_rule [pred_def] (Thm.assume (cert statement))])
ballarin@28795
   652
      |> Conjunction.elim_balanced (length ts);
ballarin@28795
   653
    val axioms = ts ~~ conjuncts |> map (fn (t, ax) =>
ballarin@28795
   654
      Element.prove_witness defs_ctxt t
ballarin@28795
   655
       (MetaSimplifier.rewrite_goals_tac defs THEN
ballarin@28795
   656
        Tactic.compose_tac (false, ax, 0) 1));
ballarin@28795
   657
  in ((statement, intro, axioms), defs_thy) end;
ballarin@28795
   658
ballarin@28795
   659
in
ballarin@28795
   660
wenzelm@30344
   661
(* main predicate definition function *)
ballarin@28795
   662
ballarin@29221
   663
fun define_preds pname parms (((exts, exts'), (ints, ints')), defs) thy =
ballarin@28795
   664
  let
ballarin@29031
   665
    val defs' = map (cterm_of thy #> Assumption.assume #> Drule.gen_all #> Drule.abs_def) defs;
ballarin@29031
   666
ballarin@28795
   667
    val (a_pred, a_intro, a_axioms, thy'') =
ballarin@28795
   668
      if null exts then (NONE, NONE, [], thy)
ballarin@28795
   669
      else
ballarin@28795
   670
        let
wenzelm@30344
   671
          val aname = if null ints then pname else Binding.suffix_name ("_" ^ axiomsN) pname
ballarin@28795
   672
          val ((statement, intro, axioms), thy') =
ballarin@28795
   673
            thy
ballarin@29031
   674
            |> def_pred aname parms defs' exts exts';
ballarin@28795
   675
          val (_, thy'') =
ballarin@28795
   676
            thy'
wenzelm@30469
   677
            |> Sign.mandatory_path (Binding.name_of aname)
ballarin@28903
   678
            |> PureThy.note_thmss Thm.internalK
haftmann@29360
   679
              [((Binding.name introN, []), [([intro], [Locale.unfold_attrib])])]
ballarin@28795
   680
            ||> Sign.restore_naming thy';
ballarin@28795
   681
          in (SOME statement, SOME intro, axioms, thy'') end;
ballarin@28795
   682
    val (b_pred, b_intro, b_axioms, thy'''') =
ballarin@28795
   683
      if null ints then (NONE, NONE, [], thy'')
ballarin@28795
   684
      else
ballarin@28795
   685
        let
ballarin@28795
   686
          val ((statement, intro, axioms), thy''') =
ballarin@28795
   687
            thy''
ballarin@29031
   688
            |> def_pred pname parms defs' (ints @ the_list a_pred) (ints' @ the_list a_pred);
ballarin@28795
   689
          val (_, thy'''') =
ballarin@28795
   690
            thy'''
wenzelm@30469
   691
            |> Sign.mandatory_path (Binding.name_of pname)
ballarin@28795
   692
            |> PureThy.note_thmss Thm.internalK
haftmann@29360
   693
                 [((Binding.name introN, []), [([intro], [Locale.intro_attrib])]),
haftmann@28965
   694
                  ((Binding.name axiomsN, []),
ballarin@28795
   695
                    [(map (Drule.standard o Element.conclude_witness) axioms, [])])]
ballarin@28795
   696
            ||> Sign.restore_naming thy''';
ballarin@28795
   697
        in (SOME statement, SOME intro, axioms, thy'''') end;
ballarin@28795
   698
  in ((a_pred, a_intro, a_axioms), (b_pred, b_intro, b_axioms), thy'''') end;
ballarin@28795
   699
ballarin@28795
   700
end;
ballarin@28795
   701
ballarin@28795
   702
ballarin@28795
   703
local
ballarin@28795
   704
ballarin@28795
   705
fun assumes_to_notes (Assumes asms) axms =
ballarin@28795
   706
      fold_map (fn (a, spec) => fn axs =>
ballarin@28795
   707
          let val (ps, qs) = chop (length spec) axs
ballarin@28795
   708
          in ((a, [(ps, [])]), qs) end) asms axms
ballarin@28795
   709
      |> apfst (curry Notes Thm.assumptionK)
ballarin@28795
   710
  | assumes_to_notes e axms = (e, axms);
ballarin@28795
   711
ballarin@29031
   712
fun defines_to_notes thy (Defines defs) =
ballarin@29031
   713
      Notes (Thm.definitionK, map (fn (a, (def, _)) =>
ballarin@29245
   714
        (a, [([Assumption.assume (cterm_of thy def)],
haftmann@29360
   715
          [(Attrib.internal o K) Locale.witness_attrib])])) defs)
ballarin@29031
   716
  | defines_to_notes _ e = e;
ballarin@28795
   717
ballarin@28898
   718
fun gen_add_locale prep_decl
wenzelm@30189
   719
    bname raw_predicate_bname raw_import raw_body thy =
ballarin@28795
   720
  let
wenzelm@30344
   721
    val name = Sign.full_name thy bname;
haftmann@29391
   722
    val _ = Locale.defined thy name andalso
ballarin@28795
   723
      error ("Duplicate definition of locale " ^ quote name);
ballarin@28795
   724
ballarin@29221
   725
    val ((fixed, deps, body_elems), (parms, ctxt')) =
wenzelm@30189
   726
      prep_decl raw_import I raw_body (ProofContext.init thy);
ballarin@29221
   727
    val text as (((_, exts'), _), defs) = eval ctxt' deps body_elems;
ballarin@29221
   728
wenzelm@30344
   729
    val predicate_bname =
wenzelm@30344
   730
      if Binding.is_empty raw_predicate_bname then bname
haftmann@29391
   731
      else raw_predicate_bname;
ballarin@28872
   732
    val ((a_statement, a_intro, a_axioms), (b_statement, b_intro, b_axioms), thy') =
haftmann@29391
   733
      define_preds predicate_bname parms text thy;
ballarin@28795
   734
ballarin@28795
   735
    val extraTs = fold Term.add_tfrees exts' [] \\ fold Term.add_tfreesT (map snd parms) [];
wenzelm@30344
   736
    val _ =
wenzelm@30344
   737
      if null extraTs then ()
wenzelm@30344
   738
      else warning ("Additional type variable(s) in locale specification " ^ quote (Binding.str_of bname));
ballarin@28795
   739
ballarin@29035
   740
    val a_satisfy = Element.satisfy_morphism a_axioms;
ballarin@29035
   741
    val b_satisfy = Element.satisfy_morphism b_axioms;
ballarin@28903
   742
ballarin@28895
   743
    val params = fixed @
ballarin@28872
   744
      (body_elems |> map_filter (fn Fixes fixes => SOME fixes | _ => NONE) |> flat);
ballarin@28903
   745
    val asm = if is_some b_statement then b_statement else a_statement;
ballarin@29028
   746
ballarin@29028
   747
    val notes =
ballarin@29028
   748
        if is_some asm
wenzelm@30344
   749
        then [(Thm.internalK, [((Binding.suffix_name ("_" ^ axiomsN) bname, []),
ballarin@29028
   750
          [([Assumption.assume (cterm_of thy' (the asm))],
haftmann@29360
   751
            [(Attrib.internal o K) Locale.witness_attrib])])])]
ballarin@29028
   752
        else [];
ballarin@28795
   753
ballarin@29035
   754
    val notes' = body_elems |>
ballarin@29035
   755
      map (defines_to_notes thy') |>
ballarin@29035
   756
      map (Element.morph_ctxt a_satisfy) |>
ballarin@29035
   757
      (fn elems => fold_map assumes_to_notes elems (map Element.conclude_witness a_axioms)) |>
ballarin@29035
   758
      fst |>
ballarin@29035
   759
      map (Element.morph_ctxt b_satisfy) |>
ballarin@29035
   760
      map_filter (fn Notes notes => SOME notes | _ => NONE);
ballarin@29035
   761
ballarin@29035
   762
    val deps' = map (fn (l, morph) => (l, morph $> b_satisfy)) deps;
haftmann@29441
   763
    val axioms = map Element.conclude_witness b_axioms;
ballarin@28872
   764
haftmann@29358
   765
    val loc_ctxt = thy'
haftmann@29360
   766
      |> Locale.register_locale bname (extraTs, params)
wenzelm@30344
   767
          (asm, rev defs) (a_intro, b_intro) axioms ([], [])
haftmann@29358
   768
          (map (fn n => (n, stamp ())) notes |> rev) (map (fn d => (d, stamp ())) deps' |> rev)
haftmann@29358
   769
      |> TheoryTarget.init (SOME name)
haftmann@29358
   770
      |> fold (fn (kind, facts) => LocalTheory.notes kind facts #> snd) notes';
ballarin@29028
   771
haftmann@29358
   772
  in (name, loc_ctxt) end;
ballarin@28795
   773
ballarin@28795
   774
in
ballarin@28795
   775
haftmann@29501
   776
val add_locale = gen_add_locale cert_declaration;
ballarin@28902
   777
val add_locale_cmd = gen_add_locale read_declaration;
ballarin@28795
   778
ballarin@28795
   779
end;
ballarin@28795
   780
ballarin@28895
   781
ballarin@28895
   782
(*** Interpretation ***)
ballarin@28895
   783
ballarin@28895
   784
(** Interpretation between locales: declaring sublocale relationships **)
ballarin@28895
   785
ballarin@28895
   786
local
ballarin@28895
   787
haftmann@29578
   788
fun gen_sublocale prep_expr intern raw_target expression thy =
ballarin@28895
   789
  let
ballarin@28902
   790
    val target = intern thy raw_target;
haftmann@29360
   791
    val target_ctxt = Locale.init target thy;
ballarin@28895
   792
ballarin@28903
   793
    val ((propss, deps, export), goal_ctxt) = prep_expr expression target_ctxt;
wenzelm@30344
   794
haftmann@29578
   795
    fun after_qed witss = ProofContext.theory (
haftmann@29578
   796
      fold2 (fn (name, morph) => fn wits => Locale.add_dependency target
haftmann@29578
   797
        (name, morph $> Element.satisfy_morphism wits $> export)) deps witss #>
haftmann@29578
   798
      (fn thy => fold_rev Locale.activate_global_facts
haftmann@29391
   799
          (Locale.get_registrations thy) thy));
haftmann@29578
   800
  in Element.witness_proof after_qed propss goal_ctxt end;
ballarin@28895
   801
ballarin@28895
   802
in
ballarin@28895
   803
haftmann@29501
   804
fun sublocale x = gen_sublocale cert_goal_expression (K I) x;
haftmann@29360
   805
fun sublocale_cmd x = gen_sublocale read_goal_expression Locale.intern x;
ballarin@28895
   806
ballarin@28795
   807
end;
ballarin@28895
   808
ballarin@29018
   809
ballarin@28993
   810
(** Interpretation in theories **)
ballarin@28993
   811
ballarin@28993
   812
local
ballarin@28993
   813
ballarin@29211
   814
fun gen_interpretation prep_expr parse_prop prep_attr
haftmann@29496
   815
    expression equations theory =
ballarin@28993
   816
  let
haftmann@29496
   817
    val ((propss, regs, export), expr_ctxt) = ProofContext.init theory
haftmann@29496
   818
      |> prep_expr expression;
haftmann@29441
   819
ballarin@29211
   820
    val eqns = map (parse_prop expr_ctxt o snd) equations |> Syntax.check_terms expr_ctxt;
haftmann@29496
   821
    val eq_attns = map ((apsnd o map) (prep_attr theory) o fst) equations;
ballarin@29211
   822
    val goal_ctxt = fold Variable.auto_fixes eqns expr_ctxt;
ballarin@29211
   823
    val export' = Variable.export_morphism goal_ctxt expr_ctxt;
ballarin@29210
   824
haftmann@29578
   825
    fun store_reg ((name, morph), wits) thy =
haftmann@29441
   826
      let
haftmann@29578
   827
        val wits' = map (Element.morph_witness export') wits;
haftmann@29578
   828
        val morph' = morph $> Element.satisfy_morphism wits';
haftmann@29441
   829
      in
haftmann@29441
   830
        thy
haftmann@29441
   831
        |> Locale.add_registration (name, (morph', export))
haftmann@29441
   832
        |> pair (name, morph')
haftmann@29441
   833
      end;
haftmann@29441
   834
haftmann@29441
   835
    fun store_eqns_activate regs [] thy =
haftmann@29441
   836
          thy
haftmann@29441
   837
          |> fold (fn (name, morph) =>
haftmann@29441
   838
               Locale.activate_global_facts (name, morph $> export)) regs
haftmann@29578
   839
      | store_eqns_activate regs eqs thy =
haftmann@29441
   840
          let
haftmann@29578
   841
            val eqs' = eqs |> map (Morphism.thm (export' $> export) #>
haftmann@29441
   842
              LocalDefs.meta_rewrite_rule (ProofContext.init thy) #>
haftmann@29441
   843
              Drule.abs_def);
haftmann@29578
   844
            val eq_morph = Element.eq_morphism thy eqs';
haftmann@29441
   845
            val eq_attns' = map ((apsnd o map) (Attrib.attribute_i thy)) eq_attns;
haftmann@29441
   846
          in
haftmann@29441
   847
            thy
haftmann@29441
   848
            |> fold (fn (name, morph) =>
haftmann@29441
   849
                Locale.amend_registration eq_morph (name, morph) #>
haftmann@29441
   850
                Locale.activate_global_facts (name, morph $> eq_morph $> export)) regs
haftmann@29578
   851
            |> PureThy.note_thmss Thm.lemmaK (eq_attns' ~~ map (fn eq => [([eq], [])]) eqs')
haftmann@29441
   852
            |> snd
haftmann@29441
   853
          end;
haftmann@29441
   854
haftmann@29578
   855
    fun after_qed wits eqs = ProofContext.theory (fold_map store_reg (regs ~~ wits)
haftmann@29578
   856
        #-> (fn regs => store_eqns_activate regs eqs));
haftmann@29441
   857
haftmann@29578
   858
  in Element.witness_proof_eqs after_qed propss eqns goal_ctxt end;
ballarin@28993
   859
ballarin@28993
   860
in
ballarin@28993
   861
haftmann@29501
   862
fun interpretation x = gen_interpretation cert_goal_expression (K I) (K I) x;
ballarin@29210
   863
fun interpretation_cmd x = gen_interpretation read_goal_expression
ballarin@29211
   864
  Syntax.parse_prop Attrib.intern_src x;
ballarin@28895
   865
ballarin@28895
   866
end;
ballarin@28903
   867
ballarin@29018
   868
ballarin@29018
   869
(** Interpretation in proof contexts **)
ballarin@29018
   870
ballarin@29018
   871
local
ballarin@29018
   872
ballarin@29018
   873
fun gen_interpret prep_expr
ballarin@29018
   874
    expression int state =
ballarin@29018
   875
  let
ballarin@29018
   876
    val _ = Proof.assert_forward_or_chain state;
ballarin@29018
   877
    val ctxt = Proof.context_of state;
ballarin@29018
   878
ballarin@29018
   879
    val ((propss, regs, export), goal_ctxt) = prep_expr expression ctxt;
wenzelm@30344
   880
haftmann@29578
   881
    fun store_reg (name, morph) thms =
ballarin@29018
   882
      let
ballarin@29018
   883
        val morph' = morph $> Element.satisfy_morphism thms $> export;
haftmann@29578
   884
      in Locale.activate_local_facts (name, morph') end;
ballarin@29018
   885
haftmann@29578
   886
    fun after_qed wits =
haftmann@29578
   887
      Proof.map_context (fold2 store_reg regs wits);
ballarin@29018
   888
  in
haftmann@29578
   889
    state
haftmann@29578
   890
    |> Element.witness_local_proof after_qed "interpret" propss goal_ctxt int
ballarin@29018
   891
  end;
ballarin@29018
   892
ballarin@29018
   893
in
ballarin@29018
   894
haftmann@29501
   895
fun interpret x = gen_interpret cert_goal_expression x;
ballarin@29018
   896
fun interpret_cmd x = gen_interpret read_goal_expression x;
ballarin@29018
   897
ballarin@28993
   898
end;
ballarin@28993
   899
ballarin@29018
   900
end;
ballarin@29018
   901