blanchet@33982
|
1 |
(* Title: HOL/Tools/Nitpick/nitpick_scope.ML
|
blanchet@33192
|
2 |
Author: Jasmin Blanchette, TU Muenchen
|
blanchet@34969
|
3 |
Copyright 2008, 2009, 2010
|
blanchet@33192
|
4 |
|
blanchet@33192
|
5 |
Scope enumerator for Nitpick.
|
blanchet@33192
|
6 |
*)
|
blanchet@33192
|
7 |
|
blanchet@33192
|
8 |
signature NITPICK_SCOPE =
|
blanchet@33192
|
9 |
sig
|
blanchet@33705
|
10 |
type styp = Nitpick_Util.styp
|
blanchet@35067
|
11 |
type hol_context = Nitpick_HOL.hol_context
|
blanchet@33192
|
12 |
|
blanchet@33192
|
13 |
type constr_spec = {
|
blanchet@33192
|
14 |
const: styp,
|
blanchet@33192
|
15 |
delta: int,
|
blanchet@33192
|
16 |
epsilon: int,
|
blanchet@33192
|
17 |
exclusive: bool,
|
blanchet@33192
|
18 |
explicit_max: int,
|
blanchet@33192
|
19 |
total: bool}
|
blanchet@33192
|
20 |
|
blanchet@33192
|
21 |
type dtype_spec = {
|
blanchet@33192
|
22 |
typ: typ,
|
blanchet@33192
|
23 |
card: int,
|
blanchet@33192
|
24 |
co: bool,
|
blanchet@35179
|
25 |
standard: bool,
|
blanchet@35385
|
26 |
complete: bool * bool,
|
blanchet@35385
|
27 |
concrete: bool * bool,
|
blanchet@34969
|
28 |
deep: bool,
|
blanchet@33192
|
29 |
constrs: constr_spec list}
|
blanchet@33192
|
30 |
|
blanchet@33192
|
31 |
type scope = {
|
blanchet@35067
|
32 |
hol_ctxt: hol_context,
|
blanchet@35190
|
33 |
binarize: bool,
|
blanchet@33192
|
34 |
card_assigns: (typ * int) list,
|
blanchet@34121
|
35 |
bits: int,
|
blanchet@33192
|
36 |
bisim_depth: int,
|
blanchet@33192
|
37 |
datatypes: dtype_spec list,
|
blanchet@33192
|
38 |
ofs: int Typtab.table}
|
blanchet@33192
|
39 |
|
blanchet@33192
|
40 |
val datatype_spec : dtype_spec list -> typ -> dtype_spec option
|
blanchet@33192
|
41 |
val constr_spec : dtype_spec list -> styp -> constr_spec
|
blanchet@35385
|
42 |
val is_complete_type : dtype_spec list -> bool -> typ -> bool
|
blanchet@35385
|
43 |
val is_concrete_type : dtype_spec list -> bool -> typ -> bool
|
blanchet@35385
|
44 |
val is_exact_type : dtype_spec list -> bool -> typ -> bool
|
blanchet@33192
|
45 |
val offset_of_type : int Typtab.table -> typ -> int
|
blanchet@33192
|
46 |
val spec_of_type : scope -> typ -> int * int
|
blanchet@33192
|
47 |
val pretties_for_scope : scope -> bool -> Pretty.T list
|
blanchet@33192
|
48 |
val multiline_string_for_scope : scope -> string
|
blanchet@35814
|
49 |
val scopes_equivalent : scope * scope -> bool
|
blanchet@33192
|
50 |
val scope_less_eq : scope -> scope -> bool
|
blanchet@33192
|
51 |
val all_scopes :
|
blanchet@36386
|
52 |
hol_context -> bool -> (typ option * int list) list
|
blanchet@33192
|
53 |
-> (styp option * int list) list -> (styp option * int list) list
|
blanchet@35385
|
54 |
-> int list -> int list -> typ list -> typ list -> typ list -> typ list
|
blanchet@34121
|
55 |
-> int * scope list
|
blanchet@33192
|
56 |
end;
|
blanchet@33192
|
57 |
|
blanchet@33224
|
58 |
structure Nitpick_Scope : NITPICK_SCOPE =
|
blanchet@33192
|
59 |
struct
|
blanchet@33192
|
60 |
|
blanchet@33224
|
61 |
open Nitpick_Util
|
blanchet@33224
|
62 |
open Nitpick_HOL
|
blanchet@33192
|
63 |
|
blanchet@33192
|
64 |
type constr_spec = {
|
blanchet@33192
|
65 |
const: styp,
|
blanchet@33192
|
66 |
delta: int,
|
blanchet@33192
|
67 |
epsilon: int,
|
blanchet@33192
|
68 |
exclusive: bool,
|
blanchet@33192
|
69 |
explicit_max: int,
|
blanchet@33192
|
70 |
total: bool}
|
blanchet@33192
|
71 |
|
blanchet@33192
|
72 |
type dtype_spec = {
|
blanchet@33192
|
73 |
typ: typ,
|
blanchet@33192
|
74 |
card: int,
|
blanchet@33192
|
75 |
co: bool,
|
blanchet@35179
|
76 |
standard: bool,
|
blanchet@35385
|
77 |
complete: bool * bool,
|
blanchet@35385
|
78 |
concrete: bool * bool,
|
blanchet@34969
|
79 |
deep: bool,
|
blanchet@33192
|
80 |
constrs: constr_spec list}
|
blanchet@33192
|
81 |
|
blanchet@33192
|
82 |
type scope = {
|
blanchet@35067
|
83 |
hol_ctxt: hol_context,
|
blanchet@35190
|
84 |
binarize: bool,
|
blanchet@33192
|
85 |
card_assigns: (typ * int) list,
|
blanchet@34121
|
86 |
bits: int,
|
blanchet@33192
|
87 |
bisim_depth: int,
|
blanchet@33192
|
88 |
datatypes: dtype_spec list,
|
blanchet@33192
|
89 |
ofs: int Typtab.table}
|
blanchet@33192
|
90 |
|
blanchet@33192
|
91 |
datatype row_kind = Card of typ | Max of styp
|
blanchet@33192
|
92 |
|
blanchet@33192
|
93 |
type row = row_kind * int list
|
blanchet@33192
|
94 |
type block = row list
|
blanchet@33192
|
95 |
|
blanchet@33192
|
96 |
fun datatype_spec (dtypes : dtype_spec list) T =
|
blanchet@34118
|
97 |
List.find (curry (op =) T o #typ) dtypes
|
blanchet@33192
|
98 |
|
blanchet@33224
|
99 |
fun constr_spec [] x = raise TERM ("Nitpick_Scope.constr_spec", [Const x])
|
blanchet@33192
|
100 |
| constr_spec ({constrs, ...} :: dtypes : dtype_spec list) (x as (s, T)) =
|
blanchet@34118
|
101 |
case List.find (curry (op =) (s, body_type T) o (apsnd body_type o #const))
|
blanchet@33192
|
102 |
constrs of
|
blanchet@33192
|
103 |
SOME c => c
|
blanchet@33192
|
104 |
| NONE => constr_spec dtypes x
|
blanchet@33192
|
105 |
|
blanchet@35665
|
106 |
fun is_complete_type dtypes facto (Type (@{type_name fun}, [T1, T2])) =
|
blanchet@35385
|
107 |
is_concrete_type dtypes facto T1 andalso is_complete_type dtypes facto T2
|
blanchet@35665
|
108 |
| is_complete_type dtypes facto (Type (@{type_name fin_fun}, [T1, T2])) =
|
blanchet@35665
|
109 |
is_exact_type dtypes facto T1 andalso is_complete_type dtypes facto T2
|
blanchet@35665
|
110 |
| is_complete_type dtypes facto (Type (@{type_name "*"}, Ts)) =
|
blanchet@35385
|
111 |
forall (is_complete_type dtypes facto) Ts
|
blanchet@35385
|
112 |
| is_complete_type dtypes facto T =
|
blanchet@35220
|
113 |
not (is_integer_like_type T) andalso not (is_bit_type T) andalso
|
blanchet@35385
|
114 |
fun_from_pair (#complete (the (datatype_spec dtypes T))) facto
|
blanchet@33192
|
115 |
handle Option.Option => true
|
blanchet@35665
|
116 |
and is_concrete_type dtypes facto (Type (@{type_name fun}, [T1, T2])) =
|
blanchet@35385
|
117 |
is_complete_type dtypes facto T1 andalso is_concrete_type dtypes facto T2
|
blanchet@35665
|
118 |
| is_concrete_type dtypes facto (Type (@{type_name fin_fun}, [_, T2])) =
|
blanchet@35665
|
119 |
is_concrete_type dtypes facto T2
|
blanchet@35665
|
120 |
| is_concrete_type dtypes facto (Type (@{type_name "*"}, Ts)) =
|
blanchet@35385
|
121 |
forall (is_concrete_type dtypes facto) Ts
|
blanchet@35385
|
122 |
| is_concrete_type dtypes facto T =
|
blanchet@35385
|
123 |
fun_from_pair (#concrete (the (datatype_spec dtypes T))) facto
|
blanchet@35385
|
124 |
handle Option.Option => true
|
blanchet@35665
|
125 |
and is_exact_type dtypes facto =
|
blanchet@35385
|
126 |
is_complete_type dtypes facto andf is_concrete_type dtypes facto
|
blanchet@33192
|
127 |
|
blanchet@33192
|
128 |
fun offset_of_type ofs T =
|
blanchet@33192
|
129 |
case Typtab.lookup ofs T of
|
blanchet@33192
|
130 |
SOME j0 => j0
|
blanchet@33192
|
131 |
| NONE => Typtab.lookup ofs dummyT |> the_default 0
|
blanchet@33192
|
132 |
|
blanchet@33192
|
133 |
fun spec_of_type ({card_assigns, ofs, ...} : scope) T =
|
blanchet@33192
|
134 |
(card_of_type card_assigns T
|
blanchet@33224
|
135 |
handle TYPE ("Nitpick_HOL.card_of_type", _, _) => ~1, offset_of_type ofs T)
|
blanchet@33192
|
136 |
|
blanchet@35220
|
137 |
fun quintuple_for_scope quote
|
blanchet@35280
|
138 |
({hol_ctxt = {thy, ctxt, stds, ...}, card_assigns, bits, bisim_depth,
|
blanchet@35220
|
139 |
datatypes, ...} : scope) =
|
blanchet@33192
|
140 |
let
|
blanchet@35072
|
141 |
val boring_Ts = [@{typ unsigned_bit}, @{typ signed_bit},
|
blanchet@34121
|
142 |
@{typ bisim_iterator}]
|
blanchet@34120
|
143 |
val (iter_assigns, card_assigns) =
|
blanchet@34121
|
144 |
card_assigns |> filter_out (member (op =) boring_Ts o fst)
|
blanchet@33192
|
145 |
|> List.partition (is_fp_iterator_type o fst)
|
blanchet@34121
|
146 |
val (secondary_card_assigns, primary_card_assigns) =
|
blanchet@35220
|
147 |
card_assigns |> List.partition ((is_integer_type orf is_datatype thy stds)
|
blanchet@34121
|
148 |
o fst)
|
blanchet@33192
|
149 |
val cards =
|
blanchet@33192
|
150 |
map (fn (T, k) => quote (string_for_type ctxt T) ^ " = " ^
|
blanchet@33192
|
151 |
string_of_int k)
|
blanchet@33192
|
152 |
fun maxes () =
|
blanchet@33192
|
153 |
maps (map_filter
|
blanchet@33192
|
154 |
(fn {const, explicit_max, ...} =>
|
blanchet@33192
|
155 |
if explicit_max < 0 then
|
blanchet@33192
|
156 |
NONE
|
blanchet@33192
|
157 |
else
|
blanchet@33192
|
158 |
SOME (Syntax.string_of_term ctxt (Const const) ^ " = " ^
|
blanchet@33192
|
159 |
string_of_int explicit_max))
|
blanchet@33192
|
160 |
o #constrs) datatypes
|
blanchet@33192
|
161 |
fun iters () =
|
blanchet@33192
|
162 |
map (fn (T, k) =>
|
blanchet@33192
|
163 |
quote (Syntax.string_of_term ctxt
|
blanchet@33192
|
164 |
(Const (const_for_iterator_type T))) ^ " = " ^
|
blanchet@34120
|
165 |
string_of_int (k - 1)) iter_assigns
|
blanchet@34121
|
166 |
fun miscs () =
|
blanchet@34121
|
167 |
(if bits = 0 then [] else ["bits = " ^ string_of_int bits]) @
|
blanchet@34121
|
168 |
(if bisim_depth < 0 andalso forall (not o #co) datatypes then []
|
blanchet@35178
|
169 |
else ["bisim_depth = " ^ signed_string_of_int bisim_depth])
|
blanchet@33192
|
170 |
in
|
blanchet@33192
|
171 |
setmp_show_all_types
|
blanchet@34121
|
172 |
(fn () => (cards primary_card_assigns, cards secondary_card_assigns,
|
blanchet@34121
|
173 |
maxes (), iters (), miscs ())) ()
|
blanchet@33192
|
174 |
end
|
blanchet@33192
|
175 |
|
blanchet@33192
|
176 |
fun pretties_for_scope scope verbose =
|
blanchet@33192
|
177 |
let
|
blanchet@34121
|
178 |
val (primary_cards, secondary_cards, maxes, iters, bisim_depths) =
|
blanchet@33192
|
179 |
quintuple_for_scope maybe_quote scope
|
blanchet@34121
|
180 |
val ss = map (prefix "card ") primary_cards @
|
blanchet@33192
|
181 |
(if verbose then
|
blanchet@34121
|
182 |
map (prefix "card ") secondary_cards @
|
blanchet@33192
|
183 |
map (prefix "max ") maxes @
|
blanchet@33192
|
184 |
map (prefix "iter ") iters @
|
blanchet@33192
|
185 |
bisim_depths
|
blanchet@33192
|
186 |
else
|
blanchet@33192
|
187 |
[])
|
blanchet@33192
|
188 |
in
|
blanchet@36380
|
189 |
if null ss then []
|
blanchet@36380
|
190 |
else serial_commas "and" ss |> map Pretty.str |> Pretty.breaks
|
blanchet@33192
|
191 |
end
|
blanchet@33192
|
192 |
|
blanchet@33192
|
193 |
fun multiline_string_for_scope scope =
|
blanchet@33192
|
194 |
let
|
blanchet@34121
|
195 |
val (primary_cards, secondary_cards, maxes, iters, bisim_depths) =
|
blanchet@33192
|
196 |
quintuple_for_scope I scope
|
blanchet@34121
|
197 |
val cards = primary_cards @ secondary_cards
|
blanchet@33192
|
198 |
in
|
blanchet@33192
|
199 |
case (if null cards then [] else ["card: " ^ commas cards]) @
|
blanchet@33192
|
200 |
(if null maxes then [] else ["max: " ^ commas maxes]) @
|
blanchet@33192
|
201 |
(if null iters then [] else ["iter: " ^ commas iters]) @
|
blanchet@33192
|
202 |
bisim_depths of
|
blanchet@33192
|
203 |
[] => "empty"
|
blanchet@33192
|
204 |
| lines => space_implode "\n" lines
|
blanchet@33192
|
205 |
end
|
blanchet@33192
|
206 |
|
blanchet@35814
|
207 |
fun scopes_equivalent (s1 : scope, s2 : scope) =
|
blanchet@33192
|
208 |
#datatypes s1 = #datatypes s2 andalso #card_assigns s1 = #card_assigns s2
|
blanchet@33192
|
209 |
fun scope_less_eq (s1 : scope) (s2 : scope) =
|
blanchet@33192
|
210 |
(s1, s2) |> pairself (map snd o #card_assigns) |> op ~~ |> forall (op <=)
|
blanchet@33192
|
211 |
|
blanchet@33192
|
212 |
fun rank_of_row (_, ks) = length ks
|
blanchet@33192
|
213 |
fun rank_of_block block = fold Integer.max (map rank_of_row block) 1
|
blanchet@33192
|
214 |
fun project_row column (y, ks) = (y, [nth ks (Int.min (column, length ks - 1))])
|
blanchet@33192
|
215 |
fun project_block (column, block) = map (project_row column) block
|
blanchet@33192
|
216 |
|
blanchet@34120
|
217 |
fun lookup_ints_assign eq assigns key =
|
blanchet@34120
|
218 |
case triple_lookup eq assigns key of
|
blanchet@33192
|
219 |
SOME ks => ks
|
blanchet@33224
|
220 |
| NONE => raise ARG ("Nitpick_Scope.lookup_ints_assign", "")
|
blanchet@34120
|
221 |
fun lookup_type_ints_assign thy assigns T =
|
blanchet@36384
|
222 |
map (Integer.max 1) (lookup_ints_assign (type_match thy) assigns T)
|
blanchet@33224
|
223 |
handle ARG ("Nitpick_Scope.lookup_ints_assign", _) =>
|
blanchet@33224
|
224 |
raise TYPE ("Nitpick_Scope.lookup_type_ints_assign", [T], [])
|
blanchet@34120
|
225 |
fun lookup_const_ints_assign thy assigns x =
|
blanchet@34120
|
226 |
lookup_ints_assign (const_match thy) assigns x
|
blanchet@33224
|
227 |
handle ARG ("Nitpick_Scope.lookup_ints_assign", _) =>
|
blanchet@33224
|
228 |
raise TERM ("Nitpick_Scope.lookup_const_ints_assign", [Const x])
|
blanchet@33192
|
229 |
|
blanchet@34120
|
230 |
fun row_for_constr thy maxes_assigns constr =
|
blanchet@34120
|
231 |
SOME (Max constr, lookup_const_ints_assign thy maxes_assigns constr)
|
blanchet@33192
|
232 |
handle TERM ("lookup_const_ints_assign", _) => NONE
|
blanchet@33192
|
233 |
|
blanchet@34121
|
234 |
val max_bits = 31 (* Kodkod limit *)
|
blanchet@34121
|
235 |
|
blanchet@35190
|
236 |
fun block_for_type (hol_ctxt as {thy, ...}) binarize cards_assigns maxes_assigns
|
blanchet@34121
|
237 |
iters_assigns bitss bisim_depths T =
|
blanchet@34121
|
238 |
if T = @{typ unsigned_bit} then
|
blanchet@34121
|
239 |
[(Card T, map (Integer.min max_bits o Integer.max 1) bitss)]
|
blanchet@34121
|
240 |
else if T = @{typ signed_bit} then
|
blanchet@34121
|
241 |
[(Card T, map (Integer.add 1 o Integer.min max_bits o Integer.max 1) bitss)]
|
blanchet@34123
|
242 |
else if T = @{typ "unsigned_bit word"} then
|
blanchet@34123
|
243 |
[(Card T, lookup_type_ints_assign thy cards_assigns nat_T)]
|
blanchet@34123
|
244 |
else if T = @{typ "signed_bit word"} then
|
blanchet@34123
|
245 |
[(Card T, lookup_type_ints_assign thy cards_assigns int_T)]
|
blanchet@34121
|
246 |
else if T = @{typ bisim_iterator} then
|
blanchet@34121
|
247 |
[(Card T, map (Integer.add 1 o Integer.max 0) bisim_depths)]
|
blanchet@33571
|
248 |
else if is_fp_iterator_type T then
|
blanchet@34121
|
249 |
[(Card T, map (Integer.add 1 o Integer.max 0)
|
blanchet@34120
|
250 |
(lookup_const_ints_assign thy iters_assigns
|
blanchet@33571
|
251 |
(const_for_iterator_type T)))]
|
blanchet@33571
|
252 |
else
|
blanchet@34120
|
253 |
(Card T, lookup_type_ints_assign thy cards_assigns T) ::
|
blanchet@35190
|
254 |
(case binarized_and_boxed_datatype_constrs hol_ctxt binarize T of
|
blanchet@33571
|
255 |
[_] => []
|
blanchet@34120
|
256 |
| constrs => map_filter (row_for_constr thy maxes_assigns) constrs)
|
blanchet@33192
|
257 |
|
blanchet@35190
|
258 |
fun blocks_for_types hol_ctxt binarize cards_assigns maxes_assigns iters_assigns
|
blanchet@35190
|
259 |
bitss bisim_depths mono_Ts nonmono_Ts =
|
blanchet@33192
|
260 |
let
|
blanchet@35190
|
261 |
val block_for = block_for_type hol_ctxt binarize cards_assigns maxes_assigns
|
blanchet@34121
|
262 |
iters_assigns bitss bisim_depths
|
blanchet@33192
|
263 |
val mono_block = maps block_for mono_Ts
|
blanchet@33192
|
264 |
val nonmono_blocks = map block_for nonmono_Ts
|
blanchet@33192
|
265 |
in mono_block :: nonmono_blocks end
|
blanchet@33192
|
266 |
|
blanchet@33192
|
267 |
val sync_threshold = 5
|
blanchet@33192
|
268 |
|
blanchet@33192
|
269 |
fun all_combinations_ordered_smartly ks =
|
blanchet@33192
|
270 |
let
|
blanchet@33192
|
271 |
fun cost_with_monos [] = 0
|
blanchet@33192
|
272 |
| cost_with_monos (k :: ks) =
|
blanchet@34118
|
273 |
if k < sync_threshold andalso forall (curry (op =) k) ks then
|
blanchet@33192
|
274 |
k - sync_threshold
|
blanchet@33192
|
275 |
else
|
blanchet@33192
|
276 |
k * (k + 1) div 2 + Integer.sum ks
|
blanchet@33192
|
277 |
fun cost_without_monos [] = 0
|
blanchet@33192
|
278 |
| cost_without_monos [k] = k
|
blanchet@33192
|
279 |
| cost_without_monos (_ :: k :: ks) =
|
blanchet@34118
|
280 |
if k < sync_threshold andalso forall (curry (op =) k) ks then
|
blanchet@33192
|
281 |
k - sync_threshold
|
blanchet@33192
|
282 |
else
|
blanchet@33192
|
283 |
Integer.sum (k :: ks)
|
blanchet@33192
|
284 |
in
|
blanchet@33192
|
285 |
ks |> all_combinations
|
blanchet@33192
|
286 |
|> map (`(if fst (hd ks) > 1 then cost_with_monos
|
blanchet@33192
|
287 |
else cost_without_monos))
|
blanchet@33192
|
288 |
|> sort (int_ord o pairself fst) |> map snd
|
blanchet@33192
|
289 |
end
|
blanchet@33192
|
290 |
|
blanchet@33192
|
291 |
fun is_self_recursive_constr_type T =
|
blanchet@34118
|
292 |
exists (exists_subtype (curry (op =) (body_type T))) (binder_types T)
|
blanchet@33192
|
293 |
|
blanchet@33192
|
294 |
fun constr_max maxes x = the_default ~1 (AList.lookup (op =) maxes x)
|
blanchet@33192
|
295 |
|
blanchet@33192
|
296 |
type scope_desc = (typ * int) list * (styp * int) list
|
blanchet@33192
|
297 |
|
blanchet@35190
|
298 |
fun is_surely_inconsistent_card_assign hol_ctxt binarize
|
blanchet@35190
|
299 |
(card_assigns, max_assigns) (T, k) =
|
blanchet@35190
|
300 |
case binarized_and_boxed_datatype_constrs hol_ctxt binarize T of
|
blanchet@33192
|
301 |
[] => false
|
blanchet@33192
|
302 |
| xs =>
|
blanchet@33192
|
303 |
let
|
blanchet@34123
|
304 |
val dom_cards =
|
blanchet@34123
|
305 |
map (Integer.prod o map (bounded_card_of_type k ~1 card_assigns)
|
blanchet@33192
|
306 |
o binder_types o snd) xs
|
blanchet@34120
|
307 |
val maxes = map (constr_max max_assigns) xs
|
blanchet@34123
|
308 |
fun effective_max card ~1 = card
|
blanchet@33192
|
309 |
| effective_max card max = Int.min (card, max)
|
blanchet@34123
|
310 |
val max = map2 effective_max dom_cards maxes |> Integer.sum
|
blanchet@34123
|
311 |
in max < k end
|
blanchet@35190
|
312 |
fun is_surely_inconsistent_scope_description hol_ctxt binarize seen rest
|
blanchet@35190
|
313 |
max_assigns =
|
blanchet@35190
|
314 |
exists (is_surely_inconsistent_card_assign hol_ctxt binarize
|
blanchet@34123
|
315 |
(seen @ rest, max_assigns)) seen
|
blanchet@33192
|
316 |
|
blanchet@35190
|
317 |
fun repair_card_assigns hol_ctxt binarize (card_assigns, max_assigns) =
|
blanchet@33192
|
318 |
let
|
blanchet@33192
|
319 |
fun aux seen [] = SOME seen
|
blanchet@35280
|
320 |
| aux _ ((_, 0) :: _) = NONE
|
blanchet@34123
|
321 |
| aux seen ((T, k) :: rest) =
|
blanchet@35190
|
322 |
(if is_surely_inconsistent_scope_description hol_ctxt binarize
|
blanchet@35190
|
323 |
((T, k) :: seen) rest max_assigns then
|
blanchet@33192
|
324 |
raise SAME ()
|
blanchet@33192
|
325 |
else
|
blanchet@34123
|
326 |
case aux ((T, k) :: seen) rest of
|
blanchet@34120
|
327 |
SOME assigns => SOME assigns
|
blanchet@33192
|
328 |
| NONE => raise SAME ())
|
blanchet@34123
|
329 |
handle SAME () => aux seen ((T, k - 1) :: rest)
|
blanchet@34120
|
330 |
in aux [] (rev card_assigns) end
|
blanchet@33192
|
331 |
|
blanchet@35280
|
332 |
fun repair_iterator_assign thy assigns (T as Type (_, Ts), k) =
|
blanchet@33192
|
333 |
(T, if T = @{typ bisim_iterator} then
|
blanchet@34120
|
334 |
let
|
blanchet@34120
|
335 |
val co_cards = map snd (filter (is_codatatype thy o fst) assigns)
|
blanchet@34120
|
336 |
in Int.min (k, Integer.sum co_cards) end
|
blanchet@33192
|
337 |
else if is_fp_iterator_type T then
|
blanchet@33192
|
338 |
case Ts of
|
blanchet@33192
|
339 |
[] => 1
|
blanchet@34120
|
340 |
| _ => bounded_card_of_type k ~1 assigns (foldr1 HOLogic.mk_prodT Ts)
|
blanchet@33192
|
341 |
else
|
blanchet@33192
|
342 |
k)
|
blanchet@34120
|
343 |
| repair_iterator_assign _ _ assign = assign
|
blanchet@33192
|
344 |
|
blanchet@34120
|
345 |
fun add_row_to_scope_descriptor (kind, ks) (card_assigns, max_assigns) =
|
blanchet@33192
|
346 |
case kind of
|
blanchet@34120
|
347 |
Card T => ((T, the_single ks) :: card_assigns, max_assigns)
|
blanchet@34120
|
348 |
| Max x => (card_assigns, (x, the_single ks) :: max_assigns)
|
blanchet@33192
|
349 |
fun scope_descriptor_from_block block =
|
blanchet@33192
|
350 |
fold_rev add_row_to_scope_descriptor block ([], [])
|
blanchet@35190
|
351 |
fun scope_descriptor_from_combination (hol_ctxt as {thy, ...}) binarize blocks
|
blanchet@35190
|
352 |
columns =
|
blanchet@33192
|
353 |
let
|
blanchet@34120
|
354 |
val (card_assigns, max_assigns) =
|
blanchet@33192
|
355 |
maps project_block (columns ~~ blocks) |> scope_descriptor_from_block
|
blanchet@35190
|
356 |
val card_assigns =
|
blanchet@35190
|
357 |
repair_card_assigns hol_ctxt binarize (card_assigns, max_assigns) |> the
|
blanchet@33192
|
358 |
in
|
blanchet@34120
|
359 |
SOME (map (repair_iterator_assign thy card_assigns) card_assigns,
|
blanchet@34120
|
360 |
max_assigns)
|
blanchet@33192
|
361 |
end
|
blanchet@33192
|
362 |
handle Option.Option => NONE
|
blanchet@33192
|
363 |
|
blanchet@35280
|
364 |
fun offset_table_for_card_assigns assigns dtypes =
|
blanchet@33192
|
365 |
let
|
blanchet@33192
|
366 |
fun aux next _ [] = Typtab.update_new (dummyT, next)
|
blanchet@34120
|
367 |
| aux next reusable ((T, k) :: assigns) =
|
blanchet@35280
|
368 |
if k = 1 orelse is_iterator_type T orelse is_integer_type T
|
blanchet@35280
|
369 |
orelse is_bit_type T then
|
blanchet@34120
|
370 |
aux next reusable assigns
|
blanchet@33192
|
371 |
else if length (these (Option.map #constrs (datatype_spec dtypes T)))
|
blanchet@33192
|
372 |
> 1 then
|
blanchet@34120
|
373 |
Typtab.update_new (T, next) #> aux (next + k) reusable assigns
|
blanchet@33192
|
374 |
else
|
blanchet@33192
|
375 |
case AList.lookup (op =) reusable k of
|
blanchet@34120
|
376 |
SOME j0 => Typtab.update_new (T, j0) #> aux next reusable assigns
|
blanchet@33192
|
377 |
| NONE => Typtab.update_new (T, next)
|
blanchet@34120
|
378 |
#> aux (next + k) ((k, next) :: reusable) assigns
|
blanchet@34120
|
379 |
in aux 0 [] assigns Typtab.empty end
|
blanchet@33192
|
380 |
|
blanchet@34120
|
381 |
fun domain_card max card_assigns =
|
blanchet@34120
|
382 |
Integer.prod o map (bounded_card_of_type max max card_assigns) o binder_types
|
blanchet@33192
|
383 |
|
blanchet@34120
|
384 |
fun add_constr_spec (card_assigns, max_assigns) co card sum_dom_cards
|
blanchet@35280
|
385 |
num_self_recs num_non_self_recs (self_rec, x as (_, T))
|
blanchet@34120
|
386 |
constrs =
|
blanchet@33192
|
387 |
let
|
blanchet@34120
|
388 |
val max = constr_max max_assigns x
|
blanchet@33192
|
389 |
fun next_delta () = if null constrs then 0 else #epsilon (hd constrs)
|
blanchet@33192
|
390 |
val {delta, epsilon, exclusive, total} =
|
blanchet@33192
|
391 |
if max = 0 then
|
blanchet@33192
|
392 |
let val delta = next_delta () in
|
blanchet@33192
|
393 |
{delta = delta, epsilon = delta, exclusive = true, total = false}
|
blanchet@33192
|
394 |
end
|
blanchet@33192
|
395 |
else if not co andalso num_self_recs > 0 then
|
blanchet@35069
|
396 |
(if num_self_recs = 1 andalso num_non_self_recs = 1 then
|
blanchet@35069
|
397 |
if self_rec then
|
blanchet@35069
|
398 |
case constrs of
|
blanchet@35069
|
399 |
[{delta = 0, epsilon = 1, exclusive = true, ...}] =>
|
blanchet@35069
|
400 |
{delta = 1, epsilon = card, exclusive = true, total = false}
|
blanchet@35069
|
401 |
| _ => raise SAME ()
|
blanchet@35069
|
402 |
else
|
blanchet@35069
|
403 |
if domain_card 2 card_assigns T = 1 then
|
blanchet@35069
|
404 |
{delta = 0, epsilon = 1, exclusive = true, total = true}
|
blanchet@35069
|
405 |
else
|
blanchet@35069
|
406 |
raise SAME ()
|
blanchet@35069
|
407 |
else
|
blanchet@35069
|
408 |
raise SAME ())
|
blanchet@35069
|
409 |
handle SAME () =>
|
blanchet@35069
|
410 |
{delta = 0, epsilon = card, exclusive = false, total = false}
|
blanchet@33192
|
411 |
else if card = sum_dom_cards (card + 1) then
|
blanchet@33192
|
412 |
let val delta = next_delta () in
|
blanchet@34120
|
413 |
{delta = delta, epsilon = delta + domain_card card card_assigns T,
|
blanchet@33192
|
414 |
exclusive = true, total = true}
|
blanchet@33192
|
415 |
end
|
blanchet@33192
|
416 |
else
|
blanchet@33192
|
417 |
{delta = 0, epsilon = card,
|
blanchet@33192
|
418 |
exclusive = (num_self_recs + num_non_self_recs = 1), total = false}
|
blanchet@33192
|
419 |
in
|
blanchet@33192
|
420 |
{const = x, delta = delta, epsilon = epsilon, exclusive = exclusive,
|
blanchet@33192
|
421 |
explicit_max = max, total = total} :: constrs
|
blanchet@33192
|
422 |
end
|
blanchet@33192
|
423 |
|
blanchet@35385
|
424 |
fun has_exact_card hol_ctxt facto finitizable_dataTs card_assigns T =
|
blanchet@34120
|
425 |
let val card = card_of_type card_assigns T in
|
blanchet@35385
|
426 |
card = bounded_exact_card_of_type hol_ctxt
|
blanchet@35385
|
427 |
(if facto then finitizable_dataTs else []) (card + 1) 0
|
blanchet@35385
|
428 |
card_assigns T
|
blanchet@34120
|
429 |
end
|
blanchet@34120
|
430 |
|
blanchet@35220
|
431 |
fun datatype_spec_from_scope_descriptor (hol_ctxt as {thy, stds, ...}) binarize
|
blanchet@35385
|
432 |
deep_dataTs finitizable_dataTs (desc as (card_assigns, _)) (T, card) =
|
blanchet@33192
|
433 |
let
|
blanchet@34969
|
434 |
val deep = member (op =) deep_dataTs T
|
blanchet@33192
|
435 |
val co = is_codatatype thy T
|
blanchet@35220
|
436 |
val standard = is_standard_datatype thy stds T
|
blanchet@35190
|
437 |
val xs = binarized_and_boxed_datatype_constrs hol_ctxt binarize T
|
blanchet@33192
|
438 |
val self_recs = map (is_self_recursive_constr_type o snd) xs
|
blanchet@33192
|
439 |
val (num_self_recs, num_non_self_recs) =
|
blanchet@34120
|
440 |
List.partition I self_recs |> pairself length
|
blanchet@35385
|
441 |
fun is_complete facto =
|
blanchet@35385
|
442 |
has_exact_card hol_ctxt facto finitizable_dataTs card_assigns T
|
blanchet@35385
|
443 |
fun is_concrete facto =
|
blanchet@35385
|
444 |
is_word_type T orelse
|
blanchet@35385
|
445 |
xs |> maps (binder_types o snd) |> maps binder_types
|
blanchet@35385
|
446 |
|> forall (has_exact_card hol_ctxt facto finitizable_dataTs
|
blanchet@35385
|
447 |
card_assigns)
|
blanchet@35385
|
448 |
val complete = pair_from_fun is_complete
|
blanchet@35385
|
449 |
val concrete = pair_from_fun is_concrete
|
blanchet@33192
|
450 |
fun sum_dom_cards max =
|
blanchet@34120
|
451 |
map (domain_card max card_assigns o snd) xs |> Integer.sum
|
blanchet@33192
|
452 |
val constrs =
|
blanchet@33192
|
453 |
fold_rev (add_constr_spec desc co card sum_dom_cards num_self_recs
|
blanchet@35069
|
454 |
num_non_self_recs)
|
blanchet@35069
|
455 |
(sort (bool_ord o swap o pairself fst) (self_recs ~~ xs)) []
|
blanchet@33549
|
456 |
in
|
blanchet@35179
|
457 |
{typ = T, card = card, co = co, standard = standard, complete = complete,
|
blanchet@35179
|
458 |
concrete = concrete, deep = deep, constrs = constrs}
|
blanchet@33549
|
459 |
end
|
blanchet@33192
|
460 |
|
blanchet@36386
|
461 |
fun scope_from_descriptor (hol_ctxt as {thy, stds, ...}) binarize deep_dataTs
|
blanchet@36386
|
462 |
finitizable_dataTs (desc as (card_assigns, _)) =
|
blanchet@33192
|
463 |
let
|
blanchet@33549
|
464 |
val datatypes =
|
blanchet@35190
|
465 |
map (datatype_spec_from_scope_descriptor hol_ctxt binarize deep_dataTs
|
blanchet@35385
|
466 |
finitizable_dataTs desc)
|
blanchet@35385
|
467 |
(filter (is_datatype thy stds o fst) card_assigns)
|
blanchet@34121
|
468 |
val bits = card_of_type card_assigns @{typ signed_bit} - 1
|
blanchet@34121
|
469 |
handle TYPE ("Nitpick_HOL.card_of_type", _, _) =>
|
blanchet@34121
|
470 |
card_of_type card_assigns @{typ unsigned_bit}
|
blanchet@34121
|
471 |
handle TYPE ("Nitpick_HOL.card_of_type", _, _) => 0
|
blanchet@34120
|
472 |
val bisim_depth = card_of_type card_assigns @{typ bisim_iterator} - 1
|
blanchet@33192
|
473 |
in
|
blanchet@35190
|
474 |
{hol_ctxt = hol_ctxt, binarize = binarize, card_assigns = card_assigns,
|
blanchet@35190
|
475 |
datatypes = datatypes, bits = bits, bisim_depth = bisim_depth,
|
blanchet@36386
|
476 |
ofs = offset_table_for_card_assigns card_assigns datatypes}
|
blanchet@33192
|
477 |
end
|
blanchet@33192
|
478 |
|
blanchet@35665
|
479 |
fun repair_cards_assigns_wrt_boxing_etc _ _ [] = []
|
blanchet@35665
|
480 |
| repair_cards_assigns_wrt_boxing_etc thy Ts ((SOME T, ks) :: cards_assigns) =
|
blanchet@33192
|
481 |
(if is_fun_type T orelse is_pair_type T then
|
blanchet@35665
|
482 |
Ts |> filter (curry (type_match thy o swap) T) |> map (rpair ks o SOME)
|
blanchet@33192
|
483 |
else
|
blanchet@35665
|
484 |
[(SOME T, ks)]) @
|
blanchet@35665
|
485 |
repair_cards_assigns_wrt_boxing_etc thy Ts cards_assigns
|
blanchet@35665
|
486 |
| repair_cards_assigns_wrt_boxing_etc thy Ts ((NONE, ks) :: cards_assigns) =
|
blanchet@35665
|
487 |
(NONE, ks) :: repair_cards_assigns_wrt_boxing_etc thy Ts cards_assigns
|
blanchet@33192
|
488 |
|
blanchet@33571
|
489 |
val max_scopes = 4096
|
blanchet@33192
|
490 |
val distinct_threshold = 512
|
blanchet@33192
|
491 |
|
blanchet@36386
|
492 |
fun all_scopes (hol_ctxt as {thy, ...}) binarize cards_assigns maxes_assigns
|
blanchet@36386
|
493 |
iters_assigns bitss bisim_depths mono_Ts nonmono_Ts deep_dataTs
|
blanchet@36386
|
494 |
finitizable_dataTs =
|
blanchet@33192
|
495 |
let
|
blanchet@35665
|
496 |
val cards_assigns = repair_cards_assigns_wrt_boxing_etc thy mono_Ts
|
blanchet@35665
|
497 |
cards_assigns
|
blanchet@35190
|
498 |
val blocks = blocks_for_types hol_ctxt binarize cards_assigns maxes_assigns
|
blanchet@34121
|
499 |
iters_assigns bitss bisim_depths mono_Ts
|
blanchet@34121
|
500 |
nonmono_Ts
|
blanchet@33192
|
501 |
val ranks = map rank_of_block blocks
|
blanchet@33571
|
502 |
val all = all_combinations_ordered_smartly (map (rpair 0) ranks)
|
haftmann@33956
|
503 |
val head = take max_scopes all
|
blanchet@35190
|
504 |
val descs =
|
blanchet@35190
|
505 |
map_filter (scope_descriptor_from_combination hol_ctxt binarize blocks)
|
blanchet@35190
|
506 |
head
|
blanchet@33192
|
507 |
in
|
blanchet@33571
|
508 |
(length all - length head,
|
blanchet@33571
|
509 |
descs |> length descs <= distinct_threshold ? distinct (op =)
|
blanchet@36386
|
510 |
|> map (scope_from_descriptor hol_ctxt binarize deep_dataTs
|
blanchet@36386
|
511 |
finitizable_dataTs))
|
blanchet@33192
|
512 |
end
|
blanchet@33192
|
513 |
|
blanchet@33192
|
514 |
end;
|