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