author | haftmann |
Tue, 07 Oct 2008 16:07:50 +0200 | |
changeset 28524 | 644b62cf678f |
parent 27865 | 27a8ad9612a3 |
child 28703 | aef727ef30e5 |
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 |
||
27097 | 8 |
signature DATATYPE_PACKAGE = |
6360 | 9 |
sig |
27097 | 10 |
val quiet_mode : bool ref |
11 |
val get_datatypes : theory -> DatatypeAux.datatype_info Symtab.table |
|
12 |
val print_datatypes : theory -> unit |
|
13 |
val get_datatype : theory -> string -> DatatypeAux.datatype_info option |
|
14 |
val the_datatype : theory -> string -> DatatypeAux.datatype_info |
|
15 |
val datatype_of_constr : theory -> string -> DatatypeAux.datatype_info option |
|
16 |
val datatype_of_case : theory -> string -> DatatypeAux.datatype_info option |
|
17 |
val the_datatype_spec : theory -> string -> (string * sort) list * (string * typ list) list |
|
18 |
val get_datatype_constrs : theory -> string -> (string * typ) list option |
|
19 |
val construction_interpretation : theory |
|
20 |
-> {atom : typ -> 'a, dtyp : string -> 'a, rtyp : string -> 'a list -> 'a} |
|
21 |
-> (string * sort) list -> string list |
|
22 |
-> (string * (string * 'a list) list) list |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
23 |
val distinct_simproc : simproc |
27097 | 24 |
val make_case : Proof.context -> bool -> string list -> term -> |
25 |
(term * term) list -> term * (term * (int * bool)) list |
|
26 |
val strip_case : Proof.context -> bool -> term -> (term * (term * term) list) option |
|
27277
7b7ce2d7fafe
export read_typ/cert_typ -- version with regular context operations;
wenzelm
parents:
27261
diff
changeset
|
27 |
val read_typ: theory -> |
7b7ce2d7fafe
export read_typ/cert_typ -- version with regular context operations;
wenzelm
parents:
27261
diff
changeset
|
28 |
(typ list * (string * sort) list) * string -> typ list * (string * sort) list |
27097 | 29 |
val interpretation : (string list -> theory -> theory) -> theory -> theory |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
30 |
val rep_datatype : ({distinct : thm list list, |
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
31 |
inject : thm list list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
32 |
exhaustion : thm list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
33 |
rec_thms : thm list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
34 |
case_thms : thm list list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
35 |
split_thms : (thm * thm) list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
36 |
induction : thm, |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
37 |
simps : thm list} -> Proof.context -> Proof.context) -> string list option -> term list |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
38 |
-> theory -> Proof.state; |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
39 |
val rep_datatype_cmd : string list option -> string list -> theory -> Proof.state; |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
40 |
val add_datatype : bool -> bool -> string list -> (string list * bstring * mixfix * |
27097 | 41 |
(bstring * typ list * mixfix) list) list -> theory -> |
42 |
{distinct : thm list list, |
|
43 |
inject : thm list list, |
|
44 |
exhaustion : thm list, |
|
45 |
rec_thms : thm list, |
|
46 |
case_thms : thm list list, |
|
47 |
split_thms : (thm * thm) list, |
|
48 |
induction : thm, |
|
49 |
simps : thm list} * theory |
|
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
50 |
val add_datatype_cmd : bool -> string list -> (string list * bstring * mixfix * |
27097 | 51 |
(bstring * string list * mixfix) list) list -> theory -> |
52 |
{distinct : thm list list, |
|
53 |
inject : thm list list, |
|
54 |
exhaustion : thm list, |
|
55 |
rec_thms : thm list, |
|
56 |
case_thms : thm list list, |
|
57 |
split_thms : (thm * thm) list, |
|
58 |
induction : thm, |
|
59 |
simps : thm list} * theory |
|
18708 | 60 |
val setup: theory -> theory |
5177 | 61 |
end; |
62 |
||
63 |
structure DatatypePackage : DATATYPE_PACKAGE = |
|
64 |
struct |
|
65 |
||
66 |
open DatatypeAux; |
|
67 |
||
5661 | 68 |
val quiet_mode = quiet_mode; |
69 |
||
6360 | 70 |
|
22846 | 71 |
(* theory data *) |
5177 | 72 |
|
16430 | 73 |
structure DatatypesData = TheoryDataFun |
22846 | 74 |
( |
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
75 |
type T = |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
76 |
{types: datatype_info Symtab.table, |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
77 |
constrs: datatype_info Symtab.table, |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
78 |
cases: datatype_info Symtab.table}; |
5177 | 79 |
|
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
80 |
val empty = |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
81 |
{types = Symtab.empty, constrs = Symtab.empty, cases = Symtab.empty}; |
6556 | 82 |
val copy = I; |
16430 | 83 |
val extend = I; |
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
84 |
fun merge _ |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
85 |
({types = types1, constrs = constrs1, cases = cases1}, |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
86 |
{types = types2, constrs = constrs2, cases = cases2}) = |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
87 |
{types = Symtab.merge (K true) (types1, types2), |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
88 |
constrs = Symtab.merge (K true) (constrs1, constrs2), |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
89 |
cases = Symtab.merge (K true) (cases1, cases2)}; |
22846 | 90 |
); |
5177 | 91 |
|
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
92 |
val get_datatypes = #types o DatatypesData.get; |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
93 |
val map_datatypes = DatatypesData.map; |
22846 | 94 |
|
95 |
fun print_datatypes thy = |
|
96 |
Pretty.writeln (Pretty.strs ("datatypes:" :: |
|
97 |
map #1 (NameSpace.extern_table (Sign.type_space thy, get_datatypes thy)))); |
|
5177 | 98 |
|
99 |
||
100 |
(** theory information about datatypes **) |
|
101 |
||
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
102 |
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
|
103 |
map_datatypes (fn {types, constrs, cases} => |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
104 |
{types = fold Symtab.update dt_infos types, |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
105 |
constrs = fold Symtab.update |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
106 |
(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
|
107 |
(#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
|
108 |
cases = fold Symtab.update |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
109 |
(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
|
110 |
cases}); |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
111 |
|
19346 | 112 |
val get_datatype = Symtab.lookup o get_datatypes; |
5177 | 113 |
|
19346 | 114 |
fun the_datatype thy name = (case get_datatype thy name of |
15531 | 115 |
SOME info => info |
116 |
| NONE => error ("Unknown datatype " ^ quote name)); |
|
5177 | 117 |
|
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
118 |
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
|
119 |
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
|
120 |
|
19346 | 121 |
fun get_datatype_descr thy dtco = |
122 |
get_datatype thy dtco |
|
24711 | 123 |
|> Option.map (fn info as { descr, index, ... } => |
19346 | 124 |
(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
|
125 |
|
25537 | 126 |
fun the_datatype_spec thy dtco = |
18518 | 127 |
let |
26093 | 128 |
val info as { descr, index, sorts = raw_sorts, ... } = the_datatype thy dtco; |
129 |
val SOME (_, dtys, raw_cos) = AList.lookup (op =) descr index; |
|
130 |
val sorts = map ((fn v => (v, (the o AList.lookup (op =) raw_sorts) v)) |
|
131 |
o DatatypeAux.dest_DtTFree) dtys; |
|
132 |
val cos = map |
|
133 |
(fn (co, tys) => (co, map (DatatypeAux.typ_of_dtyp descr sorts) tys)) raw_cos; |
|
134 |
in (sorts, cos) end; |
|
18518 | 135 |
|
19346 | 136 |
fun get_datatype_constrs thy dtco = |
25537 | 137 |
case try (the_datatype_spec thy) dtco |
19346 | 138 |
of SOME (sorts, cos) => |
139 |
let |
|
140 |
fun subst (v, sort) = TVar ((v, 0), sort); |
|
141 |
fun subst_ty (TFree v) = subst v |
|
142 |
| subst_ty ty = ty; |
|
143 |
val dty = Type (dtco, map subst sorts); |
|
144 |
fun mk_co (co, tys) = (co, map (Term.map_atyps subst_ty) tys ---> dty); |
|
145 |
in SOME (map mk_co cos) end |
|
146 |
| NONE => NONE; |
|
18518 | 147 |
|
26267
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
148 |
fun construction_interpretation thy { atom, dtyp, rtyp } sorts tycos = |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
149 |
let |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
150 |
val descr = (#descr o the_datatype thy o hd) tycos; |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
151 |
val k = length tycos; |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
152 |
val descr_of = the o AList.lookup (op =) descr; |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
153 |
fun interpT (T as DtTFree _) = atom (typ_of_dtyp descr sorts T) |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
154 |
| interpT (T as DtType (tyco, Ts)) = if is_rec_type T |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
155 |
then rtyp tyco (map interpT Ts) |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
156 |
else atom (typ_of_dtyp descr sorts T) |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
157 |
| interpT (DtRec l) = if l < k then (dtyp o #1 o descr_of) l |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
158 |
else let val (tyco, Ts, _) = descr_of l |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
159 |
in rtyp tyco (map interpT Ts) end; |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
160 |
fun interpC (c, Ts) = (c, map interpT Ts); |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
161 |
fun interpK (_, (tyco, _, cs)) = (tyco, map interpC cs); |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
162 |
in map interpK (Library.take (k, descr)) end; |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
163 |
|
8541 | 164 |
|
5177 | 165 |
|
8437 | 166 |
(** induct method setup **) |
167 |
||
168 |
(* case names *) |
|
169 |
||
170 |
local |
|
171 |
||
172 |
fun dt_recs (DtTFree _) = [] |
|
21045 | 173 |
| dt_recs (DtType (_, dts)) = maps dt_recs dts |
8437 | 174 |
| dt_recs (DtRec i) = [i]; |
175 |
||
176 |
fun dt_cases (descr: descr) (_, args, constrs) = |
|
177 |
let |
|
21045 | 178 |
fun the_bname i = Sign.base_name (#1 (the (AList.lookup (op =) descr i))); |
179 |
val bnames = map the_bname (distinct (op =) (maps dt_recs args)); |
|
8437 | 180 |
in map (fn (c, _) => space_implode "_" (Sign.base_name c :: bnames)) constrs end; |
181 |
||
182 |
||
183 |
fun induct_cases descr = |
|
21045 | 184 |
DatatypeProp.indexify_names (maps (dt_cases descr) (map #2 descr)); |
8437 | 185 |
|
21045 | 186 |
fun exhaust_cases descr i = dt_cases descr (the (AList.lookup (op =) descr i)); |
8437 | 187 |
|
188 |
in |
|
189 |
||
190 |
fun mk_case_names_induct descr = RuleCases.case_names (induct_cases descr); |
|
191 |
||
192 |
fun mk_case_names_exhausts descr new = |
|
193 |
map (RuleCases.case_names o exhaust_cases descr o #1) |
|
21045 | 194 |
(filter (fn ((_, (name, _, _))) => member (op =) new name) descr); |
8437 | 195 |
|
196 |
end; |
|
197 |
||
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24626
diff
changeset
|
198 |
fun add_rules simps case_thms rec_thms inject distinct |
11345
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
199 |
weak_case_congs cong_att = |
21127 | 200 |
PureThy.add_thmss [(("simps", simps), []), |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24626
diff
changeset
|
201 |
(("", flat case_thms @ |
21045 | 202 |
flat distinct @ rec_thms), [Simplifier.simp_add]), |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24626
diff
changeset
|
203 |
(("", rec_thms), [RecfunCodegen.add_default]), |
21127 | 204 |
(("", flat inject), [iff_add]), |
21689
58abd6d8abd1
Removal of theorem tagging, which the ATP linkup no longer requires,
paulson
parents:
21646
diff
changeset
|
205 |
(("", map (fn th => th RS notE) (flat distinct)), [Classical.safe_elim NONE]), |
21127 | 206 |
(("", weak_case_congs), [cong_att])] |
207 |
#> snd; |
|
11345
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
208 |
|
8437 | 209 |
|
210 |
(* add_cases_induct *) |
|
8306 | 211 |
|
19874 | 212 |
fun add_cases_induct infos induction thy = |
8306 | 213 |
let |
19874 | 214 |
val inducts = ProjectRule.projections (ProofContext.init thy) induction; |
8405 | 215 |
|
11805
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
216 |
fun named_rules (name, {index, exhaustion, ...}: datatype_info) = |
24830
a7b3ab44d993
moved Pure/Isar/induct_attrib.ML and Provers/induct_method.ML to Tools/induct.ML;
wenzelm
parents:
24770
diff
changeset
|
217 |
[(("", nth inducts index), [Induct.induct_type name]), |
a7b3ab44d993
moved Pure/Isar/induct_attrib.ML and Provers/induct_method.ML to Tools/induct.ML;
wenzelm
parents:
24770
diff
changeset
|
218 |
(("", exhaustion), [Induct.cases_type name])]; |
11805
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
219 |
fun unnamed_rule i = |
27865
27a8ad9612a3
moved basic thm operations from structure PureThy to Thm (cf. more_thm.ML);
wenzelm
parents:
27300
diff
changeset
|
220 |
(("", nth inducts i), [Thm.kind_internal, Induct.induct_type ""]); |
18462 | 221 |
in |
19874 | 222 |
thy |> PureThy.add_thms |
21045 | 223 |
(maps named_rules infos @ |
19874 | 224 |
map unnamed_rule (length infos upto length inducts - 1)) |> snd |
225 |
|> PureThy.add_thmss [(("inducts", inducts), [])] |> snd |
|
18462 | 226 |
end; |
8306 | 227 |
|
5177 | 228 |
|
8405 | 229 |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
230 |
(**** simplification procedure for showing distinctness of constructors ****) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
231 |
|
7060 | 232 |
fun stripT (i, Type ("fun", [_, T])) = stripT (i + 1, T) |
233 |
| stripT p = p; |
|
234 |
||
235 |
fun stripC (i, f $ x) = stripC (i + 1, f) |
|
236 |
| stripC p = p; |
|
237 |
||
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
238 |
val distinctN = "constr_distinct"; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
239 |
|
25537 | 240 |
fun distinct_rule thy ss tname eq_t = case #distinct (the_datatype thy tname) of |
26533
aeef55a3d1d5
Deleted code for axiomatic introduction of datatypes. Instead, the package
berghofe
parents:
26496
diff
changeset
|
241 |
FewConstrs thms => Goal.prove (Simplifier.the_context ss) [] [] eq_t (K |
25537 | 242 |
(EVERY [rtac eq_reflection 1, rtac iffI 1, rtac notE 1, |
243 |
atac 2, resolve_tac thms 1, etac FalseE 1])) |
|
244 |
| ManyConstrs (thm, simpset) => |
|
245 |
let |
|
246 |
val [In0_inject, In1_inject, In0_not_In1, In1_not_In0] = |
|
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26336
diff
changeset
|
247 |
map (PureThy.get_thm (ThyInfo.the_theory "Datatype" thy)) |
25537 | 248 |
["In0_inject", "In1_inject", "In0_not_In1", "In1_not_In0"]; |
249 |
in |
|
250 |
Goal.prove (Simplifier.the_context ss) [] [] eq_t (K |
|
251 |
(EVERY [rtac eq_reflection 1, rtac iffI 1, dtac thm 1, |
|
252 |
full_simp_tac (Simplifier.inherit_context ss simpset) 1, |
|
253 |
REPEAT (dresolve_tac [In0_inject, In1_inject] 1), |
|
254 |
eresolve_tac [In0_not_In1 RS notE, In1_not_In0 RS notE] 1, |
|
255 |
etac FalseE 1])) |
|
256 |
end; |
|
257 |
||
19539 | 258 |
fun distinct_proc thy ss (t as Const ("op =", _) $ t1 $ t2) = |
7060 | 259 |
(case (stripC (0, t1), stripC (0, t2)) of |
260 |
((i, Const (cname1, T1)), (j, Const (cname2, T2))) => |
|
261 |
(case (stripT (0, T1), stripT (0, T2)) of |
|
262 |
((i', Type (tname1, _)), (j', Type (tname2, _))) => |
|
263 |
if tname1 = tname2 andalso not (cname1 = cname2) andalso i = i' andalso j = j' then |
|
19539 | 264 |
(case (get_datatype_descr thy) tname1 of |
19346 | 265 |
SOME (_, (_, constrs)) => let val cnames = map fst constrs |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
266 |
in if cname1 mem cnames andalso cname2 mem cnames then |
25537 | 267 |
SOME (distinct_rule thy ss tname1 |
268 |
(Logic.mk_equals (t, Const ("False", HOLogic.boolT)))) |
|
15531 | 269 |
else NONE |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
270 |
end |
15531 | 271 |
| NONE => NONE) |
272 |
else NONE |
|
273 |
| _ => NONE) |
|
274 |
| _ => NONE) |
|
20054 | 275 |
| distinct_proc _ _ _ = NONE; |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
276 |
|
13462 | 277 |
val distinct_simproc = |
16430 | 278 |
Simplifier.simproc HOL.thy distinctN ["s = t"] distinct_proc; |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
279 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
280 |
val dist_ss = HOL_ss addsimprocs [distinct_simproc]; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
281 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
282 |
val simproc_setup = |
26496
49ae9456eba9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26343
diff
changeset
|
283 |
Simplifier.map_simpset (fn ss => ss addsimprocs [distinct_simproc]); |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
284 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
285 |
|
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
286 |
(**** translation rules for case ****) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
287 |
|
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
288 |
fun make_case ctxt = DatatypeCase.make_case |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
289 |
(datatype_of_constr (ProofContext.theory_of ctxt)) ctxt; |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
290 |
|
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
291 |
fun strip_case ctxt = DatatypeCase.strip_case |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
292 |
(datatype_of_case (ProofContext.theory_of ctxt)); |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
293 |
|
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
294 |
fun add_case_tr' case_names thy = |
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24711
diff
changeset
|
295 |
Sign.add_advanced_trfuns ([], [], |
24711 | 296 |
map (fn case_name => |
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
297 |
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
|
298 |
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
|
299 |
end) case_names, []) thy; |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
300 |
|
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
301 |
val trfun_setup = |
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24711
diff
changeset
|
302 |
Sign.add_advanced_trfuns ([], |
24349 | 303 |
[("_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
|
304 |
[], []); |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
305 |
|
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
306 |
|
5177 | 307 |
(* prepare types *) |
308 |
||
27277
7b7ce2d7fafe
export read_typ/cert_typ -- version with regular context operations;
wenzelm
parents:
27261
diff
changeset
|
309 |
fun read_typ thy ((Ts, sorts), str) = |
5177 | 310 |
let |
27277
7b7ce2d7fafe
export read_typ/cert_typ -- version with regular context operations;
wenzelm
parents:
27261
diff
changeset
|
311 |
val ctxt = ProofContext.init thy |
7b7ce2d7fafe
export read_typ/cert_typ -- version with regular context operations;
wenzelm
parents:
27261
diff
changeset
|
312 |
|> fold (Variable.declare_typ o TFree) sorts; |
7b7ce2d7fafe
export read_typ/cert_typ -- version with regular context operations;
wenzelm
parents:
27261
diff
changeset
|
313 |
val T = Syntax.read_typ ctxt str; |
7b7ce2d7fafe
export read_typ/cert_typ -- version with regular context operations;
wenzelm
parents:
27261
diff
changeset
|
314 |
in (Ts @ [T], Term.add_tfreesT T sorts) end; |
5177 | 315 |
|
316 |
fun cert_typ sign ((Ts, sorts), raw_T) = |
|
317 |
let |
|
318 |
val T = Type.no_tvars (Sign.certify_typ sign raw_T) handle |
|
319 |
TYPE (msg, _, _) => error msg; |
|
27277
7b7ce2d7fafe
export read_typ/cert_typ -- version with regular context operations;
wenzelm
parents:
27261
diff
changeset
|
320 |
val sorts' = Term.add_tfreesT T sorts; |
5177 | 321 |
in (Ts @ [T], |
18964 | 322 |
case duplicates (op =) (map fst sorts') of |
5177 | 323 |
[] => sorts' |
324 |
| dups => error ("Inconsistent sort constraints for " ^ commas dups)) |
|
325 |
end; |
|
326 |
||
327 |
||
328 |
(**** make datatype info ****) |
|
329 |
||
25677
8b2ddc6e7be1
- Removed redundant head_len field in datatype_info
berghofe
parents:
25537
diff
changeset
|
330 |
fun make_dt_info alt_names descr sorts induct reccomb_names rec_thms |
10121 | 331 |
(((((((((i, (_, (tname, _, _))), case_name), case_thms), |
332 |
exhaustion_thm), distinct_thm), inject), nchotomy), case_cong), weak_case_cong) = |
|
333 |
(tname, |
|
334 |
{index = i, |
|
25677
8b2ddc6e7be1
- Removed redundant head_len field in datatype_info
berghofe
parents:
25537
diff
changeset
|
335 |
alt_names = alt_names, |
10121 | 336 |
descr = descr, |
18319
c52b139ebde0
Added new component "sorts" to record datatype_info.
berghofe
parents:
18314
diff
changeset
|
337 |
sorts = sorts, |
10121 | 338 |
rec_names = reccomb_names, |
339 |
rec_rewrites = rec_thms, |
|
340 |
case_name = case_name, |
|
341 |
case_rewrites = case_thms, |
|
342 |
induction = induct, |
|
343 |
exhaustion = exhaustion_thm, |
|
344 |
distinct = distinct_thm, |
|
345 |
inject = inject, |
|
346 |
nchotomy = nchotomy, |
|
347 |
case_cong = case_cong, |
|
348 |
weak_case_cong = weak_case_cong}); |
|
5177 | 349 |
|
24711 | 350 |
structure DatatypeInterpretation = InterpretationFun(type T = string list val eq = op =); |
351 |
val interpretation = DatatypeInterpretation.interpretation; |
|
24626
85eceef2edc7
introduced generic concepts for theory interpretators
haftmann
parents:
24624
diff
changeset
|
352 |
|
5177 | 353 |
|
354 |
(******************* definitional introduction of datatypes *******************) |
|
355 |
||
8437 | 356 |
fun add_datatype_def flat_names new_type_names descr sorts types_syntax constr_syntax dt_info |
357 |
case_names_induct case_names_exhausts thy = |
|
5177 | 358 |
let |
6360 | 359 |
val _ = message ("Proofs for datatype(s) " ^ commas_quote new_type_names); |
5177 | 360 |
|
18314 | 361 |
val ((inject, distinct, dist_rewrites, simproc_dists, induct), thy2) = thy |> |
5661 | 362 |
DatatypeRepProofs.representation_proofs flat_names dt_info new_type_names descr sorts |
8437 | 363 |
types_syntax constr_syntax case_names_induct; |
5177 | 364 |
|
18314 | 365 |
val (casedist_thms, thy3) = DatatypeAbsProofs.prove_casedist_thms new_type_names descr |
8437 | 366 |
sorts induct case_names_exhausts thy2; |
18314 | 367 |
val ((reccomb_names, rec_thms), thy4) = DatatypeAbsProofs.prove_primrec_thms |
20054 | 368 |
flat_names new_type_names descr sorts dt_info inject dist_rewrites |
369 |
(Simplifier.theory_context thy3 dist_ss) induct thy3; |
|
18314 | 370 |
val ((case_thms, case_names), thy6) = DatatypeAbsProofs.prove_case_thms |
5661 | 371 |
flat_names new_type_names descr sorts reccomb_names rec_thms thy4; |
18314 | 372 |
val (split_thms, thy7) = DatatypeAbsProofs.prove_split_thms new_type_names |
5177 | 373 |
descr sorts inject dist_rewrites casedist_thms case_thms thy6; |
18314 | 374 |
val (nchotomys, thy8) = DatatypeAbsProofs.prove_nchotomys new_type_names |
5177 | 375 |
descr sorts casedist_thms thy7; |
18314 | 376 |
val (case_congs, thy9) = DatatypeAbsProofs.prove_case_congs new_type_names |
5177 | 377 |
descr sorts nchotomys case_thms thy8; |
18314 | 378 |
val (weak_case_congs, thy10) = DatatypeAbsProofs.prove_weak_case_congs new_type_names |
8601 | 379 |
descr sorts thy9; |
5177 | 380 |
|
25677
8b2ddc6e7be1
- Removed redundant head_len field in datatype_info
berghofe
parents:
25537
diff
changeset
|
381 |
val dt_infos = map (make_dt_info NONE (flat descr) sorts induct reccomb_names rec_thms) |
5177 | 382 |
((0 upto length (hd descr) - 1) ~~ (hd descr) ~~ case_names ~~ case_thms ~~ |
10121 | 383 |
casedist_thms ~~ simproc_dists ~~ inject ~~ nchotomys ~~ case_congs ~~ weak_case_congs); |
5177 | 384 |
|
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24626
diff
changeset
|
385 |
val simps = flat (distinct @ inject @ case_thms) @ rec_thms; |
5177 | 386 |
|
18518 | 387 |
val thy12 = |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24626
diff
changeset
|
388 |
thy10 |
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
389 |
|> add_case_tr' case_names |
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24711
diff
changeset
|
390 |
|> Sign.add_path (space_implode "_" new_type_names) |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24626
diff
changeset
|
391 |
|> add_rules simps case_thms rec_thms inject distinct |
18728 | 392 |
weak_case_congs (Simplifier.attrib (op addcongs)) |
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
393 |
|> put_dt_infos dt_infos |
18518 | 394 |
|> add_cases_induct dt_infos induct |
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24711
diff
changeset
|
395 |
|> Sign.parent_path |
18518 | 396 |
|> store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms) |> snd |
24711 | 397 |
|> DatatypeInterpretation.data (map fst dt_infos); |
5177 | 398 |
in |
18008 | 399 |
({distinct = distinct, |
5177 | 400 |
inject = inject, |
401 |
exhaustion = casedist_thms, |
|
402 |
rec_thms = rec_thms, |
|
403 |
case_thms = case_thms, |
|
404 |
split_thms = split_thms, |
|
405 |
induction = induct, |
|
18008 | 406 |
simps = simps}, thy12) |
5177 | 407 |
end; |
408 |
||
409 |
||
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
410 |
(*********************** declare existing type as datatype *********************) |
5177 | 411 |
|
27300
4cb3101d2bf7
DatatypeProp.make_distincts: only one half of each symmetric pair is constructed
haftmann
parents:
27277
diff
changeset
|
412 |
fun prove_rep_datatype alt_names new_type_names descr sorts induct inject half_distinct thy = |
5177 | 413 |
let |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
414 |
val ((_, [induct']), _) = |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
415 |
Variable.importT_thms [induct] (Variable.thm_context induct); |
5177 | 416 |
|
417 |
fun err t = error ("Ill-formed predicate in induction rule: " ^ |
|
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
418 |
Syntax.string_of_term_global thy t); |
5177 | 419 |
|
420 |
fun get_typ (t as _ $ Var (_, Type (tname, Ts))) = |
|
25888
48cc198b9ac5
Eliminated DatatypeAux.dest_TFree to avoid clashes
berghofe
parents:
25677
diff
changeset
|
421 |
((tname, map (fst o dest_TFree) Ts) handle TERM _ => err t) |
5177 | 422 |
| get_typ t = err t; |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
423 |
val dtnames = map get_typ (HOLogic.dest_conj (HOLogic.dest_Trueprop (Thm.concl_of induct'))); |
5177 | 424 |
|
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
425 |
val dt_info = get_datatypes thy; |
5177 | 426 |
|
27300
4cb3101d2bf7
DatatypeProp.make_distincts: only one half of each symmetric pair is constructed
haftmann
parents:
27277
diff
changeset
|
427 |
val distinct = (map o maps) (fn thm => [thm, thm RS not_sym]) half_distinct; |
21419 | 428 |
val (case_names_induct, case_names_exhausts) = |
429 |
(mk_case_names_induct descr, mk_case_names_exhausts descr (map #1 dtnames)); |
|
8437 | 430 |
|
6427 | 431 |
val _ = message ("Proofs for datatype(s) " ^ commas_quote new_type_names); |
5177 | 432 |
|
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
433 |
val (casedist_thms, thy2) = thy |> |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
434 |
DatatypeAbsProofs.prove_casedist_thms new_type_names [descr] sorts induct |
8437 | 435 |
case_names_exhausts; |
18314 | 436 |
val ((reccomb_names, rec_thms), thy3) = DatatypeAbsProofs.prove_primrec_thms |
20054 | 437 |
false new_type_names [descr] sorts dt_info inject distinct |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
438 |
(Simplifier.theory_context thy2 dist_ss) induct thy2; |
18314 | 439 |
val ((case_thms, case_names), thy4) = DatatypeAbsProofs.prove_case_thms false |
5177 | 440 |
new_type_names [descr] sorts reccomb_names rec_thms thy3; |
18314 | 441 |
val (split_thms, thy5) = DatatypeAbsProofs.prove_split_thms |
5177 | 442 |
new_type_names [descr] sorts inject distinct casedist_thms case_thms thy4; |
18314 | 443 |
val (nchotomys, thy6) = DatatypeAbsProofs.prove_nchotomys new_type_names |
5177 | 444 |
[descr] sorts casedist_thms thy5; |
18314 | 445 |
val (case_congs, thy7) = DatatypeAbsProofs.prove_case_congs new_type_names |
5177 | 446 |
[descr] sorts nchotomys case_thms thy6; |
18314 | 447 |
val (weak_case_congs, thy8) = DatatypeAbsProofs.prove_weak_case_congs new_type_names |
8601 | 448 |
[descr] sorts thy7; |
5177 | 449 |
|
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
450 |
val ((_, [induct']), thy10) = |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24626
diff
changeset
|
451 |
thy8 |
18377 | 452 |
|> store_thmss "inject" new_type_names inject |
453 |
||>> store_thmss "distinct" new_type_names distinct |
|
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24711
diff
changeset
|
454 |
||> Sign.add_path (space_implode "_" new_type_names) |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
455 |
||>> PureThy.add_thms [(("induct", induct), [case_names_induct])]; |
9149 | 456 |
|
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
457 |
val dt_infos = map (make_dt_info alt_names descr sorts induct' reccomb_names rec_thms) |
10121 | 458 |
((0 upto length descr - 1) ~~ descr ~~ case_names ~~ case_thms ~~ casedist_thms ~~ |
459 |
map FewConstrs distinct ~~ inject ~~ nchotomys ~~ case_congs ~~ weak_case_congs); |
|
5177 | 460 |
|
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24626
diff
changeset
|
461 |
val simps = flat (distinct @ inject @ case_thms) @ rec_thms; |
5177 | 462 |
|
19599 | 463 |
val thy11 = |
464 |
thy10 |
|
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
465 |
|> add_case_tr' case_names |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24626
diff
changeset
|
466 |
|> add_rules simps case_thms rec_thms inject distinct |
19599 | 467 |
weak_case_congs (Simplifier.attrib (op addcongs)) |
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
468 |
|> put_dt_infos dt_infos |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
469 |
|> add_cases_induct dt_infos induct' |
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24711
diff
changeset
|
470 |
|> Sign.parent_path |
19599 | 471 |
|> store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms) |
472 |
|> snd |
|
24711 | 473 |
|> DatatypeInterpretation.data (map fst dt_infos); |
5177 | 474 |
in |
18008 | 475 |
({distinct = distinct, |
5177 | 476 |
inject = inject, |
477 |
exhaustion = casedist_thms, |
|
478 |
rec_thms = rec_thms, |
|
479 |
case_thms = case_thms, |
|
480 |
split_thms = split_thms, |
|
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
481 |
induction = induct', |
18008 | 482 |
simps = simps}, thy11) |
5177 | 483 |
end; |
484 |
||
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
485 |
fun gen_rep_datatype prep_term after_qed alt_names raw_ts thy = |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
486 |
let |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
487 |
fun constr_of_term (Const (c, T)) = (c, T) |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
488 |
| constr_of_term t = |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
489 |
error ("Not a constant: " ^ Syntax.string_of_term_global thy t); |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
490 |
fun no_constr (c, T) = error ("Bad constructor: " |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
491 |
^ Sign.extern_const thy c ^ "::" |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
492 |
^ Syntax.string_of_typ_global thy T); |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
493 |
fun type_of_constr (cT as (_, T)) = |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
494 |
let |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
495 |
val frees = typ_tfrees T; |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
496 |
val (tyco, vs) = ((apsnd o map) (dest_TFree) o dest_Type o snd o strip_type) T |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
497 |
handle TYPE _ => no_constr cT |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
498 |
val _ = if has_duplicates (eq_fst (op =)) vs then no_constr cT else (); |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
499 |
val _ = if length frees <> length vs then no_constr cT else (); |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
500 |
in (tyco, (vs, cT)) end; |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
501 |
|
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
502 |
val raw_cs = AList.group (op =) (map (type_of_constr o constr_of_term o prep_term thy) raw_ts); |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
503 |
val _ = case map_filter (fn (tyco, _) => |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
504 |
if Symtab.defined (get_datatypes thy) tyco then SOME tyco else NONE) raw_cs |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
505 |
of [] => () |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
506 |
| tycos => error ("Type(s) " ^ commas (map quote tycos) |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
507 |
^ " already represented inductivly"); |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
508 |
val raw_vss = maps (map (map snd o fst) o snd) raw_cs; |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
509 |
val ms = case distinct (op =) (map length raw_vss) |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
510 |
of [n] => 0 upto n - 1 |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
511 |
| _ => error ("Different types in given constructors"); |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
512 |
fun inter_sort m = map (fn xs => nth xs m) raw_vss |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
513 |
|> Library.foldr1 (Sorts.inter_sort (Sign.classes_of thy)) |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
514 |
val sorts = map inter_sort ms; |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
515 |
val vs = Name.names Name.context Name.aT sorts; |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
516 |
|
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
517 |
fun norm_constr (raw_vs, (c, T)) = (c, map_atyps |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
518 |
(TFree o (the o AList.lookup (op =) (map fst raw_vs ~~ vs)) o fst o dest_TFree) T); |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
519 |
|
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
520 |
val cs = map (apsnd (map norm_constr)) raw_cs; |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
521 |
val dtyps_of_typ = map (dtyp_of_typ (map (rpair (map fst vs) o fst) cs)) |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
522 |
o fst o strip_type; |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
523 |
val new_type_names = map NameSpace.base (the_default (map fst cs) alt_names); |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
524 |
|
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
525 |
fun mk_spec (i, (tyco, constr)) = (i, (tyco, |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
526 |
map (DtTFree o fst) vs, |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
527 |
(map o apsnd) dtyps_of_typ constr)) |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
528 |
val descr = map_index mk_spec cs; |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
529 |
val injs = DatatypeProp.make_injs [descr] vs; |
27300
4cb3101d2bf7
DatatypeProp.make_distincts: only one half of each symmetric pair is constructed
haftmann
parents:
27277
diff
changeset
|
530 |
val half_distincts = map snd (DatatypeProp.make_distincts [descr] vs); |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
531 |
val ind = DatatypeProp.make_ind [descr] vs; |
27300
4cb3101d2bf7
DatatypeProp.make_distincts: only one half of each symmetric pair is constructed
haftmann
parents:
27277
diff
changeset
|
532 |
val rules = (map o map o map) Logic.close_form [[[ind]], injs, half_distincts]; |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
533 |
|
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
534 |
fun after_qed' raw_thms = |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
535 |
let |
27300
4cb3101d2bf7
DatatypeProp.make_distincts: only one half of each symmetric pair is constructed
haftmann
parents:
27277
diff
changeset
|
536 |
val [[[induct]], injs, half_distincts] = |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
537 |
unflat rules (map Drule.zero_var_indexes_list raw_thms); |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
538 |
(*FIXME somehow dubious*) |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
539 |
in |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
540 |
ProofContext.theory_result |
27300
4cb3101d2bf7
DatatypeProp.make_distincts: only one half of each symmetric pair is constructed
haftmann
parents:
27277
diff
changeset
|
541 |
(prove_rep_datatype alt_names new_type_names descr vs induct injs half_distincts) |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
542 |
#-> after_qed |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
543 |
end; |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
544 |
in |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
545 |
thy |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
546 |
|> ProofContext.init |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
547 |
|> Proof.theorem_i NONE after_qed' ((map o map) (rpair []) (flat rules)) |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
548 |
end; |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
549 |
|
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
550 |
val rep_datatype = gen_rep_datatype Sign.cert_term; |
27261
5b3101338f42
eliminated old Sign.read_term/Thm.read_cterm etc.;
wenzelm
parents:
27130
diff
changeset
|
551 |
val rep_datatype_cmd = gen_rep_datatype Syntax.read_term_global (K I); |
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
552 |
|
5177 | 553 |
|
11958 | 554 |
|
5177 | 555 |
(******************************** add datatype ********************************) |
556 |
||
14887 | 557 |
fun gen_add_datatype prep_typ err flat_names new_type_names dts thy = |
5177 | 558 |
let |
20820
58693343905f
removed obsolete Datatype_Universe.thy (cf. Datatype.thy);
wenzelm
parents:
20715
diff
changeset
|
559 |
val _ = Theory.requires thy "Datatype" "datatype definitions"; |
5177 | 560 |
|
561 |
(* this theory is used just for parsing *) |
|
562 |
||
563 |
val tmp_thy = thy |> |
|
5892 | 564 |
Theory.copy |> |
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24711
diff
changeset
|
565 |
Sign.add_types (map (fn (tvs, tname, mx, _) => |
5177 | 566 |
(tname, length tvs, mx)) dts); |
567 |
||
5661 | 568 |
val (tyvars, _, _, _)::_ = dts; |
5177 | 569 |
val (new_dts, types_syntax) = ListPair.unzip (map (fn (tvs, tname, mx, _) => |
20597 | 570 |
let val full_tname = Sign.full_name tmp_thy (Syntax.type_name tname mx) |
18964 | 571 |
in (case duplicates (op =) tvs of |
5661 | 572 |
[] => if eq_set (tyvars, tvs) then ((full_tname, tvs), (tname, mx)) |
573 |
else error ("Mutually recursive datatypes must have same type parameters") |
|
5177 | 574 |
| dups => error ("Duplicate parameter(s) for datatype " ^ full_tname ^ |
575 |
" : " ^ commas dups)) |
|
576 |
end) dts); |
|
577 |
||
18964 | 578 |
val _ = (case duplicates (op =) (map fst new_dts) @ duplicates (op =) new_type_names of |
5177 | 579 |
[] => () | dups => error ("Duplicate datatypes: " ^ commas dups)); |
580 |
||
21045 | 581 |
fun prep_dt_spec (tvs, tname, mx, constrs) (dts', constr_syntax, sorts, i) = |
5177 | 582 |
let |
21045 | 583 |
fun prep_constr (cname, cargs, mx') (constrs, constr_syntax', sorts') = |
5279 | 584 |
let |
20597 | 585 |
val (cargs', sorts'') = Library.foldl (prep_typ tmp_thy) (([], sorts'), cargs); |
21045 | 586 |
val _ = (case fold (curry add_typ_tfree_names) cargs' [] \\ tvs of |
5279 | 587 |
[] => () |
588 |
| vs => error ("Extra type variables on rhs: " ^ commas vs)) |
|
20597 | 589 |
in (constrs @ [((if flat_names then Sign.full_name tmp_thy else |
590 |
Sign.full_name_path tmp_thy tname) (Syntax.const_name cname mx'), |
|
5177 | 591 |
map (dtyp_of_typ new_dts) cargs')], |
592 |
constr_syntax' @ [(cname, mx')], sorts'') |
|
18678 | 593 |
end handle ERROR msg => |
594 |
cat_error msg ("The error above occured in constructor " ^ cname ^ |
|
5177 | 595 |
" of datatype " ^ tname); |
596 |
||
597 |
val (constrs', constr_syntax', sorts') = |
|
21045 | 598 |
fold prep_constr constrs ([], [], sorts) |
5177 | 599 |
|
8405 | 600 |
in |
18964 | 601 |
case duplicates (op =) (map fst constrs') of |
5177 | 602 |
[] => |
20597 | 603 |
(dts' @ [(i, (Sign.full_name tmp_thy (Syntax.type_name tname mx), |
5177 | 604 |
map DtTFree tvs, constrs'))], |
605 |
constr_syntax @ [constr_syntax'], sorts', i + 1) |
|
606 |
| dups => error ("Duplicate constructors " ^ commas dups ^ |
|
607 |
" in datatype " ^ tname) |
|
608 |
end; |
|
609 |
||
21045 | 610 |
val (dts', constr_syntax, sorts', i) = fold prep_dt_spec dts ([], [], [], 0); |
20597 | 611 |
val sorts = sorts' @ (map (rpair (Sign.defaultS tmp_thy)) (tyvars \\ map fst sorts')); |
5177 | 612 |
val dt_info = get_datatypes thy; |
20597 | 613 |
val (descr, _) = unfold_datatypes tmp_thy dts' sorts dt_info dts' i; |
14887 | 614 |
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
|
615 |
if err then error ("Nonemptiness check failed for datatype " ^ s) |
14887 | 616 |
else raise exn; |
5177 | 617 |
|
21045 | 618 |
val descr' = flat descr; |
8437 | 619 |
val case_names_induct = mk_case_names_induct descr'; |
620 |
val case_names_exhausts = mk_case_names_exhausts descr' (map #1 new_dts); |
|
5177 | 621 |
in |
26533
aeef55a3d1d5
Deleted code for axiomatic introduction of datatypes. Instead, the package
berghofe
parents:
26496
diff
changeset
|
622 |
add_datatype_def |
8437 | 623 |
flat_names new_type_names descr sorts types_syntax constr_syntax dt_info |
624 |
case_names_induct case_names_exhausts thy |
|
5177 | 625 |
end; |
626 |
||
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
627 |
val add_datatype = gen_add_datatype cert_typ; |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
628 |
val add_datatype_cmd = gen_add_datatype read_typ true; |
5177 | 629 |
|
6360 | 630 |
|
26111 | 631 |
(** a datatype antiquotation **) |
632 |
||
633 |
local |
|
634 |
||
635 |
val sym_datatype = Pretty.str "\\isacommand{datatype}"; |
|
636 |
val sym_binder = Pretty.str "{\\isacharequal}"; |
|
637 |
val sym_of = Pretty.str "of"; |
|
638 |
val sym_sep = Pretty.str "{\\isacharbar}"; |
|
639 |
||
640 |
in |
|
641 |
||
642 |
fun args_datatype (ctxt, args) = |
|
643 |
let |
|
644 |
val (tyco, (ctxt', args')) = Args.tyname (ctxt, args); |
|
645 |
val thy = Context.theory_of ctxt'; |
|
646 |
val spec = the_datatype_spec thy tyco; |
|
647 |
in ((tyco, spec), (ctxt', args')) end; |
|
648 |
||
649 |
fun pretty_datatype ctxt (dtco, (vs, cos)) = |
|
650 |
let |
|
651 |
val ty = Type (dtco, map TFree vs); |
|
652 |
fun pretty_typ_br ty = |
|
653 |
let |
|
654 |
val p = Syntax.pretty_typ ctxt ty; |
|
655 |
val s = explode (Pretty.str_of p); |
|
656 |
in if member (op =) s " " then Pretty.enclose "(" ")" [p] |
|
657 |
else p |
|
658 |
end; |
|
659 |
fun pretty_constr (co, []) = |
|
660 |
Syntax.pretty_term ctxt (Const (co, ty)) |
|
661 |
| pretty_constr (co, [ty']) = |
|
662 |
(Pretty.block o Pretty.breaks) |
|
663 |
[Syntax.pretty_term ctxt (Const (co, ty' --> ty)), |
|
664 |
sym_of, Syntax.pretty_typ ctxt ty'] |
|
665 |
| pretty_constr (co, tys) = |
|
666 |
(Pretty.block o Pretty.breaks) |
|
667 |
(Syntax.pretty_term ctxt (Const (co, tys ---> ty)) :: |
|
668 |
sym_of :: map pretty_typ_br tys); |
|
669 |
in (Pretty.block o Pretty.breaks) ( |
|
670 |
sym_datatype |
|
671 |
:: Syntax.pretty_typ ctxt ty |
|
672 |
:: sym_binder |
|
673 |
:: separate sym_sep (map pretty_constr cos) |
|
674 |
) end |
|
675 |
||
676 |
end; |
|
18451 | 677 |
|
6360 | 678 |
(** package setup **) |
679 |
||
680 |
(* setup theory *) |
|
681 |
||
18708 | 682 |
val setup = |
27002
215d64dc971e
moved distinctness_limit to datatype_rep_proofs.ML
haftmann
parents:
26939
diff
changeset
|
683 |
DatatypeRepProofs.distinctness_limit_setup #> |
24098
f1eb34ae33af
replaced dtK ref by datatype_distinctness_limit configuration option;
wenzelm
parents:
22994
diff
changeset
|
684 |
simproc_setup #> |
24626
85eceef2edc7
introduced generic concepts for theory interpretators
haftmann
parents:
24624
diff
changeset
|
685 |
trfun_setup #> |
24711 | 686 |
DatatypeInterpretation.init; |
6360 | 687 |
|
688 |
||
689 |
(* outer syntax *) |
|
690 |
||
17057 | 691 |
local structure P = OuterParse and K = OuterKeyword in |
6360 | 692 |
|
693 |
val datatype_decl = |
|
6723 | 694 |
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
|
695 |
(P.$$$ "=" |-- P.enum1 "|" (P.name -- Scan.repeat P.typ -- P.opt_mixfix)); |
6360 | 696 |
|
697 |
fun mk_datatype args = |
|
698 |
let |
|
15531 | 699 |
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
|
700 |
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
|
701 |
(vs, t, mx, map (fn ((x, y), z) => (x, y, z)) cons)) args; |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
702 |
in snd o add_datatype_cmd false names specs end; |
6360 | 703 |
|
24867 | 704 |
val _ = |
6723 | 705 |
OuterSyntax.command "datatype" "define inductive datatypes" K.thy_decl |
706 |
(P.and_list1 datatype_decl >> (Toplevel.theory o mk_datatype)); |
|
6360 | 707 |
|
24867 | 708 |
val _ = |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
709 |
OuterSyntax.command "rep_datatype" "represent existing types inductively" K.thy_goal |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
710 |
(Scan.option (P.$$$ "(" |-- Scan.repeat1 P.name --| P.$$$ ")") -- Scan.repeat1 P.term |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
711 |
>> (fn (alt_names, ts) => Toplevel.print |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
712 |
o Toplevel.theory_to_proof (rep_datatype_cmd alt_names ts))); |
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
713 |
|
26111 | 714 |
val _ = |
715 |
ThyOutput.add_commands [("datatype", |
|
716 |
ThyOutput.args args_datatype (ThyOutput.output pretty_datatype))]; |
|
717 |
||
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
718 |
end; |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
719 |
|
5177 | 720 |
end; |
721 |