src/HOL/Tools/res_clause.ML
author haftmann
Wed Oct 21 10:15:31 2009 +0200 (2009-10-21)
changeset 33040 cffdb7b28498
parent 33038 8f9594c31de4
child 33043 ff71cadefb14
permissions -rw-r--r--
removed old-style \ and \\ infixes
paulson@15347
     1
(*  Author: Jia Meng, Cambridge University Computer Laboratory
paulson@15347
     2
    Copyright 2004 University of Cambridge
paulson@15347
     3
wenzelm@24310
     4
Storing/printing FOL clauses and arity clauses.
paulson@15347
     5
Typed equality is treated differently.
paulson@15347
     6
*)
paulson@15347
     7
paulson@23385
     8
(*FIXME: combine with res_hol_clause!*)
paulson@15347
     9
signature RES_CLAUSE =
wenzelm@24310
    10
sig
wenzelm@24310
    11
  val schematic_var_prefix: string
wenzelm@24310
    12
  val fixed_var_prefix: string
wenzelm@24310
    13
  val tvar_prefix: string
wenzelm@24310
    14
  val tfree_prefix: string
wenzelm@24310
    15
  val clause_prefix: string
wenzelm@24310
    16
  val const_prefix: string
wenzelm@24310
    17
  val tconst_prefix: string
wenzelm@24310
    18
  val class_prefix: string
wenzelm@24310
    19
  val union_all: ''a list list -> ''a list
wenzelm@24310
    20
  val const_trans_table: string Symtab.table
wenzelm@24310
    21
  val type_const_trans_table: string Symtab.table
wenzelm@24310
    22
  val ascii_of: string -> string
wenzelm@24310
    23
  val undo_ascii_of: string -> string
wenzelm@24310
    24
  val paren_pack : string list -> string
wenzelm@24310
    25
  val make_schematic_var : string * int -> string
paulson@18868
    26
  val make_fixed_var : string -> string
paulson@18868
    27
  val make_schematic_type_var : string * int -> string
wenzelm@24310
    28
  val make_fixed_type_var : string -> string
immler@30151
    29
  val make_fixed_const : bool -> string -> string
immler@30151
    30
  val make_fixed_type_const : bool -> string -> string
paulson@18868
    31
  val make_type_class : string -> string
wenzelm@24310
    32
  datatype kind = Axiom | Conjecture
wenzelm@24310
    33
  type axiom_name = string
wenzelm@24310
    34
  datatype fol_type =
wenzelm@24310
    35
      AtomV of string
wenzelm@24310
    36
    | AtomF of string
wenzelm@24310
    37
    | Comp of string * fol_type list
paulson@18868
    38
  val string_of_fol_type : fol_type -> string
wenzelm@24310
    39
  datatype type_literal = LTVar of string * string | LTFree of string * string
wenzelm@24310
    40
  exception CLAUSE of string * term
paulson@24940
    41
  val add_typs : typ list -> type_literal list
paulson@24940
    42
  val get_tvar_strs: typ list -> string list
wenzelm@24310
    43
  datatype arLit =
wenzelm@24310
    44
      TConsLit of class * string * string list
wenzelm@24310
    45
    | TVarLit of class * string
wenzelm@24310
    46
  datatype arityClause = ArityClause of
paulson@24937
    47
   {axiom_name: axiom_name, conclLit: arLit, premLits: arLit list}
wenzelm@24310
    48
  datatype classrelClause = ClassrelClause of
paulson@24937
    49
   {axiom_name: axiom_name, subclass: class, superclass: class}
wenzelm@24310
    50
  val make_classrel_clauses: theory -> class list -> class list -> classrelClause list
immler@30151
    51
  val make_arity_clauses_dfg: bool -> theory -> string list -> class list -> class list * arityClause list
wenzelm@24310
    52
  val make_arity_clauses: theory -> string list -> class list -> class list * arityClause list
paulson@24940
    53
  val add_type_sort_preds: typ * int Symtab.table -> int Symtab.table
wenzelm@24310
    54
  val add_classrelClause_preds : classrelClause * int Symtab.table -> int Symtab.table
wenzelm@24310
    55
  val class_of_arityLit: arLit -> class
wenzelm@24310
    56
  val add_arityClause_preds: arityClause * int Symtab.table -> int Symtab.table
wenzelm@24310
    57
  val add_foltype_funcs: fol_type * int Symtab.table -> int Symtab.table
wenzelm@24310
    58
  val add_arityClause_funcs: arityClause * int Symtab.table -> int Symtab.table
wenzelm@24310
    59
  val init_functab: int Symtab.table
mengj@19719
    60
  val dfg_sign: bool -> string -> string
paulson@24937
    61
  val dfg_of_typeLit: bool -> type_literal -> string
paulson@24937
    62
  val gen_dfg_cls: int * string * kind * string list * string list * string list -> string
wenzelm@24310
    63
  val string_of_preds: (string * Int.int) list -> string
wenzelm@24310
    64
  val string_of_funcs: (string * int) list -> string
wenzelm@24310
    65
  val string_of_symbols: string -> string -> string
mengj@19719
    66
  val string_of_start: string -> string
mengj@19719
    67
  val string_of_descrip : string -> string
wenzelm@24310
    68
  val dfg_tfree_clause : string -> string
mengj@19719
    69
  val dfg_classrelClause: classrelClause -> string
mengj@19719
    70
  val dfg_arity_clause: arityClause -> string
wenzelm@24310
    71
  val tptp_sign: bool -> string -> string
paulson@24937
    72
  val tptp_of_typeLit : bool -> type_literal -> string
paulson@24937
    73
  val gen_tptp_cls : int * string * kind * string list * string list -> string
wenzelm@24310
    74
  val tptp_tfree_clause : string -> string
wenzelm@24310
    75
  val tptp_arity_clause : arityClause -> string
wenzelm@24310
    76
  val tptp_classrelClause : classrelClause -> string
wenzelm@24310
    77
end
paulson@15347
    78
wenzelm@24310
    79
structure ResClause: RES_CLAUSE =
paulson@15347
    80
struct
paulson@15347
    81
paulson@15347
    82
val schematic_var_prefix = "V_";
paulson@15347
    83
val fixed_var_prefix = "v_";
paulson@15347
    84
paulson@17230
    85
val tvar_prefix = "T_";
paulson@17230
    86
val tfree_prefix = "t_";
paulson@15347
    87
wenzelm@24310
    88
val clause_prefix = "cls_";
wenzelm@24310
    89
val arclause_prefix = "clsarity_"
paulson@17525
    90
val clrelclause_prefix = "clsrel_";
paulson@15347
    91
paulson@17230
    92
val const_prefix = "c_";
wenzelm@24310
    93
val tconst_prefix = "tc_";
wenzelm@24310
    94
val class_prefix = "class_";
paulson@15347
    95
haftmann@33038
    96
fun union_all xss = List.foldl (union (op =)) [] xss;
paulson@17775
    97
paulson@17775
    98
(*Provide readable names for the more common symbolic functions*)
paulson@15347
    99
val const_trans_table =
haftmann@30304
   100
      Symtab.make [(@{const_name "op ="}, "equal"),
wenzelm@24310
   101
                   (@{const_name HOL.less_eq}, "lessequals"),
haftmann@30304
   102
                   (@{const_name "op &"}, "and"),
haftmann@30304
   103
                   (@{const_name "op |"}, "or"),
haftmann@30304
   104
                   (@{const_name "op -->"}, "implies"),
haftmann@30304
   105
                   (@{const_name "op :"}, "in"),
wenzelm@24310
   106
                   ("ATP_Linkup.fequal", "fequal"),
wenzelm@24310
   107
                   ("ATP_Linkup.COMBI", "COMBI"),
wenzelm@24310
   108
                   ("ATP_Linkup.COMBK", "COMBK"),
wenzelm@24310
   109
                   ("ATP_Linkup.COMBB", "COMBB"),
wenzelm@24310
   110
                   ("ATP_Linkup.COMBC", "COMBC"),
wenzelm@24310
   111
                   ("ATP_Linkup.COMBS", "COMBS"),
wenzelm@24310
   112
                   ("ATP_Linkup.COMBB'", "COMBB_e"),
wenzelm@24310
   113
                   ("ATP_Linkup.COMBC'", "COMBC_e"),
wenzelm@24310
   114
                   ("ATP_Linkup.COMBS'", "COMBS_e")];
paulson@15347
   115
paulson@17230
   116
val type_const_trans_table =
paulson@18411
   117
      Symtab.make [("*", "prod"),
wenzelm@24310
   118
                   ("+", "sum"),
wenzelm@24310
   119
                   ("~=>", "map")];
paulson@15347
   120
paulson@15610
   121
(*Escaping of special characters.
paulson@15610
   122
  Alphanumeric characters are left unchanged.
paulson@15610
   123
  The character _ goes to __
paulson@15610
   124
  Characters in the range ASCII space to / go to _A to _P, respectively.
paulson@24183
   125
  Other printing characters go to _nnn where nnn is the decimal ASCII code.*)
paulson@24183
   126
val A_minus_space = Char.ord #"A" - Char.ord #" ";
paulson@15610
   127
paulson@24183
   128
fun stringN_of_int 0 _ = ""
paulson@24183
   129
  | stringN_of_int k n = stringN_of_int (k-1) (n div 10) ^ Int.toString (n mod 10);
paulson@15610
   130
paulson@15347
   131
fun ascii_of_c c =
paulson@15610
   132
  if Char.isAlphaNum c then String.str c
paulson@15610
   133
  else if c = #"_" then "__"
wenzelm@24310
   134
  else if #" " <= c andalso c <= #"/"
paulson@15610
   135
       then "_" ^ String.str (Char.chr (Char.ord c + A_minus_space))
wenzelm@24310
   136
  else if Char.isPrint c
paulson@24183
   137
       then ("_" ^ stringN_of_int 3 (Char.ord c))  (*fixed width, in case more digits follow*)
paulson@15610
   138
  else ""
paulson@15347
   139
paulson@15610
   140
val ascii_of = String.translate ascii_of_c;
paulson@15610
   141
paulson@24183
   142
(** Remove ASCII armouring from names in proof files **)
paulson@24183
   143
paulson@24183
   144
(*We don't raise error exceptions because this code can run inside the watcher.
paulson@24183
   145
  Also, the errors are "impossible" (hah!)*)
paulson@24183
   146
fun undo_ascii_aux rcs [] = String.implode(rev rcs)
paulson@24183
   147
  | undo_ascii_aux rcs [#"_"] = undo_ascii_aux (#"_"::rcs) []  (*ERROR*)
paulson@24183
   148
      (*Three types of _ escapes: __, _A to _P, _nnn*)
paulson@24183
   149
  | undo_ascii_aux rcs (#"_" :: #"_" :: cs) = undo_ascii_aux (#"_"::rcs) cs
wenzelm@24310
   150
  | undo_ascii_aux rcs (#"_" :: c :: cs) =
paulson@24183
   151
      if #"A" <= c andalso c<= #"P"  (*translation of #" " to #"/"*)
paulson@24183
   152
      then undo_ascii_aux (Char.chr(Char.ord c - A_minus_space) :: rcs) cs
wenzelm@24310
   153
      else
paulson@24183
   154
        let val digits = List.take (c::cs, 3) handle Subscript => []
wenzelm@24310
   155
        in
paulson@24183
   156
            case Int.fromString (String.implode digits) of
paulson@24183
   157
                NONE => undo_ascii_aux (c:: #"_"::rcs) cs  (*ERROR*)
paulson@24183
   158
              | SOME n => undo_ascii_aux (Char.chr n :: rcs) (List.drop (cs, 2))
paulson@24183
   159
        end
paulson@24183
   160
  | undo_ascii_aux rcs (c::cs) = undo_ascii_aux (c::rcs) cs;
paulson@24183
   161
paulson@24183
   162
val undo_ascii_of = undo_ascii_aux [] o String.explode;
paulson@15347
   163
paulson@17525
   164
(* convert a list of strings into one single string; surrounded by brackets *)
paulson@18218
   165
fun paren_pack [] = ""   (*empty argument list*)
paulson@18218
   166
  | paren_pack strings = "(" ^ commas strings ^ ")";
paulson@17525
   167
paulson@21509
   168
(*TSTP format uses (...) rather than the old [...]*)
paulson@21509
   169
fun tptp_pack strings = "(" ^ space_implode " | " strings ^ ")";
paulson@17525
   170
paulson@17525
   171
paulson@16925
   172
(*Remove the initial ' character from a type variable, if it is present*)
paulson@16925
   173
fun trim_type_var s =
paulson@16925
   174
  if s <> "" andalso String.sub(s,0) = #"'" then String.extract(s,1,NONE)
paulson@16925
   175
  else error ("trim_type: Malformed type variable encountered: " ^ s);
paulson@16925
   176
paulson@16903
   177
fun ascii_of_indexname (v,0) = ascii_of v
paulson@17525
   178
  | ascii_of_indexname (v,i) = ascii_of v ^ "_" ^ Int.toString i;
paulson@15347
   179
paulson@17230
   180
fun make_schematic_var v = schematic_var_prefix ^ (ascii_of_indexname v);
paulson@15347
   181
fun make_fixed_var x = fixed_var_prefix ^ (ascii_of x);
paulson@15347
   182
wenzelm@24310
   183
fun make_schematic_type_var (x,i) =
paulson@16925
   184
      tvar_prefix ^ (ascii_of_indexname (trim_type_var x,i));
paulson@16925
   185
fun make_fixed_type_var x = tfree_prefix ^ (ascii_of (trim_type_var x));
paulson@15347
   186
paulson@23075
   187
(*HACK because SPASS truncates identifiers to 63 characters :-(( *)
paulson@23075
   188
(*32-bit hash,so we expect no collisions unless there are around 65536 long identifiers...*)
immler@30151
   189
fun controlled_length dfg_format s =
immler@30151
   190
  if size s > 60 andalso dfg_format
paulson@23075
   191
  then Word.toString (Polyhash.hashw_string(s,0w0))
paulson@23075
   192
  else s;
paulson@23075
   193
immler@30151
   194
fun lookup_const dfg c =
wenzelm@17412
   195
    case Symtab.lookup const_trans_table c of
paulson@17230
   196
        SOME c' => c'
immler@30151
   197
      | NONE => controlled_length dfg (ascii_of c);
paulson@17230
   198
immler@30151
   199
fun lookup_type_const dfg c =
wenzelm@17412
   200
    case Symtab.lookup type_const_trans_table c of
paulson@17230
   201
        SOME c' => c'
immler@30151
   202
      | NONE => controlled_length dfg (ascii_of c);
paulson@18411
   203
immler@30151
   204
fun make_fixed_const _ "op =" = "equal"   (*MUST BE "equal" because it's built-in to ATPs*)
immler@30151
   205
  | make_fixed_const dfg c      = const_prefix ^ lookup_const dfg c;
paulson@18411
   206
immler@30151
   207
fun make_fixed_type_const dfg c = tconst_prefix ^ lookup_type_const dfg c;
quigley@17150
   208
wenzelm@17261
   209
fun make_type_class clas = class_prefix ^ ascii_of clas;
quigley@17150
   210
quigley@17150
   211
paulson@18798
   212
(***** definitions and functions for FOL clauses, for conversion to TPTP or DFG format. *****)
paulson@15347
   213
paulson@21509
   214
datatype kind = Axiom | Conjecture;
paulson@23385
   215
paulson@15347
   216
type axiom_name = string;
paulson@15347
   217
paulson@15347
   218
(**** Isabelle FOL clauses ****)
paulson@15347
   219
paulson@18798
   220
(*FIXME: give the constructors more sensible names*)
mengj@18402
   221
datatype fol_type = AtomV of string
wenzelm@24310
   222
                  | AtomF of string
wenzelm@24310
   223
                  | Comp of string * fol_type list;
mengj@18402
   224
mengj@18402
   225
fun string_of_fol_type (AtomV x) = x
mengj@18402
   226
  | string_of_fol_type (AtomF x) = x
wenzelm@24310
   227
  | string_of_fol_type (Comp(tcon,tps)) =
paulson@18856
   228
      tcon ^ (paren_pack (map string_of_fol_type tps));
wenzelm@24310
   229
paulson@18798
   230
(*First string is the type class; the second is a TVar or TFfree*)
paulson@18798
   231
datatype type_literal = LTVar of string * string | LTFree of string * string;
paulson@15347
   232
paulson@17404
   233
exception CLAUSE of string * term;
paulson@15347
   234
paulson@24940
   235
fun atomic_type (TFree (a,_)) = AtomF(make_fixed_type_var a)
paulson@24940
   236
  | atomic_type (TVar (v,_))  = AtomV(make_schematic_type_var v);
paulson@17317
   237
mengj@18402
   238
(*Flatten a type to a fol_type while accumulating sort constraints on the TFrees and
wenzelm@24310
   239
  TVars it contains.*)
immler@30151
   240
fun type_of dfg (Type (a, Ts)) =
immler@30151
   241
      let val (folTyps, ts) = types_of dfg Ts
immler@30151
   242
          val t = make_fixed_type_const dfg a
paulson@18798
   243
      in (Comp(t,folTyps), ts) end
immler@30151
   244
  | type_of dfg T = (atomic_type T, [T])
immler@30151
   245
and types_of dfg Ts =
immler@30151
   246
      let val (folTyps,ts) = ListPair.unzip (map (type_of dfg) Ts)
paulson@18798
   247
      in (folTyps, union_all ts) end;
paulson@15390
   248
wenzelm@24310
   249
(*Make literals for sorted type variables*)
paulson@24940
   250
fun sorts_on_typs_aux (_, [])   = []
paulson@24940
   251
  | sorts_on_typs_aux ((x,i),  s::ss) =
paulson@24940
   252
      let val sorts = sorts_on_typs_aux ((x,i), ss)
paulson@22643
   253
      in
paulson@22643
   254
          if s = "HOL.type" then sorts
paulson@24940
   255
          else if i = ~1 then LTFree(make_type_class s, make_fixed_type_var x) :: sorts
paulson@24940
   256
          else LTVar(make_type_class s, make_schematic_type_var (x,i)) :: sorts
paulson@22643
   257
      end;
quigley@17150
   258
paulson@24940
   259
fun sorts_on_typs (TFree (a,s)) = sorts_on_typs_aux ((a,~1),s)
paulson@24940
   260
  | sorts_on_typs (TVar (v,s))  = sorts_on_typs_aux (v,s);
paulson@24940
   261
paulson@18798
   262
fun pred_of_sort (LTVar (s,ty)) = (s,1)
paulson@22643
   263
  | pred_of_sort (LTFree (s,ty)) = (s,1)
quigley@17150
   264
paulson@24937
   265
(*Given a list of sorted type variables, return a list of type literals.*)
haftmann@33038
   266
fun add_typs Ts = List.foldl (union (op =)) [] (map sorts_on_typs Ts);
mengj@20015
   267
paulson@29676
   268
(*The correct treatment of TFrees like 'a in lemmas (axiom clauses) is not clear.
paulson@29676
   269
  * Ignoring them leads to unsound proofs, since we do nothing to ensure that 'a
paulson@29676
   270
    in a lemma has the same sort as 'a in the conjecture.
paulson@29676
   271
  * Deleting such clauses will lead to problems with locales in other use of local results
paulson@29676
   272
    where 'a is fixed. Probably we should delete clauses unless the sorts agree.
paulson@29676
   273
  * Currently we include a class constraint in the clause, exactly as with TVars.
paulson@29676
   274
*)
paulson@29676
   275
mengj@20015
   276
(** make axiom and conjecture clauses. **)
mengj@20015
   277
mengj@20015
   278
fun get_tvar_strs [] = []
paulson@24940
   279
  | get_tvar_strs ((TVar (indx,s))::Ts) =
paulson@24940
   280
      insert (op =) (make_schematic_type_var indx) (get_tvar_strs Ts)
paulson@24940
   281
  | get_tvar_strs((TFree _)::Ts) = get_tvar_strs Ts
mengj@20015
   282
wenzelm@24310
   283
mengj@19354
   284
paulson@15347
   285
(**** Isabelle arities ****)
paulson@15347
   286
paulson@15347
   287
exception ARCLAUSE of string;
paulson@15347
   288
wenzelm@24310
   289
datatype arLit = TConsLit of class * string * string list
paulson@22643
   290
               | TVarLit of class * string;
wenzelm@24310
   291
wenzelm@24310
   292
datatype arityClause =
wenzelm@24310
   293
         ArityClause of {axiom_name: axiom_name,
wenzelm@24310
   294
                         conclLit: arLit,
wenzelm@24310
   295
                         premLits: arLit list};
paulson@15347
   296
paulson@15347
   297
paulson@18798
   298
fun gen_TVars 0 = []
paulson@18798
   299
  | gen_TVars n = ("T_" ^ Int.toString n) :: gen_TVars (n-1);
paulson@15347
   300
paulson@18411
   301
fun pack_sort(_,[])  = []
paulson@18411
   302
  | pack_sort(tvar, "HOL.type"::srt) = pack_sort(tvar, srt)   (*IGNORE sort "type"*)
paulson@22643
   303
  | pack_sort(tvar, cls::srt) =  (cls, tvar) :: pack_sort(tvar, srt);
wenzelm@24310
   304
paulson@18411
   305
(*Arity of type constructor tcon :: (arg1,...,argN)res*)
immler@30151
   306
fun make_axiom_arity_clause dfg (tcons, axiom_name, (cls,args)) =
paulson@21560
   307
   let val tvars = gen_TVars (length args)
paulson@17845
   308
       val tvars_srts = ListPair.zip (tvars,args)
paulson@17845
   309
   in
paulson@24937
   310
      ArityClause {axiom_name = axiom_name, 
immler@30151
   311
                   conclLit = TConsLit (cls, make_fixed_type_const dfg tcons, tvars),
paulson@22643
   312
                   premLits = map TVarLit (union_all(map pack_sort tvars_srts))}
paulson@17845
   313
   end;
paulson@15347
   314
paulson@15347
   315
paulson@15347
   316
(**** Isabelle class relations ****)
paulson@15347
   317
wenzelm@24310
   318
datatype classrelClause =
wenzelm@24310
   319
         ClassrelClause of {axiom_name: axiom_name,
wenzelm@24310
   320
                            subclass: class,
wenzelm@24310
   321
                            superclass: class};
wenzelm@24310
   322
paulson@21290
   323
(*Generate all pairs (sub,super) such that sub is a proper subclass of super in theory thy.*)
paulson@21432
   324
fun class_pairs thy [] supers = []
paulson@21432
   325
  | class_pairs thy subs supers =
paulson@21432
   326
      let val class_less = Sorts.class_less(Sign.classes_of thy)
wenzelm@24310
   327
          fun add_super sub (super,pairs) =
wenzelm@24310
   328
                if class_less (sub,super) then (sub,super)::pairs else pairs
wenzelm@30190
   329
          fun add_supers (sub,pairs) = List.foldl (add_super sub) pairs supers
wenzelm@30190
   330
      in  List.foldl add_supers [] subs  end;
paulson@15347
   331
paulson@21290
   332
fun make_classrelClause (sub,super) =
paulson@21290
   333
  ClassrelClause {axiom_name = clrelclause_prefix ^ ascii_of sub ^ "_" ^ ascii_of super,
wenzelm@24310
   334
                  subclass = make_type_class sub,
paulson@21290
   335
                  superclass = make_type_class super};
paulson@15347
   336
paulson@21290
   337
fun make_classrel_clauses thy subs supers =
paulson@21290
   338
  map make_classrelClause (class_pairs thy subs supers);
paulson@18868
   339
paulson@18868
   340
paulson@18868
   341
(** Isabelle arities **)
paulson@17845
   342
immler@30151
   343
fun arity_clause dfg _ _ (tcons, []) = []
immler@30151
   344
  | arity_clause dfg seen n (tcons, ("HOL.type",_)::ars) =  (*ignore*)
immler@30151
   345
      arity_clause dfg seen n (tcons,ars)
immler@30151
   346
  | arity_clause dfg seen n (tcons, (ar as (class,_)) :: ars) =
paulson@21373
   347
      if class mem_string seen then (*multiple arities for the same tycon, class pair*)
immler@30151
   348
          make_axiom_arity_clause dfg (tcons, lookup_type_const dfg tcons ^ "_" ^ class ^ "_" ^ Int.toString n, ar) ::
immler@30151
   349
          arity_clause dfg seen (n+1) (tcons,ars)
paulson@21373
   350
      else
immler@30151
   351
          make_axiom_arity_clause dfg (tcons, lookup_type_const dfg tcons ^ "_" ^ class, ar) ::
immler@30151
   352
          arity_clause dfg (class::seen) n (tcons,ars)
paulson@17845
   353
immler@30151
   354
fun multi_arity_clause dfg [] = []
immler@30151
   355
  | multi_arity_clause dfg ((tcons,ars) :: tc_arlists) =
immler@30151
   356
      arity_clause dfg [] 1 (tcons, ars)  @  multi_arity_clause dfg tc_arlists
paulson@17845
   357
paulson@22643
   358
(*Generate all pairs (tycon,class,sorts) such that tycon belongs to class in theory thy
paulson@22643
   359
  provided its arguments have the corresponding sorts.*)
paulson@21373
   360
fun type_class_pairs thy tycons classes =
paulson@21373
   361
  let val alg = Sign.classes_of thy
paulson@21373
   362
      fun domain_sorts (tycon,class) = Sorts.mg_domain alg tycon [class]
wenzelm@24310
   363
      fun add_class tycon (class,pairs) =
wenzelm@24310
   364
            (class, domain_sorts(tycon,class))::pairs
paulson@21373
   365
            handle Sorts.CLASS_ERROR _ => pairs
wenzelm@30190
   366
      fun try_classes tycon = (tycon, List.foldl (add_class tycon) [] classes)
paulson@21373
   367
  in  map try_classes tycons  end;
paulson@21373
   368
paulson@22643
   369
(*Proving one (tycon, class) membership may require proving others, so iterate.*)
paulson@22643
   370
fun iter_type_class_pairs thy tycons [] = ([], [])
paulson@22643
   371
  | iter_type_class_pairs thy tycons classes =
paulson@22643
   372
      let val cpairs = type_class_pairs thy tycons classes
haftmann@33040
   373
          val newclasses = union_all (union_all (union_all (map (map #2 o #2) cpairs)))
haftmann@33040
   374
            |> subtract (op =) classes |> subtract (op =) HOLogic.typeS
wenzelm@24310
   375
          val (classes', cpairs') = iter_type_class_pairs thy tycons newclasses
haftmann@33038
   376
      in (union (op =) (classes', classes), union (op =) (cpairs', cpairs)) end;
wenzelm@24310
   377
immler@30151
   378
fun make_arity_clauses_dfg dfg thy tycons classes =
wenzelm@24310
   379
  let val (classes', cpairs) = iter_type_class_pairs thy tycons classes
immler@30151
   380
  in  (classes', multi_arity_clause dfg cpairs)  end;
immler@30151
   381
val make_arity_clauses = make_arity_clauses_dfg false;
paulson@17845
   382
paulson@18868
   383
(**** Find occurrences of predicates in clauses ****)
paulson@18868
   384
wenzelm@24310
   385
(*FIXME: multiple-arity checking doesn't work, as update_new is the wrong
paulson@18868
   386
  function (it flags repeated declarations of a function, even with the same arity)*)
paulson@18868
   387
wenzelm@30190
   388
fun update_many (tab, keypairs) = List.foldl (uncurry Symtab.update) tab keypairs;
paulson@18868
   389
paulson@24940
   390
fun add_type_sort_preds (T, preds) =
paulson@24940
   391
      update_many (preds, map pred_of_sort (sorts_on_typs T));
paulson@17845
   392
paulson@18868
   393
fun add_classrelClause_preds (ClassrelClause {subclass,superclass,...}, preds) =
paulson@18868
   394
  Symtab.update (subclass,1) (Symtab.update (superclass,1) preds);
paulson@17845
   395
paulson@22643
   396
fun class_of_arityLit (TConsLit (tclass, _, _)) = tclass
paulson@22643
   397
  | class_of_arityLit (TVarLit (tclass, _)) = tclass;
paulson@21373
   398
paulson@21373
   399
fun add_arityClause_preds (ArityClause {conclLit,premLits,...}, preds) =
paulson@22643
   400
  let val classes = map (make_type_class o class_of_arityLit) (conclLit::premLits)
paulson@21373
   401
      fun upd (class,preds) = Symtab.update (class,1) preds
wenzelm@30190
   402
  in  List.foldl upd preds classes  end;
paulson@18868
   403
paulson@18868
   404
(*** Find occurrences of functions in clauses ***)
paulson@18868
   405
paulson@18868
   406
fun add_foltype_funcs (AtomV _, funcs) = funcs
paulson@18868
   407
  | add_foltype_funcs (AtomF a, funcs) = Symtab.update (a,0) funcs
wenzelm@24310
   408
  | add_foltype_funcs (Comp(a,tys), funcs) =
wenzelm@30190
   409
      List.foldl add_foltype_funcs (Symtab.update (a, length tys) funcs) tys;
paulson@18868
   410
paulson@20038
   411
(*TFrees are recorded as constants*)
paulson@24940
   412
fun add_type_sort_funcs (TVar _, funcs) = funcs
paulson@24940
   413
  | add_type_sort_funcs (TFree (a, _), funcs) =
paulson@20038
   414
      Symtab.update (make_fixed_type_var a, 0) funcs
paulson@20038
   415
paulson@18868
   416
fun add_arityClause_funcs (ArityClause {conclLit,...}, funcs) =
paulson@22643
   417
  let val TConsLit (_, tcons, tvars) = conclLit
paulson@18868
   418
  in  Symtab.update (tcons, length tvars) funcs  end;
paulson@17845
   419
paulson@23075
   420
(*This type can be overlooked because it is built-in...*)
paulson@23075
   421
val init_functab = Symtab.update ("tc_itself", 1) Symtab.empty;
paulson@23075
   422
paulson@18868
   423
paulson@18868
   424
(**** String-oriented operations ****)
paulson@15347
   425
wenzelm@24310
   426
fun string_of_clausename (cls_id,ax_name) =
paulson@17525
   427
    clause_prefix ^ ascii_of ax_name ^ "_" ^ Int.toString cls_id;
paulson@17317
   428
wenzelm@24310
   429
fun string_of_type_clsname (cls_id,ax_name,idx) =
paulson@17525
   430
    string_of_clausename (cls_id,ax_name) ^ "_tcs" ^ (Int.toString idx);
paulson@18863
   431
wenzelm@24310
   432
paulson@18868
   433
(**** Producing DFG files ****)
quigley@17150
   434
paulson@18863
   435
(*Attach sign in DFG syntax: false means negate.*)
paulson@18863
   436
fun dfg_sign true s = s
wenzelm@24310
   437
  | dfg_sign false s = "not(" ^ s ^ ")"
paulson@18863
   438
paulson@24937
   439
fun dfg_of_typeLit pos (LTVar (s,ty))  = dfg_sign pos (s ^ "(" ^ ty ^ ")")
paulson@24937
   440
  | dfg_of_typeLit pos (LTFree (s,ty)) = dfg_sign pos (s ^ "(" ^ ty ^ ")");
wenzelm@24310
   441
paulson@18868
   442
(*Enclose the clause body by quantifiers, if necessary*)
wenzelm@24310
   443
fun dfg_forall [] body = body
paulson@18868
   444
  | dfg_forall vars body = "forall([" ^ commas vars ^ "],\n" ^ body ^ ")"
quigley@17150
   445
paulson@24937
   446
fun gen_dfg_cls (cls_id, ax_name, Axiom, lits, tylits, vars) =
paulson@24937
   447
      "clause( %(axiom)\n" ^
paulson@24937
   448
      dfg_forall vars ("or(" ^ commas (tylits@lits) ^ ")") ^ ",\n" ^
paulson@24937
   449
      string_of_clausename (cls_id,ax_name) ^  ").\n\n"
paulson@24937
   450
  | gen_dfg_cls (cls_id, ax_name, Conjecture, lits, _, vars) =
paulson@24937
   451
      "clause( %(negated_conjecture)\n" ^
paulson@24937
   452
      dfg_forall vars ("or(" ^ commas lits ^ ")") ^ ",\n" ^
paulson@24937
   453
      string_of_clausename (cls_id,ax_name) ^  ").\n\n";
quigley@17150
   454
paulson@18798
   455
fun string_of_arity (name, num) =  "(" ^ name ^ "," ^ Int.toString num ^ ")"
quigley@17150
   456
paulson@18856
   457
fun string_of_preds [] = ""
paulson@18856
   458
  | string_of_preds preds = "predicates[" ^ commas(map string_of_arity preds) ^ "].\n";
quigley@17150
   459
paulson@18856
   460
fun string_of_funcs [] = ""
paulson@18856
   461
  | string_of_funcs funcs = "functions[" ^ commas(map string_of_arity funcs) ^ "].\n" ;
quigley@17150
   462
wenzelm@24310
   463
fun string_of_symbols predstr funcstr =
paulson@17234
   464
  "list_of_symbols.\n" ^ predstr  ^ funcstr  ^ "end_of_list.\n\n";
quigley@17150
   465
paulson@18798
   466
fun string_of_start name = "begin_problem(" ^ name ^ ").\n\n";
quigley@17150
   467
wenzelm@24310
   468
fun string_of_descrip name =
wenzelm@24310
   469
  "list_of_descriptions.\nname({*" ^ name ^
paulson@18868
   470
  "*}).\nauthor({*Isabelle*}).\nstatus(unknown).\ndescription({*auto-generated*}).\nend_of_list.\n\n"
quigley@17150
   471
paulson@18863
   472
fun dfg_tfree_clause tfree_lit =
paulson@21509
   473
  "clause( %(negated_conjecture)\n" ^ "or( " ^ tfree_lit ^ "),\n" ^ "tfree_tcs" ^ ").\n\n"
paulson@18863
   474
paulson@22643
   475
fun dfg_of_arLit (TConsLit (c,t,args)) =
paulson@22643
   476
      dfg_sign true (make_type_class c ^ "(" ^ t ^ paren_pack args ^ ")")
paulson@22643
   477
  | dfg_of_arLit (TVarLit (c,str)) =
paulson@22643
   478
      dfg_sign false (make_type_class c ^ "(" ^ str ^ ")")
wenzelm@24310
   479
paulson@20038
   480
fun dfg_classrelLits sub sup =  "not(" ^ sub ^ "(T)), " ^ sup ^ "(T)";
paulson@17525
   481
paulson@18868
   482
fun dfg_classrelClause (ClassrelClause {axiom_name,subclass,superclass,...}) =
paulson@18868
   483
  "clause(forall([T],\nor( " ^ dfg_classrelLits subclass superclass ^ ")),\n" ^
paulson@18868
   484
  axiom_name ^ ").\n\n";
wenzelm@24310
   485
paulson@21560
   486
fun string_of_ar axiom_name = arclause_prefix ^ ascii_of axiom_name;
paulson@21560
   487
paulson@24937
   488
fun dfg_arity_clause (ArityClause{axiom_name,conclLit,premLits,...}) =
paulson@22643
   489
  let val TConsLit (_,_,tvars) = conclLit
paulson@18868
   490
      val lits = map dfg_of_arLit (conclLit :: premLits)
paulson@18863
   491
  in
paulson@24937
   492
      "clause( %(axiom)\n" ^
paulson@18868
   493
      dfg_forall tvars ("or( " ^ commas lits ^ ")") ^ ",\n" ^
paulson@21560
   494
      string_of_ar axiom_name ^ ").\n\n"
paulson@18863
   495
  end;
paulson@18863
   496
quigley@17150
   497
paulson@18869
   498
(**** Produce TPTP files ****)
paulson@18868
   499
paulson@18868
   500
(*Attach sign in TPTP syntax: false means negate.*)
paulson@21509
   501
fun tptp_sign true s = s
paulson@21509
   502
  | tptp_sign false s = "~ " ^ s
paulson@18868
   503
paulson@24937
   504
fun tptp_of_typeLit pos (LTVar (s,ty))  = tptp_sign pos (s ^ "(" ^ ty ^ ")")
paulson@24937
   505
  | tptp_of_typeLit pos (LTFree (s,ty)) = tptp_sign pos  (s ^ "(" ^ ty ^ ")");
wenzelm@24310
   506
paulson@24937
   507
fun gen_tptp_cls (cls_id,ax_name,Axiom,lits,tylits) =
paulson@24937
   508
      "cnf(" ^ string_of_clausename (cls_id,ax_name) ^ ",axiom," ^ 
paulson@24937
   509
               tptp_pack (tylits@lits) ^ ").\n"
paulson@24937
   510
  | gen_tptp_cls (cls_id,ax_name,Conjecture,lits,_) =
paulson@24937
   511
      "cnf(" ^ string_of_clausename (cls_id,ax_name) ^ ",negated_conjecture," ^ 
paulson@24937
   512
               tptp_pack lits ^ ").\n";
paulson@15347
   513
paulson@18863
   514
fun tptp_tfree_clause tfree_lit =
paulson@21509
   515
    "cnf(" ^ "tfree_tcs," ^ "negated_conjecture" ^ "," ^ tptp_pack[tfree_lit] ^ ").\n";
wenzelm@24310
   516
paulson@22643
   517
fun tptp_of_arLit (TConsLit (c,t,args)) =
paulson@22643
   518
      tptp_sign true (make_type_class c ^ "(" ^ t ^ paren_pack args ^ ")")
paulson@22643
   519
  | tptp_of_arLit (TVarLit (c,str)) =
paulson@22643
   520
      tptp_sign false (make_type_class c ^ "(" ^ str ^ ")")
wenzelm@24310
   521
paulson@24937
   522
fun tptp_arity_clause (ArityClause{axiom_name,conclLit,premLits,...}) =
paulson@24937
   523
  "cnf(" ^ string_of_ar axiom_name ^ ",axiom," ^
paulson@21560
   524
  tptp_pack (map tptp_of_arLit (conclLit :: premLits)) ^ ").\n";
paulson@15347
   525
wenzelm@24310
   526
fun tptp_classrelLits sub sup =
paulson@21509
   527
  let val tvar = "(T)"
paulson@21509
   528
  in  tptp_pack [tptp_sign false (sub^tvar), tptp_sign true (sup^tvar)]  end;
paulson@15347
   529
paulson@18868
   530
fun tptp_classrelClause (ClassrelClause {axiom_name,subclass,superclass,...}) =
wenzelm@24310
   531
  "cnf(" ^ axiom_name ^ ",axiom," ^ tptp_classrelLits subclass superclass ^ ").\n"
quigley@17150
   532
paulson@15347
   533
end;