author | wenzelm |
Tue, 13 Jun 2006 23:41:34 +0200 | |
changeset 19874 | cc4b2b882e4c |
parent 19841 | f2fa72c13186 |
child 19925 | 3f9341831812 |
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 |
8279 | 153 |
val sign = Thm.sign_of_thm state; |
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) => |
8405 | 170 |
(if exists (fn Free (a, _) => a mem vars) |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
171 |
(foldr add_term_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 |
|
19841 | 184 |
fun prep_inst (concl, xs) = (*exception Library.UnequalLengths *) |
11725 | 185 |
let val vs = InductAttrib.vars_of concl |
15570 | 186 |
in List.mapPartial 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 |
38dc4ff2a32b
bugfix: induct_tac no longer raises THM "dest_state"
paulson
parents:
18728
diff
changeset
|
195 |
SOME r => (r, "Induction rule") |
38dc4ff2a32b
bugfix: induct_tac no longer raises THM "dest_state"
paulson
parents:
18728
diff
changeset
|
196 |
| NONE => |
38dc4ff2a32b
bugfix: induct_tac no longer raises THM "dest_state"
paulson
parents:
18728
diff
changeset
|
197 |
let val tn = find_tname (hd (List.mapPartial I (List.concat varss))) Bi |
38dc4ff2a32b
bugfix: induct_tac no longer raises THM "dest_state"
paulson
parents:
18728
diff
changeset
|
198 |
val {sign, ...} = Thm.rep_thm state |
19346 | 199 |
in (#induction (the_datatype sign tn), "Induction rule for type " ^ tn) |
18751
38dc4ff2a32b
bugfix: induct_tac no longer raises THM "dest_state"
paulson
parents:
18728
diff
changeset
|
200 |
end |
11725 | 201 |
val concls = HOLogic.dest_concls (Thm.concl_of rule); |
19841 | 202 |
val insts = List.concat (map 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' |
15531 | 209 |
(map (Library.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 |
19346 | 232 |
(#exhaustion (the_datatype (Thm.sign_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 |
|
15444
4f14c151d9f1
induct_tac and case_tac no longer depend on Syntax.string_of_vname.
berghofe
parents:
14981
diff
changeset
|
250 |
val inst_tac = Method.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 _) = [] |
|
15570 | 276 |
| dt_recs (DtType (_, dts)) = List.concat (map dt_recs dts) |
8437 | 277 |
| dt_recs (DtRec i) = [i]; |
278 |
||
279 |
fun dt_cases (descr: descr) (_, args, constrs) = |
|
280 |
let |
|
17521 | 281 |
fun the_bname i = Sign.base_name (#1 (valOf (AList.lookup (op =) descr i))); |
19046
bc5c6c9b114e
removed distinct, renamed gen_distinct to distinct;
wenzelm
parents:
19008
diff
changeset
|
282 |
val bnames = map the_bname (distinct (op =) (List.concat (map 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 = |
|
15570 | 287 |
DatatypeProp.indexify_names (List.concat (map (dt_cases descr) (map #2 descr))); |
8437 | 288 |
|
17521 | 289 |
fun exhaust_cases descr i = dt_cases descr (valOf (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) |
|
15570 | 297 |
(List.filter (fn ((_, (name, _, _))) => name mem_string new) descr); |
8437 | 298 |
|
299 |
end; |
|
300 |
||
18625 | 301 |
(*Name management for ATP linkup. The suffix here must agree with the one given |
302 |
for notE in Clasimp.addIff*) |
|
17084
fb0a80aef0be
classical rules must have names for ATP integration
paulson
parents:
17057
diff
changeset
|
303 |
fun name_notE th = |
18625 | 304 |
Thm.name_thm (Thm.name_of_thm th ^ "_iff1", th RS notE); |
17084
fb0a80aef0be
classical rules must have names for ATP integration
paulson
parents:
17057
diff
changeset
|
305 |
|
11345
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
306 |
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
|
307 |
weak_case_congs cong_att = |
18377 | 308 |
(snd o PureThy.add_thmss [(("simps", simps), []), |
15570 | 309 |
(("", List.concat case_thms @ size_thms @ |
18728 | 310 |
List.concat distinct @ rec_thms), [Simplifier.simp_add]), |
16672 | 311 |
(("", size_thms @ rec_thms), [RecfunCodegen.add NONE]), |
18728 | 312 |
(("", List.concat inject), [iff_add]), |
313 |
(("", map name_notE (List.concat distinct)), [Classical.safe_elim NONE]), |
|
16672 | 314 |
(("", weak_case_congs), [cong_att])]); |
11345
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
315 |
|
8437 | 316 |
|
317 |
(* add_cases_induct *) |
|
8306 | 318 |
|
19874 | 319 |
fun add_cases_induct infos induction thy = |
8306 | 320 |
let |
19874 | 321 |
val inducts = ProjectRule.projections (ProofContext.init thy) induction; |
8405 | 322 |
|
11805
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
323 |
fun named_rules (name, {index, exhaustion, ...}: datatype_info) = |
19874 | 324 |
[(("", nth inducts index), [InductAttrib.induct_type name]), |
18728 | 325 |
(("", exhaustion), [InductAttrib.cases_type name])]; |
11805
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
326 |
fun unnamed_rule i = |
19874 | 327 |
(("", nth inducts i), [PureThy.kind_internal, InductAttrib.induct_type ""]); |
18462 | 328 |
in |
19874 | 329 |
thy |> PureThy.add_thms |
18462 | 330 |
(List.concat (map named_rules infos) @ |
19874 | 331 |
map unnamed_rule (length infos upto length inducts - 1)) |> snd |
332 |
|> PureThy.add_thmss [(("inducts", inducts), [])] |> snd |
|
18462 | 333 |
end; |
8306 | 334 |
|
5177 | 335 |
|
8405 | 336 |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
337 |
(**** simplification procedure for showing distinctness of constructors ****) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
338 |
|
7060 | 339 |
fun stripT (i, Type ("fun", [_, T])) = stripT (i + 1, T) |
340 |
| stripT p = p; |
|
341 |
||
342 |
fun stripC (i, f $ x) = stripC (i + 1, f) |
|
343 |
| stripC p = p; |
|
344 |
||
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
345 |
val distinctN = "constr_distinct"; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
346 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
347 |
exception ConstrDistinct of term; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
348 |
|
19539 | 349 |
fun distinct_proc thy ss (t as Const ("op =", _) $ t1 $ t2) = |
7060 | 350 |
(case (stripC (0, t1), stripC (0, t2)) of |
351 |
((i, Const (cname1, T1)), (j, Const (cname2, T2))) => |
|
352 |
(case (stripT (0, T1), stripT (0, T2)) of |
|
353 |
((i', Type (tname1, _)), (j', Type (tname2, _))) => |
|
354 |
if tname1 = tname2 andalso not (cname1 = cname2) andalso i = i' andalso j = j' then |
|
19539 | 355 |
(case (get_datatype_descr thy) tname1 of |
19346 | 356 |
SOME (_, (_, constrs)) => let val cnames = map fst constrs |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
357 |
in if cname1 mem cnames andalso cname2 mem cnames then |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
358 |
let val eq_t = Logic.mk_equals (t, Const ("False", HOLogic.boolT)); |
19539 | 359 |
val eq_ct = cterm_of thy eq_t; |
360 |
val Datatype_thy = ThyInfo.the_theory "Datatype" thy; |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
361 |
val [In0_inject, In1_inject, In0_not_In1, In1_not_In0] = |
16486 | 362 |
map (get_thm Datatype_thy o Name) |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
363 |
["In0_inject", "In1_inject", "In0_not_In1", "In1_not_In0"] |
19539 | 364 |
in (case (#distinct (the_datatype thy tname1)) of |
15531 | 365 |
QuickAndDirty => SOME (Thm.invoke_oracle |
19539 | 366 |
Datatype_thy distinctN (thy, ConstrDistinct eq_t)) |
367 |
| FewConstrs thms => SOME (Goal.prove thy [] [] eq_t (K |
|
13480
bb72bd43c6c3
use Tactic.prove instead of prove_goalw_cterm in internal proofs!
wenzelm
parents:
13466
diff
changeset
|
368 |
(EVERY [rtac eq_reflection 1, rtac iffI 1, rtac notE 1, |
bb72bd43c6c3
use Tactic.prove instead of prove_goalw_cterm in internal proofs!
wenzelm
parents:
13466
diff
changeset
|
369 |
atac 2, resolve_tac thms 1, etac FalseE 1]))) |
19539 | 370 |
| ManyConstrs (thm, simpset) => SOME (Goal.prove thy [] [] eq_t (K |
13480
bb72bd43c6c3
use Tactic.prove instead of prove_goalw_cterm in internal proofs!
wenzelm
parents:
13466
diff
changeset
|
371 |
(EVERY [rtac eq_reflection 1, rtac iffI 1, dtac thm 1, |
17875 | 372 |
full_simp_tac (Simplifier.inherit_context ss simpset) 1, |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
373 |
REPEAT (dresolve_tac [In0_inject, In1_inject] 1), |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
374 |
eresolve_tac [In0_not_In1 RS notE, In1_not_In0 RS notE] 1, |
13480
bb72bd43c6c3
use Tactic.prove instead of prove_goalw_cterm in internal proofs!
wenzelm
parents:
13466
diff
changeset
|
375 |
etac FalseE 1])))) |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
376 |
end |
15531 | 377 |
else NONE |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
378 |
end |
15531 | 379 |
| NONE => NONE) |
380 |
else NONE |
|
381 |
| _ => NONE) |
|
382 |
| _ => NONE) |
|
19539 | 383 |
| distinct_proc thy _ _ = NONE; |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
384 |
|
13462 | 385 |
val distinct_simproc = |
16430 | 386 |
Simplifier.simproc HOL.thy distinctN ["s = t"] distinct_proc; |
7015
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 dist_ss = HOL_ss addsimprocs [distinct_simproc]; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
389 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
390 |
val simproc_setup = |
18708 | 391 |
Theory.add_oracle (distinctN, fn (_, ConstrDistinct t) => t) #> |
392 |
(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
|
393 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
394 |
|
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
395 |
(**** translation rules for case ****) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
396 |
|
18008 | 397 |
fun find_first f = Library.find_first f; |
398 |
||
18857 | 399 |
fun case_tr context [t, u] = |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
400 |
let |
18857 | 401 |
val thy = Context.theory_of context; |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
402 |
fun case_error s name ts = raise TERM ("Error in case expression" ^ |
15570 | 403 |
getOpt (Option.map (curry op ^ " for datatype ") name, "") ^ ":\n" ^ s, ts); |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
404 |
fun dest_case1 (Const ("_case1", _) $ t $ u) = (case strip_comb t of |
18857 | 405 |
(Const (s, _), ts) => (Sign.intern_const thy s, ts) |
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)) |
|
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
416 |
fun abstr (Free (x, T), body) = Term.absfree (x, T, body) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
417 |
| abstr (Const ("_constrain", _) $ Free (x, T) $ tT, body) = |
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 |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
419 |
| abstr (Const ("Pair", _) $ x $ y, body) = |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
420 |
Syntax.const "split" $ abstr (x, abstr (y, body)) |
15531 | 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, ...}) => |
15570 | 423 |
exists (equal cname o fst) (#3 (snd (List.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 (); |
15570 | 429 |
val (_, (_, dts, constrs)) = List.nth (descr, index); |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
430 |
fun find_case (cases, (s, dt)) = |
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 |
15531 | 432 |
NONE => (case default of |
433 |
NONE => case_error ("No clause for constructor " ^ s) (SOME tname) [u] |
|
434 |
| SOME t => (cases, list_abs (map (rpair dummyT) (DatatypeProp.make_tnames |
|
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
435 |
(map (typ_of_dtyp descr sorts) dt)), t))) |
15531 | 436 |
| SOME (c as ((_, vs), t)) => |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
437 |
if length dt <> length vs then |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
438 |
case_error ("Wrong number of arguments for constructor " ^ s) |
15531 | 439 |
(SOME tname) vs |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
440 |
else (cases \ c, foldr abstr t vs)) |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
441 |
val (cases'', fs) = foldl_map find_case (cases', constrs) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
442 |
in case (cases'', length constrs = length cases', default) of |
15531 | 443 |
([], true, SOME _) => |
444 |
case_error "Extra '_' dummy pattern" (SOME tname) [u] |
|
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
445 |
| (_ :: _, _, _) => |
19046
bc5c6c9b114e
removed distinct, renamed gen_distinct to distinct;
wenzelm
parents:
19008
diff
changeset
|
446 |
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
|
447 |
in case extra \\ map fst constrs of |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
448 |
[] => case_error ("More than one clause for constructor(s) " ^ |
15531 | 449 |
commas extra) (SOME tname) [u] |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
450 |
| extra' => case_error ("Illegal constructor(s): " ^ commas extra') |
15531 | 451 |
(SOME tname) [u] |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
452 |
end |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
453 |
| _ => list_comb (Syntax.const case_name, fs) $ t |
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 |
end |
18857 | 456 |
| case_tr _ ts = raise TERM ("case_tr", ts); |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
457 |
|
18857 | 458 |
fun case_tr' constrs context ts = |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
459 |
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
|
460 |
let |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
461 |
val (fs, x) = split_last ts; |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
462 |
fun strip_abs 0 t = ([], t) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
463 |
| strip_abs i (Abs p) = |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
464 |
let val (x, u) = Syntax.atomic_abs_tr' p |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
465 |
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
|
466 |
| 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
|
467 |
(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
|
468 |
fun is_dependent i t = |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
469 |
let val k = length (strip_abs_vars t) - i |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
470 |
in k < 0 orelse exists (fn j => j >= k) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
471 |
(loose_bnos (strip_abs_body t)) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
472 |
end; |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
473 |
val cases = map (fn ((cname, dts), t) => |
18857 | 474 |
(Sign.extern_const (Context.theory_of context) cname, |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
475 |
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
|
476 |
(constrs ~~ fs); |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
477 |
fun count_cases (cs, (_, _, true)) = cs |
17521 | 478 |
| count_cases (cs, (cname, (_, body), false)) = (case AList.lookup (op =) cs body of |
15531 | 479 |
NONE => (body, [cname]) :: cs |
17325 | 480 |
| SOME cnames => AList.update (op =) (body, cnames @ [cname]) cs); |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
481 |
val cases' = sort (int_ord o Library.swap o pairself (length o snd)) |
15570 | 482 |
(Library.foldl count_cases ([], cases)); |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
483 |
fun mk_case1 (cname, (vs, body), _) = Syntax.const "_case1" $ |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
484 |
list_comb (Syntax.const cname, vs) $ body; |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
485 |
in |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
486 |
Syntax.const "_case_syntax" $ x $ |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
487 |
foldr1 (fn (t, u) => Syntax.const "_case2" $ t $ u) (map mk_case1 |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
488 |
(case cases' of |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
489 |
[] => cases |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
490 |
| (default, cnames) :: _ => |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
491 |
if length cnames = 1 then cases |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
492 |
else if length cnames = length constrs then |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
493 |
[hd cases, ("dummy_pattern", ([], default), false)] |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
494 |
else |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
495 |
filter_out (fn (cname, _, _) => cname mem cnames) cases @ |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
496 |
[("dummy_pattern", ([], default), false)])) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
497 |
end; |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
498 |
|
15570 | 499 |
fun make_case_tr' case_names descr = List.concat (map |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
500 |
(fn ((_, (_, _, constrs)), case_name) => map (rpair (case_tr' constrs)) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
501 |
(NameSpace.accesses' case_name)) (descr ~~ case_names)); |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
502 |
|
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
503 |
val trfun_setup = |
18708 | 504 |
Theory.add_advanced_trfuns ([], [("_case_syntax", case_tr)], [], []); |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
505 |
|
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
506 |
|
5177 | 507 |
(* prepare types *) |
508 |
||
509 |
fun read_typ sign ((Ts, sorts), str) = |
|
510 |
let |
|
17521 | 511 |
val T = Type.no_tvars (Sign.read_typ (sign, AList.lookup (op =) |
5177 | 512 |
(map (apfst (rpair ~1)) sorts)) str) handle TYPE (msg, _, _) => error msg |
513 |
in (Ts @ [T], add_typ_tfrees (T, sorts)) end; |
|
514 |
||
515 |
fun cert_typ sign ((Ts, sorts), raw_T) = |
|
516 |
let |
|
517 |
val T = Type.no_tvars (Sign.certify_typ sign raw_T) handle |
|
518 |
TYPE (msg, _, _) => error msg; |
|
519 |
val sorts' = add_typ_tfrees (T, sorts) |
|
520 |
in (Ts @ [T], |
|
18964 | 521 |
case duplicates (op =) (map fst sorts') of |
5177 | 522 |
[] => sorts' |
523 |
| dups => error ("Inconsistent sort constraints for " ^ commas dups)) |
|
524 |
end; |
|
525 |
||
526 |
||
527 |
(**** make datatype info ****) |
|
528 |
||
18319
c52b139ebde0
Added new component "sorts" to record datatype_info.
berghofe
parents:
18314
diff
changeset
|
529 |
fun make_dt_info descr sorts induct reccomb_names rec_thms |
10121 | 530 |
(((((((((i, (_, (tname, _, _))), case_name), case_thms), |
531 |
exhaustion_thm), distinct_thm), inject), nchotomy), case_cong), weak_case_cong) = |
|
532 |
(tname, |
|
533 |
{index = i, |
|
534 |
descr = descr, |
|
18319
c52b139ebde0
Added new component "sorts" to record datatype_info.
berghofe
parents:
18314
diff
changeset
|
535 |
sorts = sorts, |
10121 | 536 |
rec_names = reccomb_names, |
537 |
rec_rewrites = rec_thms, |
|
538 |
case_name = case_name, |
|
539 |
case_rewrites = case_thms, |
|
540 |
induction = induct, |
|
541 |
exhaustion = exhaustion_thm, |
|
542 |
distinct = distinct_thm, |
|
543 |
inject = inject, |
|
544 |
nchotomy = nchotomy, |
|
545 |
case_cong = case_cong, |
|
546 |
weak_case_cong = weak_case_cong}); |
|
5177 | 547 |
|
548 |
||
549 |
(********************* axiomatic introduction of datatypes ********************) |
|
550 |
||
8437 | 551 |
fun add_and_get_axioms_atts label tnames attss ts thy = |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
552 |
foldr (fn (((tname, atts), t), (thy', axs)) => |
5177 | 553 |
let |
18377 | 554 |
val ([ax], thy'') = |
555 |
thy' |
|
556 |
|> Theory.add_path tname |
|
557 |
|> PureThy.add_axioms_i [((label, t), atts)]; |
|
5661 | 558 |
in (Theory.parent_path thy'', ax::axs) |
18377 | 559 |
end) (thy, []) (tnames ~~ attss ~~ ts) |> swap; |
8437 | 560 |
|
561 |
fun add_and_get_axioms label tnames = |
|
562 |
add_and_get_axioms_atts label tnames (replicate (length tnames) []); |
|
5177 | 563 |
|
564 |
fun add_and_get_axiomss label tnames tss thy = |
|
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
565 |
foldr (fn ((tname, ts), (thy', axss)) => |
5177 | 566 |
let |
18377 | 567 |
val ([axs], thy'') = |
568 |
thy' |
|
569 |
|> Theory.add_path tname |
|
570 |
|> PureThy.add_axiomss_i [((label, ts), [])]; |
|
5661 | 571 |
in (Theory.parent_path thy'', axs::axss) |
18377 | 572 |
end) (thy, []) (tnames ~~ tss) |> swap; |
5177 | 573 |
|
19716 | 574 |
fun specify_consts args thy = |
575 |
let val specs = |
|
576 |
args |> map (fn (c, T, mx) => Const (Sign.full_name thy (Syntax.const_name c mx), T)); |
|
577 |
in thy |> Theory.add_consts_i args |> Theory.add_finals_i false specs end; |
|
578 |
||
8437 | 579 |
fun add_datatype_axm flat_names new_type_names descr sorts types_syntax constr_syntax dt_info |
580 |
case_names_induct case_names_exhausts thy = |
|
5177 | 581 |
let |
15570 | 582 |
val descr' = List.concat descr; |
5177 | 583 |
val recTs = get_rec_types descr' sorts; |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
584 |
val used = foldr add_typ_tfree_names [] recTs; |
15570 | 585 |
val newTs = Library.take (length (hd descr), recTs); |
5177 | 586 |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
587 |
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
|
588 |
(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
|
589 |
cargs) constrs) descr'; |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
590 |
|
5177 | 591 |
(**** declare new types and constants ****) |
592 |
||
593 |
val tyvars = map (fn (_, (_, Ts, _)) => map dest_DtTFree Ts) (hd descr); |
|
594 |
||
595 |
val constr_decls = map (fn (((_, (_, _, constrs)), T), constr_syntax') => |
|
596 |
map (fn ((_, cargs), (cname, mx)) => |
|
597 |
(cname, map (typ_of_dtyp descr' sorts) cargs ---> T, mx)) |
|
598 |
(constrs ~~ constr_syntax')) ((hd descr) ~~ newTs ~~ constr_syntax); |
|
599 |
||
15457
1fbd4aba46e3
Adapted to modified interface of PureThy.get_thm(s).
berghofe
parents:
15444
diff
changeset
|
600 |
val (rec_result_Ts, reccomb_fn_Ts) = DatatypeProp.make_primrec_Ts descr sorts used; |
5177 | 601 |
|
602 |
val big_reccomb_name = (space_implode "_" new_type_names) ^ "_rec"; |
|
603 |
val reccomb_names = if length descr' = 1 then [big_reccomb_name] else |
|
604 |
(map ((curry (op ^) (big_reccomb_name ^ "_")) o string_of_int) |
|
605 |
(1 upto (length descr'))); |
|
606 |
||
9739 | 607 |
val size_names = DatatypeProp.indexify_names |
15570 | 608 |
(map (fn T => name_of_typ T ^ "_size") (Library.drop (length (hd descr), recTs))); |
5177 | 609 |
|
12338
de0f4a63baa5
renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents:
12311
diff
changeset
|
610 |
val freeT = TFree (variant used "'t", HOLogic.typeS); |
5177 | 611 |
val case_fn_Ts = map (fn (i, (_, _, constrs)) => |
612 |
map (fn (_, cargs) => |
|
613 |
let val Ts = map (typ_of_dtyp descr' sorts) cargs |
|
614 |
in Ts ---> freeT end) constrs) (hd descr); |
|
615 |
||
616 |
val case_names = map (fn s => (s ^ "_case")) new_type_names; |
|
617 |
||
6305 | 618 |
val thy2' = thy |> |
5177 | 619 |
|
620 |
(** new types **) |
|
621 |
||
15570 | 622 |
curry (Library.foldr (fn (((name, mx), tvs), thy') => thy' |> |
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
623 |
TypedefPackage.add_typedecls [(name, tvs, mx)])) |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
624 |
(types_syntax ~~ tyvars) |> |
5661 | 625 |
add_path flat_names (space_implode "_" new_type_names) |> |
5177 | 626 |
|
627 |
(** primrec combinators **) |
|
628 |
||
19716 | 629 |
specify_consts (map (fn ((name, T), T') => |
630 |
(name, reccomb_fn_Ts @ [T] ---> T', NoSyn)) (reccomb_names ~~ recTs ~~ rec_result_Ts)) |> |
|
5177 | 631 |
|
632 |
(** case combinators **) |
|
633 |
||
19716 | 634 |
specify_consts (map (fn ((name, T), Ts) => |
635 |
(name, Ts @ [T] ---> freeT, NoSyn)) (case_names ~~ newTs ~~ case_fn_Ts)); |
|
6305 | 636 |
|
19716 | 637 |
val reccomb_names' = map (Sign.full_name thy2') reccomb_names; |
638 |
val case_names' = map (Sign.full_name thy2') case_names; |
|
6305 | 639 |
|
640 |
val thy2 = thy2' |> |
|
5177 | 641 |
|
642 |
(** size functions **) |
|
643 |
||
19716 | 644 |
(if no_size then I else specify_consts (map (fn (s, T) => |
5177 | 645 |
(Sign.base_name s, T --> HOLogic.natT, NoSyn)) |
15570 | 646 |
(size_names ~~ Library.drop (length (hd descr), recTs)))) |> |
5661 | 647 |
|
648 |
(** constructors **) |
|
649 |
||
650 |
parent_path flat_names |> |
|
15570 | 651 |
curry (Library.foldr (fn (((((_, (_, _, constrs)), T), tname), |
5661 | 652 |
constr_syntax'), thy') => thy' |> |
653 |
add_path flat_names tname |> |
|
19716 | 654 |
specify_consts (map (fn ((_, cargs), (cname, mx)) => |
5661 | 655 |
(cname, map (typ_of_dtyp descr' sorts) cargs ---> T, mx)) |
656 |
(constrs ~~ constr_syntax')) |> |
|
657 |
parent_path flat_names)) |
|
658 |
(hd descr ~~ newTs ~~ new_type_names ~~ constr_syntax); |
|
5177 | 659 |
|
660 |
(**** introduction of axioms ****) |
|
661 |
||
5661 | 662 |
val rec_axs = DatatypeProp.make_primrecs new_type_names descr sorts thy2; |
9739 | 663 |
val size_axs = if no_size then [] else DatatypeProp.make_size descr sorts thy2; |
5661 | 664 |
|
18377 | 665 |
val ((([induct], [rec_thms]), inject), thy3) = |
666 |
thy2 |
|
667 |
|> Theory.add_path (space_implode "_" new_type_names) |
|
668 |
|> PureThy.add_axioms_i [(("induct", DatatypeProp.make_ind descr sorts), |
|
669 |
[case_names_induct])] |
|
670 |
||>> PureThy.add_axiomss_i [(("recs", rec_axs), [])] |
|
671 |
||> (if no_size then I else snd o PureThy.add_axiomss_i [(("size", size_axs), [])]) |
|
672 |
||> Theory.parent_path |
|
673 |
||>> add_and_get_axiomss "inject" new_type_names |
|
674 |
(DatatypeProp.make_injs descr sorts); |
|
16486 | 675 |
val size_thms = if no_size then [] else get_thms thy3 (Name "size"); |
18377 | 676 |
val (distinct, thy4) = add_and_get_axiomss "distinct" new_type_names |
5177 | 677 |
(DatatypeProp.make_distincts new_type_names descr sorts thy3) thy3; |
8437 | 678 |
|
679 |
val exhaust_ts = DatatypeProp.make_casedists descr sorts; |
|
18377 | 680 |
val (exhaustion, thy5) = add_and_get_axioms_atts "exhaust" new_type_names |
8437 | 681 |
(map Library.single case_names_exhausts) exhaust_ts thy4; |
18377 | 682 |
val (case_thms, thy6) = add_and_get_axiomss "cases" new_type_names |
5177 | 683 |
(DatatypeProp.make_cases new_type_names descr sorts thy5) thy5; |
684 |
val (split_ts, split_asm_ts) = ListPair.unzip |
|
685 |
(DatatypeProp.make_splits new_type_names descr sorts thy6); |
|
18377 | 686 |
val (split, thy7) = add_and_get_axioms "split" new_type_names split_ts thy6; |
687 |
val (split_asm, thy8) = add_and_get_axioms "split_asm" new_type_names |
|
5177 | 688 |
split_asm_ts thy7; |
18377 | 689 |
val (nchotomys, thy9) = add_and_get_axioms "nchotomy" new_type_names |
5177 | 690 |
(DatatypeProp.make_nchotomys descr sorts) thy8; |
18377 | 691 |
val (case_congs, thy10) = add_and_get_axioms "case_cong" new_type_names |
5177 | 692 |
(DatatypeProp.make_case_congs new_type_names descr sorts thy9) thy9; |
18377 | 693 |
val (weak_case_congs, thy11) = add_and_get_axioms "weak_case_cong" new_type_names |
8601 | 694 |
(DatatypeProp.make_weak_case_congs new_type_names descr sorts thy10) thy10; |
8405 | 695 |
|
18319
c52b139ebde0
Added new component "sorts" to record datatype_info.
berghofe
parents:
18314
diff
changeset
|
696 |
val dt_infos = map (make_dt_info descr' sorts induct reccomb_names' rec_thms) |
6305 | 697 |
((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
|
698 |
exhaustion ~~ replicate (length (hd descr)) QuickAndDirty ~~ inject ~~ |
10121 | 699 |
nchotomys ~~ case_congs ~~ weak_case_congs); |
5177 | 700 |
|
15570 | 701 |
val simps = List.concat (distinct @ inject @ case_thms) @ size_thms @ rec_thms; |
9386 | 702 |
val split_thms = split ~~ split_asm; |
5177 | 703 |
|
18518 | 704 |
val thy12 = |
705 |
thy11 |
|
706 |
|> Theory.add_advanced_trfuns ([], [], make_case_tr' case_names' (hd descr), []) |
|
707 |
|> Theory.add_path (space_implode "_" new_type_names) |
|
708 |
|> add_rules simps case_thms size_thms rec_thms inject distinct |
|
18728 | 709 |
weak_case_congs Simplifier.cong_add |
18518 | 710 |
|> put_datatypes (fold Symtab.update dt_infos dt_info) |
711 |
|> add_cases_induct dt_infos induct |
|
712 |
|> Theory.parent_path |
|
19599 | 713 |
|> store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms) |
714 |
|> snd |
|
18518 | 715 |
|> DatatypeRealizer.add_dt_realizers sorts (map snd dt_infos) |
19599 | 716 |
|> fold (DatatypeHooks.invoke o fst) dt_infos; |
5177 | 717 |
in |
18008 | 718 |
({distinct = distinct, |
5177 | 719 |
inject = inject, |
720 |
exhaustion = exhaustion, |
|
721 |
rec_thms = rec_thms, |
|
722 |
case_thms = case_thms, |
|
9386 | 723 |
split_thms = split_thms, |
5177 | 724 |
induction = induct, |
725 |
size = size_thms, |
|
18008 | 726 |
simps = simps}, thy12) |
5177 | 727 |
end; |
728 |
||
729 |
||
730 |
(******************* definitional introduction of datatypes *******************) |
|
731 |
||
8437 | 732 |
fun add_datatype_def flat_names new_type_names descr sorts types_syntax constr_syntax dt_info |
733 |
case_names_induct case_names_exhausts thy = |
|
5177 | 734 |
let |
6360 | 735 |
val _ = message ("Proofs for datatype(s) " ^ commas_quote new_type_names); |
5177 | 736 |
|
18314 | 737 |
val ((inject, distinct, dist_rewrites, simproc_dists, induct), thy2) = thy |> |
5661 | 738 |
DatatypeRepProofs.representation_proofs flat_names dt_info new_type_names descr sorts |
8437 | 739 |
types_syntax constr_syntax case_names_induct; |
5177 | 740 |
|
18314 | 741 |
val (casedist_thms, thy3) = DatatypeAbsProofs.prove_casedist_thms new_type_names descr |
8437 | 742 |
sorts induct case_names_exhausts thy2; |
18314 | 743 |
val ((reccomb_names, rec_thms), thy4) = DatatypeAbsProofs.prove_primrec_thms |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
744 |
flat_names new_type_names descr sorts dt_info inject dist_rewrites dist_ss induct thy3; |
18314 | 745 |
val ((case_thms, case_names), thy6) = DatatypeAbsProofs.prove_case_thms |
5661 | 746 |
flat_names new_type_names descr sorts reccomb_names rec_thms thy4; |
18314 | 747 |
val (split_thms, thy7) = DatatypeAbsProofs.prove_split_thms new_type_names |
5177 | 748 |
descr sorts inject dist_rewrites casedist_thms case_thms thy6; |
18314 | 749 |
val (nchotomys, thy8) = DatatypeAbsProofs.prove_nchotomys new_type_names |
5177 | 750 |
descr sorts casedist_thms thy7; |
18314 | 751 |
val (case_congs, thy9) = DatatypeAbsProofs.prove_case_congs new_type_names |
5177 | 752 |
descr sorts nchotomys case_thms thy8; |
18314 | 753 |
val (weak_case_congs, thy10) = DatatypeAbsProofs.prove_weak_case_congs new_type_names |
8601 | 754 |
descr sorts thy9; |
18314 | 755 |
val (size_thms, thy11) = DatatypeAbsProofs.prove_size_thms flat_names new_type_names |
8601 | 756 |
descr sorts reccomb_names rec_thms thy10; |
5177 | 757 |
|
18319
c52b139ebde0
Added new component "sorts" to record datatype_info.
berghofe
parents:
18314
diff
changeset
|
758 |
val dt_infos = map (make_dt_info (List.concat descr) sorts induct reccomb_names rec_thms) |
5177 | 759 |
((0 upto length (hd descr) - 1) ~~ (hd descr) ~~ case_names ~~ case_thms ~~ |
10121 | 760 |
casedist_thms ~~ simproc_dists ~~ inject ~~ nchotomys ~~ case_congs ~~ weak_case_congs); |
5177 | 761 |
|
15570 | 762 |
val simps = List.concat (distinct @ inject @ case_thms) @ size_thms @ rec_thms; |
5177 | 763 |
|
18518 | 764 |
val thy12 = |
765 |
thy11 |
|
766 |
|> Theory.add_advanced_trfuns ([], [], make_case_tr' case_names (hd descr), []) |
|
767 |
|> Theory.add_path (space_implode "_" new_type_names) |
|
768 |
|> add_rules simps case_thms size_thms rec_thms inject distinct |
|
18728 | 769 |
weak_case_congs (Simplifier.attrib (op addcongs)) |
18518 | 770 |
|> put_datatypes (fold Symtab.update dt_infos dt_info) |
771 |
|> add_cases_induct dt_infos induct |
|
772 |
|> Theory.parent_path |
|
773 |
|> store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms) |> snd |
|
774 |
|> DatatypeRealizer.add_dt_realizers sorts (map snd dt_infos) |
|
19599 | 775 |
|> fold (DatatypeHooks.invoke o fst) dt_infos; |
5177 | 776 |
in |
18008 | 777 |
({distinct = distinct, |
5177 | 778 |
inject = inject, |
779 |
exhaustion = casedist_thms, |
|
780 |
rec_thms = rec_thms, |
|
781 |
case_thms = case_thms, |
|
782 |
split_thms = split_thms, |
|
783 |
induction = induct, |
|
784 |
size = size_thms, |
|
18008 | 785 |
simps = simps}, thy12) |
5177 | 786 |
end; |
787 |
||
788 |
||
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
789 |
(*********************** declare existing type as datatype *********************) |
5177 | 790 |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
791 |
fun gen_rep_datatype apply_theorems alt_names raw_distinct raw_inject raw_induction thy0 = |
5177 | 792 |
let |
12922 | 793 |
val _ = Theory.requires thy0 "Inductive" "datatype representations"; |
794 |
||
18418
bf448d999b7e
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset
|
795 |
val (((distinct, inject), [induction]), thy1) = |
bf448d999b7e
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset
|
796 |
thy0 |
bf448d999b7e
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset
|
797 |
|> fold_map apply_theorems raw_distinct |
bf448d999b7e
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset
|
798 |
||>> fold_map apply_theorems raw_inject |
bf448d999b7e
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset
|
799 |
||>> apply_theorems [raw_induction]; |
6394 | 800 |
val sign = Theory.sign_of thy1; |
5177 | 801 |
|
19874 | 802 |
val induction' = Thm.freezeT induction; |
5177 | 803 |
|
804 |
fun err t = error ("Ill-formed predicate in induction rule: " ^ |
|
805 |
Sign.string_of_term sign t); |
|
806 |
||
807 |
fun get_typ (t as _ $ Var (_, Type (tname, Ts))) = |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
808 |
((tname, map dest_TFree Ts) handle TERM _ => err t) |
5177 | 809 |
| get_typ t = err t; |
810 |
||
8437 | 811 |
val dtnames = map get_typ (HOLogic.dest_conj (HOLogic.dest_Trueprop (Thm.concl_of induction'))); |
15570 | 812 |
val new_type_names = getOpt (alt_names, map fst dtnames); |
5177 | 813 |
|
814 |
fun get_constr t = (case Logic.strip_assums_concl t of |
|
815 |
_ $ (_ $ t') => (case head_of t' of |
|
816 |
Const (cname, cT) => (case strip_type cT of |
|
817 |
(Ts, Type (tname, _)) => (tname, (cname, map (dtyp_of_typ dtnames) Ts)) |
|
818 |
| _ => err t) |
|
819 |
| _ => err t) |
|
820 |
| _ => err t); |
|
821 |
||
822 |
fun make_dt_spec [] _ _ = [] |
|
823 |
| make_dt_spec ((tname, tvs)::dtnames') i constrs = |
|
824 |
let val (constrs', constrs'') = take_prefix (equal tname o fst) constrs |
|
825 |
in (i, (tname, map DtTFree tvs, map snd constrs')):: |
|
826 |
(make_dt_spec dtnames' (i + 1) constrs'') |
|
827 |
end; |
|
828 |
||
829 |
val descr = make_dt_spec dtnames 0 (map get_constr (prems_of induction')); |
|
830 |
val sorts = add_term_tfrees (concl_of induction', []); |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
831 |
val dt_info = get_datatypes thy1; |
5177 | 832 |
|
8437 | 833 |
val case_names_induct = mk_case_names_induct descr; |
834 |
val case_names_exhausts = mk_case_names_exhausts descr (map #1 dtnames); |
|
835 |
||
836 |
||
6427 | 837 |
val _ = message ("Proofs for datatype(s) " ^ commas_quote new_type_names); |
5177 | 838 |
|
18314 | 839 |
val (casedist_thms, thy2) = thy1 |> |
8437 | 840 |
DatatypeAbsProofs.prove_casedist_thms new_type_names [descr] sorts induction |
841 |
case_names_exhausts; |
|
18314 | 842 |
val ((reccomb_names, rec_thms), thy3) = DatatypeAbsProofs.prove_primrec_thms |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
843 |
false new_type_names [descr] sorts dt_info inject distinct dist_ss induction thy2; |
18314 | 844 |
val ((case_thms, case_names), thy4) = DatatypeAbsProofs.prove_case_thms false |
5177 | 845 |
new_type_names [descr] sorts reccomb_names rec_thms thy3; |
18314 | 846 |
val (split_thms, thy5) = DatatypeAbsProofs.prove_split_thms |
5177 | 847 |
new_type_names [descr] sorts inject distinct casedist_thms case_thms thy4; |
18314 | 848 |
val (nchotomys, thy6) = DatatypeAbsProofs.prove_nchotomys new_type_names |
5177 | 849 |
[descr] sorts casedist_thms thy5; |
18314 | 850 |
val (case_congs, thy7) = DatatypeAbsProofs.prove_case_congs new_type_names |
5177 | 851 |
[descr] sorts nchotomys case_thms thy6; |
18314 | 852 |
val (weak_case_congs, thy8) = DatatypeAbsProofs.prove_weak_case_congs new_type_names |
8601 | 853 |
[descr] sorts thy7; |
18314 | 854 |
val (size_thms, thy9) = |
16430 | 855 |
if Context.exists_name "NatArith" thy8 then |
5661 | 856 |
DatatypeAbsProofs.prove_size_thms false new_type_names |
8601 | 857 |
[descr] sorts reccomb_names rec_thms thy8 |
18314 | 858 |
else ([], thy8); |
5177 | 859 |
|
18377 | 860 |
val ((_, [induction']), thy10) = |
861 |
thy9 |
|
862 |
|> store_thmss "inject" new_type_names inject |
|
863 |
||>> store_thmss "distinct" new_type_names distinct |
|
864 |
||> Theory.add_path (space_implode "_" new_type_names) |
|
865 |
||>> PureThy.add_thms [(("induct", induction), [case_names_induct])]; |
|
9149 | 866 |
|
18319
c52b139ebde0
Added new component "sorts" to record datatype_info.
berghofe
parents:
18314
diff
changeset
|
867 |
val dt_infos = map (make_dt_info descr sorts induction' reccomb_names rec_thms) |
10121 | 868 |
((0 upto length descr - 1) ~~ descr ~~ case_names ~~ case_thms ~~ casedist_thms ~~ |
869 |
map FewConstrs distinct ~~ inject ~~ nchotomys ~~ case_congs ~~ weak_case_congs); |
|
5177 | 870 |
|
15570 | 871 |
val simps = List.concat (distinct @ inject @ case_thms) @ size_thms @ rec_thms; |
5177 | 872 |
|
19599 | 873 |
val thy11 = |
874 |
thy10 |
|
875 |
|> Theory.add_advanced_trfuns ([], [], make_case_tr' case_names descr, []) |
|
876 |
|> add_rules simps case_thms size_thms rec_thms inject distinct |
|
877 |
weak_case_congs (Simplifier.attrib (op addcongs)) |
|
878 |
|> put_datatypes (fold Symtab.update dt_infos dt_info) |
|
879 |
|> add_cases_induct dt_infos induction' |
|
880 |
|> Theory.parent_path |
|
881 |
|> store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms) |
|
882 |
|> snd |
|
883 |
|> DatatypeRealizer.add_dt_realizers sorts (map snd dt_infos) |
|
884 |
|> fold (DatatypeHooks.invoke o fst) dt_infos; |
|
5177 | 885 |
in |
18008 | 886 |
({distinct = distinct, |
5177 | 887 |
inject = inject, |
888 |
exhaustion = casedist_thms, |
|
889 |
rec_thms = rec_thms, |
|
890 |
case_thms = case_thms, |
|
891 |
split_thms = split_thms, |
|
8437 | 892 |
induction = induction', |
5177 | 893 |
size = size_thms, |
18008 | 894 |
simps = simps}, thy11) |
5177 | 895 |
end; |
896 |
||
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
897 |
val rep_datatype = gen_rep_datatype IsarThy.apply_theorems; |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
898 |
val rep_datatype_i = gen_rep_datatype IsarThy.apply_theorems_i; |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
899 |
|
5177 | 900 |
|
11958 | 901 |
|
5177 | 902 |
(******************************** add datatype ********************************) |
903 |
||
14887 | 904 |
fun gen_add_datatype prep_typ err flat_names new_type_names dts thy = |
5177 | 905 |
let |
12922 | 906 |
val _ = Theory.requires thy "Datatype_Universe" "datatype definitions"; |
5177 | 907 |
|
908 |
(* this theory is used just for parsing *) |
|
909 |
||
910 |
val tmp_thy = thy |> |
|
5892 | 911 |
Theory.copy |> |
5177 | 912 |
Theory.add_types (map (fn (tvs, tname, mx, _) => |
913 |
(tname, length tvs, mx)) dts); |
|
914 |
||
6394 | 915 |
val sign = Theory.sign_of tmp_thy; |
5177 | 916 |
|
5661 | 917 |
val (tyvars, _, _, _)::_ = dts; |
5177 | 918 |
val (new_dts, types_syntax) = ListPair.unzip (map (fn (tvs, tname, mx, _) => |
919 |
let val full_tname = Sign.full_name sign (Syntax.type_name tname mx) |
|
18964 | 920 |
in (case duplicates (op =) tvs of |
5661 | 921 |
[] => if eq_set (tyvars, tvs) then ((full_tname, tvs), (tname, mx)) |
922 |
else error ("Mutually recursive datatypes must have same type parameters") |
|
5177 | 923 |
| dups => error ("Duplicate parameter(s) for datatype " ^ full_tname ^ |
924 |
" : " ^ commas dups)) |
|
925 |
end) dts); |
|
926 |
||
18964 | 927 |
val _ = (case duplicates (op =) (map fst new_dts) @ duplicates (op =) new_type_names of |
5177 | 928 |
[] => () | dups => error ("Duplicate datatypes: " ^ commas dups)); |
929 |
||
930 |
fun prep_dt_spec ((dts', constr_syntax, sorts, i), (tvs, tname, mx, constrs)) = |
|
931 |
let |
|
5661 | 932 |
fun prep_constr ((constrs, constr_syntax', sorts'), (cname, cargs, mx')) = |
5279 | 933 |
let |
15570 | 934 |
val (cargs', sorts'') = Library.foldl (prep_typ sign) (([], sorts'), cargs); |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
935 |
val _ = (case foldr add_typ_tfree_names [] cargs' \\ tvs of |
5279 | 936 |
[] => () |
937 |
| vs => error ("Extra type variables on rhs: " ^ commas vs)) |
|
5661 | 938 |
in (constrs @ [((if flat_names then Sign.full_name sign else |
939 |
Sign.full_name_path sign tname) (Syntax.const_name cname mx'), |
|
5177 | 940 |
map (dtyp_of_typ new_dts) cargs')], |
941 |
constr_syntax' @ [(cname, mx')], sorts'') |
|
18678 | 942 |
end handle ERROR msg => |
943 |
cat_error msg ("The error above occured in constructor " ^ cname ^ |
|
5177 | 944 |
" of datatype " ^ tname); |
945 |
||
946 |
val (constrs', constr_syntax', sorts') = |
|
15570 | 947 |
Library.foldl prep_constr (([], [], sorts), constrs) |
5177 | 948 |
|
8405 | 949 |
in |
18964 | 950 |
case duplicates (op =) (map fst constrs') of |
5177 | 951 |
[] => |
952 |
(dts' @ [(i, (Sign.full_name sign (Syntax.type_name tname mx), |
|
953 |
map DtTFree tvs, constrs'))], |
|
954 |
constr_syntax @ [constr_syntax'], sorts', i + 1) |
|
955 |
| dups => error ("Duplicate constructors " ^ commas dups ^ |
|
956 |
" in datatype " ^ tname) |
|
957 |
end; |
|
958 |
||
15570 | 959 |
val (dts', constr_syntax, sorts', i) = Library.foldl prep_dt_spec (([], [], [], 0), dts); |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
960 |
val sorts = sorts' @ (map (rpair (Sign.defaultS sign)) (tyvars \\ map fst sorts')); |
5177 | 961 |
val dt_info = get_datatypes thy; |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
962 |
val (descr, _) = unfold_datatypes sign dts' sorts dt_info dts' i; |
14887 | 963 |
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
|
964 |
if err then error ("Nonemptiness check failed for datatype " ^ s) |
14887 | 965 |
else raise exn; |
5177 | 966 |
|
15570 | 967 |
val descr' = List.concat descr; |
8437 | 968 |
val case_names_induct = mk_case_names_induct descr'; |
969 |
val case_names_exhausts = mk_case_names_exhausts descr' (map #1 new_dts); |
|
5177 | 970 |
in |
971 |
(if (!quick_and_dirty) then add_datatype_axm else add_datatype_def) |
|
8437 | 972 |
flat_names new_type_names descr sorts types_syntax constr_syntax dt_info |
973 |
case_names_induct case_names_exhausts thy |
|
5177 | 974 |
end; |
975 |
||
976 |
val add_datatype_i = gen_add_datatype cert_typ; |
|
14887 | 977 |
val add_datatype = gen_add_datatype read_typ true; |
5177 | 978 |
|
6360 | 979 |
|
18451 | 980 |
|
6360 | 981 |
(** package setup **) |
982 |
||
983 |
(* setup theory *) |
|
984 |
||
18708 | 985 |
val setup = |
986 |
DatatypesData.init #> Method.add_methods tactic_emulations #> simproc_setup #> trfun_setup; |
|
6360 | 987 |
|
988 |
||
989 |
(* outer syntax *) |
|
990 |
||
17057 | 991 |
local structure P = OuterParse and K = OuterKeyword in |
6360 | 992 |
|
993 |
val datatype_decl = |
|
6723 | 994 |
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
|
995 |
(P.$$$ "=" |-- P.enum1 "|" (P.name -- Scan.repeat P.typ -- P.opt_mixfix)); |
6360 | 996 |
|
997 |
fun mk_datatype args = |
|
998 |
let |
|
15531 | 999 |
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
|
1000 |
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
|
1001 |
(vs, t, mx, map (fn ((x, y), z) => (x, y, z)) cons)) args; |
18008 | 1002 |
in snd o add_datatype false names specs end; |
6360 | 1003 |
|
1004 |
val datatypeP = |
|
6723 | 1005 |
OuterSyntax.command "datatype" "define inductive datatypes" K.thy_decl |
1006 |
(P.and_list1 datatype_decl >> (Toplevel.theory o mk_datatype)); |
|
6360 | 1007 |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1008 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1009 |
val rep_datatype_decl = |
6723 | 1010 |
Scan.option (Scan.repeat1 P.name) -- |
11958 | 1011 |
Scan.optional (P.$$$ "distinct" |-- P.!!! (P.and_list1 P.xthms1)) [[]] -- |
1012 |
Scan.optional (P.$$$ "inject" |-- P.!!! (P.and_list1 P.xthms1)) [[]] -- |
|
6723 | 1013 |
(P.$$$ "induction" |-- P.!!! P.xthm); |
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1014 |
|
18008 | 1015 |
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
|
1016 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1017 |
val rep_datatypeP = |
6723 | 1018 |
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
|
1019 |
(rep_datatype_decl >> (Toplevel.theory o mk_rep_datatype)); |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1020 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1021 |
|
6479
b0448cab1b1e
rep_datatype syntax: 'induction' instead of 'induct';
wenzelm
parents:
6441
diff
changeset
|
1022 |
val _ = OuterSyntax.add_keywords ["distinct", "inject", "induction"]; |
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1023 |
val _ = OuterSyntax.add_parsers [datatypeP, rep_datatypeP]; |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1024 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1025 |
end; |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1026 |
|
6360 | 1027 |
|
5177 | 1028 |
end; |
1029 |
||
6360 | 1030 |
structure BasicDatatypePackage: BASIC_DATATYPE_PACKAGE = DatatypePackage; |
1031 |
open BasicDatatypePackage; |
|
15704 | 1032 |