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