src/HOL/Tools/Sledgehammer/metis_clauses.ML
author blanchet
Mon Jul 26 17:03:21 2010 +0200 (2010-07-26)
changeset 37995 06f02b15ef8a
parent 37994 b04307085a09
child 38024 e4a95eb5530e
permissions -rw-r--r--
generate full first-order formulas (FOF) in Sledgehammer
blanchet@37578
     1
(*  Title:      HOL/Tools/Sledgehammer/metis_clauses.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.
paulson@15347
     7
*)
paulson@15347
     8
blanchet@37578
     9
signature METIS_CLAUSES =
wenzelm@24310
    10
sig
blanchet@37577
    11
  type name = string * string
blanchet@37577
    12
  datatype kind = Axiom | Conjecture
blanchet@37577
    13
  datatype type_literal =
blanchet@37643
    14
    TyLitVar of name * name |
blanchet@37643
    15
    TyLitFree of name * name
blanchet@37577
    16
  datatype arLit =
blanchet@37643
    17
    TConsLit of name * name * name list |
blanchet@37643
    18
    TVarLit of name * name
blanchet@37577
    19
  datatype arity_clause = ArityClause of
blanchet@37577
    20
   {axiom_name: string, conclLit: arLit, premLits: arLit list}
blanchet@37925
    21
  datatype class_rel_clause = ClassRelClause of
blanchet@37643
    22
   {axiom_name: string, subclass: name, superclass: name}
blanchet@37577
    23
  datatype combtyp =
blanchet@37924
    24
    CombTVar of name |
blanchet@37924
    25
    CombTFree of name |
blanchet@37924
    26
    CombType of name * combtyp list
blanchet@37577
    27
  datatype combterm =
blanchet@37577
    28
    CombConst of name * combtyp * combtyp list (* Const and Free *) |
blanchet@37577
    29
    CombVar of name * combtyp |
blanchet@37577
    30
    CombApp of combterm * combterm
blanchet@37923
    31
  datatype fol_literal = FOLLiteral of bool * combterm
blanchet@37922
    32
  datatype fol_clause =
blanchet@37922
    33
    FOLClause of {clause_id: int, axiom_name: string, th: thm, kind: kind,
blanchet@37923
    34
                  literals: fol_literal list, ctypes_sorts: typ list}
blanchet@37577
    35
blanchet@37509
    36
  val type_wrapper_name : string
blanchet@37995
    37
  val bound_var_prefix : string
wenzelm@24310
    38
  val schematic_var_prefix: string
wenzelm@24310
    39
  val fixed_var_prefix: string
wenzelm@24310
    40
  val tvar_prefix: string
wenzelm@24310
    41
  val tfree_prefix: string
wenzelm@24310
    42
  val const_prefix: string
blanchet@37643
    43
  val type_const_prefix: string
wenzelm@24310
    44
  val class_prefix: string
wenzelm@24310
    45
  val union_all: ''a list list -> ''a list
blanchet@37572
    46
  val invert_const: string -> string
wenzelm@24310
    47
  val ascii_of: string -> string
wenzelm@24310
    48
  val undo_ascii_of: string -> string
blanchet@37992
    49
  val strip_prefix_and_undo_ascii: string -> string -> string option
blanchet@37995
    50
  val make_bound_var : string -> string
wenzelm@24310
    51
  val make_schematic_var : string * int -> string
paulson@18868
    52
  val make_fixed_var : string -> string
paulson@18868
    53
  val make_schematic_type_var : string * int -> string
wenzelm@24310
    54
  val make_fixed_type_var : string -> string
blanchet@37498
    55
  val make_fixed_const : string -> string
blanchet@37498
    56
  val make_fixed_type_const : string -> string
paulson@18868
    57
  val make_type_class : string -> string
blanchet@37618
    58
  val skolem_theory_name: string
blanchet@37618
    59
  val skolem_prefix: string
blanchet@37618
    60
  val skolem_infix: string
blanchet@37618
    61
  val is_skolem_const_name: string -> bool
blanchet@37618
    62
  val num_type_args: theory -> string -> int
blanchet@36966
    63
  val type_literals_for_types : typ list -> type_literal list
blanchet@37925
    64
  val make_class_rel_clauses: theory -> class list -> class list -> class_rel_clause list
blanchet@35865
    65
  val make_arity_clauses: theory -> string list -> class list -> class list * arity_clause list
blanchet@37994
    66
  val combtyp_of : combterm -> combtyp
blanchet@37577
    67
  val strip_combterm_comb : combterm -> combterm * combterm list
blanchet@37995
    68
  val combterm_from_term :
blanchet@37995
    69
    theory -> (string * typ) list -> term -> combterm * typ list
blanchet@37923
    70
  val literals_of_term : theory -> term -> fol_literal list * typ list
blanchet@37625
    71
  val conceal_skolem_terms :
blanchet@37577
    72
    int -> (string * term) list -> term -> (string * term) list * term
blanchet@37632
    73
  val reveal_skolem_terms : (string * term) list -> term -> term
blanchet@37577
    74
  val tfree_classes_of_terms : term list -> string list
blanchet@37577
    75
  val tvar_classes_of_terms : term list -> string list
blanchet@37577
    76
  val type_consts_of_terms : theory -> term list -> string list
wenzelm@24310
    77
end
paulson@15347
    78
blanchet@37578
    79
structure Metis_Clauses : METIS_CLAUSES =
paulson@15347
    80
struct
paulson@15347
    81
blanchet@37509
    82
val type_wrapper_name = "ti"
blanchet@37509
    83
blanchet@37995
    84
val bound_var_prefix = "B_"
blanchet@37995
    85
val schematic_var_prefix = "V_"
blanchet@37995
    86
val fixed_var_prefix = "v_"
paulson@15347
    87
paulson@17230
    88
val tvar_prefix = "T_";
paulson@17230
    89
val tfree_prefix = "t_";
paulson@15347
    90
blanchet@37925
    91
val class_rel_clause_prefix = "clsrel_";
paulson@15347
    92
paulson@17230
    93
val const_prefix = "c_";
blanchet@37643
    94
val type_const_prefix = "tc_";
wenzelm@24310
    95
val class_prefix = "class_";
paulson@15347
    96
blanchet@36218
    97
fun union_all xss = fold (union (op =)) xss []
paulson@17775
    98
blanchet@36493
    99
(* Readable names for the more common symbolic functions. Do not mess with the
blanchet@37479
   100
   last nine entries of the table unless you know what you are doing. *)
paulson@15347
   101
val const_trans_table =
haftmann@37678
   102
  Symtab.make [(@{type_name Product_Type.prod}, "prod"),
haftmann@37678
   103
               (@{type_name Sum_Type.sum}, "sum"),
blanchet@37643
   104
               (@{const_name "op ="}, "equal"),
blanchet@35865
   105
               (@{const_name "op &"}, "and"),
blanchet@35865
   106
               (@{const_name "op |"}, "or"),
blanchet@35865
   107
               (@{const_name "op -->"}, "implies"),
haftmann@37678
   108
               (@{const_name Set.member}, "in"),
blanchet@36493
   109
               (@{const_name fequal}, "fequal"),
blanchet@36493
   110
               (@{const_name COMBI}, "COMBI"),
blanchet@36493
   111
               (@{const_name COMBK}, "COMBK"),
blanchet@36493
   112
               (@{const_name COMBB}, "COMBB"),
blanchet@36493
   113
               (@{const_name COMBC}, "COMBC"),
blanchet@37479
   114
               (@{const_name COMBS}, "COMBS"),
blanchet@37479
   115
               (@{const_name True}, "True"),
blanchet@37479
   116
               (@{const_name False}, "False"),
blanchet@37643
   117
               (@{const_name If}, "If")]
paulson@15347
   118
blanchet@37572
   119
(* Invert the table of translations between Isabelle and ATPs. *)
blanchet@37572
   120
val const_trans_table_inv =
blanchet@37572
   121
  Symtab.update ("fequal", @{const_name "op ="})
blanchet@37572
   122
                (Symtab.make (map swap (Symtab.dest const_trans_table)))
blanchet@37572
   123
blanchet@37572
   124
val invert_const = perhaps (Symtab.lookup const_trans_table_inv)
paulson@15347
   125
paulson@15610
   126
(*Escaping of special characters.
paulson@15610
   127
  Alphanumeric characters are left unchanged.
paulson@15610
   128
  The character _ goes to __
paulson@15610
   129
  Characters in the range ASCII space to / go to _A to _P, respectively.
paulson@24183
   130
  Other printing characters go to _nnn where nnn is the decimal ASCII code.*)
paulson@24183
   131
val A_minus_space = Char.ord #"A" - Char.ord #" ";
paulson@15610
   132
paulson@24183
   133
fun stringN_of_int 0 _ = ""
paulson@24183
   134
  | stringN_of_int k n = stringN_of_int (k-1) (n div 10) ^ Int.toString (n mod 10);
paulson@15610
   135
paulson@15347
   136
fun ascii_of_c c =
paulson@15610
   137
  if Char.isAlphaNum c then String.str c
paulson@15610
   138
  else if c = #"_" then "__"
wenzelm@24310
   139
  else if #" " <= c andalso c <= #"/"
paulson@15610
   140
       then "_" ^ String.str (Char.chr (Char.ord c + A_minus_space))
wenzelm@24310
   141
  else if Char.isPrint c
paulson@24183
   142
       then ("_" ^ stringN_of_int 3 (Char.ord c))  (*fixed width, in case more digits follow*)
paulson@15610
   143
  else ""
paulson@15347
   144
paulson@15610
   145
val ascii_of = String.translate ascii_of_c;
paulson@15610
   146
paulson@24183
   147
(** Remove ASCII armouring from names in proof files **)
paulson@24183
   148
paulson@24183
   149
(*We don't raise error exceptions because this code can run inside the watcher.
paulson@24183
   150
  Also, the errors are "impossible" (hah!)*)
paulson@24183
   151
fun undo_ascii_aux rcs [] = String.implode(rev rcs)
paulson@24183
   152
  | undo_ascii_aux rcs [#"_"] = undo_ascii_aux (#"_"::rcs) []  (*ERROR*)
paulson@24183
   153
      (*Three types of _ escapes: __, _A to _P, _nnn*)
paulson@24183
   154
  | undo_ascii_aux rcs (#"_" :: #"_" :: cs) = undo_ascii_aux (#"_"::rcs) cs
wenzelm@24310
   155
  | undo_ascii_aux rcs (#"_" :: c :: cs) =
paulson@24183
   156
      if #"A" <= c andalso c<= #"P"  (*translation of #" " to #"/"*)
paulson@24183
   157
      then undo_ascii_aux (Char.chr(Char.ord c - A_minus_space) :: rcs) cs
wenzelm@24310
   158
      else
paulson@24183
   159
        let val digits = List.take (c::cs, 3) handle Subscript => []
wenzelm@24310
   160
        in
paulson@24183
   161
            case Int.fromString (String.implode digits) of
paulson@24183
   162
                NONE => undo_ascii_aux (c:: #"_"::rcs) cs  (*ERROR*)
paulson@24183
   163
              | SOME n => undo_ascii_aux (Char.chr n :: rcs) (List.drop (cs, 2))
paulson@24183
   164
        end
paulson@24183
   165
  | undo_ascii_aux rcs (c::cs) = undo_ascii_aux (c::rcs) cs;
paulson@24183
   166
paulson@24183
   167
val undo_ascii_of = undo_ascii_aux [] o String.explode;
paulson@15347
   168
blanchet@37572
   169
(* If string s has the prefix s1, return the result of deleting it,
blanchet@37572
   170
   un-ASCII'd. *)
blanchet@37992
   171
fun strip_prefix_and_undo_ascii s1 s =
blanchet@37572
   172
  if String.isPrefix s1 s then
blanchet@37572
   173
    SOME (undo_ascii_of (String.extract (s, size s1, NONE)))
blanchet@37572
   174
  else
blanchet@37572
   175
    NONE
blanchet@37572
   176
paulson@16925
   177
(*Remove the initial ' character from a type variable, if it is present*)
paulson@16925
   178
fun trim_type_var s =
paulson@16925
   179
  if s <> "" andalso String.sub(s,0) = #"'" then String.extract(s,1,NONE)
paulson@16925
   180
  else error ("trim_type: Malformed type variable encountered: " ^ s);
paulson@16925
   181
paulson@16903
   182
fun ascii_of_indexname (v,0) = ascii_of v
paulson@17525
   183
  | ascii_of_indexname (v,i) = ascii_of v ^ "_" ^ Int.toString i;
paulson@15347
   184
blanchet@37995
   185
fun make_bound_var x = bound_var_prefix ^ ascii_of x
blanchet@37995
   186
fun make_schematic_var v = schematic_var_prefix ^ ascii_of_indexname v
blanchet@37995
   187
fun make_fixed_var x = fixed_var_prefix ^ ascii_of x
paulson@15347
   188
wenzelm@24310
   189
fun make_schematic_type_var (x,i) =
paulson@16925
   190
      tvar_prefix ^ (ascii_of_indexname (trim_type_var x,i));
paulson@16925
   191
fun make_fixed_type_var x = tfree_prefix ^ (ascii_of (trim_type_var x));
paulson@15347
   192
blanchet@37498
   193
fun lookup_const c =
blanchet@37498
   194
  case Symtab.lookup const_trans_table c of
blanchet@37498
   195
    SOME c' => c'
blanchet@37498
   196
  | NONE => ascii_of c
paulson@23075
   197
blanchet@36062
   198
(* "op =" MUST BE "equal" because it's built into ATPs. *)
blanchet@37498
   199
fun make_fixed_const @{const_name "op ="} = "equal"
blanchet@37498
   200
  | make_fixed_const c = const_prefix ^ lookup_const c
paulson@18411
   201
blanchet@37643
   202
fun make_fixed_type_const c = type_const_prefix ^ lookup_const c
quigley@17150
   203
wenzelm@17261
   204
fun make_type_class clas = class_prefix ^ ascii_of clas;
quigley@17150
   205
blanchet@37618
   206
val skolem_theory_name = "Sledgehammer" ^ Long_Name.separator ^ "Sko"
blanchet@37618
   207
val skolem_prefix = "sko_"
blanchet@37618
   208
val skolem_infix = "$"
blanchet@37618
   209
blanchet@37618
   210
(* Hack: Could return false positives (e.g., a user happens to declare a
blanchet@37618
   211
   constant called "SomeTheory.sko_means_shoe_in_$wedish". *)
blanchet@37618
   212
val is_skolem_const_name =
blanchet@37618
   213
  Long_Name.base_name
blanchet@37618
   214
  #> String.isPrefix skolem_prefix andf String.isSubstring skolem_infix
blanchet@37618
   215
blanchet@37618
   216
(* The number of type arguments of a constant, zero if it's monomorphic. For
blanchet@37618
   217
   (instances of) Skolem pseudoconstants, this information is encoded in the
blanchet@37618
   218
   constant name. *)
blanchet@37618
   219
fun num_type_args thy s =
blanchet@37618
   220
  if String.isPrefix skolem_theory_name s then
blanchet@37618
   221
    s |> unprefix skolem_theory_name
blanchet@37618
   222
      |> space_explode skolem_infix |> hd
blanchet@37618
   223
      |> space_explode "_" |> List.last |> Int.fromString |> the
blanchet@37618
   224
  else
blanchet@37618
   225
    (s, Sign.the_const_type thy s) |> Sign.const_typargs thy |> length
quigley@17150
   226
blanchet@37624
   227
(**** Definitions and functions for FOL clauses for TPTP format output ****)
blanchet@36169
   228
blanchet@37624
   229
type name = string * string
paulson@15347
   230
blanchet@37577
   231
datatype kind = Axiom | Conjecture
paulson@23385
   232
paulson@15347
   233
(**** Isabelle FOL clauses ****)
paulson@15347
   234
blanchet@36556
   235
(* The first component is the type class; the second is a TVar or TFree. *)
blanchet@36556
   236
datatype type_literal =
blanchet@37643
   237
  TyLitVar of name * name |
blanchet@37643
   238
  TyLitFree of name * name
paulson@15347
   239
paulson@17404
   240
exception CLAUSE of string * term;
paulson@15347
   241
wenzelm@24310
   242
(*Make literals for sorted type variables*)
paulson@24940
   243
fun sorts_on_typs_aux (_, [])   = []
paulson@24940
   244
  | sorts_on_typs_aux ((x,i),  s::ss) =
paulson@24940
   245
      let val sorts = sorts_on_typs_aux ((x,i), ss)
paulson@22643
   246
      in
paulson@22643
   247
          if s = "HOL.type" then sorts
blanchet@37643
   248
          else if i = ~1 then TyLitFree (`make_type_class s, `make_fixed_type_var x) :: sorts
blanchet@37643
   249
          else TyLitVar (`make_type_class s, (make_schematic_type_var (x,i), x)) :: sorts
paulson@22643
   250
      end;
quigley@17150
   251
paulson@24940
   252
fun sorts_on_typs (TFree (a,s)) = sorts_on_typs_aux ((a,~1),s)
paulson@24940
   253
  | sorts_on_typs (TVar (v,s))  = sorts_on_typs_aux (v,s);
paulson@24940
   254
paulson@24937
   255
(*Given a list of sorted type variables, return a list of type literals.*)
blanchet@36966
   256
fun type_literals_for_types Ts =
blanchet@36966
   257
  fold (union (op =)) (map sorts_on_typs Ts) []
mengj@20015
   258
mengj@20015
   259
(** make axiom and conjecture clauses. **)
mengj@20015
   260
paulson@15347
   261
(**** Isabelle arities ****)
paulson@15347
   262
blanchet@37643
   263
datatype arLit =
blanchet@37643
   264
  TConsLit of name * name * name list |
blanchet@37643
   265
  TVarLit of name * name
wenzelm@24310
   266
blanchet@35865
   267
datatype arity_clause =
blanchet@37500
   268
  ArityClause of {axiom_name: string, conclLit: arLit, premLits: arLit list}
paulson@15347
   269
paulson@15347
   270
paulson@18798
   271
fun gen_TVars 0 = []
paulson@18798
   272
  | gen_TVars n = ("T_" ^ Int.toString n) :: gen_TVars (n-1);
paulson@15347
   273
paulson@18411
   274
fun pack_sort(_,[])  = []
blanchet@37643
   275
  | pack_sort(tvar, "HOL.type"::srt) = pack_sort (tvar, srt)   (*IGNORE sort "type"*)
blanchet@37643
   276
  | pack_sort(tvar, cls::srt) =
blanchet@37643
   277
    (`make_type_class cls, (tvar, tvar)) :: pack_sort (tvar, srt)
wenzelm@24310
   278
paulson@18411
   279
(*Arity of type constructor tcon :: (arg1,...,argN)res*)
blanchet@37498
   280
fun make_axiom_arity_clause (tcons, axiom_name, (cls,args)) =
blanchet@37643
   281
  let
blanchet@37643
   282
    val tvars = gen_TVars (length args)
blanchet@37643
   283
    val tvars_srts = ListPair.zip (tvars, args)
blanchet@37643
   284
  in
blanchet@37643
   285
    ArityClause {axiom_name = axiom_name, 
blanchet@37643
   286
                 conclLit = TConsLit (`make_type_class cls,
blanchet@37643
   287
                                      `make_fixed_type_const tcons,
blanchet@37643
   288
                                      tvars ~~ tvars),
blanchet@37643
   289
                 premLits = map TVarLit (union_all (map pack_sort tvars_srts))}
blanchet@37643
   290
  end
paulson@15347
   291
paulson@15347
   292
paulson@15347
   293
(**** Isabelle class relations ****)
paulson@15347
   294
blanchet@37925
   295
datatype class_rel_clause =
blanchet@37925
   296
  ClassRelClause of {axiom_name: string, subclass: name, superclass: name}
wenzelm@24310
   297
paulson@21290
   298
(*Generate all pairs (sub,super) such that sub is a proper subclass of super in theory thy.*)
blanchet@37498
   299
fun class_pairs _ [] _ = []
paulson@21432
   300
  | class_pairs thy subs supers =
blanchet@36218
   301
      let
blanchet@36218
   302
        val class_less = Sorts.class_less (Sign.classes_of thy)
blanchet@36218
   303
        fun add_super sub super = class_less (sub, super) ? cons (sub, super)
blanchet@36218
   304
        fun add_supers sub = fold (add_super sub) supers
blanchet@36218
   305
      in fold add_supers subs [] end
paulson@15347
   306
blanchet@37925
   307
fun make_class_rel_clause (sub,super) =
blanchet@37925
   308
  ClassRelClause {axiom_name = class_rel_clause_prefix ^ ascii_of sub ^ "_" ^
blanchet@37509
   309
                               ascii_of super,
blanchet@37643
   310
                  subclass = `make_type_class sub,
blanchet@37643
   311
                  superclass = `make_type_class super};
paulson@15347
   312
blanchet@37925
   313
fun make_class_rel_clauses thy subs supers =
blanchet@37925
   314
  map make_class_rel_clause (class_pairs thy subs supers);
paulson@18868
   315
paulson@18868
   316
paulson@18868
   317
(** Isabelle arities **)
paulson@17845
   318
blanchet@37498
   319
fun arity_clause _ _ (_, []) = []
blanchet@37498
   320
  | arity_clause seen n (tcons, ("HOL.type",_)::ars) =  (*ignore*)
blanchet@37498
   321
      arity_clause seen n (tcons,ars)
blanchet@37498
   322
  | arity_clause seen n (tcons, (ar as (class,_)) :: ars) =
haftmann@36692
   323
      if member (op =) seen class then (*multiple arities for the same tycon, class pair*)
blanchet@37572
   324
          make_axiom_arity_clause (tcons, lookup_const tcons ^ "_" ^ class ^ "_" ^ Int.toString n, ar) ::
blanchet@37498
   325
          arity_clause seen (n+1) (tcons,ars)
paulson@21373
   326
      else
blanchet@37572
   327
          make_axiom_arity_clause (tcons, lookup_const tcons ^ "_" ^ class, ar) ::
blanchet@37498
   328
          arity_clause (class::seen) n (tcons,ars)
paulson@17845
   329
blanchet@37498
   330
fun multi_arity_clause [] = []
blanchet@37498
   331
  | multi_arity_clause ((tcons, ars) :: tc_arlists) =
blanchet@37498
   332
      arity_clause [] 1 (tcons, ars) @ multi_arity_clause tc_arlists
paulson@17845
   333
paulson@22643
   334
(*Generate all pairs (tycon,class,sorts) such that tycon belongs to class in theory thy
paulson@22643
   335
  provided its arguments have the corresponding sorts.*)
paulson@21373
   336
fun type_class_pairs thy tycons classes =
paulson@21373
   337
  let val alg = Sign.classes_of thy
blanchet@36218
   338
      fun domain_sorts tycon = Sorts.mg_domain alg tycon o single
blanchet@36218
   339
      fun add_class tycon class =
blanchet@36218
   340
        cons (class, domain_sorts tycon class)
blanchet@36218
   341
        handle Sorts.CLASS_ERROR _ => I
blanchet@36218
   342
      fun try_classes tycon = (tycon, fold (add_class tycon) classes [])
paulson@21373
   343
  in  map try_classes tycons  end;
paulson@21373
   344
paulson@22643
   345
(*Proving one (tycon, class) membership may require proving others, so iterate.*)
blanchet@37498
   346
fun iter_type_class_pairs _ _ [] = ([], [])
paulson@22643
   347
  | iter_type_class_pairs thy tycons classes =
paulson@22643
   348
      let val cpairs = type_class_pairs thy tycons classes
haftmann@33040
   349
          val newclasses = union_all (union_all (union_all (map (map #2 o #2) cpairs)))
haftmann@33040
   350
            |> subtract (op =) classes |> subtract (op =) HOLogic.typeS
wenzelm@24310
   351
          val (classes', cpairs') = iter_type_class_pairs thy tycons newclasses
haftmann@33042
   352
      in (union (op =) classes' classes, union (op =) cpairs' cpairs) end;
wenzelm@24310
   353
blanchet@37498
   354
fun make_arity_clauses thy tycons classes =
wenzelm@24310
   355
  let val (classes', cpairs) = iter_type_class_pairs thy tycons classes
blanchet@37498
   356
  in  (classes', multi_arity_clause cpairs)  end;
paulson@18863
   357
blanchet@37577
   358
datatype combtyp =
blanchet@37924
   359
  CombTVar of name |
blanchet@37924
   360
  CombTFree of name |
blanchet@37924
   361
  CombType of name * combtyp list
blanchet@37577
   362
blanchet@37577
   363
datatype combterm =
blanchet@37577
   364
  CombConst of name * combtyp * combtyp list (* Const and Free *) |
blanchet@37577
   365
  CombVar of name * combtyp |
blanchet@37577
   366
  CombApp of combterm * combterm
blanchet@37577
   367
blanchet@37923
   368
datatype fol_literal = FOLLiteral of bool * combterm
blanchet@37577
   369
blanchet@37922
   370
datatype fol_clause =
blanchet@37922
   371
  FOLClause of {clause_id: int, axiom_name: string, th: thm, kind: kind,
blanchet@37923
   372
                literals: fol_literal list, ctypes_sorts: typ list}
blanchet@37577
   373
blanchet@37577
   374
(*********************************************************************)
blanchet@37577
   375
(* convert a clause with type Term.term to a clause with type clause *)
blanchet@37577
   376
(*********************************************************************)
blanchet@37577
   377
blanchet@37577
   378
(*Result of a function type; no need to check that the argument type matches.*)
blanchet@37924
   379
fun result_type (CombType (_, [_, tp2])) = tp2
blanchet@37577
   380
  | result_type _ = raise Fail "non-function type"
blanchet@37577
   381
blanchet@37994
   382
fun combtyp_of (CombConst (_, tp, _)) = tp
blanchet@37994
   383
  | combtyp_of (CombVar (_, tp)) = tp
blanchet@37994
   384
  | combtyp_of (CombApp (t1, _)) = result_type (combtyp_of t1)
blanchet@37577
   385
blanchet@37577
   386
(*gets the head of a combinator application, along with the list of arguments*)
blanchet@37577
   387
fun strip_combterm_comb u =
blanchet@37577
   388
    let fun stripc (CombApp(t,u), ts) = stripc (t, u::ts)
blanchet@37577
   389
        |   stripc  x =  x
blanchet@37577
   390
    in stripc(u,[]) end
blanchet@37577
   391
blanchet@37577
   392
fun type_of (Type (a, Ts)) =
blanchet@37577
   393
    let val (folTypes,ts) = types_of Ts in
blanchet@37924
   394
      (CombType (`make_fixed_type_const a, folTypes), ts)
blanchet@37577
   395
    end
blanchet@37924
   396
  | type_of (tp as TFree (a, _)) = (CombTFree (`make_fixed_type_var a), [tp])
blanchet@37577
   397
  | type_of (tp as TVar (x, _)) =
blanchet@37924
   398
    (CombTVar (make_schematic_type_var x, string_of_indexname x), [tp])
blanchet@37577
   399
and types_of Ts =
blanchet@37577
   400
    let val (folTyps, ts) = ListPair.unzip (map type_of Ts) in
blanchet@37577
   401
      (folTyps, union_all ts)
blanchet@37577
   402
    end
blanchet@37577
   403
blanchet@37577
   404
(* same as above, but no gathering of sort information *)
blanchet@37577
   405
fun simp_type_of (Type (a, Ts)) =
blanchet@37924
   406
      CombType (`make_fixed_type_const a, map simp_type_of Ts)
blanchet@37924
   407
  | simp_type_of (TFree (a, _)) = CombTFree (`make_fixed_type_var a)
blanchet@37577
   408
  | simp_type_of (TVar (x, _)) =
blanchet@37924
   409
    CombTVar (make_schematic_type_var x, string_of_indexname x)
blanchet@37577
   410
blanchet@37995
   411
(* Converts a term (with combinators) into a combterm. Also accummulates sort
blanchet@37995
   412
   infomation. *)
blanchet@37995
   413
fun combterm_from_term thy bs (P $ Q) =
blanchet@37995
   414
      let val (P', tsP) = combterm_from_term thy bs P
blanchet@37995
   415
          val (Q', tsQ) = combterm_from_term thy bs Q
blanchet@37995
   416
      in  (CombApp (P', Q'), union (op =) tsP tsQ)  end
blanchet@37995
   417
  | combterm_from_term thy _ (Const (c, T)) =
blanchet@37577
   418
      let
blanchet@37577
   419
        val (tp, ts) = type_of T
blanchet@37577
   420
        val tvar_list =
blanchet@37577
   421
          (if String.isPrefix skolem_theory_name c then
blanchet@37577
   422
             [] |> Term.add_tvarsT T |> map TVar
blanchet@37577
   423
           else
blanchet@37577
   424
             (c, T) |> Sign.const_typargs thy)
blanchet@37577
   425
          |> map simp_type_of
blanchet@37577
   426
        val c' = CombConst (`make_fixed_const c, tp, tvar_list)
blanchet@37577
   427
      in  (c',ts)  end
blanchet@37995
   428
  | combterm_from_term _ _ (Free (v, T)) =
blanchet@37577
   429
      let val (tp,ts) = type_of T
blanchet@37577
   430
          val v' = CombConst (`make_fixed_var v, tp, [])
blanchet@37577
   431
      in  (v',ts)  end
blanchet@37995
   432
  | combterm_from_term _ _ (Var (v, T)) =
blanchet@37577
   433
      let val (tp,ts) = type_of T
blanchet@37577
   434
          val v' = CombVar ((make_schematic_var v, string_of_indexname v), tp)
blanchet@37577
   435
      in  (v',ts)  end
blanchet@37995
   436
  | combterm_from_term _ bs (Bound j) =
blanchet@37995
   437
      let
blanchet@37995
   438
        val (s, T) = nth bs j
blanchet@37995
   439
        val (tp, ts) = type_of T
blanchet@37995
   440
        val v' = CombConst (`make_bound_var s, tp, [])
blanchet@37995
   441
      in (v', ts) end
blanchet@37995
   442
  | combterm_from_term _ _ (Abs _) = raise Fail "HOL clause: Abs"
blanchet@37577
   443
blanchet@37577
   444
fun predicate_of thy ((@{const Not} $ P), pos) = predicate_of thy (P, not pos)
blanchet@37995
   445
  | predicate_of thy (t, pos) =
blanchet@37995
   446
    (combterm_from_term thy [] (Envir.eta_contract t), pos)
blanchet@37577
   447
blanchet@37577
   448
fun literals_of_term1 args thy (@{const Trueprop} $ P) =
blanchet@37577
   449
    literals_of_term1 args thy P
blanchet@37577
   450
  | literals_of_term1 args thy (@{const "op |"} $ P $ Q) =
blanchet@37577
   451
    literals_of_term1 (literals_of_term1 args thy P) thy Q
blanchet@37577
   452
  | literals_of_term1 (lits, ts) thy P =
blanchet@37577
   453
    let val ((pred, ts'), pol) = predicate_of thy (P, true) in
blanchet@37923
   454
      (FOLLiteral (pol, pred) :: lits, union (op =) ts ts')
blanchet@37577
   455
    end
blanchet@37577
   456
val literals_of_term = literals_of_term1 ([], [])
blanchet@37577
   457
blanchet@37577
   458
fun skolem_name i j num_T_args =
blanchet@37577
   459
  skolem_prefix ^ (space_implode "_" (map Int.toString [i, j, num_T_args])) ^
blanchet@37577
   460
  skolem_infix ^ "g"
blanchet@37577
   461
blanchet@37625
   462
fun conceal_skolem_terms i skolems t =
blanchet@37577
   463
  if exists_Const (curry (op =) @{const_name skolem_id} o fst) t then
blanchet@37577
   464
    let
blanchet@37625
   465
      fun aux skolems
blanchet@37577
   466
              (t as (Const (@{const_name skolem_id}, Type (_, [_, T])) $ _)) =
blanchet@37577
   467
          let
blanchet@37625
   468
            val (skolems, s) =
blanchet@37577
   469
              if i = ~1 then
blanchet@37625
   470
                (skolems, @{const_name undefined})
blanchet@37625
   471
              else case AList.find (op aconv) skolems t of
blanchet@37625
   472
                s :: _ => (skolems, s)
blanchet@37577
   473
              | [] =>
blanchet@37577
   474
                let
blanchet@37577
   475
                  val s = skolem_theory_name ^ "." ^
blanchet@37625
   476
                          skolem_name i (length skolems)
blanchet@37577
   477
                                        (length (Term.add_tvarsT T []))
blanchet@37625
   478
                in ((s, t) :: skolems, s) end
blanchet@37625
   479
          in (skolems, Const (s, T)) end
blanchet@37625
   480
        | aux skolems (t1 $ t2) =
blanchet@37577
   481
          let
blanchet@37625
   482
            val (skolems, t1) = aux skolems t1
blanchet@37625
   483
            val (skolems, t2) = aux skolems t2
blanchet@37625
   484
          in (skolems, t1 $ t2) end
blanchet@37625
   485
        | aux skolems (Abs (s, T, t')) =
blanchet@37625
   486
          let val (skolems, t') = aux skolems t' in
blanchet@37625
   487
            (skolems, Abs (s, T, t'))
blanchet@37577
   488
          end
blanchet@37625
   489
        | aux skolems t = (skolems, t)
blanchet@37625
   490
    in aux skolems t end
blanchet@37577
   491
  else
blanchet@37625
   492
    (skolems, t)
blanchet@37577
   493
blanchet@37632
   494
fun reveal_skolem_terms skolems =
blanchet@37632
   495
  map_aterms (fn t as Const (s, _) =>
blanchet@37632
   496
                 if String.isPrefix skolem_theory_name s then
blanchet@37632
   497
                   AList.lookup (op =) skolems s |> the
blanchet@37632
   498
                   |> map_types Type_Infer.paramify_vars
blanchet@37632
   499
                 else
blanchet@37632
   500
                   t
blanchet@37632
   501
               | t => t)
blanchet@37632
   502
blanchet@37577
   503
blanchet@37577
   504
(***************************************************************)
blanchet@37577
   505
(* Type Classes Present in the Axiom or Conjecture Clauses     *)
blanchet@37577
   506
(***************************************************************)
blanchet@37577
   507
blanchet@37577
   508
fun set_insert (x, s) = Symtab.update (x, ()) s
blanchet@37577
   509
blanchet@37577
   510
fun add_classes (sorts, cset) = List.foldl set_insert cset (flat sorts)
blanchet@37577
   511
blanchet@37577
   512
(*Remove this trivial type class*)
blanchet@37577
   513
fun delete_type cset = Symtab.delete_safe (the_single @{sort HOL.type}) cset;
blanchet@37577
   514
blanchet@37577
   515
fun tfree_classes_of_terms ts =
blanchet@37577
   516
  let val sorts_list = map (map #2 o OldTerm.term_tfrees) ts
blanchet@37577
   517
  in  Symtab.keys (delete_type (List.foldl add_classes Symtab.empty sorts_list))  end;
blanchet@37577
   518
blanchet@37577
   519
fun tvar_classes_of_terms ts =
blanchet@37577
   520
  let val sorts_list = map (map #2 o OldTerm.term_tvars) ts
blanchet@37577
   521
  in  Symtab.keys (delete_type (List.foldl add_classes Symtab.empty sorts_list))  end;
blanchet@37577
   522
blanchet@37577
   523
(*fold type constructors*)
blanchet@37577
   524
fun fold_type_consts f (Type (a, Ts)) x = fold (fold_type_consts f) Ts (f (a,x))
blanchet@37577
   525
  | fold_type_consts _ _ x = x;
blanchet@37577
   526
blanchet@37577
   527
(*Type constructors used to instantiate overloaded constants are the only ones needed.*)
blanchet@37577
   528
fun add_type_consts_in_term thy =
blanchet@37577
   529
  let
blanchet@37577
   530
    val const_typargs = Sign.const_typargs thy
blanchet@37577
   531
    fun aux (Const x) = fold (fold_type_consts set_insert) (const_typargs x)
blanchet@37577
   532
      | aux (Abs (_, _, u)) = aux u
blanchet@37577
   533
      | aux (Const (@{const_name skolem_id}, _) $ _) = I
blanchet@37577
   534
      | aux (t $ u) = aux t #> aux u
blanchet@37577
   535
      | aux _ = I
blanchet@37577
   536
  in aux end
blanchet@37577
   537
blanchet@37577
   538
fun type_consts_of_terms thy ts =
blanchet@37577
   539
  Symtab.keys (fold (add_type_consts_in_term thy) ts Symtab.empty);
blanchet@37577
   540
paulson@15347
   541
end;