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