src/HOL/Tools/Predicate_Compile/code_prolog.ML
author wenzelm
Sat Jan 08 17:14:48 2011 +0100 (2011-01-08)
changeset 41472 f6ab14e61604
parent 41307 bb8468ae414e
child 41940 a3b68a7a0e15
permissions -rw-r--r--
misc tuning and comments based on review of Theory_Data, Proof_Data, Generic_Data usage;
bulwahn@38073
     1
(*  Title:      HOL/Tools/Predicate_Compile/code_prolog.ML
bulwahn@38073
     2
    Author:     Lukas Bulwahn, TU Muenchen
bulwahn@38073
     3
bulwahn@38073
     4
Prototype of an code generator for logic programming languages (a.k.a. Prolog)
bulwahn@38073
     5
*)
bulwahn@38073
     6
bulwahn@38073
     7
signature CODE_PROLOG =
bulwahn@38073
     8
sig
bulwahn@38792
     9
  datatype prolog_system = SWI_PROLOG | YAP
bulwahn@38792
    10
  type code_options =
bulwahn@38947
    11
    {ensure_groundness : bool,
bulwahn@39798
    12
     limit_globally : int option,
bulwahn@38947
    13
     limited_types : (typ * int) list,
bulwahn@38959
    14
     limited_predicates : (string list * int) list,
bulwahn@38947
    15
     replacing : ((string * string) * string) list,
bulwahn@39461
    16
     manual_reorder : ((string * int) * int list) list}
bulwahn@39461
    17
  val set_ensure_groundness : code_options -> code_options
bulwahn@39461
    18
  val map_limit_predicates : ((string list * int) list -> (string list * int) list)
bulwahn@39461
    19
    -> code_options -> code_options
bulwahn@38950
    20
  val code_options_of : theory -> code_options 
bulwahn@38950
    21
  val map_code_options : (code_options -> code_options) -> theory -> theory
bulwahn@39461
    22
  
bulwahn@38113
    23
  datatype arith_op = Plus | Minus
bulwahn@38112
    24
  datatype prol_term = Var of string | Cons of string | AppF of string * prol_term list
bulwahn@38113
    25
    | Number of int | ArithOp of arith_op * prol_term list;
bulwahn@38113
    26
  datatype prem = Conj of prem list
bulwahn@38113
    27
    | Rel of string * prol_term list | NotRel of string * prol_term list
bulwahn@38113
    28
    | Eq of prol_term * prol_term | NotEq of prol_term * prol_term
bulwahn@38727
    29
    | ArithEq of prol_term * prol_term | NotArithEq of prol_term * prol_term
bulwahn@38727
    30
    | Ground of string * typ;
bulwahn@38727
    31
bulwahn@38079
    32
  type clause = ((string * prol_term list) * prem);
bulwahn@38073
    33
  type logic_program = clause list;
bulwahn@38079
    34
  type constant_table = (string * string) list
bulwahn@39461
    35
  
bulwahn@39461
    36
  val generate : Predicate_Compile_Aux.mode option * bool ->
bulwahn@39461
    37
    Proof.context -> string -> (logic_program * constant_table)
bulwahn@38079
    38
  val write_program : logic_program -> string
bulwahn@39464
    39
  val run : (Time.time * prolog_system) -> logic_program -> (string * prol_term list) -> string list -> int option -> prol_term list list
bulwahn@39461
    40
  
bulwahn@40924
    41
  val quickcheck : Proof.context -> term -> int -> term list option * Quickcheck.report option
bulwahn@38733
    42
bulwahn@38079
    43
  val trace : bool Unsynchronized.ref
bulwahn@38947
    44
  
bulwahn@38947
    45
  val replace : ((string * string) * string) -> logic_program -> logic_program
bulwahn@38073
    46
end;
bulwahn@38073
    47
bulwahn@38073
    48
structure Code_Prolog : CODE_PROLOG =
bulwahn@38073
    49
struct
bulwahn@38073
    50
bulwahn@38079
    51
(* diagnostic tracing *)
bulwahn@38079
    52
bulwahn@38079
    53
val trace = Unsynchronized.ref false
bulwahn@38079
    54
bulwahn@38079
    55
fun tracing s = if !trace then Output.tracing s else () 
bulwahn@38727
    56
bulwahn@38727
    57
(* code generation options *)
bulwahn@38727
    58
bulwahn@38727
    59
bulwahn@38792
    60
type code_options =
bulwahn@38947
    61
  {ensure_groundness : bool,
bulwahn@39798
    62
   limit_globally : int option,
bulwahn@38947
    63
   limited_types : (typ * int) list,
bulwahn@38959
    64
   limited_predicates : (string list * int) list,
bulwahn@38947
    65
   replacing : ((string * string) * string) list,
bulwahn@39461
    66
   manual_reorder : ((string * int) * int list) list}
bulwahn@39461
    67
bulwahn@38792
    68
bulwahn@39798
    69
fun set_ensure_groundness {ensure_groundness, limit_globally, limited_types, limited_predicates,
bulwahn@39461
    70
  replacing, manual_reorder} =
bulwahn@39798
    71
  {ensure_groundness = true, limit_globally = limit_globally, limited_types = limited_types,
bulwahn@39461
    72
   limited_predicates = limited_predicates, replacing = replacing,
bulwahn@39461
    73
   manual_reorder = manual_reorder}
bulwahn@39461
    74
bulwahn@39798
    75
fun map_limit_predicates f {ensure_groundness, limit_globally, limited_types, limited_predicates,
bulwahn@39461
    76
  replacing, manual_reorder} =
bulwahn@39798
    77
  {ensure_groundness = ensure_groundness, limit_globally = limit_globally, limited_types = limited_types,
bulwahn@39461
    78
   limited_predicates = f limited_predicates, replacing = replacing,
bulwahn@39461
    79
   manual_reorder = manual_reorder}
bulwahn@39798
    80
bulwahn@39798
    81
fun merge_global_limit (NONE, NONE) = NONE
bulwahn@39798
    82
  | merge_global_limit (NONE, SOME n) = SOME n
bulwahn@39798
    83
  | merge_global_limit (SOME n, NONE) = SOME n
wenzelm@41472
    84
  | merge_global_limit (SOME n, SOME m) = SOME (Int.max (n, m))  (* FIXME odd merge *)
bulwahn@39798
    85
   
bulwahn@38950
    86
structure Options = Theory_Data
bulwahn@38950
    87
(
bulwahn@38950
    88
  type T = code_options
bulwahn@39798
    89
  val empty = {ensure_groundness = false, limit_globally = NONE,
bulwahn@39461
    90
    limited_types = [], limited_predicates = [], replacing = [], manual_reorder = []}
bulwahn@38950
    91
  val extend = I;
bulwahn@38950
    92
  fun merge
bulwahn@39798
    93
    ({ensure_groundness = ensure_groundness1, limit_globally = limit_globally1,
bulwahn@39798
    94
      limited_types = limited_types1, limited_predicates = limited_predicates1,
bulwahn@39798
    95
      replacing = replacing1, manual_reorder = manual_reorder1},
bulwahn@39798
    96
     {ensure_groundness = ensure_groundness2, limit_globally = limit_globally2,
bulwahn@39798
    97
      limited_types = limited_types2, limited_predicates = limited_predicates2,
bulwahn@39798
    98
      replacing = replacing2, manual_reorder = manual_reorder2}) =
wenzelm@41472
    99
    {ensure_groundness = ensure_groundness1 orelse ensure_groundness2 (* FIXME odd merge *),
bulwahn@39798
   100
     limit_globally = merge_global_limit (limit_globally1, limit_globally2),
bulwahn@38950
   101
     limited_types = AList.merge (op =) (K true) (limited_types1, limited_types2),
bulwahn@38950
   102
     limited_predicates = AList.merge (op =) (K true) (limited_predicates1, limited_predicates2),
bulwahn@38960
   103
     manual_reorder = AList.merge (op =) (K true) (manual_reorder1, manual_reorder2),
bulwahn@39461
   104
     replacing = Library.merge (op =) (replacing1, replacing2)};
bulwahn@38950
   105
);
bulwahn@38950
   106
bulwahn@38950
   107
val code_options_of = Options.get
bulwahn@38950
   108
bulwahn@38950
   109
val map_code_options = Options.map
bulwahn@38727
   110
bulwahn@39461
   111
(* system configuration *)
bulwahn@39461
   112
bulwahn@39461
   113
datatype prolog_system = SWI_PROLOG | YAP
bulwahn@39461
   114
bulwahn@39462
   115
fun string_of_system SWI_PROLOG = "swiprolog"
bulwahn@39462
   116
  | string_of_system YAP = "yap"
bulwahn@39462
   117
bulwahn@39461
   118
type system_configuration = {timeout : Time.time, prolog_system : prolog_system}
bulwahn@39462
   119
                                                
bulwahn@39461
   120
structure System_Config = Generic_Data
bulwahn@39461
   121
(
bulwahn@39461
   122
  type T = system_configuration
wenzelm@40301
   123
  val empty = {timeout = seconds 10.0, prolog_system = SWI_PROLOG}
bulwahn@39461
   124
  val extend = I;
wenzelm@41472
   125
  fun merge (a, _) = a
bulwahn@39461
   126
)
bulwahn@39461
   127
bulwahn@38073
   128
(* general string functions *)
bulwahn@38073
   129
bulwahn@40924
   130
val first_upper = implode o nth_map 0 Symbol.to_ascii_upper o raw_explode;
bulwahn@40924
   131
val first_lower = implode o nth_map 0 Symbol.to_ascii_lower o raw_explode;
bulwahn@38073
   132
bulwahn@38073
   133
(* internal program representation *)
bulwahn@38073
   134
bulwahn@38113
   135
datatype arith_op = Plus | Minus
bulwahn@38113
   136
bulwahn@38112
   137
datatype prol_term = Var of string | Cons of string | AppF of string * prol_term list
bulwahn@38113
   138
  | Number of int | ArithOp of arith_op * prol_term list;
bulwahn@38113
   139
bulwahn@38735
   140
fun dest_Var (Var v) = v
bulwahn@38735
   141
bulwahn@38735
   142
fun add_vars (Var v) = insert (op =) v
bulwahn@38735
   143
  | add_vars (ArithOp (_, ts)) = fold add_vars ts
bulwahn@38735
   144
  | add_vars (AppF (_, ts)) = fold add_vars ts
bulwahn@38735
   145
  | add_vars _ = I
bulwahn@38735
   146
bulwahn@38735
   147
fun map_vars f (Var v) = Var (f v)
bulwahn@38735
   148
  | map_vars f (ArithOp (opr, ts)) = ArithOp (opr, map (map_vars f) ts)
bulwahn@38735
   149
  | map_vars f (AppF (fs, ts)) = AppF (fs, map (map_vars f) ts)
bulwahn@38735
   150
  | map_vars f t = t
bulwahn@38735
   151
  
bulwahn@38728
   152
fun maybe_AppF (c, []) = Cons c
bulwahn@38728
   153
  | maybe_AppF (c, xs) = AppF (c, xs)
bulwahn@38728
   154
bulwahn@38113
   155
fun is_Var (Var _) = true
bulwahn@38113
   156
  | is_Var _ = false
bulwahn@38113
   157
bulwahn@38113
   158
fun is_arith_term (Var _) = true
bulwahn@38113
   159
  | is_arith_term (Number _) = true
bulwahn@38113
   160
  | is_arith_term (ArithOp (_, operands)) = forall is_arith_term operands
bulwahn@38113
   161
  | is_arith_term _ = false
bulwahn@38073
   162
bulwahn@38081
   163
fun string_of_prol_term (Var s) = "Var " ^ s
bulwahn@38075
   164
  | string_of_prol_term (Cons s) = "Cons " ^ s
bulwahn@38075
   165
  | string_of_prol_term (AppF (f, args)) = f ^ "(" ^ commas (map string_of_prol_term args) ^ ")" 
bulwahn@38112
   166
  | string_of_prol_term (Number n) = "Number " ^ string_of_int n
bulwahn@38075
   167
bulwahn@38113
   168
datatype prem = Conj of prem list
bulwahn@38113
   169
  | Rel of string * prol_term list | NotRel of string * prol_term list
bulwahn@38113
   170
  | Eq of prol_term * prol_term | NotEq of prol_term * prol_term
bulwahn@38727
   171
  | ArithEq of prol_term * prol_term | NotArithEq of prol_term * prol_term
bulwahn@38727
   172
  | Ground of string * typ;
bulwahn@38735
   173
bulwahn@38073
   174
fun dest_Rel (Rel (c, ts)) = (c, ts)
bulwahn@38735
   175
bulwahn@38735
   176
fun map_term_prem f (Conj prems) = Conj (map (map_term_prem f) prems)
bulwahn@38735
   177
  | map_term_prem f (Rel (r, ts)) = Rel (r, map f ts)
bulwahn@38735
   178
  | map_term_prem f (NotRel (r, ts)) = NotRel (r, map f ts)
bulwahn@38735
   179
  | map_term_prem f (Eq (l, r)) = Eq (f l, f r)
bulwahn@38735
   180
  | map_term_prem f (NotEq (l, r)) = NotEq (f l, f r)
bulwahn@38735
   181
  | map_term_prem f (ArithEq (l, r)) = ArithEq (f l, f r)
bulwahn@38735
   182
  | map_term_prem f (NotArithEq (l, r)) = NotArithEq (f l, f r)
bulwahn@38735
   183
  | map_term_prem f (Ground (v, T)) = Ground (dest_Var (f (Var v)), T)
bulwahn@38735
   184
bulwahn@38735
   185
fun fold_prem_terms f (Conj prems) = fold (fold_prem_terms f) prems
bulwahn@38735
   186
  | fold_prem_terms f (Rel (_, ts)) = fold f ts
bulwahn@38735
   187
  | fold_prem_terms f (NotRel (_, ts)) = fold f ts
bulwahn@38735
   188
  | fold_prem_terms f (Eq (l, r)) = f l #> f r
bulwahn@38735
   189
  | fold_prem_terms f (NotEq (l, r)) = f l #> f r
bulwahn@38735
   190
  | fold_prem_terms f (ArithEq (l, r)) = f l #> f r
bulwahn@38735
   191
  | fold_prem_terms f (NotArithEq (l, r)) = f l #> f r
bulwahn@38735
   192
  | fold_prem_terms f (Ground (v, T)) = f (Var v)
bulwahn@38735
   193
  
bulwahn@38079
   194
type clause = ((string * prol_term list) * prem);
bulwahn@38073
   195
bulwahn@38073
   196
type logic_program = clause list;
bulwahn@39798
   197
 
bulwahn@38073
   198
(* translation from introduction rules to internal representation *)
bulwahn@38073
   199
bulwahn@38958
   200
fun mk_conform f empty avoid name =
bulwahn@38956
   201
  let
bulwahn@38956
   202
    fun dest_Char (Symbol.Char c) = c
bulwahn@38956
   203
    val name' = space_implode "" (map (dest_Char o Symbol.decode)
bulwahn@38956
   204
      (filter (fn s => Symbol.is_ascii_letter s orelse Symbol.is_ascii_digit s)
bulwahn@38956
   205
        (Symbol.explode name)))
bulwahn@38958
   206
    val name'' = f (if name' = "" then empty else name')
bulwahn@38958
   207
  in (if member (op =) avoid name'' then Name.variant avoid name'' else name'') end
bulwahn@38956
   208
bulwahn@38079
   209
(** constant table **)
bulwahn@38079
   210
bulwahn@38079
   211
type constant_table = (string * string) list
bulwahn@38079
   212
bulwahn@38079
   213
fun declare_consts consts constant_table =
bulwahn@38956
   214
  let
bulwahn@38956
   215
    fun update' c table =
bulwahn@38956
   216
      if AList.defined (op =) table c then table else
bulwahn@38956
   217
        let
bulwahn@38958
   218
          val c' = mk_conform first_lower "pred" (map snd table) (Long_Name.base_name c)
bulwahn@38956
   219
        in
bulwahn@38956
   220
          AList.update (op =) (c, c') table
bulwahn@38956
   221
        end
bulwahn@38956
   222
  in
bulwahn@38956
   223
    fold update' consts constant_table
bulwahn@38956
   224
  end
bulwahn@38079
   225
  
bulwahn@38079
   226
fun translate_const constant_table c =
bulwahn@38079
   227
  case AList.lookup (op =) constant_table c of
bulwahn@38079
   228
    SOME c' => c'
bulwahn@38079
   229
  | NONE => error ("No such constant: " ^ c)
bulwahn@38073
   230
bulwahn@38079
   231
fun inv_lookup _ [] _ = NONE
bulwahn@38079
   232
  | inv_lookup eq ((key, value)::xs) value' =
bulwahn@38079
   233
      if eq (value', value) then SOME key
bulwahn@38079
   234
      else inv_lookup eq xs value';
bulwahn@38079
   235
bulwahn@38079
   236
fun restore_const constant_table c =
bulwahn@38079
   237
  case inv_lookup (op =) constant_table c of
bulwahn@38079
   238
    SOME c' => c'
bulwahn@38079
   239
  | NONE => error ("No constant corresponding to "  ^ c)
bulwahn@38727
   240
bulwahn@38079
   241
(** translation of terms, literals, premises, and clauses **)
bulwahn@38079
   242
bulwahn@38113
   243
fun translate_arith_const @{const_name "Groups.plus_class.plus"} = SOME Plus
bulwahn@38113
   244
  | translate_arith_const @{const_name "Groups.minus_class.minus"} = SOME Minus
bulwahn@38113
   245
  | translate_arith_const _ = NONE
bulwahn@38113
   246
bulwahn@38734
   247
fun mk_nat_term constant_table n =
bulwahn@38734
   248
  let
bulwahn@38734
   249
    val zero = translate_const constant_table @{const_name "Groups.zero_class.zero"}
bulwahn@38734
   250
    val Suc = translate_const constant_table @{const_name "Suc"}
bulwahn@38734
   251
  in funpow n (fn t => AppF (Suc, [t])) (Cons zero) end
bulwahn@38734
   252
bulwahn@38079
   253
fun translate_term ctxt constant_table t =
bulwahn@38112
   254
  case try HOLogic.dest_number t of
bulwahn@38112
   255
    SOME (@{typ "int"}, n) => Number n
bulwahn@38734
   256
  | SOME (@{typ "nat"}, n) => mk_nat_term constant_table n
bulwahn@38112
   257
  | NONE =>
bulwahn@38112
   258
      (case strip_comb t of
bulwahn@38112
   259
        (Free (v, T), []) => Var v 
bulwahn@38112
   260
      | (Const (c, _), []) => Cons (translate_const constant_table c)
bulwahn@38112
   261
      | (Const (c, _), args) =>
bulwahn@38113
   262
        (case translate_arith_const c of
bulwahn@38113
   263
          SOME aop => ArithOp (aop, map (translate_term ctxt constant_table) args)
bulwahn@38113
   264
        | NONE =>                                                             
bulwahn@38113
   265
            AppF (translate_const constant_table c, map (translate_term ctxt constant_table) args))
bulwahn@38112
   266
      | _ => error ("illegal term for translation: " ^ Syntax.string_of_term ctxt t))
bulwahn@38073
   267
bulwahn@38079
   268
fun translate_literal ctxt constant_table t =
bulwahn@38073
   269
  case strip_comb t of
haftmann@38864
   270
    (Const (@{const_name HOL.eq}, _), [l, r]) =>
bulwahn@38113
   271
      let
bulwahn@38113
   272
        val l' = translate_term ctxt constant_table l
bulwahn@38113
   273
        val r' = translate_term ctxt constant_table r
bulwahn@38113
   274
      in
bulwahn@38728
   275
        (if is_Var l' andalso is_arith_term r' andalso not (is_Var r') then ArithEq else Eq) (l', r')
bulwahn@38113
   276
      end
bulwahn@38079
   277
  | (Const (c, _), args) =>
bulwahn@38079
   278
      Rel (translate_const constant_table c, map (translate_term ctxt constant_table) args)
bulwahn@38073
   279
  | _ => error ("illegal literal for translation: " ^ Syntax.string_of_term ctxt t)
bulwahn@38073
   280
bulwahn@38073
   281
fun NegRel_of (Rel lit) = NotRel lit
bulwahn@38073
   282
  | NegRel_of (Eq eq) = NotEq eq
bulwahn@38113
   283
  | NegRel_of (ArithEq eq) = NotArithEq eq
bulwahn@38113
   284
bulwahn@38727
   285
fun mk_groundness_prems t = map Ground (Term.add_frees t [])
bulwahn@38727
   286
  
bulwahn@38792
   287
fun translate_prem ensure_groundness ctxt constant_table t =  
bulwahn@38073
   288
    case try HOLogic.dest_not t of
bulwahn@38727
   289
      SOME t =>
bulwahn@38792
   290
        if ensure_groundness then
bulwahn@38727
   291
          Conj (mk_groundness_prems t @ [NegRel_of (translate_literal ctxt constant_table t)])
bulwahn@38727
   292
        else
bulwahn@38727
   293
          NegRel_of (translate_literal ctxt constant_table t)
bulwahn@38079
   294
    | NONE => translate_literal ctxt constant_table t
bulwahn@38114
   295
    
bulwahn@38114
   296
fun imp_prems_conv cv ct =
bulwahn@38114
   297
  case Thm.term_of ct of
bulwahn@38114
   298
    Const ("==>", _) $ _ $ _ => Conv.combination_conv (Conv.arg_conv cv) (imp_prems_conv cv) ct
bulwahn@38114
   299
  | _ => Conv.all_conv ct
bulwahn@38114
   300
bulwahn@38114
   301
fun Trueprop_conv cv ct =
bulwahn@38114
   302
  case Thm.term_of ct of
haftmann@38558
   303
    Const (@{const_name Trueprop}, _) $ _ => Conv.arg_conv cv ct  
bulwahn@38114
   304
  | _ => raise Fail "Trueprop_conv"
bulwahn@38114
   305
bulwahn@38114
   306
fun preprocess_intro thy rule =
bulwahn@38114
   307
  Conv.fconv_rule
bulwahn@38114
   308
    (imp_prems_conv
bulwahn@38114
   309
      (Trueprop_conv (Conv.try_conv (Conv.rewr_conv @{thm Predicate.eq_is_eq}))))
bulwahn@38114
   310
    (Thm.transfer thy rule)
bulwahn@38114
   311
bulwahn@38792
   312
fun translate_intros ensure_groundness ctxt gr const constant_table =
bulwahn@38073
   313
  let
bulwahn@38114
   314
    val intros = map (preprocess_intro (ProofContext.theory_of ctxt)) (Graph.get_node gr const)
bulwahn@38073
   315
    val (intros', ctxt') = Variable.import_terms true (map prop_of intros) ctxt
bulwahn@38079
   316
    val constant_table' = declare_consts (fold Term.add_const_names intros' []) constant_table
bulwahn@38073
   317
    fun translate_intro intro =
bulwahn@38073
   318
      let
bulwahn@38073
   319
        val head = HOLogic.dest_Trueprop (Logic.strip_imp_concl intro)
bulwahn@38727
   320
        val prems = map HOLogic.dest_Trueprop (Logic.strip_imp_prems intro)
bulwahn@38792
   321
        val prems' = Conj (map (translate_prem ensure_groundness ctxt' constant_table') prems)
bulwahn@38079
   322
        val clause = (dest_Rel (translate_literal ctxt' constant_table' head), prems')
bulwahn@38073
   323
      in clause end
bulwahn@39724
   324
  in
bulwahn@39724
   325
    (map translate_intro intros', constant_table')
bulwahn@39724
   326
  end
bulwahn@38073
   327
bulwahn@38731
   328
fun depending_preds_of (key, intros) =
bulwahn@38731
   329
  fold Term.add_const_names (map Thm.prop_of intros) []
bulwahn@38731
   330
bulwahn@38731
   331
fun add_edges edges_of key G =
bulwahn@38731
   332
  let
bulwahn@38731
   333
    fun extend' key (G, visited) = 
bulwahn@38731
   334
      case try (Graph.get_node G) key of
bulwahn@38731
   335
          SOME v =>
bulwahn@38731
   336
            let
bulwahn@38731
   337
              val new_edges = filter (fn k => is_some (try (Graph.get_node G) k)) (edges_of (key, v))
bulwahn@38731
   338
              val (G', visited') = fold extend'
bulwahn@38731
   339
                (subtract (op =) (key :: visited) new_edges) (G, key :: visited)
bulwahn@38731
   340
            in
bulwahn@38731
   341
              (fold (Graph.add_edge o (pair key)) new_edges G', visited')
bulwahn@38731
   342
            end
bulwahn@38731
   343
        | NONE => (G, visited)
bulwahn@38731
   344
  in
bulwahn@38731
   345
    fst (extend' key (G, []))
bulwahn@38731
   346
  end
bulwahn@38731
   347
bulwahn@39183
   348
fun print_intros ctxt gr consts =
bulwahn@39183
   349
  tracing (cat_lines (map (fn const =>
bulwahn@39183
   350
    "Constant " ^ const ^ "has intros:\n" ^
bulwahn@39183
   351
    cat_lines (map (Display.string_of_thm ctxt) (Graph.get_node gr const))) consts))
bulwahn@39461
   352
bulwahn@39461
   353
(* translation of moded predicates *)
bulwahn@39461
   354
bulwahn@39461
   355
(** generating graph of moded predicates **)
bulwahn@39461
   356
bulwahn@39461
   357
(* could be moved to Predicate_Compile_Core *)
bulwahn@39461
   358
fun requires_modes polarity cls =
bulwahn@39461
   359
  let
bulwahn@39461
   360
    fun req_mode_of pol (t, derivation) =
bulwahn@39461
   361
      (case fst (strip_comb t) of
bulwahn@39461
   362
        Const (c, _) => SOME (c, (pol, Predicate_Compile_Core.head_mode_of derivation))
bulwahn@39461
   363
      | _ => NONE)
bulwahn@39461
   364
    fun req (Predicate_Compile_Aux.Prem t, derivation) = req_mode_of polarity (t, derivation)
bulwahn@39461
   365
      | req (Predicate_Compile_Aux.Negprem t, derivation) = req_mode_of (not polarity) (t, derivation)
bulwahn@39461
   366
      | req _ = NONE
bulwahn@39461
   367
  in      
bulwahn@39461
   368
    maps (fn (_, prems) => map_filter req prems) cls
bulwahn@39461
   369
  end
bulwahn@39461
   370
 
bulwahn@39461
   371
structure Mode_Graph = Graph(type key = string * (bool * Predicate_Compile_Aux.mode)
bulwahn@39461
   372
  val ord = prod_ord fast_string_ord (prod_ord bool_ord Predicate_Compile_Aux.mode_ord));
bulwahn@39461
   373
bulwahn@39461
   374
fun mk_moded_clauses_graph ctxt scc gr =
bulwahn@39461
   375
  let
bulwahn@39461
   376
    val options = Predicate_Compile_Aux.default_options
bulwahn@39461
   377
    val mode_analysis_options =
bulwahn@39761
   378
      {use_generators = true, reorder_premises = true, infer_pos_and_neg_modes = true}
bulwahn@39461
   379
    fun infer prednames (gr, (pos_modes, neg_modes, random)) =
bulwahn@39461
   380
      let
bulwahn@39461
   381
        val (lookup_modes, lookup_neg_modes, needs_random) =
bulwahn@39461
   382
          ((fn s => the (AList.lookup (op =) pos_modes s)),
bulwahn@39461
   383
           (fn s => the (AList.lookup (op =) neg_modes s)),
bulwahn@39461
   384
           (fn s => member (op =) (the (AList.lookup (op =) random s))))
bulwahn@39461
   385
        val (preds, all_vs, param_vs, all_modes, clauses) =
bulwahn@39461
   386
          Predicate_Compile_Core.prepare_intrs options ctxt prednames
bulwahn@40054
   387
            (maps (Core_Data.intros_of ctxt) prednames)
bulwahn@39461
   388
        val ((moded_clauses, random'), _) =
bulwahn@40054
   389
          Mode_Inference.infer_modes mode_analysis_options options 
bulwahn@39461
   390
            (lookup_modes, lookup_neg_modes, needs_random) ctxt preds all_modes param_vs clauses
bulwahn@39461
   391
        val modes = map (fn (p, mps) => (p, map fst mps)) moded_clauses
bulwahn@39461
   392
        val pos_modes' = map (apsnd (map_filter (fn (true, m) => SOME m | _ => NONE))) modes
bulwahn@39461
   393
        val neg_modes' = map (apsnd (map_filter (fn (false, m) => SOME m | _ => NONE))) modes
bulwahn@39461
   394
        val _ = tracing ("Inferred modes:\n" ^
bulwahn@39461
   395
          cat_lines (map (fn (s, ms) => s ^ ": " ^ commas (map
bulwahn@39461
   396
            (fn (p, m) => Predicate_Compile_Aux.string_of_mode m ^ (if p then "pos" else "neg")) ms)) modes))
bulwahn@39461
   397
        val gr' = gr
bulwahn@39461
   398
          |> fold (fn (p, mps) => fold (fn (mode, cls) =>
bulwahn@39461
   399
                Mode_Graph.new_node ((p, mode), cls)) mps)
bulwahn@39461
   400
            moded_clauses
bulwahn@39461
   401
          |> fold (fn (p, mps) => fold (fn (mode, cls) => fold (fn req =>
bulwahn@39461
   402
              Mode_Graph.add_edge ((p, mode), req)) (requires_modes (fst mode) cls)) mps)
bulwahn@39461
   403
            moded_clauses
bulwahn@39461
   404
      in
bulwahn@39461
   405
        (gr', (AList.merge (op =) (op =) (pos_modes, pos_modes'),
bulwahn@39461
   406
          AList.merge (op =) (op =) (neg_modes, neg_modes'),
bulwahn@39461
   407
          AList.merge (op =) (op =) (random, random')))
bulwahn@39461
   408
      end
bulwahn@39461
   409
  in  
bulwahn@39461
   410
    fst (fold infer (rev scc) (Mode_Graph.empty, ([], [], []))) 
bulwahn@39461
   411
  end
bulwahn@39461
   412
bulwahn@39461
   413
fun declare_moded_predicate moded_preds table =
bulwahn@39461
   414
  let
bulwahn@39461
   415
    fun update' (p as (pred, (pol, mode))) table =
bulwahn@39461
   416
      if AList.defined (op =) table p then table else
bulwahn@39461
   417
        let
bulwahn@39461
   418
          val name = Long_Name.base_name pred ^ (if pol then "p" else "n")
bulwahn@39461
   419
            ^ Predicate_Compile_Aux.ascii_string_of_mode mode
bulwahn@39461
   420
          val p' = mk_conform first_lower "pred" (map snd table) name
bulwahn@39461
   421
        in
bulwahn@39461
   422
          AList.update (op =) (p, p') table
bulwahn@39461
   423
        end
bulwahn@39461
   424
  in
bulwahn@39461
   425
    fold update' moded_preds table
bulwahn@39461
   426
  end
bulwahn@39461
   427
bulwahn@39461
   428
fun mk_program ctxt moded_gr moded_preds (prog, (moded_pred_table, constant_table)) =
bulwahn@39461
   429
  let
bulwahn@39461
   430
    val moded_pred_table' = declare_moded_predicate moded_preds moded_pred_table
bulwahn@39461
   431
    fun mk_literal pol derivation constant_table' t =
bulwahn@39461
   432
      let
bulwahn@39461
   433
        val (p, args) = strip_comb t
bulwahn@39461
   434
        val mode = Predicate_Compile_Core.head_mode_of derivation 
bulwahn@39461
   435
        val name = fst (dest_Const p)
bulwahn@39461
   436
        
bulwahn@39461
   437
        val p' = the (AList.lookup (op =) moded_pred_table' (name, (pol, mode)))
bulwahn@39461
   438
        val args' = map (translate_term ctxt constant_table') args
bulwahn@39461
   439
      in
bulwahn@39461
   440
        Rel (p', args')
bulwahn@39461
   441
      end
bulwahn@39461
   442
    fun mk_prem pol (indprem, derivation) constant_table =
bulwahn@39461
   443
      case indprem of
bulwahn@39461
   444
        Predicate_Compile_Aux.Generator (s, T) => (Ground (s, T), constant_table)
bulwahn@39461
   445
      | _ =>
bulwahn@39461
   446
        declare_consts (Term.add_const_names (Predicate_Compile_Aux.dest_indprem indprem) []) constant_table
bulwahn@39461
   447
        |> (fn constant_table' =>
bulwahn@39461
   448
          (case indprem of Predicate_Compile_Aux.Negprem t =>
bulwahn@39461
   449
            NegRel_of (mk_literal (not pol) derivation constant_table' t)
bulwahn@39461
   450
          | _ =>
bulwahn@39461
   451
            mk_literal pol derivation constant_table' (Predicate_Compile_Aux.dest_indprem indprem), constant_table'))
bulwahn@39461
   452
    fun mk_clause pred_name pol (ts, prems) (prog, constant_table) =
bulwahn@39461
   453
    let
bulwahn@39461
   454
      val constant_table' = declare_consts (fold Term.add_const_names ts []) constant_table
bulwahn@39461
   455
      val args = map (translate_term ctxt constant_table') ts
bulwahn@39461
   456
      val (prems', constant_table'') = fold_map (mk_prem pol) prems constant_table'
bulwahn@39461
   457
    in
bulwahn@39461
   458
      (((pred_name, args), Conj prems') :: prog, constant_table'')
bulwahn@39461
   459
    end
bulwahn@39461
   460
    fun mk_clauses (pred, mode as (pol, _)) =
bulwahn@39461
   461
      let
bulwahn@39461
   462
        val clauses = Mode_Graph.get_node moded_gr (pred, mode)
bulwahn@39461
   463
        val pred_name = the (AList.lookup (op =) moded_pred_table' (pred, mode))
bulwahn@39461
   464
      in
bulwahn@39461
   465
        fold (mk_clause pred_name pol) clauses
bulwahn@39461
   466
      end
bulwahn@39461
   467
  in
bulwahn@39461
   468
    apsnd (pair moded_pred_table') (fold mk_clauses moded_preds (prog, constant_table))
bulwahn@39461
   469
  end
bulwahn@39461
   470
bulwahn@39461
   471
fun generate (use_modes, ensure_groundness) ctxt const =
bulwahn@38073
   472
  let 
bulwahn@38731
   473
    fun strong_conn_of gr keys =
bulwahn@38073
   474
      Graph.strong_conn (Graph.subgraph (member (op =) (Graph.all_succs gr keys)) gr)
bulwahn@40054
   475
    val gr = Core_Data.intros_graph_of ctxt
bulwahn@38731
   476
    val gr' = add_edges depending_preds_of const gr
bulwahn@38731
   477
    val scc = strong_conn_of gr' [const]
bulwahn@39461
   478
    val initial_constant_table = 
bulwahn@39461
   479
      declare_consts [@{const_name "Groups.zero_class.zero"}, @{const_name "Suc"}] []
bulwahn@38073
   480
  in
bulwahn@39461
   481
    case use_modes of
bulwahn@39461
   482
      SOME mode =>
bulwahn@39461
   483
        let
bulwahn@39461
   484
          val moded_gr = mk_moded_clauses_graph ctxt scc gr
bulwahn@39461
   485
          val moded_gr' = Mode_Graph.subgraph
bulwahn@39461
   486
            (member (op =) (Mode_Graph.all_succs moded_gr [(const, (true, mode))])) moded_gr
bulwahn@39461
   487
          val scc = Mode_Graph.strong_conn moded_gr' 
bulwahn@39461
   488
        in
bulwahn@39461
   489
          apfst rev (apsnd snd
bulwahn@39461
   490
            (fold (mk_program ctxt moded_gr') (rev scc) ([], ([], initial_constant_table))))
bulwahn@39461
   491
        end
bulwahn@39461
   492
      | NONE =>
bulwahn@39461
   493
        let 
bulwahn@39461
   494
          val _ = print_intros ctxt gr (flat scc)
bulwahn@39461
   495
          val constant_table = declare_consts (flat scc) initial_constant_table
bulwahn@39461
   496
        in
bulwahn@39461
   497
          apfst flat (fold_map (translate_intros ensure_groundness ctxt gr) (flat scc) constant_table)
bulwahn@39461
   498
        end
bulwahn@38073
   499
  end
bulwahn@38727
   500
  
bulwahn@38789
   501
(* implementation for fully enumerating predicates and
bulwahn@38789
   502
  for size-limited predicates for enumerating the values of a datatype upto a specific size *)
bulwahn@38073
   503
bulwahn@38727
   504
fun add_ground_typ (Conj prems) = fold add_ground_typ prems
bulwahn@38727
   505
  | add_ground_typ (Ground (_, T)) = insert (op =) T
bulwahn@38727
   506
  | add_ground_typ _ = I
bulwahn@38073
   507
bulwahn@38728
   508
fun mk_relname (Type (Tcon, Targs)) =
bulwahn@38728
   509
  first_lower (Long_Name.base_name Tcon) ^ space_implode "_" (map mk_relname Targs)
bulwahn@38728
   510
  | mk_relname _ = raise Fail "unexpected type"
bulwahn@38728
   511
bulwahn@38789
   512
fun mk_lim_relname T = "lim_" ^  mk_relname T
bulwahn@38789
   513
bulwahn@38728
   514
(* This is copied from "pat_completeness.ML" *)
bulwahn@38728
   515
fun inst_constrs_of thy (T as Type (name, _)) =
bulwahn@38728
   516
  map (fn (Cn,CT) =>
bulwahn@38728
   517
    Envir.subst_term_types (Sign.typ_match thy (body_type CT, T) Vartab.empty) (Const (Cn, CT)))
bulwahn@38728
   518
    (the (Datatype.get_constrs thy name))
bulwahn@38728
   519
  | inst_constrs_of thy T = raise TYPE ("inst_constrs_of", [T], [])
bulwahn@38789
   520
bulwahn@38789
   521
fun is_recursive_constr T (Const (constr_name, T')) = member (op =) (binder_types T') T
bulwahn@38728
   522
  
bulwahn@38789
   523
fun mk_ground_impl ctxt limited_types (T as Type (Tcon, Targs)) (seen, constant_table) =
bulwahn@38728
   524
  if member (op =) seen T then ([], (seen, constant_table))
bulwahn@38728
   525
  else
bulwahn@38728
   526
    let
bulwahn@38789
   527
      val (limited, size) = case AList.lookup (op =) limited_types T of
bulwahn@38789
   528
        SOME s => (true, s)
bulwahn@38789
   529
      | NONE => (false, 0)      
bulwahn@38789
   530
      val rel_name = (if limited then mk_lim_relname else mk_relname) T
bulwahn@38789
   531
      fun mk_impl (Const (constr_name, cT), recursive) (seen, constant_table) =
bulwahn@38727
   532
        let
bulwahn@38727
   533
          val constant_table' = declare_consts [constr_name] constant_table
bulwahn@38789
   534
          val Ts = binder_types cT
bulwahn@38728
   535
          val (rec_clauses, (seen', constant_table'')) =
bulwahn@38789
   536
            fold_map (mk_ground_impl ctxt limited_types) Ts (seen, constant_table')
bulwahn@38789
   537
          val vars = map (fn i => Var ("x" ^ string_of_int i)) (1 upto (length Ts))
bulwahn@38789
   538
          val lim_var =
bulwahn@38789
   539
            if limited then
bulwahn@38789
   540
              if recursive then [AppF ("suc", [Var "Lim"])]              
bulwahn@38789
   541
              else [Var "Lim"]
bulwahn@38789
   542
            else [] 
bulwahn@38789
   543
          fun mk_prem v T' =
bulwahn@38789
   544
            if limited andalso T' = T then Rel (mk_lim_relname T', [Var "Lim", v])
bulwahn@38789
   545
            else Rel (mk_relname T', [v])
bulwahn@38728
   546
          val clause =
bulwahn@38789
   547
            ((rel_name, lim_var @ [maybe_AppF (translate_const constant_table'' constr_name, vars)]),
bulwahn@38789
   548
             Conj (map2 mk_prem vars Ts))
bulwahn@38727
   549
        in
bulwahn@38728
   550
          (clause :: flat rec_clauses, (seen', constant_table''))
bulwahn@38727
   551
        end
bulwahn@38728
   552
      val constrs = inst_constrs_of (ProofContext.theory_of ctxt) T
bulwahn@38789
   553
      val constrs' = (constrs ~~ map (is_recursive_constr T) constrs)
bulwahn@38789
   554
        |> (fn cs => filter_out snd cs @ filter snd cs)
bulwahn@38789
   555
      val (clauses, constant_table') =
bulwahn@38789
   556
        apfst flat (fold_map mk_impl constrs' (T :: seen, constant_table))
bulwahn@38789
   557
      val size_term = funpow size (fn t => AppF ("suc", [t])) (Cons "zero")
bulwahn@38789
   558
    in
bulwahn@38789
   559
      ((if limited then
bulwahn@38789
   560
        cons ((mk_relname T, [Var "x"]), Rel (mk_lim_relname T, [size_term, Var "x"]))
bulwahn@38789
   561
      else I) clauses, constant_table')
bulwahn@38789
   562
    end
bulwahn@38789
   563
 | mk_ground_impl ctxt _ T (seen, constant_table) =
bulwahn@38728
   564
   raise Fail ("unexpected type :" ^ Syntax.string_of_typ ctxt T)
bulwahn@38728
   565
bulwahn@38727
   566
fun replace_ground (Conj prems) = Conj (map replace_ground prems)
bulwahn@38728
   567
  | replace_ground (Ground (x, T)) =
bulwahn@38728
   568
    Rel (mk_relname T, [Var x])  
bulwahn@38727
   569
  | replace_ground p = p
bulwahn@38727
   570
  
bulwahn@38789
   571
fun add_ground_predicates ctxt limited_types (p, constant_table) =
bulwahn@38727
   572
  let
bulwahn@38727
   573
    val ground_typs = fold (add_ground_typ o snd) p []
bulwahn@38789
   574
    val (grs, (_, constant_table')) = fold_map (mk_ground_impl ctxt limited_types) ground_typs ([], constant_table)
bulwahn@38727
   575
    val p' = map (apsnd replace_ground) p
bulwahn@38073
   576
  in
bulwahn@38727
   577
    ((flat grs) @ p', constant_table')
bulwahn@38073
   578
  end
bulwahn@38789
   579
bulwahn@38947
   580
(* make depth-limited version of predicate *)
bulwahn@38947
   581
bulwahn@38947
   582
fun mk_lim_rel_name rel_name = "lim_" ^ rel_name
bulwahn@38947
   583
bulwahn@38959
   584
fun mk_depth_limited rel_names ((rel_name, ts), prem) =
bulwahn@38947
   585
  let
bulwahn@38947
   586
    fun has_positive_recursive_prems (Conj prems) = exists has_positive_recursive_prems prems
bulwahn@38959
   587
      | has_positive_recursive_prems (Rel (rel, ts)) = member (op =) rel_names rel
bulwahn@38947
   588
      | has_positive_recursive_prems _ = false
bulwahn@38947
   589
    fun mk_lim_prem (Conj prems) = Conj (map mk_lim_prem prems)
bulwahn@38947
   590
      | mk_lim_prem (p as Rel (rel, ts)) =
bulwahn@38959
   591
        if member (op =) rel_names rel then Rel (mk_lim_rel_name rel, Var "Lim" :: ts) else p
bulwahn@38947
   592
      | mk_lim_prem p = p
bulwahn@38947
   593
  in
bulwahn@38947
   594
    if has_positive_recursive_prems prem then
bulwahn@38947
   595
      ((mk_lim_rel_name rel_name, (AppF ("suc", [Var "Lim"]))  :: ts), mk_lim_prem prem)
bulwahn@38947
   596
    else
bulwahn@38947
   597
      ((mk_lim_rel_name rel_name, (Var "Lim") :: ts), prem)
bulwahn@38947
   598
  end
bulwahn@38947
   599
bulwahn@39798
   600
fun nat_term_of n = funpow n (fn t => AppF ("suc", [t])) (Cons "zero")
bulwahn@39798
   601
bulwahn@39798
   602
fun add_limited_predicates limited_predicates (p, constant_table) =
bulwahn@38956
   603
  let                                     
bulwahn@39798
   604
    fun add (rel_names, limit) p = 
bulwahn@38947
   605
      let
bulwahn@38959
   606
        val clauses = filter (fn ((rel, _), _) => member (op =) rel_names rel) p
bulwahn@38959
   607
        val clauses' = map (mk_depth_limited rel_names) clauses
bulwahn@38959
   608
        fun mk_entry_clause rel_name =
bulwahn@38959
   609
          let
bulwahn@38959
   610
            val nargs = length (snd (fst
bulwahn@38959
   611
              (the (find_first (fn ((rel, _), _) => rel = rel_name) clauses))))
bulwahn@38959
   612
            val vars = map (fn i => Var ("x" ^ string_of_int i)) (1 upto nargs)        
bulwahn@38959
   613
          in
bulwahn@38959
   614
            (("limited_" ^ rel_name, vars), Rel ("lim_" ^ rel_name, nat_term_of limit :: vars))
bulwahn@38959
   615
          end
bulwahn@39798
   616
      in (p @ (map mk_entry_clause rel_names) @ clauses') end
bulwahn@38947
   617
  in
bulwahn@39798
   618
    (fold add limited_predicates p, constant_table)
bulwahn@38947
   619
  end
bulwahn@38947
   620
bulwahn@38947
   621
bulwahn@38947
   622
(* replace predicates in clauses *)
bulwahn@38947
   623
bulwahn@38947
   624
(* replace (A, B, C) p = replace A by B in clauses of C *)
bulwahn@38947
   625
fun replace ((from, to), location) p =
bulwahn@38947
   626
  let
bulwahn@38947
   627
    fun replace_prem (Conj prems) = Conj (map replace_prem prems)
bulwahn@38947
   628
      | replace_prem (r as Rel (rel, ts)) =
bulwahn@38947
   629
          if rel = from then Rel (to, ts) else r
bulwahn@38947
   630
      | replace_prem r = r
bulwahn@38947
   631
  in
bulwahn@38947
   632
    map (fn ((rel, args), prem) => ((rel, args), (if rel = location then replace_prem else I) prem)) p
bulwahn@38947
   633
  end
bulwahn@38947
   634
bulwahn@38960
   635
  
bulwahn@38960
   636
(* reorder manually : reorder premises of ith clause of predicate p by a permutation perm *)
bulwahn@38947
   637
bulwahn@38960
   638
fun reorder_manually reorder p =
bulwahn@38960
   639
  let
bulwahn@38960
   640
    fun reorder' (clause as ((rel, args), prem)) seen =
bulwahn@38960
   641
      let
bulwahn@38960
   642
        val seen' = AList.map_default (op =) (rel, 0) (fn x => x + 1) seen
bulwahn@38960
   643
        val i = the (AList.lookup (op =) seen' rel)
bulwahn@38960
   644
        val perm = AList.lookup (op =) reorder (rel, i)
bulwahn@38960
   645
        val prem' = (case perm of 
bulwahn@38960
   646
          SOME p => (case prem of Conj prems => Conj (map (nth prems) p) | _ => prem)
bulwahn@38960
   647
        | NONE => prem)
bulwahn@38960
   648
      in (((rel, args), prem'), seen') end
bulwahn@38960
   649
  in
bulwahn@38960
   650
    fst (fold_map reorder' p [])
bulwahn@38960
   651
  end
bulwahn@39462
   652
bulwahn@38735
   653
(* rename variables to prolog-friendly names *)
bulwahn@38735
   654
bulwahn@38735
   655
fun rename_vars_term renaming = map_vars (fn v => the (AList.lookup (op =) renaming v))
bulwahn@38735
   656
bulwahn@38735
   657
fun rename_vars_prem renaming = map_term_prem (rename_vars_term renaming)
bulwahn@38735
   658
bulwahn@38735
   659
fun is_prolog_conform v =
bulwahn@38735
   660
  forall (fn s => Symbol.is_ascii_letter s orelse Symbol.is_ascii_digit s) (Symbol.explode v)
bulwahn@38735
   661
  
bulwahn@38735
   662
fun mk_renaming v renaming =
bulwahn@38958
   663
  (v, mk_conform first_upper "Var" (map snd renaming) v) :: renaming
bulwahn@38735
   664
bulwahn@38735
   665
fun rename_vars_clause ((rel, args), prem) =
bulwahn@38735
   666
  let
bulwahn@38735
   667
    val vars = fold_prem_terms add_vars prem (fold add_vars args [])
bulwahn@38735
   668
    val renaming = fold mk_renaming vars []
bulwahn@38735
   669
  in ((rel, map (rename_vars_term renaming) args), rename_vars_prem renaming prem) end
bulwahn@38735
   670
  
bulwahn@38735
   671
val rename_vars_program = map rename_vars_clause
bulwahn@38956
   672
bulwahn@39798
   673
(* limit computation globally by some threshold *)
bulwahn@39798
   674
bulwahn@39798
   675
fun limit_globally ctxt limit const_name (p, constant_table) =
bulwahn@39798
   676
  let
bulwahn@39798
   677
    val rel_names = fold (fn ((r, _), _) => insert (op =) r) p []
bulwahn@39798
   678
    val p' = map (mk_depth_limited rel_names) p
bulwahn@39798
   679
    val rel_name = translate_const constant_table const_name
bulwahn@39798
   680
    val nargs = length (snd (fst
bulwahn@39798
   681
      (the (find_first (fn ((rel, _), _) => rel = rel_name) p))))
bulwahn@39798
   682
    val vars = map (fn i => Var ("x" ^ string_of_int i)) (1 upto nargs)
bulwahn@39798
   683
    val entry_clause = ((rel_name, vars), Rel ("lim_" ^ rel_name, nat_term_of limit :: vars))
bulwahn@39798
   684
    val p'' = filter_out (fn ((rel, _), _) => rel = rel_name) p
bulwahn@39798
   685
  in
bulwahn@39798
   686
    (entry_clause :: p' @ p'', constant_table)
bulwahn@39798
   687
  end
bulwahn@39798
   688
bulwahn@39542
   689
(* post processing of generated prolog program *)
bulwahn@39542
   690
bulwahn@39798
   691
fun post_process ctxt options const_name (p, constant_table) =
bulwahn@39542
   692
  (p, constant_table)
bulwahn@39798
   693
  |> (case #limit_globally options of
bulwahn@39798
   694
        SOME limit => limit_globally ctxt limit const_name
bulwahn@39798
   695
      | NONE => I)
bulwahn@39542
   696
  |> (if #ensure_groundness options then
bulwahn@39542
   697
        add_ground_predicates ctxt (#limited_types options)
bulwahn@39542
   698
      else I)
bulwahn@39724
   699
  |> tap (fn _ => tracing "Adding limited predicates...")
bulwahn@39542
   700
  |> add_limited_predicates (#limited_predicates options)
bulwahn@39724
   701
  |> tap (fn _ => tracing "Replacing predicates...")
bulwahn@39542
   702
  |> apfst (fold replace (#replacing options))
bulwahn@39542
   703
  |> apfst (reorder_manually (#manual_reorder options))
bulwahn@39542
   704
  |> apfst rename_vars_program
bulwahn@39542
   705
bulwahn@38073
   706
(* code printer *)
bulwahn@38073
   707
bulwahn@38113
   708
fun write_arith_op Plus = "+"
bulwahn@38113
   709
  | write_arith_op Minus = "-"
bulwahn@38113
   710
bulwahn@38735
   711
fun write_term (Var v) = v
bulwahn@38079
   712
  | write_term (Cons c) = c
bulwahn@38113
   713
  | write_term (AppF (f, args)) = f ^ "(" ^ space_implode ", " (map write_term args) ^ ")"
bulwahn@38113
   714
  | write_term (ArithOp (oper, [a1, a2])) = write_term a1 ^ " " ^ write_arith_op oper ^ " " ^ write_term a2
bulwahn@38112
   715
  | write_term (Number n) = string_of_int n
bulwahn@38073
   716
bulwahn@38073
   717
fun write_rel (pred, args) =
bulwahn@38073
   718
  pred ^ "(" ^ space_implode ", " (map write_term args) ^ ")" 
bulwahn@38073
   719
bulwahn@38073
   720
fun write_prem (Conj prems) = space_implode ", " (map write_prem prems)
bulwahn@38073
   721
  | write_prem (Rel p) = write_rel p  
bulwahn@38073
   722
  | write_prem (NotRel p) = "not(" ^ write_rel p ^ ")"
bulwahn@38073
   723
  | write_prem (Eq (l, r)) = write_term l ^ " = " ^ write_term r
bulwahn@38073
   724
  | write_prem (NotEq (l, r)) = write_term l ^ " \\= " ^ write_term r
bulwahn@38113
   725
  | write_prem (ArithEq (l, r)) = write_term l ^ " is " ^ write_term r
bulwahn@38113
   726
  | write_prem (NotArithEq (l, r)) = write_term l ^ " =\\= " ^ write_term r
bulwahn@39461
   727
  | write_prem _ = raise Fail "Not a valid prolog premise"
bulwahn@38073
   728
bulwahn@38073
   729
fun write_clause (head, prem) =
bulwahn@38073
   730
  write_rel head ^ (if prem = Conj [] then "." else " :- " ^ write_prem prem ^ ".")
bulwahn@38073
   731
bulwahn@38073
   732
fun write_program p =
bulwahn@38073
   733
  cat_lines (map write_clause p) 
bulwahn@38073
   734
bulwahn@38790
   735
(* query templates *)
bulwahn@38078
   736
bulwahn@38792
   737
(** query and prelude for swi-prolog **)
bulwahn@38792
   738
bulwahn@39464
   739
fun swi_prolog_query_first (rel, args) vnames =
bulwahn@39464
   740
  "eval :- once("  ^ rel ^ "(" ^ space_implode ", " (map write_term args) ^ ")),\n" ^
bulwahn@38082
   741
  "writef('" ^ space_implode ";" (map (fn v => v ^ " = %w") vnames) ^
bulwahn@38082
   742
  "\\n', [" ^ space_implode ", " vnames ^ "]).\n"
bulwahn@38077
   743
  
bulwahn@39464
   744
fun swi_prolog_query_firstn n (rel, args) vnames =
bulwahn@38077
   745
  "eval :- findnsols(" ^ string_of_int n ^ ", (" ^ space_implode ", " vnames ^ "), " ^
bulwahn@39464
   746
    rel ^ "(" ^ space_implode ", " (map write_term args) ^ "), Sols), writelist(Sols).\n" ^
bulwahn@38077
   747
    "writelist([]).\n" ^
bulwahn@39546
   748
    "writelist([(" ^ space_implode ", " vnames ^ ")|SolutionTail]) :- " ^
bulwahn@38079
   749
    "writef('" ^ space_implode ";" (map (fn v => v ^ " = %w") vnames) ^
bulwahn@39546
   750
    "\\n', [" ^ space_implode ", " vnames ^ "]), writelist(SolutionTail).\n"
bulwahn@38077
   751
  
bulwahn@38792
   752
val swi_prolog_prelude =
bulwahn@38073
   753
  "#!/usr/bin/swipl -q -t main -f\n\n" ^
bulwahn@38077
   754
  ":- use_module(library('dialect/ciao/aggregates')).\n" ^
bulwahn@38729
   755
  ":- style_check(-singleton).\n" ^
wenzelm@41067
   756
  ":- style_check(-discontiguous).\n" ^
bulwahn@38729
   757
  ":- style_check(-atom).\n\n" ^
bulwahn@38073
   758
  "main :- catch(eval, E, (print_message(error, E), fail)), halt.\n" ^
bulwahn@38073
   759
  "main :- halt(1).\n"
bulwahn@38075
   760
bulwahn@38792
   761
(** query and prelude for yap **)
bulwahn@38792
   762
bulwahn@39464
   763
fun yap_query_first (rel, args) vnames =
bulwahn@39464
   764
  "eval :- once(" ^ rel ^ "(" ^ space_implode ", " (map write_term args) ^ ")),\n" ^
bulwahn@38792
   765
  "format('" ^ space_implode ";" (map (fn v => v ^ " = ~w") vnames) ^
bulwahn@38792
   766
  "\\n', [" ^ space_implode ", " vnames ^ "]).\n"
bulwahn@38792
   767
bulwahn@38792
   768
val yap_prelude =
bulwahn@38792
   769
  "#!/usr/bin/yap -L\n\n" ^
bulwahn@38792
   770
  ":- initialization(eval).\n"
bulwahn@38792
   771
bulwahn@38792
   772
(* system-dependent query, prelude and invocation *)
bulwahn@38792
   773
bulwahn@38792
   774
fun query system nsols = 
bulwahn@38792
   775
  case system of
bulwahn@38792
   776
    SWI_PROLOG =>
bulwahn@38792
   777
      (case nsols of NONE => swi_prolog_query_first | SOME n => swi_prolog_query_firstn n)
bulwahn@38792
   778
  | YAP =>
bulwahn@38792
   779
      case nsols of NONE => yap_query_first | SOME n =>
bulwahn@38792
   780
        error "No support for querying multiple solutions in the prolog system yap"
bulwahn@38792
   781
bulwahn@38792
   782
fun prelude system =
bulwahn@38792
   783
  case system of SWI_PROLOG => swi_prolog_prelude | YAP => yap_prelude
bulwahn@38792
   784
bulwahn@38792
   785
fun invoke system file_name =
bulwahn@38792
   786
  let
bulwahn@39462
   787
    val env_var =
bulwahn@39462
   788
      (case system of SWI_PROLOG => "EXEC_SWIPL"| YAP => "EXEC_YAP")
bulwahn@39462
   789
    val prog = getenv env_var
bulwahn@38792
   790
    val cmd =
bulwahn@39462
   791
      case system of SWI_PROLOG => prog ^ " -f " | YAP => prog ^ " -L "
bulwahn@39462
   792
  in
bulwahn@39462
   793
    if prog = "" then
bulwahn@39462
   794
      (warning (env_var ^ " not set; could not execute code for " ^ string_of_system system); "")
bulwahn@39462
   795
    else fst (bash_output (cmd ^ file_name))
bulwahn@39462
   796
  end
bulwahn@38792
   797
bulwahn@38075
   798
(* parsing prolog solution *)
bulwahn@38790
   799
bulwahn@38115
   800
val scan_number =
bulwahn@38115
   801
  Scan.many1 Symbol.is_ascii_digit
bulwahn@38075
   802
bulwahn@38075
   803
val scan_atom =
bulwahn@38728
   804
  Scan.many1 (fn s => Symbol.is_ascii_lower s orelse Symbol.is_ascii_digit s orelse Symbol.is_ascii_quasi s)
bulwahn@38075
   805
bulwahn@38075
   806
val scan_var =
bulwahn@38078
   807
  Scan.many1
bulwahn@38078
   808
    (fn s => Symbol.is_ascii_upper s orelse Symbol.is_ascii_digit s orelse Symbol.is_ascii_quasi s)
bulwahn@38075
   809
bulwahn@38076
   810
val scan_ident =
bulwahn@38076
   811
  Scan.repeat (Scan.one
bulwahn@38076
   812
    (fn s => Symbol.is_ascii_letter s orelse Symbol.is_ascii_digit s orelse Symbol.is_ascii_quasi s))
bulwahn@38076
   813
bulwahn@38075
   814
fun dest_Char (Symbol.Char s) = s
bulwahn@38075
   815
bulwahn@38075
   816
val string_of = concat o map (dest_Char o Symbol.decode)
bulwahn@38075
   817
bulwahn@38076
   818
val is_atom_ident = forall Symbol.is_ascii_lower
bulwahn@38076
   819
bulwahn@38076
   820
val is_var_ident =
bulwahn@38076
   821
  forall (fn s => Symbol.is_ascii_upper s orelse Symbol.is_ascii_digit s orelse Symbol.is_ascii_quasi s)
bulwahn@38078
   822
bulwahn@38115
   823
fun int_of_symbol_list xs = fold (fn x => fn s => s * 10 + (ord x - ord "0")) xs 0
bulwahn@38115
   824
bulwahn@38078
   825
fun scan_terms xs = (((scan_term --| $$ ",") ::: scan_terms)
bulwahn@38078
   826
  || (scan_term >> single)) xs
bulwahn@38078
   827
and scan_term xs =
bulwahn@38115
   828
  ((scan_number >> (Number o int_of_symbol_list))
bulwahn@38115
   829
  || (scan_var >> (Var o string_of))
bulwahn@38078
   830
  || ((scan_atom -- ($$ "(" |-- scan_terms --| $$ ")"))
bulwahn@38079
   831
    >> (fn (f, ts) => AppF (string_of f, ts)))
bulwahn@38078
   832
  || (scan_atom >> (Cons o string_of))) xs
bulwahn@38079
   833
bulwahn@38075
   834
val parse_term = fst o Scan.finite Symbol.stopper
bulwahn@38077
   835
    (Scan.error (!! (fn _ => raise Fail "parsing prolog output failed")) scan_term)
bulwahn@40924
   836
  o raw_explode
bulwahn@38075
   837
  
bulwahn@38079
   838
fun parse_solutions sol =
bulwahn@38075
   839
  let
bulwahn@38077
   840
    fun dest_eq s = case space_explode "=" s of
bulwahn@38075
   841
        (l :: r :: []) => parse_term (unprefix " " r)
bulwahn@38078
   842
      | _ => raise Fail "unexpected equation in prolog output"
bulwahn@38079
   843
    fun parse_solution s = map dest_eq (space_explode ";" s)
bulwahn@38961
   844
    val sols = case space_explode "\n" sol of [] => [] | s => fst (split_last s)  
bulwahn@38075
   845
  in
bulwahn@38961
   846
    map parse_solution sols
bulwahn@38075
   847
  end 
bulwahn@38073
   848
  
bulwahn@38073
   849
(* calling external interpreter and getting results *)
bulwahn@38073
   850
bulwahn@39464
   851
fun run (timeout, system) p (query_rel, args) vnames nsols =
bulwahn@38073
   852
  let
bulwahn@39464
   853
    val renaming = fold mk_renaming (fold add_vars args vnames) [] 
bulwahn@38735
   854
    val vnames' = map (fn v => the (AList.lookup (op =) renaming v)) vnames
bulwahn@39464
   855
    val args' = map (rename_vars_term renaming) args
bulwahn@39542
   856
    val prog = prelude system ^ query system nsols (query_rel, args') vnames' ^ write_program p
bulwahn@38079
   857
    val _ = tracing ("Generated prolog program:\n" ^ prog)
wenzelm@41307
   858
    val solution = TimeLimit.timeLimit timeout (fn prog =>
wenzelm@41307
   859
      Isabelle_System.with_tmp_file "prolog_file" (fn prolog_file =>
wenzelm@41307
   860
        (File.write prolog_file prog; invoke system (Path.implode prolog_file)))) prog
bulwahn@38079
   861
    val _ = tracing ("Prolog returned solution(s):\n" ^ solution)
bulwahn@38079
   862
    val tss = parse_solutions solution
bulwahn@38073
   863
  in
bulwahn@38079
   864
    tss
bulwahn@38073
   865
  end
bulwahn@38073
   866
bulwahn@38790
   867
(* restoring types in terms *)
bulwahn@38075
   868
bulwahn@38081
   869
fun restore_term ctxt constant_table (Var s, T) = Free (s, T)
bulwahn@38115
   870
  | restore_term ctxt constant_table (Number n, @{typ "int"}) = HOLogic.mk_number @{typ "int"} n
bulwahn@38115
   871
  | restore_term ctxt constant_table (Number n, _) = raise (Fail "unexpected type for number") 
bulwahn@38079
   872
  | restore_term ctxt constant_table (Cons s, T) = Const (restore_const constant_table s, T)
bulwahn@38079
   873
  | restore_term ctxt constant_table (AppF (f, args), T) =
bulwahn@38079
   874
    let
bulwahn@38079
   875
      val thy = ProofContext.theory_of ctxt
bulwahn@38079
   876
      val c = restore_const constant_table f
bulwahn@38079
   877
      val cT = Sign.the_const_type thy c
bulwahn@38079
   878
      val (argsT, resT) = strip_type cT
bulwahn@38079
   879
      val subst = Sign.typ_match thy (resT, T) Vartab.empty
bulwahn@38079
   880
      val argsT' = map (Envir.subst_type subst) argsT
bulwahn@38079
   881
    in
bulwahn@38079
   882
      list_comb (Const (c, Envir.subst_type subst cT),
bulwahn@38079
   883
        map (restore_term ctxt constant_table) (args ~~ argsT'))
bulwahn@38079
   884
    end
bulwahn@38079
   885
bulwahn@39465
   886
    
bulwahn@39465
   887
(* restore numerals in natural numbers *)
bulwahn@39465
   888
bulwahn@39465
   889
fun restore_nat_numerals t =
bulwahn@39465
   890
  if fastype_of t = @{typ nat} andalso is_some (try HOLogic.dest_nat t) then
bulwahn@39465
   891
    HOLogic.mk_number @{typ nat} (HOLogic.dest_nat t)
bulwahn@39465
   892
  else
bulwahn@39465
   893
    (case t of
bulwahn@39465
   894
        t1 $ t2 => restore_nat_numerals t1 $ restore_nat_numerals t2
bulwahn@39465
   895
      | t => t)
bulwahn@39465
   896
  
bulwahn@38790
   897
(* values command *)
bulwahn@38790
   898
bulwahn@38790
   899
val preprocess_options = Predicate_Compile_Aux.Options {
bulwahn@38790
   900
  expected_modes = NONE,
bulwahn@39383
   901
  proposed_modes = [],
bulwahn@38790
   902
  proposed_names = [],
bulwahn@38790
   903
  show_steps = false,
bulwahn@38790
   904
  show_intermediate_results = false,
bulwahn@38790
   905
  show_proof_trace = false,
bulwahn@38790
   906
  show_modes = false,
bulwahn@38790
   907
  show_mode_inference = false,
bulwahn@38790
   908
  show_compilation = false,
bulwahn@38790
   909
  show_caught_failures = false,
bulwahn@39383
   910
  show_invalid_clauses = false,
bulwahn@38790
   911
  skip_proof = true,
bulwahn@38790
   912
  no_topmost_reordering = false,
bulwahn@38790
   913
  function_flattening = true,
bulwahn@38790
   914
  specialise = false,
bulwahn@38790
   915
  fail_safe_function_flattening = false,
bulwahn@38790
   916
  no_higher_order_predicate = [],
bulwahn@38790
   917
  inductify = false,
bulwahn@38790
   918
  detect_switches = true,
bulwahn@40054
   919
  smart_depth_limiting = true,
bulwahn@38790
   920
  compilation = Predicate_Compile_Aux.Pred
bulwahn@38790
   921
}
bulwahn@38790
   922
bulwahn@38075
   923
fun values ctxt soln t_compr =
bulwahn@38075
   924
  let
bulwahn@38950
   925
    val options = code_options_of (ProofContext.theory_of ctxt)
bulwahn@38075
   926
    val split = case t_compr of (Const (@{const_name Collect}, _) $ t) => t
bulwahn@38075
   927
      | _ => error ("Not a set comprehension: " ^ Syntax.string_of_term ctxt t_compr);
bulwahn@38075
   928
    val (body, Ts, fp) = HOLogic.strip_psplits split;
bulwahn@38075
   929
    val output_names = Name.variant_list (Term.add_free_names body [])
bulwahn@38075
   930
      (map (fn i => "x" ^ string_of_int i) (1 upto length Ts))
bulwahn@38080
   931
    val output_frees = rev (map2 (curry Free) output_names Ts)
bulwahn@38075
   932
    val body = subst_bounds (output_frees, body)
bulwahn@38075
   933
    val (pred as Const (name, T), all_args) =
bulwahn@38075
   934
      case strip_comb body of
bulwahn@38075
   935
        (Const (name, T), all_args) => (Const (name, T), all_args)
bulwahn@38075
   936
      | (head, _) => error ("Not a constant: " ^ Syntax.string_of_term ctxt head)
bulwahn@38732
   937
    val _ = tracing "Preprocessing specification..."
bulwahn@38732
   938
    val T = Sign.the_const_type (ProofContext.theory_of ctxt) name
bulwahn@38732
   939
    val t = Const (name, T)
wenzelm@38755
   940
    val thy' =
wenzelm@38755
   941
      Theory.copy (ProofContext.theory_of ctxt)
wenzelm@38755
   942
      |> Predicate_Compile.preprocess preprocess_options t
wenzelm@38755
   943
    val ctxt' = ProofContext.init_global thy'
bulwahn@38079
   944
    val _ = tracing "Generating prolog program..."
bulwahn@39461
   945
    val (p, constant_table) = generate (NONE, #ensure_groundness options) ctxt' name (* FIXME *)
bulwahn@39798
   946
      |> post_process ctxt' options name
bulwahn@39464
   947
    val constant_table' = declare_consts (fold Term.add_const_names all_args []) constant_table
bulwahn@39464
   948
    val args' = map (translate_term ctxt constant_table') all_args
bulwahn@38079
   949
    val _ = tracing "Running prolog program..."
bulwahn@39461
   950
    val system_config = System_Config.get (Context.Proof ctxt)
bulwahn@39461
   951
    val tss = run (#timeout system_config, #prolog_system system_config)
bulwahn@39464
   952
      p (translate_const constant_table' name, args') output_names soln
bulwahn@38079
   953
    val _ = tracing "Restoring terms..."
bulwahn@38115
   954
    val empty = Const("Orderings.bot_class.bot", fastype_of t_compr)
bulwahn@38115
   955
    fun mk_insert x S =
bulwahn@38115
   956
      Const (@{const_name "Set.insert"}, fastype_of x --> fastype_of S --> fastype_of S) $ x $ S 
bulwahn@38115
   957
    fun mk_set_compr in_insert [] xs =
bulwahn@38115
   958
       rev ((Free ("...", fastype_of t_compr)) ::
bulwahn@38115
   959
        (if null in_insert then xs else (fold mk_insert in_insert empty) :: xs))
bulwahn@38115
   960
      | mk_set_compr in_insert (t :: ts) xs =
bulwahn@38115
   961
        let
bulwahn@38115
   962
          val frees = Term.add_frees t []
bulwahn@38115
   963
        in
bulwahn@38115
   964
          if null frees then
bulwahn@38115
   965
            mk_set_compr (t :: in_insert) ts xs
bulwahn@38115
   966
          else
bulwahn@38115
   967
            let
wenzelm@38755
   968
              val uu as (uuN, uuT) = singleton (Variable.variant_frees ctxt' [t]) ("uu", fastype_of t)
bulwahn@38115
   969
              val set_compr =
bulwahn@38115
   970
                HOLogic.mk_Collect (uuN, uuT, fold (fn (s, T) => fn t => HOLogic.mk_exists (s, T, t))
bulwahn@38115
   971
                  frees (HOLogic.mk_conj (HOLogic.mk_eq (Free uu, t), @{term "True"})))
bulwahn@38115
   972
            in
bulwahn@38729
   973
              mk_set_compr [] ts
bulwahn@38729
   974
                (set_compr :: (if null in_insert then xs else (fold mk_insert in_insert empty) :: xs))  
bulwahn@38115
   975
            end
bulwahn@38115
   976
        end
bulwahn@38075
   977
  in
bulwahn@38115
   978
      foldl1 (HOLogic.mk_binop @{const_name sup}) (mk_set_compr []
bulwahn@39465
   979
        (map (fn ts => HOLogic.mk_tuple 
bulwahn@39465
   980
          (map (restore_nat_numerals o restore_term ctxt' constant_table) (ts ~~ Ts))) tss) [])
bulwahn@38075
   981
  end
bulwahn@38075
   982
bulwahn@38075
   983
fun values_cmd print_modes soln raw_t state =
bulwahn@38075
   984
  let
bulwahn@38075
   985
    val ctxt = Toplevel.context_of state
bulwahn@38075
   986
    val t = Syntax.read_term ctxt raw_t
bulwahn@38075
   987
    val t' = values ctxt soln t
bulwahn@38075
   988
    val ty' = Term.type_of t'
bulwahn@38075
   989
    val ctxt' = Variable.auto_fixes t' ctxt
bulwahn@38115
   990
    val _ = tracing "Printing terms..."
bulwahn@38075
   991
    val p = Print_Mode.with_modes print_modes (fn () =>
bulwahn@38075
   992
      Pretty.block [Pretty.quote (Syntax.pretty_term ctxt' t'), Pretty.fbrk,
bulwahn@38075
   993
        Pretty.str "::", Pretty.brk 1, Pretty.quote (Syntax.pretty_typ ctxt' ty')]) ();
bulwahn@38075
   994
  in Pretty.writeln p end;
bulwahn@38075
   995
bulwahn@38075
   996
bulwahn@38075
   997
(* renewing the values command for Prolog queries *)
bulwahn@38075
   998
bulwahn@38075
   999
val opt_print_modes =
bulwahn@38075
  1000
  Scan.optional (Parse.$$$ "(" |-- Parse.!!! (Scan.repeat1 Parse.xname --| Parse.$$$ ")")) [];
bulwahn@38075
  1001
bulwahn@38075
  1002
val _ = Outer_Syntax.improper_command "values" "enumerate and print comprehensions" Keyword.diag
bulwahn@38077
  1003
  (opt_print_modes -- Scan.optional (Parse.nat >> SOME) NONE -- Parse.term
bulwahn@38075
  1004
   >> (fn ((print_modes, soln), t) => Toplevel.keep
haftmann@38504
  1005
        (values_cmd print_modes soln t))); (*FIXME does not preserve the previous functionality*)
bulwahn@38075
  1006
bulwahn@38733
  1007
(* quickcheck generator *)
bulwahn@38733
  1008
bulwahn@39541
  1009
(* FIXME: a small clone of Predicate_Compile_Quickcheck - maybe refactor out commons *)
bulwahn@38733
  1010
bulwahn@39461
  1011
fun quickcheck ctxt t size =
bulwahn@38733
  1012
  let
bulwahn@38950
  1013
    val options = code_options_of (ProofContext.theory_of ctxt)
wenzelm@38755
  1014
    val thy = Theory.copy (ProofContext.theory_of ctxt)
bulwahn@39541
  1015
    val ((((full_constname, constT), vs'), intro), thy1) =
bulwahn@39541
  1016
      Predicate_Compile_Aux.define_quickcheck_predicate t thy
bulwahn@38733
  1017
    val thy2 = Context.theory_map (Predicate_Compile_Alternative_Defs.add_thm intro) thy1
bulwahn@39541
  1018
    val thy3 = Predicate_Compile.preprocess preprocess_options (Const (full_constname, constT)) thy2
wenzelm@38755
  1019
    val ctxt' = ProofContext.init_global thy3
bulwahn@38733
  1020
    val _ = tracing "Generating prolog program..."
bulwahn@39461
  1021
    val (p, constant_table) = generate (NONE, true) ctxt' full_constname
bulwahn@39798
  1022
      |> post_process ctxt' (set_ensure_groundness options) full_constname
bulwahn@38733
  1023
    val _ = tracing "Running prolog program..."
bulwahn@39461
  1024
    val system_config = System_Config.get (Context.Proof ctxt)
bulwahn@39461
  1025
    val tss = run (#timeout system_config, #prolog_system system_config)
bulwahn@39464
  1026
      p (translate_const constant_table full_constname, map (Var o fst) vs') (map fst vs') (SOME 1)
bulwahn@38733
  1027
    val _ = tracing "Restoring terms..."
bulwahn@38961
  1028
    val res =
bulwahn@38961
  1029
      case tss of
bulwahn@39541
  1030
        [ts] => SOME (map (restore_term ctxt' constant_table) (ts ~~ map snd vs'))
bulwahn@38961
  1031
      | _ => NONE
bulwahn@38733
  1032
  in
bulwahn@40924
  1033
    (res, NONE)
bulwahn@38733
  1034
  end; 
bulwahn@38732
  1035
bulwahn@38073
  1036
end;