author | wenzelm |
Sun, 15 Mar 2009 15:59:44 +0100 | |
changeset 30528 | 7173bf123335 |
parent 30435 | e62d6ecab6ad |
child 30722 | 623d4831c8cf |
permissions | -rw-r--r-- |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
1 |
(* Title: HOL/Tools/inductive_realizer.ML |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
2 |
Author: Stefan Berghofer, TU Muenchen |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
3 |
|
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
4 |
Porgram extraction from proofs involving inductive predicates: |
29265
5b4247055bd7
moved old add_term_vars, add_term_frees etc. to structure OldTerm;
wenzelm
parents:
28965
diff
changeset
|
5 |
Realizers for induction and elimination rules. |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
6 |
*) |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
7 |
|
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
8 |
signature INDUCTIVE_REALIZER = |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
9 |
sig |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
10 |
val add_ind_realizers: string -> string list -> theory -> theory |
18708 | 11 |
val setup: theory -> theory |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
12 |
end; |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
13 |
|
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
14 |
structure InductiveRealizer : INDUCTIVE_REALIZER = |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
15 |
struct |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
16 |
|
28800 | 17 |
(* FIXME: LocalTheory.note should return theorems with proper names! *) (* FIXME ?? *) |
22606
962f824c2df9
- Tried to make name_of_thm more robust against changes of the
berghofe
parents:
22596
diff
changeset
|
18 |
fun name_of_thm thm = |
28800 | 19 |
(case Proofterm.fold_proof_atoms false (fn PThm (_, ((name, _, _), _)) => cons name | _ => I) |
28814 | 20 |
[Thm.proof_of thm] [] of |
28800 | 21 |
[name] => name |
22 |
| _ => error ("name_of_thm: bad proof of theorem\n" ^ Display.string_of_thm thm)); |
|
22271 | 23 |
|
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
24 |
val all_simps = map (symmetric o mk_meta_eq) (thms "HOL.all_simps"); |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
25 |
|
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
26 |
fun prf_of thm = |
26626
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26535
diff
changeset
|
27 |
let |
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26535
diff
changeset
|
28 |
val thy = Thm.theory_of_thm thm; |
28814 | 29 |
val thm' = Reconstruct.reconstruct_proof thy (Thm.prop_of thm) (Thm.proof_of thm); |
26626
c6231d64d264
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26535
diff
changeset
|
30 |
in Reconstruct.expand_proof thy [("", NONE)] thm' end; (* FIXME *) |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
31 |
|
27330 | 32 |
fun forall_intr_prf t prf = |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
33 |
let val (a, T) = (case t of Var ((a, _), T) => (a, T) | Free p => p) |
15531 | 34 |
in Abst (a, SOME T, Proofterm.prf_abstract_over t prf) end; |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
35 |
|
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
36 |
fun subsets [] = [[]] |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
37 |
| subsets (x::xs) = |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
38 |
let val ys = subsets xs |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
39 |
in ys @ map (cons x) ys end; |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
40 |
|
22271 | 41 |
val pred_of = fst o dest_Const o head_of; |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
42 |
|
22271 | 43 |
fun strip_all' used names (Const ("all", _) $ Abs (s, T, t)) = |
44 |
let val (s', names') = (case names of |
|
45 |
[] => (Name.variant used s, []) |
|
46 |
| name :: names' => (name, names')) |
|
47 |
in strip_all' (s'::used) names' (subst_bound (Free (s', T), t)) end |
|
48 |
| strip_all' used names ((t as Const ("==>", _) $ P) $ Q) = |
|
49 |
t $ strip_all' used names Q |
|
50 |
| strip_all' _ _ t = t; |
|
51 |
||
29281 | 52 |
fun strip_all t = strip_all' (Term.add_free_names t []) [] t; |
22271 | 53 |
|
54 |
fun strip_one name (Const ("all", _) $ Abs (s, T, Const ("==>", _) $ P $ Q)) = |
|
55 |
(subst_bound (Free (name, T), P), subst_bound (Free (name, T), Q)) |
|
56 |
| strip_one _ (Const ("==>", _) $ P $ Q) = (P, Q); |
|
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
57 |
|
30190 | 58 |
fun relevant_vars prop = List.foldr (fn |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
59 |
(Var ((a, i), T), vs) => (case strip_type T of |
22271 | 60 |
(_, Type (s, _)) => if s mem ["bool"] then (a, T) :: vs else vs |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
61 |
| _ => vs) |
29265
5b4247055bd7
moved old add_term_vars, add_term_frees etc. to structure OldTerm;
wenzelm
parents:
28965
diff
changeset
|
62 |
| (_, vs) => vs) [] (OldTerm.term_vars prop); |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
63 |
|
22271 | 64 |
fun dt_of_intrs thy vs nparms intrs = |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
65 |
let |
29271
1d685baea08e
moved old add_type_XXX, add_term_XXX etc. to structure OldTerm;
wenzelm
parents:
29265
diff
changeset
|
66 |
val iTs = OldTerm.term_tvars (prop_of (hd intrs)); |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
67 |
val Tvs = map TVar iTs; |
22271 | 68 |
val (Const (s, _), ts) = strip_comb (HOLogic.dest_Trueprop |
69 |
(Logic.strip_imp_concl (prop_of (hd intrs)))); |
|
70 |
val params = map dest_Var (Library.take (nparms, ts)); |
|
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
71 |
val tname = Binding.name (space_implode "_" (Long_Name.base_name s ^ "T" :: vs)); |
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
72 |
fun constr_of_intr intr = (Binding.name (Long_Name.base_name (name_of_thm intr)), |
19806 | 73 |
map (Logic.unvarifyT o snd) (rev (Term.add_vars (prop_of intr) []) \\ params) @ |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
74 |
filter_out (equal Extraction.nullT) (map |
19806 | 75 |
(Logic.unvarifyT o Extraction.etype_of thy vs []) (prems_of intr)), |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
76 |
NoSyn); |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
77 |
in (map (fn a => "'" ^ a) vs @ map (fst o fst) iTs, tname, NoSyn, |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
78 |
map constr_of_intr intrs) |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
79 |
end; |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
80 |
|
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
81 |
fun mk_rlz T = Const ("realizes", [T, HOLogic.boolT] ---> HOLogic.boolT); |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
82 |
|
22271 | 83 |
(** turn "P" into "%r x. realizes r (P x)" **) |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
84 |
|
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
85 |
fun gen_rvar vs (t as Var ((a, 0), T)) = |
22271 | 86 |
if body_type T <> HOLogic.boolT then t else |
87 |
let |
|
88 |
val U = TVar (("'" ^ a, 0), HOLogic.typeS) |
|
89 |
val Ts = binder_types T; |
|
90 |
val i = length Ts; |
|
91 |
val xs = map (pair "x") Ts; |
|
92 |
val u = list_comb (t, map Bound (i - 1 downto 0)) |
|
93 |
in |
|
94 |
if a mem vs then |
|
95 |
list_abs (("r", U) :: xs, mk_rlz U $ Bound i $ u) |
|
96 |
else list_abs (xs, mk_rlz Extraction.nullT $ Extraction.nullt $ u) |
|
97 |
end |
|
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
98 |
| gen_rvar _ t = t; |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
99 |
|
22271 | 100 |
fun mk_realizes_eqn n vs nparms intrs = |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
101 |
let |
22271 | 102 |
val concl = HOLogic.dest_Trueprop (concl_of (hd intrs)); |
29271
1d685baea08e
moved old add_type_XXX, add_term_XXX etc. to structure OldTerm;
wenzelm
parents:
29265
diff
changeset
|
103 |
val iTs = OldTerm.term_tvars concl; |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
104 |
val Tvs = map TVar iTs; |
22271 | 105 |
val (h as Const (s, T), us) = strip_comb concl; |
106 |
val params = List.take (us, nparms); |
|
107 |
val elTs = List.drop (binder_types T, nparms); |
|
108 |
val predT = elTs ---> HOLogic.boolT; |
|
109 |
val used = map (fst o fst o dest_Var) params; |
|
110 |
val xs = map (Var o apfst (rpair 0)) |
|
111 |
(Name.variant_list used (replicate (length elTs) "x") ~~ elTs); |
|
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
112 |
val rT = if n then Extraction.nullT |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
113 |
else Type (space_implode "_" (s ^ "T" :: vs), |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
114 |
map (fn a => TVar (("'" ^ a, 0), HOLogic.typeS)) vs @ Tvs); |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
115 |
val r = if n then Extraction.nullt else Var ((Long_Name.base_name s, 0), rT); |
22271 | 116 |
val S = list_comb (h, params @ xs); |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
117 |
val rvs = relevant_vars S; |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
118 |
val vs' = map fst rvs \\ vs; |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
119 |
val rname = space_implode "_" (s ^ "R" :: vs); |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
120 |
|
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
121 |
fun mk_Tprem n v = |
17485 | 122 |
let val T = (the o AList.lookup (op =) rvs) v |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
123 |
in (Const ("typeof", T --> Type ("Type", [])) $ Var ((v, 0), T), |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
124 |
Extraction.mk_typ (if n then Extraction.nullT |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
125 |
else TVar (("'" ^ v, 0), HOLogic.typeS))) |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
126 |
end; |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
127 |
|
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
128 |
val prems = map (mk_Tprem true) vs' @ map (mk_Tprem false) vs; |
22271 | 129 |
val ts = map (gen_rvar vs) params; |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
130 |
val argTs = map fastype_of ts; |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
131 |
|
22271 | 132 |
in ((prems, (Const ("typeof", HOLogic.boolT --> Type ("Type", [])) $ S, |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
133 |
Extraction.mk_typ rT)), |
22271 | 134 |
(prems, (mk_rlz rT $ r $ S, |
135 |
if n then list_comb (Const (rname, argTs ---> predT), ts @ xs) |
|
136 |
else list_comb (Const (rname, argTs @ [rT] ---> predT), ts @ [r] @ xs)))) |
|
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
137 |
end; |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
138 |
|
22271 | 139 |
fun fun_of_prem thy rsets vs params rule ivs intr = |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
140 |
let |
22271 | 141 |
val ctxt = ProofContext.init thy |
142 |
val args = map (Free o apfst fst o dest_Var) ivs; |
|
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
143 |
val args' = map (Free o apfst fst) |
16861 | 144 |
(Term.add_vars (prop_of intr) [] \\ params); |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
145 |
val rule' = strip_all rule; |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
146 |
val conclT = Extraction.etype_of thy vs [] (Logic.strip_imp_concl rule'); |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
147 |
val used = map (fst o dest_Free) args; |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
148 |
|
29271
1d685baea08e
moved old add_type_XXX, add_term_XXX etc. to structure OldTerm;
wenzelm
parents:
29265
diff
changeset
|
149 |
val is_rec = exists_Const (fn (c, _) => member (op =) rsets c); |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
150 |
|
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
151 |
fun is_meta (Const ("all", _) $ Abs (s, _, P)) = is_meta P |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
152 |
| is_meta (Const ("==>", _) $ _ $ Q) = is_meta Q |
22271 | 153 |
| is_meta (Const ("Trueprop", _) $ t) = (case head_of t of |
154 |
Const (s, _) => can (InductivePackage.the_inductive ctxt) s |
|
155 |
| _ => true) |
|
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
156 |
| is_meta _ = false; |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
157 |
|
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
158 |
fun fun_of ts rts args used (prem :: prems) = |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
159 |
let |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
160 |
val T = Extraction.etype_of thy vs [] prem; |
20071
8f3e1ddb50e6
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
19806
diff
changeset
|
161 |
val [x, r] = Name.variant_list used ["x", "r"] |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
162 |
in if T = Extraction.nullT |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
163 |
then fun_of ts rts args used prems |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
164 |
else if is_rec prem then |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
165 |
if is_meta prem then |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
166 |
let |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
167 |
val prem' :: prems' = prems; |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
168 |
val U = Extraction.etype_of thy vs [] prem'; |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
169 |
in if U = Extraction.nullT |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
170 |
then fun_of (Free (x, T) :: ts) |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
171 |
(Free (r, binder_types T ---> HOLogic.unitT) :: rts) |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
172 |
(Free (x, T) :: args) (x :: r :: used) prems' |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
173 |
else fun_of (Free (x, T) :: ts) (Free (r, U) :: rts) |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
174 |
(Free (r, U) :: Free (x, T) :: args) (x :: r :: used) prems' |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
175 |
end |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
176 |
else (case strip_type T of |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
177 |
(Ts, Type ("*", [T1, T2])) => |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
178 |
let |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
179 |
val fx = Free (x, Ts ---> T1); |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
180 |
val fr = Free (r, Ts ---> T2); |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
181 |
val bs = map Bound (length Ts - 1 downto 0); |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
182 |
val t = list_abs (map (pair "z") Ts, |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
183 |
HOLogic.mk_prod (list_comb (fx, bs), list_comb (fr, bs))) |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
184 |
in fun_of (fx :: ts) (fr :: rts) (t::args) |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
185 |
(x :: r :: used) prems |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
186 |
end |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
187 |
| (Ts, U) => fun_of (Free (x, T) :: ts) |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
188 |
(Free (r, binder_types T ---> HOLogic.unitT) :: rts) |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
189 |
(Free (x, T) :: args) (x :: r :: used) prems) |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
190 |
else fun_of (Free (x, T) :: ts) rts (Free (x, T) :: args) |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
191 |
(x :: used) prems |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
192 |
end |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
193 |
| fun_of ts rts args used [] = |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
194 |
let val xs = rev (rts @ ts) |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
195 |
in if conclT = Extraction.nullT |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
196 |
then list_abs_free (map dest_Free xs, HOLogic.unit) |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
197 |
else list_abs_free (map dest_Free xs, list_comb |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
198 |
(Free ("r" ^ Long_Name.base_name (name_of_thm intr), |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
199 |
map fastype_of (rev args) ---> conclT), rev args)) |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
200 |
end |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
201 |
|
13921
69c627b6b28d
Fixed problem in add_elim_realizer which caused bound variables to
berghofe
parents:
13725
diff
changeset
|
202 |
in fun_of args' [] (rev args) used (Logic.strip_imp_prems rule') end; |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
203 |
|
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
204 |
fun indrule_realizer thy induct raw_induct rsets params vs rec_names rss intrs dummies = |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
205 |
let |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
206 |
val concls = HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of raw_induct)); |
15570 | 207 |
val premss = List.mapPartial (fn (s, rs) => if s mem rsets then |
22271 | 208 |
SOME (rs, map (fn (_, r) => List.nth (prems_of raw_induct, |
15570 | 209 |
find_index_eq (prop_of r) (map prop_of intrs))) rs) else NONE) rss; |
22271 | 210 |
val fs = maps (fn ((intrs, prems), dummy) => |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
211 |
let |
22271 | 212 |
val fs = map (fn (rule, (ivs, intr)) => |
213 |
fun_of_prem thy rsets vs params rule ivs intr) (prems ~~ intrs) |
|
27982 | 214 |
in if dummy then Const ("HOL.default_class.default", |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
215 |
HOLogic.unitT --> body_type (fastype_of (hd fs))) :: fs |
22271 | 216 |
else fs |
217 |
end) (premss ~~ dummies); |
|
16861 | 218 |
val frees = fold Term.add_frees fs []; |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
219 |
val Ts = map fastype_of fs; |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
220 |
fun name_of_fn intr = "r" ^ Long_Name.base_name (name_of_thm intr) |
22271 | 221 |
in |
222 |
fst (fold_map (fn concl => fn names => |
|
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
223 |
let val T = Extraction.etype_of thy vs [] concl |
22271 | 224 |
in if T = Extraction.nullT then (Extraction.nullt, names) else |
225 |
let |
|
226 |
val Type ("fun", [U, _]) = T; |
|
227 |
val a :: names' = names |
|
228 |
in (list_abs_free (("x", U) :: List.mapPartial (fn intr => |
|
229 |
Option.map (pair (name_of_fn intr)) |
|
230 |
(AList.lookup (op =) frees (name_of_fn intr))) intrs, |
|
231 |
list_comb (Const (a, Ts ---> T), fs) $ Free ("x", U)), names') |
|
232 |
end |
|
233 |
end) concls rec_names) |
|
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
234 |
end; |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
235 |
|
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
236 |
fun add_dummy name dname (x as (_, (vs, s, mfx, cs))) = |
30345 | 237 |
if Binding.eq_name (name, s) then (true, (vs, s, mfx, (dname, [HOLogic.unitT], NoSyn) :: cs)) |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
238 |
else x; |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
239 |
|
18314 | 240 |
fun add_dummies f [] _ thy = |
241 |
(([], NONE), thy) |
|
242 |
| add_dummies f dts used thy = |
|
243 |
thy |
|
244 |
|> f (map snd dts) |
|
30345 | 245 |
|-> (fn dtinfo => pair (map fst dts, SOME dtinfo)) |
18314 | 246 |
handle DatatypeAux.Datatype_Empty name' => |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
247 |
let |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
248 |
val name = Long_Name.base_name name'; |
30345 | 249 |
val dname = Name.variant used "Dummy"; |
18314 | 250 |
in |
251 |
thy |
|
30345 | 252 |
|> add_dummies f (map (add_dummy (Binding.name name) (Binding.name dname)) dts) (dname :: used) |
14888
99ac3eb0f84e
add_dummies no longer uses transform_error but handles specific
berghofe
parents:
13928
diff
changeset
|
253 |
end; |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
254 |
|
22271 | 255 |
fun mk_realizer thy vs (name, rule, rrule, rlz, rt) = |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
256 |
let |
13725
12404b452034
Changed format of realizers / correctness proofs.
berghofe
parents:
13710
diff
changeset
|
257 |
val rvs = map fst (relevant_vars (prop_of rule)); |
16861 | 258 |
val xs = rev (Term.add_vars (prop_of rule) []); |
13725
12404b452034
Changed format of realizers / correctness proofs.
berghofe
parents:
13710
diff
changeset
|
259 |
val vs1 = map Var (filter_out (fn ((a, _), _) => a mem rvs) xs); |
16861 | 260 |
val rlzvs = rev (Term.add_vars (prop_of rrule) []); |
17485 | 261 |
val vs2 = map (fn (ixn, _) => Var (ixn, (the o AList.lookup (op =) rlzvs) ixn)) xs; |
22271 | 262 |
val rs = map Var (subtract (op = o pairself fst) xs rlzvs); |
27330 | 263 |
val rlz' = fold_rev Logic.all (vs2 @ rs) (prop_of rrule); |
264 |
val rlz'' = fold_rev Logic.all vs2 rlz |
|
22271 | 265 |
in (name, (vs, |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
266 |
if rt = Extraction.nullt then rt else |
30190 | 267 |
List.foldr (uncurry lambda) rt vs1, |
22271 | 268 |
ProofRewriteRules.un_hhf_proof rlz' rlz'' |
27330 | 269 |
(fold_rev forall_intr_prf (vs2 @ rs) (prf_of rrule)))) |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
270 |
end; |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
271 |
|
24157
409cd6eaa7ea
Added renaming function to prevent correctness proof for realizer
berghofe
parents:
23590
diff
changeset
|
272 |
fun rename tab = map (fn x => the_default x (AList.lookup op = tab x)); |
409cd6eaa7ea
Added renaming function to prevent correctness proof for realizer
berghofe
parents:
23590
diff
changeset
|
273 |
|
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
274 |
fun add_ind_realizer rsets intrs induct raw_induct elims (thy, vs) = |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
275 |
let |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
276 |
val qualifier = Long_Name.qualifier (name_of_thm induct); |
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
277 |
val inducts = PureThy.get_thms thy (Long_Name.qualify qualifier "inducts"); |
29271
1d685baea08e
moved old add_type_XXX, add_term_XXX etc. to structure OldTerm;
wenzelm
parents:
29265
diff
changeset
|
278 |
val iTs = OldTerm.term_tvars (prop_of (hd intrs)); |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
279 |
val ar = length vs + length iTs; |
22790
e1cff9268177
Moved functions infer_intro_vars, arities_of, params_of, and
berghofe
parents:
22606
diff
changeset
|
280 |
val params = InductivePackage.params_of raw_induct; |
e1cff9268177
Moved functions infer_intro_vars, arities_of, params_of, and
berghofe
parents:
22606
diff
changeset
|
281 |
val arities = InductivePackage.arities_of raw_induct; |
22271 | 282 |
val nparms = length params; |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
283 |
val params' = map dest_Var params; |
22790
e1cff9268177
Moved functions infer_intro_vars, arities_of, params_of, and
berghofe
parents:
22606
diff
changeset
|
284 |
val rss = InductivePackage.partition_rules raw_induct intrs; |
22271 | 285 |
val rss' = map (fn (((s, rs), (_, arity)), elim) => |
22790
e1cff9268177
Moved functions infer_intro_vars, arities_of, params_of, and
berghofe
parents:
22606
diff
changeset
|
286 |
(s, (InductivePackage.infer_intro_vars elim arity rs ~~ rs))) |
e1cff9268177
Moved functions infer_intro_vars, arities_of, params_of, and
berghofe
parents:
22606
diff
changeset
|
287 |
(rss ~~ arities ~~ elims); |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
288 |
val (prfx, _) = split_last (Long_Name.explode (fst (hd rss))); |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
289 |
val tnames = map (fn s => space_implode "_" (s ^ "T" :: vs)) rsets; |
16123 | 290 |
|
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
291 |
val thy1 = thy |> |
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24157
diff
changeset
|
292 |
Sign.root_path |> |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
293 |
Sign.add_path (Long_Name.implode prfx); |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
294 |
val (ty_eqs, rlz_eqs) = split_list |
22271 | 295 |
(map (fn (s, rs) => mk_realizes_eqn (not (s mem rsets)) vs nparms rs) rss); |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
296 |
|
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
297 |
val thy1' = thy1 |> |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
298 |
Theory.copy |> |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
299 |
Sign.add_types (map (fn s => (Binding.name (Long_Name.base_name s), ar, NoSyn)) tnames) |> |
24926
bcb6b098df11
AxClass.axiomatize: renamed XXX_i to XXX, and XXX to XXX_cmd;
wenzelm
parents:
24816
diff
changeset
|
300 |
fold (fn s => AxClass.axiomatize_arity |
19510 | 301 |
(s, replicate ar HOLogic.typeS, HOLogic.typeS)) tnames |> |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
302 |
Extraction.add_typeof_eqns_i ty_eqs; |
15570 | 303 |
val dts = List.mapPartial (fn (s, rs) => if s mem rsets then |
22271 | 304 |
SOME (dt_of_intrs thy1' vs nparms rs) else NONE) rss; |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
305 |
|
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
306 |
(** datatype representing computational content of inductive set **) |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
307 |
|
18314 | 308 |
val ((dummies, dt_info), thy2) = |
18008 | 309 |
thy1 |
18314 | 310 |
|> add_dummies |
30345 | 311 |
(DatatypePackage.add_datatype false false (map (Binding.name_of o #2) dts)) |
18314 | 312 |
(map (pair false) dts) [] |
313 |
||> Extraction.add_typeof_eqns_i ty_eqs |
|
314 |
||> Extraction.add_realizes_eqns_i rlz_eqs; |
|
315 |
fun get f = (these oo Option.map) f; |
|
19046
bc5c6c9b114e
removed distinct, renamed gen_distinct to distinct;
wenzelm
parents:
18929
diff
changeset
|
316 |
val rec_names = distinct (op =) (map (fst o dest_Const o head_of o fst o |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
317 |
HOLogic.dest_eq o HOLogic.dest_Trueprop o prop_of) (get #rec_thms dt_info)); |
30190 | 318 |
val (_, constrss) = Library.foldl_map (fn ((recs, dummies), (s, rs)) => |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
319 |
if s mem rsets then |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
320 |
let |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
321 |
val (d :: dummies') = dummies; |
19473 | 322 |
val (recs1, recs2) = chop (length rs) (if d then tl recs else recs) |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
323 |
in ((recs2, dummies'), map (head_of o hd o rev o snd o strip_comb o |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
324 |
fst o HOLogic.dest_eq o HOLogic.dest_Trueprop o prop_of) recs1) |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
325 |
end |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
326 |
else ((recs, dummies), replicate (length rs) Extraction.nullt)) |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
327 |
((get #rec_thms dt_info, dummies), rss); |
18929 | 328 |
val rintrs = map (fn (intr, c) => Envir.eta_contract |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
329 |
(Extraction.realizes_of thy2 vs |
22271 | 330 |
(if c = Extraction.nullt then c else list_comb (c, map Var (rev |
331 |
(Term.add_vars (prop_of intr) []) \\ params'))) (prop_of intr))) |
|
332 |
(maps snd rss ~~ List.concat constrss); |
|
30345 | 333 |
val (rlzpreds, rlzpreds') = |
334 |
rintrs |> map (fn rintr => |
|
22271 | 335 |
let |
30345 | 336 |
val Const (s, T) = head_of (HOLogic.dest_Trueprop (Logic.strip_assums_concl rintr)); |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
337 |
val s' = Long_Name.base_name s; |
30345 | 338 |
val T' = Logic.unvarifyT T; |
339 |
in (((s', T'), NoSyn), (Const (s, T'), Free (s', T'))) end) |
|
340 |
|> distinct (op = o pairself (#1 o #1)) |
|
341 |
|> map (apfst (apfst (apfst Binding.name))) |
|
342 |
|> split_list; |
|
343 |
||
24746
6d42be359d57
Adapted to changes in interface of add_inductive_i.
berghofe
parents:
24712
diff
changeset
|
344 |
val rlzparams = map (fn Var ((s, _), T) => (s, Logic.unvarifyT T)) |
22271 | 345 |
(List.take (snd (strip_comb |
346 |
(HOLogic.dest_Trueprop (Logic.strip_assums_concl (hd rintrs)))), nparms)); |
|
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
347 |
|
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
348 |
(** realizability predicate **) |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
349 |
|
22271 | 350 |
val (ind_info, thy3') = thy2 |> |
26128 | 351 |
InductivePackage.add_inductive_global (serial_string ()) |
28965 | 352 |
{quiet_mode = false, verbose = false, kind = Thm.theoremK, alt_name = Binding.empty, |
29389 | 353 |
coind = false, no_elim = false, no_ind = false, skip_mono = false, fork_mono = false} |
22271 | 354 |
rlzpreds rlzparams (map (fn (rintr, intr) => |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
355 |
((Binding.name (Long_Name.base_name (name_of_thm intr)), []), |
22271 | 356 |
subst_atomic rlzpreds' (Logic.unvarify rintr))) |
357 |
(rintrs ~~ maps snd rss)) [] ||> |
|
30435
e62d6ecab6ad
explicit Binding.qualified_name -- prevents implicitly qualified bstring;
wenzelm
parents:
30364
diff
changeset
|
358 |
Sign.root_path; |
26663 | 359 |
val thy3 = fold (PureThy.hide_fact false o name_of_thm) (#intrs ind_info) thy3'; |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
360 |
|
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
361 |
(** realizer for induction rule **) |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
362 |
|
22271 | 363 |
val Ps = List.mapPartial (fn _ $ M $ P => if pred_of M mem rsets then |
15531 | 364 |
SOME (fst (fst (dest_Var (head_of P)))) else NONE) |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
365 |
(HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of raw_induct))); |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
366 |
|
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
367 |
fun add_ind_realizer (thy, Ps) = |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
368 |
let |
24157
409cd6eaa7ea
Added renaming function to prevent correctness proof for realizer
berghofe
parents:
23590
diff
changeset
|
369 |
val vs' = rename (map (pairself (fst o fst o dest_Var)) |
409cd6eaa7ea
Added renaming function to prevent correctness proof for realizer
berghofe
parents:
23590
diff
changeset
|
370 |
(params ~~ List.take (snd (strip_comb (HOLogic.dest_Trueprop |
409cd6eaa7ea
Added renaming function to prevent correctness proof for realizer
berghofe
parents:
23590
diff
changeset
|
371 |
(hd (prems_of (hd inducts))))), nparms))) vs; |
22271 | 372 |
val rs = indrule_realizer thy induct raw_induct rsets params' |
24157
409cd6eaa7ea
Added renaming function to prevent correctness proof for realizer
berghofe
parents:
23590
diff
changeset
|
373 |
(vs' @ Ps) rec_names rss' intrs dummies; |
409cd6eaa7ea
Added renaming function to prevent correctness proof for realizer
berghofe
parents:
23590
diff
changeset
|
374 |
val rlzs = map (fn (r, ind) => Extraction.realizes_of thy (vs' @ Ps) r |
22271 | 375 |
(prop_of ind)) (rs ~~ inducts); |
29281 | 376 |
val used = fold Term.add_free_names rlzs []; |
22271 | 377 |
val rnames = Name.variant_list used (replicate (length inducts) "r"); |
378 |
val rnames' = Name.variant_list |
|
379 |
(used @ rnames) (replicate (length intrs) "s"); |
|
380 |
val rlzs' as (prems, _, _) :: _ = map (fn (rlz, name) => |
|
381 |
let |
|
382 |
val (P, Q) = strip_one name (Logic.unvarify rlz); |
|
383 |
val Q' = strip_all' [] rnames' Q |
|
384 |
in |
|
385 |
(Logic.strip_imp_prems Q', P, Logic.strip_imp_concl Q') |
|
386 |
end) (rlzs ~~ rnames); |
|
387 |
val concl = HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj (map |
|
388 |
(fn (_, _ $ P, _ $ Q) => HOLogic.mk_imp (P, Q)) rlzs')); |
|
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
389 |
val rews = map mk_meta_eq |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
390 |
(fst_conv :: snd_conv :: get #rec_thms dt_info); |
26711 | 391 |
val thm = Goal.prove_global thy [] prems concl (fn {prems, ...} => EVERY |
22271 | 392 |
[rtac (#raw_induct ind_info) 1, |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
393 |
rewrite_goals_tac rews, |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
394 |
REPEAT ((resolve_tac prems THEN_ALL_NEW EVERY' |
23590
ad95084a5c63
renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents:
23577
diff
changeset
|
395 |
[K (rewrite_goals_tac rews), ObjectLogic.atomize_prems_tac, |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
396 |
DEPTH_SOLVE_1 o FIRST' [atac, etac allE, etac impE]]) 1)]); |
30435
e62d6ecab6ad
explicit Binding.qualified_name -- prevents implicitly qualified bstring;
wenzelm
parents:
30364
diff
changeset
|
397 |
val (thm', thy') = PureThy.store_thm (Binding.qualified_name (space_implode "_" |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
398 |
(Long_Name.qualify qualifier "induct" :: vs' @ Ps @ ["correctness"])), thm) thy; |
22271 | 399 |
val thms = map (fn th => zero_var_indexes (rotate_prems ~1 (th RS mp))) |
400 |
(DatatypeAux.split_conj_thm thm'); |
|
401 |
val ([thms'], thy'') = PureThy.add_thmss |
|
30435
e62d6ecab6ad
explicit Binding.qualified_name -- prevents implicitly qualified bstring;
wenzelm
parents:
30364
diff
changeset
|
402 |
[((Binding.qualified_name (space_implode "_" |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
403 |
(Long_Name.qualify qualifier "inducts" :: vs' @ Ps @ |
29579 | 404 |
["correctness"])), thms), [])] thy'; |
22271 | 405 |
val realizers = inducts ~~ thms' ~~ rlzs ~~ rs; |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
406 |
in |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
407 |
Extraction.add_realizers_i |
22271 | 408 |
(map (fn (((ind, corr), rlz), r) => |
24157
409cd6eaa7ea
Added renaming function to prevent correctness proof for realizer
berghofe
parents:
23590
diff
changeset
|
409 |
mk_realizer thy' (vs' @ Ps) (Thm.get_name ind, ind, corr, rlz, r)) |
22271 | 410 |
realizers @ (case realizers of |
411 |
[(((ind, corr), rlz), r)] => |
|
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
412 |
[mk_realizer thy' (vs' @ Ps) (Long_Name.qualify qualifier "induct", |
22271 | 413 |
ind, corr, rlz, r)] |
414 |
| _ => [])) thy'' |
|
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
415 |
end; |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
416 |
|
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
417 |
(** realizer for elimination rules **) |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
418 |
|
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
419 |
val case_names = map (fst o dest_Const o head_of o fst o HOLogic.dest_eq o |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
420 |
HOLogic.dest_Trueprop o prop_of o hd) (get #case_thms dt_info); |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
421 |
|
13921
69c627b6b28d
Fixed problem in add_elim_realizer which caused bound variables to
berghofe
parents:
13725
diff
changeset
|
422 |
fun add_elim_realizer Ps |
69c627b6b28d
Fixed problem in add_elim_realizer which caused bound variables to
berghofe
parents:
13725
diff
changeset
|
423 |
(((((elim, elimR), intrs), case_thms), case_name), dummy) thy = |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
424 |
let |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
425 |
val (prem :: prems) = prems_of elim; |
22271 | 426 |
fun reorder1 (p, (_, intr)) = |
27330 | 427 |
Library.foldl (fn (t, ((s, _), T)) => Logic.all (Free (s, T)) t) |
16861 | 428 |
(strip_all p, Term.add_vars (prop_of intr) [] \\ params'); |
22271 | 429 |
fun reorder2 ((ivs, intr), i) = |
430 |
let val fs = Term.add_vars (prop_of intr) [] \\ params' |
|
15570 | 431 |
in Library.foldl (fn (t, x) => lambda (Var x) t) |
22271 | 432 |
(list_comb (Bound (i + length ivs), ivs), fs) |
13921
69c627b6b28d
Fixed problem in add_elim_realizer which caused bound variables to
berghofe
parents:
13725
diff
changeset
|
433 |
end; |
69c627b6b28d
Fixed problem in add_elim_realizer which caused bound variables to
berghofe
parents:
13725
diff
changeset
|
434 |
val p = Logic.list_implies |
69c627b6b28d
Fixed problem in add_elim_realizer which caused bound variables to
berghofe
parents:
13725
diff
changeset
|
435 |
(map reorder1 (prems ~~ intrs) @ [prem], concl_of elim); |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
436 |
val T' = Extraction.etype_of thy (vs @ Ps) [] p; |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
437 |
val T = if dummy then (HOLogic.unitT --> body_type T') --> T' else T'; |
13921
69c627b6b28d
Fixed problem in add_elim_realizer which caused bound variables to
berghofe
parents:
13725
diff
changeset
|
438 |
val Ts = map (Extraction.etype_of thy (vs @ Ps) []) (prems_of elim); |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
439 |
val r = if null Ps then Extraction.nullt |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
440 |
else list_abs (map (pair "x") Ts, list_comb (Const (case_name, T), |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
441 |
(if dummy then |
27982 | 442 |
[Abs ("x", HOLogic.unitT, Const ("HOL.default_class.default", body_type T))] |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
443 |
else []) @ |
13921
69c627b6b28d
Fixed problem in add_elim_realizer which caused bound variables to
berghofe
parents:
13725
diff
changeset
|
444 |
map reorder2 (intrs ~~ (length prems - 1 downto 0)) @ |
69c627b6b28d
Fixed problem in add_elim_realizer which caused bound variables to
berghofe
parents:
13725
diff
changeset
|
445 |
[Bound (length prems)])); |
22271 | 446 |
val rlz = Extraction.realizes_of thy (vs @ Ps) r (prop_of elim); |
447 |
val rlz' = strip_all (Logic.unvarify rlz); |
|
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
448 |
val rews = map mk_meta_eq case_thms; |
22271 | 449 |
val thm = Goal.prove_global thy [] |
26711 | 450 |
(Logic.strip_imp_prems rlz') (Logic.strip_imp_concl rlz') (fn {prems, ...} => EVERY |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
451 |
[cut_facts_tac [hd prems] 1, |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
452 |
etac elimR 1, |
22271 | 453 |
ALLGOALS (asm_simp_tac HOL_basic_ss), |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
454 |
rewrite_goals_tac rews, |
23590
ad95084a5c63
renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents:
23577
diff
changeset
|
455 |
REPEAT ((resolve_tac prems THEN_ALL_NEW (ObjectLogic.atomize_prems_tac THEN' |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
456 |
DEPTH_SOLVE_1 o FIRST' [atac, etac allE, etac impE])) 1)]); |
30435
e62d6ecab6ad
explicit Binding.qualified_name -- prevents implicitly qualified bstring;
wenzelm
parents:
30364
diff
changeset
|
457 |
val (thm', thy') = PureThy.store_thm (Binding.qualified_name (space_implode "_" |
29579 | 458 |
(name_of_thm elim :: vs @ Ps @ ["correctness"])), thm) thy |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
459 |
in |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
460 |
Extraction.add_realizers_i |
22271 | 461 |
[mk_realizer thy' (vs @ Ps) (name_of_thm elim, elim, thm', rlz, r)] thy' |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
462 |
end; |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
463 |
|
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
464 |
(** add realizers to theory **) |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
465 |
|
15570 | 466 |
val thy4 = Library.foldl add_ind_realizer (thy3, subsets Ps); |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
467 |
val thy5 = Extraction.add_realizers_i |
22271 | 468 |
(map (mk_realizer thy4 vs) (map (fn (((rule, rrule), rlz), c) => |
469 |
(name_of_thm rule, rule, rrule, rlz, |
|
470 |
list_comb (c, map Var (rev (Term.add_vars (prop_of rule) []) \\ params')))) |
|
471 |
(List.concat (map snd rss) ~~ #intrs ind_info ~~ rintrs ~~ |
|
472 |
List.concat constrss))) thy4; |
|
473 |
val elimps = List.mapPartial (fn ((s, intrs), p) => |
|
474 |
if s mem rsets then SOME (p, intrs) else NONE) |
|
475 |
(rss' ~~ (elims ~~ #elims ind_info)); |
|
15570 | 476 |
val thy6 = Library.foldl (fn (thy, p as (((((elim, _), _), _), _), _)) => thy |> |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
477 |
add_elim_realizer [] p |> add_elim_realizer [fst (fst (dest_Var |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
478 |
(HOLogic.dest_Trueprop (concl_of elim))))] p) (thy5, |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
479 |
elimps ~~ get #case_thms dt_info ~~ case_names ~~ dummies) |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
480 |
|
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24157
diff
changeset
|
481 |
in Sign.restore_naming thy thy6 end; |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
482 |
|
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
483 |
fun add_ind_realizers name rsets thy = |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
484 |
let |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
485 |
val (_, {intrs, induct, raw_induct, elims, ...}) = |
22271 | 486 |
InductivePackage.the_inductive (ProofContext.init thy) name; |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
487 |
val vss = sort (int_ord o pairself length) |
22271 | 488 |
(subsets (map fst (relevant_vars (concl_of (hd intrs))))) |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
489 |
in |
15570 | 490 |
Library.foldl (add_ind_realizer rsets intrs induct raw_induct elims) (thy, vss) |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
491 |
end |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
492 |
|
20897 | 493 |
fun rlz_attrib arg = Thm.declaration_attribute (fn thm => Context.mapping |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
494 |
let |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
495 |
fun err () = error "ind_realizer: bad rule"; |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
496 |
val sets = |
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
497 |
(case HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of thm)) of |
22271 | 498 |
[_] => [pred_of (HOLogic.dest_Trueprop (hd (prems_of thm)))] |
499 |
| xs => map (pred_of o fst o HOLogic.dest_imp) xs) |
|
15570 | 500 |
handle TERM _ => err () | Empty => err (); |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
501 |
in |
18728 | 502 |
add_ind_realizers (hd sets) |
503 |
(case arg of |
|
15531 | 504 |
NONE => sets | SOME NONE => [] |
15703 | 505 |
| SOME (SOME sets') => sets \\ sets') |
20897 | 506 |
end I); |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
507 |
|
30528 | 508 |
val ind_realizer = |
509 |
(Scan.option (Scan.lift (Args.$$$ "irrelevant") |-- |
|
15703 | 510 |
Scan.option (Scan.lift (Args.colon) |-- |
30528 | 511 |
Scan.repeat1 Args.const))) >> rlz_attrib; |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
512 |
|
18708 | 513 |
val setup = |
30528 | 514 |
Attrib.setup @{binding ind_realizer} ind_realizer "add realizers for inductive set"; |
13710
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
515 |
|
75bec2c1bfd5
New package for constructing realizers for introduction and elimination
berghofe
parents:
diff
changeset
|
516 |
end; |
15706 | 517 |