src/Pure/Proof/extraction.ML
author wenzelm
Wed Jul 13 16:07:21 2005 +0200 (2005-07-13)
changeset 16800 90eff1b52428
parent 16790 be2780f435e1
child 16865 fb39dcfc1c24
permissions -rw-r--r--
improved Net interface;
berghofe@13402
     1
(*  Title:      Pure/Proof/extraction.ML
berghofe@13402
     2
    ID:         $Id$
berghofe@13402
     3
    Author:     Stefan Berghofer, TU Muenchen
berghofe@13402
     4
berghofe@13402
     5
Extraction of programs from proofs.
berghofe@13402
     6
*)
berghofe@13402
     7
berghofe@13402
     8
signature EXTRACTION =
berghofe@13402
     9
sig
wenzelm@16458
    10
  val set_preprocessor : (theory -> Proofterm.proof -> Proofterm.proof) -> theory -> theory
berghofe@13402
    11
  val add_realizes_eqns_i : ((term * term) list * (term * term)) list -> theory -> theory
berghofe@13402
    12
  val add_realizes_eqns : string list -> theory -> theory
berghofe@13402
    13
  val add_typeof_eqns_i : ((term * term) list * (term * term)) list -> theory -> theory
berghofe@13402
    14
  val add_typeof_eqns : string list -> theory -> theory
berghofe@13402
    15
  val add_realizers_i : (string * (string list * term * Proofterm.proof)) list
berghofe@13402
    16
    -> theory -> theory
berghofe@13402
    17
  val add_realizers : (thm * (string list * string * string)) list
berghofe@13402
    18
    -> theory -> theory
berghofe@13402
    19
  val add_expand_thms : thm list -> theory -> theory
berghofe@13732
    20
  val add_types : (xstring * ((term -> term option) list *
berghofe@13732
    21
    (term -> typ -> term -> typ -> term) option)) list -> theory -> theory
berghofe@13732
    22
  val extract : (thm * string list) list -> theory -> theory
berghofe@13402
    23
  val nullT : typ
berghofe@13402
    24
  val nullt : term
berghofe@13714
    25
  val mk_typ : typ -> term
berghofe@13714
    26
  val etype_of : theory -> string list -> typ list -> term -> typ
berghofe@13714
    27
  val realizes_of: theory -> string list -> term -> term -> term
berghofe@13402
    28
end;
berghofe@13402
    29
berghofe@13402
    30
structure Extraction : EXTRACTION =
berghofe@13402
    31
struct
berghofe@13402
    32
berghofe@13402
    33
open Proofterm;
berghofe@13402
    34
berghofe@13402
    35
(**** tools ****)
berghofe@13402
    36
berghofe@13402
    37
fun add_syntax thy =
berghofe@13402
    38
  thy
berghofe@13402
    39
  |> Theory.copy
berghofe@13402
    40
  |> Theory.root_path
berghofe@13402
    41
  |> Theory.add_types [("Type", 0, NoSyn), ("Null", 0, NoSyn)]
berghofe@13402
    42
  |> Theory.add_consts
wenzelm@14854
    43
      [("typeof", "'b::{} => Type", NoSyn),
wenzelm@14854
    44
       ("Type", "'a::{} itself => Type", NoSyn),
berghofe@13402
    45
       ("Null", "Null", NoSyn),
wenzelm@14854
    46
       ("realizes", "'a::{} => 'b::{} => 'b", NoSyn)];
berghofe@13402
    47
berghofe@13402
    48
val nullT = Type ("Null", []);
berghofe@13402
    49
val nullt = Const ("Null", nullT);
berghofe@13402
    50
berghofe@13402
    51
fun mk_typ T =
berghofe@13402
    52
  Const ("Type", itselfT T --> Type ("Type", [])) $ Logic.mk_type T;
berghofe@13402
    53
berghofe@13402
    54
fun typeof_proc defaultS vs (Const ("typeof", _) $ u) =
skalberg@15531
    55
      SOME (mk_typ (case strip_comb u of
berghofe@13402
    56
          (Var ((a, i), _), _) =>
berghofe@13402
    57
            if a mem vs then TFree ("'" ^ a ^ ":" ^ string_of_int i, defaultS)
berghofe@13402
    58
            else nullT
berghofe@13402
    59
        | (Free (a, _), _) =>
berghofe@13402
    60
            if a mem vs then TFree ("'" ^ a, defaultS) else nullT
berghofe@13402
    61
        | _ => nullT))
skalberg@15531
    62
  | typeof_proc _ _ _ = NONE;
berghofe@13402
    63
skalberg@15531
    64
fun rlz_proc (Const ("realizes", Type (_, [Type ("Null", []), _])) $ r $ t) = SOME t
berghofe@13732
    65
  | rlz_proc (Const ("realizes", Type (_, [T, _])) $ r $ t) =
berghofe@13732
    66
      (case strip_comb t of
skalberg@15531
    67
         (Var (ixn, U), ts) => SOME (list_comb (Var (ixn, T --> U), r :: ts))
skalberg@15531
    68
       | (Free (s, U), ts) => SOME (list_comb (Free (s, T --> U), r :: ts))
skalberg@15531
    69
       | _ => NONE)
skalberg@15531
    70
  | rlz_proc _ = NONE;
berghofe@13402
    71
berghofe@13402
    72
val unpack_ixn = apfst implode o apsnd (fst o read_int o tl) o
berghofe@13402
    73
  take_prefix (not o equal ":") o explode;
berghofe@13402
    74
berghofe@13402
    75
type rules =
berghofe@13402
    76
  {next: int, rs: ((term * term) list * (term * term)) list,
berghofe@13402
    77
   net: (int * ((term * term) list * (term * term))) Net.net};
berghofe@13402
    78
berghofe@13402
    79
val empty_rules : rules = {next = 0, rs = [], net = Net.empty};
berghofe@13402
    80
berghofe@13402
    81
fun add_rule (r as (_, (lhs, _)), {next, rs, net} : rules) =
wenzelm@16800
    82
  {next = next - 1, rs = r :: rs, net = Net.insert_term (K false)
wenzelm@16800
    83
     (Pattern.eta_contract lhs, (next, r)) net};
berghofe@13402
    84
berghofe@13417
    85
fun merge_rules
berghofe@13417
    86
  ({next, rs = rs1, net} : rules) ({next = next2, rs = rs2, ...} : rules) =
skalberg@15574
    87
  foldr add_rule {next = next, rs = rs1, net = net} (rs2 \\ rs1);
berghofe@13402
    88
wenzelm@16458
    89
fun condrew thy rules procs =
berghofe@13402
    90
  let
wenzelm@16458
    91
    val tsig = Sign.tsig_of thy;
berghofe@13402
    92
berghofe@13402
    93
    fun rew tm =
berghofe@13402
    94
      Pattern.rewrite_term tsig [] (condrew' :: procs) tm
berghofe@15399
    95
    and condrew' tm =
berghofe@13402
    96
      let
berghofe@15399
    97
        val cache = ref ([] : (term * term) list);
berghofe@15399
    98
        fun lookup f x = (case assoc (!cache, x) of
skalberg@15531
    99
            NONE =>
berghofe@15399
   100
              let val y = f x
berghofe@15399
   101
              in (cache := (x, y) :: !cache; y) end
skalberg@15531
   102
          | SOME y => y);
berghofe@15399
   103
      in
berghofe@15399
   104
        get_first (fn (_, (prems, (tm1, tm2))) =>
berghofe@15399
   105
        let
skalberg@15570
   106
          fun ren t = getOpt (Term.rename_abs tm1 tm t, t);
berghofe@15399
   107
          val inc = Logic.incr_indexes ([], maxidx_of_term tm + 1);
berghofe@15399
   108
          val env as (Tenv, tenv) = Pattern.match tsig (inc tm1, tm);
berghofe@15798
   109
          val prems' = map (pairself (Envir.subst_vars env o inc o ren)) prems;
berghofe@15399
   110
          val env' = Envir.Envir
skalberg@15570
   111
            {maxidx = Library.foldl Int.max
berghofe@15399
   112
              (~1, map (Int.max o pairself maxidx_of_term) prems'),
berghofe@15798
   113
             iTs = Tenv, asol = tenv};
skalberg@15570
   114
          val env'' = Library.foldl (fn (env, p) =>
wenzelm@16458
   115
            Pattern.unify (thy, env, [pairself (lookup rew) p])) (env', prems')
skalberg@15531
   116
        in SOME (Envir.norm_term env'' (inc (ren tm2)))
skalberg@15531
   117
        end handle Pattern.MATCH => NONE | Pattern.Unif => NONE)
wenzelm@16486
   118
          (sort (int_ord o pairself fst)
berghofe@15399
   119
            (Net.match_term rules (Pattern.eta_contract tm)))
berghofe@15399
   120
      end;
berghofe@13402
   121
berghofe@13402
   122
  in rew end;
berghofe@13402
   123
skalberg@15531
   124
val chtype = change_type o SOME;
berghofe@13402
   125
wenzelm@16195
   126
fun extr_name s vs = NameSpace.append "extr" (space_implode "_" (s :: vs));
wenzelm@16195
   127
fun corr_name s vs = extr_name s vs ^ "_correctness";
berghofe@13402
   128
wenzelm@16195
   129
fun msg d s = priority (Symbol.spaces d ^ s);
berghofe@13402
   130
haftmann@16790
   131
fun vars_of t = rev (foldl_aterms
haftmann@16790
   132
  (fn (vs, v as Var _) => v ins vs | (vs, _) => vs) ([], t));
berghofe@13402
   133
berghofe@13402
   134
fun vfs_of t = vars_of t @ sort (make_ord atless) (term_frees t);
berghofe@13402
   135
berghofe@13402
   136
fun forall_intr (t, prop) =
berghofe@13402
   137
  let val (a, T) = (case t of Var ((a, _), T) => (a, T) | Free p => p)
berghofe@13402
   138
  in all T $ Abs (a, T, abstract_over (t, prop)) end;
berghofe@13402
   139
berghofe@13402
   140
fun forall_intr_prf (t, prf) =
berghofe@13402
   141
  let val (a, T) = (case t of Var ((a, _), T) => (a, T) | Free p => p)
skalberg@15531
   142
  in Abst (a, SOME T, prf_abstract_over t prf) end;
berghofe@13402
   143
skalberg@15574
   144
val mkabs = foldr (fn (v, t) => Abs ("x", fastype_of v, abstract_over (v, t)));
berghofe@13402
   145
berghofe@13732
   146
fun strip_abs 0 t = t
berghofe@13732
   147
  | strip_abs n (Abs (_, _, t)) = strip_abs (n-1) t
berghofe@13732
   148
  | strip_abs _ _ = error "strip_abs: not an abstraction";
berghofe@13732
   149
berghofe@13402
   150
fun prf_subst_TVars tye =
berghofe@13402
   151
  map_proof_terms (subst_TVars tye) (typ_subst_TVars tye);
berghofe@13402
   152
skalberg@15574
   153
fun relevant_vars types prop = foldr (fn
berghofe@13402
   154
      (Var ((a, i), T), vs) => (case strip_type T of
berghofe@13402
   155
        (_, Type (s, _)) => if s mem types then a :: vs else vs
berghofe@13402
   156
      | _ => vs)
skalberg@15574
   157
    | (_, vs) => vs) [] (vars_of prop);
berghofe@13402
   158
berghofe@13732
   159
fun tname_of (Type (s, _)) = s
berghofe@13732
   160
  | tname_of _ = "";
berghofe@13732
   161
berghofe@13732
   162
fun get_var_type t =
berghofe@13732
   163
  let
berghofe@13732
   164
    val vs = Term.add_vars ([], t);
berghofe@13732
   165
    val fs = Term.add_frees ([], t)
berghofe@13732
   166
  in fn 
berghofe@13732
   167
      Var (ixn, _) => (case assoc (Term.add_vars ([], t), ixn) of
skalberg@15531
   168
          NONE => error "get_var_type: no such variable in term"
skalberg@15531
   169
        | SOME T => Var (ixn, T))
berghofe@13732
   170
    | Free (s, _) => (case assoc (Term.add_frees ([], t), s) of
skalberg@15531
   171
          NONE => error "get_var_type: no such variable in term"
skalberg@15531
   172
        | SOME T => Free (s, T))
berghofe@13732
   173
    | _ => error "get_var_type: not a variable"
berghofe@13732
   174
  end;
berghofe@13732
   175
berghofe@13402
   176
berghofe@13402
   177
(**** theory data ****)
berghofe@13402
   178
berghofe@13402
   179
(* data kind 'Pure/extraction' *)
berghofe@13402
   180
wenzelm@16458
   181
structure ExtractionData = TheoryDataFun
wenzelm@16458
   182
(struct
berghofe@13402
   183
  val name = "Pure/extraction";
berghofe@13402
   184
  type T =
berghofe@13402
   185
    {realizes_eqns : rules,
berghofe@13402
   186
     typeof_eqns : rules,
berghofe@13732
   187
     types : (string * ((term -> term option) list *
berghofe@13732
   188
       (term -> typ -> term -> typ -> term) option)) list,
berghofe@13402
   189
     realizers : (string list * (term * proof)) list Symtab.table,
berghofe@13402
   190
     defs : thm list,
berghofe@13402
   191
     expand : (string * term) list,
wenzelm@16458
   192
     prep : (theory -> proof -> proof) option}
berghofe@13402
   193
berghofe@13402
   194
  val empty =
berghofe@13402
   195
    {realizes_eqns = empty_rules,
berghofe@13402
   196
     typeof_eqns = empty_rules,
berghofe@13402
   197
     types = [],
berghofe@13402
   198
     realizers = Symtab.empty,
berghofe@13402
   199
     defs = [],
berghofe@13402
   200
     expand = [],
skalberg@15531
   201
     prep = NONE};
berghofe@13402
   202
  val copy = I;
wenzelm@16458
   203
  val extend = I;
berghofe@13402
   204
wenzelm@16458
   205
  fun merge _
berghofe@13402
   206
    (({realizes_eqns = realizes_eqns1, typeof_eqns = typeof_eqns1, types = types1,
berghofe@13402
   207
       realizers = realizers1, defs = defs1, expand = expand1, prep = prep1},
berghofe@13402
   208
      {realizes_eqns = realizes_eqns2, typeof_eqns = typeof_eqns2, types = types2,
berghofe@13402
   209
       realizers = realizers2, defs = defs2, expand = expand2, prep = prep2}) : T * T) =
berghofe@13402
   210
    {realizes_eqns = merge_rules realizes_eqns1 realizes_eqns2,
berghofe@13402
   211
     typeof_eqns = merge_rules typeof_eqns1 typeof_eqns2,
berghofe@13732
   212
     types = merge_alists types1 types2,
berghofe@13402
   213
     realizers = Symtab.merge_multi' (eq_set o pairself #1)
berghofe@13402
   214
       (realizers1, realizers2),
berghofe@13402
   215
     defs = gen_merge_lists eq_thm defs1 defs2,
berghofe@13402
   216
     expand = merge_lists expand1 expand2,
skalberg@15531
   217
     prep = (case prep1 of NONE => prep2 | _ => prep1)};
berghofe@13402
   218
wenzelm@16458
   219
  fun print _ _ = ();
wenzelm@16458
   220
end);
berghofe@13402
   221
wenzelm@15801
   222
val _ = Context.add_setup [ExtractionData.init];
berghofe@13402
   223
berghofe@13402
   224
fun read_condeq thy =
wenzelm@16458
   225
  let val thy' = add_syntax thy
berghofe@13402
   226
  in fn s =>
wenzelm@16458
   227
    let val t = Logic.varify (term_of (read_cterm thy' (s, propT)))
berghofe@13402
   228
    in (map Logic.dest_equals (Logic.strip_imp_prems t),
berghofe@13402
   229
      Logic.dest_equals (Logic.strip_imp_concl t))
berghofe@13402
   230
    end handle TERM _ => error ("Not a (conditional) meta equality:\n" ^ s)
berghofe@13402
   231
  end;
berghofe@13402
   232
berghofe@13402
   233
(** preprocessor **)
berghofe@13402
   234
berghofe@13402
   235
fun set_preprocessor prep thy =
berghofe@13402
   236
  let val {realizes_eqns, typeof_eqns, types, realizers,
berghofe@13402
   237
    defs, expand, ...} = ExtractionData.get thy
berghofe@13402
   238
  in
berghofe@13402
   239
    ExtractionData.put
berghofe@13402
   240
      {realizes_eqns = realizes_eqns, typeof_eqns = typeof_eqns, types = types,
skalberg@15531
   241
       realizers = realizers, defs = defs, expand = expand, prep = SOME prep} thy
berghofe@13402
   242
  end;
berghofe@13402
   243
berghofe@13402
   244
(** equations characterizing realizability **)
berghofe@13402
   245
berghofe@13402
   246
fun gen_add_realizes_eqns prep_eq eqns thy =
berghofe@13402
   247
  let val {realizes_eqns, typeof_eqns, types, realizers,
berghofe@13402
   248
    defs, expand, prep} = ExtractionData.get thy;
berghofe@13402
   249
  in
berghofe@13402
   250
    ExtractionData.put
skalberg@15574
   251
      {realizes_eqns = foldr add_rule realizes_eqns (map (prep_eq thy) eqns),
berghofe@13402
   252
       typeof_eqns = typeof_eqns, types = types, realizers = realizers,
berghofe@13402
   253
       defs = defs, expand = expand, prep = prep} thy
berghofe@13402
   254
  end
berghofe@13402
   255
berghofe@13402
   256
val add_realizes_eqns_i = gen_add_realizes_eqns (K I);
berghofe@13402
   257
val add_realizes_eqns = gen_add_realizes_eqns read_condeq;
berghofe@13402
   258
berghofe@13402
   259
(** equations characterizing type of extracted program **)
berghofe@13402
   260
berghofe@13402
   261
fun gen_add_typeof_eqns prep_eq eqns thy =
berghofe@13402
   262
  let
berghofe@13402
   263
    val {realizes_eqns, typeof_eqns, types, realizers,
berghofe@13402
   264
      defs, expand, prep} = ExtractionData.get thy;
berghofe@13732
   265
    val eqns' = map (prep_eq thy) eqns
berghofe@13402
   266
  in
berghofe@13402
   267
    ExtractionData.put
berghofe@13402
   268
      {realizes_eqns = realizes_eqns, realizers = realizers,
skalberg@15574
   269
       typeof_eqns = foldr add_rule typeof_eqns eqns',
berghofe@13732
   270
       types = types, defs = defs, expand = expand, prep = prep} thy
berghofe@13402
   271
  end
berghofe@13402
   272
berghofe@13402
   273
val add_typeof_eqns_i = gen_add_typeof_eqns (K I);
berghofe@13402
   274
val add_typeof_eqns = gen_add_typeof_eqns read_condeq;
berghofe@13402
   275
berghofe@13402
   276
fun thaw (T as TFree (a, S)) =
wenzelm@16195
   277
      if exists_string (equal ":") a then TVar (unpack_ixn a, S) else T
berghofe@13402
   278
  | thaw (Type (a, Ts)) = Type (a, map thaw Ts)
berghofe@13402
   279
  | thaw T = T;
berghofe@13402
   280
berghofe@13402
   281
fun freeze (TVar ((a, i), S)) = TFree (a ^ ":" ^ string_of_int i, S)
berghofe@13402
   282
  | freeze (Type (a, Ts)) = Type (a, map freeze Ts)
berghofe@13402
   283
  | freeze T = T;
berghofe@13402
   284
berghofe@13402
   285
fun freeze_thaw f x =
berghofe@13402
   286
  map_term_types thaw (f (map_term_types freeze x));
berghofe@13402
   287
wenzelm@16458
   288
fun etype_of thy vs Ts t =
berghofe@13402
   289
  let
wenzelm@16458
   290
    val {typeof_eqns, ...} = ExtractionData.get thy;
berghofe@13402
   291
    fun err () = error ("Unable to determine type of extracted program for\n" ^
wenzelm@16458
   292
      Sign.string_of_term thy t)
wenzelm@16458
   293
  in case strip_abs_body (freeze_thaw (condrew thy (#net typeof_eqns)
wenzelm@16458
   294
    [typeof_proc (Sign.defaultS thy) vs]) (list_abs (map (pair "x") (rev Ts),
berghofe@13402
   295
      Const ("typeof", fastype_of1 (Ts, t) --> Type ("Type", [])) $ t))) of
berghofe@13402
   296
      Const ("Type", _) $ u => (Logic.dest_type u handle TERM _ => err ())
berghofe@13402
   297
    | _ => err ()
berghofe@13402
   298
  end;
berghofe@13402
   299
berghofe@13402
   300
(** realizers for axioms / theorems, together with correctness proofs **)
berghofe@13402
   301
berghofe@13402
   302
fun gen_add_realizers prep_rlz rs thy =
berghofe@13402
   303
  let val {realizes_eqns, typeof_eqns, types, realizers,
berghofe@13402
   304
    defs, expand, prep} = ExtractionData.get thy
berghofe@13402
   305
  in
berghofe@13402
   306
    ExtractionData.put
berghofe@13402
   307
      {realizes_eqns = realizes_eqns, typeof_eqns = typeof_eqns, types = types,
skalberg@15574
   308
       realizers = foldr Symtab.update_multi
skalberg@15574
   309
         realizers (map (prep_rlz thy) (rev rs)),
berghofe@13402
   310
       defs = defs, expand = expand, prep = prep} thy
berghofe@13402
   311
  end
berghofe@13402
   312
berghofe@13402
   313
fun prep_realizer thy =
berghofe@13402
   314
  let
berghofe@13732
   315
    val {realizes_eqns, typeof_eqns, defs, types, ...} =
berghofe@13402
   316
      ExtractionData.get thy;
skalberg@15570
   317
    val procs = List.concat (map (fst o snd) types);
berghofe@13732
   318
    val rtypes = map fst types;
wenzelm@16800
   319
    val eqns = Net.merge (K false) (#net realizes_eqns, #net typeof_eqns);
berghofe@13402
   320
    val thy' = add_syntax thy;
berghofe@13402
   321
    val rd = ProofSyntax.read_proof thy' false
berghofe@13402
   322
  in fn (thm, (vs, s1, s2)) =>
berghofe@13402
   323
    let
berghofe@13402
   324
      val name = Thm.name_of_thm thm;
berghofe@13402
   325
      val _ = assert (name <> "") "add_realizers: unnamed theorem";
wenzelm@16458
   326
      val prop = Pattern.rewrite_term (Sign.tsig_of thy')
berghofe@13402
   327
        (map (Logic.dest_equals o prop_of) defs) [] (prop_of thm);
berghofe@13402
   328
      val vars = vars_of prop;
berghofe@13732
   329
      val vars' = filter_out (fn v =>
berghofe@13732
   330
        tname_of (body_type (fastype_of v)) mem rtypes) vars;
wenzelm@16458
   331
      val T = etype_of thy' vs [] prop;
berghofe@13402
   332
      val (T', thw) = Type.freeze_thaw_type
berghofe@13732
   333
        (if T = nullT then nullT else map fastype_of vars' ---> T);
wenzelm@16458
   334
      val t = map_term_types thw (term_of (read_cterm thy' (s1, T')));
wenzelm@16458
   335
      val r' = freeze_thaw (condrew thy' eqns
wenzelm@16458
   336
        (procs @ [typeof_proc (Sign.defaultS thy') vs, rlz_proc]))
berghofe@13402
   337
          (Const ("realizes", T --> propT --> propT) $
berghofe@13732
   338
            (if T = nullT then t else list_comb (t, vars')) $ prop);
skalberg@15574
   339
      val r = foldr forall_intr r' (map (get_var_type r') vars);
wenzelm@16458
   340
      val prf = Reconstruct.reconstruct_proof thy' r (rd s2);
berghofe@13402
   341
    in (name, (vs, (t, prf))) end
berghofe@13402
   342
  end;
berghofe@13402
   343
berghofe@13402
   344
val add_realizers_i = gen_add_realizers
berghofe@13402
   345
  (fn _ => fn (name, (vs, t, prf)) => (name, (vs, (t, prf))));
berghofe@13402
   346
val add_realizers = gen_add_realizers prep_realizer;
berghofe@13402
   347
berghofe@13714
   348
fun realizes_of thy vs t prop =
berghofe@13714
   349
  let
berghofe@13714
   350
    val thy' = add_syntax thy;
berghofe@13732
   351
    val {realizes_eqns, typeof_eqns, defs, types, ...} =
berghofe@13714
   352
      ExtractionData.get thy';
skalberg@15570
   353
    val procs = List.concat (map (fst o snd) types);
wenzelm@16800
   354
    val eqns = Net.merge (K false) (#net realizes_eqns, #net typeof_eqns);
wenzelm@16458
   355
    val prop' = Pattern.rewrite_term (Sign.tsig_of thy')
berghofe@13714
   356
      (map (Logic.dest_equals o prop_of) defs) [] prop;
wenzelm@16458
   357
  in freeze_thaw (condrew thy' eqns
wenzelm@16458
   358
    (procs @ [typeof_proc (Sign.defaultS thy') vs, rlz_proc]))
berghofe@13714
   359
      (Const ("realizes", fastype_of t --> propT --> propT) $ t $ prop')
berghofe@13714
   360
  end;
berghofe@13714
   361
berghofe@13402
   362
(** expanding theorems / definitions **)
berghofe@13402
   363
berghofe@13402
   364
fun add_expand_thm (thy, thm) =
berghofe@13402
   365
  let
berghofe@13402
   366
    val {realizes_eqns, typeof_eqns, types, realizers,
berghofe@13402
   367
      defs, expand, prep} = ExtractionData.get thy;
berghofe@13402
   368
berghofe@13402
   369
    val name = Thm.name_of_thm thm;
berghofe@13402
   370
    val _ = assert (name <> "") "add_expand_thms: unnamed theorem";
berghofe@13402
   371
berghofe@13402
   372
    val is_def =
berghofe@13402
   373
      (case strip_comb (fst (Logic.dest_equals (prop_of thm))) of
berghofe@13402
   374
         (Const _, ts) => forall is_Var ts andalso null (duplicates ts)
wenzelm@16349
   375
           andalso can (Thm.get_axiom_i thy) name
berghofe@13402
   376
       | _ => false) handle TERM _ => false;
berghofe@13402
   377
  in
berghofe@13402
   378
    (ExtractionData.put (if is_def then
berghofe@13402
   379
        {realizes_eqns = realizes_eqns,
berghofe@13402
   380
         typeof_eqns = add_rule (([],
berghofe@13402
   381
           Logic.dest_equals (prop_of (Drule.abs_def thm))), typeof_eqns),
berghofe@13402
   382
         types = types,
berghofe@13402
   383
         realizers = realizers, defs = gen_ins eq_thm (thm, defs),
berghofe@13402
   384
         expand = expand, prep = prep}
berghofe@13402
   385
      else
berghofe@13402
   386
        {realizes_eqns = realizes_eqns, typeof_eqns = typeof_eqns, types = types,
berghofe@13402
   387
         realizers = realizers, defs = defs,
berghofe@13402
   388
         expand = (name, prop_of thm) ins expand, prep = prep}) thy, thm)
berghofe@13402
   389
  end;
berghofe@13402
   390
skalberg@15570
   391
fun add_expand_thms thms thy = Library.foldl (fst o add_expand_thm) (thy, thms);
berghofe@13402
   392
wenzelm@15801
   393
berghofe@13732
   394
(** types with computational content **)
berghofe@13732
   395
berghofe@13732
   396
fun add_types tys thy =
berghofe@13732
   397
  let val {realizes_eqns, typeof_eqns, types, realizers,
berghofe@13732
   398
    defs, expand, prep} = ExtractionData.get thy;
berghofe@13732
   399
  in
berghofe@13732
   400
    ExtractionData.put
berghofe@13732
   401
      {realizes_eqns = realizes_eqns, typeof_eqns = typeof_eqns,
wenzelm@16458
   402
       types = map (apfst (Sign.intern_type thy)) tys @ types,
berghofe@13732
   403
       realizers = realizers, defs = defs, expand = expand, prep = prep} thy
berghofe@13732
   404
  end;
berghofe@13732
   405
berghofe@13402
   406
wenzelm@15801
   407
(** Pure setup **)
wenzelm@15801
   408
wenzelm@15801
   409
val _ = Context.add_setup
wenzelm@15801
   410
  [add_types [("prop", ([], NONE))],
wenzelm@15801
   411
wenzelm@15801
   412
   add_typeof_eqns
wenzelm@15801
   413
     ["(typeof (PROP P)) == (Type (TYPE(Null))) ==>  \
wenzelm@15801
   414
    \  (typeof (PROP Q)) == (Type (TYPE('Q))) ==>  \
wenzelm@15801
   415
    \    (typeof (PROP P ==> PROP Q)) == (Type (TYPE('Q)))",
wenzelm@15801
   416
wenzelm@15801
   417
      "(typeof (PROP Q)) == (Type (TYPE(Null))) ==>  \
wenzelm@15801
   418
    \    (typeof (PROP P ==> PROP Q)) == (Type (TYPE(Null)))",
wenzelm@15801
   419
wenzelm@15801
   420
      "(typeof (PROP P)) == (Type (TYPE('P))) ==>  \
wenzelm@15801
   421
    \  (typeof (PROP Q)) == (Type (TYPE('Q))) ==>  \
wenzelm@15801
   422
    \    (typeof (PROP P ==> PROP Q)) == (Type (TYPE('P => 'Q)))",
wenzelm@15801
   423
wenzelm@15801
   424
      "(%x. typeof (PROP P (x))) == (%x. Type (TYPE(Null))) ==>  \
wenzelm@15801
   425
    \    (typeof (!!x. PROP P (x))) == (Type (TYPE(Null)))",
wenzelm@15801
   426
wenzelm@15801
   427
      "(%x. typeof (PROP P (x))) == (%x. Type (TYPE('P))) ==>  \
wenzelm@15801
   428
    \    (typeof (!!x::'a. PROP P (x))) == (Type (TYPE('a => 'P)))",
wenzelm@15801
   429
wenzelm@15801
   430
      "(%x. typeof (f (x))) == (%x. Type (TYPE('f))) ==>  \
wenzelm@15801
   431
    \    (typeof (f)) == (Type (TYPE('f)))"],
wenzelm@15801
   432
wenzelm@15801
   433
   add_realizes_eqns
wenzelm@15801
   434
     ["(typeof (PROP P)) == (Type (TYPE(Null))) ==>  \
wenzelm@15801
   435
    \    (realizes (r) (PROP P ==> PROP Q)) ==  \
wenzelm@15801
   436
    \    (PROP realizes (Null) (PROP P) ==> PROP realizes (r) (PROP Q))",
wenzelm@15801
   437
wenzelm@15801
   438
      "(typeof (PROP P)) == (Type (TYPE('P))) ==>  \
wenzelm@15801
   439
    \  (typeof (PROP Q)) == (Type (TYPE(Null))) ==>  \
wenzelm@15801
   440
    \    (realizes (r) (PROP P ==> PROP Q)) ==  \
wenzelm@15801
   441
    \    (!!x::'P. PROP realizes (x) (PROP P) ==> PROP realizes (Null) (PROP Q))",
wenzelm@15801
   442
wenzelm@15801
   443
      "(realizes (r) (PROP P ==> PROP Q)) ==  \
wenzelm@15801
   444
    \  (!!x. PROP realizes (x) (PROP P) ==> PROP realizes (r (x)) (PROP Q))",
wenzelm@15801
   445
wenzelm@15801
   446
      "(%x. typeof (PROP P (x))) == (%x. Type (TYPE(Null))) ==>  \
wenzelm@15801
   447
    \    (realizes (r) (!!x. PROP P (x))) ==  \
wenzelm@15801
   448
    \    (!!x. PROP realizes (Null) (PROP P (x)))",
wenzelm@15801
   449
wenzelm@15801
   450
      "(realizes (r) (!!x. PROP P (x))) ==  \
wenzelm@15801
   451
    \  (!!x. PROP realizes (r (x)) (PROP P (x)))"],
wenzelm@15801
   452
wenzelm@15801
   453
   Attrib.add_attributes
wenzelm@15801
   454
     [("extraction_expand",
wenzelm@15801
   455
       (Attrib.no_args add_expand_thm, K Attrib.undef_local_attribute),
wenzelm@15801
   456
       "specify theorems / definitions to be expanded during extraction")]];
wenzelm@15801
   457
wenzelm@15801
   458
berghofe@13402
   459
(**** extract program ****)
berghofe@13402
   460
berghofe@13402
   461
val dummyt = Const ("dummy", dummyT);
berghofe@13402
   462
berghofe@13402
   463
fun extract thms thy =
berghofe@13402
   464
  let
wenzelm@16458
   465
    val thy' = add_syntax thy;
berghofe@13402
   466
    val {realizes_eqns, typeof_eqns, types, realizers, defs, expand, prep} =
berghofe@13402
   467
      ExtractionData.get thy;
skalberg@15570
   468
    val procs = List.concat (map (fst o snd) types);
berghofe@13732
   469
    val rtypes = map fst types;
wenzelm@16458
   470
    val typroc = typeof_proc (Sign.defaultS thy');
wenzelm@16458
   471
    val prep = getOpt (prep, K I) thy' o ProofRewriteRules.elim_defs thy' false defs o
wenzelm@16458
   472
      Reconstruct.expand_proof thy' (("", NONE) :: map (apsnd SOME) expand);
wenzelm@16800
   473
    val rrews = Net.merge (K false) (#net realizes_eqns, #net typeof_eqns);
berghofe@13402
   474
berghofe@13402
   475
    fun find_inst prop Ts ts vs =
berghofe@13402
   476
      let
berghofe@13732
   477
        val rvs = relevant_vars rtypes prop;
berghofe@13402
   478
        val vars = vars_of prop;
berghofe@13402
   479
        val n = Int.min (length vars, length ts);
berghofe@13402
   480
berghofe@13402
   481
        fun add_args ((Var ((a, i), _), t), (vs', tye)) =
berghofe@13402
   482
          if a mem rvs then
wenzelm@16458
   483
            let val T = etype_of thy' vs Ts t
berghofe@13402
   484
            in if T = nullT then (vs', tye)
berghofe@13402
   485
               else (a :: vs', (("'" ^ a, i), T) :: tye)
berghofe@13402
   486
            end
berghofe@13402
   487
          else (vs', tye)
berghofe@13402
   488
skalberg@15574
   489
      in foldr add_args ([], []) (Library.take (n, vars) ~~ Library.take (n, ts)) end;
berghofe@13402
   490
skalberg@15570
   491
    fun find vs = Option.map snd o find_first (curry eq_set vs o fst);
skalberg@15570
   492
    fun find' s = map snd o List.filter (equal s o fst)
berghofe@13402
   493
berghofe@13732
   494
    fun app_rlz_rews Ts vs t = strip_abs (length Ts) (freeze_thaw
wenzelm@16458
   495
      (condrew thy' rrews (procs @ [typroc vs, rlz_proc])) (list_abs
berghofe@13732
   496
        (map (pair "x") (rev Ts), t)));
berghofe@13732
   497
berghofe@13732
   498
    fun realizes_null vs prop = app_rlz_rews [] vs
berghofe@13732
   499
      (Const ("realizes", nullT --> propT --> propT) $ nullt $ prop);
berghofe@13402
   500
berghofe@13402
   501
    fun corr d defs vs ts Ts hs (PBound i) _ _ = (defs, PBound i)
berghofe@13402
   502
skalberg@15531
   503
      | corr d defs vs ts Ts hs (Abst (s, SOME T, prf)) (Abst (_, _, prf')) t =
berghofe@13402
   504
          let val (defs', corr_prf) = corr d defs vs [] (T :: Ts)
berghofe@13402
   505
            (dummyt :: hs) prf (incr_pboundvars 1 0 prf')
skalberg@15531
   506
            (case t of SOME (Abs (_, _, u)) => SOME u | _ => NONE)
skalberg@15531
   507
          in (defs', Abst (s, SOME T, corr_prf)) end
berghofe@13402
   508
skalberg@15531
   509
      | corr d defs vs ts Ts hs (AbsP (s, SOME prop, prf)) (AbsP (_, _, prf')) t =
berghofe@13402
   510
          let
wenzelm@16458
   511
            val T = etype_of thy' vs Ts prop;
berghofe@13402
   512
            val u = if T = nullT then 
skalberg@15531
   513
                (case t of SOME u => SOME (incr_boundvars 1 u) | NONE => NONE)
skalberg@15531
   514
              else (case t of SOME (Abs (_, _, u)) => SOME u | _ => NONE);
berghofe@13402
   515
            val (defs', corr_prf) = corr d defs vs [] (T :: Ts) (prop :: hs)
berghofe@13402
   516
              (incr_pboundvars 0 1 prf) (incr_pboundvars 0 1 prf') u;
berghofe@13402
   517
            val rlz = Const ("realizes", T --> propT --> propT)
berghofe@13402
   518
          in (defs',
berghofe@13732
   519
            if T = nullT then AbsP ("R",
skalberg@15531
   520
              SOME (app_rlz_rews Ts vs (rlz $ nullt $ prop)),
berghofe@13732
   521
                prf_subst_bounds [nullt] corr_prf)
skalberg@15531
   522
            else Abst (s, SOME T, AbsP ("R",
skalberg@15531
   523
              SOME (app_rlz_rews (T :: Ts) vs
berghofe@13732
   524
                (rlz $ Bound 0 $ incr_boundvars 1 prop)), corr_prf)))
berghofe@13402
   525
          end
berghofe@13402
   526
skalberg@15531
   527
      | corr d defs vs ts Ts hs (prf % SOME t) (prf' % _) t' =
berghofe@13732
   528
          let
berghofe@13732
   529
            val (Us, T) = strip_type (fastype_of1 (Ts, t));
berghofe@13732
   530
            val (defs', corr_prf) = corr d defs vs (t :: ts) Ts hs prf prf'
berghofe@13732
   531
              (if tname_of T mem rtypes then t'
skalberg@15531
   532
               else (case t' of SOME (u $ _) => SOME u | _ => NONE));
berghofe@13732
   533
            val u = if not (tname_of T mem rtypes) then t else
berghofe@13732
   534
              let
wenzelm@16458
   535
                val eT = etype_of thy' vs Ts t;
berghofe@13732
   536
                val (r, Us') = if eT = nullT then (nullt, Us) else
berghofe@13732
   537
                  (Bound (length Us), eT :: Us);
berghofe@13732
   538
                val u = list_comb (incr_boundvars (length Us') t,
berghofe@13732
   539
                  map Bound (length Us - 1 downto 0));
berghofe@13732
   540
                val u' = (case assoc (types, tname_of T) of
skalberg@15531
   541
                    SOME ((_, SOME f)) => f r eT u T
berghofe@13732
   542
                  | _ => Const ("realizes", eT --> T --> T) $ r $ u)
berghofe@13732
   543
              in app_rlz_rews Ts vs (list_abs (map (pair "x") Us', u')) end
skalberg@15531
   544
          in (defs', corr_prf % SOME u) end
berghofe@13402
   545
berghofe@13402
   546
      | corr d defs vs ts Ts hs (prf1 %% prf2) (prf1' %% prf2') t =
berghofe@13402
   547
          let
berghofe@13402
   548
            val prop = Reconstruct.prop_of' hs prf2';
wenzelm@16458
   549
            val T = etype_of thy' vs Ts prop;
skalberg@15531
   550
            val (defs1, f, u) = if T = nullT then (defs, t, NONE) else
berghofe@13402
   551
              (case t of
skalberg@15531
   552
                 SOME (f $ u) => (defs, SOME f, SOME u)
berghofe@13402
   553
               | _ =>
berghofe@13402
   554
                 let val (defs1, u) = extr d defs vs [] Ts hs prf2'
skalberg@15531
   555
                 in (defs1, NONE, SOME u) end)
berghofe@13402
   556
            val (defs2, corr_prf1) = corr d defs1 vs [] Ts hs prf1 prf1' f;
berghofe@13402
   557
            val (defs3, corr_prf2) = corr d defs2 vs [] Ts hs prf2 prf2' u;
berghofe@13402
   558
          in
berghofe@13402
   559
            if T = nullT then (defs3, corr_prf1 %% corr_prf2) else
berghofe@13402
   560
              (defs3, corr_prf1 % u %% corr_prf2)
berghofe@13402
   561
          end
berghofe@13402
   562
skalberg@15531
   563
      | corr d defs vs ts Ts hs (prf0 as PThm ((name, _), prf, prop, SOME Ts')) _ _ =
berghofe@13402
   564
          let
berghofe@13402
   565
            val (vs', tye) = find_inst prop Ts ts vs;
berghofe@13402
   566
            val tye' = (map fst (term_tvars prop) ~~ Ts') @ tye;
wenzelm@16458
   567
            val T = etype_of thy' vs' [] prop;
berghofe@13402
   568
            val defs' = if T = nullT then defs
berghofe@13402
   569
              else fst (extr d defs vs ts Ts hs prf0)
berghofe@13402
   570
          in
berghofe@13609
   571
            if T = nullT andalso realizes_null vs' prop aconv prop then (defs, prf0)
berghofe@13402
   572
            else case Symtab.lookup (realizers, name) of
skalberg@15531
   573
              NONE => (case find vs' (find' name defs') of
skalberg@15531
   574
                NONE =>
berghofe@13402
   575
                  let
berghofe@13402
   576
                    val _ = assert (T = nullT) "corr: internal error";
berghofe@13402
   577
                    val _ = msg d ("Building correctness proof for " ^ quote name ^
berghofe@13402
   578
                      (if null vs' then ""
berghofe@13402
   579
                       else " (relevant variables: " ^ commas_quote vs' ^ ")"));
wenzelm@16458
   580
                    val prf' = prep (Reconstruct.reconstruct_proof thy' prop prf);
berghofe@13402
   581
                    val (defs'', corr_prf) =
skalberg@15531
   582
                      corr (d + 1) defs' vs' [] [] [] prf' prf' NONE;
berghofe@13732
   583
                    val corr_prop = Reconstruct.prop_of corr_prf;
skalberg@15574
   584
                    val corr_prf' = foldr forall_intr_prf
skalberg@15574
   585
                      (proof_combt
berghofe@13793
   586
                         (PThm ((corr_name name vs', []), corr_prf, corr_prop,
skalberg@15531
   587
                             SOME (map TVar (term_tvars corr_prop))), vfs_of corr_prop))
skalberg@15574
   588
		      (map (get_var_type corr_prop) (vfs_of prop))
berghofe@13402
   589
                  in
berghofe@13732
   590
                    ((name, (vs', ((nullt, nullt), (corr_prf, corr_prf')))) :: defs'',
berghofe@13402
   591
                     prf_subst_TVars tye' corr_prf')
berghofe@13402
   592
                  end
skalberg@15531
   593
              | SOME (_, (_, prf')) => (defs', prf_subst_TVars tye' prf'))
skalberg@15531
   594
            | SOME rs => (case find vs' rs of
skalberg@15531
   595
                SOME (_, prf') => (defs', prf_subst_TVars tye' prf')
skalberg@15531
   596
              | NONE => error ("corr: no realizer for instance of theorem " ^
wenzelm@16458
   597
                  quote name ^ ":\n" ^ Sign.string_of_term thy' (Envir.beta_norm
berghofe@13402
   598
                    (Reconstruct.prop_of (proof_combt (prf0, ts))))))
berghofe@13402
   599
          end
berghofe@13402
   600
skalberg@15531
   601
      | corr d defs vs ts Ts hs (prf0 as PAxm (s, prop, SOME Ts')) _ _ =
berghofe@13402
   602
          let
berghofe@13402
   603
            val (vs', tye) = find_inst prop Ts ts vs;
berghofe@13402
   604
            val tye' = (map fst (term_tvars prop) ~~ Ts') @ tye
berghofe@13402
   605
          in
wenzelm@16458
   606
            if etype_of thy' vs' [] prop = nullT andalso
berghofe@13609
   607
              realizes_null vs' prop aconv prop then (defs, prf0)
berghofe@13609
   608
            else case find vs' (Symtab.lookup_multi (realizers, s)) of
skalberg@15531
   609
              SOME (_, prf) => (defs, prf_subst_TVars tye' prf)
skalberg@15531
   610
            | NONE => error ("corr: no realizer for instance of axiom " ^
wenzelm@16458
   611
                quote s ^ ":\n" ^ Sign.string_of_term thy' (Envir.beta_norm
berghofe@13402
   612
                  (Reconstruct.prop_of (proof_combt (prf0, ts)))))
berghofe@13402
   613
          end
berghofe@13402
   614
berghofe@13402
   615
      | corr d defs vs ts Ts hs _ _ _ = error "corr: bad proof"
berghofe@13402
   616
berghofe@13402
   617
    and extr d defs vs ts Ts hs (PBound i) = (defs, Bound i)
berghofe@13402
   618
skalberg@15531
   619
      | extr d defs vs ts Ts hs (Abst (s, SOME T, prf)) =
berghofe@13402
   620
          let val (defs', t) = extr d defs vs []
berghofe@13402
   621
            (T :: Ts) (dummyt :: hs) (incr_pboundvars 1 0 prf)
berghofe@13402
   622
          in (defs', Abs (s, T, t)) end
berghofe@13402
   623
skalberg@15531
   624
      | extr d defs vs ts Ts hs (AbsP (s, SOME t, prf)) =
berghofe@13402
   625
          let
wenzelm@16458
   626
            val T = etype_of thy' vs Ts t;
berghofe@13402
   627
            val (defs', t) = extr d defs vs [] (T :: Ts) (t :: hs)
berghofe@13402
   628
              (incr_pboundvars 0 1 prf)
berghofe@13402
   629
          in (defs',
berghofe@13402
   630
            if T = nullT then subst_bound (nullt, t) else Abs (s, T, t))
berghofe@13402
   631
          end
berghofe@13402
   632
skalberg@15531
   633
      | extr d defs vs ts Ts hs (prf % SOME t) =
berghofe@13402
   634
          let val (defs', u) = extr d defs vs (t :: ts) Ts hs prf
berghofe@13732
   635
          in (defs',
berghofe@13732
   636
            if tname_of (body_type (fastype_of1 (Ts, t))) mem rtypes then u
berghofe@13732
   637
            else u $ t)
berghofe@13732
   638
          end
berghofe@13402
   639
berghofe@13402
   640
      | extr d defs vs ts Ts hs (prf1 %% prf2) =
berghofe@13402
   641
          let
berghofe@13402
   642
            val (defs', f) = extr d defs vs [] Ts hs prf1;
berghofe@13402
   643
            val prop = Reconstruct.prop_of' hs prf2;
wenzelm@16458
   644
            val T = etype_of thy' vs Ts prop
berghofe@13402
   645
          in
berghofe@13402
   646
            if T = nullT then (defs', f) else
berghofe@13402
   647
              let val (defs'', t) = extr d defs' vs [] Ts hs prf2
berghofe@13402
   648
              in (defs'', f $ t) end
berghofe@13402
   649
          end
berghofe@13402
   650
skalberg@15531
   651
      | extr d defs vs ts Ts hs (prf0 as PThm ((s, _), prf, prop, SOME Ts')) =
berghofe@13402
   652
          let
berghofe@13402
   653
            val (vs', tye) = find_inst prop Ts ts vs;
berghofe@13402
   654
            val tye' = (map fst (term_tvars prop) ~~ Ts') @ tye
berghofe@13402
   655
          in
berghofe@13402
   656
            case Symtab.lookup (realizers, s) of
skalberg@15531
   657
              NONE => (case find vs' (find' s defs) of
skalberg@15531
   658
                NONE =>
berghofe@13402
   659
                  let
berghofe@13402
   660
                    val _ = msg d ("Extracting " ^ quote s ^
berghofe@13402
   661
                      (if null vs' then ""
berghofe@13402
   662
                       else " (relevant variables: " ^ commas_quote vs' ^ ")"));
wenzelm@16458
   663
                    val prf' = prep (Reconstruct.reconstruct_proof thy' prop prf);
berghofe@13402
   664
                    val (defs', t) = extr (d + 1) defs vs' [] [] [] prf';
berghofe@13402
   665
                    val (defs'', corr_prf) =
skalberg@15531
   666
                      corr (d + 1) defs' vs' [] [] [] prf' prf' (SOME t);
berghofe@13402
   667
berghofe@13402
   668
                    val nt = Envir.beta_norm t;
berghofe@13732
   669
                    val args = filter_out (fn v => tname_of (body_type
berghofe@13732
   670
                      (fastype_of v)) mem rtypes) (vfs_of prop);
skalberg@15570
   671
                    val args' = List.filter (fn v => Logic.occs (v, nt)) args;
skalberg@15574
   672
                    val t' = mkabs nt args';
berghofe@13402
   673
                    val T = fastype_of t';
berghofe@13732
   674
                    val cname = extr_name s vs';
berghofe@13402
   675
                    val c = Const (cname, T);
skalberg@15574
   676
                    val u = mkabs (list_comb (c, args')) args;
berghofe@13402
   677
                    val eqn = Logic.mk_equals (c, t');
berghofe@13402
   678
                    val rlz =
berghofe@13402
   679
                      Const ("realizes", fastype_of nt --> propT --> propT);
berghofe@13732
   680
                    val lhs = app_rlz_rews [] vs' (rlz $ nt $ prop);
berghofe@13732
   681
                    val rhs = app_rlz_rews [] vs' (rlz $ list_comb (c, args') $ prop);
berghofe@13732
   682
                    val f = app_rlz_rews [] vs'
berghofe@13732
   683
                      (Abs ("x", T, rlz $ list_comb (Bound 0, args') $ prop));
berghofe@13402
   684
berghofe@13732
   685
                    val corr_prf' =
berghofe@13732
   686
                      chtype [] equal_elim_axm %> lhs %> rhs %%
berghofe@13732
   687
                       (chtype [propT] symmetric_axm %> rhs %> lhs %%
berghofe@13732
   688
                         (chtype [propT, T] combination_axm %> f %> f %> c %> t' %%
berghofe@13732
   689
                           (chtype [T --> propT] reflexive_axm %> f) %%
berghofe@13732
   690
                           PAxm (cname ^ "_def", eqn,
skalberg@15531
   691
                             SOME (map TVar (term_tvars eqn))))) %% corr_prf;
berghofe@13732
   692
                    val corr_prop = Reconstruct.prop_of corr_prf';
skalberg@15574
   693
                    val corr_prf'' = foldr forall_intr_prf
skalberg@15574
   694
                      (proof_combt
berghofe@13732
   695
                        (PThm ((corr_name s vs', []), corr_prf', corr_prop,
skalberg@15574
   696
                          SOME (map TVar (term_tvars corr_prop))),  vfs_of corr_prop))
skalberg@15574
   697
		      (map (get_var_type corr_prop) (vfs_of prop));
berghofe@13402
   698
                  in
berghofe@13732
   699
                    ((s, (vs', ((t', u), (corr_prf', corr_prf'')))) :: defs'',
berghofe@13402
   700
                     subst_TVars tye' u)
berghofe@13402
   701
                  end
skalberg@15531
   702
              | SOME ((_, u), _) => (defs, subst_TVars tye' u))
skalberg@15531
   703
            | SOME rs => (case find vs' rs of
skalberg@15531
   704
                SOME (t, _) => (defs, subst_TVars tye' t)
skalberg@15531
   705
              | NONE => error ("extr: no realizer for instance of theorem " ^
wenzelm@16458
   706
                  quote s ^ ":\n" ^ Sign.string_of_term thy' (Envir.beta_norm
berghofe@13402
   707
                    (Reconstruct.prop_of (proof_combt (prf0, ts))))))
berghofe@13402
   708
          end
berghofe@13402
   709
skalberg@15531
   710
      | extr d defs vs ts Ts hs (prf0 as PAxm (s, prop, SOME Ts')) =
berghofe@13402
   711
          let
berghofe@13402
   712
            val (vs', tye) = find_inst prop Ts ts vs;
berghofe@13402
   713
            val tye' = (map fst (term_tvars prop) ~~ Ts') @ tye
berghofe@13402
   714
          in
berghofe@13402
   715
            case find vs' (Symtab.lookup_multi (realizers, s)) of
skalberg@15531
   716
              SOME (t, _) => (defs, subst_TVars tye' t)
skalberg@15531
   717
            | NONE => error ("extr: no realizer for instance of axiom " ^
wenzelm@16458
   718
                quote s ^ ":\n" ^ Sign.string_of_term thy' (Envir.beta_norm
berghofe@13402
   719
                  (Reconstruct.prop_of (proof_combt (prf0, ts)))))
berghofe@13402
   720
          end
berghofe@13402
   721
berghofe@13402
   722
      | extr d defs vs ts Ts hs _ = error "extr: bad proof";
berghofe@13402
   723
berghofe@13732
   724
    fun prep_thm (thm, vs) =
berghofe@13402
   725
      let
berghofe@13402
   726
        val {prop, der = (_, prf), sign, ...} = rep_thm thm;
berghofe@13402
   727
        val name = Thm.name_of_thm thm;
berghofe@13402
   728
        val _ = assert (name <> "") "extraction: unnamed theorem";
wenzelm@16458
   729
        val _ = assert (etype_of thy' vs [] prop <> nullT) ("theorem " ^
berghofe@13402
   730
          quote name ^ " has no computational content")
berghofe@13732
   731
      in (Reconstruct.reconstruct_proof sign prop prf, vs) end;
berghofe@13402
   732
skalberg@15570
   733
    val defs = Library.foldl (fn (defs, (prf, vs)) =>
berghofe@13732
   734
      fst (extr 0 defs vs [] [] [] prf)) ([], map prep_thm thms);
berghofe@13402
   735
wenzelm@16149
   736
    fun add_def (s, (vs, ((t, u), (prf, _)))) thy =
wenzelm@16458
   737
      (case Sign.const_type thy (extr_name s vs) of
skalberg@15531
   738
         NONE =>
berghofe@13732
   739
           let
berghofe@13732
   740
             val corr_prop = Reconstruct.prop_of prf;
wenzelm@16287
   741
             val ft = Type.freeze t;
wenzelm@16287
   742
             val fu = Type.freeze u;
berghofe@13732
   743
             val thy' = if t = nullt then thy else thy |>
berghofe@13732
   744
               Theory.add_consts_i [(extr_name s vs, fastype_of ft, NoSyn)] |>
berghofe@13732
   745
               fst o PureThy.add_defs_i false [((extr_name s vs ^ "_def",
berghofe@13732
   746
                 Logic.mk_equals (head_of (strip_abs_body fu), ft)), [])];
berghofe@13732
   747
           in
berghofe@13732
   748
             fst (PureThy.store_thm ((corr_name s vs,
berghofe@13732
   749
               Thm.varifyT (funpow (length (term_vars corr_prop))
berghofe@13732
   750
                 (forall_elim_var 0) (forall_intr_frees
berghofe@13732
   751
                   (ProofChecker.thm_of_proof thy'
berghofe@13732
   752
                     (fst (Proofterm.freeze_thaw_prf prf)))))), []) thy')
berghofe@13732
   753
           end
skalberg@15531
   754
       | SOME _ => thy);
berghofe@13402
   755
wenzelm@16149
   756
  in
wenzelm@16149
   757
    thy
wenzelm@16149
   758
    |> Theory.absolute_path
wenzelm@16149
   759
    |> fold_rev add_def defs
wenzelm@16149
   760
    |> Theory.restore_naming thy
berghofe@13402
   761
  end;
berghofe@13402
   762
berghofe@13402
   763
berghofe@13402
   764
(**** interface ****)
berghofe@13402
   765
berghofe@13402
   766
structure P = OuterParse and K = OuterSyntax.Keyword;
berghofe@13402
   767
berghofe@13732
   768
val parse_vars = Scan.optional (P.$$$ "(" |-- P.list1 P.name --| P.$$$ ")") [];
berghofe@13732
   769
berghofe@13402
   770
val realizersP =
berghofe@13402
   771
  OuterSyntax.command "realizers"
berghofe@13402
   772
  "specify realizers for primitive axioms / theorems, together with correctness proof"
berghofe@13402
   773
  K.thy_decl
berghofe@13732
   774
    (Scan.repeat1 (P.xname -- parse_vars --| P.$$$ ":" -- P.string -- P.string) >>
berghofe@13402
   775
     (fn xs => Toplevel.theory (fn thy => add_realizers
berghofe@13402
   776
       (map (fn (((a, vs), s1), s2) =>
wenzelm@16486
   777
         (PureThy.get_thm thy (Name a), (vs, s1, s2))) xs) thy)));
berghofe@13402
   778
berghofe@13402
   779
val realizabilityP =
berghofe@13402
   780
  OuterSyntax.command "realizability"
berghofe@13402
   781
  "add equations characterizing realizability" K.thy_decl
berghofe@13402
   782
  (Scan.repeat1 P.string >> (Toplevel.theory o add_realizes_eqns));
berghofe@13402
   783
berghofe@13402
   784
val typeofP =
berghofe@13402
   785
  OuterSyntax.command "extract_type"
berghofe@13402
   786
  "add equations characterizing type of extracted program" K.thy_decl
berghofe@13402
   787
  (Scan.repeat1 P.string >> (Toplevel.theory o add_typeof_eqns));
berghofe@13402
   788
berghofe@13402
   789
val extractP =
berghofe@13402
   790
  OuterSyntax.command "extract" "extract terms from proofs" K.thy_decl
berghofe@13732
   791
    (Scan.repeat1 (P.xname -- parse_vars) >> (fn xs => Toplevel.theory
wenzelm@16486
   792
      (fn thy => extract (map (apfst (PureThy.get_thm thy o Name)) xs) thy)));
berghofe@13402
   793
wenzelm@15801
   794
val _ = OuterSyntax.add_parsers [realizersP, realizabilityP, typeofP, extractP];
berghofe@13402
   795
wenzelm@16458
   796
val etype_of = etype_of o add_syntax;
berghofe@13714
   797
berghofe@13402
   798
end;