author | wenzelm |
Wed, 04 Apr 2007 23:29:38 +0200 | |
changeset 22598 | f31a869077f0 |
parent 22578 | b0eb5652f210 |
child 22675 | acf10be7dcca |
permissions | -rw-r--r-- |
5177 | 1 |
(* Title: HOL/Tools/datatype_package.ML |
2 |
ID: $Id$ |
|
11539 | 3 |
Author: Stefan Berghofer, TU Muenchen |
5177 | 4 |
|
6360 | 5 |
Datatype package for Isabelle/HOL. |
5177 | 6 |
*) |
7 |
||
6360 | 8 |
signature BASIC_DATATYPE_PACKAGE = |
9 |
sig |
|
10 |
val induct_tac : string -> int -> tactic |
|
9747 | 11 |
val induct_thm_tac : thm -> string -> int -> tactic |
8437 | 12 |
val case_tac : string -> int -> tactic |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
13 |
val distinct_simproc : simproc |
6360 | 14 |
end; |
15 |
||
5177 | 16 |
signature DATATYPE_PACKAGE = |
17 |
sig |
|
6360 | 18 |
include BASIC_DATATYPE_PACKAGE |
5661 | 19 |
val quiet_mode : bool ref |
20 |
val add_datatype : bool -> string list -> (string list * bstring * mixfix * |
|
18008 | 21 |
(bstring * string list * mixfix) list) list -> theory -> |
5177 | 22 |
{distinct : thm list list, |
23 |
inject : thm list list, |
|
24 |
exhaustion : thm list, |
|
25 |
rec_thms : thm list, |
|
26 |
case_thms : thm list list, |
|
27 |
split_thms : (thm * thm) list, |
|
28 |
induction : thm, |
|
29 |
size : thm list, |
|
18008 | 30 |
simps : thm list} * theory |
14887 | 31 |
val add_datatype_i : bool -> bool -> string list -> (string list * bstring * mixfix * |
18008 | 32 |
(bstring * typ list * mixfix) list) list -> theory -> |
5177 | 33 |
{distinct : thm list list, |
34 |
inject : thm list list, |
|
35 |
exhaustion : thm list, |
|
36 |
rec_thms : thm list, |
|
37 |
case_thms : thm list list, |
|
38 |
split_thms : (thm * thm) list, |
|
39 |
induction : thm, |
|
40 |
size : thm list, |
|
18008 | 41 |
simps : thm list} * theory |
18728 | 42 |
val rep_datatype_i : string list option -> (thm list * attribute list) list list -> |
43 |
(thm list * attribute list) list list -> (thm list * attribute list) -> |
|
18008 | 44 |
theory -> |
6385
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, |
18008 | 53 |
simps : thm list} * theory |
15703 | 54 |
val rep_datatype : string list option -> (thmref * Attrib.src list) list list -> |
18008 | 55 |
(thmref * Attrib.src list) list list -> thmref * Attrib.src list -> 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, |
|
18008 | 64 |
simps : thm list} * theory |
5177 | 65 |
val get_datatypes : theory -> DatatypeAux.datatype_info Symtab.table |
19346 | 66 |
val get_datatype : theory -> string -> DatatypeAux.datatype_info option |
67 |
val the_datatype : theory -> string -> DatatypeAux.datatype_info |
|
68 |
val get_datatype_spec : theory -> string -> ((string * sort) list * (string * typ list) list) option |
|
69 |
val get_datatype_constrs : theory -> string -> (string * typ) list option |
|
6441 | 70 |
val print_datatypes : theory -> unit |
18708 | 71 |
val setup: theory -> theory |
5177 | 72 |
end; |
73 |
||
74 |
structure DatatypePackage : DATATYPE_PACKAGE = |
|
75 |
struct |
|
76 |
||
77 |
open DatatypeAux; |
|
78 |
||
5661 | 79 |
val quiet_mode = quiet_mode; |
80 |
||
6360 | 81 |
|
5177 | 82 |
(* data kind 'HOL/datatypes' *) |
83 |
||
16430 | 84 |
structure DatatypesData = TheoryDataFun |
85 |
(struct |
|
5177 | 86 |
val name = "HOL/datatypes"; |
87 |
type T = datatype_info Symtab.table; |
|
88 |
||
89 |
val empty = Symtab.empty; |
|
6556 | 90 |
val copy = I; |
16430 | 91 |
val extend = I; |
92 |
fun merge _ tabs : T = Symtab.merge (K true) tabs; |
|
5177 | 93 |
|
94 |
fun print sg tab = |
|
95 |
Pretty.writeln (Pretty.strs ("datatypes:" :: |
|
16364 | 96 |
map #1 (NameSpace.extern_table (Sign.type_space sg, tab)))); |
16430 | 97 |
end); |
5177 | 98 |
|
99 |
val get_datatypes = DatatypesData.get; |
|
100 |
val put_datatypes = DatatypesData.put; |
|
6441 | 101 |
val print_datatypes = DatatypesData.print; |
5177 | 102 |
|
103 |
||
104 |
(** theory information about datatypes **) |
|
105 |
||
19346 | 106 |
val get_datatype = Symtab.lookup o get_datatypes; |
5177 | 107 |
|
19346 | 108 |
fun the_datatype thy name = (case get_datatype thy name of |
15531 | 109 |
SOME info => info |
110 |
| NONE => error ("Unknown datatype " ^ quote name)); |
|
5177 | 111 |
|
19346 | 112 |
fun get_datatype_descr thy dtco = |
113 |
get_datatype thy dtco |
|
114 |
|> Option.map (fn info as { descr, index, ... } => |
|
115 |
(info, (((fn SOME (_, dtys, cos) => (dtys, cos)) o AList.lookup (op =) descr) index))); |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
116 |
|
19346 | 117 |
fun get_datatype_spec thy dtco = |
18518 | 118 |
let |
19346 | 119 |
fun mk_cons typ_of_dtyp (co, tys) = |
120 |
(co, map typ_of_dtyp tys); |
|
121 |
fun mk_dtyp ({ sorts = raw_sorts, descr, ... } : DatatypeAux.datatype_info, (dtys, cos)) = |
|
122 |
let |
|
123 |
val sorts = map ((fn v => (v, (the o AList.lookup (op =) raw_sorts) v)) |
|
124 |
o DatatypeAux.dest_DtTFree) dtys; |
|
125 |
val typ_of_dtyp = DatatypeAux.typ_of_dtyp descr sorts; |
|
126 |
val tys = map typ_of_dtyp dtys; |
|
127 |
in (sorts, map (mk_cons typ_of_dtyp) cos) end; |
|
128 |
in Option.map mk_dtyp (get_datatype_descr thy dtco) end; |
|
18518 | 129 |
|
19346 | 130 |
fun get_datatype_constrs thy dtco = |
131 |
case get_datatype_spec thy dtco |
|
132 |
of SOME (sorts, cos) => |
|
133 |
let |
|
134 |
fun subst (v, sort) = TVar ((v, 0), sort); |
|
135 |
fun subst_ty (TFree v) = subst v |
|
136 |
| subst_ty ty = ty; |
|
137 |
val dty = Type (dtco, map subst sorts); |
|
138 |
fun mk_co (co, tys) = (co, map (Term.map_atyps subst_ty) tys ---> dty); |
|
139 |
in SOME (map mk_co cos) end |
|
140 |
| NONE => NONE; |
|
18518 | 141 |
|
5177 | 142 |
fun find_tname var Bi = |
143 |
let val frees = map dest_Free (term_frees Bi) |
|
14412
109cc0dc706b
find_tname now handles parameter renaming properly ("as they are printed").
berghofe
parents:
14174
diff
changeset
|
144 |
val params = rename_wrt_term Bi (Logic.strip_params Bi); |
17521 | 145 |
in case AList.lookup (op =) (frees @ params) var of |
15531 | 146 |
NONE => error ("No such variable in subgoal: " ^ quote var) |
147 |
| SOME(Type (tn, _)) => tn |
|
5177 | 148 |
| _ => error ("Cannot determine type of " ^ quote var) |
149 |
end; |
|
150 |
||
8279 | 151 |
fun infer_tname state i aterm = |
5177 | 152 |
let |
22578 | 153 |
val sign = Thm.theory_of_thm state; |
8279 | 154 |
val (_, _, Bi, _) = Thm.dest_state (state, i) |
5177 | 155 |
val params = Logic.strip_params Bi; (*params of subgoal i*) |
156 |
val params = rev (rename_wrt_term Bi params); (*as they are printed*) |
|
157 |
val (types, sorts) = types_sorts state; |
|
17521 | 158 |
fun types' (a, ~1) = (case AList.lookup (op =) params a of NONE => types(a, ~1) | sm => sm) |
5177 | 159 |
| types' ixn = types ixn; |
8100 | 160 |
val (ct, _) = read_def_cterm (sign, types', sorts) [] false (aterm, TypeInfer.logicT); |
5177 | 161 |
in case #T (rep_cterm ct) of |
162 |
Type (tn, _) => tn |
|
163 |
| _ => error ("Cannot determine type of " ^ quote aterm) |
|
164 |
end; |
|
165 |
||
166 |
(*Warn if the (induction) variable occurs Free among the premises, which |
|
167 |
usually signals a mistake. But calls the tactic either way!*) |
|
8405 | 168 |
fun occs_in_prems tacf vars = |
5177 | 169 |
SUBGOAL (fn (Bi, i) => |
21045 | 170 |
(if exists (fn (a, _) => member (op =) vars a) |
171 |
(fold Term.add_frees (#2 (strip_context Bi)) []) |
|
8405 | 172 |
then warning "Induction variable occurs also among premises!" |
173 |
else (); |
|
174 |
tacf i)); |
|
5177 | 175 |
|
8689 | 176 |
|
5177 | 177 |
(* generic induction tactic for datatypes *) |
178 |
||
8689 | 179 |
local |
180 |
||
15531 | 181 |
fun prep_var (Var (ixn, _), SOME x) = SOME (ixn, x) |
182 |
| prep_var _ = NONE; |
|
8689 | 183 |
|
21045 | 184 |
fun prep_inst (concl, xs) = (*exception Library.UnequalLengths*) |
11725 | 185 |
let val vs = InductAttrib.vars_of concl |
21045 | 186 |
in map_filter prep_var (Library.drop (length vs - length xs, vs) ~~ xs) end; |
8689 | 187 |
|
188 |
in |
|
189 |
||
18751
38dc4ff2a32b
bugfix: induct_tac no longer raises THM "dest_state"
paulson
parents:
18728
diff
changeset
|
190 |
fun gen_induct_tac inst_tac (varss, opt_rule) i state = |
38dc4ff2a32b
bugfix: induct_tac no longer raises THM "dest_state"
paulson
parents:
18728
diff
changeset
|
191 |
SUBGOAL (fn (Bi,_) => |
5177 | 192 |
let |
8672 | 193 |
val (rule, rule_name) = |
18751
38dc4ff2a32b
bugfix: induct_tac no longer raises THM "dest_state"
paulson
parents:
18728
diff
changeset
|
194 |
case opt_rule of |
21045 | 195 |
SOME r => (r, "Induction rule") |
196 |
| NONE => |
|
197 |
let val tn = find_tname (hd (map_filter I (flat varss))) Bi |
|
22598 | 198 |
val thy = Thm.theory_of_thm state |
199 |
in (#induction (the_datatype thy tn), "Induction rule for type " ^ tn) |
|
21045 | 200 |
end |
11725 | 201 |
val concls = HOLogic.dest_concls (Thm.concl_of rule); |
21045 | 202 |
val insts = maps prep_inst (concls ~~ varss) handle Library.UnequalLengths => |
8689 | 203 |
error (rule_name ^ " has different numbers of variables"); |
18751
38dc4ff2a32b
bugfix: induct_tac no longer raises THM "dest_state"
paulson
parents:
18728
diff
changeset
|
204 |
in occs_in_prems (inst_tac insts rule) (map #2 insts) i end) |
38dc4ff2a32b
bugfix: induct_tac no longer raises THM "dest_state"
paulson
parents:
18728
diff
changeset
|
205 |
i state; |
8689 | 206 |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
207 |
fun induct_tac s = |
15444
4f14c151d9f1
induct_tac and case_tac no longer depend on Syntax.string_of_vname.
berghofe
parents:
14981
diff
changeset
|
208 |
gen_induct_tac Tactic.res_inst_tac' |
21045 | 209 |
(map (single o SOME) (Syntax.read_idents s), NONE); |
8689 | 210 |
|
9747 | 211 |
fun induct_thm_tac th s = |
15444
4f14c151d9f1
induct_tac and case_tac no longer depend on Syntax.string_of_vname.
berghofe
parents:
14981
diff
changeset
|
212 |
gen_induct_tac Tactic.res_inst_tac' |
15531 | 213 |
([map SOME (Syntax.read_idents s)], SOME th); |
9747 | 214 |
|
8689 | 215 |
end; |
5177 | 216 |
|
8279 | 217 |
|
8437 | 218 |
(* generic case tactic for datatypes *) |
5177 | 219 |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
220 |
fun case_inst_tac inst_tac t rule i state = |
8672 | 221 |
let |
222 |
val _ $ Var (ixn, _) $ _ = HOLogic.dest_Trueprop |
|
223 |
(hd (Logic.strip_assums_hyp (hd (Thm.prems_of rule)))); |
|
15444
4f14c151d9f1
induct_tac and case_tac no longer depend on Syntax.string_of_vname.
berghofe
parents:
14981
diff
changeset
|
224 |
in inst_tac [(ixn, t)] rule i state end; |
8672 | 225 |
|
15531 | 226 |
fun gen_case_tac inst_tac (t, SOME rule) i state = |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
227 |
case_inst_tac inst_tac t rule i state |
15531 | 228 |
| gen_case_tac inst_tac (t, NONE) i state = |
8672 | 229 |
let val tn = infer_tname state i t in |
15444
4f14c151d9f1
induct_tac and case_tac no longer depend on Syntax.string_of_vname.
berghofe
parents:
14981
diff
changeset
|
230 |
if tn = HOLogic.boolN then inst_tac [(("P", 0), t)] case_split_thm i state |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
231 |
else case_inst_tac inst_tac t |
22578 | 232 |
(#exhaustion (the_datatype (Thm.theory_of_thm state) tn)) |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
233 |
i state |
14471
5688b05b2575
case_tac no longer raises THM exception if goal number is out of range.
berghofe
parents:
14412
diff
changeset
|
234 |
end handle THM _ => Seq.empty; |
8672 | 235 |
|
15531 | 236 |
fun case_tac t = gen_case_tac Tactic.res_inst_tac' (t, NONE); |
8672 | 237 |
|
8279 | 238 |
|
239 |
||
8541 | 240 |
(** Isar tactic emulations **) |
241 |
||
8672 | 242 |
local |
243 |
||
8689 | 244 |
val rule_spec = Scan.lift (Args.$$$ "rule" -- Args.$$$ ":"); |
18988 | 245 |
val opt_rule = Scan.option (rule_spec |-- Attrib.thm); |
8689 | 246 |
|
15703 | 247 |
val varss = |
248 |
Args.and_list (Scan.repeat (Scan.unless rule_spec (Scan.lift (Args.maybe Args.name)))); |
|
8672 | 249 |
|
20328 | 250 |
val inst_tac = RuleInsts.bires_inst_tac false; |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
251 |
|
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
252 |
fun induct_meth ctxt (varss, opt_rule) = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
253 |
gen_induct_tac (inst_tac ctxt) (varss, opt_rule); |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
254 |
fun case_meth ctxt (varss, opt_rule) = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
255 |
gen_case_tac (inst_tac ctxt) (varss, opt_rule); |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
256 |
|
8672 | 257 |
in |
8541 | 258 |
|
259 |
val tactic_emulations = |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
260 |
[("induct_tac", Method.goal_args_ctxt' (varss -- opt_rule) induct_meth, |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
261 |
"induct_tac emulation (dynamic instantiation)"), |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
262 |
("case_tac", Method.goal_args_ctxt' (Scan.lift Args.name -- opt_rule) case_meth, |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
263 |
"case_tac emulation (dynamic instantiation)")]; |
8672 | 264 |
|
265 |
end; |
|
8541 | 266 |
|
267 |
||
5177 | 268 |
|
8437 | 269 |
(** induct method setup **) |
270 |
||
271 |
(* case names *) |
|
272 |
||
273 |
local |
|
274 |
||
275 |
fun dt_recs (DtTFree _) = [] |
|
21045 | 276 |
| dt_recs (DtType (_, dts)) = maps dt_recs dts |
8437 | 277 |
| dt_recs (DtRec i) = [i]; |
278 |
||
279 |
fun dt_cases (descr: descr) (_, args, constrs) = |
|
280 |
let |
|
21045 | 281 |
fun the_bname i = Sign.base_name (#1 (the (AList.lookup (op =) descr i))); |
282 |
val bnames = map the_bname (distinct (op =) (maps dt_recs args)); |
|
8437 | 283 |
in map (fn (c, _) => space_implode "_" (Sign.base_name c :: bnames)) constrs end; |
284 |
||
285 |
||
286 |
fun induct_cases descr = |
|
21045 | 287 |
DatatypeProp.indexify_names (maps (dt_cases descr) (map #2 descr)); |
8437 | 288 |
|
21045 | 289 |
fun exhaust_cases descr i = dt_cases descr (the (AList.lookup (op =) descr i)); |
8437 | 290 |
|
291 |
in |
|
292 |
||
293 |
fun mk_case_names_induct descr = RuleCases.case_names (induct_cases descr); |
|
294 |
||
295 |
fun mk_case_names_exhausts descr new = |
|
296 |
map (RuleCases.case_names o exhaust_cases descr o #1) |
|
21045 | 297 |
(filter (fn ((_, (name, _, _))) => member (op =) new name) descr); |
8437 | 298 |
|
299 |
end; |
|
300 |
||
11345
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
301 |
fun add_rules simps case_thms size_thms rec_thms inject distinct |
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
302 |
weak_case_congs cong_att = |
21127 | 303 |
PureThy.add_thmss [(("simps", simps), []), |
21045 | 304 |
(("", flat case_thms @ size_thms @ |
305 |
flat distinct @ rec_thms), [Simplifier.simp_add]), |
|
21127 | 306 |
(("", size_thms @ rec_thms), [RecfunCodegen.add NONE]), |
307 |
(("", flat inject), [iff_add]), |
|
21689
58abd6d8abd1
Removal of theorem tagging, which the ATP linkup no longer requires,
paulson
parents:
21646
diff
changeset
|
308 |
(("", map (fn th => th RS notE) (flat distinct)), [Classical.safe_elim NONE]), |
21127 | 309 |
(("", weak_case_congs), [cong_att])] |
310 |
#> snd; |
|
11345
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
311 |
|
8437 | 312 |
|
313 |
(* add_cases_induct *) |
|
8306 | 314 |
|
19874 | 315 |
fun add_cases_induct infos induction thy = |
8306 | 316 |
let |
19874 | 317 |
val inducts = ProjectRule.projections (ProofContext.init thy) induction; |
8405 | 318 |
|
11805
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
319 |
fun named_rules (name, {index, exhaustion, ...}: datatype_info) = |
19874 | 320 |
[(("", nth inducts index), [InductAttrib.induct_type name]), |
18728 | 321 |
(("", exhaustion), [InductAttrib.cases_type name])]; |
11805
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
322 |
fun unnamed_rule i = |
19874 | 323 |
(("", nth inducts i), [PureThy.kind_internal, InductAttrib.induct_type ""]); |
18462 | 324 |
in |
19874 | 325 |
thy |> PureThy.add_thms |
21045 | 326 |
(maps named_rules infos @ |
19874 | 327 |
map unnamed_rule (length infos upto length inducts - 1)) |> snd |
328 |
|> PureThy.add_thmss [(("inducts", inducts), [])] |> snd |
|
18462 | 329 |
end; |
8306 | 330 |
|
5177 | 331 |
|
8405 | 332 |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
333 |
(**** simplification procedure for showing distinctness of constructors ****) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
334 |
|
7060 | 335 |
fun stripT (i, Type ("fun", [_, T])) = stripT (i + 1, T) |
336 |
| stripT p = p; |
|
337 |
||
338 |
fun stripC (i, f $ x) = stripC (i + 1, f) |
|
339 |
| stripC p = p; |
|
340 |
||
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
341 |
val distinctN = "constr_distinct"; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
342 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
343 |
exception ConstrDistinct of term; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
344 |
|
19539 | 345 |
fun distinct_proc thy ss (t as Const ("op =", _) $ t1 $ t2) = |
7060 | 346 |
(case (stripC (0, t1), stripC (0, t2)) of |
347 |
((i, Const (cname1, T1)), (j, Const (cname2, T2))) => |
|
348 |
(case (stripT (0, T1), stripT (0, T2)) of |
|
349 |
((i', Type (tname1, _)), (j', Type (tname2, _))) => |
|
350 |
if tname1 = tname2 andalso not (cname1 = cname2) andalso i = i' andalso j = j' then |
|
19539 | 351 |
(case (get_datatype_descr thy) tname1 of |
19346 | 352 |
SOME (_, (_, constrs)) => let val cnames = map fst constrs |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
353 |
in if cname1 mem cnames andalso cname2 mem cnames then |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
354 |
let val eq_t = Logic.mk_equals (t, Const ("False", HOLogic.boolT)); |
19539 | 355 |
val eq_ct = cterm_of thy eq_t; |
356 |
val Datatype_thy = ThyInfo.the_theory "Datatype" thy; |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
357 |
val [In0_inject, In1_inject, In0_not_In1, In1_not_In0] = |
16486 | 358 |
map (get_thm Datatype_thy o Name) |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
359 |
["In0_inject", "In1_inject", "In0_not_In1", "In1_not_In0"] |
19539 | 360 |
in (case (#distinct (the_datatype thy tname1)) of |
15531 | 361 |
QuickAndDirty => SOME (Thm.invoke_oracle |
19539 | 362 |
Datatype_thy distinctN (thy, ConstrDistinct eq_t)) |
20054 | 363 |
| FewConstrs thms => |
364 |
SOME (Goal.prove (Simplifier.the_context ss) [] [] eq_t (K |
|
365 |
(EVERY [rtac eq_reflection 1, rtac iffI 1, rtac notE 1, |
|
366 |
atac 2, resolve_tac thms 1, etac FalseE 1]))) |
|
367 |
| ManyConstrs (thm, simpset) => |
|
368 |
SOME (Goal.prove (Simplifier.the_context ss) [] [] eq_t (K |
|
369 |
(EVERY [rtac eq_reflection 1, rtac iffI 1, dtac thm 1, |
|
370 |
full_simp_tac (Simplifier.inherit_context ss simpset) 1, |
|
371 |
REPEAT (dresolve_tac [In0_inject, In1_inject] 1), |
|
372 |
eresolve_tac [In0_not_In1 RS notE, In1_not_In0 RS notE] 1, |
|
373 |
etac FalseE 1])))) |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
374 |
end |
15531 | 375 |
else NONE |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
376 |
end |
15531 | 377 |
| NONE => NONE) |
378 |
else NONE |
|
379 |
| _ => NONE) |
|
380 |
| _ => NONE) |
|
20054 | 381 |
| distinct_proc _ _ _ = NONE; |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
382 |
|
13462 | 383 |
val distinct_simproc = |
16430 | 384 |
Simplifier.simproc HOL.thy distinctN ["s = t"] distinct_proc; |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
385 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
386 |
val dist_ss = HOL_ss addsimprocs [distinct_simproc]; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
387 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
388 |
val simproc_setup = |
18708 | 389 |
Theory.add_oracle (distinctN, fn (_, ConstrDistinct t) => t) #> |
390 |
(fn thy => ((change_simpset_of thy) (fn ss => ss addsimprocs [distinct_simproc]); thy)); |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
391 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
392 |
|
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
393 |
(**** translation rules for case ****) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
394 |
|
21772 | 395 |
fun case_tr ctxt [t, u] = |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
396 |
let |
21772 | 397 |
val thy = ProofContext.theory_of ctxt; |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
398 |
fun case_error s name ts = raise TERM ("Error in case expression" ^ |
15570 | 399 |
getOpt (Option.map (curry op ^ " for datatype ") name, "") ^ ":\n" ^ s, ts); |
21187 | 400 |
fun dest_case1 (Const ("_case1", _) $ t $ u) = |
401 |
(case strip_comb t of |
|
402 |
(Const (s, _), ts) => |
|
403 |
(case try (unprefix Syntax.constN) s of |
|
404 |
SOME c => (c, ts) |
|
405 |
| NONE => (Sign.intern_const thy s, ts)) |
|
21253 | 406 |
| (Free (s, _), ts) => (Sign.intern_const thy s, ts) |
15531 | 407 |
| _ => case_error "Head is not a constructor" NONE [t, u], u) |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
408 |
| dest_case1 t = raise TERM ("dest_case1", [t]); |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
409 |
fun dest_case2 (Const ("_case2", _) $ t $ u) = t :: dest_case2 u |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
410 |
| dest_case2 t = [t]; |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
411 |
val cases as ((cname, _), _) :: _ = map dest_case1 (dest_case2 u); |
18857 | 412 |
val tab = Symtab.dest (get_datatypes thy); |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
413 |
val (cases', default) = (case split_last cases of |
15531 | 414 |
(cases', (("dummy_pattern", []), t)) => (cases', SOME t) |
415 |
| _ => (cases, NONE)) |
|
21045 | 416 |
fun abstr (Free (x, T)) body = Term.absfree (x, T, body) |
417 |
| abstr (Const ("_constrain", _) $ Free (x, T) $ tT) body = |
|
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
418 |
Syntax.const Syntax.constrainAbsC $ Term.absfree (x, T, body) $ tT |
21045 | 419 |
| abstr (Const ("Pair", _) $ x $ y) body = |
420 |
Syntax.const "split" $ (abstr x o abstr y) body |
|
421 |
| abstr t _ = case_error "Illegal pattern" NONE [t]; |
|
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
422 |
in case find_first (fn (_, {descr, index, ...}) => |
21045 | 423 |
exists (equal cname o fst) (#3 (snd (nth descr index)))) tab of |
15531 | 424 |
NONE => case_error ("Not a datatype constructor: " ^ cname) NONE [u] |
18319
c52b139ebde0
Added new component "sorts" to record datatype_info.
berghofe
parents:
18314
diff
changeset
|
425 |
| SOME (tname, {descr, sorts, case_name, index, ...}) => |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
426 |
let |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
427 |
val _ = if exists (equal "dummy_pattern" o fst o fst) cases' then |
15531 | 428 |
case_error "Illegal occurrence of '_' dummy pattern" (SOME tname) [u] else (); |
21045 | 429 |
val (_, (_, dts, constrs)) = nth descr index; |
430 |
fun find_case (s, dt) cases = |
|
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
431 |
(case find_first (equal s o fst o fst) cases' of |
21045 | 432 |
NONE => (list_abs (map (rpair dummyT) |
20173
c8f791af9a60
Some cases in "case ... of ..." expressions may now
berghofe
parents:
20071
diff
changeset
|
433 |
(DatatypeProp.make_tnames (map (typ_of_dtyp descr sorts) dt)), |
c8f791af9a60
Some cases in "case ... of ..." expressions may now
berghofe
parents:
20071
diff
changeset
|
434 |
case default of |
c8f791af9a60
Some cases in "case ... of ..." expressions may now
berghofe
parents:
20071
diff
changeset
|
435 |
NONE => (warning ("No clause for constructor " ^ s ^ |
22480 | 436 |
" in case expression"); Const ("HOL.undefined", dummyT)) |
21045 | 437 |
| SOME t => t), cases) |
15531 | 438 |
| SOME (c as ((_, vs), t)) => |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
439 |
if length dt <> length vs then |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
440 |
case_error ("Wrong number of arguments for constructor " ^ s) |
15531 | 441 |
(SOME tname) vs |
21045 | 442 |
else (fold_rev abstr vs t, remove (op =) c cases)) |
443 |
val (fs, cases'') = fold_map find_case constrs cases' |
|
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
444 |
in case (cases'', length constrs = length cases', default) of |
15531 | 445 |
([], true, SOME _) => |
446 |
case_error "Extra '_' dummy pattern" (SOME tname) [u] |
|
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
447 |
| (_ :: _, _, _) => |
19046
bc5c6c9b114e
removed distinct, renamed gen_distinct to distinct;
wenzelm
parents:
19008
diff
changeset
|
448 |
let val extra = distinct (op =) (map (fst o fst) cases'') |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
449 |
in case extra \\ map fst constrs of |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
450 |
[] => case_error ("More than one clause for constructor(s) " ^ |
15531 | 451 |
commas extra) (SOME tname) [u] |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
452 |
| extra' => case_error ("Illegal constructor(s): " ^ commas extra') |
15531 | 453 |
(SOME tname) [u] |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
454 |
end |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
455 |
| _ => list_comb (Syntax.const case_name, fs) $ t |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
456 |
end |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
457 |
end |
18857 | 458 |
| case_tr _ ts = raise TERM ("case_tr", ts); |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
459 |
|
21772 | 460 |
fun case_tr' constrs ctxt ts = |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
461 |
if length ts <> length constrs + 1 then raise Match else |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
462 |
let |
21772 | 463 |
val consts = ProofContext.consts_of ctxt; |
21253 | 464 |
|
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
465 |
val (fs, x) = split_last ts; |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
466 |
fun strip_abs 0 t = ([], t) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
467 |
| strip_abs i (Abs p) = |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
468 |
let val (x, u) = Syntax.atomic_abs_tr' p |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
469 |
in apfst (cons x) (strip_abs (i-1) u) end |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
470 |
| strip_abs i (Const ("split", _) $ t) = (case strip_abs (i+1) t of |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
471 |
(v :: v' :: vs, u) => (Syntax.const "Pair" $ v $ v' :: vs, u)); |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
472 |
fun is_dependent i t = |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
473 |
let val k = length (strip_abs_vars t) - i |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
474 |
in k < 0 orelse exists (fn j => j >= k) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
475 |
(loose_bnos (strip_abs_body t)) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
476 |
end; |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
477 |
val cases = map (fn ((cname, dts), t) => |
21253 | 478 |
(Consts.extern_early consts cname, |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
479 |
strip_abs (length dts) t, is_dependent (length dts) t)) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
480 |
(constrs ~~ fs); |
21045 | 481 |
fun count_cases (_, _, true) = I |
482 |
| count_cases (cname, (_, body), false) = |
|
483 |
AList.map_default (op = : term * term -> bool) |
|
484 |
(body, []) (cons cname) |
|
485 |
val cases' = sort (int_ord o swap o pairself (length o snd)) |
|
486 |
(fold_rev count_cases cases []); |
|
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
487 |
fun mk_case1 (cname, (vs, body), _) = Syntax.const "_case1" $ |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
488 |
list_comb (Syntax.const cname, vs) $ body; |
22480 | 489 |
fun is_undefined (Const ("HOL.undefined", _)) = true |
20173
c8f791af9a60
Some cases in "case ... of ..." expressions may now
berghofe
parents:
20071
diff
changeset
|
490 |
| is_undefined _ = false; |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
491 |
in |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
492 |
Syntax.const "_case_syntax" $ x $ |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
493 |
foldr1 (fn (t, u) => Syntax.const "_case2" $ t $ u) (map mk_case1 |
20173
c8f791af9a60
Some cases in "case ... of ..." expressions may now
berghofe
parents:
20071
diff
changeset
|
494 |
(case find_first (is_undefined o fst) cases' of |
c8f791af9a60
Some cases in "case ... of ..." expressions may now
berghofe
parents:
20071
diff
changeset
|
495 |
SOME (_, cnames) => |
c8f791af9a60
Some cases in "case ... of ..." expressions may now
berghofe
parents:
20071
diff
changeset
|
496 |
if length cnames = length constrs then [hd cases] |
c8f791af9a60
Some cases in "case ... of ..." expressions may now
berghofe
parents:
20071
diff
changeset
|
497 |
else filter_out (fn (_, (_, body), _) => is_undefined body) cases |
c8f791af9a60
Some cases in "case ... of ..." expressions may now
berghofe
parents:
20071
diff
changeset
|
498 |
| NONE => case cases' of |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
499 |
[] => cases |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
500 |
| (default, cnames) :: _ => |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
501 |
if length cnames = 1 then cases |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
502 |
else if length cnames = length constrs then |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
503 |
[hd cases, ("dummy_pattern", ([], default), false)] |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
504 |
else |
21045 | 505 |
filter_out (fn (cname, _, _) => member (op =) cnames cname) cases @ |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
506 |
[("dummy_pattern", ([], default), false)])) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
507 |
end; |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
508 |
|
21045 | 509 |
fun make_case_tr' case_names descr = maps |
510 |
(fn ((_, (_, _, constrs)), case_name) => |
|
511 |
map (rpair (case_tr' constrs)) (NameSpace.accesses' case_name)) |
|
512 |
(descr ~~ case_names); |
|
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
513 |
|
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
514 |
val trfun_setup = |
18708 | 515 |
Theory.add_advanced_trfuns ([], [("_case_syntax", case_tr)], [], []); |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
516 |
|
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
517 |
|
5177 | 518 |
(* prepare types *) |
519 |
||
520 |
fun read_typ sign ((Ts, sorts), str) = |
|
521 |
let |
|
17521 | 522 |
val T = Type.no_tvars (Sign.read_typ (sign, AList.lookup (op =) |
5177 | 523 |
(map (apfst (rpair ~1)) sorts)) str) handle TYPE (msg, _, _) => error msg |
524 |
in (Ts @ [T], add_typ_tfrees (T, sorts)) end; |
|
525 |
||
526 |
fun cert_typ sign ((Ts, sorts), raw_T) = |
|
527 |
let |
|
528 |
val T = Type.no_tvars (Sign.certify_typ sign raw_T) handle |
|
529 |
TYPE (msg, _, _) => error msg; |
|
530 |
val sorts' = add_typ_tfrees (T, sorts) |
|
531 |
in (Ts @ [T], |
|
18964 | 532 |
case duplicates (op =) (map fst sorts') of |
5177 | 533 |
[] => sorts' |
534 |
| dups => error ("Inconsistent sort constraints for " ^ commas dups)) |
|
535 |
end; |
|
536 |
||
537 |
||
538 |
(**** make datatype info ****) |
|
539 |
||
18319
c52b139ebde0
Added new component "sorts" to record datatype_info.
berghofe
parents:
18314
diff
changeset
|
540 |
fun make_dt_info descr sorts induct reccomb_names rec_thms |
10121 | 541 |
(((((((((i, (_, (tname, _, _))), case_name), case_thms), |
542 |
exhaustion_thm), distinct_thm), inject), nchotomy), case_cong), weak_case_cong) = |
|
543 |
(tname, |
|
544 |
{index = i, |
|
545 |
descr = descr, |
|
18319
c52b139ebde0
Added new component "sorts" to record datatype_info.
berghofe
parents:
18314
diff
changeset
|
546 |
sorts = sorts, |
10121 | 547 |
rec_names = reccomb_names, |
548 |
rec_rewrites = rec_thms, |
|
549 |
case_name = case_name, |
|
550 |
case_rewrites = case_thms, |
|
551 |
induction = induct, |
|
552 |
exhaustion = exhaustion_thm, |
|
553 |
distinct = distinct_thm, |
|
554 |
inject = inject, |
|
555 |
nchotomy = nchotomy, |
|
556 |
case_cong = case_cong, |
|
557 |
weak_case_cong = weak_case_cong}); |
|
5177 | 558 |
|
559 |
||
560 |
(********************* axiomatic introduction of datatypes ********************) |
|
561 |
||
20597 | 562 |
fun add_axiom label t atts thy = |
563 |
thy |
|
564 |
|> PureThy.add_axioms_i [((label, t), atts)]; |
|
565 |
||
566 |
fun add_axioms label ts atts thy = |
|
567 |
thy |
|
568 |
|> PureThy.add_axiomss_i [((label, ts), atts)]; |
|
8437 | 569 |
|
20597 | 570 |
fun add_and_get_axioms_atts label tnames ts attss = |
571 |
fold_map (fn (tname, (atts, t)) => fn thy => |
|
572 |
thy |
|
573 |
|> Theory.add_path tname |
|
574 |
|> add_axiom label t atts |
|
575 |
||> Theory.parent_path |
|
576 |
|-> (fn [ax] => pair ax)) (tnames ~~ (attss ~~ ts)); |
|
5177 | 577 |
|
20597 | 578 |
fun add_and_get_axioms label tnames ts = |
579 |
add_and_get_axioms_atts label tnames ts (replicate (length tnames) []); |
|
580 |
||
581 |
fun add_and_get_axiomss label tnames tss = |
|
582 |
fold_map (fn (tname, ts) => fn thy => |
|
583 |
thy |
|
584 |
|> Theory.add_path tname |
|
585 |
|> add_axioms label ts [] |
|
586 |
||> Theory.parent_path |
|
587 |
|-> (fn [ax] => pair ax)) (tnames ~~ tss); |
|
5177 | 588 |
|
19716 | 589 |
fun specify_consts args thy = |
20597 | 590 |
let |
591 |
val specs = map (fn (c, T, mx) => |
|
592 |
Const (Sign.full_name thy (Syntax.const_name c mx), T)) args; |
|
593 |
in |
|
594 |
thy |
|
595 |
|> Sign.add_consts_i args |
|
596 |
|> Theory.add_finals_i false specs |
|
597 |
end; |
|
19716 | 598 |
|
8437 | 599 |
fun add_datatype_axm flat_names new_type_names descr sorts types_syntax constr_syntax dt_info |
600 |
case_names_induct case_names_exhausts thy = |
|
5177 | 601 |
let |
21045 | 602 |
val descr' = flat descr; |
5177 | 603 |
val recTs = get_rec_types descr' sorts; |
21045 | 604 |
val used = map fst (fold Term.add_tfreesT recTs []); |
15570 | 605 |
val newTs = Library.take (length (hd descr), recTs); |
5177 | 606 |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
607 |
val no_size = exists (fn (_, (_, _, constrs)) => exists (fn (_, cargs) => exists |
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
13480
diff
changeset
|
608 |
(fn dt => is_rec_type dt andalso not (null (fst (strip_dtyp dt)))) |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
13480
diff
changeset
|
609 |
cargs) constrs) descr'; |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
610 |
|
5177 | 611 |
(**** declare new types and constants ****) |
612 |
||
613 |
val tyvars = map (fn (_, (_, Ts, _)) => map dest_DtTFree Ts) (hd descr); |
|
614 |
||
615 |
val constr_decls = map (fn (((_, (_, _, constrs)), T), constr_syntax') => |
|
616 |
map (fn ((_, cargs), (cname, mx)) => |
|
617 |
(cname, map (typ_of_dtyp descr' sorts) cargs ---> T, mx)) |
|
618 |
(constrs ~~ constr_syntax')) ((hd descr) ~~ newTs ~~ constr_syntax); |
|
619 |
||
15457
1fbd4aba46e3
Adapted to modified interface of PureThy.get_thm(s).
berghofe
parents:
15444
diff
changeset
|
620 |
val (rec_result_Ts, reccomb_fn_Ts) = DatatypeProp.make_primrec_Ts descr sorts used; |
5177 | 621 |
|
622 |
val big_reccomb_name = (space_implode "_" new_type_names) ^ "_rec"; |
|
623 |
val reccomb_names = if length descr' = 1 then [big_reccomb_name] else |
|
624 |
(map ((curry (op ^) (big_reccomb_name ^ "_")) o string_of_int) |
|
625 |
(1 upto (length descr'))); |
|
626 |
||
9739 | 627 |
val size_names = DatatypeProp.indexify_names |
15570 | 628 |
(map (fn T => name_of_typ T ^ "_size") (Library.drop (length (hd descr), recTs))); |
5177 | 629 |
|
20071
8f3e1ddb50e6
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
20054
diff
changeset
|
630 |
val freeT = TFree (Name.variant used "'t", HOLogic.typeS); |
5177 | 631 |
val case_fn_Ts = map (fn (i, (_, _, constrs)) => |
632 |
map (fn (_, cargs) => |
|
633 |
let val Ts = map (typ_of_dtyp descr' sorts) cargs |
|
634 |
in Ts ---> freeT end) constrs) (hd descr); |
|
635 |
||
636 |
val case_names = map (fn s => (s ^ "_case")) new_type_names; |
|
637 |
||
21419 | 638 |
fun instance_size_class tyco thy = |
639 |
let |
|
640 |
val size_sort = ["Nat.size"]; |
|
641 |
val n = Sign.arity_number thy tyco; |
|
642 |
in |
|
643 |
thy |
|
644 |
|> AxClass.prove_arity (tyco, replicate n HOLogic.typeS, size_sort) |
|
645 |
(ClassPackage.intro_classes_tac []) |
|
646 |
end |
|
647 |
||
21045 | 648 |
val thy2' = thy |
5177 | 649 |
|
650 |
(** new types **) |
|
21419 | 651 |
|> fold2 (fn (name, mx) => fn tvs => TypedefPackage.add_typedecls [(name, tvs, mx)]) |
652 |
types_syntax tyvars |
|
653 |
|> fold (fn (_, (name, _, _)) => instance_size_class name) descr' |
|
21045 | 654 |
|> add_path flat_names (space_implode "_" new_type_names) |
5177 | 655 |
|
656 |
(** primrec combinators **) |
|
657 |
||
21045 | 658 |
|> specify_consts (map (fn ((name, T), T') => |
659 |
(name, reccomb_fn_Ts @ [T] ---> T', NoSyn)) (reccomb_names ~~ recTs ~~ rec_result_Ts)) |
|
5177 | 660 |
|
661 |
(** case combinators **) |
|
662 |
||
21045 | 663 |
|> specify_consts (map (fn ((name, T), Ts) => |
664 |
(name, Ts @ [T] ---> freeT, NoSyn)) (case_names ~~ newTs ~~ case_fn_Ts)); |
|
6305 | 665 |
|
19716 | 666 |
val reccomb_names' = map (Sign.full_name thy2') reccomb_names; |
667 |
val case_names' = map (Sign.full_name thy2') case_names; |
|
6305 | 668 |
|
21045 | 669 |
val thy2 = thy2' |
5177 | 670 |
|
671 |
(** size functions **) |
|
672 |
||
21045 | 673 |
|> (if no_size then I else specify_consts (map (fn (s, T) => |
5177 | 674 |
(Sign.base_name s, T --> HOLogic.natT, NoSyn)) |
21045 | 675 |
(size_names ~~ Library.drop (length (hd descr), recTs)))) |
5661 | 676 |
|
677 |
(** constructors **) |
|
678 |
||
21045 | 679 |
|> parent_path flat_names |
680 |
|> fold (fn ((((_, (_, _, constrs)), T), tname), |
|
681 |
constr_syntax') => |
|
682 |
add_path flat_names tname #> |
|
19716 | 683 |
specify_consts (map (fn ((_, cargs), (cname, mx)) => |
5661 | 684 |
(cname, map (typ_of_dtyp descr' sorts) cargs ---> T, mx)) |
21045 | 685 |
(constrs ~~ constr_syntax')) #> |
686 |
parent_path flat_names) |
|
5661 | 687 |
(hd descr ~~ newTs ~~ new_type_names ~~ constr_syntax); |
5177 | 688 |
|
689 |
(**** introduction of axioms ****) |
|
690 |
||
5661 | 691 |
val rec_axs = DatatypeProp.make_primrecs new_type_names descr sorts thy2; |
9739 | 692 |
val size_axs = if no_size then [] else DatatypeProp.make_size descr sorts thy2; |
5661 | 693 |
|
18377 | 694 |
val ((([induct], [rec_thms]), inject), thy3) = |
695 |
thy2 |
|
696 |
|> Theory.add_path (space_implode "_" new_type_names) |
|
20597 | 697 |
|> add_axiom "induct" (DatatypeProp.make_ind descr sorts) [case_names_induct] |
698 |
||>> add_axioms "recs" rec_axs [] |
|
699 |
||> (if no_size then I else add_axioms "size" size_axs [] #> snd) |
|
18377 | 700 |
||> Theory.parent_path |
701 |
||>> add_and_get_axiomss "inject" new_type_names |
|
702 |
(DatatypeProp.make_injs descr sorts); |
|
16486 | 703 |
val size_thms = if no_size then [] else get_thms thy3 (Name "size"); |
18377 | 704 |
val (distinct, thy4) = add_and_get_axiomss "distinct" new_type_names |
5177 | 705 |
(DatatypeProp.make_distincts new_type_names descr sorts thy3) thy3; |
8437 | 706 |
|
707 |
val exhaust_ts = DatatypeProp.make_casedists descr sorts; |
|
18377 | 708 |
val (exhaustion, thy5) = add_and_get_axioms_atts "exhaust" new_type_names |
20597 | 709 |
exhaust_ts (map single case_names_exhausts) thy4; |
18377 | 710 |
val (case_thms, thy6) = add_and_get_axiomss "cases" new_type_names |
5177 | 711 |
(DatatypeProp.make_cases new_type_names descr sorts thy5) thy5; |
712 |
val (split_ts, split_asm_ts) = ListPair.unzip |
|
713 |
(DatatypeProp.make_splits new_type_names descr sorts thy6); |
|
18377 | 714 |
val (split, thy7) = add_and_get_axioms "split" new_type_names split_ts thy6; |
715 |
val (split_asm, thy8) = add_and_get_axioms "split_asm" new_type_names |
|
5177 | 716 |
split_asm_ts thy7; |
18377 | 717 |
val (nchotomys, thy9) = add_and_get_axioms "nchotomy" new_type_names |
5177 | 718 |
(DatatypeProp.make_nchotomys descr sorts) thy8; |
18377 | 719 |
val (case_congs, thy10) = add_and_get_axioms "case_cong" new_type_names |
5177 | 720 |
(DatatypeProp.make_case_congs new_type_names descr sorts thy9) thy9; |
18377 | 721 |
val (weak_case_congs, thy11) = add_and_get_axioms "weak_case_cong" new_type_names |
8601 | 722 |
(DatatypeProp.make_weak_case_congs new_type_names descr sorts thy10) thy10; |
8405 | 723 |
|
18319
c52b139ebde0
Added new component "sorts" to record datatype_info.
berghofe
parents:
18314
diff
changeset
|
724 |
val dt_infos = map (make_dt_info descr' sorts induct reccomb_names' rec_thms) |
6305 | 725 |
((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
|
726 |
exhaustion ~~ replicate (length (hd descr)) QuickAndDirty ~~ inject ~~ |
10121 | 727 |
nchotomys ~~ case_congs ~~ weak_case_congs); |
5177 | 728 |
|
21045 | 729 |
val simps = flat (distinct @ inject @ case_thms) @ size_thms @ rec_thms; |
9386 | 730 |
val split_thms = split ~~ split_asm; |
5177 | 731 |
|
18518 | 732 |
val thy12 = |
733 |
thy11 |
|
734 |
|> Theory.add_advanced_trfuns ([], [], make_case_tr' case_names' (hd descr), []) |
|
735 |
|> Theory.add_path (space_implode "_" new_type_names) |
|
736 |
|> add_rules simps case_thms size_thms rec_thms inject distinct |
|
18728 | 737 |
weak_case_congs Simplifier.cong_add |
18518 | 738 |
|> put_datatypes (fold Symtab.update dt_infos dt_info) |
739 |
|> add_cases_induct dt_infos induct |
|
740 |
|> Theory.parent_path |
|
19599 | 741 |
|> store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms) |
742 |
|> snd |
|
18518 | 743 |
|> DatatypeRealizer.add_dt_realizers sorts (map snd dt_infos) |
21251 | 744 |
|> DatatypeHooks.all (map fst dt_infos); |
5177 | 745 |
in |
18008 | 746 |
({distinct = distinct, |
5177 | 747 |
inject = inject, |
748 |
exhaustion = exhaustion, |
|
749 |
rec_thms = rec_thms, |
|
750 |
case_thms = case_thms, |
|
9386 | 751 |
split_thms = split_thms, |
5177 | 752 |
induction = induct, |
753 |
size = size_thms, |
|
18008 | 754 |
simps = simps}, thy12) |
5177 | 755 |
end; |
756 |
||
757 |
||
758 |
(******************* definitional introduction of datatypes *******************) |
|
759 |
||
8437 | 760 |
fun add_datatype_def flat_names new_type_names descr sorts types_syntax constr_syntax dt_info |
761 |
case_names_induct case_names_exhausts thy = |
|
5177 | 762 |
let |
6360 | 763 |
val _ = message ("Proofs for datatype(s) " ^ commas_quote new_type_names); |
5177 | 764 |
|
18314 | 765 |
val ((inject, distinct, dist_rewrites, simproc_dists, induct), thy2) = thy |> |
5661 | 766 |
DatatypeRepProofs.representation_proofs flat_names dt_info new_type_names descr sorts |
8437 | 767 |
types_syntax constr_syntax case_names_induct; |
5177 | 768 |
|
18314 | 769 |
val (casedist_thms, thy3) = DatatypeAbsProofs.prove_casedist_thms new_type_names descr |
8437 | 770 |
sorts induct case_names_exhausts thy2; |
18314 | 771 |
val ((reccomb_names, rec_thms), thy4) = DatatypeAbsProofs.prove_primrec_thms |
20054 | 772 |
flat_names new_type_names descr sorts dt_info inject dist_rewrites |
773 |
(Simplifier.theory_context thy3 dist_ss) induct thy3; |
|
18314 | 774 |
val ((case_thms, case_names), thy6) = DatatypeAbsProofs.prove_case_thms |
5661 | 775 |
flat_names new_type_names descr sorts reccomb_names rec_thms thy4; |
18314 | 776 |
val (split_thms, thy7) = DatatypeAbsProofs.prove_split_thms new_type_names |
5177 | 777 |
descr sorts inject dist_rewrites casedist_thms case_thms thy6; |
18314 | 778 |
val (nchotomys, thy8) = DatatypeAbsProofs.prove_nchotomys new_type_names |
5177 | 779 |
descr sorts casedist_thms thy7; |
18314 | 780 |
val (case_congs, thy9) = DatatypeAbsProofs.prove_case_congs new_type_names |
5177 | 781 |
descr sorts nchotomys case_thms thy8; |
18314 | 782 |
val (weak_case_congs, thy10) = DatatypeAbsProofs.prove_weak_case_congs new_type_names |
8601 | 783 |
descr sorts thy9; |
18314 | 784 |
val (size_thms, thy11) = DatatypeAbsProofs.prove_size_thms flat_names new_type_names |
8601 | 785 |
descr sorts reccomb_names rec_thms thy10; |
5177 | 786 |
|
21045 | 787 |
val dt_infos = map (make_dt_info (flat descr) sorts induct reccomb_names rec_thms) |
5177 | 788 |
((0 upto length (hd descr) - 1) ~~ (hd descr) ~~ case_names ~~ case_thms ~~ |
10121 | 789 |
casedist_thms ~~ simproc_dists ~~ inject ~~ nchotomys ~~ case_congs ~~ weak_case_congs); |
5177 | 790 |
|
21045 | 791 |
val simps = flat (distinct @ inject @ case_thms) @ size_thms @ rec_thms; |
5177 | 792 |
|
18518 | 793 |
val thy12 = |
794 |
thy11 |
|
795 |
|> Theory.add_advanced_trfuns ([], [], make_case_tr' case_names (hd descr), []) |
|
796 |
|> Theory.add_path (space_implode "_" new_type_names) |
|
797 |
|> add_rules simps case_thms size_thms rec_thms inject distinct |
|
18728 | 798 |
weak_case_congs (Simplifier.attrib (op addcongs)) |
18518 | 799 |
|> put_datatypes (fold Symtab.update dt_infos dt_info) |
800 |
|> add_cases_induct dt_infos induct |
|
801 |
|> Theory.parent_path |
|
802 |
|> store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms) |> snd |
|
803 |
|> DatatypeRealizer.add_dt_realizers sorts (map snd dt_infos) |
|
21251 | 804 |
|> DatatypeHooks.all (map fst dt_infos); |
5177 | 805 |
in |
18008 | 806 |
({distinct = distinct, |
5177 | 807 |
inject = inject, |
808 |
exhaustion = casedist_thms, |
|
809 |
rec_thms = rec_thms, |
|
810 |
case_thms = case_thms, |
|
811 |
split_thms = split_thms, |
|
812 |
induction = induct, |
|
813 |
size = size_thms, |
|
18008 | 814 |
simps = simps}, thy12) |
5177 | 815 |
end; |
816 |
||
817 |
||
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
818 |
(*********************** declare existing type as datatype *********************) |
5177 | 819 |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
820 |
fun gen_rep_datatype apply_theorems alt_names raw_distinct raw_inject raw_induction thy0 = |
5177 | 821 |
let |
18418
bf448d999b7e
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset
|
822 |
val (((distinct, inject), [induction]), thy1) = |
bf448d999b7e
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset
|
823 |
thy0 |
bf448d999b7e
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset
|
824 |
|> fold_map apply_theorems raw_distinct |
bf448d999b7e
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset
|
825 |
||>> fold_map apply_theorems raw_inject |
bf448d999b7e
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset
|
826 |
||>> apply_theorems [raw_induction]; |
5177 | 827 |
|
22598 | 828 |
val ((_, [induction']), _) = |
829 |
Variable.importT_thms [induction] (Variable.thm_context induction); |
|
5177 | 830 |
|
831 |
fun err t = error ("Ill-formed predicate in induction rule: " ^ |
|
20715
c1f16b427d86
handling of \<^const> syntax for case; explicit case names for induction rules for rep_datatype
haftmann
parents:
20597
diff
changeset
|
832 |
Sign.string_of_term thy1 t); |
5177 | 833 |
|
834 |
fun get_typ (t as _ $ Var (_, Type (tname, Ts))) = |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
835 |
((tname, map dest_TFree Ts) handle TERM _ => err t) |
5177 | 836 |
| get_typ t = err t; |
837 |
||
8437 | 838 |
val dtnames = map get_typ (HOLogic.dest_conj (HOLogic.dest_Trueprop (Thm.concl_of induction'))); |
15570 | 839 |
val new_type_names = getOpt (alt_names, map fst dtnames); |
5177 | 840 |
|
841 |
fun get_constr t = (case Logic.strip_assums_concl t of |
|
842 |
_ $ (_ $ t') => (case head_of t' of |
|
843 |
Const (cname, cT) => (case strip_type cT of |
|
844 |
(Ts, Type (tname, _)) => (tname, (cname, map (dtyp_of_typ dtnames) Ts)) |
|
845 |
| _ => err t) |
|
846 |
| _ => err t) |
|
847 |
| _ => err t); |
|
848 |
||
849 |
fun make_dt_spec [] _ _ = [] |
|
850 |
| make_dt_spec ((tname, tvs)::dtnames') i constrs = |
|
851 |
let val (constrs', constrs'') = take_prefix (equal tname o fst) constrs |
|
852 |
in (i, (tname, map DtTFree tvs, map snd constrs')):: |
|
853 |
(make_dt_spec dtnames' (i + 1) constrs'') |
|
854 |
end; |
|
855 |
||
856 |
val descr = make_dt_spec dtnames 0 (map get_constr (prems_of induction')); |
|
857 |
val sorts = add_term_tfrees (concl_of induction', []); |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
858 |
val dt_info = get_datatypes thy1; |
5177 | 859 |
|
21419 | 860 |
val (case_names_induct, case_names_exhausts) = |
861 |
(mk_case_names_induct descr, mk_case_names_exhausts descr (map #1 dtnames)); |
|
8437 | 862 |
|
6427 | 863 |
val _ = message ("Proofs for datatype(s) " ^ commas_quote new_type_names); |
5177 | 864 |
|
18314 | 865 |
val (casedist_thms, thy2) = thy1 |> |
8437 | 866 |
DatatypeAbsProofs.prove_casedist_thms new_type_names [descr] sorts induction |
867 |
case_names_exhausts; |
|
18314 | 868 |
val ((reccomb_names, rec_thms), thy3) = DatatypeAbsProofs.prove_primrec_thms |
20054 | 869 |
false new_type_names [descr] sorts dt_info inject distinct |
870 |
(Simplifier.theory_context thy2 dist_ss) induction thy2; |
|
18314 | 871 |
val ((case_thms, case_names), thy4) = DatatypeAbsProofs.prove_case_thms false |
5177 | 872 |
new_type_names [descr] sorts reccomb_names rec_thms thy3; |
18314 | 873 |
val (split_thms, thy5) = DatatypeAbsProofs.prove_split_thms |
5177 | 874 |
new_type_names [descr] sorts inject distinct casedist_thms case_thms thy4; |
18314 | 875 |
val (nchotomys, thy6) = DatatypeAbsProofs.prove_nchotomys new_type_names |
5177 | 876 |
[descr] sorts casedist_thms thy5; |
18314 | 877 |
val (case_congs, thy7) = DatatypeAbsProofs.prove_case_congs new_type_names |
5177 | 878 |
[descr] sorts nchotomys case_thms thy6; |
18314 | 879 |
val (weak_case_congs, thy8) = DatatypeAbsProofs.prove_weak_case_congs new_type_names |
8601 | 880 |
[descr] sorts thy7; |
18314 | 881 |
val (size_thms, thy9) = |
21459 | 882 |
DatatypeAbsProofs.prove_size_thms false new_type_names |
883 |
[descr] sorts reccomb_names rec_thms thy8; |
|
5177 | 884 |
|
18377 | 885 |
val ((_, [induction']), thy10) = |
886 |
thy9 |
|
887 |
|> store_thmss "inject" new_type_names inject |
|
888 |
||>> store_thmss "distinct" new_type_names distinct |
|
889 |
||> Theory.add_path (space_implode "_" new_type_names) |
|
890 |
||>> PureThy.add_thms [(("induct", induction), [case_names_induct])]; |
|
9149 | 891 |
|
18319
c52b139ebde0
Added new component "sorts" to record datatype_info.
berghofe
parents:
18314
diff
changeset
|
892 |
val dt_infos = map (make_dt_info descr sorts induction' reccomb_names rec_thms) |
10121 | 893 |
((0 upto length descr - 1) ~~ descr ~~ case_names ~~ case_thms ~~ casedist_thms ~~ |
894 |
map FewConstrs distinct ~~ inject ~~ nchotomys ~~ case_congs ~~ weak_case_congs); |
|
5177 | 895 |
|
21045 | 896 |
val simps = flat (distinct @ inject @ case_thms) @ size_thms @ rec_thms; |
5177 | 897 |
|
19599 | 898 |
val thy11 = |
899 |
thy10 |
|
900 |
|> Theory.add_advanced_trfuns ([], [], make_case_tr' case_names descr, []) |
|
901 |
|> add_rules simps case_thms size_thms rec_thms inject distinct |
|
902 |
weak_case_congs (Simplifier.attrib (op addcongs)) |
|
903 |
|> put_datatypes (fold Symtab.update dt_infos dt_info) |
|
904 |
|> add_cases_induct dt_infos induction' |
|
905 |
|> Theory.parent_path |
|
906 |
|> store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms) |
|
907 |
|> snd |
|
908 |
|> DatatypeRealizer.add_dt_realizers sorts (map snd dt_infos) |
|
21251 | 909 |
|> DatatypeHooks.all (map fst dt_infos); |
5177 | 910 |
in |
18008 | 911 |
({distinct = distinct, |
5177 | 912 |
inject = inject, |
913 |
exhaustion = casedist_thms, |
|
914 |
rec_thms = rec_thms, |
|
915 |
case_thms = case_thms, |
|
916 |
split_thms = split_thms, |
|
8437 | 917 |
induction = induction', |
5177 | 918 |
size = size_thms, |
18008 | 919 |
simps = simps}, thy11) |
5177 | 920 |
end; |
921 |
||
21350 | 922 |
val rep_datatype = gen_rep_datatype IsarCmd.apply_theorems; |
923 |
val rep_datatype_i = gen_rep_datatype IsarCmd.apply_theorems_i; |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
924 |
|
5177 | 925 |
|
11958 | 926 |
|
5177 | 927 |
(******************************** add datatype ********************************) |
928 |
||
14887 | 929 |
fun gen_add_datatype prep_typ err flat_names new_type_names dts thy = |
5177 | 930 |
let |
20820
58693343905f
removed obsolete Datatype_Universe.thy (cf. Datatype.thy);
wenzelm
parents:
20715
diff
changeset
|
931 |
val _ = Theory.requires thy "Datatype" "datatype definitions"; |
5177 | 932 |
|
933 |
(* this theory is used just for parsing *) |
|
934 |
||
935 |
val tmp_thy = thy |> |
|
5892 | 936 |
Theory.copy |> |
5177 | 937 |
Theory.add_types (map (fn (tvs, tname, mx, _) => |
938 |
(tname, length tvs, mx)) dts); |
|
939 |
||
5661 | 940 |
val (tyvars, _, _, _)::_ = dts; |
5177 | 941 |
val (new_dts, types_syntax) = ListPair.unzip (map (fn (tvs, tname, mx, _) => |
20597 | 942 |
let val full_tname = Sign.full_name tmp_thy (Syntax.type_name tname mx) |
18964 | 943 |
in (case duplicates (op =) tvs of |
5661 | 944 |
[] => if eq_set (tyvars, tvs) then ((full_tname, tvs), (tname, mx)) |
945 |
else error ("Mutually recursive datatypes must have same type parameters") |
|
5177 | 946 |
| dups => error ("Duplicate parameter(s) for datatype " ^ full_tname ^ |
947 |
" : " ^ commas dups)) |
|
948 |
end) dts); |
|
949 |
||
18964 | 950 |
val _ = (case duplicates (op =) (map fst new_dts) @ duplicates (op =) new_type_names of |
5177 | 951 |
[] => () | dups => error ("Duplicate datatypes: " ^ commas dups)); |
952 |
||
21045 | 953 |
fun prep_dt_spec (tvs, tname, mx, constrs) (dts', constr_syntax, sorts, i) = |
5177 | 954 |
let |
21045 | 955 |
fun prep_constr (cname, cargs, mx') (constrs, constr_syntax', sorts') = |
5279 | 956 |
let |
20597 | 957 |
val (cargs', sorts'') = Library.foldl (prep_typ tmp_thy) (([], sorts'), cargs); |
21045 | 958 |
val _ = (case fold (curry add_typ_tfree_names) cargs' [] \\ tvs of |
5279 | 959 |
[] => () |
960 |
| vs => error ("Extra type variables on rhs: " ^ commas vs)) |
|
20597 | 961 |
in (constrs @ [((if flat_names then Sign.full_name tmp_thy else |
962 |
Sign.full_name_path tmp_thy tname) (Syntax.const_name cname mx'), |
|
5177 | 963 |
map (dtyp_of_typ new_dts) cargs')], |
964 |
constr_syntax' @ [(cname, mx')], sorts'') |
|
18678 | 965 |
end handle ERROR msg => |
966 |
cat_error msg ("The error above occured in constructor " ^ cname ^ |
|
5177 | 967 |
" of datatype " ^ tname); |
968 |
||
969 |
val (constrs', constr_syntax', sorts') = |
|
21045 | 970 |
fold prep_constr constrs ([], [], sorts) |
5177 | 971 |
|
8405 | 972 |
in |
18964 | 973 |
case duplicates (op =) (map fst constrs') of |
5177 | 974 |
[] => |
20597 | 975 |
(dts' @ [(i, (Sign.full_name tmp_thy (Syntax.type_name tname mx), |
5177 | 976 |
map DtTFree tvs, constrs'))], |
977 |
constr_syntax @ [constr_syntax'], sorts', i + 1) |
|
978 |
| dups => error ("Duplicate constructors " ^ commas dups ^ |
|
979 |
" in datatype " ^ tname) |
|
980 |
end; |
|
981 |
||
21045 | 982 |
val (dts', constr_syntax, sorts', i) = fold prep_dt_spec dts ([], [], [], 0); |
20597 | 983 |
val sorts = sorts' @ (map (rpair (Sign.defaultS tmp_thy)) (tyvars \\ map fst sorts')); |
5177 | 984 |
val dt_info = get_datatypes thy; |
20597 | 985 |
val (descr, _) = unfold_datatypes tmp_thy dts' sorts dt_info dts' i; |
14887 | 986 |
val _ = check_nonempty descr handle (exn as Datatype_Empty s) => |
15661
9ef583b08647
reverted renaming of Some/None in comments and strings;
wenzelm
parents:
15574
diff
changeset
|
987 |
if err then error ("Nonemptiness check failed for datatype " ^ s) |
14887 | 988 |
else raise exn; |
5177 | 989 |
|
21045 | 990 |
val descr' = flat descr; |
8437 | 991 |
val case_names_induct = mk_case_names_induct descr'; |
992 |
val case_names_exhausts = mk_case_names_exhausts descr' (map #1 new_dts); |
|
5177 | 993 |
in |
994 |
(if (!quick_and_dirty) then add_datatype_axm else add_datatype_def) |
|
8437 | 995 |
flat_names new_type_names descr sorts types_syntax constr_syntax dt_info |
996 |
case_names_induct case_names_exhausts thy |
|
5177 | 997 |
end; |
998 |
||
999 |
val add_datatype_i = gen_add_datatype cert_typ; |
|
14887 | 1000 |
val add_datatype = gen_add_datatype read_typ true; |
5177 | 1001 |
|
6360 | 1002 |
|
18451 | 1003 |
|
6360 | 1004 |
(** package setup **) |
1005 |
||
1006 |
(* setup theory *) |
|
1007 |
||
18708 | 1008 |
val setup = |
1009 |
DatatypesData.init #> Method.add_methods tactic_emulations #> simproc_setup #> trfun_setup; |
|
6360 | 1010 |
|
1011 |
||
1012 |
(* outer syntax *) |
|
1013 |
||
17057 | 1014 |
local structure P = OuterParse and K = OuterKeyword in |
6360 | 1015 |
|
1016 |
val datatype_decl = |
|
6723 | 1017 |
Scan.option (P.$$$ "(" |-- P.name --| P.$$$ ")") -- P.type_args -- P.name -- P.opt_infix -- |
12876
a70df1e5bf10
got rid of explicit marginal comments (now stripped earlier from input);
wenzelm
parents:
12708
diff
changeset
|
1018 |
(P.$$$ "=" |-- P.enum1 "|" (P.name -- Scan.repeat P.typ -- P.opt_mixfix)); |
6360 | 1019 |
|
1020 |
fun mk_datatype args = |
|
1021 |
let |
|
15531 | 1022 |
val names = map (fn ((((NONE, _), t), _), _) => t | ((((SOME t, _), _), _), _) => t) args; |
12876
a70df1e5bf10
got rid of explicit marginal comments (now stripped earlier from input);
wenzelm
parents:
12708
diff
changeset
|
1023 |
val specs = map (fn ((((_, vs), t), mx), cons) => |
a70df1e5bf10
got rid of explicit marginal comments (now stripped earlier from input);
wenzelm
parents:
12708
diff
changeset
|
1024 |
(vs, t, mx, map (fn ((x, y), z) => (x, y, z)) cons)) args; |
18008 | 1025 |
in snd o add_datatype false names specs end; |
6360 | 1026 |
|
1027 |
val datatypeP = |
|
6723 | 1028 |
OuterSyntax.command "datatype" "define inductive datatypes" K.thy_decl |
1029 |
(P.and_list1 datatype_decl >> (Toplevel.theory o mk_datatype)); |
|
6360 | 1030 |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1031 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1032 |
val rep_datatype_decl = |
6723 | 1033 |
Scan.option (Scan.repeat1 P.name) -- |
22101 | 1034 |
Scan.optional (P.$$$ "distinct" |-- P.!!! (P.and_list1 SpecParse.xthms1)) [[]] -- |
1035 |
Scan.optional (P.$$$ "inject" |-- P.!!! (P.and_list1 SpecParse.xthms1)) [[]] -- |
|
1036 |
(P.$$$ "induction" |-- P.!!! SpecParse.xthm); |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1037 |
|
18008 | 1038 |
fun mk_rep_datatype (((opt_ts, dss), iss), ind) = #2 o rep_datatype opt_ts dss iss ind; |
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1039 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1040 |
val rep_datatypeP = |
6723 | 1041 |
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
|
1042 |
(rep_datatype_decl >> (Toplevel.theory o mk_rep_datatype)); |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1043 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1044 |
|
6479
b0448cab1b1e
rep_datatype syntax: 'induction' instead of 'induct';
wenzelm
parents:
6441
diff
changeset
|
1045 |
val _ = OuterSyntax.add_keywords ["distinct", "inject", "induction"]; |
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1046 |
val _ = OuterSyntax.add_parsers [datatypeP, rep_datatypeP]; |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1047 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1048 |
end; |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1049 |
|
6360 | 1050 |
|
5177 | 1051 |
end; |
1052 |
||
6360 | 1053 |
structure BasicDatatypePackage: BASIC_DATATYPE_PACKAGE = DatatypePackage; |
1054 |
open BasicDatatypePackage; |
|
15704 | 1055 |