author | paulson |
Tue, 13 Dec 2005 15:34:02 +0100 | |
changeset 18390 | aaecdaef4c04 |
parent 18275 | 86cefba6d325 |
child 18402 | aaba095cf62b |
permissions | -rw-r--r-- |
15347 | 1 |
(* Author: Jia Meng, Cambridge University Computer Laboratory |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
2 |
|
15347 | 3 |
ID: $Id$ |
4 |
Copyright 2004 University of Cambridge |
|
5 |
||
6 |
ML data structure for storing/printing FOL clauses and arity clauses. |
|
7 |
Typed equality is treated differently. |
|
8 |
*) |
|
9 |
||
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
10 |
(* works for writeoutclasimp on typed *) |
15347 | 11 |
signature RES_CLAUSE = |
12 |
sig |
|
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
13 |
val keep_types : bool ref |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
14 |
val special_equal : bool ref |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
15 |
val tagged : bool ref |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
16 |
|
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
17 |
exception ARCLAUSE of string |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
18 |
exception CLAUSE of string * term |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
19 |
type arityClause |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
20 |
type classrelClause |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
21 |
type clause |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
22 |
val init : theory -> unit |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
23 |
val make_axiom_clause : Term.term -> string * int -> clause |
17888 | 24 |
val make_conjecture_clauses : term list -> clause list |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
25 |
val get_axiomName : clause -> string |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
26 |
val isTaut : clause -> bool |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
27 |
val num_of_clauses : clause -> int |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
28 |
|
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
29 |
val clause2dfg : clause -> string * string list |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
30 |
val clauses2dfg : clause list -> string -> clause list -> clause list -> |
17422 | 31 |
(string * int) list -> (string * int) list -> string |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
32 |
val tfree_dfg_clause : string -> string |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
33 |
|
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
34 |
val arity_clause_thy: theory -> arityClause list |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
35 |
val classrel_clauses_thy: theory -> classrelClause list |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
36 |
|
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
37 |
val tptp_arity_clause : arityClause -> string |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
38 |
val tptp_classrelClause : classrelClause -> string |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
39 |
val tptp_clause : clause -> string list |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
40 |
val clause2tptp : clause -> string * string list |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
41 |
val tfree_clause : string -> string |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
42 |
val schematic_var_prefix : string |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
43 |
val fixed_var_prefix : string |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
44 |
val tvar_prefix : string |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
45 |
val tfree_prefix : string |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
46 |
val clause_prefix : string |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
47 |
val arclause_prefix : string |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
48 |
val const_prefix : string |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
49 |
val tconst_prefix : string |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
50 |
val class_prefix : string |
17908
ac97527724ba
More functions are added to the signature of ResClause
mengj
parents:
17888
diff
changeset
|
51 |
|
ac97527724ba
More functions are added to the signature of ResClause
mengj
parents:
17888
diff
changeset
|
52 |
val union_all : ''a list list -> ''a list |
ac97527724ba
More functions are added to the signature of ResClause
mengj
parents:
17888
diff
changeset
|
53 |
val ascii_of : String.string -> String.string |
ac97527724ba
More functions are added to the signature of ResClause
mengj
parents:
17888
diff
changeset
|
54 |
val paren_pack : string list -> string |
ac97527724ba
More functions are added to the signature of ResClause
mengj
parents:
17888
diff
changeset
|
55 |
val bracket_pack : string list -> string |
ac97527724ba
More functions are added to the signature of ResClause
mengj
parents:
17888
diff
changeset
|
56 |
val make_schematic_var : String.string * int -> string |
ac97527724ba
More functions are added to the signature of ResClause
mengj
parents:
17888
diff
changeset
|
57 |
val make_fixed_var : String.string -> string |
ac97527724ba
More functions are added to the signature of ResClause
mengj
parents:
17888
diff
changeset
|
58 |
val make_schematic_type_var : string * int -> string |
ac97527724ba
More functions are added to the signature of ResClause
mengj
parents:
17888
diff
changeset
|
59 |
val make_fixed_type_var : string -> string |
ac97527724ba
More functions are added to the signature of ResClause
mengj
parents:
17888
diff
changeset
|
60 |
val make_fixed_const : String.string -> string |
ac97527724ba
More functions are added to the signature of ResClause
mengj
parents:
17888
diff
changeset
|
61 |
val make_fixed_type_const : String.string -> string |
ac97527724ba
More functions are added to the signature of ResClause
mengj
parents:
17888
diff
changeset
|
62 |
val make_type_class : String.string -> string |
17999 | 63 |
val isMeta : String.string -> bool |
64 |
||
65 |
type typ_var |
|
66 |
val mk_typ_var_sort : Term.typ -> typ_var * sort |
|
67 |
type type_literal |
|
68 |
val add_typs_aux2 : (typ_var * string list) list -> type_literal list * type_literal list |
|
69 |
val gen_tptp_cls : int * string * string * string -> string |
|
70 |
val gen_tptp_type_cls : int * string * string * string * int -> string |
|
71 |
val tptp_of_typeLit : type_literal -> string |
|
18275 | 72 |
|
15347 | 73 |
end; |
74 |
||
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
75 |
structure ResClause: RES_CLAUSE = |
15347 | 76 |
struct |
77 |
||
78 |
(* Added for typed equality *) |
|
79 |
val special_equal = ref false; (* by default,equality does not carry type information *) |
|
80 |
val eq_typ_wrapper = "typeinfo"; (* default string *) |
|
81 |
||
82 |
||
83 |
val schematic_var_prefix = "V_"; |
|
84 |
val fixed_var_prefix = "v_"; |
|
85 |
||
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
86 |
val tvar_prefix = "T_"; |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
87 |
val tfree_prefix = "t_"; |
15347 | 88 |
|
89 |
val clause_prefix = "cls_"; |
|
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
90 |
val arclause_prefix = "clsarity_" |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
91 |
val clrelclause_prefix = "clsrel_"; |
15347 | 92 |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
93 |
val const_prefix = "c_"; |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
94 |
val tconst_prefix = "tc_"; |
15347 | 95 |
|
16199
ee95ab217fee
no longer emits literals for type class HOL.type; also minor tidying
paulson
parents:
16039
diff
changeset
|
96 |
val class_prefix = "class_"; |
15347 | 97 |
|
98 |
||
17775 | 99 |
fun union_all xss = foldl (op union) [] xss; |
100 |
||
15347 | 101 |
|
17775 | 102 |
(*Provide readable names for the more common symbolic functions*) |
15347 | 103 |
val const_trans_table = |
104 |
Symtab.make [("op =", "equal"), |
|
105 |
("op <=", "lessequals"), |
|
106 |
("op <", "less"), |
|
107 |
("op &", "and"), |
|
108 |
("op |", "or"), |
|
17375 | 109 |
("op +", "plus"), |
110 |
("op -", "minus"), |
|
111 |
("op *", "times"), |
|
15347 | 112 |
("op -->", "implies"), |
17375 | 113 |
("{}", "emptyset"), |
15347 | 114 |
("op :", "in"), |
115 |
("op Un", "union"), |
|
18390 | 116 |
("op Int", "inter"), |
117 |
("List.op @", "append")]; |
|
15347 | 118 |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
119 |
val type_const_trans_table = |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
120 |
Symtab.make [("*", "t_prod"), |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
121 |
("+", "t_sum"), |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
122 |
("~=>", "t_map")]; |
15347 | 123 |
|
15610 | 124 |
(*Escaping of special characters. |
125 |
Alphanumeric characters are left unchanged. |
|
126 |
The character _ goes to __ |
|
127 |
Characters in the range ASCII space to / go to _A to _P, respectively. |
|
128 |
Other printing characters go to _NNN where NNN is the decimal ASCII code.*) |
|
129 |
local |
|
130 |
||
131 |
val A_minus_space = Char.ord #"A" - Char.ord #" "; |
|
132 |
||
15347 | 133 |
fun ascii_of_c c = |
15610 | 134 |
if Char.isAlphaNum c then String.str c |
135 |
else if c = #"_" then "__" |
|
136 |
else if #" " <= c andalso c <= #"/" |
|
137 |
then "_" ^ String.str (Char.chr (Char.ord c + A_minus_space)) |
|
138 |
else if Char.isPrint c then ("_" ^ Int.toString (Char.ord c)) |
|
139 |
else "" |
|
15347 | 140 |
|
15610 | 141 |
in |
142 |
||
143 |
val ascii_of = String.translate ascii_of_c; |
|
144 |
||
145 |
end; |
|
15347 | 146 |
|
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
147 |
(* 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
|
148 |
fun paren_pack [] = "" (*empty argument list*) |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
149 |
| paren_pack strings = "(" ^ commas strings ^ ")"; |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
150 |
|
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
151 |
fun bracket_pack strings = "[" ^ commas strings ^ "]"; |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
152 |
|
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
153 |
|
16925
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
154 |
(*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
|
155 |
fun trim_type_var s = |
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
156 |
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
|
157 |
else error ("trim_type: Malformed type variable encountered: " ^ s); |
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
158 |
|
16903 | 159 |
fun ascii_of_indexname (v,0) = ascii_of v |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
160 |
| ascii_of_indexname (v,i) = ascii_of v ^ "_" ^ Int.toString i; |
15347 | 161 |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
162 |
fun make_schematic_var v = schematic_var_prefix ^ (ascii_of_indexname v); |
15347 | 163 |
fun make_fixed_var x = fixed_var_prefix ^ (ascii_of x); |
164 |
||
16925
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
165 |
fun make_schematic_type_var (x,i) = |
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
166 |
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
|
167 |
fun make_fixed_type_var x = tfree_prefix ^ (ascii_of (trim_type_var x)); |
15347 | 168 |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
169 |
fun make_fixed_const c = |
17412 | 170 |
case Symtab.lookup const_trans_table c of |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
171 |
SOME c' => c' |
17261 | 172 |
| NONE => const_prefix ^ ascii_of c; |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
173 |
|
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
174 |
fun make_fixed_type_const c = |
17412 | 175 |
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
|
176 |
SOME c' => c' |
17261 | 177 |
| NONE => tconst_prefix ^ ascii_of c; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
178 |
|
17261 | 179 |
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
|
180 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
181 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
182 |
|
15347 | 183 |
(***** definitions and functions for FOL clauses, prepared for conversion into TPTP format or SPASS format. *****) |
184 |
||
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
185 |
val keep_types = ref true; |
15347 | 186 |
|
187 |
datatype kind = Axiom | Hypothesis | Conjecture; |
|
188 |
fun name_of_kind Axiom = "axiom" |
|
189 |
| name_of_kind Hypothesis = "hypothesis" |
|
190 |
| name_of_kind Conjecture = "conjecture"; |
|
191 |
||
192 |
type clause_id = int; |
|
193 |
type axiom_name = string; |
|
194 |
||
195 |
||
196 |
type polarity = bool; |
|
197 |
||
198 |
type indexname = Term.indexname; |
|
199 |
||
200 |
||
201 |
(* "tag" is used for vampire specific syntax *) |
|
202 |
type tag = bool; |
|
203 |
||
204 |
||
205 |
(**** Isabelle FOL clauses ****) |
|
206 |
||
207 |
val tagged = ref false; |
|
208 |
||
209 |
type pred_name = string; |
|
210 |
type sort = Term.sort; |
|
211 |
type fol_type = string; |
|
212 |
||
213 |
datatype type_literal = LTVar of string | LTFree of string; |
|
214 |
||
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
215 |
datatype folTerm = UVar of string * fol_type |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
216 |
| Fun of string * fol_type list * folTerm list; |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
217 |
datatype predicate = Predicate of pred_name * fol_type list * folTerm list; |
15347 | 218 |
|
219 |
datatype literal = Literal of polarity * predicate * tag; |
|
220 |
||
221 |
datatype typ_var = FOLTVar of indexname | FOLTFree of string; |
|
222 |
||
17999 | 223 |
fun mk_typ_var_sort (TFree(a,s)) = (FOLTFree a,s) |
224 |
| mk_typ_var_sort (TVar(v,s)) = (FOLTVar v,s); |
|
225 |
||
226 |
||
15347 | 227 |
|
228 |
(* ML datatype used to repsent one single clause: disjunction of literals. *) |
|
229 |
datatype clause = |
|
230 |
Clause of {clause_id: clause_id, |
|
231 |
axiom_name: axiom_name, |
|
232 |
kind: kind, |
|
233 |
literals: literal list, |
|
234 |
types_sorts: (typ_var * sort) list, |
|
235 |
tvar_type_literals: type_literal list, |
|
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
236 |
tfree_type_literals: type_literal list , |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
237 |
tvars: string list, |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
238 |
predicates: (string*int) list, |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
239 |
functions: (string*int) list}; |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
240 |
|
15347 | 241 |
|
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
242 |
exception CLAUSE of string * term; |
15347 | 243 |
|
244 |
||
245 |
(*** make clauses ***) |
|
246 |
||
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
247 |
fun isFalse (Literal (pol,Predicate(a,_,[]),_)) = |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
248 |
(pol andalso a = "c_False") orelse |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
249 |
(not pol andalso a = "c_True") |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
250 |
| isFalse _ = false; |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
251 |
|
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
252 |
fun isTrue (Literal (pol,Predicate(a,_,[]),_)) = |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
253 |
(pol andalso a = "c_True") orelse |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
254 |
(not pol andalso a = "c_False") |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
255 |
| isTrue _ = false; |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
256 |
|
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
257 |
fun isTaut (Clause {literals,...}) = exists isTrue literals; |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
258 |
|
17234 | 259 |
fun make_clause (clause_id,axiom_name,kind,literals, |
260 |
types_sorts,tvar_type_literals, |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
261 |
tfree_type_literals,tvars, predicates, functions) = |
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
262 |
if forall isFalse literals |
17234 | 263 |
then error "Problem too trivial for resolution (empty clause)" |
264 |
else |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
265 |
Clause {clause_id = clause_id, axiom_name = axiom_name, kind = kind, |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
266 |
literals = literals, types_sorts = types_sorts, |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
267 |
tvar_type_literals = tvar_type_literals, |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
268 |
tfree_type_literals = tfree_type_literals, |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
269 |
tvars = tvars, predicates = predicates, |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
270 |
functions = functions}; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
271 |
|
15347 | 272 |
|
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
273 |
(** Some Clause destructor functions **) |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
274 |
|
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
275 |
fun string_of_kind (Clause cls) = name_of_kind (#kind cls); |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
276 |
|
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
277 |
fun get_axiomName (Clause cls) = #axiom_name cls; |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
278 |
|
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
279 |
fun get_clause_id (Clause cls) = #clause_id cls; |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
280 |
|
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
281 |
fun funcs_of_cls (Clause cls) = #functions cls; |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
282 |
|
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
283 |
fun preds_of_cls (Clause cls) = #predicates cls; |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
284 |
|
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
285 |
|
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
286 |
(*Declarations of the current theory--to allow suppressing types.*) |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
287 |
val const_typargs = ref (Library.K [] : (string*typ -> typ list)); |
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
288 |
|
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
289 |
fun num_typargs(s,T) = if !keep_types then length (!const_typargs (s,T)) else 0; |
16925
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
290 |
|
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
291 |
(*Initialize the type suppression mechanism with the current theory before |
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
292 |
producing any clauses!*) |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
293 |
fun init thy = (const_typargs := Sign.const_typargs thy); |
16925
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
294 |
|
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
295 |
|
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
296 |
(*Flatten a type to a string while accumulating sort constraints on the TFrees and |
16925
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
297 |
TVars it contains.*) |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
298 |
fun type_of (Type (a, Ts)) = |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
299 |
let val (folTyps, (ts, funcs)) = types_of Ts |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
300 |
val t = make_fixed_type_const a |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
301 |
in |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
302 |
((t ^ paren_pack folTyps), (ts, (t, length Ts)::funcs)) |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
303 |
end |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
304 |
| type_of (TFree (a,s)) = |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
305 |
let val t = make_fixed_type_var a |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
306 |
in (t, ([((FOLTFree a),s)], [(t,0)])) end |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
307 |
| type_of (TVar (v, s)) = (make_schematic_type_var v, ([((FOLTVar v),s)], [])) |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
308 |
and types_of Ts = |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
309 |
let val foltyps_ts = map type_of Ts |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
310 |
val (folTyps,ts_funcs) = ListPair.unzip foltyps_ts |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
311 |
val (ts, funcslist) = ListPair.unzip ts_funcs |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
312 |
in |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
313 |
(folTyps, (union_all ts, union_all funcslist)) |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
314 |
end; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
315 |
|
15390 | 316 |
|
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
317 |
fun const_types_of (c,T) = types_of (!const_typargs (c,T)); |
16925
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
318 |
|
16903 | 319 |
(* Any variables created via the METAHYPS tactical should be treated as |
320 |
universal vars, although it is represented as "Free(...)" by Isabelle *) |
|
321 |
val isMeta = String.isPrefix "METAHYP1_" |
|
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
322 |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
323 |
fun pred_name_type (Const(c,T)) = |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
324 |
let val (contys,(folTyps,funcs)) = const_types_of (c,T) |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
325 |
in (make_fixed_const c, (contys,folTyps), funcs) end |
15390 | 326 |
| pred_name_type (Free(x,T)) = |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
327 |
if isMeta x then raise CLAUSE("Predicate Not First Order 1", Free(x,T)) |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
328 |
else (make_fixed_var x, ([],[]), []) |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
329 |
| pred_name_type (v as Var _) = raise CLAUSE("Predicate Not First Order 2", v) |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
330 |
| pred_name_type t = raise CLAUSE("Predicate input unexpected", t); |
15347 | 331 |
|
15615 | 332 |
|
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
333 |
(* For typed equality *) |
15615 | 334 |
(* here "arg_typ" is the type of "="'s argument's type, not the type of the equality *) |
335 |
(* Find type of equality arg *) |
|
336 |
fun eq_arg_type (Type("fun",[T,_])) = |
|
337 |
let val (folT,_) = type_of T; |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
338 |
in folT end; |
15347 | 339 |
|
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
340 |
fun fun_name_type (Const("op =",T)) args = (*FIXME: Is this special treatment of = needed??*) |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
341 |
let val t = make_fixed_const "op =" |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
342 |
in (t, ([eq_arg_type T], []), [(t,2)]) end |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
343 |
| fun_name_type (Const(c,T)) args = |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
344 |
let val t = make_fixed_const c |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
345 |
val (contys, (folTyps,funcs)) = const_types_of (c,T) |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
346 |
val arity = num_typargs(c,T) + length args |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
347 |
in |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
348 |
(t, (contys,folTyps), ((t,arity)::funcs)) |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
349 |
end |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
350 |
| fun_name_type (Free(x,T)) args = |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
351 |
let val t = make_fixed_var x |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
352 |
in (t, ([],[]), [(t, length args)]) end |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
353 |
| fun_name_type f args = raise CLAUSE("Function Not First Order 1", f); |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
354 |
|
15615 | 355 |
|
15347 | 356 |
fun term_of (Var(ind_nm,T)) = |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
357 |
let val (folType,(ts,funcs)) = type_of T |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
358 |
in |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
359 |
(UVar(make_schematic_var ind_nm, folType), (ts, funcs)) |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
360 |
end |
15347 | 361 |
| term_of (Free(x,T)) = |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
362 |
let val (folType, (ts,funcs)) = type_of T |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
363 |
in |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
364 |
if isMeta x then (UVar(make_schematic_var(x,0),folType), |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
365 |
(ts, ((make_schematic_var(x,0)),0)::funcs)) |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
366 |
else |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
367 |
(Fun(make_fixed_var x, [folType], []), |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
368 |
(ts, ((make_fixed_var x),0)::funcs)) |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
369 |
end |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
370 |
| term_of (Const(c,T)) = (* impossible to be equality *) |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
371 |
let val (contys, (folTyps,funcs)) = const_types_of (c,T) |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
372 |
in |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
373 |
(Fun(make_fixed_const c, contys, []), |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
374 |
(folTyps, ((make_fixed_const c),0)::funcs)) |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
375 |
end |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
376 |
| term_of app = |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
377 |
let val (f,args) = strip_comb app |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
378 |
val _ = case f of Const(_,_) => () |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
379 |
| Free(s,_) => |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
380 |
if isMeta s |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
381 |
then raise CLAUSE("Function Not First Order 2", f) |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
382 |
else () |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
383 |
| _ => raise CLAUSE("Function Not First Order 3", f); |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
384 |
val (funName,(contys,ts1),funcs) = fun_name_type f args |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
385 |
val (args',(ts2,funcs')) = terms_of args |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
386 |
in |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
387 |
(Fun(funName,contys,args'), |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
388 |
(union_all (ts1::ts2), |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
389 |
union_all(funcs::funcs'))) |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
390 |
end |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
391 |
| term_of t = raise CLAUSE("Function Not First Order 4", t) |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
392 |
and terms_of ts = |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
393 |
let val (args, ts_funcs) = ListPair.unzip (map term_of ts) |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
394 |
in |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
395 |
(args, ListPair.unzip ts_funcs) |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
396 |
end |
15390 | 397 |
|
15347 | 398 |
|
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
399 |
fun pred_of (Const("op =", typ), args) = |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
400 |
let val arg_typ = eq_arg_type typ |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
401 |
val (args',(ts,funcs)) = terms_of args |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
402 |
val equal_name = make_fixed_const "op =" |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
403 |
in |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
404 |
(Predicate(equal_name,[arg_typ],args'), |
17775 | 405 |
union_all ts, |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
406 |
[((make_fixed_var equal_name), 2)], |
17775 | 407 |
union_all funcs) |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
408 |
end |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
409 |
| pred_of (pred,args) = |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
410 |
let val (predName,(predType,ts1), pfuncs) = pred_name_type pred |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
411 |
val (args',(ts2,ffuncs)) = terms_of args |
17775 | 412 |
val ts3 = union_all (ts1::ts2) |
413 |
val ffuncs' = union_all ffuncs |
|
17888 | 414 |
val newfuncs = pfuncs union ffuncs' |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
415 |
val arity = |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
416 |
case pred of |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
417 |
Const (c,T) => num_typargs(c,T) + length args |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
418 |
| _ => length args |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
419 |
in |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
420 |
(Predicate(predName,predType,args'), ts3, |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
421 |
[(predName, arity)], newfuncs) |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
422 |
end; |
15347 | 423 |
|
424 |
||
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
425 |
(*Treatment of literals, possibly negated or tagged*) |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
426 |
fun predicate_of ((Const("Not",_) $ P), polarity, tag) = |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
427 |
predicate_of (P, not polarity, tag) |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
428 |
| predicate_of ((Const("HOL.tag",_) $ P), polarity, tag) = |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
429 |
predicate_of (P, polarity, true) |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
430 |
| predicate_of (term,polarity,tag) = |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
431 |
(pred_of (strip_comb term), polarity, tag); |
15347 | 432 |
|
17888 | 433 |
fun literals_of_term1 args (Const("Trueprop",_) $ P) = literals_of_term1 args P |
434 |
| literals_of_term1 (args as (lits, ts, preds, funcs)) (Const("op |",_) $ P $ Q) = |
|
435 |
let val (lits', ts', preds', funcs') = literals_of_term1 args P |
|
17234 | 436 |
in |
17888 | 437 |
literals_of_term1 (lits', ts', preds' union preds, funcs' union funcs) Q |
17234 | 438 |
end |
17888 | 439 |
| literals_of_term1 (lits, ts, preds, funcs) P = |
440 |
let val ((pred, ts', preds', funcs'), pol, tag) = predicate_of (P,true,false) |
|
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
441 |
val lits' = Literal(pol,pred,tag) :: lits |
17234 | 442 |
in |
17888 | 443 |
(lits', ts union ts', preds' union preds, funcs' union funcs) |
17234 | 444 |
end; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
445 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
446 |
|
17888 | 447 |
val literals_of_term = literals_of_term1 ([],[],[],[]); |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
448 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
449 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
450 |
(* FIX: not sure what to do with these funcs *) |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
451 |
|
16199
ee95ab217fee
no longer emits literals for type class HOL.type; also minor tidying
paulson
parents:
16039
diff
changeset
|
452 |
(*Make literals for sorted type variables*) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
453 |
fun sorts_on_typs (_, []) = ([]) |
16199
ee95ab217fee
no longer emits literals for type class HOL.type; also minor tidying
paulson
parents:
16039
diff
changeset
|
454 |
| sorts_on_typs (v, "HOL.type" :: s) = |
ee95ab217fee
no longer emits literals for type class HOL.type; also minor tidying
paulson
parents:
16039
diff
changeset
|
455 |
sorts_on_typs (v,s) (*Ignore sort "type"*) |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
456 |
| sorts_on_typs ((FOLTVar indx), (s::ss)) = |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
457 |
LTVar((make_type_class s) ^ |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
458 |
"(" ^ (make_schematic_type_var indx) ^ ")") :: |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
459 |
(sorts_on_typs ((FOLTVar indx), ss)) |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
460 |
| sorts_on_typs ((FOLTFree x), (s::ss)) = |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
461 |
LTFree((make_type_class s) ^ "(" ^ (make_fixed_type_var x) ^ ")") :: |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
462 |
(sorts_on_typs ((FOLTFree x), ss)); |
15347 | 463 |
|
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
464 |
|
17312 | 465 |
(*UGLY: seems to be parsing the "show sorts" output, removing anything that |
466 |
starts with a left parenthesis.*) |
|
467 |
fun remove_type str = hd (String.fields (fn c => c = #"(") str); |
|
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
468 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
469 |
fun pred_of_sort (LTVar x) = ((remove_type x),1) |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
470 |
| pred_of_sort (LTFree x) = ((remove_type x),1) |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
471 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
472 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
473 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
474 |
|
16199
ee95ab217fee
no longer emits literals for type class HOL.type; also minor tidying
paulson
parents:
16039
diff
changeset
|
475 |
(*Given a list of sorted type variables, return two separate lists. |
ee95ab217fee
no longer emits literals for type class HOL.type; also minor tidying
paulson
parents:
16039
diff
changeset
|
476 |
The first is for TVars, the second for TFrees.*) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
477 |
fun add_typs_aux [] preds = ([],[], preds) |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
478 |
| add_typs_aux ((FOLTVar indx,s)::tss) preds = |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
479 |
let val vs = sorts_on_typs (FOLTVar indx, s) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
480 |
val preds' = (map pred_of_sort vs)@preds |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
481 |
val (vss,fss, preds'') = add_typs_aux tss preds' |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
482 |
in |
17775 | 483 |
(vs union vss, fss, preds'') |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
484 |
end |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
485 |
| add_typs_aux ((FOLTFree x,s)::tss) preds = |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
486 |
let val fs = sorts_on_typs (FOLTFree x, s) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
487 |
val preds' = (map pred_of_sort fs)@preds |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
488 |
val (vss,fss, preds'') = add_typs_aux tss preds' |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
489 |
in |
17775 | 490 |
(vss, fs union fss, preds'') |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
491 |
end; |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
492 |
|
17999 | 493 |
fun add_typs_aux2 [] = ([],[]) |
494 |
| add_typs_aux2 ((FOLTVar indx,s)::tss) = |
|
495 |
let val vs = sorts_on_typs (FOLTVar indx,s) |
|
496 |
val (vss,fss) = add_typs_aux2 tss |
|
497 |
in |
|
498 |
(vs union vss,fss) |
|
499 |
end |
|
500 |
| add_typs_aux2 ((FOLTFree x,s)::tss) = |
|
501 |
let val fs = sorts_on_typs (FOLTFree x,s) |
|
502 |
val (vss,fss) = add_typs_aux2 tss |
|
503 |
in |
|
504 |
(vss,fs union fss) |
|
505 |
end; |
|
506 |
||
507 |
||
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
508 |
fun add_typs (Clause cls) preds = add_typs_aux (#types_sorts cls) preds |
15347 | 509 |
|
510 |
||
511 |
(** make axiom clauses, hypothesis clauses and conjecture clauses. **) |
|
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
512 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
513 |
fun get_tvar_strs [] = [] |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
514 |
| get_tvar_strs ((FOLTVar indx,s)::tss) = |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
515 |
let val vstr = make_schematic_type_var indx |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
516 |
in |
17888 | 517 |
vstr ins (get_tvar_strs tss) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
518 |
end |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
519 |
| get_tvar_strs((FOLTFree x,s)::tss) = distinct (get_tvar_strs tss) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
520 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
521 |
(* FIX add preds and funcs to add typs aux here *) |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
522 |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
523 |
fun make_axiom_clause_thm thm (ax_name,cls_id) = |
17888 | 524 |
let val (lits,types_sorts, preds, funcs) = literals_of_term (prop_of thm) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
525 |
val (tvar_lits,tfree_lits, preds) = add_typs_aux types_sorts preds |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
526 |
val tvars = get_tvar_strs types_sorts |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
527 |
in |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
528 |
make_clause(cls_id,ax_name,Axiom, |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
529 |
lits,types_sorts,tvar_lits,tfree_lits, |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
530 |
tvars, preds, funcs) |
15347 | 531 |
end; |
532 |
||
533 |
||
18199
d236379ea408
-- before converting axiom and conjecture clauses into ResClause.clause format, perform "check_is_fol_term" first.
mengj
parents:
18056
diff
changeset
|
534 |
(* check if a clause is FOL first*) |
17888 | 535 |
fun make_conjecture_clause n t = |
18199
d236379ea408
-- before converting axiom and conjecture clauses into ResClause.clause format, perform "check_is_fol_term" first.
mengj
parents:
18056
diff
changeset
|
536 |
let val _ = check_is_fol_term t |
d236379ea408
-- before converting axiom and conjecture clauses into ResClause.clause format, perform "check_is_fol_term" first.
mengj
parents:
18056
diff
changeset
|
537 |
handle TERM("check_is_fol_term",_) => raise CLAUSE("Goal is not FOL",t) |
d236379ea408
-- before converting axiom and conjecture clauses into ResClause.clause format, perform "check_is_fol_term" first.
mengj
parents:
18056
diff
changeset
|
538 |
val (lits,types_sorts, preds, funcs) = literals_of_term t |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
539 |
val (tvar_lits,tfree_lits, preds) = add_typs_aux types_sorts preds |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
540 |
val tvars = get_tvar_strs types_sorts |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
541 |
in |
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
542 |
make_clause(n,"conjecture",Conjecture, |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
543 |
lits,types_sorts,tvar_lits,tfree_lits, |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
544 |
tvars, preds, funcs) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
545 |
end; |
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
546 |
|
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
547 |
fun make_conjecture_clauses_aux _ [] = [] |
17888 | 548 |
| make_conjecture_clauses_aux n (t::ts) = |
549 |
make_conjecture_clause n t :: make_conjecture_clauses_aux (n+1) ts |
|
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
550 |
|
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
551 |
val make_conjecture_clauses = make_conjecture_clauses_aux 0 |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
552 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
553 |
|
18199
d236379ea408
-- before converting axiom and conjecture clauses into ResClause.clause format, perform "check_is_fol_term" first.
mengj
parents:
18056
diff
changeset
|
554 |
(*before converting an axiom clause to "clause" format, check if it is FOL*) |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
555 |
fun make_axiom_clause term (ax_name,cls_id) = |
18199
d236379ea408
-- before converting axiom and conjecture clauses into ResClause.clause format, perform "check_is_fol_term" first.
mengj
parents:
18056
diff
changeset
|
556 |
let val _ = check_is_fol_term term |
d236379ea408
-- before converting axiom and conjecture clauses into ResClause.clause format, perform "check_is_fol_term" first.
mengj
parents:
18056
diff
changeset
|
557 |
handle TERM("check_is_fol_term",_) => raise CLAUSE("Axiom is not FOL", term) |
d236379ea408
-- before converting axiom and conjecture clauses into ResClause.clause format, perform "check_is_fol_term" first.
mengj
parents:
18056
diff
changeset
|
558 |
val (lits,types_sorts, preds,funcs) = literals_of_term term |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
559 |
val (tvar_lits,tfree_lits, preds) = add_typs_aux types_sorts preds |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
560 |
val tvars = get_tvar_strs types_sorts |
15347 | 561 |
in |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
562 |
make_clause(cls_id,ax_name,Axiom, |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
563 |
lits,types_sorts,tvar_lits,tfree_lits, |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
564 |
tvars, preds,funcs) |
15347 | 565 |
end; |
566 |
||
567 |
||
568 |
||
569 |
||
570 |
(**** Isabelle arities ****) |
|
571 |
||
572 |
exception ARCLAUSE of string; |
|
573 |
||
574 |
||
575 |
type class = string; |
|
576 |
type tcons = string; |
|
577 |
||
578 |
||
579 |
datatype arLit = TConsLit of bool * (class * tcons * string list) | TVarLit of bool * (class * string); |
|
580 |
||
581 |
datatype arityClause = |
|
582 |
ArityClause of {clause_id: clause_id, |
|
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
583 |
axiom_name: axiom_name, |
15347 | 584 |
kind: kind, |
585 |
conclLit: arLit, |
|
586 |
premLits: arLit list}; |
|
587 |
||
588 |
||
589 |
fun get_TVars 0 = [] |
|
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
590 |
| get_TVars n = ("T_" ^ (Int.toString n)) :: get_TVars (n-1); |
15347 | 591 |
|
592 |
||
593 |
||
594 |
fun pack_sort(_,[]) = raise ARCLAUSE("Empty Sort Found") |
|
595 |
| pack_sort(tvar, [cls]) = [(make_type_class cls, tvar)] |
|
596 |
| pack_sort(tvar, cls::srt) = (make_type_class cls,tvar) :: (pack_sort(tvar, srt)); |
|
597 |
||
598 |
||
599 |
fun make_TVarLit (b,(cls,str)) = TVarLit(b,(cls,str)); |
|
600 |
fun make_TConsLit (b,(cls,tcons,tvars)) = TConsLit(b,(make_type_class cls,make_fixed_type_const tcons,tvars)); |
|
601 |
||
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
602 |
fun make_axiom_arity_clause (tcons,n,(res,args)) = |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
603 |
let val nargs = length args |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
604 |
val tvars = get_TVars nargs |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
605 |
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
|
606 |
val tvars_srts' = union_all(map pack_sort tvars_srts) |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
607 |
val false_tvars_srts' = map (pair false) tvars_srts' |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
608 |
in |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
609 |
ArityClause {clause_id = n, kind = Axiom, |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
610 |
axiom_name = tcons, |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
611 |
conclLit = make_TConsLit(true,(res,tcons,tvars)), |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
612 |
premLits = map make_TVarLit false_tvars_srts'} |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
613 |
end; |
15347 | 614 |
|
17305
6cef3aedd661
axioms now included in tptp files, no /bin/cat and various tidying
paulson
parents:
17261
diff
changeset
|
615 |
(*The number of clauses generated from cls, including type clauses*) |
6cef3aedd661
axioms now included in tptp files, no /bin/cat and various tidying
paulson
parents:
17261
diff
changeset
|
616 |
fun num_of_clauses (Clause cls) = |
6cef3aedd661
axioms now included in tptp files, no /bin/cat and various tidying
paulson
parents:
17261
diff
changeset
|
617 |
let val num_tfree_lits = |
6cef3aedd661
axioms now included in tptp files, no /bin/cat and various tidying
paulson
parents:
17261
diff
changeset
|
618 |
if !keep_types then length (#tfree_type_literals cls) |
6cef3aedd661
axioms now included in tptp files, no /bin/cat and various tidying
paulson
parents:
17261
diff
changeset
|
619 |
else 0 |
6cef3aedd661
axioms now included in tptp files, no /bin/cat and various tidying
paulson
parents:
17261
diff
changeset
|
620 |
in 1 + num_tfree_lits end; |
15347 | 621 |
|
622 |
||
623 |
(**** Isabelle class relations ****) |
|
624 |
||
625 |
||
626 |
datatype classrelClause = |
|
627 |
ClassrelClause of {clause_id: clause_id, |
|
628 |
subclass: class, |
|
15531 | 629 |
superclass: class option}; |
15347 | 630 |
|
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
631 |
|
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
632 |
fun make_axiom_classrelClause n subclass superclass = |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
633 |
ClassrelClause {clause_id = n, |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
634 |
subclass = subclass, superclass = superclass}; |
15347 | 635 |
|
636 |
||
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
637 |
fun classrelClauses_of_aux n sub [] = [] |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
638 |
| classrelClauses_of_aux n sub (sup::sups) = |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
639 |
make_axiom_classrelClause n sub (SOME sup) :: classrelClauses_of_aux (n+1) sub sups; |
15347 | 640 |
|
641 |
||
642 |
fun classrelClauses_of (sub,sups) = |
|
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
643 |
case sups of [] => [make_axiom_classrelClause 0 sub NONE] |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
644 |
| _ => classrelClauses_of_aux 0 sub sups; |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
645 |
|
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
646 |
|
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
647 |
(***** Isabelle arities *****) |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
648 |
|
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
649 |
|
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
650 |
fun arity_clause _ (tcons, []) = [] |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
651 |
| arity_clause n (tcons, ar::ars) = |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
652 |
make_axiom_arity_clause (tcons,n,ar) :: |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
653 |
arity_clause (n+1) (tcons,ars); |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
654 |
|
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
655 |
fun multi_arity_clause [] = [] |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
656 |
| multi_arity_clause (tcon_ar :: tcons_ars) = |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
657 |
arity_clause 0 tcon_ar @ multi_arity_clause tcons_ars |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
658 |
|
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
659 |
fun arity_clause_thy thy = |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
660 |
let val arities = #arities (Type.rep_tsig (Sign.tsig_of thy)) |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
661 |
in multi_arity_clause (Symtab.dest arities) end; |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
662 |
|
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
663 |
|
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
664 |
(* Isabelle classes *) |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
665 |
|
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
666 |
type classrelClauses = classrelClause list Symtab.table; |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
667 |
|
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
668 |
val classrel_of = #2 o #classes o Type.rep_tsig o Sign.tsig_of; |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
669 |
fun classrel_clauses_classrel (C: Sorts.classes) = map classrelClauses_of (Graph.dest C); |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
670 |
val classrel_clauses_thy = List.concat o classrel_clauses_classrel o classrel_of; |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
671 |
|
15347 | 672 |
|
673 |
||
674 |
(****!!!! Changed for typed equality !!!!****) |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
675 |
|
15347 | 676 |
fun wrap_eq_type typ t = eq_typ_wrapper ^"(" ^ t ^ "," ^ typ ^ ")"; |
677 |
||
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
678 |
(*Only need to wrap equality's arguments with "typeinfo" if the output clauses are typed |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
679 |
and if we specifically ask for types to be included. *) |
15347 | 680 |
fun string_of_equality (typ,terms) = |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
681 |
let val [tstr1,tstr2] = map string_of_term terms |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
682 |
in |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
683 |
if !keep_types andalso !special_equal |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
684 |
then "equal(" ^ (wrap_eq_type typ tstr1) ^ "," ^ |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
685 |
(wrap_eq_type typ tstr2) ^ ")" |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
686 |
else "equal(" ^ tstr1 ^ "," ^ tstr2 ^ ")" |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
687 |
end |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
688 |
and string_of_term (UVar(x,_)) = x |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
689 |
| string_of_term (Fun("equal",[typ],terms)) = string_of_equality(typ,terms) |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
690 |
| string_of_term (Fun (name,typs,[])) = name (*Overloaded consts like 0 don't get types!*) |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
691 |
| string_of_term (Fun (name,typs,terms)) = |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
692 |
let val terms_as_strings = map string_of_term terms |
18275 | 693 |
val typs' = if !keep_types then typs else [] |
694 |
in name ^ (paren_pack (terms_as_strings @ typs')) end |
|
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
695 |
| string_of_term _ = error "string_of_term"; |
15347 | 696 |
|
697 |
(* before output the string of the predicate, check if the predicate corresponds to an equality or not. *) |
|
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
698 |
fun string_of_predicate (Predicate("equal",[typ],terms)) = string_of_equality(typ,terms) |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
699 |
| string_of_predicate (Predicate(name,typs,terms)) = |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
700 |
let val terms_as_strings = map string_of_term terms |
18275 | 701 |
val typs' = if !keep_types then typs else [] |
702 |
in name ^ (paren_pack (terms_as_strings @ typs')) end |
|
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
703 |
| string_of_predicate _ = error "string_of_predicate"; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
704 |
|
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
705 |
|
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
706 |
fun string_of_clausename (cls_id,ax_name) = |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
707 |
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
|
708 |
|
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
709 |
fun string_of_type_clsname (cls_id,ax_name,idx) = |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
710 |
string_of_clausename (cls_id,ax_name) ^ "_tcs" ^ (Int.toString idx); |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
711 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
712 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
713 |
(********************************) |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
714 |
(* Code for producing DFG files *) |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
715 |
(********************************) |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
716 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
717 |
fun dfg_literal (Literal(pol,pred,tag)) = |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
718 |
let val pred_string = string_of_predicate pred |
17234 | 719 |
in |
720 |
if pol then pred_string else "not(" ^pred_string ^ ")" |
|
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
721 |
end; |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
722 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
723 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
724 |
(* FIX: what does this mean? *) |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
725 |
(*fun dfg_of_typeLit (LTVar x) = "not(" ^ x ^ ")" |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
726 |
| dfg_of_typeLit (LTFree x) = "(" ^ x ^ ")";*) |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
727 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
728 |
fun dfg_of_typeLit (LTVar x) = x |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
729 |
| dfg_of_typeLit (LTFree x) = x ; |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
730 |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
731 |
(*Make the string of universal quantifiers for a clause*) |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
732 |
fun forall_open ([],[]) = "" |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
733 |
| forall_open (vars,tvars) = "forall([" ^ (commas (tvars@vars))^ "],\n" |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
734 |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
735 |
fun forall_close ([],[]) = "" |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
736 |
| forall_close (vars,tvars) = ")" |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
737 |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
738 |
fun gen_dfg_cls (cls_id,ax_name,knd,lits,tvars,vars) = |
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
739 |
"clause( %(" ^ knd ^ ")\n" ^ forall_open(vars,tvars) ^ |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
740 |
"or(" ^ lits ^ ")" ^ forall_close(vars,tvars) ^ ",\n" ^ |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
741 |
string_of_clausename (cls_id,ax_name) ^ ")."; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
742 |
|
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
743 |
fun gen_dfg_type_cls (cls_id,ax_name,knd,tfree_lit,idx,tvars,vars) = |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
744 |
"clause( %(" ^ knd ^ ")\n" ^ forall_open(vars,tvars) ^ |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
745 |
"or( " ^ tfree_lit ^ ")" ^ forall_close(vars,tvars) ^ ",\n" ^ |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
746 |
string_of_type_clsname (cls_id,ax_name,idx) ^ ")."; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
747 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
748 |
fun dfg_clause_aux (Clause cls) = |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
749 |
let val lits = map dfg_literal (#literals cls) |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
750 |
val tvar_lits_strs = |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
751 |
if !keep_types then map dfg_of_typeLit (#tvar_type_literals cls) |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
752 |
else [] |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
753 |
val tfree_lits = |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
754 |
if !keep_types then map dfg_of_typeLit (#tfree_type_literals cls) |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
755 |
else [] |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
756 |
in |
17234 | 757 |
(tvar_lits_strs @ lits, tfree_lits) |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
758 |
end; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
759 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
760 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
761 |
fun dfg_folterms (Literal(pol,pred,tag)) = |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
762 |
let val Predicate (predname, _, folterms) = pred |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
763 |
in folterms end |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
764 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
765 |
|
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
766 |
fun get_uvars (UVar(a,typ)) = [a] |
17775 | 767 |
| get_uvars (Fun (_,typ,tlist)) = union_all(map get_uvars tlist) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
768 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
769 |
|
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
770 |
fun is_uvar (UVar _) = true |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
771 |
| is_uvar (Fun _) = false; |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
772 |
|
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
773 |
fun uvar_name (UVar(a,_)) = a |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
774 |
| uvar_name (Fun (a,_,_)) = raise CLAUSE("Not a variable", Const(a,dummyT)); |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
775 |
|
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
776 |
fun dfg_vars (Clause cls) = |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
777 |
let val lits = #literals cls |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
778 |
val folterms = List.concat (map dfg_folterms lits) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
779 |
in |
17775 | 780 |
union_all(map get_uvars folterms) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
781 |
end |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
782 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
783 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
784 |
fun dfg_tvars (Clause cls) =(#tvars cls) |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
785 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
786 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
787 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
788 |
(* make this return funcs and preds too? *) |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
789 |
fun string_of_predname (Predicate("equal",_,terms)) = "EQUALITY" |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
790 |
| string_of_predname (Predicate(name,_,terms)) = name |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
791 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
792 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
793 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
794 |
fun concat_with sep [] = "" |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
795 |
| concat_with sep [x] = "(" ^ x ^ ")" |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
796 |
| concat_with sep (x::xs) = "(" ^ x ^ ")" ^ sep ^ (concat_with sep xs); |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
797 |
|
17234 | 798 |
fun dfg_pred (Literal(pol,pred,tag)) ax_name = |
799 |
(string_of_predname pred) ^ " " ^ ax_name |
|
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
800 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
801 |
fun dfg_clause cls = |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
802 |
let val (lits,tfree_lits) = dfg_clause_aux cls |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
803 |
(*"lits" includes the typing assumptions (TVars)*) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
804 |
val vars = dfg_vars cls |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
805 |
val tvars = dfg_tvars cls |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
806 |
val knd = string_of_kind cls |
17234 | 807 |
val lits_str = commas lits |
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
808 |
val cls_id = get_clause_id cls |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
809 |
val axname = get_axiomName cls |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
810 |
val cls_str = gen_dfg_cls(cls_id,axname,knd,lits_str,tvars, vars) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
811 |
fun typ_clss k [] = [] |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
812 |
| typ_clss k (tfree :: tfrees) = |
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
813 |
(gen_dfg_type_cls(cls_id,axname,knd,tfree,k, tvars,vars)) :: |
17234 | 814 |
(typ_clss (k+1) tfrees) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
815 |
in |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
816 |
cls_str :: (typ_clss 0 tfree_lits) |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
817 |
end; |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
818 |
|
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
819 |
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
|
820 |
|
17234 | 821 |
fun string_of_preds preds = |
822 |
"predicates[" ^ (concat_with ", " (map string_of_arity preds)) ^ "].\n"; |
|
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
823 |
|
17234 | 824 |
fun string_of_funcs funcs = |
825 |
"functions[" ^ (concat_with ", " (map string_of_arity funcs)) ^ "].\n" ; |
|
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
826 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
827 |
|
17234 | 828 |
fun string_of_symbols predstr funcstr = |
829 |
"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
|
830 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
831 |
|
17234 | 832 |
fun string_of_axioms axstr = |
833 |
"list_of_clauses(axioms,cnf).\n" ^ axstr ^ "end_of_list.\n\n"; |
|
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
834 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
835 |
|
17234 | 836 |
fun string_of_conjectures conjstr = |
837 |
"list_of_clauses(conjectures,cnf).\n" ^ conjstr ^ "end_of_list.\n\n"; |
|
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
838 |
|
17234 | 839 |
fun string_of_descrip () = |
840 |
"list_of_descriptions.\nname({*[ File : ],[ Names :]*}).\nauthor({*[ Source :]*}).\nstatus(unknown).\ndescription({*[ Refs :]*}).\nend_of_list.\n\n" |
|
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
841 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
842 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
843 |
fun string_of_start name = "%------------------------------------------------------------------------------\nbegin_problem(" ^ name ^ ").\n\n"; |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
844 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
845 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
846 |
fun string_of_end () = "end_problem.\n%------------------------------------------------------------------------------"; |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
847 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
848 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
849 |
fun clause2dfg cls = |
17234 | 850 |
let val (lits,tfree_lits) = dfg_clause_aux cls |
851 |
(*"lits" includes the typing assumptions (TVars)*) |
|
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
852 |
val cls_id = get_clause_id cls |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
853 |
val ax_name = get_axiomName cls |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
854 |
val vars = dfg_vars cls |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
855 |
val tvars = dfg_tvars cls |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
856 |
val funcs = funcs_of_cls cls |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
857 |
val preds = preds_of_cls cls |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
858 |
val knd = string_of_kind cls |
17234 | 859 |
val lits_str = commas lits |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
860 |
val cls_str = gen_dfg_cls(cls_id,ax_name,knd,lits_str,tvars,vars) |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
861 |
in |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
862 |
(cls_str,tfree_lits) |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
863 |
end; |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
864 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
865 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
866 |
|
17234 | 867 |
fun tfree_dfg_clause tfree_lit = |
17422 | 868 |
"clause( %(conjecture)\n" ^ "or( " ^ tfree_lit ^ "),\n" ^ "tfree_tcs" ^ ")." |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
869 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
870 |
|
17422 | 871 |
fun gen_dfg_file probname axioms conjectures funcs preds = |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
872 |
let val axstrs_tfrees = (map clause2dfg axioms) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
873 |
val (axstrs, atfrees) = ListPair.unzip axstrs_tfrees |
17764 | 874 |
val axstr = (space_implode "\n" axstrs) ^ "\n\n" |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
875 |
val conjstrs_tfrees = (map clause2dfg conjectures) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
876 |
val (conjstrs, atfrees) = ListPair.unzip conjstrs_tfrees |
17775 | 877 |
val tfree_clss = map tfree_dfg_clause (union_all atfrees) |
17764 | 878 |
val conjstr = (space_implode "\n" (tfree_clss@conjstrs)) ^ "\n\n" |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
879 |
val funcstr = string_of_funcs funcs |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
880 |
val predstr = string_of_preds preds |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
881 |
in |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
882 |
(string_of_start probname) ^ (string_of_descrip ()) ^ |
17764 | 883 |
(string_of_symbols funcstr predstr) ^ |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
884 |
(string_of_axioms axstr) ^ |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
885 |
(string_of_conjectures conjstr) ^ (string_of_end ()) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
886 |
end; |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
887 |
|
17422 | 888 |
fun clauses2dfg [] probname axioms conjectures funcs preds = |
17775 | 889 |
let val funcs' = (union_all(map funcs_of_cls axioms)) @ funcs |
890 |
val preds' = (union_all(map preds_of_cls axioms)) @ preds |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
891 |
in |
17422 | 892 |
gen_dfg_file probname axioms conjectures funcs' preds' |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
893 |
end |
17422 | 894 |
| clauses2dfg (cls::clss) probname axioms conjectures funcs preds = |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
895 |
let val (lits,tfree_lits) = dfg_clause_aux cls |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
896 |
(*"lits" includes the typing assumptions (TVars)*) |
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
897 |
val cls_id = get_clause_id cls |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
898 |
val ax_name = get_axiomName cls |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
899 |
val vars = dfg_vars cls |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
900 |
val tvars = dfg_tvars cls |
17888 | 901 |
val funcs' = (funcs_of_cls cls) union funcs |
902 |
val preds' = (preds_of_cls cls) union preds |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
903 |
val knd = string_of_kind cls |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
904 |
val lits_str = concat_with ", " lits |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
905 |
val axioms' = if knd = "axiom" then (cls::axioms) else axioms |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
906 |
val conjectures' = |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
907 |
if knd = "conjecture" then (cls::conjectures) else conjectures |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
908 |
in |
17422 | 909 |
clauses2dfg clss probname axioms' conjectures' funcs' preds' |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
910 |
end; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
911 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
912 |
|
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
913 |
fun string_of_arClauseID (ArityClause {clause_id,axiom_name,...}) = |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
914 |
arclause_prefix ^ ascii_of axiom_name ^ "_" ^ Int.toString clause_id; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
915 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
916 |
fun string_of_arKind (ArityClause arcls) = name_of_kind(#kind arcls); |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
917 |
|
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
918 |
(*FIXME!!! currently is TPTP format!*) |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
919 |
fun dfg_of_arLit (TConsLit(b,(c,t,args))) = |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
920 |
let val pol = if b then "++" else "--" |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
921 |
val arg_strs = paren_pack args |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
922 |
in |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
923 |
pol ^ c ^ "(" ^ t ^ arg_strs ^ ")" |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
924 |
end |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
925 |
| dfg_of_arLit (TVarLit(b,(c,str))) = |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
926 |
let val pol = if b then "++" else "--" |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
927 |
in |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
928 |
pol ^ c ^ "(" ^ str ^ ")" |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
929 |
end; |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
930 |
|
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
931 |
|
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
932 |
fun dfg_of_conclLit (ArityClause arcls) = dfg_of_arLit (#conclLit arcls); |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
933 |
|
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
934 |
|
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
935 |
fun dfg_of_premLits (ArityClause arcls) = map dfg_of_arLit (#premLits arcls); |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
936 |
|
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
937 |
|
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
938 |
|
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
939 |
(*FIXME: would this have variables in a forall? *) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
940 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
941 |
fun dfg_arity_clause arcls = |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
942 |
let val arcls_id = string_of_arClauseID arcls |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
943 |
val concl_lit = dfg_of_conclLit arcls |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
944 |
val prems_lits = dfg_of_premLits arcls |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
945 |
val knd = string_of_arKind arcls |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
946 |
val all_lits = concl_lit :: prems_lits |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
947 |
in |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
948 |
"clause( %(" ^ knd ^ ")\n" ^ "or( " ^ (bracket_pack all_lits) ^ ")),\n" ^ |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
949 |
arcls_id ^ ")." |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
950 |
end; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
951 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
952 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
953 |
(********************************) |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
954 |
(* code to produce TPTP files *) |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
955 |
(********************************) |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
956 |
|
15347 | 957 |
fun tptp_literal (Literal(pol,pred,tag)) = |
958 |
let val pred_string = string_of_predicate pred |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
959 |
val tagged_pol = |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
960 |
if (tag andalso !tagged) then (if pol then "+++" else "---") |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
961 |
else (if pol then "++" else "--") |
15347 | 962 |
in |
963 |
tagged_pol ^ pred_string |
|
964 |
end; |
|
965 |
||
966 |
fun tptp_of_typeLit (LTVar x) = "--" ^ x |
|
967 |
| tptp_of_typeLit (LTFree x) = "++" ^ x; |
|
968 |
||
969 |
||
970 |
fun gen_tptp_cls (cls_id,ax_name,knd,lits) = |
|
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
971 |
"input_clause(" ^ string_of_clausename (cls_id,ax_name) ^ "," ^ |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
972 |
knd ^ "," ^ lits ^ ")."; |
15347 | 973 |
|
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
974 |
fun gen_tptp_type_cls (cls_id,ax_name,knd,tfree_lit,idx) = |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
975 |
"input_clause(" ^ string_of_type_clsname (cls_id,ax_name,idx) ^ "," ^ |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
976 |
knd ^ ",[" ^ tfree_lit ^ "])."; |
15347 | 977 |
|
17422 | 978 |
fun tptp_type_lits (Clause cls) = |
15347 | 979 |
let val lits = map tptp_literal (#literals cls) |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
980 |
val tvar_lits_strs = |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
981 |
if !keep_types |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
982 |
then (map tptp_of_typeLit (#tvar_type_literals cls)) |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
983 |
else [] |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
984 |
val tfree_lits = |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
985 |
if !keep_types |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
986 |
then (map tptp_of_typeLit (#tfree_type_literals cls)) |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
987 |
else [] |
15347 | 988 |
in |
17305
6cef3aedd661
axioms now included in tptp files, no /bin/cat and various tidying
paulson
parents:
17261
diff
changeset
|
989 |
(tvar_lits_strs @ lits, tfree_lits) |
15347 | 990 |
end; |
991 |
||
992 |
fun tptp_clause cls = |
|
17422 | 993 |
let val (lits,tfree_lits) = tptp_type_lits cls |
17305
6cef3aedd661
axioms now included in tptp files, no /bin/cat and various tidying
paulson
parents:
17261
diff
changeset
|
994 |
(*"lits" includes the typing assumptions (TVars)*) |
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
995 |
val cls_id = get_clause_id cls |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
996 |
val ax_name = get_axiomName cls |
15347 | 997 |
val knd = string_of_kind cls |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
998 |
val lits_str = bracket_pack lits |
17305
6cef3aedd661
axioms now included in tptp files, no /bin/cat and various tidying
paulson
parents:
17261
diff
changeset
|
999 |
val cls_str = gen_tptp_cls(cls_id,ax_name,knd,lits_str) |
6cef3aedd661
axioms now included in tptp files, no /bin/cat and various tidying
paulson
parents:
17261
diff
changeset
|
1000 |
fun typ_clss k [] = [] |
15347 | 1001 |
| typ_clss k (tfree :: tfrees) = |
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
1002 |
gen_tptp_type_cls(cls_id,ax_name,knd,tfree,k) :: |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
1003 |
typ_clss (k+1) tfrees |
15347 | 1004 |
in |
1005 |
cls_str :: (typ_clss 0 tfree_lits) |
|
1006 |
end; |
|
1007 |
||
15608 | 1008 |
fun clause2tptp cls = |
17422 | 1009 |
let val (lits,tfree_lits) = tptp_type_lits cls |
17305
6cef3aedd661
axioms now included in tptp files, no /bin/cat and various tidying
paulson
parents:
17261
diff
changeset
|
1010 |
(*"lits" includes the typing assumptions (TVars)*) |
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
1011 |
val cls_id = get_clause_id cls |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
1012 |
val ax_name = get_axiomName cls |
15608 | 1013 |
val knd = string_of_kind cls |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
1014 |
val lits_str = bracket_pack lits |
15608 | 1015 |
val cls_str = gen_tptp_cls(cls_id,ax_name,knd,lits_str) |
1016 |
in |
|
1017 |
(cls_str,tfree_lits) |
|
1018 |
end; |
|
1019 |
||
1020 |
||
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
1021 |
fun tfree_clause tfree_lit = |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
1022 |
"input_clause(" ^ "tfree_tcs," ^ "conjecture" ^ ",[" ^ tfree_lit ^ "])."; |
15608 | 1023 |
|
15347 | 1024 |
|
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
1025 |
fun tptp_of_arLit (TConsLit(b,(c,t,args))) = |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
1026 |
let val pol = if b then "++" else "--" |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
1027 |
val arg_strs = paren_pack args |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
1028 |
in |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
1029 |
pol ^ c ^ "(" ^ t ^ arg_strs ^ ")" |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
1030 |
end |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
1031 |
| tptp_of_arLit (TVarLit(b,(c,str))) = |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
1032 |
let val pol = if b then "++" else "--" |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
1033 |
in |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
1034 |
pol ^ c ^ "(" ^ str ^ ")" |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
1035 |
end; |
15347 | 1036 |
|
1037 |
||
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
1038 |
fun tptp_of_conclLit (ArityClause arcls) = tptp_of_arLit (#conclLit arcls); |
15347 | 1039 |
|
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
1040 |
fun tptp_of_premLits (ArityClause arcls) = map tptp_of_arLit (#premLits arcls); |
15347 | 1041 |
|
1042 |
fun tptp_arity_clause arcls = |
|
1043 |
let val arcls_id = string_of_arClauseID arcls |
|
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
1044 |
val concl_lit = tptp_of_conclLit arcls |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
1045 |
val prems_lits = tptp_of_premLits arcls |
15347 | 1046 |
val knd = string_of_arKind arcls |
1047 |
val all_lits = concl_lit :: prems_lits |
|
1048 |
in |
|
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
1049 |
"input_clause(" ^ arcls_id ^ "," ^ knd ^ "," ^ |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
1050 |
(bracket_pack all_lits) ^ ")." |
15347 | 1051 |
end; |
1052 |
||
1053 |
fun tptp_classrelLits sub sup = |
|
1054 |
let val tvar = "(T)" |
|
1055 |
in |
|
15531 | 1056 |
case sup of NONE => "[++" ^ sub ^ tvar ^ "]" |
1057 |
| (SOME supcls) => "[--" ^ sub ^ tvar ^ ",++" ^ supcls ^ tvar ^ "]" |
|
15347 | 1058 |
end; |
1059 |
||
1060 |
||
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
1061 |
fun tptp_classrelClause (ClassrelClause {clause_id,subclass,superclass,...}) = |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
1062 |
let val relcls_id = clrelclause_prefix ^ ascii_of subclass ^ "_" ^ |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
1063 |
Int.toString clause_id |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
1064 |
val lits = tptp_classrelLits (make_type_class subclass) |
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
1065 |
(Option.map make_type_class superclass) |
15347 | 1066 |
in |
1067 |
"input_clause(" ^ relcls_id ^ ",axiom," ^ lits ^ ")." |
|
1068 |
end; |
|
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
1069 |
|
15347 | 1070 |
end; |