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