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