author | blanchet |
Tue, 07 Dec 2010 11:56:53 +0100 | |
changeset 41052 | 3db267a01c1d |
parent 41039 | 405a9f41ad6b |
child 41472 | f6ab14e61604 |
permissions | -rw-r--r-- |
33982 | 1 |
(* Title: HOL/Tools/Nitpick/nitpick_model.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:
34974
diff
changeset
|
3 |
Copyright 2009, 2010 |
33192 | 4 |
|
5 |
Model reconstruction for Nitpick. |
|
6 |
*) |
|
7 |
||
8 |
signature NITPICK_MODEL = |
|
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 |
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
11 |
type scope = Nitpick_Scope.scope |
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
12 |
type rep = Nitpick_Rep.rep |
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
13 |
type nut = Nitpick_Nut.nut |
33192 | 14 |
|
36390
eee4ee6a5cbe
remove "show_skolems" option and change style of record declarations
blanchet
parents:
36389
diff
changeset
|
15 |
type params = |
eee4ee6a5cbe
remove "show_skolems" option and change style of record declarations
blanchet
parents:
36389
diff
changeset
|
16 |
{show_datatypes: bool, |
eee4ee6a5cbe
remove "show_skolems" option and change style of record declarations
blanchet
parents:
36389
diff
changeset
|
17 |
show_consts: bool} |
eee4ee6a5cbe
remove "show_skolems" option and change style of record declarations
blanchet
parents:
36389
diff
changeset
|
18 |
|
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
19 |
type term_postprocessor = |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
20 |
Proof.context -> string -> (typ -> term list) -> typ -> term -> term |
33192 | 21 |
|
22 |
structure NameTable : TABLE |
|
23 |
||
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
24 |
val irrelevant : string |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
25 |
val unknown : string |
37261 | 26 |
val unrep : unit -> string |
35711
548d3f16404b
added term postprocessor to Nitpick, to provide custom syntax for typedefs
blanchet
parents:
35665
diff
changeset
|
27 |
val register_term_postprocessor : |
38284
9f98107ad8b4
use "declaration" instead of "setup" to register Nitpick extensions
blanchet
parents:
38240
diff
changeset
|
28 |
typ -> term_postprocessor -> morphism -> Context.generic -> Context.generic |
38240
a44d108a8d39
local versions of Nitpick.register_xxx functions
blanchet
parents:
38209
diff
changeset
|
29 |
val register_term_postprocessor_global : |
35711
548d3f16404b
added term postprocessor to Nitpick, to provide custom syntax for typedefs
blanchet
parents:
35665
diff
changeset
|
30 |
typ -> term_postprocessor -> theory -> theory |
38284
9f98107ad8b4
use "declaration" instead of "setup" to register Nitpick extensions
blanchet
parents:
38240
diff
changeset
|
31 |
val unregister_term_postprocessor : |
9f98107ad8b4
use "declaration" instead of "setup" to register Nitpick extensions
blanchet
parents:
38240
diff
changeset
|
32 |
typ -> morphism -> Context.generic -> Context.generic |
38240
a44d108a8d39
local versions of Nitpick.register_xxx functions
blanchet
parents:
38209
diff
changeset
|
33 |
val unregister_term_postprocessor_global : typ -> theory -> theory |
33192 | 34 |
val tuple_list_for_name : |
35 |
nut NameTable.table -> Kodkod.raw_bound list -> nut -> int list list |
|
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
36 |
val dest_plain_fun : term -> bool * (term list * term list) |
33192 | 37 |
val reconstruct_hol_model : |
37260
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
38 |
params -> scope -> (term option * int list) list |
38170 | 39 |
-> (typ option * string list) list -> styp list -> styp list -> nut list |
40 |
-> nut list -> nut list -> nut NameTable.table -> Kodkod.raw_bound list |
|
33192 | 41 |
-> Pretty.T * bool |
42 |
val prove_hol_model : |
|
43 |
scope -> Time.time option -> nut list -> nut list -> nut NameTable.table |
|
44 |
-> Kodkod.raw_bound list -> term -> bool option |
|
45 |
end; |
|
46 |
||
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
47 |
structure Nitpick_Model : NITPICK_MODEL = |
33192 | 48 |
struct |
49 |
||
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
50 |
open Nitpick_Util |
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
51 |
open Nitpick_HOL |
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
52 |
open Nitpick_Scope |
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
53 |
open Nitpick_Peephole |
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
54 |
open Nitpick_Rep |
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
55 |
open Nitpick_Nut |
33192 | 56 |
|
34126 | 57 |
structure KK = Kodkod |
58 |
||
36390
eee4ee6a5cbe
remove "show_skolems" option and change style of record declarations
blanchet
parents:
36389
diff
changeset
|
59 |
type params = |
eee4ee6a5cbe
remove "show_skolems" option and change style of record declarations
blanchet
parents:
36389
diff
changeset
|
60 |
{show_datatypes: bool, |
eee4ee6a5cbe
remove "show_skolems" option and change style of record declarations
blanchet
parents:
36389
diff
changeset
|
61 |
show_consts: bool} |
33192 | 62 |
|
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
63 |
type term_postprocessor = |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
64 |
Proof.context -> string -> (typ -> term list) -> typ -> term -> term |
35711
548d3f16404b
added term postprocessor to Nitpick, to provide custom syntax for typedefs
blanchet
parents:
35665
diff
changeset
|
65 |
|
38240
a44d108a8d39
local versions of Nitpick.register_xxx functions
blanchet
parents:
38209
diff
changeset
|
66 |
structure Data = Generic_Data( |
35711
548d3f16404b
added term postprocessor to Nitpick, to provide custom syntax for typedefs
blanchet
parents:
35665
diff
changeset
|
67 |
type T = (typ * term_postprocessor) list |
548d3f16404b
added term postprocessor to Nitpick, to provide custom syntax for typedefs
blanchet
parents:
35665
diff
changeset
|
68 |
val empty = [] |
548d3f16404b
added term postprocessor to Nitpick, to provide custom syntax for typedefs
blanchet
parents:
35665
diff
changeset
|
69 |
val extend = I |
36607
e5f7235f39c5
made sml/nj happy about Sledgehammer and Nitpick (cf. 6f11c9b1fb3e, 3c2438efe224)
krauss
parents:
36391
diff
changeset
|
70 |
fun merge (x, y) = AList.merge (op =) (K true) (x, y)) |
35711
548d3f16404b
added term postprocessor to Nitpick, to provide custom syntax for typedefs
blanchet
parents:
35665
diff
changeset
|
71 |
|
37261 | 72 |
fun xsym s s' () = if print_mode_active Symbol.xsymbolsN then s else s' |
73 |
||
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
74 |
val irrelevant = "_" |
33192 | 75 |
val unknown = "?" |
37261 | 76 |
val unrep = xsym "\<dots>" "..." |
77 |
val maybe_mixfix = xsym "_\<^sup>?" "_?" |
|
78 |
val base_mixfix = xsym "_\<^bsub>base\<^esub>" "_.base" |
|
79 |
val step_mixfix = xsym "_\<^bsub>step\<^esub>" "_.step" |
|
80 |
val abs_mixfix = xsym "\<guillemotleft>_\<guillemotright>" "\"_\"" |
|
35718 | 81 |
val arg_var_prefix = "x" |
37261 | 82 |
val cyclic_co_val_name = xsym "\<omega>" "w" |
83 |
val cyclic_const_prefix = xsym "\<xi>" "X" |
|
84 |
fun cyclic_type_name () = nitpick_prefix ^ cyclic_const_prefix () |
|
34982
7b8c366e34a2
added support for nonstandard models to Nitpick (based on an idea by Koen Claessen) and did other fixes to Nitpick
blanchet
parents:
34974
diff
changeset
|
85 |
val opt_flag = nitpick_prefix ^ "opt" |
7b8c366e34a2
added support for nonstandard models to Nitpick (based on an idea by Koen Claessen) and did other fixes to Nitpick
blanchet
parents:
34974
diff
changeset
|
86 |
val non_opt_flag = nitpick_prefix ^ "non_opt" |
33192 | 87 |
|
35076
cc19e2aef17e
added hotel key card example for Nitpick, and renumber atoms in Nitpick's output for increased readability
blanchet
parents:
35075
diff
changeset
|
88 |
type atom_pool = ((string * int) * int list) list |
cc19e2aef17e
added hotel key card example for Nitpick, and renumber atoms in Nitpick's output for increased readability
blanchet
parents:
35075
diff
changeset
|
89 |
|
35718 | 90 |
fun add_wacky_syntax ctxt = |
91 |
let |
|
92 |
val name_of = fst o dest_Const |
|
93 |
val thy = ProofContext.theory_of ctxt |> Context.reject_draft |
|
94 |
val (maybe_t, thy) = |
|
95 |
Sign.declare_const ((@{binding nitpick_maybe}, @{typ "'a => 'a"}), |
|
37261 | 96 |
Mixfix (maybe_mixfix (), [1000], 1000)) thy |
35718 | 97 |
val (abs_t, thy) = |
98 |
Sign.declare_const ((@{binding nitpick_abs}, @{typ "'a => 'b"}), |
|
37261 | 99 |
Mixfix (abs_mixfix (), [40], 40)) thy |
35718 | 100 |
val (base_t, thy) = |
101 |
Sign.declare_const ((@{binding nitpick_base}, @{typ "'a => 'a"}), |
|
37261 | 102 |
Mixfix (base_mixfix (), [1000], 1000)) thy |
35718 | 103 |
val (step_t, thy) = |
104 |
Sign.declare_const ((@{binding nitpick_step}, @{typ "'a => 'a"}), |
|
37261 | 105 |
Mixfix (step_mixfix (), [1000], 1000)) thy |
35718 | 106 |
in |
107 |
(pairself (pairself name_of) ((maybe_t, abs_t), (base_t, step_t)), |
|
108 |
ProofContext.transfer_syntax thy ctxt) |
|
109 |
end |
|
110 |
||
111 |
(** Term reconstruction **) |
|
112 |
||
37260
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
113 |
fun nth_atom_number pool T j = |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
114 |
case AList.lookup (op =) (!pool) T of |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
115 |
SOME js => |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
116 |
(case find_index (curry (op =) j) js of |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
117 |
~1 => (Unsynchronized.change pool (cons (T, j :: js)); |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
118 |
length js + 1) |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
119 |
| n => length js - n) |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
120 |
| NONE => (Unsynchronized.change pool (cons (T, [j])); 1) |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
121 |
fun atom_suffix s = |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
122 |
nat_subscript |
40627
becf5d5187cc
renamed raw "explode" function to "raw_explode" to emphasize its meaning;
wenzelm
parents:
40132
diff
changeset
|
123 |
#> (s <> "" andalso Symbol.is_ascii_digit (List.last (raw_explode s))) (* FIXME Symbol.explode (?) *) |
33884
a0c43f185fef
generate clearer atom names in Nitpick for types that end with a digit;
blanchet
parents:
33705
diff
changeset
|
124 |
? prefix "\<^isub>," |
37260
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
125 |
fun nth_atom_name thy atomss pool prefix T j = |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
126 |
let |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
127 |
val ss = these (triple_lookup (type_match thy) atomss T) |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
128 |
val m = nth_atom_number pool T j |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
129 |
in |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
130 |
if m <= length ss then |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
131 |
nth ss (m - 1) |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
132 |
else case T of |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
133 |
Type (s, _) => |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
134 |
let val s' = shortest_name s in |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
135 |
prefix ^ |
41039
405a9f41ad6b
show strings as "s_1" etc. rather than "l_1" etc.
blanchet
parents:
40627
diff
changeset
|
136 |
(if T = @{typ string} then "s" |
405a9f41ad6b
show strings as "s_1" etc. rather than "l_1" etc.
blanchet
parents:
40627
diff
changeset
|
137 |
else if String.isPrefix "\\" s' then s' |
405a9f41ad6b
show strings as "s_1" etc. rather than "l_1" etc.
blanchet
parents:
40627
diff
changeset
|
138 |
else substring (s', 0, 1)) ^ atom_suffix s m |
37260
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
139 |
end |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
140 |
| TFree (s, _) => prefix ^ perhaps (try (unprefix "'")) s ^ atom_suffix s m |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
141 |
| _ => raise TYPE ("Nitpick_Model.nth_atom_name", [T], []) |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
142 |
end |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
143 |
fun nth_atom thy atomss pool for_auto T j = |
33192 | 144 |
if for_auto then |
37260
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
145 |
Free (nth_atom_name thy atomss pool (hd (space_explode "." nitpick_prefix)) |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
146 |
T j, T) |
33192 | 147 |
else |
37260
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
148 |
Const (nth_atom_name thy atomss pool "" T j, T) |
33192 | 149 |
|
35177 | 150 |
fun extract_real_number (Const (@{const_name divide}, _) $ t1 $ t2) = |
34126 | 151 |
real (snd (HOLogic.dest_number t1)) / real (snd (HOLogic.dest_number t2)) |
152 |
| extract_real_number t = real (snd (HOLogic.dest_number t)) |
|
34124
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
153 |
fun nice_term_ord (Abs (_, _, t1), Abs (_, _, t2)) = nice_term_ord (t1, t2) |
34126 | 154 |
| nice_term_ord tp = Real.compare (pairself extract_real_number tp) |
34124
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
155 |
handle TERM ("dest_number", _) => |
34126 | 156 |
case tp of |
34124
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
157 |
(t11 $ t12, t21 $ t22) => |
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
158 |
(case nice_term_ord (t11, t21) of |
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
159 |
EQUAL => nice_term_ord (t12, t22) |
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
160 |
| ord => ord) |
35408 | 161 |
| _ => Term_Ord.fast_term_ord tp |
34124
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
162 |
|
38284
9f98107ad8b4
use "declaration" instead of "setup" to register Nitpick extensions
blanchet
parents:
38240
diff
changeset
|
163 |
fun register_term_postprocessor_generic T postproc = |
9f98107ad8b4
use "declaration" instead of "setup" to register Nitpick extensions
blanchet
parents:
38240
diff
changeset
|
164 |
Data.map (cons (T, postproc)) |
9f98107ad8b4
use "declaration" instead of "setup" to register Nitpick extensions
blanchet
parents:
38240
diff
changeset
|
165 |
(* TODO: Consider morphism. *) |
9f98107ad8b4
use "declaration" instead of "setup" to register Nitpick extensions
blanchet
parents:
38240
diff
changeset
|
166 |
fun register_term_postprocessor T postproc (_ : morphism) = |
9f98107ad8b4
use "declaration" instead of "setup" to register Nitpick extensions
blanchet
parents:
38240
diff
changeset
|
167 |
register_term_postprocessor_generic T postproc |
38240
a44d108a8d39
local versions of Nitpick.register_xxx functions
blanchet
parents:
38209
diff
changeset
|
168 |
val register_term_postprocessor_global = |
a44d108a8d39
local versions of Nitpick.register_xxx functions
blanchet
parents:
38209
diff
changeset
|
169 |
Context.theory_map oo register_term_postprocessor_generic |
a44d108a8d39
local versions of Nitpick.register_xxx functions
blanchet
parents:
38209
diff
changeset
|
170 |
|
a44d108a8d39
local versions of Nitpick.register_xxx functions
blanchet
parents:
38209
diff
changeset
|
171 |
fun unregister_term_postprocessor_generic T = Data.map (AList.delete (op =) T) |
38284
9f98107ad8b4
use "declaration" instead of "setup" to register Nitpick extensions
blanchet
parents:
38240
diff
changeset
|
172 |
(* TODO: Consider morphism. *) |
9f98107ad8b4
use "declaration" instead of "setup" to register Nitpick extensions
blanchet
parents:
38240
diff
changeset
|
173 |
fun unregister_term_postprocessor T (_ : morphism) = |
9f98107ad8b4
use "declaration" instead of "setup" to register Nitpick extensions
blanchet
parents:
38240
diff
changeset
|
174 |
unregister_term_postprocessor_generic T |
38240
a44d108a8d39
local versions of Nitpick.register_xxx functions
blanchet
parents:
38209
diff
changeset
|
175 |
val unregister_term_postprocessor_global = |
a44d108a8d39
local versions of Nitpick.register_xxx functions
blanchet
parents:
38209
diff
changeset
|
176 |
Context.theory_map o unregister_term_postprocessor_generic |
35711
548d3f16404b
added term postprocessor to Nitpick, to provide custom syntax for typedefs
blanchet
parents:
35665
diff
changeset
|
177 |
|
33192 | 178 |
fun tuple_list_for_name rel_table bounds name = |
179 |
the (AList.lookup (op =) bounds (the_rel rel_table name)) handle NUT _ => [[]] |
|
180 |
||
41052
3db267a01c1d
remove the "fin_fun" optimization in Nitpick -- it was always a hack and didn't help much
blanchet
parents:
41039
diff
changeset
|
181 |
fun unarize_unbox_etc_term (Const (@{const_name FunBox}, _) $ t1) = |
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
182 |
unarize_unbox_etc_term t1 |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
183 |
| unarize_unbox_etc_term |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
184 |
(Const (@{const_name PairBox}, |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
185 |
Type (@{type_name fun}, [T1, Type (@{type_name fun}, [T2, _])])) |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
186 |
$ t1 $ t2) = |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
187 |
let val Ts = map uniterize_unarize_unbox_etc_type [T1, T2] in |
38190
b02e204b613a
get rid of all "optimizations" regarding "unit" and other cardinality-1 types
blanchet
parents:
38189
diff
changeset
|
188 |
Const (@{const_name Pair}, Ts ---> Type (@{type_name prod}, Ts)) |
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
189 |
$ unarize_unbox_etc_term t1 $ unarize_unbox_etc_term t2 |
33192 | 190 |
end |
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
191 |
| unarize_unbox_etc_term (Const (s, T)) = |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
192 |
Const (s, uniterize_unarize_unbox_etc_type T) |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
193 |
| unarize_unbox_etc_term (t1 $ t2) = |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
194 |
unarize_unbox_etc_term t1 $ unarize_unbox_etc_term t2 |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
195 |
| unarize_unbox_etc_term (Free (s, T)) = |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
196 |
Free (s, uniterize_unarize_unbox_etc_type T) |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
197 |
| unarize_unbox_etc_term (Var (x, T)) = |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
198 |
Var (x, uniterize_unarize_unbox_etc_type T) |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
199 |
| unarize_unbox_etc_term (Bound j) = Bound j |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
200 |
| unarize_unbox_etc_term (Abs (s, T, t')) = |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
201 |
Abs (s, uniterize_unarize_unbox_etc_type T, unarize_unbox_etc_term t') |
33192 | 202 |
|
38190
b02e204b613a
get rid of all "optimizations" regarding "unit" and other cardinality-1 types
blanchet
parents:
38189
diff
changeset
|
203 |
fun factor_out_types (T1 as Type (@{type_name prod}, [T11, T12])) |
b02e204b613a
get rid of all "optimizations" regarding "unit" and other cardinality-1 types
blanchet
parents:
38189
diff
changeset
|
204 |
(T2 as Type (@{type_name prod}, [T21, T22])) = |
33192 | 205 |
let val (n1, n2) = pairself num_factors_in_type (T11, T21) in |
206 |
if n1 = n2 then |
|
207 |
let |
|
208 |
val ((T11', opt_T12'), (T21', opt_T22')) = factor_out_types T12 T22 |
|
209 |
in |
|
38190
b02e204b613a
get rid of all "optimizations" regarding "unit" and other cardinality-1 types
blanchet
parents:
38189
diff
changeset
|
210 |
((Type (@{type_name prod}, [T11, T11']), opt_T12'), |
b02e204b613a
get rid of all "optimizations" regarding "unit" and other cardinality-1 types
blanchet
parents:
38189
diff
changeset
|
211 |
(Type (@{type_name prod}, [T21, T21']), opt_T22')) |
33192 | 212 |
end |
213 |
else if n1 < n2 then |
|
214 |
case factor_out_types T1 T21 of |
|
215 |
(p1, (T21', NONE)) => (p1, (T21', SOME T22)) |
|
216 |
| (p1, (T21', SOME T22')) => |
|
38190
b02e204b613a
get rid of all "optimizations" regarding "unit" and other cardinality-1 types
blanchet
parents:
38189
diff
changeset
|
217 |
(p1, (T21', SOME (Type (@{type_name prod}, [T22', T22])))) |
33192 | 218 |
else |
219 |
swap (factor_out_types T2 T1) |
|
220 |
end |
|
38190
b02e204b613a
get rid of all "optimizations" regarding "unit" and other cardinality-1 types
blanchet
parents:
38189
diff
changeset
|
221 |
| factor_out_types (Type (@{type_name prod}, [T11, T12])) T2 = |
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
222 |
((T11, SOME T12), (T2, NONE)) |
38190
b02e204b613a
get rid of all "optimizations" regarding "unit" and other cardinality-1 types
blanchet
parents:
38189
diff
changeset
|
223 |
| factor_out_types T1 (Type (@{type_name prod}, [T21, T22])) = |
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
224 |
((T1, NONE), (T21, SOME T22)) |
33192 | 225 |
| factor_out_types T1 T2 = ((T1, NONE), (T2, NONE)) |
226 |
||
227 |
fun make_plain_fun maybe_opt T1 T2 = |
|
228 |
let |
|
229 |
fun aux T1 T2 [] = |
|
34982
7b8c366e34a2
added support for nonstandard models to Nitpick (based on an idea by Koen Claessen) and did other fixes to Nitpick
blanchet
parents:
34974
diff
changeset
|
230 |
Const (if maybe_opt then opt_flag else non_opt_flag, T1 --> T2) |
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
231 |
| aux T1 T2 ((t1, t2) :: tps) = |
34124
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
232 |
Const (@{const_name fun_upd}, (T1 --> T2) --> T1 --> T2 --> T1 --> T2) |
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
233 |
$ aux T1 T2 tps $ t1 $ t2 |
33192 | 234 |
in aux T1 T2 o rev end |
34982
7b8c366e34a2
added support for nonstandard models to Nitpick (based on an idea by Koen Claessen) and did other fixes to Nitpick
blanchet
parents:
34974
diff
changeset
|
235 |
fun is_plain_fun (Const (s, _)) = (s = opt_flag orelse s = non_opt_flag) |
33192 | 236 |
| is_plain_fun (Const (@{const_name fun_upd}, _) $ t0 $ _ $ _) = |
237 |
is_plain_fun t0 |
|
238 |
| is_plain_fun _ = false |
|
239 |
val dest_plain_fun = |
|
240 |
let |
|
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
241 |
fun aux (Abs (_, _, Const (s, _))) = (s <> irrelevant, ([], [])) |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
242 |
| aux (Const (s, _)) = (s <> non_opt_flag, ([], [])) |
33192 | 243 |
| aux (Const (@{const_name fun_upd}, _) $ t0 $ t1 $ t2) = |
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
244 |
let val (maybe_opt, (ts1, ts2)) = aux t0 in |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
245 |
(maybe_opt, (t1 :: ts1, t2 :: ts2)) |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
246 |
end |
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
247 |
| aux t = raise TERM ("Nitpick_Model.dest_plain_fun", [t]) |
33192 | 248 |
in apsnd (pairself rev) o aux end |
249 |
||
33565
5fad8e36dfb1
fixed error in Nitpick's display of uncurried constants, which resulted in an exception
blanchet
parents:
33558
diff
changeset
|
250 |
fun break_in_two T T1 T2 t = |
5fad8e36dfb1
fixed error in Nitpick's display of uncurried constants, which resulted in an exception
blanchet
parents:
33558
diff
changeset
|
251 |
let |
5fad8e36dfb1
fixed error in Nitpick's display of uncurried constants, which resulted in an exception
blanchet
parents:
33558
diff
changeset
|
252 |
val ps = HOLogic.flat_tupleT_paths T |
5fad8e36dfb1
fixed error in Nitpick's display of uncurried constants, which resulted in an exception
blanchet
parents:
33558
diff
changeset
|
253 |
val cut = length (HOLogic.strip_tupleT T1) |
5fad8e36dfb1
fixed error in Nitpick's display of uncurried constants, which resulted in an exception
blanchet
parents:
33558
diff
changeset
|
254 |
val (ps1, ps2) = pairself HOLogic.flat_tupleT_paths (T1, T2) |
5fad8e36dfb1
fixed error in Nitpick's display of uncurried constants, which resulted in an exception
blanchet
parents:
33558
diff
changeset
|
255 |
val (ts1, ts2) = t |> HOLogic.strip_ptuple ps |> chop cut |
5fad8e36dfb1
fixed error in Nitpick's display of uncurried constants, which resulted in an exception
blanchet
parents:
33558
diff
changeset
|
256 |
in (HOLogic.mk_ptuple ps1 T1 ts1, HOLogic.mk_ptuple ps2 T2 ts2) end |
38190
b02e204b613a
get rid of all "optimizations" regarding "unit" and other cardinality-1 types
blanchet
parents:
38189
diff
changeset
|
257 |
fun pair_up (Type (@{type_name prod}, [T1', T2'])) |
33192 | 258 |
(t1 as Const (@{const_name Pair}, |
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
259 |
Type (@{type_name fun}, |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
260 |
[_, Type (@{type_name fun}, [_, T1])])) |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
261 |
$ t11 $ t12) t2 = |
33192 | 262 |
if T1 = T1' then HOLogic.mk_prod (t1, t2) |
263 |
else HOLogic.mk_prod (t11, pair_up T2' t12 t2) |
|
264 |
| pair_up _ t1 t2 = HOLogic.mk_prod (t1, t2) |
|
265 |
fun multi_pair_up T1 t1 (ts2, ts3) = map2 (pair o pair_up T1 t1) ts2 ts3 |
|
266 |
||
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
267 |
fun typecast_fun (Type (@{type_name fun}, [T1', T2'])) T1 T2 t = |
33192 | 268 |
let |
33565
5fad8e36dfb1
fixed error in Nitpick's display of uncurried constants, which resulted in an exception
blanchet
parents:
33558
diff
changeset
|
269 |
fun do_curry T1 T1a T1b T2 t = |
33192 | 270 |
let |
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
271 |
val (maybe_opt, tsp) = dest_plain_fun t |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
272 |
val tps = |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
273 |
tsp |>> map (break_in_two T1 T1a T1b) |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
274 |
|> uncurry (map2 (fn (t1a, t1b) => fn t2 => (t1a, (t1b, t2)))) |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
275 |
|> AList.coalesce (op =) |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
276 |
|> map (apsnd (make_plain_fun maybe_opt T1b T2)) |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
277 |
in make_plain_fun maybe_opt T1a (T1b --> T2) tps end |
33192 | 278 |
and do_uncurry T1 T2 t = |
279 |
let |
|
280 |
val (maybe_opt, tsp) = dest_plain_fun t |
|
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
281 |
val tps = |
33192 | 282 |
tsp |> op ~~ |
283 |
|> maps (fn (t1, t2) => |
|
284 |
multi_pair_up T1 t1 (snd (dest_plain_fun t2))) |
|
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
285 |
in make_plain_fun maybe_opt T1 T2 tps end |
33192 | 286 |
and do_arrow T1' T2' _ _ (Const (s, _)) = Const (s, T1' --> T2') |
287 |
| do_arrow T1' T2' T1 T2 |
|
288 |
(Const (@{const_name fun_upd}, _) $ t0 $ t1 $ t2) = |
|
289 |
Const (@{const_name fun_upd}, |
|
34124
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
290 |
(T1' --> T2') --> T1' --> T2' --> T1' --> T2') |
33192 | 291 |
$ do_arrow T1' T2' T1 T2 t0 $ do_term T1' T1 t1 $ do_term T2' T2 t2 |
292 |
| do_arrow _ _ _ _ t = |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
293 |
raise TERM ("Nitpick_Model.typecast_fun.do_arrow", [t]) |
33192 | 294 |
and do_fun T1' T2' T1 T2 t = |
295 |
case factor_out_types T1' T1 of |
|
296 |
((_, NONE), (_, NONE)) => t |> do_arrow T1' T2' T1 T2 |
|
297 |
| ((_, NONE), (T1a, SOME T1b)) => |
|
33565
5fad8e36dfb1
fixed error in Nitpick's display of uncurried constants, which resulted in an exception
blanchet
parents:
33558
diff
changeset
|
298 |
t |> do_curry T1 T1a T1b T2 |> do_arrow T1' T2' T1a (T1b --> T2) |
33192 | 299 |
| ((T1a', SOME T1b'), (_, NONE)) => |
300 |
t |> do_arrow T1a' (T1b' --> T2') T1 T2 |> do_uncurry T1' T2' |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
301 |
| _ => raise TYPE ("Nitpick_Model.typecast_fun.do_fun", [T1, T1'], []) |
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
302 |
and do_term (Type (@{type_name fun}, [T1', T2'])) |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
303 |
(Type (@{type_name fun}, [T1, T2])) t = |
33192 | 304 |
do_fun T1' T2' T1 T2 t |
38190
b02e204b613a
get rid of all "optimizations" regarding "unit" and other cardinality-1 types
blanchet
parents:
38189
diff
changeset
|
305 |
| do_term (T' as Type (@{type_name prod}, Ts' as [T1', T2'])) |
b02e204b613a
get rid of all "optimizations" regarding "unit" and other cardinality-1 types
blanchet
parents:
38189
diff
changeset
|
306 |
(Type (@{type_name prod}, [T1, T2])) |
33192 | 307 |
(Const (@{const_name Pair}, _) $ t1 $ t2) = |
308 |
Const (@{const_name Pair}, Ts' ---> T') |
|
309 |
$ do_term T1' T1 t1 $ do_term T2' T2 t2 |
|
310 |
| do_term T' T t = |
|
311 |
if T = T' then t |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
312 |
else raise TYPE ("Nitpick_Model.typecast_fun.do_term", [T, T'], []) |
33192 | 313 |
in if T1' = T1 andalso T2' = T2 then t else do_fun T1' T2' T1 T2 t end |
34998 | 314 |
| typecast_fun T' _ _ _ = |
315 |
raise TYPE ("Nitpick_Model.typecast_fun", [T'], []) |
|
33192 | 316 |
|
317 |
fun truth_const_sort_key @{const True} = "0" |
|
318 |
| truth_const_sort_key @{const False} = "2" |
|
319 |
| truth_const_sort_key _ = "1" |
|
320 |
||
38190
b02e204b613a
get rid of all "optimizations" regarding "unit" and other cardinality-1 types
blanchet
parents:
38189
diff
changeset
|
321 |
fun mk_tuple (Type (@{type_name prod}, [T1, T2])) ts = |
33192 | 322 |
HOLogic.mk_prod (mk_tuple T1 ts, |
323 |
mk_tuple T2 (List.drop (ts, length (HOLogic.flatten_tupleT T1)))) |
|
324 |
| mk_tuple _ (t :: _) = t |
|
34124
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
325 |
| mk_tuple T [] = raise TYPE ("Nitpick_Model.mk_tuple", [T], []) |
33192 | 326 |
|
38240
a44d108a8d39
local versions of Nitpick.register_xxx functions
blanchet
parents:
38209
diff
changeset
|
327 |
fun varified_type_match ctxt (candid_T, pat_T) = |
a44d108a8d39
local versions of Nitpick.register_xxx functions
blanchet
parents:
38209
diff
changeset
|
328 |
let val thy = ProofContext.theory_of ctxt in |
a44d108a8d39
local versions of Nitpick.register_xxx functions
blanchet
parents:
38209
diff
changeset
|
329 |
strict_type_match thy (candid_T, varify_type ctxt pat_T) |
a44d108a8d39
local versions of Nitpick.register_xxx functions
blanchet
parents:
38209
diff
changeset
|
330 |
end |
35711
548d3f16404b
added term postprocessor to Nitpick, to provide custom syntax for typedefs
blanchet
parents:
35665
diff
changeset
|
331 |
|
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
332 |
fun all_values_of_type pool wacky_names (scope as {card_assigns, ...} : scope) |
37260
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
333 |
atomss sel_names rel_table bounds card T = |
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
334 |
let |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
335 |
val card = if card = 0 then card_of_type card_assigns T else card |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
336 |
fun nth_value_of_type n = |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
337 |
let |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
338 |
fun term unfold = |
37262
c0fe8fa35771
don't show spurious "..." in Nitpick's output for free variables of set type (e.g., P (op +) example from Manual_Nits.thy); undoes parts of 38ba15040455, which was too aggressive
blanchet
parents:
37261
diff
changeset
|
339 |
reconstruct_term true unfold pool wacky_names scope atomss sel_names |
37260
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
340 |
rel_table bounds T T (Atom (card, 0)) [[n]] |
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
341 |
in |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
342 |
case term false of |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
343 |
t as Const (s, _) => |
37261 | 344 |
if String.isPrefix (cyclic_const_prefix ()) s then |
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
345 |
HOLogic.mk_eq (t, term true) |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
346 |
else |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
347 |
t |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
348 |
| t => t |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
349 |
end |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
350 |
in index_seq 0 card |> map nth_value_of_type |> sort nice_term_ord end |
37262
c0fe8fa35771
don't show spurious "..." in Nitpick's output for free variables of set type (e.g., P (op +) example from Manual_Nits.thy); undoes parts of 38ba15040455, which was too aggressive
blanchet
parents:
37261
diff
changeset
|
351 |
and reconstruct_term maybe_opt unfold pool |
c0fe8fa35771
don't show spurious "..." in Nitpick's output for free variables of set type (e.g., P (op +) example from Manual_Nits.thy); undoes parts of 38ba15040455, which was too aggressive
blanchet
parents:
37261
diff
changeset
|
352 |
(wacky_names as ((maybe_name, abs_name), _)) |
37256
0dca1ec52999
thread along context instead of theory for typedef lookup
blanchet
parents:
37170
diff
changeset
|
353 |
(scope as {hol_ctxt as {thy, ctxt, stds, ...}, binarize, card_assigns, |
37260
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
354 |
bits, datatypes, ofs, ...}) |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
355 |
atomss sel_names rel_table bounds = |
33192 | 356 |
let |
357 |
val for_auto = (maybe_name = "") |
|
34124
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
358 |
fun value_of_bits jss = |
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
359 |
let |
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
360 |
val j0 = offset_of_type ofs @{typ unsigned_bit} |
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
361 |
val js = map (Integer.add (~ j0) o the_single) jss |
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
362 |
in |
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
363 |
fold (fn j => Integer.add (reasonable_power 2 j |> j = bits ? op ~)) |
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
364 |
js 0 |
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
365 |
end |
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
366 |
val all_values = |
37260
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
367 |
all_values_of_type pool wacky_names scope atomss sel_names rel_table |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
368 |
bounds 0 |
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
369 |
fun postprocess_term (Type (@{type_name fun}, _)) = I |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
370 |
| postprocess_term T = |
38240
a44d108a8d39
local versions of Nitpick.register_xxx functions
blanchet
parents:
38209
diff
changeset
|
371 |
case Data.get (Context.Proof ctxt) of |
a44d108a8d39
local versions of Nitpick.register_xxx functions
blanchet
parents:
38209
diff
changeset
|
372 |
[] => I |
a44d108a8d39
local versions of Nitpick.register_xxx functions
blanchet
parents:
38209
diff
changeset
|
373 |
| postprocs => |
a44d108a8d39
local versions of Nitpick.register_xxx functions
blanchet
parents:
38209
diff
changeset
|
374 |
case AList.lookup (varified_type_match ctxt) postprocs T of |
a44d108a8d39
local versions of Nitpick.register_xxx functions
blanchet
parents:
38209
diff
changeset
|
375 |
SOME postproc => postproc ctxt maybe_name all_values T |
a44d108a8d39
local versions of Nitpick.register_xxx functions
blanchet
parents:
38209
diff
changeset
|
376 |
| NONE => I |
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
377 |
fun postprocess_subterms Ts (t1 $ t2) = |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
378 |
let val t = postprocess_subterms Ts t1 $ postprocess_subterms Ts t2 in |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
379 |
postprocess_term (fastype_of1 (Ts, t)) t |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
380 |
end |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
381 |
| postprocess_subterms Ts (Abs (s, T, t')) = |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
382 |
Abs (s, T, postprocess_subterms (T :: Ts) t') |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
383 |
| postprocess_subterms Ts t = postprocess_term (fastype_of1 (Ts, t)) t |
35388
42d39948cace
use SAT4J for "Tests_Nits.thy" for safety (this should solve the Isatest failures) + minor changes
blanchet
parents:
35385
diff
changeset
|
384 |
fun make_set maybe_opt T1 T2 tps = |
33192 | 385 |
let |
35402 | 386 |
val empty_const = Const (@{const_abbrev Set.empty}, T1 --> T2) |
33192 | 387 |
val insert_const = Const (@{const_name insert}, |
34124
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
388 |
T1 --> (T1 --> T2) --> T1 --> T2) |
33192 | 389 |
fun aux [] = |
35385
29f81babefd7
improved precision of infinite "shallow" datatypes in Nitpick;
blanchet
parents:
35280
diff
changeset
|
390 |
if maybe_opt andalso not (is_complete_type datatypes false T1) then |
37261 | 391 |
insert_const $ Const (unrep (), T1) $ empty_const |
33192 | 392 |
else |
393 |
empty_const |
|
394 |
| aux ((t1, t2) :: zs) = |
|
35388
42d39948cace
use SAT4J for "Tests_Nits.thy" for safety (this should solve the Isatest failures) + minor changes
blanchet
parents:
35385
diff
changeset
|
395 |
aux zs |
42d39948cace
use SAT4J for "Tests_Nits.thy" for safety (this should solve the Isatest failures) + minor changes
blanchet
parents:
35385
diff
changeset
|
396 |
|> t2 <> @{const False} |
42d39948cace
use SAT4J for "Tests_Nits.thy" for safety (this should solve the Isatest failures) + minor changes
blanchet
parents:
35385
diff
changeset
|
397 |
? curry (op $) |
42d39948cace
use SAT4J for "Tests_Nits.thy" for safety (this should solve the Isatest failures) + minor changes
blanchet
parents:
35385
diff
changeset
|
398 |
(insert_const |
42d39948cace
use SAT4J for "Tests_Nits.thy" for safety (this should solve the Isatest failures) + minor changes
blanchet
parents:
35385
diff
changeset
|
399 |
$ (t1 |> t2 <> @{const True} |
42d39948cace
use SAT4J for "Tests_Nits.thy" for safety (this should solve the Isatest failures) + minor changes
blanchet
parents:
35385
diff
changeset
|
400 |
? curry (op $) |
42d39948cace
use SAT4J for "Tests_Nits.thy" for safety (this should solve the Isatest failures) + minor changes
blanchet
parents:
35385
diff
changeset
|
401 |
(Const (maybe_name, T1 --> T1)))) |
42d39948cace
use SAT4J for "Tests_Nits.thy" for safety (this should solve the Isatest failures) + minor changes
blanchet
parents:
35385
diff
changeset
|
402 |
in |
42d39948cace
use SAT4J for "Tests_Nits.thy" for safety (this should solve the Isatest failures) + minor changes
blanchet
parents:
35385
diff
changeset
|
403 |
if forall (fn (_, t) => t <> @{const True} andalso t <> @{const False}) |
42d39948cace
use SAT4J for "Tests_Nits.thy" for safety (this should solve the Isatest failures) + minor changes
blanchet
parents:
35385
diff
changeset
|
404 |
tps then |
42d39948cace
use SAT4J for "Tests_Nits.thy" for safety (this should solve the Isatest failures) + minor changes
blanchet
parents:
35385
diff
changeset
|
405 |
Const (unknown, T1 --> T2) |
42d39948cace
use SAT4J for "Tests_Nits.thy" for safety (this should solve the Isatest failures) + minor changes
blanchet
parents:
35385
diff
changeset
|
406 |
else |
42d39948cace
use SAT4J for "Tests_Nits.thy" for safety (this should solve the Isatest failures) + minor changes
blanchet
parents:
35385
diff
changeset
|
407 |
aux tps |
42d39948cace
use SAT4J for "Tests_Nits.thy" for safety (this should solve the Isatest failures) + minor changes
blanchet
parents:
35385
diff
changeset
|
408 |
end |
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
409 |
fun make_map maybe_opt T1 T2 T2' = |
33192 | 410 |
let |
411 |
val update_const = Const (@{const_name fun_upd}, |
|
34124
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
412 |
(T1 --> T2) --> T1 --> T2 --> T1 --> T2) |
35402 | 413 |
fun aux' [] = Const (@{const_abbrev Map.empty}, T1 --> T2) |
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
414 |
| aux' ((t1, t2) :: tps) = |
33192 | 415 |
(case t2 of |
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
416 |
Const (@{const_name None}, _) => aux' tps |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
417 |
| _ => update_const $ aux' tps $ t1 $ t2) |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
418 |
fun aux tps = |
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
419 |
if maybe_opt andalso not (is_complete_type datatypes false T1) then |
37261 | 420 |
update_const $ aux' tps $ Const (unrep (), T1) |
33192 | 421 |
$ (Const (@{const_name Some}, T2' --> T2) $ Const (unknown, T2')) |
422 |
else |
|
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
423 |
aux' tps |
33192 | 424 |
in aux end |
34982
7b8c366e34a2
added support for nonstandard models to Nitpick (based on an idea by Koen Claessen) and did other fixes to Nitpick
blanchet
parents:
34974
diff
changeset
|
425 |
fun polish_funs Ts t = |
33192 | 426 |
(case fastype_of1 (Ts, t) of |
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
427 |
Type (@{type_name fun}, [T1, T2]) => |
33192 | 428 |
if is_plain_fun t then |
429 |
case T2 of |
|
430 |
@{typ bool} => |
|
431 |
let |
|
432 |
val (maybe_opt, ts_pair) = |
|
34982
7b8c366e34a2
added support for nonstandard models to Nitpick (based on an idea by Koen Claessen) and did other fixes to Nitpick
blanchet
parents:
34974
diff
changeset
|
433 |
dest_plain_fun t ||> pairself (map (polish_funs Ts)) |
33192 | 434 |
in |
435 |
make_set maybe_opt T1 T2 |
|
436 |
(sort_wrt (truth_const_sort_key o snd) (op ~~ ts_pair)) |
|
437 |
end |
|
438 |
| Type (@{type_name option}, [T2']) => |
|
439 |
let |
|
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
440 |
val (maybe_opt, ts_pair) = |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
441 |
dest_plain_fun t ||> pairself (map (polish_funs Ts)) |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
442 |
in make_map maybe_opt T1 T2 T2' (rev (op ~~ ts_pair)) end |
33192 | 443 |
| _ => raise SAME () |
444 |
else |
|
445 |
raise SAME () |
|
446 |
| _ => raise SAME ()) |
|
447 |
handle SAME () => |
|
448 |
case t of |
|
34982
7b8c366e34a2
added support for nonstandard models to Nitpick (based on an idea by Koen Claessen) and did other fixes to Nitpick
blanchet
parents:
34974
diff
changeset
|
449 |
(t1 as Const (@{const_name fun_upd}, _) $ t11 $ _) |
7b8c366e34a2
added support for nonstandard models to Nitpick (based on an idea by Koen Claessen) and did other fixes to Nitpick
blanchet
parents:
34974
diff
changeset
|
450 |
$ (t2 as Const (s, _)) => |
7b8c366e34a2
added support for nonstandard models to Nitpick (based on an idea by Koen Claessen) and did other fixes to Nitpick
blanchet
parents:
34974
diff
changeset
|
451 |
if s = unknown then polish_funs Ts t11 |
7b8c366e34a2
added support for nonstandard models to Nitpick (based on an idea by Koen Claessen) and did other fixes to Nitpick
blanchet
parents:
34974
diff
changeset
|
452 |
else polish_funs Ts t1 $ polish_funs Ts t2 |
7b8c366e34a2
added support for nonstandard models to Nitpick (based on an idea by Koen Claessen) and did other fixes to Nitpick
blanchet
parents:
34974
diff
changeset
|
453 |
| t1 $ t2 => polish_funs Ts t1 $ polish_funs Ts t2 |
7b8c366e34a2
added support for nonstandard models to Nitpick (based on an idea by Koen Claessen) and did other fixes to Nitpick
blanchet
parents:
34974
diff
changeset
|
454 |
| Abs (s, T, t') => Abs (s, T, polish_funs (T :: Ts) t') |
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
455 |
| Const (s, Type (@{type_name fun}, [T1, T2])) => |
34982
7b8c366e34a2
added support for nonstandard models to Nitpick (based on an idea by Koen Claessen) and did other fixes to Nitpick
blanchet
parents:
34974
diff
changeset
|
456 |
if s = opt_flag orelse s = non_opt_flag then |
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
457 |
Abs ("x", T1, |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
458 |
Const (if is_complete_type datatypes false T1 then |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
459 |
irrelevant |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
460 |
else |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
461 |
unknown, T2)) |
34982
7b8c366e34a2
added support for nonstandard models to Nitpick (based on an idea by Koen Claessen) and did other fixes to Nitpick
blanchet
parents:
34974
diff
changeset
|
462 |
else |
7b8c366e34a2
added support for nonstandard models to Nitpick (based on an idea by Koen Claessen) and did other fixes to Nitpick
blanchet
parents:
34974
diff
changeset
|
463 |
t |
7b8c366e34a2
added support for nonstandard models to Nitpick (based on an idea by Koen Claessen) and did other fixes to Nitpick
blanchet
parents:
34974
diff
changeset
|
464 |
| t => t |
33192 | 465 |
fun make_fun maybe_opt T1 T2 T' ts1 ts2 = |
34126 | 466 |
ts1 ~~ ts2 |> sort (nice_term_ord o pairself fst) |
34998 | 467 |
|> make_plain_fun maybe_opt T1 T2 |
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
468 |
|> unarize_unbox_etc_term |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
469 |
|> typecast_fun (uniterize_unarize_unbox_etc_type T') |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
470 |
(uniterize_unarize_unbox_etc_type T1) |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
471 |
(uniterize_unarize_unbox_etc_type T2) |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
472 |
fun term_for_atom seen (T as Type (@{type_name fun}, [T1, T2])) T' j _ = |
33192 | 473 |
let |
474 |
val k1 = card_of_type card_assigns T1 |
|
475 |
val k2 = card_of_type card_assigns T2 |
|
476 |
in |
|
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
477 |
term_for_rep true seen T T' (Vect (k1, Atom (k2, 0))) |
33192 | 478 |
[nth_combination (replicate k1 (k2, 0)) j] |
479 |
handle General.Subscript => |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
480 |
raise ARG ("Nitpick_Model.reconstruct_term.term_for_atom", |
33192 | 481 |
signed_string_of_int j ^ " for " ^ |
482 |
string_for_rep (Vect (k1, Atom (k2, 0)))) |
|
483 |
end |
|
38190
b02e204b613a
get rid of all "optimizations" regarding "unit" and other cardinality-1 types
blanchet
parents:
38189
diff
changeset
|
484 |
| term_for_atom seen (Type (@{type_name prod}, [T1, T2])) _ j k = |
35075
888802be2019
handle Nitpick's nonstandard model enumeration in a cleaner way;
blanchet
parents:
35070
diff
changeset
|
485 |
let |
888802be2019
handle Nitpick's nonstandard model enumeration in a cleaner way;
blanchet
parents:
35070
diff
changeset
|
486 |
val k1 = card_of_type card_assigns T1 |
888802be2019
handle Nitpick's nonstandard model enumeration in a cleaner way;
blanchet
parents:
35070
diff
changeset
|
487 |
val k2 = k div k1 |
888802be2019
handle Nitpick's nonstandard model enumeration in a cleaner way;
blanchet
parents:
35070
diff
changeset
|
488 |
in |
33192 | 489 |
list_comb (HOLogic.pair_const T1 T2, |
35075
888802be2019
handle Nitpick's nonstandard model enumeration in a cleaner way;
blanchet
parents:
35070
diff
changeset
|
490 |
map3 (fn T => term_for_atom seen T T) [T1, T2] |
888802be2019
handle Nitpick's nonstandard model enumeration in a cleaner way;
blanchet
parents:
35070
diff
changeset
|
491 |
[j div k2, j mod k2] [k1, k2]) (* ### k2 or k1? FIXME *) |
33192 | 492 |
end |
35075
888802be2019
handle Nitpick's nonstandard model enumeration in a cleaner way;
blanchet
parents:
35070
diff
changeset
|
493 |
| term_for_atom seen @{typ prop} _ j k = |
888802be2019
handle Nitpick's nonstandard model enumeration in a cleaner way;
blanchet
parents:
35070
diff
changeset
|
494 |
HOLogic.mk_Trueprop (term_for_atom seen bool_T bool_T j k) |
888802be2019
handle Nitpick's nonstandard model enumeration in a cleaner way;
blanchet
parents:
35070
diff
changeset
|
495 |
| term_for_atom _ @{typ bool} _ j _ = |
33192 | 496 |
if j = 0 then @{const False} else @{const True} |
35075
888802be2019
handle Nitpick's nonstandard model enumeration in a cleaner way;
blanchet
parents:
35070
diff
changeset
|
497 |
| term_for_atom seen T _ j k = |
35220
2bcdae5f4fdb
added support for nonstandard "nat"s to Nitpick and fixed bugs in binary "nat"s and "int"s
blanchet
parents:
35190
diff
changeset
|
498 |
if T = nat_T andalso is_standard_datatype thy stds nat_T then |
33192 | 499 |
HOLogic.mk_number nat_T j |
500 |
else if T = int_T then |
|
35075
888802be2019
handle Nitpick's nonstandard model enumeration in a cleaner way;
blanchet
parents:
35070
diff
changeset
|
501 |
HOLogic.mk_number int_T (int_for_atom (k, 0) j) |
33192 | 502 |
else if is_fp_iterator_type T then |
35075
888802be2019
handle Nitpick's nonstandard model enumeration in a cleaner way;
blanchet
parents:
35070
diff
changeset
|
503 |
HOLogic.mk_number nat_T (k - j - 1) |
33192 | 504 |
else if T = @{typ bisim_iterator} then |
505 |
HOLogic.mk_number nat_T j |
|
506 |
else case datatype_spec datatypes T of |
|
37260
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
507 |
NONE => nth_atom thy atomss pool for_auto T j |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
508 |
| SOME {deep = false, ...} => nth_atom thy atomss pool for_auto T j |
35179
4b198af5beb5
redo Nitpick's nonstandard values as cyclic values (instead of additional constructors)
blanchet
parents:
35177
diff
changeset
|
509 |
| SOME {co, standard, constrs, ...} => |
33192 | 510 |
let |
511 |
fun tuples_for_const (s, T) = |
|
512 |
tuple_list_for_name rel_table bounds (ConstName (s, T, Any)) |
|
35180
c57dba973391
more work on Nitpick's support for nonstandard models + fix in model reconstruction
blanchet
parents:
35179
diff
changeset
|
513 |
fun cyclic_atom () = |
37261 | 514 |
nth_atom thy atomss pool for_auto (Type (cyclic_type_name (), [])) |
515 |
j |
|
37260
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
516 |
fun cyclic_var () = |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
517 |
Var ((nth_atom_name thy atomss pool "" T j, 0), T) |
33192 | 518 |
val discr_jsss = map (tuples_for_const o discr_for_constr o #const) |
519 |
constrs |
|
520 |
val real_j = j + offset_of_type ofs T |
|
521 |
val constr_x as (constr_s, constr_T) = |
|
522 |
get_first (fn (jss, {const, ...}) => |
|
34121
5e831d805118
get rid of polymorphic equality in Nitpick's code + a few minor cleanups
blanchet
parents:
33982
diff
changeset
|
523 |
if member (op =) jss [real_j] then SOME const |
5e831d805118
get rid of polymorphic equality in Nitpick's code + a few minor cleanups
blanchet
parents:
33982
diff
changeset
|
524 |
else NONE) |
33192 | 525 |
(discr_jsss ~~ constrs) |> the |
526 |
val arg_Ts = curried_binder_types constr_T |
|
35190
ce653cc27a94
make sure that Nitpick uses binary notation consistently if "binary_ints" is enabled
blanchet
parents:
35188
diff
changeset
|
527 |
val sel_xs = |
ce653cc27a94
make sure that Nitpick uses binary notation consistently if "binary_ints" is enabled
blanchet
parents:
35188
diff
changeset
|
528 |
map (binarized_and_boxed_nth_sel_for_constr hol_ctxt binarize |
ce653cc27a94
make sure that Nitpick uses binary notation consistently if "binary_ints" is enabled
blanchet
parents:
35188
diff
changeset
|
529 |
constr_x) |
ce653cc27a94
make sure that Nitpick uses binary notation consistently if "binary_ints" is enabled
blanchet
parents:
35188
diff
changeset
|
530 |
(index_seq 0 (length arg_Ts)) |
33192 | 531 |
val sel_Rs = |
532 |
map (fn x => get_first |
|
533 |
(fn ConstName (s', T', R) => |
|
534 |
if (s', T') = x then SOME R else NONE |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
535 |
| u => raise NUT ("Nitpick_Model.reconstruct_\ |
33192 | 536 |
\term.term_for_atom", [u])) |
537 |
sel_names |> the) sel_xs |
|
538 |
val arg_Rs = map (snd o dest_Func) sel_Rs |
|
539 |
val sel_jsss = map tuples_for_const sel_xs |
|
540 |
val arg_jsss = |
|
541 |
map (map_filter (fn js => if hd js = real_j then SOME (tl js) |
|
542 |
else NONE)) sel_jsss |
|
543 |
val uncur_arg_Ts = binder_types constr_T |
|
35179
4b198af5beb5
redo Nitpick's nonstandard values as cyclic values (instead of additional constructors)
blanchet
parents:
35177
diff
changeset
|
544 |
val maybe_cyclic = co orelse not standard |
33192 | 545 |
in |
35180
c57dba973391
more work on Nitpick's support for nonstandard models + fix in model reconstruction
blanchet
parents:
35179
diff
changeset
|
546 |
if maybe_cyclic andalso not (null seen) andalso |
35188
8c70a34931b1
improve Nitpick's "Datatypes" rendering for elements containing cycles
blanchet
parents:
35180
diff
changeset
|
547 |
member (op =) (seen |> unfold ? (fst o split_last)) (T, j) then |
35180
c57dba973391
more work on Nitpick's support for nonstandard models + fix in model reconstruction
blanchet
parents:
35179
diff
changeset
|
548 |
cyclic_var () |
34124
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
549 |
else if constr_s = @{const_name Word} then |
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
550 |
HOLogic.mk_number |
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
551 |
(if T = @{typ "unsigned_bit word"} then nat_T else int_T) |
c4628a1dcf75
added support for binary nat/int representation to Nitpick
blanchet
parents:
34123
diff
changeset
|
552 |
(value_of_bits (the_single arg_jsss)) |
33192 | 553 |
else |
554 |
let |
|
35179
4b198af5beb5
redo Nitpick's nonstandard values as cyclic values (instead of additional constructors)
blanchet
parents:
35177
diff
changeset
|
555 |
val seen = seen |> maybe_cyclic ? cons (T, j) |
33192 | 556 |
val ts = |
557 |
if length arg_Ts = 0 then |
|
558 |
[] |
|
559 |
else |
|
41052
3db267a01c1d
remove the "fin_fun" optimization in Nitpick -- it was always a hack and didn't help much
blanchet
parents:
41039
diff
changeset
|
560 |
map3 (fn Ts => term_for_rep true seen Ts Ts) arg_Ts arg_Rs |
3db267a01c1d
remove the "fin_fun" optimization in Nitpick -- it was always a hack and didn't help much
blanchet
parents:
41039
diff
changeset
|
561 |
arg_jsss |
33192 | 562 |
|> mk_tuple (HOLogic.mk_tupleT uncur_arg_Ts) |
563 |
|> dest_n_tuple (length uncur_arg_Ts) |
|
564 |
val t = |
|
565 |
if constr_s = @{const_name Abs_Frac} then |
|
35711
548d3f16404b
added term postprocessor to Nitpick, to provide custom syntax for typedefs
blanchet
parents:
35665
diff
changeset
|
566 |
case ts of |
548d3f16404b
added term postprocessor to Nitpick, to provide custom syntax for typedefs
blanchet
parents:
35665
diff
changeset
|
567 |
[Const (@{const_name Pair}, _) $ t1 $ t2] => |
548d3f16404b
added term postprocessor to Nitpick, to provide custom syntax for typedefs
blanchet
parents:
35665
diff
changeset
|
568 |
frac_from_term_pair (body_type T) t1 t2 |
548d3f16404b
added term postprocessor to Nitpick, to provide custom syntax for typedefs
blanchet
parents:
35665
diff
changeset
|
569 |
| _ => raise TERM ("Nitpick_Model.reconstruct_term.\ |
548d3f16404b
added term postprocessor to Nitpick, to provide custom syntax for typedefs
blanchet
parents:
35665
diff
changeset
|
570 |
\term_for_atom (Abs_Frac)", ts) |
34936
c4f04bee79f3
some work on Nitpick's support for quotient types;
blanchet
parents:
34126
diff
changeset
|
571 |
else if not for_auto andalso |
37256
0dca1ec52999
thread along context instead of theory for typedef lookup
blanchet
parents:
37170
diff
changeset
|
572 |
(is_abs_fun ctxt constr_x orelse |
34936
c4f04bee79f3
some work on Nitpick's support for quotient types;
blanchet
parents:
34126
diff
changeset
|
573 |
constr_s = @{const_name Quot}) then |
33192 | 574 |
Const (abs_name, constr_T) $ the_single ts |
575 |
else |
|
576 |
list_comb (Const constr_x, ts) |
|
577 |
in |
|
35179
4b198af5beb5
redo Nitpick's nonstandard values as cyclic values (instead of additional constructors)
blanchet
parents:
35177
diff
changeset
|
578 |
if maybe_cyclic then |
35180
c57dba973391
more work on Nitpick's support for nonstandard models + fix in model reconstruction
blanchet
parents:
35179
diff
changeset
|
579 |
let val var = cyclic_var () in |
35188
8c70a34931b1
improve Nitpick's "Datatypes" rendering for elements containing cycles
blanchet
parents:
35180
diff
changeset
|
580 |
if unfold andalso not standard andalso |
35180
c57dba973391
more work on Nitpick's support for nonstandard models + fix in model reconstruction
blanchet
parents:
35179
diff
changeset
|
581 |
length seen = 1 andalso |
37261 | 582 |
exists_subterm |
583 |
(fn Const (s, _) => |
|
584 |
String.isPrefix (cyclic_const_prefix ()) s |
|
585 |
| t' => t' = var) t then |
|
35188
8c70a34931b1
improve Nitpick's "Datatypes" rendering for elements containing cycles
blanchet
parents:
35180
diff
changeset
|
586 |
subst_atomic [(var, cyclic_atom ())] t |
35180
c57dba973391
more work on Nitpick's support for nonstandard models + fix in model reconstruction
blanchet
parents:
35179
diff
changeset
|
587 |
else if exists_subterm (curry (op =) var) t then |
35179
4b198af5beb5
redo Nitpick's nonstandard values as cyclic values (instead of additional constructors)
blanchet
parents:
35177
diff
changeset
|
588 |
if co then |
4b198af5beb5
redo Nitpick's nonstandard values as cyclic values (instead of additional constructors)
blanchet
parents:
35177
diff
changeset
|
589 |
Const (@{const_name The}, (T --> bool_T) --> T) |
37261 | 590 |
$ Abs (cyclic_co_val_name (), T, |
38864
4abe644fcea5
formerly unnamed infix equality now named HOL.eq
haftmann
parents:
38284
diff
changeset
|
591 |
Const (@{const_name HOL.eq}, T --> T --> bool_T) |
35180
c57dba973391
more work on Nitpick's support for nonstandard models + fix in model reconstruction
blanchet
parents:
35179
diff
changeset
|
592 |
$ Bound 0 $ abstract_over (var, t)) |
35179
4b198af5beb5
redo Nitpick's nonstandard values as cyclic values (instead of additional constructors)
blanchet
parents:
35177
diff
changeset
|
593 |
else |
35180
c57dba973391
more work on Nitpick's support for nonstandard models + fix in model reconstruction
blanchet
parents:
35179
diff
changeset
|
594 |
cyclic_atom () |
33192 | 595 |
else |
596 |
t |
|
597 |
end |
|
598 |
else |
|
599 |
t |
|
600 |
end |
|
601 |
end |
|
602 |
and term_for_vect seen k R T1 T2 T' js = |
|
35075
888802be2019
handle Nitpick's nonstandard model enumeration in a cleaner way;
blanchet
parents:
35070
diff
changeset
|
603 |
make_fun true T1 T2 T' |
888802be2019
handle Nitpick's nonstandard model enumeration in a cleaner way;
blanchet
parents:
35070
diff
changeset
|
604 |
(map (fn j => term_for_atom seen T1 T1 j k) (index_seq 0 k)) |
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
605 |
(map (term_for_rep true seen T2 T2 R o single) |
33192 | 606 |
(batch_list (arity_of_rep R) js)) |
38190
b02e204b613a
get rid of all "optimizations" regarding "unit" and other cardinality-1 types
blanchet
parents:
38189
diff
changeset
|
607 |
and term_for_rep _ seen T T' (R as Atom (k, j0)) [[j]] = |
35075
888802be2019
handle Nitpick's nonstandard model enumeration in a cleaner way;
blanchet
parents:
35070
diff
changeset
|
608 |
if j >= j0 andalso j < j0 + k then term_for_atom seen T T' (j - j0) k |
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
609 |
else raise REP ("Nitpick_Model.reconstruct_term.term_for_rep", [R]) |
38190
b02e204b613a
get rid of all "optimizations" regarding "unit" and other cardinality-1 types
blanchet
parents:
38189
diff
changeset
|
610 |
| term_for_rep _ seen (Type (@{type_name prod}, [T1, T2])) _ |
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
611 |
(Struct [R1, R2]) [js] = |
33192 | 612 |
let |
613 |
val arity1 = arity_of_rep R1 |
|
614 |
val (js1, js2) = chop arity1 js |
|
615 |
in |
|
616 |
list_comb (HOLogic.pair_const T1 T2, |
|
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
617 |
map3 (fn T => term_for_rep true seen T T) [T1, T2] [R1, R2] |
33192 | 618 |
[[js1], [js2]]) |
619 |
end |
|
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
620 |
| term_for_rep _ seen (Type (@{type_name fun}, [T1, T2])) T' |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
621 |
(Vect (k, R')) [js] = |
33192 | 622 |
term_for_vect seen k R' T1 T2 T' js |
37170
38ba15040455
Nitpick: show "..." in datatype values (e.g., [{0::nat, ...}]), since these are really equivalence classes
blanchet
parents:
36607
diff
changeset
|
623 |
| term_for_rep maybe_opt seen (Type (@{type_name fun}, [T1, T2])) T' |
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
624 |
(Func (R1, Formula Neut)) jss = |
33192 | 625 |
let |
626 |
val jss1 = all_combinations_for_rep R1 |
|
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
627 |
val ts1 = map (term_for_rep true seen T1 T1 R1 o single) jss1 |
33192 | 628 |
val ts2 = |
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
629 |
map (fn js => term_for_rep true seen T2 T2 (Atom (2, 0)) |
35385
29f81babefd7
improved precision of infinite "shallow" datatypes in Nitpick;
blanchet
parents:
35280
diff
changeset
|
630 |
[[int_from_bool (member (op =) jss js)]]) |
34121
5e831d805118
get rid of polymorphic equality in Nitpick's code + a few minor cleanups
blanchet
parents:
33982
diff
changeset
|
631 |
jss1 |
37170
38ba15040455
Nitpick: show "..." in datatype values (e.g., [{0::nat, ...}]), since these are really equivalence classes
blanchet
parents:
36607
diff
changeset
|
632 |
in make_fun maybe_opt T1 T2 T' ts1 ts2 end |
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
633 |
| term_for_rep maybe_opt seen (Type (@{type_name fun}, [T1, T2])) T' |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
634 |
(Func (R1, R2)) jss = |
33192 | 635 |
let |
636 |
val arity1 = arity_of_rep R1 |
|
637 |
val jss1 = all_combinations_for_rep R1 |
|
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
638 |
val ts1 = map (term_for_rep false seen T1 T1 R1 o single) jss1 |
33192 | 639 |
val grouped_jss2 = AList.group (op =) (map (chop arity1) jss) |
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
640 |
val ts2 = map (term_for_rep false seen T2 T2 R2 o the_default [] |
33192 | 641 |
o AList.lookup (op =) grouped_jss2) jss1 |
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
642 |
in make_fun maybe_opt T1 T2 T' ts1 ts2 end |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
643 |
| term_for_rep _ seen T T' (Opt R) jss = |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
644 |
if null jss then Const (unknown, T) |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
645 |
else term_for_rep true seen T T' R jss |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
646 |
| term_for_rep _ _ T _ R jss = |
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
647 |
raise ARG ("Nitpick_Model.reconstruct_term.term_for_rep", |
37260
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
648 |
Syntax.string_of_typ ctxt T ^ " " ^ string_for_rep R ^ " " ^ |
33192 | 649 |
string_of_int (length jss)) |
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
650 |
in |
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
651 |
postprocess_subterms [] o polish_funs [] o unarize_unbox_etc_term |
37262
c0fe8fa35771
don't show spurious "..." in Nitpick's output for free variables of set type (e.g., P (op +) example from Manual_Nits.thy); undoes parts of 38ba15040455, which was too aggressive
blanchet
parents:
37261
diff
changeset
|
652 |
oooo term_for_rep maybe_opt [] |
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
653 |
end |
33192 | 654 |
|
35718 | 655 |
(** Constant postprocessing **) |
656 |
||
657 |
fun dest_n_tuple_type 1 T = [T] |
|
658 |
| dest_n_tuple_type n (Type (_, [T1, T2])) = |
|
659 |
T1 :: dest_n_tuple_type (n - 1) T2 |
|
660 |
| dest_n_tuple_type _ T = |
|
661 |
raise TYPE ("Nitpick_Model.dest_n_tuple_type", [T], []) |
|
662 |
||
663 |
fun const_format thy def_table (x as (s, T)) = |
|
664 |
if String.isPrefix unrolled_prefix s then |
|
665 |
const_format thy def_table (original_name s, range_type T) |
|
666 |
else if String.isPrefix skolem_prefix s then |
|
667 |
let |
|
668 |
val k = unprefix skolem_prefix s |
|
669 |
|> strip_first_name_sep |> fst |> space_explode "@" |
|
670 |
|> hd |> Int.fromString |> the |
|
671 |
in [k, num_binder_types T - k] end |
|
672 |
else if original_name s <> s then |
|
673 |
[num_binder_types T] |
|
674 |
else case def_of_const thy def_table x of |
|
675 |
SOME t' => if fixpoint_kind_of_rhs t' <> NoFp then |
|
676 |
let val k = length (strip_abs_vars t') in |
|
677 |
[k, num_binder_types T - k] |
|
678 |
end |
|
679 |
else |
|
680 |
[num_binder_types T] |
|
681 |
| NONE => [num_binder_types T] |
|
682 |
fun intersect_formats _ [] = [] |
|
683 |
| intersect_formats [] _ = [] |
|
684 |
| intersect_formats ks1 ks2 = |
|
685 |
let val ((ks1', k1), (ks2', k2)) = pairself split_last (ks1, ks2) in |
|
686 |
intersect_formats (ks1' @ (if k1 > k2 then [k1 - k2] else [])) |
|
687 |
(ks2' @ (if k2 > k1 then [k2 - k1] else [])) @ |
|
688 |
[Int.min (k1, k2)] |
|
689 |
end |
|
690 |
||
691 |
fun lookup_format thy def_table formats t = |
|
692 |
case AList.lookup (fn (SOME x, SOME y) => |
|
693 |
(term_match thy) (x, y) | _ => false) |
|
694 |
formats (SOME t) of |
|
695 |
SOME format => format |
|
696 |
| NONE => let val format = the (AList.lookup (op =) formats NONE) in |
|
697 |
case t of |
|
698 |
Const x => intersect_formats format |
|
699 |
(const_format thy def_table x) |
|
700 |
| _ => format |
|
701 |
end |
|
702 |
||
703 |
fun format_type default_format format T = |
|
704 |
let |
|
705 |
val T = uniterize_unarize_unbox_etc_type T |
|
706 |
val format = format |> filter (curry (op <) 0) |
|
707 |
in |
|
708 |
if forall (curry (op =) 1) format then |
|
709 |
T |
|
710 |
else |
|
711 |
let |
|
712 |
val (binder_Ts, body_T) = strip_type T |
|
713 |
val batched = |
|
714 |
binder_Ts |
|
715 |
|> map (format_type default_format default_format) |
|
716 |
|> rev |> chunk_list_unevenly (rev format) |
|
717 |
|> map (HOLogic.mk_tupleT o rev) |
|
718 |
in List.foldl (op -->) body_T batched end |
|
719 |
end |
|
720 |
fun format_term_type thy def_table formats t = |
|
721 |
format_type (the (AList.lookup (op =) formats NONE)) |
|
722 |
(lookup_format thy def_table formats t) (fastype_of t) |
|
723 |
||
724 |
fun repair_special_format js m format = |
|
725 |
m - 1 downto 0 |> chunk_list_unevenly (rev format) |
|
726 |
|> map (rev o filter_out (member (op =) js)) |
|
727 |
|> filter_out null |> map length |> rev |
|
728 |
||
729 |
fun user_friendly_const ({thy, evals, def_table, skolems, special_funs, ...} |
|
730 |
: hol_context) (base_name, step_name) formats = |
|
731 |
let |
|
732 |
val default_format = the (AList.lookup (op =) formats NONE) |
|
733 |
fun do_const (x as (s, T)) = |
|
734 |
(if String.isPrefix special_prefix s then |
|
735 |
let |
|
736 |
val do_term = map_aterms (fn Const x => fst (do_const x) | t' => t') |
|
737 |
val (x' as (_, T'), js, ts) = |
|
738 |
AList.find (op =) (!special_funs) (s, unarize_unbox_etc_type T) |
|
739 |
|> the_single |
|
740 |
val max_j = List.last js |
|
741 |
val Ts = List.take (binder_types T', max_j + 1) |
|
742 |
val missing_js = filter_out (member (op =) js) (0 upto max_j) |
|
743 |
val missing_Ts = filter_indices missing_js Ts |
|
744 |
fun nth_missing_var n = |
|
745 |
((arg_var_prefix ^ nat_subscript (n + 1), 0), nth missing_Ts n) |
|
746 |
val missing_vars = map nth_missing_var (0 upto length missing_js - 1) |
|
747 |
val vars = special_bounds ts @ missing_vars |
|
748 |
val ts' = |
|
749 |
map (fn j => |
|
750 |
case AList.lookup (op =) (js ~~ ts) j of |
|
751 |
SOME t => do_term t |
|
752 |
| NONE => |
|
753 |
Var (nth missing_vars |
|
754 |
(find_index (curry (op =) j) missing_js))) |
|
755 |
(0 upto max_j) |
|
756 |
val t = do_const x' |> fst |
|
757 |
val format = |
|
758 |
case AList.lookup (fn (SOME t1, SOME t2) => term_match thy (t1, t2) |
|
759 |
| _ => false) formats (SOME t) of |
|
760 |
SOME format => |
|
761 |
repair_special_format js (num_binder_types T') format |
|
762 |
| NONE => |
|
763 |
const_format thy def_table x' |
|
764 |
|> repair_special_format js (num_binder_types T') |
|
765 |
|> intersect_formats default_format |
|
766 |
in |
|
767 |
(list_comb (t, ts') |> fold_rev abs_var vars, |
|
768 |
format_type default_format format T) |
|
769 |
end |
|
770 |
else if String.isPrefix uncurry_prefix s then |
|
771 |
let |
|
772 |
val (ss, s') = unprefix uncurry_prefix s |
|
773 |
|> strip_first_name_sep |>> space_explode "@" |
|
774 |
in |
|
775 |
if String.isPrefix step_prefix s' then |
|
776 |
do_const (s', T) |
|
777 |
else |
|
778 |
let |
|
779 |
val k = the (Int.fromString (hd ss)) |
|
780 |
val j = the (Int.fromString (List.last ss)) |
|
781 |
val (before_Ts, (tuple_T, rest_T)) = |
|
782 |
strip_n_binders j T ||> (strip_n_binders 1 #>> hd) |
|
783 |
val T' = before_Ts ---> dest_n_tuple_type k tuple_T ---> rest_T |
|
784 |
in do_const (s', T') end |
|
785 |
end |
|
786 |
else if String.isPrefix unrolled_prefix s then |
|
787 |
let val t = Const (original_name s, range_type T) in |
|
788 |
(lambda (Free (iter_var_prefix, nat_T)) t, |
|
789 |
format_type default_format |
|
790 |
(lookup_format thy def_table formats t) T) |
|
791 |
end |
|
792 |
else if String.isPrefix base_prefix s then |
|
793 |
(Const (base_name, T --> T) $ Const (unprefix base_prefix s, T), |
|
794 |
format_type default_format default_format T) |
|
795 |
else if String.isPrefix step_prefix s then |
|
796 |
(Const (step_name, T --> T) $ Const (unprefix step_prefix s, T), |
|
797 |
format_type default_format default_format T) |
|
798 |
else if String.isPrefix quot_normal_prefix s then |
|
38207
792b78e355e7
added support for "Abs_" and "Rep_" functions on quotient types
blanchet
parents:
38190
diff
changeset
|
799 |
let val t = Const (nitpick_prefix ^ "quotient normal form", T) in |
35718 | 800 |
(t, format_term_type thy def_table formats t) |
801 |
end |
|
802 |
else if String.isPrefix skolem_prefix s then |
|
803 |
let |
|
804 |
val ss = the (AList.lookup (op =) (!skolems) s) |
|
805 |
val (Ts, Ts') = chop (length ss) (binder_types T) |
|
806 |
val frees = map Free (ss ~~ Ts) |
|
807 |
val s' = original_name s |
|
808 |
in |
|
809 |
(fold lambda frees (Const (s', Ts' ---> T)), |
|
810 |
format_type default_format |
|
811 |
(lookup_format thy def_table formats (Const x)) T) |
|
812 |
end |
|
813 |
else if String.isPrefix eval_prefix s then |
|
814 |
let |
|
815 |
val t = nth evals (the (Int.fromString (unprefix eval_prefix s))) |
|
816 |
in (t, format_term_type thy def_table formats t) end |
|
817 |
else |
|
818 |
let val t = Const (original_name s, T) in |
|
819 |
(t, format_term_type thy def_table formats t) |
|
820 |
end) |
|
821 |
|>> map_types uniterize_unarize_unbox_etc_type |
|
822 |
|>> shorten_names_in_term |>> Term.map_abs_vars shortest_name |
|
823 |
in do_const end |
|
824 |
||
825 |
fun assign_operator_for_const (s, T) = |
|
826 |
if String.isPrefix ubfp_prefix s then |
|
37261 | 827 |
if is_fun_type T then xsym "\<subseteq>" "<=" () |
828 |
else xsym "\<le>" "<=" () |
|
35718 | 829 |
else if String.isPrefix lbfp_prefix s then |
37261 | 830 |
if is_fun_type T then xsym "\<supseteq>" ">=" () |
831 |
else xsym "\<ge>" ">=" () |
|
35718 | 832 |
else if original_name s <> s then |
833 |
assign_operator_for_const (strip_first_name_sep s |> snd, T) |
|
834 |
else |
|
835 |
"=" |
|
836 |
||
837 |
(** Model reconstruction **) |
|
838 |
||
33192 | 839 |
fun unfold_outer_the_binders (t as Const (@{const_name The}, _) |
38864
4abe644fcea5
formerly unnamed infix equality now named HOL.eq
haftmann
parents:
38284
diff
changeset
|
840 |
$ Abs (s, T, Const (@{const_name HOL.eq}, _) |
33192 | 841 |
$ Bound 0 $ t')) = |
842 |
betapply (Abs (s, T, t'), t) |> unfold_outer_the_binders |
|
843 |
| unfold_outer_the_binders t = t |
|
844 |
fun bisimilar_values _ 0 _ = true |
|
845 |
| bisimilar_values coTs max_depth (t1, t2) = |
|
846 |
let val T = fastype_of t1 in |
|
847 |
if exists_subtype (member (op =) coTs) T then |
|
848 |
let |
|
849 |
val ((head1, args1), (head2, args2)) = |
|
850 |
pairself (strip_comb o unfold_outer_the_binders) (t1, t2) |
|
34121
5e831d805118
get rid of polymorphic equality in Nitpick's code + a few minor cleanups
blanchet
parents:
33982
diff
changeset
|
851 |
val max_depth = max_depth - (if member (op =) coTs T then 1 else 0) |
33192 | 852 |
in |
34936
c4f04bee79f3
some work on Nitpick's support for quotient types;
blanchet
parents:
34126
diff
changeset
|
853 |
head1 = head2 andalso |
c4f04bee79f3
some work on Nitpick's support for quotient types;
blanchet
parents:
34126
diff
changeset
|
854 |
forall (bisimilar_values coTs max_depth) (args1 ~~ args2) |
33192 | 855 |
end |
856 |
else |
|
857 |
t1 = t2 |
|
858 |
end |
|
859 |
||
36390
eee4ee6a5cbe
remove "show_skolems" option and change style of record declarations
blanchet
parents:
36389
diff
changeset
|
860 |
fun reconstruct_hol_model {show_datatypes, show_consts} |
35280
54ab4921f826
fixed a few bugs in Nitpick and removed unreferenced variables
blanchet
parents:
35220
diff
changeset
|
861 |
({hol_ctxt = {thy, ctxt, max_bisim_depth, boxes, stds, wfs, user_axioms, |
38209 | 862 |
debug, whacks, binary_ints, destroy_constrs, specialize, |
39359 | 863 |
star_linear_preds, tac_timeout, evals, case_names, |
864 |
def_table, nondef_table, user_nondefs, simp_table, |
|
865 |
psimp_table, choice_spec_table, intro_table, |
|
36388 | 866 |
ground_thm_table, ersatz_table, skolems, special_funs, |
867 |
unrolled_preds, wf_cache, constr_cache}, |
|
35190
ce653cc27a94
make sure that Nitpick uses binary notation consistently if "binary_ints" is enabled
blanchet
parents:
35188
diff
changeset
|
868 |
binarize, card_assigns, bits, bisim_depth, datatypes, ofs} : scope) |
38170 | 869 |
formats atomss real_frees pseudo_frees free_names sel_names nonsel_names |
870 |
rel_table bounds = |
|
33192 | 871 |
let |
35180
c57dba973391
more work on Nitpick's support for nonstandard models + fix in model reconstruction
blanchet
parents:
35179
diff
changeset
|
872 |
val pool = Unsynchronized.ref [] |
35280
54ab4921f826
fixed a few bugs in Nitpick and removed unreferenced variables
blanchet
parents:
35220
diff
changeset
|
873 |
val (wacky_names as (_, base_step_names), ctxt) = |
33192 | 874 |
add_wacky_syntax ctxt |
35070
96136eb6218f
split "nitpick_hol.ML" into two files to make it more manageable;
blanchet
parents:
34998
diff
changeset
|
875 |
val hol_ctxt = |
33192 | 876 |
{thy = thy, ctxt = ctxt, max_bisim_depth = max_bisim_depth, boxes = boxes, |
34982
7b8c366e34a2
added support for nonstandard models to Nitpick (based on an idea by Koen Claessen) and did other fixes to Nitpick
blanchet
parents:
34974
diff
changeset
|
877 |
stds = stds, wfs = wfs, user_axioms = user_axioms, debug = debug, |
38209 | 878 |
whacks = whacks, binary_ints = binary_ints, |
879 |
destroy_constrs = destroy_constrs, specialize = specialize, |
|
39359 | 880 |
star_linear_preds = star_linear_preds, tac_timeout = tac_timeout, |
881 |
evals = evals, case_names = case_names, def_table = def_table, |
|
882 |
nondef_table = nondef_table, user_nondefs = user_nondefs, |
|
883 |
simp_table = simp_table, psimp_table = psimp_table, |
|
884 |
choice_spec_table = choice_spec_table, intro_table = intro_table, |
|
885 |
ground_thm_table = ground_thm_table, ersatz_table = ersatz_table, |
|
886 |
skolems = skolems, special_funs = special_funs, |
|
887 |
unrolled_preds = unrolled_preds, wf_cache = wf_cache, |
|
888 |
constr_cache = constr_cache} |
|
36388 | 889 |
val scope = |
890 |
{hol_ctxt = hol_ctxt, binarize = binarize, card_assigns = card_assigns, |
|
891 |
bits = bits, bisim_depth = bisim_depth, datatypes = datatypes, ofs = ofs} |
|
37262
c0fe8fa35771
don't show spurious "..." in Nitpick's output for free variables of set type (e.g., P (op +) example from Manual_Nits.thy); undoes parts of 38ba15040455, which was too aggressive
blanchet
parents:
37261
diff
changeset
|
892 |
fun term_for_rep maybe_opt unfold = |
c0fe8fa35771
don't show spurious "..." in Nitpick's output for free variables of set type (e.g., P (op +) example from Manual_Nits.thy); undoes parts of 38ba15040455, which was too aggressive
blanchet
parents:
37261
diff
changeset
|
893 |
reconstruct_term maybe_opt unfold pool wacky_names scope atomss |
c0fe8fa35771
don't show spurious "..." in Nitpick's output for free variables of set type (e.g., P (op +) example from Manual_Nits.thy); undoes parts of 38ba15040455, which was too aggressive
blanchet
parents:
37261
diff
changeset
|
894 |
sel_names rel_table bounds |
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
895 |
val all_values = |
37260
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
896 |
all_values_of_type pool wacky_names scope atomss sel_names rel_table |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
897 |
bounds |
38126 | 898 |
fun is_codatatype_wellformed (cos : datatype_spec list) |
899 |
({typ, card, ...} : datatype_spec) = |
|
33192 | 900 |
let |
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
901 |
val ts = all_values card typ |
33192 | 902 |
val max_depth = Integer.sum (map #card cos) |
903 |
in |
|
904 |
forall (not o bisimilar_values (map #typ cos) max_depth) |
|
905 |
(all_distinct_unordered_pairs_of ts) |
|
906 |
end |
|
907 |
fun pretty_for_assign name = |
|
908 |
let |
|
909 |
val (oper, (t1, T'), T) = |
|
910 |
case name of |
|
911 |
FreeName (s, T, _) => |
|
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
912 |
let val t = Free (s, uniterize_unarize_unbox_etc_type T) in |
33192 | 913 |
("=", (t, format_term_type thy def_table formats t), T) |
914 |
end |
|
915 |
| ConstName (s, T, _) => |
|
916 |
(assign_operator_for_const (s, T), |
|
35280
54ab4921f826
fixed a few bugs in Nitpick and removed unreferenced variables
blanchet
parents:
35220
diff
changeset
|
917 |
user_friendly_const hol_ctxt base_step_names formats (s, T), T) |
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
918 |
| _ => raise NUT ("Nitpick_Model.reconstruct_hol_model.\ |
33192 | 919 |
\pretty_for_assign", [name]) |
920 |
val t2 = if rep_of name = Any then |
|
921 |
Const (@{const_name undefined}, T') |
|
922 |
else |
|
923 |
tuple_list_for_name rel_table bounds name |
|
37262
c0fe8fa35771
don't show spurious "..." in Nitpick's output for free variables of set type (e.g., P (op +) example from Manual_Nits.thy); undoes parts of 38ba15040455, which was too aggressive
blanchet
parents:
37261
diff
changeset
|
924 |
|> term_for_rep (not (is_fully_representable_set name)) false |
c0fe8fa35771
don't show spurious "..." in Nitpick's output for free variables of set type (e.g., P (op +) example from Manual_Nits.thy); undoes parts of 38ba15040455, which was too aggressive
blanchet
parents:
37261
diff
changeset
|
925 |
T T' (rep_of name) |
33192 | 926 |
in |
927 |
Pretty.block (Pretty.breaks |
|
39118
12f3788be67b
turned show_all_types into proper configuration option;
wenzelm
parents:
38864
diff
changeset
|
928 |
[Syntax.pretty_term (set_show_all_types ctxt) t1, |
33192 | 929 |
Pretty.str oper, Syntax.pretty_term ctxt t2]) |
930 |
end |
|
38126 | 931 |
fun pretty_for_datatype ({typ, card, complete, ...} : datatype_spec) = |
33192 | 932 |
Pretty.block (Pretty.breaks |
38189 | 933 |
(pretty_for_type ctxt typ :: |
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
934 |
(case typ of |
41052
3db267a01c1d
remove the "fin_fun" optimization in Nitpick -- it was always a hack and didn't help much
blanchet
parents:
41039
diff
changeset
|
935 |
Type (@{type_name fun_box}, _) => [Pretty.str "[boxed]"] |
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
936 |
| Type (@{type_name pair_box}, _) => [Pretty.str "[boxed]"] |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
937 |
| _ => []) @ |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
938 |
[Pretty.str "=", |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
939 |
Pretty.enum "," "{" "}" |
35712
77aa29bf14ee
added a mechanism to Nitpick to support custom rendering of terms, and used it for multisets
blanchet
parents:
35711
diff
changeset
|
940 |
(map (Syntax.pretty_term ctxt) (all_values card typ) @ |
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
941 |
(if fun_from_pair complete false then [] |
37261 | 942 |
else [Pretty.str (unrep ())]))])) |
33192 | 943 |
fun integer_datatype T = |
944 |
[{typ = T, card = card_of_type card_assigns T, co = false, |
|
38126 | 945 |
standard = true, self_rec = true, complete = (false, false), |
946 |
concrete = (true, true), deep = true, constrs = []}] |
|
33232
f93390060bbe
internal renaming in Nitpick and fixed Kodkodi invokation on Linux;
blanchet
parents:
33202
diff
changeset
|
947 |
handle TYPE ("Nitpick_HOL.card_of_type", _, _) => [] |
33192 | 948 |
val (codatatypes, datatypes) = |
34982
7b8c366e34a2
added support for nonstandard models to Nitpick (based on an idea by Koen Claessen) and did other fixes to Nitpick
blanchet
parents:
34974
diff
changeset
|
949 |
datatypes |> filter #deep |> List.partition #co |
35220
2bcdae5f4fdb
added support for nonstandard "nat"s to Nitpick and fixed bugs in binary "nat"s and "int"s
blanchet
parents:
35190
diff
changeset
|
950 |
||> append (integer_datatype int_T |
2bcdae5f4fdb
added support for nonstandard "nat"s to Nitpick and fixed bugs in binary "nat"s and "int"s
blanchet
parents:
35190
diff
changeset
|
951 |
|> is_standard_datatype thy stds nat_T |
2bcdae5f4fdb
added support for nonstandard "nat"s to Nitpick and fixed bugs in binary "nat"s and "int"s
blanchet
parents:
35190
diff
changeset
|
952 |
? append (integer_datatype nat_T)) |
33192 | 953 |
val block_of_datatypes = |
954 |
if show_datatypes andalso not (null datatypes) then |
|
955 |
[Pretty.big_list ("Datatype" ^ plural_s_for_list datatypes ^ ":") |
|
956 |
(map pretty_for_datatype datatypes)] |
|
957 |
else |
|
958 |
[] |
|
959 |
val block_of_codatatypes = |
|
960 |
if show_datatypes andalso not (null codatatypes) then |
|
961 |
[Pretty.big_list ("Codatatype" ^ plural_s_for_list codatatypes ^ ":") |
|
962 |
(map pretty_for_datatype codatatypes)] |
|
963 |
else |
|
964 |
[] |
|
965 |
fun block_of_names show title names = |
|
966 |
if show andalso not (null names) then |
|
967 |
Pretty.str (title ^ plural_s_for_list names ^ ":") |
|
968 |
:: map (Pretty.indent indent_size o pretty_for_assign) |
|
969 |
(sort_wrt (original_name o nickname_of) names) |
|
970 |
else |
|
971 |
[] |
|
38170 | 972 |
fun free_name_for_term keep_all (x as (s, T)) = |
973 |
case filter (curry (op =) x |
|
974 |
o pairf nickname_of (uniterize_unarize_unbox_etc_type |
|
975 |
o type_of)) free_names of |
|
976 |
[name] => SOME name |
|
977 |
| [] => if keep_all then SOME (FreeName (s, T, Any)) else NONE |
|
978 |
| _ => raise TERM ("Nitpick_Model.reconstruct_hol_model.\ |
|
979 |
\free_name_for_term", [Const x]) |
|
33192 | 980 |
val (skolem_names, nonskolem_nonsel_names) = |
981 |
List.partition is_skolem_name nonsel_names |
|
982 |
val (eval_names, noneval_nonskolem_nonsel_names) = |
|
983 |
List.partition (String.isPrefix eval_prefix o nickname_of) |
|
984 |
nonskolem_nonsel_names |
|
35665
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
985 |
||> filter_out (member (op =) [@{const_name bisim}, |
ff2bf50505ab
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet
parents:
35625
diff
changeset
|
986 |
@{const_name bisim_iterator_max}] |
34121
5e831d805118
get rid of polymorphic equality in Nitpick's code + a few minor cleanups
blanchet
parents:
33982
diff
changeset
|
987 |
o nickname_of) |
38170 | 988 |
||> append (map_filter (free_name_for_term false) pseudo_frees) |
989 |
val real_free_names = map_filter (free_name_for_term true) real_frees |
|
990 |
val chunks = block_of_names true "Free variable" real_free_names @ |
|
36390
eee4ee6a5cbe
remove "show_skolems" option and change style of record declarations
blanchet
parents:
36389
diff
changeset
|
991 |
block_of_names true "Skolem constant" skolem_names @ |
33192 | 992 |
block_of_names true "Evaluated term" eval_names @ |
993 |
block_of_datatypes @ block_of_codatatypes @ |
|
994 |
block_of_names show_consts "Constant" |
|
995 |
noneval_nonskolem_nonsel_names |
|
996 |
in |
|
997 |
(Pretty.chunks (if null chunks then [Pretty.str "Empty assignment"] |
|
998 |
else chunks), |
|
34936
c4f04bee79f3
some work on Nitpick's support for quotient types;
blanchet
parents:
34126
diff
changeset
|
999 |
bisim_depth >= 0 orelse |
c4f04bee79f3
some work on Nitpick's support for quotient types;
blanchet
parents:
34126
diff
changeset
|
1000 |
forall (is_codatatype_wellformed codatatypes) codatatypes) |
33192 | 1001 |
end |
1002 |
||
37262
c0fe8fa35771
don't show spurious "..." in Nitpick's output for free variables of set type (e.g., P (op +) example from Manual_Nits.thy); undoes parts of 38ba15040455, which was too aggressive
blanchet
parents:
37261
diff
changeset
|
1003 |
fun term_for_name pool scope atomss sel_names rel_table bounds name = |
c0fe8fa35771
don't show spurious "..." in Nitpick's output for free variables of set type (e.g., P (op +) example from Manual_Nits.thy); undoes parts of 38ba15040455, which was too aggressive
blanchet
parents:
37261
diff
changeset
|
1004 |
let val T = type_of name in |
c0fe8fa35771
don't show spurious "..." in Nitpick's output for free variables of set type (e.g., P (op +) example from Manual_Nits.thy); undoes parts of 38ba15040455, which was too aggressive
blanchet
parents:
37261
diff
changeset
|
1005 |
tuple_list_for_name rel_table bounds name |
c0fe8fa35771
don't show spurious "..." in Nitpick's output for free variables of set type (e.g., P (op +) example from Manual_Nits.thy); undoes parts of 38ba15040455, which was too aggressive
blanchet
parents:
37261
diff
changeset
|
1006 |
|> reconstruct_term (not (is_fully_representable_set name)) false pool |
c0fe8fa35771
don't show spurious "..." in Nitpick's output for free variables of set type (e.g., P (op +) example from Manual_Nits.thy); undoes parts of 38ba15040455, which was too aggressive
blanchet
parents:
37261
diff
changeset
|
1007 |
(("", ""), ("", "")) scope atomss sel_names rel_table |
c0fe8fa35771
don't show spurious "..." in Nitpick's output for free variables of set type (e.g., P (op +) example from Manual_Nits.thy); undoes parts of 38ba15040455, which was too aggressive
blanchet
parents:
37261
diff
changeset
|
1008 |
bounds T T (rep_of name) |
c0fe8fa35771
don't show spurious "..." in Nitpick's output for free variables of set type (e.g., P (op +) example from Manual_Nits.thy); undoes parts of 38ba15040455, which was too aggressive
blanchet
parents:
37261
diff
changeset
|
1009 |
end |
c0fe8fa35771
don't show spurious "..." in Nitpick's output for free variables of set type (e.g., P (op +) example from Manual_Nits.thy); undoes parts of 38ba15040455, which was too aggressive
blanchet
parents:
37261
diff
changeset
|
1010 |
|
35280
54ab4921f826
fixed a few bugs in Nitpick and removed unreferenced variables
blanchet
parents:
35220
diff
changeset
|
1011 |
fun prove_hol_model (scope as {hol_ctxt = {thy, ctxt, debug, ...}, |
34998 | 1012 |
card_assigns, ...}) |
33192 | 1013 |
auto_timeout free_names sel_names rel_table bounds prop = |
1014 |
let |
|
35076
cc19e2aef17e
added hotel key card example for Nitpick, and renumber atoms in Nitpick's output for increased readability
blanchet
parents:
35075
diff
changeset
|
1015 |
val pool = Unsynchronized.ref [] |
37260
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
1016 |
val atomss = [(NONE, [])] |
33192 | 1017 |
fun free_type_assm (T, k) = |
1018 |
let |
|
37260
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
1019 |
fun atom j = nth_atom thy atomss pool true T j |
33192 | 1020 |
fun equation_for_atom j = HOLogic.eq_const T $ Bound 0 $ atom j |
1021 |
val eqs = map equation_for_atom (index_seq 0 k) |
|
1022 |
val compreh_assm = |
|
1023 |
Const (@{const_name All}, (T --> bool_T) --> bool_T) |
|
1024 |
$ Abs ("x", T, foldl1 HOLogic.mk_disj eqs) |
|
1025 |
val distinct_assm = distinctness_formula T (map atom (index_seq 0 k)) |
|
34998 | 1026 |
in s_conj (compreh_assm, distinct_assm) end |
33192 | 1027 |
fun free_name_assm name = |
1028 |
HOLogic.mk_eq (Free (nickname_of name, type_of name), |
|
37260
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
1029 |
term_for_name pool scope atomss sel_names rel_table bounds |
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37256
diff
changeset
|
1030 |
name) |
33192 | 1031 |
val freeT_assms = map free_type_assm (filter (is_TFree o fst) card_assigns) |
1032 |
val model_assms = map free_name_assm free_names |
|
34998 | 1033 |
val assm = foldr1 s_conj (freeT_assms @ model_assms) |
33192 | 1034 |
fun try_out negate = |
1035 |
let |
|
1036 |
val concl = (negate ? curry (op $) @{const Not}) |
|
35625 | 1037 |
(Object_Logic.atomize_term thy prop) |
34998 | 1038 |
val prop = HOLogic.mk_Trueprop (HOLogic.mk_imp (assm, concl)) |
33192 | 1039 |
|> map_types (map_type_tfree |
34998 | 1040 |
(fn (s, []) => TFree (s, HOLogic.typeS) |
1041 |
| x => TFree x)) |
|
1042 |
val _ = if debug then |
|
40132
7ee65dbffa31
renamed Output.priority to Output.urgent_message to emphasize its special role more clearly;
wenzelm
parents:
39360
diff
changeset
|
1043 |
Output.urgent_message ((if negate then "Genuineness" else "Spuriousness") ^ |
34998 | 1044 |
" goal: " ^ Syntax.string_of_term ctxt prop ^ ".") |
1045 |
else |
|
1046 |
() |
|
1047 |
val goal = prop |> cterm_of thy |> Goal.init |
|
33192 | 1048 |
in |
1049 |
(goal |> SINGLE (DETERM_TIMEOUT auto_timeout |
|
1050 |
(auto_tac (clasimpset_of ctxt))) |
|
1051 |
|> the |> Goal.finish ctxt; true) |
|
1052 |
handle THM _ => false |
|
1053 |
| TimeLimit.TimeOut => false |
|
1054 |
end |
|
1055 |
in |
|
33705
947184dc75c9
removed a few global names in Nitpick (styp, nat_less, pairf)
blanchet
parents:
33580
diff
changeset
|
1056 |
if try_out false then SOME true |
947184dc75c9
removed a few global names in Nitpick (styp, nat_less, pairf)
blanchet
parents:
33580
diff
changeset
|
1057 |
else if try_out true then SOME false |
33192 | 1058 |
else NONE |
1059 |
end |
|
1060 |
||
1061 |
end; |