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