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