author | haftmann |
Mon, 28 Sep 2009 10:20:21 +0200 | |
changeset 32727 | 9072201cd69d |
parent 32712 | ec5976f4d3d8 |
child 32952 | aeb1e44fbc19 |
permissions | -rw-r--r-- |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
1 |
(* Title: HOL/Tools/datatype_realizer.ML |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
2 |
Author: Stefan Berghofer, TU Muenchen |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
3 |
|
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
4 |
Porgram extraction from proofs involving datatypes: |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
5 |
Realizers for induction and case analysis |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
6 |
*) |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
7 |
|
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
8 |
signature DATATYPE_REALIZER = |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
9 |
sig |
31737 | 10 |
val add_dt_realizers: Datatype.config -> string list -> theory -> theory |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
23590
diff
changeset
|
11 |
val setup: theory -> theory |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
12 |
end; |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
13 |
|
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
14 |
structure DatatypeRealizer : DATATYPE_REALIZER = |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
15 |
struct |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
16 |
|
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
17 |
open DatatypeAux; |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
18 |
|
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
19 |
fun subsets i j = if i <= j then |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
20 |
let val is = subsets (i+1) j |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
21 |
in map (fn ks => i::ks) is @ is end |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
22 |
else [[]]; |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
23 |
|
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
24 |
fun forall_intr_prf (t, prf) = |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
25 |
let val (a, T) = (case t of Var ((a, _), T) => (a, T) | Free p => p) |
15531 | 26 |
in Abst (a, SOME T, Proofterm.prf_abstract_over t prf) end; |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
27 |
|
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
28 |
fun prf_of thm = |
28814 | 29 |
Reconstruct.reconstruct_proof (Thm.theory_of_thm thm) (Thm.prop_of thm) (Thm.proof_of thm); |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
30 |
|
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
31 |
fun prf_subst_vars inst = |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
32 |
Proofterm.map_proof_terms (subst_vars ([], inst)) I; |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
33 |
|
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
34 |
fun is_unit t = snd (strip_type (fastype_of t)) = HOLogic.unitT; |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
35 |
|
13725
12404b452034
Changed format of realizers / correctness proofs.
berghofe
parents:
13708
diff
changeset
|
36 |
fun tname_of (Type (s, _)) = s |
12404b452034
Changed format of realizers / correctness proofs.
berghofe
parents:
13708
diff
changeset
|
37 |
| tname_of _ = ""; |
12404b452034
Changed format of realizers / correctness proofs.
berghofe
parents:
13708
diff
changeset
|
38 |
|
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
39 |
fun mk_realizes T = Const ("realizes", T --> HOLogic.boolT --> HOLogic.boolT); |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
40 |
|
32727 | 41 |
fun make_ind sorts ({descr, rec_names, rec_rewrites, induct, ...} : info) is thy = |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
42 |
let |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
43 |
val recTs = get_rec_types descr sorts; |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
44 |
val pnames = if length descr = 1 then ["P"] |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
45 |
else map (fn i => "P" ^ string_of_int i) (1 upto length descr); |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
46 |
|
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
47 |
val rec_result_Ts = map (fn ((i, _), P) => |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
48 |
if i mem is then TFree ("'" ^ P, HOLogic.typeS) else HOLogic.unitT) |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
49 |
(descr ~~ pnames); |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
50 |
|
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
51 |
fun make_pred i T U r x = |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
52 |
if i mem is then |
15570 | 53 |
Free (List.nth (pnames, i), T --> U --> HOLogic.boolT) $ r $ x |
54 |
else Free (List.nth (pnames, i), U --> HOLogic.boolT) $ x; |
|
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
55 |
|
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
56 |
fun mk_all i s T t = |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
57 |
if i mem is then list_all_free ([(s, T)], t) else t; |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
58 |
|
31458 | 59 |
val (prems, rec_fns) = split_list (flat (fst (fold_map |
60 |
(fn ((i, (_, _, constrs)), T) => fold_map (fn (cname, cargs) => fn j => |
|
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
61 |
let |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
62 |
val Ts = map (typ_of_dtyp descr sorts) cargs; |
20071
8f3e1ddb50e6
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
19806
diff
changeset
|
63 |
val tnames = Name.variant_list pnames (DatatypeProp.make_tnames Ts); |
31458 | 64 |
val recs = filter (is_rec_type o fst o fst) (cargs ~~ tnames ~~ Ts); |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
65 |
val frees = tnames ~~ Ts; |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
66 |
|
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
67 |
fun mk_prems vs [] = |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
68 |
let |
31458 | 69 |
val rT = nth (rec_result_Ts) i; |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
70 |
val vs' = filter_out is_unit vs; |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
71 |
val f = mk_Free "f" (map fastype_of vs' ---> rT) j; |
18929 | 72 |
val f' = Envir.eta_contract (list_abs_free |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
73 |
(map dest_Free vs, if i mem is then list_comb (f, vs') |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
74 |
else HOLogic.unit)); |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
75 |
in (HOLogic.mk_Trueprop (make_pred i rT T (list_comb (f, vs')) |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
76 |
(list_comb (Const (cname, Ts ---> T), map Free frees))), f') |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
77 |
end |
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
13467
diff
changeset
|
78 |
| mk_prems vs (((dt, s), T) :: ds) = |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
79 |
let |
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
13467
diff
changeset
|
80 |
val k = body_index dt; |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
13467
diff
changeset
|
81 |
val (Us, U) = strip_type T; |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
13467
diff
changeset
|
82 |
val i = length Us; |
31458 | 83 |
val rT = nth (rec_result_Ts) k; |
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
13467
diff
changeset
|
84 |
val r = Free ("r" ^ s, Us ---> rT); |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
85 |
val (p, f) = mk_prems (vs @ [r]) ds |
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
13467
diff
changeset
|
86 |
in (mk_all k ("r" ^ s) (Us ---> rT) (Logic.mk_implies |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
13467
diff
changeset
|
87 |
(list_all (map (pair "x") Us, HOLogic.mk_Trueprop |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
13467
diff
changeset
|
88 |
(make_pred k rT U (app_bnds r i) |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
13467
diff
changeset
|
89 |
(app_bnds (Free (s, T)) i))), p)), f) |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
90 |
end |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
91 |
|
31458 | 92 |
in (apfst (curry list_all_free frees) (mk_prems (map Free frees) recs), j + 1) end) |
93 |
constrs) (descr ~~ recTs) 1))); |
|
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
94 |
|
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
95 |
fun mk_proj j [] t = t |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
96 |
| mk_proj j (i :: is) t = if null is then t else |
23577 | 97 |
if (j: int) = i then HOLogic.mk_fst t |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
98 |
else mk_proj j is (HOLogic.mk_snd t); |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
99 |
|
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
100 |
val tnames = DatatypeProp.make_tnames recTs; |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
101 |
val fTs = map fastype_of rec_fns; |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
102 |
val ps = map (fn ((((i, _), T), U), s) => Abs ("x", T, make_pred i U T |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
103 |
(list_comb (Const (s, fTs ---> T --> U), rec_fns) $ Bound 0) (Bound 0))) |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
104 |
(descr ~~ recTs ~~ rec_result_Ts ~~ rec_names); |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
105 |
val r = if null is then Extraction.nullt else |
15570 | 106 |
foldr1 HOLogic.mk_prod (List.mapPartial (fn (((((i, _), T), U), s), tname) => |
15531 | 107 |
if i mem is then SOME |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
108 |
(list_comb (Const (s, fTs ---> T --> U), rec_fns) $ Free (tname, T)) |
15531 | 109 |
else NONE) (descr ~~ recTs ~~ rec_result_Ts ~~ rec_names ~~ tnames)); |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
110 |
val concl = HOLogic.mk_Trueprop (foldr1 (HOLogic.mk_binop "op &") |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
111 |
(map (fn ((((i, _), T), U), tname) => |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
112 |
make_pred i U T (mk_proj i is r) (Free (tname, T))) |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
113 |
(descr ~~ recTs ~~ rec_result_Ts ~~ tnames))); |
22578 | 114 |
val cert = cterm_of thy; |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
115 |
val inst = map (pairself cert) (map head_of (HOLogic.dest_conj |
32712
ec5976f4d3d8
registering split rules and projected induction rules; ML identifiers more close to Isar theorem names
haftmann
parents:
32013
diff
changeset
|
116 |
(HOLogic.dest_Trueprop (concl_of induct))) ~~ ps); |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
117 |
|
17959 | 118 |
val thm = OldGoals.simple_prove_goal_cterm (cert (Logic.list_implies (prems, concl))) |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
119 |
(fn prems => |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
120 |
[rewrite_goals_tac (map mk_meta_eq [fst_conv, snd_conv]), |
32712
ec5976f4d3d8
registering split rules and projected induction rules; ML identifiers more close to Isar theorem names
haftmann
parents:
32013
diff
changeset
|
121 |
rtac (cterm_instantiate inst induct) 1, |
23590
ad95084a5c63
renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents:
23577
diff
changeset
|
122 |
ALLGOALS ObjectLogic.atomize_prems_tac, |
26359 | 123 |
rewrite_goals_tac (@{thm o_def} :: map mk_meta_eq rec_rewrites), |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
124 |
REPEAT ((resolve_tac prems THEN_ALL_NEW (fn i => |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
125 |
REPEAT (etac allE i) THEN atac i)) 1)]); |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
126 |
|
32712
ec5976f4d3d8
registering split rules and projected induction rules; ML identifiers more close to Isar theorem names
haftmann
parents:
32013
diff
changeset
|
127 |
val ind_name = Thm.get_name induct; |
15570 | 128 |
val vs = map (fn i => List.nth (pnames, i)) is; |
18358 | 129 |
val (thm', thy') = thy |
30435
e62d6ecab6ad
explicit Binding.qualified_name -- prevents implicitly qualified bstring;
wenzelm
parents:
30364
diff
changeset
|
130 |
|> Sign.root_path |
e62d6ecab6ad
explicit Binding.qualified_name -- prevents implicitly qualified bstring;
wenzelm
parents:
30364
diff
changeset
|
131 |
|> PureThy.store_thm |
e62d6ecab6ad
explicit Binding.qualified_name -- prevents implicitly qualified bstring;
wenzelm
parents:
30364
diff
changeset
|
132 |
(Binding.qualified_name (space_implode "_" (ind_name :: vs @ ["correctness"])), thm) |
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24711
diff
changeset
|
133 |
||> Sign.restore_naming thy; |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
134 |
|
20286 | 135 |
val ivs = rev (Term.add_vars (Logic.varify (DatatypeProp.make_ind [descr] sorts)) []); |
22691 | 136 |
val rvs = rev (Thm.fold_terms Term.add_vars thm' []); |
13725
12404b452034
Changed format of realizers / correctness proofs.
berghofe
parents:
13708
diff
changeset
|
137 |
val ivs1 = map Var (filter_out (fn (_, T) => |
12404b452034
Changed format of realizers / correctness proofs.
berghofe
parents:
13708
diff
changeset
|
138 |
tname_of (body_type T) mem ["set", "bool"]) ivs); |
17521 | 139 |
val ivs2 = map (fn (ixn, _) => Var (ixn, valOf (AList.lookup (op =) rvs ixn))) ivs; |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
140 |
|
30190 | 141 |
val prf = List.foldr forall_intr_prf |
142 |
(List.foldr (fn ((f, p), prf) => |
|
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
143 |
(case head_of (strip_abs_body f) of |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
144 |
Free (s, T) => |
19806 | 145 |
let val T' = Logic.varifyT T |
15531 | 146 |
in Abst (s, SOME T', Proofterm.prf_abstract_over |
147 |
(Var ((s, 0), T')) (AbsP ("H", SOME p, prf))) |
|
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
148 |
end |
15531 | 149 |
| _ => AbsP ("H", SOME p, prf))) |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
150 |
(Proofterm.proof_combP |
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
151 |
(prf_of thm', map PBound (length prems - 1 downto 0))) (rec_fns ~~ prems_of thm)) ivs2; |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
152 |
|
30190 | 153 |
val r' = if null is then r else Logic.varify (List.foldr (uncurry lambda) |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
154 |
r (map Logic.unvarify ivs1 @ filter_out is_unit |
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
155 |
(map (head_of o strip_abs_body) rec_fns))); |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
156 |
|
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
157 |
in Extraction.add_realizers_i [(ind_name, (vs, r', prf))] thy' end; |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
158 |
|
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
159 |
|
32712
ec5976f4d3d8
registering split rules and projected induction rules; ML identifiers more close to Isar theorem names
haftmann
parents:
32013
diff
changeset
|
160 |
fun make_casedists sorts ({index, descr, case_name, case_rewrites, exhaust, ...} : info) thy = |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
161 |
let |
19806 | 162 |
val cert = cterm_of thy; |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
163 |
val rT = TFree ("'P", HOLogic.typeS); |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
164 |
val rT' = TVar (("'P", 0), HOLogic.typeS); |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
165 |
|
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
166 |
fun make_casedist_prem T (cname, cargs) = |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
167 |
let |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
168 |
val Ts = map (typ_of_dtyp descr sorts) cargs; |
20071
8f3e1ddb50e6
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
19806
diff
changeset
|
169 |
val frees = Name.variant_list ["P", "y"] (DatatypeProp.make_tnames Ts) ~~ Ts; |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
170 |
val free_ts = map Free frees; |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30280
diff
changeset
|
171 |
val r = Free ("r" ^ Long_Name.base_name cname, Ts ---> rT) |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
172 |
in (r, list_all_free (frees, Logic.mk_implies (HOLogic.mk_Trueprop |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
173 |
(HOLogic.mk_eq (Free ("y", T), list_comb (Const (cname, Ts ---> T), free_ts))), |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
174 |
HOLogic.mk_Trueprop (Free ("P", rT --> HOLogic.boolT) $ |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
175 |
list_comb (r, free_ts))))) |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
176 |
end; |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
177 |
|
17521 | 178 |
val SOME (_, _, constrs) = AList.lookup (op =) descr index; |
15570 | 179 |
val T = List.nth (get_rec_types descr sorts, index); |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
180 |
val (rs, prems) = split_list (map (make_casedist_prem T) constrs); |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
181 |
val r = Const (case_name, map fastype_of rs ---> T --> rT); |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
182 |
|
32013 | 183 |
val y = Var (("y", 0), Logic.varifyT T); |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
184 |
val y' = Free ("y", T); |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
185 |
|
17959 | 186 |
val thm = OldGoals.prove_goalw_cterm [] (cert (Logic.list_implies (prems, |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
187 |
HOLogic.mk_Trueprop (Free ("P", rT --> HOLogic.boolT) $ |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
188 |
list_comb (r, rs @ [y']))))) |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
189 |
(fn prems => |
32712
ec5976f4d3d8
registering split rules and projected induction rules; ML identifiers more close to Isar theorem names
haftmann
parents:
32013
diff
changeset
|
190 |
[rtac (cterm_instantiate [(cert y, cert y')] exhaust) 1, |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
191 |
ALLGOALS (EVERY' |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
192 |
[asm_simp_tac (HOL_basic_ss addsimps case_rewrites), |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
193 |
resolve_tac prems, asm_simp_tac HOL_basic_ss])]); |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
194 |
|
32712
ec5976f4d3d8
registering split rules and projected induction rules; ML identifiers more close to Isar theorem names
haftmann
parents:
32013
diff
changeset
|
195 |
val exh_name = Thm.get_name exhaust; |
18358 | 196 |
val (thm', thy') = thy |
30435
e62d6ecab6ad
explicit Binding.qualified_name -- prevents implicitly qualified bstring;
wenzelm
parents:
30364
diff
changeset
|
197 |
|> Sign.root_path |
e62d6ecab6ad
explicit Binding.qualified_name -- prevents implicitly qualified bstring;
wenzelm
parents:
30364
diff
changeset
|
198 |
|> PureThy.store_thm (Binding.qualified_name (exh_name ^ "_P_correctness"), thm) |
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24711
diff
changeset
|
199 |
||> Sign.restore_naming thy; |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
200 |
|
13725
12404b452034
Changed format of realizers / correctness proofs.
berghofe
parents:
13708
diff
changeset
|
201 |
val P = Var (("P", 0), rT' --> HOLogic.boolT); |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
202 |
val prf = forall_intr_prf (y, forall_intr_prf (P, |
30190 | 203 |
List.foldr (fn ((p, r), prf) => |
32013 | 204 |
forall_intr_prf (Logic.varify r, AbsP ("H", SOME (Logic.varify p), |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
205 |
prf))) (Proofterm.proof_combP (prf_of thm', |
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
206 |
map PBound (length prems - 1 downto 0))) (prems ~~ rs))); |
32013 | 207 |
val r' = Logic.varify (Abs ("y", T, |
13725
12404b452034
Changed format of realizers / correctness proofs.
berghofe
parents:
13708
diff
changeset
|
208 |
list_abs (map dest_Free rs, list_comb (r, |
12404b452034
Changed format of realizers / correctness proofs.
berghofe
parents:
13708
diff
changeset
|
209 |
map Bound ((length rs - 1 downto 0) @ [length rs]))))); |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
210 |
|
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
211 |
in Extraction.add_realizers_i |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
212 |
[(exh_name, (["P"], r', prf)), |
32712
ec5976f4d3d8
registering split rules and projected induction rules; ML identifiers more close to Isar theorem names
haftmann
parents:
32013
diff
changeset
|
213 |
(exh_name, ([], Extraction.nullt, prf_of exhaust))] thy' |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
214 |
end; |
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
215 |
|
31668
a616e56a5ec8
datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents:
31604
diff
changeset
|
216 |
fun add_dt_realizers config names thy = |
25223 | 217 |
if ! Proofterm.proofs < 2 then thy |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
23590
diff
changeset
|
218 |
else let |
31668
a616e56a5ec8
datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents:
31604
diff
changeset
|
219 |
val _ = message config "Adding realizers for induction and case analysis ..." |
31784 | 220 |
val infos = map (Datatype.the_info thy) names; |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
23590
diff
changeset
|
221 |
val info :: _ = infos; |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
23590
diff
changeset
|
222 |
in |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
23590
diff
changeset
|
223 |
thy |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
23590
diff
changeset
|
224 |
|> fold_rev (make_ind (#sorts info) info) (subsets 0 (length (#descr info) - 1)) |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
23590
diff
changeset
|
225 |
|> fold_rev (make_casedists (#sorts info)) infos |
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
23590
diff
changeset
|
226 |
end; |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
227 |
|
31723
f5cafe803b55
discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents:
31668
diff
changeset
|
228 |
val setup = Datatype.interpretation add_dt_realizers; |
13467
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
229 |
|
d66b526192bf
Module for defining realizers for induction and case analysis theorems
berghofe
parents:
diff
changeset
|
230 |
end; |