author | wenzelm |
Mon, 12 Dec 2011 20:55:57 +0100 | |
changeset 45821 | c2f6c50e3d42 |
parent 45743 | 857b7fcb0365 |
child 45822 | 843dc212f69e |
permissions | -rw-r--r-- |
33968
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33338
diff
changeset
|
1 |
(* Title: HOL/Tools/Datatype/datatype_aux.ML |
11539 | 2 |
Author: Stefan Berghofer, TU Muenchen |
5177 | 3 |
|
33968
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33338
diff
changeset
|
4 |
Datatype package: auxiliary data structures and functions. |
5177 | 5 |
*) |
6 |
||
31737 | 7 |
signature DATATYPE_COMMON = |
8 |
sig |
|
32964 | 9 |
type config = {strict : bool, quiet : bool} |
31737 | 10 |
val default_config : config |
11 |
datatype dtyp = |
|
12 |
DtTFree of string |
|
32964 | 13 |
| DtType of string * dtyp list |
14 |
| DtRec of int |
|
15 |
type descr = (int * (string * dtyp list * (string * dtyp list) list)) list |
|
16 |
type info = |
|
17 |
{index : int, |
|
18 |
descr : descr, |
|
19 |
sorts : (string * sort) list, |
|
20 |
inject : thm list, |
|
21 |
distinct : thm list, |
|
22 |
induct : thm, |
|
23 |
inducts : thm list, |
|
24 |
exhaust : thm, |
|
25 |
nchotomy : thm, |
|
26 |
rec_names : string list, |
|
27 |
rec_rewrites : thm list, |
|
28 |
case_name : string, |
|
29 |
case_rewrites : thm list, |
|
30 |
case_cong : thm, |
|
31 |
weak_case_cong : thm, |
|
32 |
split : thm, |
|
33 |
split_asm: thm} |
|
31737 | 34 |
end |
35 |
||
5177 | 36 |
signature DATATYPE_AUX = |
37 |
sig |
|
31737 | 38 |
include DATATYPE_COMMON |
39 |
||
40 |
val message : config -> string -> unit |
|
45700 | 41 |
|
18728 | 42 |
val store_thmss_atts : string -> string list -> attribute list list -> thm list list |
18349 | 43 |
-> theory -> thm list list * theory |
18314 | 44 |
val store_thmss : string -> string list -> thm list list -> theory -> thm list list * theory |
18728 | 45 |
val store_thms_atts : string -> string list -> attribute list list -> thm list |
18314 | 46 |
-> theory -> thm list * theory |
47 |
val store_thms : string -> string list -> thm list -> theory -> thm list * theory |
|
5177 | 48 |
|
49 |
val split_conj_thm : thm -> thm list |
|
50 |
val mk_conj : term list -> term |
|
51 |
val mk_disj : term list -> term |
|
52 |
||
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
53 |
val app_bnds : term -> int -> term |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
54 |
|
45735 | 55 |
val ind_tac : thm -> string list -> int -> tactic |
5177 | 56 |
val exh_tac : (string -> thm) -> int -> tactic |
57 |
||
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6394
diff
changeset
|
58 |
exception Datatype |
14887 | 59 |
exception Datatype_Empty of string |
9740 | 60 |
val name_of_typ : typ -> string |
5177 | 61 |
val dtyp_of_typ : (string * string list) list -> typ -> dtyp |
62 |
val mk_Free : string -> typ -> int -> term |
|
63 |
val is_rec_type : dtyp -> bool |
|
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
64 |
val typ_of_dtyp : descr -> (string * sort) list -> dtyp -> typ |
5177 | 65 |
val dest_DtTFree : dtyp -> string |
66 |
val dest_DtRec : dtyp -> int |
|
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
67 |
val strip_dtyp : dtyp -> dtyp list * dtyp |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
68 |
val body_index : dtyp -> int |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
69 |
val mk_fun_dtyp : dtyp list -> dtyp -> dtyp |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
70 |
val get_nonrec_types : descr -> (string * sort) list -> typ list |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
71 |
val get_branching_types : descr -> (string * sort) list -> typ list |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
72 |
val get_arities : descr -> int list |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
73 |
val get_rec_types : descr -> (string * sort) list -> typ list |
31605 | 74 |
val interpret_construction : descr -> (string * sort) list |
75 |
-> { atyp: typ -> 'a, dtyp: typ list -> int * bool -> string * typ list -> 'a } |
|
33243 | 76 |
-> ((string * typ list) * (string * 'a list) list) list |
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
77 |
val check_nonempty : descr list -> unit |
45700 | 78 |
val unfold_datatypes : |
45742 | 79 |
Proof.context -> descr -> (string * sort) list -> info Symtab.table -> |
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
80 |
descr -> int -> descr list * int |
33968
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33338
diff
changeset
|
81 |
val find_shortest_path : descr -> int -> (string * int) option |
5177 | 82 |
end; |
83 |
||
33968
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33338
diff
changeset
|
84 |
structure Datatype_Aux : DATATYPE_AUX = |
5177 | 85 |
struct |
86 |
||
31668
a616e56a5ec8
datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents:
31605
diff
changeset
|
87 |
(* datatype option flags *) |
a616e56a5ec8
datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents:
31605
diff
changeset
|
88 |
|
32964 | 89 |
type config = {strict : bool, quiet : bool}; |
90 |
val default_config : config = {strict = true, quiet = false}; |
|
91 |
||
92 |
fun message ({quiet = true, ...} : config) s = writeln s |
|
93 |
| message _ _ = (); |
|
5661 | 94 |
|
8435 | 95 |
|
5177 | 96 |
(* store theorems in theory *) |
97 |
||
18377 | 98 |
fun store_thmss_atts label tnames attss thmss = |
99 |
fold_map (fn ((tname, atts), thms) => |
|
40929
7ff03a5e044f
theorem names generated by the (rep_)datatype command now have mandatory qualifiers
huffman
parents:
40722
diff
changeset
|
100 |
Global_Theory.add_thmss |
7ff03a5e044f
theorem names generated by the (rep_)datatype command now have mandatory qualifiers
huffman
parents:
40722
diff
changeset
|
101 |
[((Binding.qualify true tname (Binding.name label), thms), atts)] |
7ff03a5e044f
theorem names generated by the (rep_)datatype command now have mandatory qualifiers
huffman
parents:
40722
diff
changeset
|
102 |
#-> (fn thm::_ => pair thm)) (tnames ~~ attss ~~ thmss) |
28361
232fcbba2e4e
explicit checkpoint for low-level (global) theory operations, admits concurrent proofs;
wenzelm
parents:
26939
diff
changeset
|
103 |
##> Theory.checkpoint; |
5177 | 104 |
|
18101 | 105 |
fun store_thmss label tnames = store_thmss_atts label tnames (replicate (length tnames) []); |
106 |
||
18377 | 107 |
fun store_thms_atts label tnames attss thmss = |
108 |
fold_map (fn ((tname, atts), thms) => |
|
40929
7ff03a5e044f
theorem names generated by the (rep_)datatype command now have mandatory qualifiers
huffman
parents:
40722
diff
changeset
|
109 |
Global_Theory.add_thms |
7ff03a5e044f
theorem names generated by the (rep_)datatype command now have mandatory qualifiers
huffman
parents:
40722
diff
changeset
|
110 |
[((Binding.qualify true tname (Binding.name label), thms), atts)] |
7ff03a5e044f
theorem names generated by the (rep_)datatype command now have mandatory qualifiers
huffman
parents:
40722
diff
changeset
|
111 |
#-> (fn thm::_ => pair thm)) (tnames ~~ attss ~~ thmss) |
28361
232fcbba2e4e
explicit checkpoint for low-level (global) theory operations, admits concurrent proofs;
wenzelm
parents:
26939
diff
changeset
|
112 |
##> Theory.checkpoint; |
8435 | 113 |
|
114 |
fun store_thms label tnames = store_thms_atts label tnames (replicate (length tnames) []); |
|
115 |
||
5177 | 116 |
|
117 |
(* split theorem thm_1 & ... & thm_n into n theorems *) |
|
118 |
||
119 |
fun split_conj_thm th = |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6394
diff
changeset
|
120 |
((th RS conjunct1)::(split_conj_thm (th RS conjunct2))) handle THM _ => [th]; |
5177 | 121 |
|
38795
848be46708dc
formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents:
36692
diff
changeset
|
122 |
val mk_conj = foldr1 (HOLogic.mk_binop @{const_name HOL.conj}); |
848be46708dc
formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents:
36692
diff
changeset
|
123 |
val mk_disj = foldr1 (HOLogic.mk_binop @{const_name HOL.disj}); |
5177 | 124 |
|
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
125 |
fun app_bnds t i = list_comb (t, map Bound (i - 1 downto 0)); |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
126 |
|
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
127 |
|
5177 | 128 |
(* instantiate induction rule *) |
129 |
||
45735 | 130 |
fun ind_tac indrule indnames = CSUBGOAL (fn (cgoal, i) => |
5177 | 131 |
let |
42368
3b8498ac2314
proper subgoal addressing via SUBGOAL/CSUBGOAL -- assuming these tactics did not handle Subscript in any special way;
wenzelm
parents:
42364
diff
changeset
|
132 |
val cert = cterm_of (Thm.theory_of_cterm cgoal); |
3b8498ac2314
proper subgoal addressing via SUBGOAL/CSUBGOAL -- assuming these tactics did not handle Subscript in any special way;
wenzelm
parents:
42364
diff
changeset
|
133 |
val goal = term_of cgoal; |
8305 | 134 |
val ts = HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of indrule)); |
42368
3b8498ac2314
proper subgoal addressing via SUBGOAL/CSUBGOAL -- assuming these tactics did not handle Subscript in any special way;
wenzelm
parents:
42364
diff
changeset
|
135 |
val ts' = HOLogic.dest_conj (HOLogic.dest_Trueprop (Logic.strip_imp_concl goal)); |
3b8498ac2314
proper subgoal addressing via SUBGOAL/CSUBGOAL -- assuming these tactics did not handle Subscript in any special way;
wenzelm
parents:
42364
diff
changeset
|
136 |
val getP = |
3b8498ac2314
proper subgoal addressing via SUBGOAL/CSUBGOAL -- assuming these tactics did not handle Subscript in any special way;
wenzelm
parents:
42364
diff
changeset
|
137 |
if can HOLogic.dest_imp (hd ts) |
3b8498ac2314
proper subgoal addressing via SUBGOAL/CSUBGOAL -- assuming these tactics did not handle Subscript in any special way;
wenzelm
parents:
42364
diff
changeset
|
138 |
then apfst SOME o HOLogic.dest_imp |
3b8498ac2314
proper subgoal addressing via SUBGOAL/CSUBGOAL -- assuming these tactics did not handle Subscript in any special way;
wenzelm
parents:
42364
diff
changeset
|
139 |
else pair NONE; |
3b8498ac2314
proper subgoal addressing via SUBGOAL/CSUBGOAL -- assuming these tactics did not handle Subscript in any special way;
wenzelm
parents:
42364
diff
changeset
|
140 |
val flt = |
3b8498ac2314
proper subgoal addressing via SUBGOAL/CSUBGOAL -- assuming these tactics did not handle Subscript in any special way;
wenzelm
parents:
42364
diff
changeset
|
141 |
if null indnames then I |
45738 | 142 |
else filter (member (op =) indnames o fst); |
42368
3b8498ac2314
proper subgoal addressing via SUBGOAL/CSUBGOAL -- assuming these tactics did not handle Subscript in any special way;
wenzelm
parents:
42364
diff
changeset
|
143 |
fun abstr (t1, t2) = |
3b8498ac2314
proper subgoal addressing via SUBGOAL/CSUBGOAL -- assuming these tactics did not handle Subscript in any special way;
wenzelm
parents:
42364
diff
changeset
|
144 |
(case t1 of |
3b8498ac2314
proper subgoal addressing via SUBGOAL/CSUBGOAL -- assuming these tactics did not handle Subscript in any special way;
wenzelm
parents:
42364
diff
changeset
|
145 |
NONE => |
45738 | 146 |
(case flt (Term.add_frees t2 []) of |
147 |
[(s, T)] => SOME (absfree (s, T) t2) |
|
25676
f3815084e89e
- Removed redundant head_len field in datatype_info
berghofe
parents:
24712
diff
changeset
|
148 |
| _ => NONE) |
45700 | 149 |
| SOME (_ $ t') => SOME (Abs ("x", fastype_of t', abstract_over (t', t2)))); |
150 |
val insts = |
|
151 |
map_filter (fn (t, u) => |
|
152 |
(case abstr (getP u) of |
|
153 |
NONE => NONE |
|
154 |
| SOME u' => SOME (t |> getP |> snd |> head_of |> cert, cert u'))) (ts ~~ ts'); |
|
155 |
val indrule' = cterm_instantiate insts indrule; |
|
42368
3b8498ac2314
proper subgoal addressing via SUBGOAL/CSUBGOAL -- assuming these tactics did not handle Subscript in any special way;
wenzelm
parents:
42364
diff
changeset
|
156 |
in rtac indrule' i end); |
3b8498ac2314
proper subgoal addressing via SUBGOAL/CSUBGOAL -- assuming these tactics did not handle Subscript in any special way;
wenzelm
parents:
42364
diff
changeset
|
157 |
|
5177 | 158 |
|
159 |
(* perform exhaustive case analysis on last parameter of subgoal i *) |
|
160 |
||
42368
3b8498ac2314
proper subgoal addressing via SUBGOAL/CSUBGOAL -- assuming these tactics did not handle Subscript in any special way;
wenzelm
parents:
42364
diff
changeset
|
161 |
fun exh_tac exh_thm_of = CSUBGOAL (fn (cgoal, i) => |
5177 | 162 |
let |
42368
3b8498ac2314
proper subgoal addressing via SUBGOAL/CSUBGOAL -- assuming these tactics did not handle Subscript in any special way;
wenzelm
parents:
42364
diff
changeset
|
163 |
val thy = Thm.theory_of_cterm cgoal; |
3b8498ac2314
proper subgoal addressing via SUBGOAL/CSUBGOAL -- assuming these tactics did not handle Subscript in any special way;
wenzelm
parents:
42364
diff
changeset
|
164 |
val goal = term_of cgoal; |
3b8498ac2314
proper subgoal addressing via SUBGOAL/CSUBGOAL -- assuming these tactics did not handle Subscript in any special way;
wenzelm
parents:
42364
diff
changeset
|
165 |
val params = Logic.strip_params goal; |
5177 | 166 |
val (_, Type (tname, _)) = hd (rev params); |
42368
3b8498ac2314
proper subgoal addressing via SUBGOAL/CSUBGOAL -- assuming these tactics did not handle Subscript in any special way;
wenzelm
parents:
42364
diff
changeset
|
167 |
val exhaustion = Thm.lift_rule cgoal (exh_thm_of tname); |
5177 | 168 |
val prem' = hd (prems_of exhaustion); |
169 |
val _ $ (_ $ lhs $ _) = hd (rev (Logic.strip_assums_hyp prem')); |
|
42368
3b8498ac2314
proper subgoal addressing via SUBGOAL/CSUBGOAL -- assuming these tactics did not handle Subscript in any special way;
wenzelm
parents:
42364
diff
changeset
|
170 |
val exhaustion' = |
3b8498ac2314
proper subgoal addressing via SUBGOAL/CSUBGOAL -- assuming these tactics did not handle Subscript in any special way;
wenzelm
parents:
42364
diff
changeset
|
171 |
cterm_instantiate [(cterm_of thy (head_of lhs), |
45700 | 172 |
cterm_of thy (fold_rev (fn (_, T) => fn t => Abs ("z", T, t)) params (Bound 0)))] exhaustion; |
42368
3b8498ac2314
proper subgoal addressing via SUBGOAL/CSUBGOAL -- assuming these tactics did not handle Subscript in any special way;
wenzelm
parents:
42364
diff
changeset
|
173 |
in compose_tac (false, exhaustion', nprems_of exhaustion) i end); |
5177 | 174 |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6394
diff
changeset
|
175 |
|
5177 | 176 |
(********************** Internal description of datatypes *********************) |
177 |
||
178 |
datatype dtyp = |
|
179 |
DtTFree of string |
|
45821 | 180 |
| DtType of string * dtyp list |
5177 | 181 |
| DtRec of int; |
182 |
||
183 |
(* information about datatypes *) |
|
184 |
||
16901 | 185 |
(* index, datatype name, type arguments, constructor name, types of constructor's arguments *) |
8404 | 186 |
type descr = (int * (string * dtyp list * (string * dtyp list) list)) list; |
187 |
||
31737 | 188 |
type info = |
5177 | 189 |
{index : int, |
8404 | 190 |
descr : descr, |
18319
c52b139ebde0
Added new component "sorts" to record datatype_info.
berghofe
parents:
18314
diff
changeset
|
191 |
sorts : (string * sort) list, |
32718 | 192 |
inject : thm list, |
32900 | 193 |
distinct : thm list, |
32727 | 194 |
induct : thm, |
195 |
inducts : thm list, |
|
32718 | 196 |
exhaust : thm, |
197 |
nchotomy : thm, |
|
5177 | 198 |
rec_names : string list, |
199 |
rec_rewrites : thm list, |
|
200 |
case_name : string, |
|
201 |
case_rewrites : thm list, |
|
10120 | 202 |
case_cong : thm, |
32718 | 203 |
weak_case_cong : thm, |
32727 | 204 |
split : thm, |
205 |
split_asm: thm}; |
|
5177 | 206 |
|
45700 | 207 |
fun mk_Free s T i = Free (s ^ string_of_int i, T); |
5177 | 208 |
|
45700 | 209 |
fun subst_DtTFree _ substs (T as DtTFree name) = the_default T (AList.lookup (op =) substs name) |
210 |
| subst_DtTFree i substs (DtType (name, ts)) = DtType (name, map (subst_DtTFree i substs) ts) |
|
5177 | 211 |
| subst_DtTFree i _ (DtRec j) = DtRec (i + j); |
212 |
||
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6394
diff
changeset
|
213 |
exception Datatype; |
14887 | 214 |
exception Datatype_Empty of string; |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6394
diff
changeset
|
215 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6394
diff
changeset
|
216 |
fun dest_DtTFree (DtTFree a) = a |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6394
diff
changeset
|
217 |
| dest_DtTFree _ = raise Datatype; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6394
diff
changeset
|
218 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6394
diff
changeset
|
219 |
fun dest_DtRec (DtRec i) = i |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6394
diff
changeset
|
220 |
| dest_DtRec _ = raise Datatype; |
5177 | 221 |
|
222 |
fun is_rec_type (DtType (_, dts)) = exists is_rec_type dts |
|
223 |
| is_rec_type (DtRec _) = true |
|
224 |
| is_rec_type _ = false; |
|
225 |
||
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
226 |
fun strip_dtyp (DtType ("fun", [T, U])) = apfst (cons T) (strip_dtyp U) |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
227 |
| strip_dtyp T = ([], T); |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
228 |
|
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
229 |
val body_index = dest_DtRec o snd o strip_dtyp; |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
230 |
|
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
231 |
fun mk_fun_dtyp [] U = U |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
232 |
| mk_fun_dtyp (T :: Ts) U = DtType ("fun", [T, mk_fun_dtyp Ts U]); |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
233 |
|
13707
55670a70a5f9
name_of_type now replaces non-identifiers by dummy names.
berghofe
parents:
13641
diff
changeset
|
234 |
fun name_of_typ (Type (s, Ts)) = |
45700 | 235 |
let val s' = Long_Name.base_name s in |
236 |
space_implode "_" |
|
237 |
(filter_out (equal "") (map name_of_typ Ts) @ |
|
238 |
[if Lexicon.is_identifier s' then s' else "x"]) |
|
13707
55670a70a5f9
name_of_type now replaces non-identifiers by dummy names.
berghofe
parents:
13641
diff
changeset
|
239 |
end |
9740 | 240 |
| name_of_typ _ = ""; |
241 |
||
5177 | 242 |
fun dtyp_of_typ _ (TFree (n, _)) = DtTFree n |
243 |
| dtyp_of_typ _ (TVar _) = error "Illegal schematic type variable(s)" |
|
244 |
| dtyp_of_typ new_dts (Type (tname, Ts)) = |
|
17485 | 245 |
(case AList.lookup (op =) new_dts tname of |
45700 | 246 |
NONE => DtType (tname, map (dtyp_of_typ new_dts) Ts) |
247 |
| SOME vs => |
|
248 |
if map (try (fst o dest_TFree)) Ts = map SOME vs then |
|
249 |
DtRec (find_index (curry op = tname o fst) new_dts) |
|
250 |
else error ("Illegal occurrence of recursive type " ^ tname)); |
|
5177 | 251 |
|
17485 | 252 |
fun typ_of_dtyp descr sorts (DtTFree a) = TFree (a, (the o AList.lookup (op =) sorts) a) |
5177 | 253 |
| typ_of_dtyp descr sorts (DtRec i) = |
45700 | 254 |
let val (s, ds, _) = the (AList.lookup (op =) descr i) |
5177 | 255 |
in Type (s, map (typ_of_dtyp descr sorts) ds) end |
45700 | 256 |
| typ_of_dtyp descr sorts (DtType (s, ds)) = Type (s, map (typ_of_dtyp descr sorts) ds); |
5177 | 257 |
|
258 |
(* find all non-recursive types in datatype description *) |
|
259 |
||
260 |
fun get_nonrec_types descr sorts = |
|
33244 | 261 |
map (typ_of_dtyp descr sorts) (fold (fn (_, (_, _, constrs)) => |
262 |
fold (fn (_, cargs) => union (op =) (filter_out is_rec_type cargs)) constrs) descr []); |
|
5177 | 263 |
|
264 |
(* get all recursive types in datatype description *) |
|
265 |
||
266 |
fun get_rec_types descr sorts = map (fn (_ , (s, ds, _)) => |
|
267 |
Type (s, map (typ_of_dtyp descr sorts) ds)) descr; |
|
268 |
||
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6394
diff
changeset
|
269 |
(* get all branching types *) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6394
diff
changeset
|
270 |
|
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
271 |
fun get_branching_types descr sorts = |
45700 | 272 |
map (typ_of_dtyp descr sorts) |
273 |
(fold |
|
274 |
(fn (_, (_, _, constrs)) => |
|
275 |
fold (fn (_, cargs) => fold (strip_dtyp #> fst #> fold (insert op =)) cargs) constrs) |
|
276 |
descr []); |
|
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
277 |
|
45700 | 278 |
fun get_arities descr = |
279 |
fold |
|
280 |
(fn (_, (_, _, constrs)) => |
|
281 |
fold (fn (_, cargs) => |
|
282 |
fold (insert op =) (map (length o fst o strip_dtyp) (filter is_rec_type cargs))) constrs) |
|
283 |
descr []; |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6394
diff
changeset
|
284 |
|
31605 | 285 |
(* interpret construction of datatype *) |
286 |
||
45700 | 287 |
fun interpret_construction descr vs {atyp, dtyp} = |
31605 | 288 |
let |
289 |
val typ_of_dtyp = typ_of_dtyp descr vs; |
|
45700 | 290 |
fun interpT dT = |
291 |
(case strip_dtyp dT of |
|
292 |
(dTs, DtRec l) => |
|
31605 | 293 |
let |
45700 | 294 |
val (tyco, dTs', _) = the (AList.lookup (op =) descr l); |
31605 | 295 |
val Ts = map typ_of_dtyp dTs; |
296 |
val Ts' = map typ_of_dtyp dTs'; |
|
297 |
val is_proper = forall (can dest_TFree) Ts'; |
|
298 |
in dtyp Ts (l, is_proper) (tyco, Ts') end |
|
45700 | 299 |
| _ => atyp (typ_of_dtyp dT)); |
31605 | 300 |
fun interpC (c, dTs) = (c, map interpT dTs); |
301 |
fun interpD (_, (tyco, dTs, cs)) = ((tyco, map typ_of_dtyp dTs), map interpC cs); |
|
302 |
in map interpD descr end; |
|
303 |
||
5177 | 304 |
(* nonemptiness check for datatypes *) |
305 |
||
306 |
fun check_nonempty descr = |
|
307 |
let |
|
32952 | 308 |
val descr' = flat descr; |
5177 | 309 |
fun is_nonempty_dt is i = |
310 |
let |
|
45700 | 311 |
val (_, _, constrs) = the (AList.lookup (op =) descr' i); |
312 |
fun arg_nonempty (_, DtRec i) = |
|
313 |
if member (op =) is i then false |
|
314 |
else is_nonempty_dt (i :: is) i |
|
5177 | 315 |
| arg_nonempty _ = true; |
45700 | 316 |
in exists (forall (arg_nonempty o strip_dtyp) o snd) constrs end |
317 |
in |
|
318 |
assert_all (fn (i, _) => is_nonempty_dt [i] i) (hd descr) |
|
319 |
(fn (_, (s, _, _)) => raise Datatype_Empty s) |
|
5177 | 320 |
end; |
321 |
||
322 |
(* unfold a list of mutually recursive datatype specifications *) |
|
323 |
(* all types of the form DtType (dt_name, [..., DtRec _, ...]) *) |
|
324 |
(* need to be unfolded *) |
|
325 |
||
45742 | 326 |
fun unfold_datatypes ctxt orig_descr sorts (dt_info : info Symtab.table) descr i = |
5177 | 327 |
let |
45700 | 328 |
fun typ_error T msg = |
329 |
error ("Non-admissible type expression\n" ^ |
|
45742 | 330 |
Syntax.string_of_typ ctxt (typ_of_dtyp (orig_descr @ descr) sorts T) ^ "\n" ^ msg); |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6394
diff
changeset
|
331 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6394
diff
changeset
|
332 |
fun get_dt_descr T i tname dts = |
17412 | 333 |
(case Symtab.lookup dt_info tname of |
45700 | 334 |
NONE => |
335 |
typ_error T (tname ^ " is not a datatype - can't use it in nested recursion") |
|
336 |
| SOME {index, descr, ...} => |
|
337 |
let |
|
338 |
val (_, vars, _) = the (AList.lookup (op =) descr index); |
|
45743 | 339 |
val subst = map dest_DtTFree vars ~~ dts |
45700 | 340 |
handle ListPair.UnequalLengths => |
341 |
typ_error T ("Type constructor " ^ tname ^ " used with wrong number of arguments"); |
|
342 |
in |
|
343 |
(i + index, |
|
344 |
map (fn (j, (tn, args, cs)) => |
|
345 |
(i + j, (tn, map (subst_DtTFree i subst) args, |
|
346 |
map (apsnd (map (subst_DtTFree i subst))) cs))) descr) |
|
347 |
end); |
|
5177 | 348 |
|
349 |
(* unfold a single constructor argument *) |
|
350 |
||
33244 | 351 |
fun unfold_arg T (i, Ts, descrs) = |
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
352 |
if is_rec_type T then |
45700 | 353 |
let val (Us, U) = strip_dtyp T in |
354 |
if exists is_rec_type Us then |
|
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
355 |
typ_error T "Non-strictly positive recursive occurrence of type" |
45700 | 356 |
else |
357 |
(case U of |
|
358 |
DtType (tname, dts) => |
|
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
359 |
let |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
360 |
val (index, descr) = get_dt_descr T i tname dts; |
45700 | 361 |
val (descr', i') = |
45742 | 362 |
unfold_datatypes ctxt orig_descr sorts dt_info descr (i + length descr); |
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
363 |
in (i', Ts @ [mk_fun_dtyp Us (DtRec index)], descrs @ descr') end |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
364 |
| _ => (i, Ts @ [T], descrs)) |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
365 |
end |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
11539
diff
changeset
|
366 |
else (i, Ts @ [T], descrs); |
5177 | 367 |
|
368 |
(* unfold a constructor *) |
|
369 |
||
33244 | 370 |
fun unfold_constr (cname, cargs) (i, constrs, descrs) = |
371 |
let val (i', cargs', descrs') = fold unfold_arg cargs (i, [], descrs) |
|
5177 | 372 |
in (i', constrs @ [(cname, cargs')], descrs') end; |
373 |
||
374 |
(* unfold a single datatype *) |
|
375 |
||
33244 | 376 |
fun unfold_datatype (j, (tname, tvars, constrs)) (i, dtypes, descrs) = |
377 |
let val (i', constrs', descrs') = fold unfold_constr constrs (i, [], descrs) |
|
378 |
in (i', dtypes @ [(j, (tname, tvars, constrs'))], descrs') end; |
|
5177 | 379 |
|
33244 | 380 |
val (i', descr', descrs) = fold unfold_datatype descr (i, [], []); |
5177 | 381 |
|
382 |
in (descr' :: descrs, i') end; |
|
383 |
||
33968
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33338
diff
changeset
|
384 |
(* find shortest path to constructor with no recursive arguments *) |
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33338
diff
changeset
|
385 |
|
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33338
diff
changeset
|
386 |
fun find_nonempty descr is i = |
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33338
diff
changeset
|
387 |
let |
45700 | 388 |
fun arg_nonempty (_, DtRec i) = |
389 |
if member (op =) is i |
|
33968
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33338
diff
changeset
|
390 |
then NONE |
45700 | 391 |
else Option.map (Integer.add 1 o snd) (find_nonempty descr (i :: is) i) |
33968
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33338
diff
changeset
|
392 |
| arg_nonempty _ = SOME 0; |
33971 | 393 |
fun max_inf (SOME i) (SOME j) = SOME (Integer.max i j) |
33970 | 394 |
| max_inf _ _ = NONE; |
395 |
fun max xs = fold max_inf xs (SOME 0); |
|
396 |
val (_, _, constrs) = the (AList.lookup (op =) descr i); |
|
45700 | 397 |
val xs = |
398 |
sort (int_ord o pairself snd) |
|
399 |
(map_filter (fn (s, dts) => Option.map (pair s) |
|
400 |
(max (map (arg_nonempty o strip_dtyp) dts))) constrs) |
|
33970 | 401 |
in if null xs then NONE else SOME (hd xs) end; |
33968
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33338
diff
changeset
|
402 |
|
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33338
diff
changeset
|
403 |
fun find_shortest_path descr i = find_nonempty descr [i] i; |
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33338
diff
changeset
|
404 |
|
5177 | 405 |
end; |