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