author | berghofe |
Thu, 22 Jul 1999 16:54:33 +0200 | |
changeset 7060 | 80d244f81b96 |
parent 7049 | f59d33c6e1c7 |
child 7151 | de17299bf095 |
permissions | -rw-r--r-- |
5177 | 1 |
(* Title: HOL/Tools/datatype_package.ML |
2 |
ID: $Id$ |
|
3 |
Author: Stefan Berghofer |
|
4 |
Copyright 1998 TU Muenchen |
|
5 |
||
6360 | 6 |
Datatype package for Isabelle/HOL. |
5177 | 7 |
*) |
8 |
||
6360 | 9 |
signature BASIC_DATATYPE_PACKAGE = |
10 |
sig |
|
11 |
val mutual_induct_tac : string list -> int -> tactic |
|
12 |
val induct_tac : string -> int -> tactic |
|
13 |
val exhaust_tac : string -> int -> tactic |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
14 |
val distinct_simproc : simproc |
6360 | 15 |
end; |
16 |
||
5177 | 17 |
signature DATATYPE_PACKAGE = |
18 |
sig |
|
6360 | 19 |
include BASIC_DATATYPE_PACKAGE |
5661 | 20 |
val quiet_mode : bool ref |
21 |
val add_datatype : bool -> string list -> (string list * bstring * mixfix * |
|
22 |
(bstring * string list * mixfix) list) list -> theory -> theory * |
|
5177 | 23 |
{distinct : thm list list, |
24 |
inject : thm list list, |
|
25 |
exhaustion : thm list, |
|
26 |
rec_thms : thm list, |
|
27 |
case_thms : thm list list, |
|
28 |
split_thms : (thm * thm) list, |
|
29 |
induction : thm, |
|
30 |
size : thm list, |
|
31 |
simps : thm list} |
|
5661 | 32 |
val add_datatype_i : bool -> string list -> (string list * bstring * mixfix * |
33 |
(bstring * typ list * mixfix) list) list -> theory -> theory * |
|
5177 | 34 |
{distinct : thm list list, |
35 |
inject : thm list list, |
|
36 |
exhaustion : thm list, |
|
37 |
rec_thms : thm list, |
|
38 |
case_thms : thm list list, |
|
39 |
split_thms : (thm * thm) list, |
|
40 |
induction : thm, |
|
41 |
size : thm list, |
|
42 |
simps : thm list} |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
43 |
val rep_datatype_i : string list option -> (thm * theory attribute list) list list -> |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
44 |
(thm * theory attribute list) list list -> (thm * theory attribute list) -> theory -> theory * |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
45 |
{distinct : thm list list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
46 |
inject : thm list list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
47 |
exhaustion : thm list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
48 |
rec_thms : thm list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
49 |
case_thms : thm list list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
50 |
split_thms : (thm * thm) list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
51 |
induction : thm, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
52 |
size : thm list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
53 |
simps : thm list} |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
54 |
val rep_datatype : string list option -> (xstring * Args.src list) list list -> |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
55 |
(xstring * Args.src list) list list -> xstring * Args.src list -> theory -> theory * |
5177 | 56 |
{distinct : thm list list, |
57 |
inject : thm list list, |
|
58 |
exhaustion : thm list, |
|
59 |
rec_thms : thm list, |
|
60 |
case_thms : thm list list, |
|
61 |
split_thms : (thm * thm) list, |
|
62 |
induction : thm, |
|
63 |
size : thm list, |
|
64 |
simps : thm list} |
|
65 |
val get_datatypes : theory -> DatatypeAux.datatype_info Symtab.table |
|
6441 | 66 |
val print_datatypes : theory -> unit |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
67 |
val datatype_info_sg : Sign.sg -> string -> DatatypeAux.datatype_info option |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
68 |
val datatype_info : theory -> string -> DatatypeAux.datatype_info option |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
69 |
val datatype_info_sg_err : Sign.sg -> string -> DatatypeAux.datatype_info |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
70 |
val datatype_info_err : theory -> string -> DatatypeAux.datatype_info |
5177 | 71 |
val constrs_of : theory -> string -> term list option |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
72 |
val constrs_of_sg : Sign.sg -> string -> term list option |
5177 | 73 |
val case_const_of : theory -> string -> term option |
6360 | 74 |
val setup: (theory -> theory) list |
5177 | 75 |
end; |
76 |
||
77 |
structure DatatypePackage : DATATYPE_PACKAGE = |
|
78 |
struct |
|
79 |
||
80 |
open DatatypeAux; |
|
81 |
||
5661 | 82 |
val quiet_mode = quiet_mode; |
83 |
||
6360 | 84 |
|
5177 | 85 |
(* data kind 'HOL/datatypes' *) |
86 |
||
87 |
structure DatatypesArgs = |
|
88 |
struct |
|
89 |
val name = "HOL/datatypes"; |
|
90 |
type T = datatype_info Symtab.table; |
|
91 |
||
92 |
val empty = Symtab.empty; |
|
6556 | 93 |
val copy = I; |
5177 | 94 |
val prep_ext = I; |
95 |
val merge: T * T -> T = Symtab.merge (K true); |
|
96 |
||
97 |
fun print sg tab = |
|
98 |
Pretty.writeln (Pretty.strs ("datatypes:" :: |
|
6851 | 99 |
map #1 (Sign.cond_extern_table sg Sign.typeK tab))); |
5177 | 100 |
end; |
101 |
||
102 |
structure DatatypesData = TheoryDataFun(DatatypesArgs); |
|
103 |
val get_datatypes_sg = DatatypesData.get_sg; |
|
104 |
val get_datatypes = DatatypesData.get; |
|
105 |
val put_datatypes = DatatypesData.put; |
|
6441 | 106 |
val print_datatypes = DatatypesData.print; |
5177 | 107 |
|
108 |
||
109 |
(** theory information about datatypes **) |
|
110 |
||
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
111 |
fun datatype_info_sg sg name = Symtab.lookup (get_datatypes_sg sg, name); |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
112 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
113 |
fun datatype_info_sg_err sg name = (case datatype_info_sg sg name of |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
114 |
Some info => info |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
115 |
| None => error ("Unknown datatype " ^ quote name)); |
5177 | 116 |
|
6394 | 117 |
val datatype_info = datatype_info_sg o Theory.sign_of; |
5177 | 118 |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
119 |
fun datatype_info_err thy name = (case datatype_info thy name of |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
120 |
Some info => info |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
121 |
| None => error ("Unknown datatype " ^ quote name)); |
5177 | 122 |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
123 |
fun constrs_of_sg sg tname = (case datatype_info_sg sg tname of |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
124 |
Some {index, descr, ...} => |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
125 |
let val (_, _, constrs) = the (assoc (descr, index)) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
126 |
in Some (map (fn (cname, _) => Const (cname, the (Sign.const_type sg cname))) constrs) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
127 |
end |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
128 |
| _ => None); |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
129 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
130 |
val constrs_of = constrs_of_sg o Theory.sign_of; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
131 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
132 |
fun case_const_of thy tname = (case datatype_info thy tname of |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
133 |
Some {case_name, ...} => Some (Const (case_name, the (Sign.const_type |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
134 |
(Theory.sign_of thy) case_name))) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
135 |
| _ => None); |
5177 | 136 |
|
137 |
fun find_tname var Bi = |
|
138 |
let val frees = map dest_Free (term_frees Bi) |
|
139 |
val params = Logic.strip_params Bi; |
|
140 |
in case assoc (frees @ params, var) of |
|
141 |
None => error ("No such variable in subgoal: " ^ quote var) |
|
142 |
| Some(Type (tn, _)) => tn |
|
143 |
| _ => error ("Cannot determine type of " ^ quote var) |
|
144 |
end; |
|
145 |
||
146 |
fun infer_tname state sign i aterm = |
|
147 |
let |
|
148 |
val (_, _, Bi, _) = dest_state (state, i) |
|
149 |
val params = Logic.strip_params Bi; (*params of subgoal i*) |
|
150 |
val params = rev (rename_wrt_term Bi params); (*as they are printed*) |
|
151 |
val (types, sorts) = types_sorts state; |
|
152 |
fun types' (a, ~1) = (case assoc (params, a) of None => types(a, ~1) | sm => sm) |
|
153 |
| types' ixn = types ixn; |
|
154 |
val (ct, _) = read_def_cterm (sign, types', sorts) [] false |
|
155 |
(aterm, TVar (("", 0), [])); |
|
156 |
in case #T (rep_cterm ct) of |
|
157 |
Type (tn, _) => tn |
|
158 |
| _ => error ("Cannot determine type of " ^ quote aterm) |
|
159 |
end; |
|
160 |
||
161 |
(*Warn if the (induction) variable occurs Free among the premises, which |
|
162 |
usually signals a mistake. But calls the tactic either way!*) |
|
163 |
fun occs_in_prems tacf vars = |
|
164 |
SUBGOAL (fn (Bi, i) => |
|
165 |
(if exists (fn Free (a, _) => a mem vars) |
|
166 |
(foldr add_term_frees (#2 (strip_context Bi), [])) |
|
167 |
then warning "Induction variable occurs also among premises!" |
|
168 |
else (); |
|
169 |
tacf i)); |
|
170 |
||
171 |
(* generic induction tactic for datatypes *) |
|
172 |
||
173 |
fun mutual_induct_tac vars i state = |
|
174 |
let |
|
175 |
val (_, _, Bi, _) = dest_state (state, i); |
|
176 |
val {sign, ...} = rep_thm state; |
|
177 |
val tn = find_tname (hd vars) Bi; |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
178 |
val {induction, ...} = datatype_info_sg_err sign tn; |
5177 | 179 |
val ind_vnames = map (fn (_ $ Var (ixn, _)) => |
180 |
implode (tl (explode (Syntax.string_of_vname ixn)))) |
|
181 |
(dest_conj (HOLogic.dest_Trueprop (concl_of induction))); |
|
182 |
val insts = (ind_vnames ~~ vars) handle _ => |
|
183 |
error ("Induction rule for type " ^ tn ^ " has different number of variables") |
|
184 |
in |
|
185 |
occs_in_prems (res_inst_tac insts induction) vars i state |
|
186 |
end; |
|
187 |
||
188 |
fun induct_tac var = mutual_induct_tac [var]; |
|
189 |
||
190 |
(* generic exhaustion tactic for datatypes *) |
|
191 |
||
192 |
fun exhaust_tac aterm i state = |
|
193 |
let |
|
194 |
val {sign, ...} = rep_thm state; |
|
195 |
val tn = infer_tname state sign i aterm; |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
196 |
val {exhaustion, ...} = datatype_info_sg_err sign tn; |
5177 | 197 |
val _ $ Var (ixn, _) $ _ = HOLogic.dest_Trueprop |
198 |
(hd (Logic.strip_assums_hyp (hd (prems_of exhaustion)))); |
|
199 |
val exh_vname = implode (tl (explode (Syntax.string_of_vname ixn))) |
|
200 |
in |
|
201 |
res_inst_tac [(exh_vname, aterm)] exhaustion i state |
|
202 |
end; |
|
203 |
||
204 |
||
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
205 |
(**** simplification procedure for showing distinctness of constructors ****) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
206 |
|
7060 | 207 |
fun stripT (i, Type ("fun", [_, T])) = stripT (i + 1, T) |
208 |
| stripT p = p; |
|
209 |
||
210 |
fun stripC (i, f $ x) = stripC (i + 1, f) |
|
211 |
| stripC p = p; |
|
212 |
||
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
213 |
val distinctN = "constr_distinct"; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
214 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
215 |
exception ConstrDistinct of term; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
216 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
217 |
fun distinct_proc sg _ (t as Const ("op =", _) $ t1 $ t2) = |
7060 | 218 |
(case (stripC (0, t1), stripC (0, t2)) of |
219 |
((i, Const (cname1, T1)), (j, Const (cname2, T2))) => |
|
220 |
(case (stripT (0, T1), stripT (0, T2)) of |
|
221 |
((i', Type (tname1, _)), (j', Type (tname2, _))) => |
|
222 |
if tname1 = tname2 andalso not (cname1 = cname2) andalso i = i' andalso j = j' then |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
223 |
(case (constrs_of_sg sg tname1) of |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
224 |
Some constrs => let val cnames = map (fst o dest_Const) constrs |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
225 |
in if cname1 mem cnames andalso cname2 mem cnames then |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
226 |
let val eq_t = Logic.mk_equals (t, Const ("False", HOLogic.boolT)); |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
227 |
val eq_ct = cterm_of sg eq_t; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
228 |
val Datatype_thy = theory "Datatype"; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
229 |
val [In0_inject, In1_inject, In0_not_In1, In1_not_In0] = |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
230 |
map (get_thm Datatype_thy) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
231 |
["In0_inject", "In1_inject", "In0_not_In1", "In1_not_In0"] |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
232 |
in (case (#distinct (datatype_info_sg_err sg tname1)) of |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
233 |
QuickAndDirty => Some (Thm.invoke_oracle |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
234 |
Datatype_thy distinctN (sg, ConstrDistinct eq_t)) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
235 |
| FewConstrs thms => Some (prove_goalw_cterm [] eq_ct (K |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
236 |
[rtac eq_reflection 1, rtac iffI 1, rtac notE 1, |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
237 |
atac 2, resolve_tac thms 1, etac FalseE 1])) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
238 |
| ManyConstrs (thm, ss) => Some (prove_goalw_cterm [] eq_ct (K |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
239 |
[rtac eq_reflection 1, rtac iffI 1, dtac thm 1, |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
240 |
full_simp_tac ss 1, |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
241 |
REPEAT (dresolve_tac [In0_inject, In1_inject] 1), |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
242 |
eresolve_tac [In0_not_In1 RS notE, In1_not_In0 RS notE] 1, |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
243 |
etac FalseE 1]))) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
244 |
end |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
245 |
else None |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
246 |
end |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
247 |
| None => None) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
248 |
else None |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
249 |
| _ => None) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
250 |
| _ => None) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
251 |
| distinct_proc sg _ _ = None; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
252 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
253 |
val distinct_pats = [Thm.read_cterm (Theory.sign_of HOL.thy) ("s = t", HOLogic.termTVar)]; |
7049 | 254 |
val distinct_simproc = mk_simproc distinctN distinct_pats distinct_proc; |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
255 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
256 |
val dist_ss = HOL_ss addsimprocs [distinct_simproc]; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
257 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
258 |
val simproc_setup = |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
259 |
[Theory.add_oracle (distinctN, fn (_, ConstrDistinct t) => t), |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
260 |
fn thy => (simpset_ref_of thy := simpset_of thy addsimprocs [distinct_simproc]; thy)]; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
261 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
262 |
|
5177 | 263 |
(* prepare types *) |
264 |
||
265 |
fun read_typ sign ((Ts, sorts), str) = |
|
266 |
let |
|
267 |
val T = Type.no_tvars (Sign.read_typ (sign, (curry assoc) |
|
268 |
(map (apfst (rpair ~1)) sorts)) str) handle TYPE (msg, _, _) => error msg |
|
269 |
in (Ts @ [T], add_typ_tfrees (T, sorts)) end; |
|
270 |
||
271 |
fun cert_typ sign ((Ts, sorts), raw_T) = |
|
272 |
let |
|
273 |
val T = Type.no_tvars (Sign.certify_typ sign raw_T) handle |
|
274 |
TYPE (msg, _, _) => error msg; |
|
275 |
val sorts' = add_typ_tfrees (T, sorts) |
|
276 |
in (Ts @ [T], |
|
277 |
case duplicates (map fst sorts') of |
|
278 |
[] => sorts' |
|
279 |
| dups => error ("Inconsistent sort constraints for " ^ commas dups)) |
|
280 |
end; |
|
281 |
||
282 |
||
283 |
(**** make datatype info ****) |
|
284 |
||
285 |
fun make_dt_info descr induct reccomb_names rec_thms |
|
286 |
((((((((i, (_, (tname, _, _))), case_name), case_thms), |
|
287 |
exhaustion_thm), distinct_thm), inject), nchotomy), case_cong) = (tname, |
|
288 |
{index = i, |
|
289 |
descr = descr, |
|
290 |
rec_names = reccomb_names, |
|
291 |
rec_rewrites = rec_thms, |
|
292 |
case_name = case_name, |
|
293 |
case_rewrites = case_thms, |
|
294 |
induction = induct, |
|
295 |
exhaustion = exhaustion_thm, |
|
296 |
distinct = distinct_thm, |
|
297 |
inject = inject, |
|
298 |
nchotomy = nchotomy, |
|
299 |
case_cong = case_cong}); |
|
300 |
||
301 |
fun store_clasimp thy (cla, simp) = |
|
302 |
(claset_ref_of thy := cla; simpset_ref_of thy := simp); |
|
303 |
||
304 |
||
305 |
(********************* axiomatic introduction of datatypes ********************) |
|
306 |
||
307 |
fun add_and_get_axioms label tnames ts thy = |
|
308 |
foldr (fn ((tname, t), (thy', axs)) => |
|
309 |
let |
|
310 |
val thy'' = thy' |> |
|
5661 | 311 |
Theory.add_path tname |> |
5177 | 312 |
PureThy.add_axioms_i [((label, t), [])]; |
313 |
val ax = get_axiom thy'' label |
|
5661 | 314 |
in (Theory.parent_path thy'', ax::axs) |
5177 | 315 |
end) (tnames ~~ ts, (thy, [])); |
316 |
||
317 |
fun add_and_get_axiomss label tnames tss thy = |
|
318 |
foldr (fn ((tname, ts), (thy', axss)) => |
|
319 |
let |
|
320 |
val thy'' = thy' |> |
|
5661 | 321 |
Theory.add_path tname |> |
5177 | 322 |
PureThy.add_axiomss_i [((label, ts), [])]; |
323 |
val axs = PureThy.get_thms thy'' label |
|
5661 | 324 |
in (Theory.parent_path thy'', axs::axss) |
5177 | 325 |
end) (tnames ~~ tss, (thy, [])); |
326 |
||
5661 | 327 |
fun add_datatype_axm flat_names new_type_names descr sorts types_syntax constr_syntax dt_info thy = |
5177 | 328 |
let |
329 |
val descr' = flat descr; |
|
330 |
val recTs = get_rec_types descr' sorts; |
|
5578
7de426cf179c
Package now chooses type variable names more carefully to
berghofe
parents:
5279
diff
changeset
|
331 |
val used = foldr add_typ_tfree_names (recTs, []); |
5177 | 332 |
val newTs = take (length (hd descr), recTs); |
333 |
||
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
334 |
val no_size = exists (fn (_, (_, _, constrs)) => exists (fn (_, cargs) => exists |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
335 |
(fn (DtType ("fun", [_, DtRec _])) => true | _ => false) cargs) constrs) descr'; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
336 |
|
5177 | 337 |
(**** declare new types and constants ****) |
338 |
||
339 |
val tyvars = map (fn (_, (_, Ts, _)) => map dest_DtTFree Ts) (hd descr); |
|
340 |
||
341 |
val constr_decls = map (fn (((_, (_, _, constrs)), T), constr_syntax') => |
|
342 |
map (fn ((_, cargs), (cname, mx)) => |
|
343 |
(cname, map (typ_of_dtyp descr' sorts) cargs ---> T, mx)) |
|
344 |
(constrs ~~ constr_syntax')) ((hd descr) ~~ newTs ~~ constr_syntax); |
|
345 |
||
5578
7de426cf179c
Package now chooses type variable names more carefully to
berghofe
parents:
5279
diff
changeset
|
346 |
val rec_result_Ts = map TFree (variantlist (replicate (length descr') "'t", used) ~~ |
7de426cf179c
Package now chooses type variable names more carefully to
berghofe
parents:
5279
diff
changeset
|
347 |
replicate (length descr') HOLogic.termS); |
5177 | 348 |
|
349 |
val reccomb_fn_Ts = flat (map (fn (i, (_, _, constrs)) => |
|
350 |
map (fn (_, cargs) => |
|
351 |
let |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
352 |
val Ts = map (typ_of_dtyp descr' sorts) cargs; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
353 |
val recs = filter (is_rec_type o fst) (cargs ~~ Ts); |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
354 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
355 |
fun mk_argT (DtRec k, _) = nth_elem (k, rec_result_Ts) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
356 |
| mk_argT (DtType ("fun", [_, DtRec k]), Type ("fun", [T, _])) = |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
357 |
T --> nth_elem (k, rec_result_Ts); |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
358 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
359 |
val argTs = Ts @ map mk_argT recs |
5177 | 360 |
in argTs ---> nth_elem (i, rec_result_Ts) |
361 |
end) constrs) descr'); |
|
362 |
||
363 |
val big_reccomb_name = (space_implode "_" new_type_names) ^ "_rec"; |
|
364 |
val reccomb_names = if length descr' = 1 then [big_reccomb_name] else |
|
365 |
(map ((curry (op ^) (big_reccomb_name ^ "_")) o string_of_int) |
|
366 |
(1 upto (length descr'))); |
|
367 |
||
368 |
val big_size_name = space_implode "_" new_type_names ^ "_size"; |
|
369 |
val size_names = if length (flat (tl descr)) = 1 then [big_size_name] else |
|
370 |
map (fn i => big_size_name ^ "_" ^ string_of_int i) |
|
371 |
(1 upto length (flat (tl descr))); |
|
372 |
||
5578
7de426cf179c
Package now chooses type variable names more carefully to
berghofe
parents:
5279
diff
changeset
|
373 |
val freeT = TFree (variant used "'t", HOLogic.termS); |
5177 | 374 |
val case_fn_Ts = map (fn (i, (_, _, constrs)) => |
375 |
map (fn (_, cargs) => |
|
376 |
let val Ts = map (typ_of_dtyp descr' sorts) cargs |
|
377 |
in Ts ---> freeT end) constrs) (hd descr); |
|
378 |
||
379 |
val case_names = map (fn s => (s ^ "_case")) new_type_names; |
|
380 |
||
6305 | 381 |
val thy2' = thy |> |
5177 | 382 |
|
383 |
(** new types **) |
|
384 |
||
385 |
curry (foldr (fn (((name, mx), tvs), thy') => thy' |> |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
386 |
TypedefPackage.add_typedecls [(name, tvs, mx)])) |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
387 |
(types_syntax ~~ tyvars) |> |
5661 | 388 |
add_path flat_names (space_implode "_" new_type_names) |> |
5177 | 389 |
|
390 |
(** primrec combinators **) |
|
391 |
||
392 |
Theory.add_consts_i (map (fn ((name, T), T') => |
|
393 |
(name, reccomb_fn_Ts @ [T] ---> T', NoSyn)) |
|
394 |
(reccomb_names ~~ recTs ~~ rec_result_Ts)) |> |
|
395 |
||
396 |
(** case combinators **) |
|
397 |
||
398 |
Theory.add_consts_i (map (fn ((name, T), Ts) => |
|
399 |
(name, Ts @ [T] ---> freeT, NoSyn)) |
|
400 |
(case_names ~~ newTs ~~ case_fn_Ts)) |> |
|
6305 | 401 |
Theory.add_trrules_i (DatatypeProp.make_case_trrules new_type_names descr); |
402 |
||
6394 | 403 |
val reccomb_names' = map (Sign.intern_const (Theory.sign_of thy2')) reccomb_names; |
404 |
val case_names' = map (Sign.intern_const (Theory.sign_of thy2')) case_names; |
|
6305 | 405 |
|
406 |
val thy2 = thy2' |> |
|
5177 | 407 |
|
408 |
(** size functions **) |
|
409 |
||
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
410 |
(if no_size then I else Theory.add_consts_i (map (fn (s, T) => |
5177 | 411 |
(Sign.base_name s, T --> HOLogic.natT, NoSyn)) |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
412 |
(size_names ~~ drop (length (hd descr), recTs)))) |> |
5661 | 413 |
|
414 |
(** constructors **) |
|
415 |
||
416 |
parent_path flat_names |> |
|
417 |
curry (foldr (fn (((((_, (_, _, constrs)), T), tname), |
|
418 |
constr_syntax'), thy') => thy' |> |
|
419 |
add_path flat_names tname |> |
|
420 |
Theory.add_consts_i (map (fn ((_, cargs), (cname, mx)) => |
|
421 |
(cname, map (typ_of_dtyp descr' sorts) cargs ---> T, mx)) |
|
422 |
(constrs ~~ constr_syntax')) |> |
|
423 |
parent_path flat_names)) |
|
424 |
(hd descr ~~ newTs ~~ new_type_names ~~ constr_syntax); |
|
5177 | 425 |
|
426 |
(**** introduction of axioms ****) |
|
427 |
||
5661 | 428 |
val rec_axs = DatatypeProp.make_primrecs new_type_names descr sorts thy2; |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
429 |
val size_axs = if no_size then [] else DatatypeProp.make_size new_type_names descr sorts thy2; |
5661 | 430 |
|
5177 | 431 |
val (thy3, inject) = thy2 |> |
5661 | 432 |
Theory.add_path (space_implode "_" new_type_names) |> |
5177 | 433 |
PureThy.add_axioms_i [(("induct", DatatypeProp.make_ind descr sorts), [])] |> |
5661 | 434 |
PureThy.add_axiomss_i [(("recs", rec_axs), [])] |> |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
435 |
(if no_size then I else PureThy.add_axiomss_i [(("size", size_axs), [])]) |> |
5661 | 436 |
Theory.parent_path |> |
5177 | 437 |
add_and_get_axiomss "inject" new_type_names |
438 |
(DatatypeProp.make_injs descr sorts); |
|
5661 | 439 |
val induct = get_axiom thy3 "induct"; |
440 |
val rec_thms = get_thms thy3 "recs"; |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
441 |
val size_thms = if no_size then [] else get_thms thy3 "size"; |
5177 | 442 |
val (thy4, distinct) = add_and_get_axiomss "distinct" new_type_names |
443 |
(DatatypeProp.make_distincts new_type_names descr sorts thy3) thy3; |
|
444 |
val (thy5, exhaustion) = add_and_get_axioms "exhaust" new_type_names |
|
5661 | 445 |
(DatatypeProp.make_casedists descr sorts) thy4; |
5177 | 446 |
val (thy6, case_thms) = add_and_get_axiomss "cases" new_type_names |
447 |
(DatatypeProp.make_cases new_type_names descr sorts thy5) thy5; |
|
448 |
val (split_ts, split_asm_ts) = ListPair.unzip |
|
449 |
(DatatypeProp.make_splits new_type_names descr sorts thy6); |
|
450 |
val (thy7, split) = add_and_get_axioms "split" new_type_names split_ts thy6; |
|
451 |
val (thy8, split_asm) = add_and_get_axioms "split_asm" new_type_names |
|
452 |
split_asm_ts thy7; |
|
453 |
val (thy9, nchotomys) = add_and_get_axioms "nchotomy" new_type_names |
|
454 |
(DatatypeProp.make_nchotomys descr sorts) thy8; |
|
455 |
val (thy10, case_congs) = add_and_get_axioms "case_cong" new_type_names |
|
456 |
(DatatypeProp.make_case_congs new_type_names descr sorts thy9) thy9; |
|
457 |
||
6305 | 458 |
val dt_infos = map (make_dt_info descr' induct reccomb_names' rec_thms) |
459 |
((0 upto length (hd descr) - 1) ~~ (hd descr) ~~ case_names' ~~ case_thms ~~ |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
460 |
exhaustion ~~ replicate (length (hd descr)) QuickAndDirty ~~ inject ~~ |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
461 |
nchotomys ~~ case_congs); |
5177 | 462 |
|
463 |
val simps = flat (distinct @ inject @ case_thms) @ size_thms @ rec_thms; |
|
464 |
||
5661 | 465 |
val thy11 = thy10 |> |
466 |
Theory.add_path (space_implode "_" new_type_names) |> |
|
6092 | 467 |
PureThy.add_thmss [(("simps", simps), [])] |> |
5177 | 468 |
put_datatypes (foldr Symtab.update (dt_infos, dt_info)) |> |
469 |
Theory.parent_path; |
|
470 |
||
5661 | 471 |
val _ = store_clasimp thy11 ((claset_of thy11, simpset_of thy11) |
5177 | 472 |
addsimps2 flat case_thms addsimps2 size_thms addsimps2 rec_thms |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
473 |
addIffs flat (inject @ distinct)); |
5177 | 474 |
|
475 |
in |
|
5661 | 476 |
(thy11, |
5177 | 477 |
{distinct = distinct, |
478 |
inject = inject, |
|
479 |
exhaustion = exhaustion, |
|
480 |
rec_thms = rec_thms, |
|
481 |
case_thms = case_thms, |
|
482 |
split_thms = split ~~ split_asm, |
|
483 |
induction = induct, |
|
484 |
size = size_thms, |
|
485 |
simps = simps}) |
|
486 |
end; |
|
487 |
||
488 |
||
489 |
(******************* definitional introduction of datatypes *******************) |
|
490 |
||
5661 | 491 |
fun add_datatype_def flat_names new_type_names descr sorts types_syntax constr_syntax dt_info thy = |
5177 | 492 |
let |
6360 | 493 |
val _ = message ("Proofs for datatype(s) " ^ commas_quote new_type_names); |
5177 | 494 |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
495 |
val (thy2, inject, distinct, dist_rewrites, simproc_dists, induct) = thy |> |
5661 | 496 |
DatatypeRepProofs.representation_proofs flat_names dt_info new_type_names descr sorts |
5177 | 497 |
types_syntax constr_syntax; |
498 |
||
499 |
val (thy3, casedist_thms) = |
|
500 |
DatatypeAbsProofs.prove_casedist_thms new_type_names descr sorts induct thy2; |
|
501 |
val (thy4, reccomb_names, rec_thms) = DatatypeAbsProofs.prove_primrec_thms |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
502 |
flat_names new_type_names descr sorts dt_info inject dist_rewrites dist_ss induct thy3; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
503 |
val (thy6, case_names, case_thms) = DatatypeAbsProofs.prove_case_thms |
5661 | 504 |
flat_names new_type_names descr sorts reccomb_names rec_thms thy4; |
5177 | 505 |
val (thy7, split_thms) = DatatypeAbsProofs.prove_split_thms new_type_names |
506 |
descr sorts inject dist_rewrites casedist_thms case_thms thy6; |
|
507 |
val (thy8, nchotomys) = DatatypeAbsProofs.prove_nchotomys new_type_names |
|
508 |
descr sorts casedist_thms thy7; |
|
509 |
val (thy9, case_congs) = DatatypeAbsProofs.prove_case_congs new_type_names |
|
510 |
descr sorts nchotomys case_thms thy8; |
|
5661 | 511 |
val (thy10, size_thms) = DatatypeAbsProofs.prove_size_thms flat_names new_type_names |
5177 | 512 |
descr sorts reccomb_names rec_thms thy9; |
513 |
||
514 |
val dt_infos = map (make_dt_info (flat descr) induct reccomb_names rec_thms) |
|
515 |
((0 upto length (hd descr) - 1) ~~ (hd descr) ~~ case_names ~~ case_thms ~~ |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
516 |
casedist_thms ~~ simproc_dists ~~ inject ~~ nchotomys ~~ case_congs); |
5177 | 517 |
|
518 |
val simps = flat (distinct @ inject @ case_thms) @ size_thms @ rec_thms; |
|
519 |
||
520 |
val thy11 = thy10 |> |
|
5661 | 521 |
Theory.add_path (space_implode "_" new_type_names) |> |
6092 | 522 |
PureThy.add_thmss [(("simps", simps), [])] |> |
5177 | 523 |
put_datatypes (foldr Symtab.update (dt_infos, dt_info)) |> |
5663
aad79a127628
Fixed bug (improper handling of flag flat_names).
berghofe
parents:
5661
diff
changeset
|
524 |
Theory.parent_path; |
5177 | 525 |
|
526 |
val _ = store_clasimp thy11 ((claset_of thy11, simpset_of thy11) |
|
527 |
addsimps2 flat case_thms addsimps2 size_thms addsimps2 rec_thms |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
528 |
addIffs flat (inject @ distinct)); |
5177 | 529 |
|
530 |
in |
|
531 |
(thy11, |
|
532 |
{distinct = distinct, |
|
533 |
inject = inject, |
|
534 |
exhaustion = casedist_thms, |
|
535 |
rec_thms = rec_thms, |
|
536 |
case_thms = case_thms, |
|
537 |
split_thms = split_thms, |
|
538 |
induction = induct, |
|
539 |
size = size_thms, |
|
540 |
simps = simps}) |
|
541 |
end; |
|
542 |
||
543 |
||
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
544 |
(*********************** declare existing type as datatype *********************) |
5177 | 545 |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
546 |
fun gen_rep_datatype apply_theorems alt_names raw_distinct raw_inject raw_induction thy0 = |
5177 | 547 |
let |
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
548 |
fun app_thmss srcs thy = foldl_map (fn (thy, x) => apply_theorems x thy) (thy, srcs); |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
549 |
fun app_thm src thy = apsnd Library.hd (apply_theorems [src] thy); |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
550 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
551 |
val (((thy1, induction), inject), distinct) = thy0 |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
552 |
|> app_thmss raw_distinct |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
553 |
|> apfst (app_thmss raw_inject) |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
554 |
|> apfst (apfst (app_thm raw_induction)); |
6394 | 555 |
val sign = Theory.sign_of thy1; |
5177 | 556 |
|
557 |
val induction' = freezeT induction; |
|
558 |
||
559 |
fun err t = error ("Ill-formed predicate in induction rule: " ^ |
|
560 |
Sign.string_of_term sign t); |
|
561 |
||
562 |
fun get_typ (t as _ $ Var (_, Type (tname, Ts))) = |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
563 |
((tname, map dest_TFree Ts) handle TERM _ => err t) |
5177 | 564 |
| get_typ t = err t; |
565 |
||
566 |
val dtnames = map get_typ (dest_conj (HOLogic.dest_Trueprop (concl_of induction'))); |
|
567 |
val new_type_names = if_none alt_names (map fst dtnames); |
|
568 |
||
569 |
fun get_constr t = (case Logic.strip_assums_concl t of |
|
570 |
_ $ (_ $ t') => (case head_of t' of |
|
571 |
Const (cname, cT) => (case strip_type cT of |
|
572 |
(Ts, Type (tname, _)) => (tname, (cname, map (dtyp_of_typ dtnames) Ts)) |
|
573 |
| _ => err t) |
|
574 |
| _ => err t) |
|
575 |
| _ => err t); |
|
576 |
||
577 |
fun make_dt_spec [] _ _ = [] |
|
578 |
| make_dt_spec ((tname, tvs)::dtnames') i constrs = |
|
579 |
let val (constrs', constrs'') = take_prefix (equal tname o fst) constrs |
|
580 |
in (i, (tname, map DtTFree tvs, map snd constrs')):: |
|
581 |
(make_dt_spec dtnames' (i + 1) constrs'') |
|
582 |
end; |
|
583 |
||
584 |
val descr = make_dt_spec dtnames 0 (map get_constr (prems_of induction')); |
|
585 |
val sorts = add_term_tfrees (concl_of induction', []); |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
586 |
val dt_info = get_datatypes thy1; |
5177 | 587 |
|
6427 | 588 |
val _ = message ("Proofs for datatype(s) " ^ commas_quote new_type_names); |
5177 | 589 |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
590 |
val (thy2, casedist_thms) = thy1 |> |
5177 | 591 |
DatatypeAbsProofs.prove_casedist_thms new_type_names [descr] sorts induction; |
592 |
val (thy3, reccomb_names, rec_thms) = DatatypeAbsProofs.prove_primrec_thms |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
593 |
false new_type_names [descr] sorts dt_info inject distinct dist_ss induction thy2; |
5661 | 594 |
val (thy4, case_names, case_thms) = DatatypeAbsProofs.prove_case_thms false |
5177 | 595 |
new_type_names [descr] sorts reccomb_names rec_thms thy3; |
596 |
val (thy5, split_thms) = DatatypeAbsProofs.prove_split_thms |
|
597 |
new_type_names [descr] sorts inject distinct casedist_thms case_thms thy4; |
|
598 |
val (thy6, nchotomys) = DatatypeAbsProofs.prove_nchotomys new_type_names |
|
599 |
[descr] sorts casedist_thms thy5; |
|
600 |
val (thy7, case_congs) = DatatypeAbsProofs.prove_case_congs new_type_names |
|
601 |
[descr] sorts nchotomys case_thms thy6; |
|
602 |
val (thy8, size_thms) = |
|
6394 | 603 |
if exists (equal "Arith") (Sign.stamp_names_of (Theory.sign_of thy7)) then |
5661 | 604 |
DatatypeAbsProofs.prove_size_thms false new_type_names |
5177 | 605 |
[descr] sorts reccomb_names rec_thms thy7 |
606 |
else (thy7, []); |
|
607 |
||
608 |
val dt_infos = map (make_dt_info descr induction reccomb_names rec_thms) |
|
609 |
((0 upto length descr - 1) ~~ descr ~~ case_names ~~ case_thms ~~ |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
610 |
casedist_thms ~~ map FewConstrs distinct ~~ inject ~~ nchotomys ~~ case_congs); |
5177 | 611 |
|
612 |
val simps = flat (distinct @ inject @ case_thms) @ size_thms @ rec_thms; |
|
613 |
||
614 |
val thy9 = thy8 |> |
|
5661 | 615 |
Theory.add_path (space_implode "_" new_type_names) |> |
6092 | 616 |
PureThy.add_thmss [(("simps", simps), [])] |> |
5177 | 617 |
put_datatypes (foldr Symtab.update (dt_infos, dt_info)) |> |
618 |
Theory.parent_path; |
|
619 |
||
620 |
val _ = store_clasimp thy9 ((claset_of thy9, simpset_of thy9) |
|
621 |
addsimps2 flat case_thms addsimps2 size_thms addsimps2 rec_thms |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
622 |
addIffs flat (inject @ distinct)); |
5177 | 623 |
|
624 |
in |
|
625 |
(thy9, |
|
626 |
{distinct = distinct, |
|
627 |
inject = inject, |
|
628 |
exhaustion = casedist_thms, |
|
629 |
rec_thms = rec_thms, |
|
630 |
case_thms = case_thms, |
|
631 |
split_thms = split_thms, |
|
632 |
induction = induction, |
|
633 |
size = size_thms, |
|
634 |
simps = simps}) |
|
635 |
end; |
|
636 |
||
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
637 |
val rep_datatype = gen_rep_datatype IsarThy.apply_theorems; |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
638 |
val rep_datatype_i = gen_rep_datatype IsarThy.apply_theorems_i; |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
639 |
|
5177 | 640 |
|
641 |
(******************************** add datatype ********************************) |
|
642 |
||
5661 | 643 |
fun gen_add_datatype prep_typ flat_names new_type_names dts thy = |
5177 | 644 |
let |
645 |
val _ = Theory.requires thy "Datatype" "datatype definitions"; |
|
646 |
||
647 |
(* this theory is used just for parsing *) |
|
648 |
||
649 |
val tmp_thy = thy |> |
|
5892 | 650 |
Theory.copy |> |
5177 | 651 |
Theory.add_types (map (fn (tvs, tname, mx, _) => |
652 |
(tname, length tvs, mx)) dts); |
|
653 |
||
6394 | 654 |
val sign = Theory.sign_of tmp_thy; |
5177 | 655 |
|
5661 | 656 |
val (tyvars, _, _, _)::_ = dts; |
5177 | 657 |
val (new_dts, types_syntax) = ListPair.unzip (map (fn (tvs, tname, mx, _) => |
658 |
let val full_tname = Sign.full_name sign (Syntax.type_name tname mx) |
|
659 |
in (case duplicates tvs of |
|
5661 | 660 |
[] => if eq_set (tyvars, tvs) then ((full_tname, tvs), (tname, mx)) |
661 |
else error ("Mutually recursive datatypes must have same type parameters") |
|
5177 | 662 |
| dups => error ("Duplicate parameter(s) for datatype " ^ full_tname ^ |
663 |
" : " ^ commas dups)) |
|
664 |
end) dts); |
|
665 |
||
666 |
val _ = (case duplicates (map fst new_dts) @ duplicates new_type_names of |
|
667 |
[] => () | dups => error ("Duplicate datatypes: " ^ commas dups)); |
|
668 |
||
669 |
fun prep_dt_spec ((dts', constr_syntax, sorts, i), (tvs, tname, mx, constrs)) = |
|
670 |
let |
|
5661 | 671 |
fun prep_constr ((constrs, constr_syntax', sorts'), (cname, cargs, mx')) = |
5279 | 672 |
let |
673 |
val (cargs', sorts'') = foldl (prep_typ sign) (([], sorts'), cargs); |
|
674 |
val _ = (case foldr add_typ_tfree_names (cargs', []) \\ tvs of |
|
675 |
[] => () |
|
676 |
| vs => error ("Extra type variables on rhs: " ^ commas vs)) |
|
5661 | 677 |
in (constrs @ [((if flat_names then Sign.full_name sign else |
678 |
Sign.full_name_path sign tname) (Syntax.const_name cname mx'), |
|
5177 | 679 |
map (dtyp_of_typ new_dts) cargs')], |
680 |
constr_syntax' @ [(cname, mx')], sorts'') |
|
681 |
end handle ERROR => |
|
682 |
error ("The error above occured in constructor " ^ cname ^ |
|
683 |
" of datatype " ^ tname); |
|
684 |
||
685 |
val (constrs', constr_syntax', sorts') = |
|
686 |
foldl prep_constr (([], [], sorts), constrs) |
|
687 |
||
688 |
in |
|
689 |
case duplicates (map fst constrs') of |
|
690 |
[] => |
|
691 |
(dts' @ [(i, (Sign.full_name sign (Syntax.type_name tname mx), |
|
692 |
map DtTFree tvs, constrs'))], |
|
693 |
constr_syntax @ [constr_syntax'], sorts', i + 1) |
|
694 |
| dups => error ("Duplicate constructors " ^ commas dups ^ |
|
695 |
" in datatype " ^ tname) |
|
696 |
end; |
|
697 |
||
5661 | 698 |
val (dts', constr_syntax, sorts', i) = foldl prep_dt_spec (([], [], [], 0), dts); |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
699 |
val sorts = sorts' @ (map (rpair (Sign.defaultS sign)) (tyvars \\ map fst sorts')); |
5177 | 700 |
val dt_info = get_datatypes thy; |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
701 |
val (descr, _) = unfold_datatypes sign dts' sorts dt_info dts' i; |
5177 | 702 |
val _ = check_nonempty descr; |
703 |
||
704 |
in |
|
705 |
(if (!quick_and_dirty) then add_datatype_axm else add_datatype_def) |
|
5661 | 706 |
flat_names new_type_names descr sorts types_syntax constr_syntax dt_info thy |
5177 | 707 |
end; |
708 |
||
709 |
val add_datatype_i = gen_add_datatype cert_typ; |
|
710 |
val add_datatype = gen_add_datatype read_typ; |
|
711 |
||
6360 | 712 |
|
713 |
(** package setup **) |
|
714 |
||
715 |
(* setup theory *) |
|
716 |
||
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
717 |
val setup = [DatatypesData.init] @ simproc_setup; |
6360 | 718 |
|
719 |
||
720 |
(* outer syntax *) |
|
721 |
||
6723 | 722 |
local structure P = OuterParse and K = OuterSyntax.Keyword in |
6360 | 723 |
|
724 |
val datatype_decl = |
|
6723 | 725 |
Scan.option (P.$$$ "(" |-- P.name --| P.$$$ ")") -- P.type_args -- P.name -- P.opt_infix -- |
6729 | 726 |
(P.$$$ "=" |-- P.enum1 "|" (P.name -- Scan.repeat P.typ -- P.opt_mixfix --| P.marg_comment)); |
6360 | 727 |
|
728 |
fun mk_datatype args = |
|
729 |
let |
|
730 |
val names = map (fn ((((None, _), t), _), _) => t | ((((Some t, _), _), _), _) => t) args; |
|
731 |
val specs = map (fn ((((_, vs), t), mx), cons) => (vs, t, mx, map (fn ((x, y), z) => (x, y, z)) cons)) args; |
|
732 |
in #1 o add_datatype false names specs end; |
|
733 |
||
734 |
val datatypeP = |
|
6723 | 735 |
OuterSyntax.command "datatype" "define inductive datatypes" K.thy_decl |
736 |
(P.and_list1 datatype_decl >> (Toplevel.theory o mk_datatype)); |
|
6360 | 737 |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
738 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
739 |
val rep_datatype_decl = |
6723 | 740 |
Scan.option (Scan.repeat1 P.name) -- |
741 |
Scan.optional (P.$$$ "distinct" |-- P.!!! (P.and_list1 P.xthms1)) [] -- |
|
742 |
Scan.optional (P.$$$ "inject" |-- P.!!! (P.and_list1 P.xthms1)) [] -- |
|
743 |
(P.$$$ "induction" |-- P.!!! P.xthm); |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
744 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
745 |
fun mk_rep_datatype (((opt_ts, dss), iss), ind) = #1 o rep_datatype opt_ts dss iss ind; |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
746 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
747 |
val rep_datatypeP = |
6723 | 748 |
OuterSyntax.command "rep_datatype" "represent existing types inductively" K.thy_decl |
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
749 |
(rep_datatype_decl >> (Toplevel.theory o mk_rep_datatype)); |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
750 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
751 |
|
6479
b0448cab1b1e
rep_datatype syntax: 'induction' instead of 'induct';
wenzelm
parents:
6441
diff
changeset
|
752 |
val _ = OuterSyntax.add_keywords ["distinct", "inject", "induction"]; |
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
753 |
val _ = OuterSyntax.add_parsers [datatypeP, rep_datatypeP]; |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
754 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
755 |
end; |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
756 |
|
6360 | 757 |
|
5177 | 758 |
end; |
759 |
||
6360 | 760 |
structure BasicDatatypePackage: BASIC_DATATYPE_PACKAGE = DatatypePackage; |
761 |
open BasicDatatypePackage; |