author | blanchet |
Sun, 25 Apr 2010 11:38:46 +0200 | |
changeset 36393 | be73a2b2443b |
parent 36378 | f32c567dbcaa |
child 36476 | a04cf4704668 |
permissions | -rw-r--r-- |
35826 | 1 |
(* Title: HOL/Tools/Sledgehammer/sledgehammer_fol_clause.ML |
33311 | 2 |
Author: Jia Meng, Cambridge University Computer Laboratory |
36393
be73a2b2443b
support readable names even when Isar proof reconstruction is enabled -- useful for debugging
blanchet
parents:
36378
diff
changeset
|
3 |
Author: Jasmin Blanchette, TU Muenchen |
15347 | 4 |
|
33311 | 5 |
Storing/printing FOL clauses and arity clauses. Typed equality is |
6 |
treated differently. |
|
7 |
||
36218
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
8 |
FIXME: combine with sledgehammer_hol_clause! |
15347 | 9 |
*) |
10 |
||
35826 | 11 |
signature SLEDGEHAMMER_FOL_CLAUSE = |
24310 | 12 |
sig |
13 |
val schematic_var_prefix: string |
|
14 |
val fixed_var_prefix: string |
|
15 |
val tvar_prefix: string |
|
16 |
val tfree_prefix: string |
|
17 |
val clause_prefix: string |
|
18 |
val const_prefix: string |
|
19 |
val tconst_prefix: string |
|
20 |
val class_prefix: string |
|
21 |
val union_all: ''a list list -> ''a list |
|
22 |
val const_trans_table: string Symtab.table |
|
23 |
val type_const_trans_table: string Symtab.table |
|
24 |
val ascii_of: string -> string |
|
25 |
val undo_ascii_of: string -> string |
|
26 |
val paren_pack : string list -> string |
|
27 |
val make_schematic_var : string * int -> string |
|
18868 | 28 |
val make_fixed_var : string -> string |
29 |
val make_schematic_type_var : string * int -> string |
|
24310 | 30 |
val make_fixed_type_var : string -> string |
30151 | 31 |
val make_fixed_const : bool -> string -> string |
32 |
val make_fixed_type_const : bool -> string -> string |
|
18868 | 33 |
val make_type_class : string -> string |
36169
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
34 |
type name = string * string |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
35 |
type name_pool = string Symtab.table * string Symtab.table |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
36 |
val empty_name_pool : bool -> name_pool option |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
37 |
val pool_map : ('a -> 'b -> 'c * 'b) -> 'a list -> 'b -> 'c list * 'b |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
38 |
val nice_name : name -> name_pool option -> string * name_pool option |
24310 | 39 |
datatype kind = Axiom | Conjecture |
40 |
type axiom_name = string |
|
41 |
datatype fol_type = |
|
36169
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
42 |
TyVar of name | |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
43 |
TyFree of name | |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
44 |
TyConstr of name * fol_type list |
36170
0cdb76723c88
added original constant names to Sledgehammer internal terms + output short names if "debug" is set (for increased readability)
blanchet
parents:
36169
diff
changeset
|
45 |
val string_of_fol_type : |
0cdb76723c88
added original constant names to Sledgehammer internal terms + output short names if "debug" is set (for increased readability)
blanchet
parents:
36169
diff
changeset
|
46 |
fol_type -> name_pool option -> string * name_pool option |
24310 | 47 |
datatype type_literal = LTVar of string * string | LTFree of string * string |
48 |
exception CLAUSE of string * term |
|
24940 | 49 |
val add_typs : typ list -> type_literal list |
50 |
val get_tvar_strs: typ list -> string list |
|
24310 | 51 |
datatype arLit = |
52 |
TConsLit of class * string * string list |
|
53 |
| TVarLit of class * string |
|
35865 | 54 |
datatype arity_clause = ArityClause of |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24322
diff
changeset
|
55 |
{axiom_name: axiom_name, conclLit: arLit, premLits: arLit list} |
35865 | 56 |
datatype classrel_clause = ClassrelClause of |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24322
diff
changeset
|
57 |
{axiom_name: axiom_name, subclass: class, superclass: class} |
35865 | 58 |
val make_classrel_clauses: theory -> class list -> class list -> classrel_clause list |
59 |
val make_arity_clauses_dfg: bool -> theory -> string list -> class list -> class list * arity_clause list |
|
60 |
val make_arity_clauses: theory -> string list -> class list -> class list * arity_clause list |
|
36218
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
61 |
val add_type_sort_preds: typ -> int Symtab.table -> int Symtab.table |
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
62 |
val add_classrel_clause_preds : |
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
63 |
classrel_clause -> int Symtab.table -> int Symtab.table |
24310 | 64 |
val class_of_arityLit: arLit -> class |
36218
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
65 |
val add_arity_clause_preds: arity_clause -> int Symtab.table -> int Symtab.table |
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
66 |
val add_fol_type_funcs: fol_type -> int Symtab.table -> int Symtab.table |
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
67 |
val add_arity_clause_funcs: |
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
68 |
arity_clause -> int Symtab.table -> int Symtab.table |
24310 | 69 |
val init_functab: int Symtab.table |
19719 | 70 |
val dfg_sign: bool -> string -> string |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24322
diff
changeset
|
71 |
val dfg_of_typeLit: bool -> type_literal -> string |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24322
diff
changeset
|
72 |
val gen_dfg_cls: int * string * kind * string list * string list * string list -> string |
24310 | 73 |
val string_of_preds: (string * Int.int) list -> string |
74 |
val string_of_funcs: (string * int) list -> string |
|
75 |
val string_of_symbols: string -> string -> string |
|
19719 | 76 |
val string_of_start: string -> string |
77 |
val string_of_descrip : string -> string |
|
24310 | 78 |
val dfg_tfree_clause : string -> string |
35865 | 79 |
val dfg_classrel_clause: classrel_clause -> string |
80 |
val dfg_arity_clause: arity_clause -> string |
|
24310 | 81 |
val tptp_sign: bool -> string -> string |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24322
diff
changeset
|
82 |
val tptp_of_typeLit : bool -> type_literal -> string |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24322
diff
changeset
|
83 |
val gen_tptp_cls : int * string * kind * string list * string list -> string |
24310 | 84 |
val tptp_tfree_clause : string -> string |
35865 | 85 |
val tptp_arity_clause : arity_clause -> string |
86 |
val tptp_classrel_clause : classrel_clause -> string |
|
24310 | 87 |
end |
15347 | 88 |
|
35826 | 89 |
structure Sledgehammer_FOL_Clause : SLEDGEHAMMER_FOL_CLAUSE = |
15347 | 90 |
struct |
91 |
||
36063
cdc6855a6387
make Sledgehammer output "by" vs. "apply", "qed" vs. "next", and any necessary "prefer"
blanchet
parents:
36062
diff
changeset
|
92 |
open Sledgehammer_Util |
cdc6855a6387
make Sledgehammer output "by" vs. "apply", "qed" vs. "next", and any necessary "prefer"
blanchet
parents:
36062
diff
changeset
|
93 |
|
15347 | 94 |
val schematic_var_prefix = "V_"; |
95 |
val fixed_var_prefix = "v_"; |
|
96 |
||
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
97 |
val tvar_prefix = "T_"; |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
98 |
val tfree_prefix = "t_"; |
15347 | 99 |
|
24310 | 100 |
val clause_prefix = "cls_"; |
101 |
val arclause_prefix = "clsarity_" |
|
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
102 |
val clrelclause_prefix = "clsrel_"; |
15347 | 103 |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
104 |
val const_prefix = "c_"; |
24310 | 105 |
val tconst_prefix = "tc_"; |
106 |
val class_prefix = "class_"; |
|
15347 | 107 |
|
36218
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
108 |
fun union_all xss = fold (union (op =)) xss [] |
17775 | 109 |
|
35865 | 110 |
(* Provide readable names for the more common symbolic functions *) |
15347 | 111 |
val const_trans_table = |
35865 | 112 |
Symtab.make [(@{const_name "op ="}, "equal"), |
113 |
(@{const_name Orderings.less_eq}, "lessequals"), |
|
114 |
(@{const_name "op &"}, "and"), |
|
115 |
(@{const_name "op |"}, "or"), |
|
116 |
(@{const_name "op -->"}, "implies"), |
|
117 |
(@{const_name "op :"}, "in"), |
|
118 |
(@{const_name fequal}, "fequal"), |
|
119 |
(@{const_name COMBI}, "COMBI"), |
|
120 |
(@{const_name COMBK}, "COMBK"), |
|
121 |
(@{const_name COMBB}, "COMBB"), |
|
122 |
(@{const_name COMBC}, "COMBC"), |
|
123 |
(@{const_name COMBS}, "COMBS")]; |
|
15347 | 124 |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
125 |
val type_const_trans_table = |
35865 | 126 |
Symtab.make [("*", "prod"), ("+", "sum"), ("~=>", "map")]; |
15347 | 127 |
|
15610 | 128 |
(*Escaping of special characters. |
129 |
Alphanumeric characters are left unchanged. |
|
130 |
The character _ goes to __ |
|
131 |
Characters in the range ASCII space to / go to _A to _P, respectively. |
|
24183 | 132 |
Other printing characters go to _nnn where nnn is the decimal ASCII code.*) |
133 |
val A_minus_space = Char.ord #"A" - Char.ord #" "; |
|
15610 | 134 |
|
24183 | 135 |
fun stringN_of_int 0 _ = "" |
136 |
| stringN_of_int k n = stringN_of_int (k-1) (n div 10) ^ Int.toString (n mod 10); |
|
15610 | 137 |
|
15347 | 138 |
fun ascii_of_c c = |
15610 | 139 |
if Char.isAlphaNum c then String.str c |
140 |
else if c = #"_" then "__" |
|
24310 | 141 |
else if #" " <= c andalso c <= #"/" |
15610 | 142 |
then "_" ^ String.str (Char.chr (Char.ord c + A_minus_space)) |
24310 | 143 |
else if Char.isPrint c |
24183 | 144 |
then ("_" ^ stringN_of_int 3 (Char.ord c)) (*fixed width, in case more digits follow*) |
15610 | 145 |
else "" |
15347 | 146 |
|
15610 | 147 |
val ascii_of = String.translate ascii_of_c; |
148 |
||
24183 | 149 |
(** Remove ASCII armouring from names in proof files **) |
150 |
||
151 |
(*We don't raise error exceptions because this code can run inside the watcher. |
|
152 |
Also, the errors are "impossible" (hah!)*) |
|
153 |
fun undo_ascii_aux rcs [] = String.implode(rev rcs) |
|
154 |
| undo_ascii_aux rcs [#"_"] = undo_ascii_aux (#"_"::rcs) [] (*ERROR*) |
|
155 |
(*Three types of _ escapes: __, _A to _P, _nnn*) |
|
156 |
| undo_ascii_aux rcs (#"_" :: #"_" :: cs) = undo_ascii_aux (#"_"::rcs) cs |
|
24310 | 157 |
| undo_ascii_aux rcs (#"_" :: c :: cs) = |
24183 | 158 |
if #"A" <= c andalso c<= #"P" (*translation of #" " to #"/"*) |
159 |
then undo_ascii_aux (Char.chr(Char.ord c - A_minus_space) :: rcs) cs |
|
24310 | 160 |
else |
24183 | 161 |
let val digits = List.take (c::cs, 3) handle Subscript => [] |
24310 | 162 |
in |
24183 | 163 |
case Int.fromString (String.implode digits) of |
164 |
NONE => undo_ascii_aux (c:: #"_"::rcs) cs (*ERROR*) |
|
165 |
| SOME n => undo_ascii_aux (Char.chr n :: rcs) (List.drop (cs, 2)) |
|
166 |
end |
|
167 |
| undo_ascii_aux rcs (c::cs) = undo_ascii_aux (c::rcs) cs; |
|
168 |
||
169 |
val undo_ascii_of = undo_ascii_aux [] o String.explode; |
|
15347 | 170 |
|
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
171 |
(* convert a list of strings into one single string; surrounded by brackets *) |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
172 |
fun paren_pack [] = "" (*empty argument list*) |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
173 |
| paren_pack strings = "(" ^ commas strings ^ ")"; |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
174 |
|
21509
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
175 |
(*TSTP format uses (...) rather than the old [...]*) |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
176 |
fun tptp_pack strings = "(" ^ space_implode " | " strings ^ ")"; |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
177 |
|
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
178 |
|
16925
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
179 |
(*Remove the initial ' character from a type variable, if it is present*) |
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
180 |
fun trim_type_var s = |
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
181 |
if s <> "" andalso String.sub(s,0) = #"'" then String.extract(s,1,NONE) |
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
182 |
else error ("trim_type: Malformed type variable encountered: " ^ s); |
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
183 |
|
16903 | 184 |
fun ascii_of_indexname (v,0) = ascii_of v |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
185 |
| ascii_of_indexname (v,i) = ascii_of v ^ "_" ^ Int.toString i; |
15347 | 186 |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
187 |
fun make_schematic_var v = schematic_var_prefix ^ (ascii_of_indexname v); |
15347 | 188 |
fun make_fixed_var x = fixed_var_prefix ^ (ascii_of x); |
189 |
||
24310 | 190 |
fun make_schematic_type_var (x,i) = |
16925
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
191 |
tvar_prefix ^ (ascii_of_indexname (trim_type_var x,i)); |
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
192 |
fun make_fixed_type_var x = tfree_prefix ^ (ascii_of (trim_type_var x)); |
15347 | 193 |
|
36378 | 194 |
val max_dfg_symbol_length = 63 |
195 |
||
196 |
(* HACK because SPASS 3.0 truncates identifiers to 63 characters. *) |
|
36062 | 197 |
fun controlled_length dfg s = |
36378 | 198 |
if dfg andalso size s > max_dfg_symbol_length then |
199 |
String.extract (s, 0, SOME (max_dfg_symbol_length div 2 - 1)) ^ "__" ^ |
|
200 |
String.extract (s, size s - max_dfg_symbol_length div 2 + 1, NONE) |
|
201 |
else |
|
202 |
s |
|
23075 | 203 |
|
30151 | 204 |
fun lookup_const dfg c = |
17412 | 205 |
case Symtab.lookup const_trans_table c of |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
206 |
SOME c' => c' |
30151 | 207 |
| NONE => controlled_length dfg (ascii_of c); |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
208 |
|
30151 | 209 |
fun lookup_type_const dfg c = |
17412 | 210 |
case Symtab.lookup type_const_trans_table c of |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
211 |
SOME c' => c' |
30151 | 212 |
| NONE => controlled_length dfg (ascii_of c); |
18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset
|
213 |
|
36062 | 214 |
(* "op =" MUST BE "equal" because it's built into ATPs. *) |
215 |
fun make_fixed_const _ (@{const_name "op ="}) = "equal" |
|
216 |
| make_fixed_const dfg c = const_prefix ^ lookup_const dfg c; |
|
18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset
|
217 |
|
30151 | 218 |
fun make_fixed_type_const dfg c = tconst_prefix ^ lookup_type_const dfg c; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
219 |
|
17261 | 220 |
fun make_type_class clas = class_prefix ^ ascii_of clas; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
221 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
222 |
|
36169
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
223 |
(**** name pool ****) |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
224 |
|
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
225 |
type name = string * string |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
226 |
type name_pool = string Symtab.table * string Symtab.table |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
227 |
|
36222
0e3e49bd658d
don't use readable names if proof reconstruction is needed, because it uses the structure of names
blanchet
parents:
36221
diff
changeset
|
228 |
fun empty_name_pool readable_names = |
0e3e49bd658d
don't use readable names if proof reconstruction is needed, because it uses the structure of names
blanchet
parents:
36221
diff
changeset
|
229 |
if readable_names then SOME (`I Symtab.empty) else NONE |
36169
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
230 |
|
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
231 |
fun pool_map f xs = |
36170
0cdb76723c88
added original constant names to Sledgehammer internal terms + output short names if "debug" is set (for increased readability)
blanchet
parents:
36169
diff
changeset
|
232 |
fold_rev (fn x => fn (ys, pool) => f x pool |>> (fn y => y :: ys)) xs |
0cdb76723c88
added original constant names to Sledgehammer internal terms + output short names if "debug" is set (for increased readability)
blanchet
parents:
36169
diff
changeset
|
233 |
o pair [] |
36169
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
234 |
|
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
235 |
fun add_nice_name full_name nice_prefix j the_pool = |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
236 |
let |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
237 |
val nice_name = nice_prefix ^ (if j = 0 then "" else "_" ^ Int.toString j) |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
238 |
in |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
239 |
case Symtab.lookup (snd the_pool) nice_name of |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
240 |
SOME full_name' => |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
241 |
if full_name = full_name' then (nice_name, the_pool) |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
242 |
else add_nice_name full_name nice_prefix (j + 1) the_pool |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
243 |
| NONE => |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
244 |
(nice_name, (Symtab.update_new (full_name, nice_name) (fst the_pool), |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
245 |
Symtab.update_new (nice_name, full_name) (snd the_pool))) |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
246 |
end |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
247 |
|
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
248 |
fun translate_first_char f s = |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
249 |
String.str (f (String.sub (s, 0))) ^ String.extract (s, 1, NONE) |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
250 |
|
36222
0e3e49bd658d
don't use readable names if proof reconstruction is needed, because it uses the structure of names
blanchet
parents:
36221
diff
changeset
|
251 |
fun readable_name full_name s = |
36169
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
252 |
let |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
253 |
val s = s |> Long_Name.base_name |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
254 |
|> fold remove_all ["\<^sub>", "\<^bsub>", "\<^esub>", "\<^isub>"] |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
255 |
val s' = s |> explode |> rev |> dropwhile (curry (op =) "'") |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
256 |
val s' = |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
257 |
(s' |> rev |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
258 |
|> implode |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
259 |
|> String.translate |
36221 | 260 |
(fn c => if Char.isAlphaNum c orelse c = #"_" then String.str c |
261 |
else "")) |
|
36169
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
262 |
^ replicate_string (String.size s - length s') "_" |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
263 |
val s' = |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
264 |
if s' = "" orelse not (Char.isAlpha (String.sub (s', 0))) then "X" ^ s' |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
265 |
else s' |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
266 |
val s' = if s' = "op" then full_name else s' |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
267 |
in |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
268 |
case (Char.isLower (String.sub (full_name, 0)), |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
269 |
Char.isLower (String.sub (s', 0))) of |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
270 |
(true, false) => translate_first_char Char.toLower s' |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
271 |
| (false, true) => translate_first_char Char.toUpper s' |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
272 |
| _ => s' |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
273 |
end |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
274 |
|
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
275 |
fun nice_name (full_name, _) NONE = (full_name, NONE) |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
276 |
| nice_name (full_name, desired_name) (SOME the_pool) = |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
277 |
case Symtab.lookup (fst the_pool) full_name of |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
278 |
SOME nice_name => (nice_name, SOME the_pool) |
36222
0e3e49bd658d
don't use readable names if proof reconstruction is needed, because it uses the structure of names
blanchet
parents:
36221
diff
changeset
|
279 |
| NONE => add_nice_name full_name (readable_name full_name desired_name) 0 |
0e3e49bd658d
don't use readable names if proof reconstruction is needed, because it uses the structure of names
blanchet
parents:
36221
diff
changeset
|
280 |
the_pool |
36169
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
281 |
|> apsnd SOME |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
282 |
|
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
283 |
(**** Definitions and functions for FOL clauses, for conversion to TPTP or DFG |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
284 |
format ****) |
15347 | 285 |
|
21509
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
286 |
datatype kind = Axiom | Conjecture; |
23385 | 287 |
|
15347 | 288 |
type axiom_name = string; |
289 |
||
290 |
(**** Isabelle FOL clauses ****) |
|
291 |
||
36168
0a6ed065683d
give more sensible names to "fol_type" constructors, as requested by a FIXME comment
blanchet
parents:
36167
diff
changeset
|
292 |
datatype fol_type = |
36169
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
293 |
TyVar of name | |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
294 |
TyFree of name | |
27b1cc58715e
store nonmangled names along with mangled type names in Sledgehammer for debugging purposes
blanchet
parents:
36168
diff
changeset
|
295 |
TyConstr of name * fol_type list |
18402
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset
|
296 |
|
36170
0cdb76723c88
added original constant names to Sledgehammer internal terms + output short names if "debug" is set (for increased readability)
blanchet
parents:
36169
diff
changeset
|
297 |
fun string_of_fol_type (TyVar sp) pool = nice_name sp pool |
0cdb76723c88
added original constant names to Sledgehammer internal terms + output short names if "debug" is set (for increased readability)
blanchet
parents:
36169
diff
changeset
|
298 |
| string_of_fol_type (TyFree sp) pool = nice_name sp pool |
0cdb76723c88
added original constant names to Sledgehammer internal terms + output short names if "debug" is set (for increased readability)
blanchet
parents:
36169
diff
changeset
|
299 |
| string_of_fol_type (TyConstr (sp, tys)) pool = |
0cdb76723c88
added original constant names to Sledgehammer internal terms + output short names if "debug" is set (for increased readability)
blanchet
parents:
36169
diff
changeset
|
300 |
let |
0cdb76723c88
added original constant names to Sledgehammer internal terms + output short names if "debug" is set (for increased readability)
blanchet
parents:
36169
diff
changeset
|
301 |
val (s, pool) = nice_name sp pool |
0cdb76723c88
added original constant names to Sledgehammer internal terms + output short names if "debug" is set (for increased readability)
blanchet
parents:
36169
diff
changeset
|
302 |
val (ss, pool) = pool_map string_of_fol_type tys pool |
0cdb76723c88
added original constant names to Sledgehammer internal terms + output short names if "debug" is set (for increased readability)
blanchet
parents:
36169
diff
changeset
|
303 |
in (s ^ paren_pack ss, pool) end |
24310 | 304 |
|
18798 | 305 |
(*First string is the type class; the second is a TVar or TFfree*) |
306 |
datatype type_literal = LTVar of string * string | LTFree of string * string; |
|
15347 | 307 |
|
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
308 |
exception CLAUSE of string * term; |
15347 | 309 |
|
24310 | 310 |
(*Make literals for sorted type variables*) |
24940 | 311 |
fun sorts_on_typs_aux (_, []) = [] |
312 |
| sorts_on_typs_aux ((x,i), s::ss) = |
|
313 |
let val sorts = sorts_on_typs_aux ((x,i), ss) |
|
22643
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
314 |
in |
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
315 |
if s = "HOL.type" then sorts |
24940 | 316 |
else if i = ~1 then LTFree(make_type_class s, make_fixed_type_var x) :: sorts |
317 |
else LTVar(make_type_class s, make_schematic_type_var (x,i)) :: sorts |
|
22643
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
318 |
end; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
319 |
|
24940 | 320 |
fun sorts_on_typs (TFree (a,s)) = sorts_on_typs_aux ((a,~1),s) |
321 |
| sorts_on_typs (TVar (v,s)) = sorts_on_typs_aux (v,s); |
|
322 |
||
18798 | 323 |
fun pred_of_sort (LTVar (s,ty)) = (s,1) |
22643
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
324 |
| pred_of_sort (LTFree (s,ty)) = (s,1) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
325 |
|
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24322
diff
changeset
|
326 |
(*Given a list of sorted type variables, return a list of type literals.*) |
36218
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
327 |
fun add_typs Ts = fold (union (op =)) (map sorts_on_typs Ts) [] |
20015
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset
|
328 |
|
29676 | 329 |
(*The correct treatment of TFrees like 'a in lemmas (axiom clauses) is not clear. |
330 |
* Ignoring them leads to unsound proofs, since we do nothing to ensure that 'a |
|
331 |
in a lemma has the same sort as 'a in the conjecture. |
|
332 |
* Deleting such clauses will lead to problems with locales in other use of local results |
|
333 |
where 'a is fixed. Probably we should delete clauses unless the sorts agree. |
|
334 |
* Currently we include a class constraint in the clause, exactly as with TVars. |
|
335 |
*) |
|
336 |
||
20015
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset
|
337 |
(** make axiom and conjecture clauses. **) |
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset
|
338 |
|
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset
|
339 |
fun get_tvar_strs [] = [] |
24940 | 340 |
| get_tvar_strs ((TVar (indx,s))::Ts) = |
341 |
insert (op =) (make_schematic_type_var indx) (get_tvar_strs Ts) |
|
342 |
| get_tvar_strs((TFree _)::Ts) = get_tvar_strs Ts |
|
20015
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset
|
343 |
|
24310 | 344 |
|
19354 | 345 |
|
15347 | 346 |
(**** Isabelle arities ****) |
347 |
||
24310 | 348 |
datatype arLit = TConsLit of class * string * string list |
22643
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
349 |
| TVarLit of class * string; |
24310 | 350 |
|
35865 | 351 |
datatype arity_clause = |
24310 | 352 |
ArityClause of {axiom_name: axiom_name, |
353 |
conclLit: arLit, |
|
354 |
premLits: arLit list}; |
|
15347 | 355 |
|
356 |
||
18798 | 357 |
fun gen_TVars 0 = [] |
358 |
| gen_TVars n = ("T_" ^ Int.toString n) :: gen_TVars (n-1); |
|
15347 | 359 |
|
18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset
|
360 |
fun pack_sort(_,[]) = [] |
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset
|
361 |
| pack_sort(tvar, "HOL.type"::srt) = pack_sort(tvar, srt) (*IGNORE sort "type"*) |
22643
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
362 |
| pack_sort(tvar, cls::srt) = (cls, tvar) :: pack_sort(tvar, srt); |
24310 | 363 |
|
18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset
|
364 |
(*Arity of type constructor tcon :: (arg1,...,argN)res*) |
30151 | 365 |
fun make_axiom_arity_clause dfg (tcons, axiom_name, (cls,args)) = |
21560 | 366 |
let val tvars = gen_TVars (length args) |
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
367 |
val tvars_srts = ListPair.zip (tvars,args) |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
368 |
in |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24322
diff
changeset
|
369 |
ArityClause {axiom_name = axiom_name, |
30151 | 370 |
conclLit = TConsLit (cls, make_fixed_type_const dfg tcons, tvars), |
22643
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
371 |
premLits = map TVarLit (union_all(map pack_sort tvars_srts))} |
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
372 |
end; |
15347 | 373 |
|
374 |
||
375 |
(**** Isabelle class relations ****) |
|
376 |
||
35865 | 377 |
datatype classrel_clause = |
24310 | 378 |
ClassrelClause of {axiom_name: axiom_name, |
379 |
subclass: class, |
|
380 |
superclass: class}; |
|
381 |
||
21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset
|
382 |
(*Generate all pairs (sub,super) such that sub is a proper subclass of super in theory thy.*) |
21432
625797c592b2
Optimized class_pairs for the common case of no subclasses
paulson
parents:
21416
diff
changeset
|
383 |
fun class_pairs thy [] supers = [] |
625797c592b2
Optimized class_pairs for the common case of no subclasses
paulson
parents:
21416
diff
changeset
|
384 |
| class_pairs thy subs supers = |
36218
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
385 |
let |
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
386 |
val class_less = Sorts.class_less (Sign.classes_of thy) |
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
387 |
fun add_super sub super = class_less (sub, super) ? cons (sub, super) |
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
388 |
fun add_supers sub = fold (add_super sub) supers |
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
389 |
in fold add_supers subs [] end |
15347 | 390 |
|
35865 | 391 |
fun make_classrel_clause (sub,super) = |
21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset
|
392 |
ClassrelClause {axiom_name = clrelclause_prefix ^ ascii_of sub ^ "_" ^ ascii_of super, |
24310 | 393 |
subclass = make_type_class sub, |
21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset
|
394 |
superclass = make_type_class super}; |
15347 | 395 |
|
21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset
|
396 |
fun make_classrel_clauses thy subs supers = |
35865 | 397 |
map make_classrel_clause (class_pairs thy subs supers); |
18868 | 398 |
|
399 |
||
400 |
(** Isabelle arities **) |
|
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
401 |
|
30151 | 402 |
fun arity_clause dfg _ _ (tcons, []) = [] |
403 |
| arity_clause dfg seen n (tcons, ("HOL.type",_)::ars) = (*ignore*) |
|
404 |
arity_clause dfg seen n (tcons,ars) |
|
405 |
| arity_clause dfg seen n (tcons, (ar as (class,_)) :: ars) = |
|
21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset
|
406 |
if class mem_string seen then (*multiple arities for the same tycon, class pair*) |
30151 | 407 |
make_axiom_arity_clause dfg (tcons, lookup_type_const dfg tcons ^ "_" ^ class ^ "_" ^ Int.toString n, ar) :: |
408 |
arity_clause dfg seen (n+1) (tcons,ars) |
|
21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset
|
409 |
else |
30151 | 410 |
make_axiom_arity_clause dfg (tcons, lookup_type_const dfg tcons ^ "_" ^ class, ar) :: |
411 |
arity_clause dfg (class::seen) n (tcons,ars) |
|
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
412 |
|
30151 | 413 |
fun multi_arity_clause dfg [] = [] |
36218
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
414 |
| multi_arity_clause dfg ((tcons, ars) :: tc_arlists) = |
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
415 |
arity_clause dfg [] 1 (tcons, ars) @ multi_arity_clause dfg tc_arlists |
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
416 |
|
22643
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
417 |
(*Generate all pairs (tycon,class,sorts) such that tycon belongs to class in theory thy |
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
418 |
provided its arguments have the corresponding sorts.*) |
21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset
|
419 |
fun type_class_pairs thy tycons classes = |
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset
|
420 |
let val alg = Sign.classes_of thy |
36218
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
421 |
fun domain_sorts tycon = Sorts.mg_domain alg tycon o single |
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
422 |
fun add_class tycon class = |
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
423 |
cons (class, domain_sorts tycon class) |
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
424 |
handle Sorts.CLASS_ERROR _ => I |
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
425 |
fun try_classes tycon = (tycon, fold (add_class tycon) classes []) |
21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset
|
426 |
in map try_classes tycons end; |
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset
|
427 |
|
22643
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
428 |
(*Proving one (tycon, class) membership may require proving others, so iterate.*) |
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
429 |
fun iter_type_class_pairs thy tycons [] = ([], []) |
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
430 |
| iter_type_class_pairs thy tycons classes = |
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
431 |
let val cpairs = type_class_pairs thy tycons classes |
33040 | 432 |
val newclasses = union_all (union_all (union_all (map (map #2 o #2) cpairs))) |
433 |
|> subtract (op =) classes |> subtract (op =) HOLogic.typeS |
|
24310 | 434 |
val (classes', cpairs') = iter_type_class_pairs thy tycons newclasses |
33042 | 435 |
in (union (op =) classes' classes, union (op =) cpairs' cpairs) end; |
24310 | 436 |
|
30151 | 437 |
fun make_arity_clauses_dfg dfg thy tycons classes = |
24310 | 438 |
let val (classes', cpairs) = iter_type_class_pairs thy tycons classes |
30151 | 439 |
in (classes', multi_arity_clause dfg cpairs) end; |
440 |
val make_arity_clauses = make_arity_clauses_dfg false; |
|
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
441 |
|
18868 | 442 |
(**** Find occurrences of predicates in clauses ****) |
443 |
||
24310 | 444 |
(*FIXME: multiple-arity checking doesn't work, as update_new is the wrong |
18868 | 445 |
function (it flags repeated declarations of a function, even with the same arity)*) |
446 |
||
36218
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
447 |
fun update_many keypairs = fold Symtab.update keypairs |
18868 | 448 |
|
36218
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
449 |
val add_type_sort_preds = update_many o map pred_of_sort o sorts_on_typs |
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
450 |
|
36218
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
451 |
fun add_classrel_clause_preds (ClassrelClause {subclass, superclass, ...}) = |
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
452 |
Symtab.update (subclass, 1) #> Symtab.update (superclass, 1) |
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
453 |
|
22643
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
454 |
fun class_of_arityLit (TConsLit (tclass, _, _)) = tclass |
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
455 |
| class_of_arityLit (TVarLit (tclass, _)) = tclass; |
21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset
|
456 |
|
36218
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
457 |
fun add_arity_clause_preds (ArityClause {conclLit, premLits, ...}) = |
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
458 |
let |
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
459 |
val classes = map (make_type_class o class_of_arityLit) |
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
460 |
(conclLit :: premLits) |
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
461 |
in fold (Symtab.update o rpair 1) classes end; |
18868 | 462 |
|
463 |
(*** Find occurrences of functions in clauses ***) |
|
464 |
||
36218
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
465 |
fun add_fol_type_funcs (TyVar _) = I |
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
466 |
| add_fol_type_funcs (TyFree (s, _)) = Symtab.update (s, 0) |
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
467 |
| add_fol_type_funcs (TyConstr ((s, _), tys)) = |
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
468 |
Symtab.update (s, length tys) #> fold add_fol_type_funcs tys |
18868 | 469 |
|
20038 | 470 |
(*TFrees are recorded as constants*) |
24940 | 471 |
fun add_type_sort_funcs (TVar _, funcs) = funcs |
472 |
| add_type_sort_funcs (TFree (a, _), funcs) = |
|
20038 | 473 |
Symtab.update (make_fixed_type_var a, 0) funcs |
474 |
||
36218
0e4a01f3e7d3
get rid of "List.foldl" + add timestamp to SPASS
blanchet
parents:
36170
diff
changeset
|
475 |
fun add_arity_clause_funcs (ArityClause {conclLit,...}) funcs = |
22643
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
476 |
let val TConsLit (_, tcons, tvars) = conclLit |
18868 | 477 |
in Symtab.update (tcons, length tvars) funcs end; |
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
478 |
|
23075 | 479 |
(*This type can be overlooked because it is built-in...*) |
480 |
val init_functab = Symtab.update ("tc_itself", 1) Symtab.empty; |
|
481 |
||
18868 | 482 |
|
483 |
(**** String-oriented operations ****) |
|
15347 | 484 |
|
24310 | 485 |
fun string_of_clausename (cls_id,ax_name) = |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
486 |
clause_prefix ^ ascii_of ax_name ^ "_" ^ Int.toString cls_id; |
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
487 |
|
24310 | 488 |
fun string_of_type_clsname (cls_id,ax_name,idx) = |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
489 |
string_of_clausename (cls_id,ax_name) ^ "_tcs" ^ (Int.toString idx); |
18863 | 490 |
|
24310 | 491 |
|
18868 | 492 |
(**** Producing DFG files ****) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
493 |
|
18863 | 494 |
(*Attach sign in DFG syntax: false means negate.*) |
495 |
fun dfg_sign true s = s |
|
24310 | 496 |
| dfg_sign false s = "not(" ^ s ^ ")" |
18863 | 497 |
|
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24322
diff
changeset
|
498 |
fun dfg_of_typeLit pos (LTVar (s,ty)) = dfg_sign pos (s ^ "(" ^ ty ^ ")") |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24322
diff
changeset
|
499 |
| dfg_of_typeLit pos (LTFree (s,ty)) = dfg_sign pos (s ^ "(" ^ ty ^ ")"); |
24310 | 500 |
|
18868 | 501 |
(*Enclose the clause body by quantifiers, if necessary*) |
24310 | 502 |
fun dfg_forall [] body = body |
18868 | 503 |
| dfg_forall vars body = "forall([" ^ commas vars ^ "],\n" ^ body ^ ")" |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
504 |
|
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24322
diff
changeset
|
505 |
fun gen_dfg_cls (cls_id, ax_name, Axiom, lits, tylits, vars) = |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24322
diff
changeset
|
506 |
"clause( %(axiom)\n" ^ |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24322
diff
changeset
|
507 |
dfg_forall vars ("or(" ^ commas (tylits@lits) ^ ")") ^ ",\n" ^ |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24322
diff
changeset
|
508 |
string_of_clausename (cls_id,ax_name) ^ ").\n\n" |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24322
diff
changeset
|
509 |
| gen_dfg_cls (cls_id, ax_name, Conjecture, lits, _, vars) = |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24322
diff
changeset
|
510 |
"clause( %(negated_conjecture)\n" ^ |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24322
diff
changeset
|
511 |
dfg_forall vars ("or(" ^ commas lits ^ ")") ^ ",\n" ^ |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24322
diff
changeset
|
512 |
string_of_clausename (cls_id,ax_name) ^ ").\n\n"; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
513 |
|
18798 | 514 |
fun string_of_arity (name, num) = "(" ^ name ^ "," ^ Int.toString num ^ ")" |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
515 |
|
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
516 |
fun string_of_preds [] = "" |
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
517 |
| string_of_preds preds = "predicates[" ^ commas(map string_of_arity preds) ^ "].\n"; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
518 |
|
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
519 |
fun string_of_funcs [] = "" |
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
520 |
| string_of_funcs funcs = "functions[" ^ commas(map string_of_arity funcs) ^ "].\n" ; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
521 |
|
24310 | 522 |
fun string_of_symbols predstr funcstr = |
17234 | 523 |
"list_of_symbols.\n" ^ predstr ^ funcstr ^ "end_of_list.\n\n"; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
524 |
|
18798 | 525 |
fun string_of_start name = "begin_problem(" ^ name ^ ").\n\n"; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
526 |
|
24310 | 527 |
fun string_of_descrip name = |
528 |
"list_of_descriptions.\nname({*" ^ name ^ |
|
18868 | 529 |
"*}).\nauthor({*Isabelle*}).\nstatus(unknown).\ndescription({*auto-generated*}).\nend_of_list.\n\n" |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
530 |
|
18863 | 531 |
fun dfg_tfree_clause tfree_lit = |
21509
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
532 |
"clause( %(negated_conjecture)\n" ^ "or( " ^ tfree_lit ^ "),\n" ^ "tfree_tcs" ^ ").\n\n" |
18863 | 533 |
|
22643
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
534 |
fun dfg_of_arLit (TConsLit (c,t,args)) = |
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
535 |
dfg_sign true (make_type_class c ^ "(" ^ t ^ paren_pack args ^ ")") |
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
536 |
| dfg_of_arLit (TVarLit (c,str)) = |
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
537 |
dfg_sign false (make_type_class c ^ "(" ^ str ^ ")") |
24310 | 538 |
|
20038 | 539 |
fun dfg_classrelLits sub sup = "not(" ^ sub ^ "(T)), " ^ sup ^ "(T)"; |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
540 |
|
35865 | 541 |
fun dfg_classrel_clause (ClassrelClause {axiom_name,subclass,superclass,...}) = |
18868 | 542 |
"clause(forall([T],\nor( " ^ dfg_classrelLits subclass superclass ^ ")),\n" ^ |
543 |
axiom_name ^ ").\n\n"; |
|
24310 | 544 |
|
21560 | 545 |
fun string_of_ar axiom_name = arclause_prefix ^ ascii_of axiom_name; |
546 |
||
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24322
diff
changeset
|
547 |
fun dfg_arity_clause (ArityClause{axiom_name,conclLit,premLits,...}) = |
22643
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
548 |
let val TConsLit (_,_,tvars) = conclLit |
18868 | 549 |
val lits = map dfg_of_arLit (conclLit :: premLits) |
18863 | 550 |
in |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24322
diff
changeset
|
551 |
"clause( %(axiom)\n" ^ |
18868 | 552 |
dfg_forall tvars ("or( " ^ commas lits ^ ")") ^ ",\n" ^ |
21560 | 553 |
string_of_ar axiom_name ^ ").\n\n" |
18863 | 554 |
end; |
555 |
||
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
556 |
|
18869
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset
|
557 |
(**** Produce TPTP files ****) |
18868 | 558 |
|
21509
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
559 |
fun tptp_sign true s = s |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
560 |
| tptp_sign false s = "~ " ^ s |
18868 | 561 |
|
36167
c1a35be8e476
make Sledgehammer's output more debugging friendly
blanchet
parents:
36063
diff
changeset
|
562 |
fun tptp_of_typeLit pos (LTVar (s, ty)) = tptp_sign pos (s ^ "(" ^ ty ^ ")") |
c1a35be8e476
make Sledgehammer's output more debugging friendly
blanchet
parents:
36063
diff
changeset
|
563 |
| tptp_of_typeLit pos (LTFree (s, ty)) = tptp_sign pos (s ^ "(" ^ ty ^ ")") |
c1a35be8e476
make Sledgehammer's output more debugging friendly
blanchet
parents:
36063
diff
changeset
|
564 |
|
c1a35be8e476
make Sledgehammer's output more debugging friendly
blanchet
parents:
36063
diff
changeset
|
565 |
fun tptp_cnf name kind formula = |
c1a35be8e476
make Sledgehammer's output more debugging friendly
blanchet
parents:
36063
diff
changeset
|
566 |
"cnf(" ^ name ^ ", " ^ kind ^ ",\n " ^ formula ^ ").\n" |
24310 | 567 |
|
36167
c1a35be8e476
make Sledgehammer's output more debugging friendly
blanchet
parents:
36063
diff
changeset
|
568 |
fun gen_tptp_cls (cls_id, ax_name, Axiom, lits, tylits) = |
c1a35be8e476
make Sledgehammer's output more debugging friendly
blanchet
parents:
36063
diff
changeset
|
569 |
tptp_cnf (string_of_clausename (cls_id, ax_name)) "axiom" |
c1a35be8e476
make Sledgehammer's output more debugging friendly
blanchet
parents:
36063
diff
changeset
|
570 |
(tptp_pack (tylits @ lits)) |
c1a35be8e476
make Sledgehammer's output more debugging friendly
blanchet
parents:
36063
diff
changeset
|
571 |
| gen_tptp_cls (cls_id, ax_name, Conjecture, lits, _) = |
c1a35be8e476
make Sledgehammer's output more debugging friendly
blanchet
parents:
36063
diff
changeset
|
572 |
tptp_cnf (string_of_clausename (cls_id, ax_name)) "negated_conjecture" |
c1a35be8e476
make Sledgehammer's output more debugging friendly
blanchet
parents:
36063
diff
changeset
|
573 |
(tptp_pack lits) |
15347 | 574 |
|
18863 | 575 |
fun tptp_tfree_clause tfree_lit = |
36167
c1a35be8e476
make Sledgehammer's output more debugging friendly
blanchet
parents:
36063
diff
changeset
|
576 |
tptp_cnf "tfree_tcs" "negated_conjecture" (tptp_pack [tfree_lit]) |
24310 | 577 |
|
22643
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
578 |
fun tptp_of_arLit (TConsLit (c,t,args)) = |
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
579 |
tptp_sign true (make_type_class c ^ "(" ^ t ^ paren_pack args ^ ")") |
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
580 |
| tptp_of_arLit (TVarLit (c,str)) = |
bc3bb8e9594a
Improved and simplified the treatment of classrel/arity clauses
paulson
parents:
22383
diff
changeset
|
581 |
tptp_sign false (make_type_class c ^ "(" ^ str ^ ")") |
24310 | 582 |
|
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24322
diff
changeset
|
583 |
fun tptp_arity_clause (ArityClause{axiom_name,conclLit,premLits,...}) = |
36167
c1a35be8e476
make Sledgehammer's output more debugging friendly
blanchet
parents:
36063
diff
changeset
|
584 |
tptp_cnf (string_of_ar axiom_name) "axiom" |
c1a35be8e476
make Sledgehammer's output more debugging friendly
blanchet
parents:
36063
diff
changeset
|
585 |
(tptp_pack (map tptp_of_arLit (conclLit :: premLits))) |
15347 | 586 |
|
24310 | 587 |
fun tptp_classrelLits sub sup = |
21509
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
588 |
let val tvar = "(T)" |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
589 |
in tptp_pack [tptp_sign false (sub^tvar), tptp_sign true (sup^tvar)] end; |
15347 | 590 |
|
35865 | 591 |
fun tptp_classrel_clause (ClassrelClause {axiom_name,subclass,superclass,...}) = |
36167
c1a35be8e476
make Sledgehammer's output more debugging friendly
blanchet
parents:
36063
diff
changeset
|
592 |
tptp_cnf axiom_name "axiom" (tptp_classrelLits subclass superclass) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
593 |
|
15347 | 594 |
end; |