src/HOL/Tools/Predicate_Compile/predicate_compile_core.ML
author haftmann
Sat Aug 28 16:14:32 2010 +0200 (2010-08-28)
changeset 38864 4abe644fcea5
parent 38797 abe92b33ac9f
child 38957 2eb265efa1b0
permissions -rw-r--r--
formerly unnamed infix equality now named HOL.eq
wenzelm@33265
     1
(*  Title:      HOL/Tools/Predicate_Compile/predicate_compile_core.ML
wenzelm@33265
     2
    Author:     Lukas Bulwahn, TU Muenchen
bulwahn@32667
     3
wenzelm@33265
     4
A compiler from predicates specified by intro/elim rules to equations.
bulwahn@32667
     5
*)
bulwahn@32667
     6
bulwahn@32667
     7
signature PREDICATE_COMPILE_CORE =
bulwahn@32667
     8
sig
bulwahn@36048
     9
  type mode = Predicate_Compile_Aux.mode
bulwahn@36048
    10
  type options = Predicate_Compile_Aux.options
bulwahn@36048
    11
  type compilation = Predicate_Compile_Aux.compilation
bulwahn@36048
    12
  type compilation_funs = Predicate_Compile_Aux.compilation_funs
bulwahn@36048
    13
  
bulwahn@33478
    14
  val setup : theory -> theory
bulwahn@36048
    15
  val code_pred : options -> string -> Proof.context -> Proof.state
bulwahn@36048
    16
  val code_pred_cmd : options -> string -> Proof.context -> Proof.state
bulwahn@36048
    17
  val values_cmd : string list -> mode option list option
bulwahn@36048
    18
    -> ((string option * bool) * (compilation * int list)) -> int -> string -> Toplevel.state -> unit
bulwahn@34948
    19
  val register_predicate : (string * thm list * thm) -> theory -> theory
bulwahn@33146
    20
  val register_intros : string * thm list -> theory -> theory
bulwahn@37003
    21
  val is_registered : Proof.context -> string -> bool
bulwahn@37003
    22
  val function_name_of : compilation -> Proof.context -> string -> mode -> string
bulwahn@36048
    23
  val predfun_intro_of: Proof.context -> string -> mode -> thm
bulwahn@36048
    24
  val predfun_elim_of: Proof.context -> string -> mode -> thm
bulwahn@37003
    25
  val all_preds_of : Proof.context -> string list
bulwahn@37003
    26
  val modes_of: compilation -> Proof.context -> string -> mode list
bulwahn@37003
    27
  val all_modes_of : compilation -> Proof.context -> (string * mode list) list
bulwahn@37003
    28
  val all_random_modes_of : Proof.context -> (string * mode list) list
bulwahn@37007
    29
  val intros_of : Proof.context -> string -> thm list
bulwahn@38072
    30
  val intros_graph_of : Proof.context -> thm list Graph.T
bulwahn@33478
    31
  val add_intro : thm -> theory -> theory
bulwahn@33478
    32
  val set_elim : thm -> theory -> theory
bulwahn@36048
    33
  val register_alternative_function : string -> mode -> string -> theory -> theory
bulwahn@37003
    34
  val alternative_compilation_of_global : theory -> string -> mode ->
bulwahn@37003
    35
    (compilation_funs -> typ -> term) option
bulwahn@37003
    36
  val alternative_compilation_of : Proof.context -> string -> mode ->
bulwahn@36038
    37
    (compilation_funs -> typ -> term) option
bulwahn@36048
    38
  val functional_compilation : string -> mode -> compilation_funs -> typ -> term
bulwahn@36048
    39
  val force_modes_and_functions : string -> (mode * (string * bool)) list -> theory -> theory
bulwahn@36038
    40
  val force_modes_and_compilations : string ->
bulwahn@36048
    41
    (mode * ((compilation_funs -> typ -> term) * bool)) list -> theory -> theory
bulwahn@34948
    42
  val preprocess_intro : theory -> thm -> thm
bulwahn@37007
    43
  val print_stored_rules : Proof.context -> unit
bulwahn@37003
    44
  val print_all_modes : compilation -> Proof.context -> unit
bulwahn@34948
    45
  val mk_casesrule : Proof.context -> term -> thm list -> term
bulwahn@33137
    46
  val eval_ref : (unit -> term Predicate.pred) option Unsynchronized.ref
bulwahn@33482
    47
  val random_eval_ref : (unit -> int * int -> term Predicate.pred * (int * int))
bulwahn@33482
    48
    option Unsynchronized.ref
bulwahn@34948
    49
  val dseq_eval_ref : (unit -> term DSequence.dseq) option Unsynchronized.ref
bulwahn@34948
    50
  val random_dseq_eval_ref : (unit -> int -> int -> int * int -> term DSequence.dseq * (int * int))
bulwahn@34948
    51
    option Unsynchronized.ref
bulwahn@36020
    52
  val new_random_dseq_eval_ref :
bulwahn@36020
    53
    (unit -> int -> int -> int * int -> int -> term Lazy_Sequence.lazy_sequence)
bulwahn@36020
    54
      option Unsynchronized.ref
bulwahn@36027
    55
  val new_random_dseq_stats_eval_ref :
bulwahn@36027
    56
    (unit -> int -> int -> int * int -> int -> (term * int) Lazy_Sequence.lazy_sequence)
bulwahn@36027
    57
      option Unsynchronized.ref
bulwahn@33628
    58
  val code_pred_intro_attrib : attribute
bulwahn@32667
    59
  (* used by Quickcheck_Generator *) 
bulwahn@32667
    60
  (* temporary for testing of the compilation *)
bulwahn@36048
    61
  val add_equations : options -> string list -> theory -> theory
bulwahn@36048
    62
  val add_depth_limited_random_equations : options -> string list -> theory -> theory
bulwahn@36048
    63
  val add_random_dseq_equations : options -> string list -> theory -> theory
bulwahn@36048
    64
  val add_new_random_dseq_equations : options -> string list -> theory -> theory
bulwahn@33473
    65
  val mk_tracing : string -> term -> term
bulwahn@32667
    66
end;
bulwahn@32667
    67
bulwahn@32667
    68
structure Predicate_Compile_Core : PREDICATE_COMPILE_CORE =
bulwahn@32667
    69
struct
bulwahn@32667
    70
bulwahn@32668
    71
open Predicate_Compile_Aux;
bulwahn@33144
    72
bulwahn@32667
    73
(** auxiliary **)
bulwahn@32667
    74
bulwahn@32667
    75
(* debug stuff *)
bulwahn@32667
    76
bulwahn@35886
    77
fun print_tac options s = 
bulwahn@33127
    78
  if show_proof_trace options then Tactical.print_tac s else Seq.single;
bulwahn@33127
    79
bulwahn@35885
    80
fun assert b = if not b then raise Fail "Assertion failed" else warning "Assertion holds"
bulwahn@34948
    81
bulwahn@33108
    82
datatype assertion = Max_number_of_subgoals of int
bulwahn@33108
    83
fun assert_tac (Max_number_of_subgoals i) st =
bulwahn@33108
    84
  if (nprems_of st <= i) then Seq.single st
bulwahn@35885
    85
  else raise Fail ("assert_tac: Numbers of subgoals mismatch at goal state :"
bulwahn@33108
    86
    ^ "\n" ^ Pretty.string_of (Pretty.chunks
bulwahn@33108
    87
      (Goal_Display.pretty_goals_without_context (! Goal_Display.goals_limit) st)));
bulwahn@33108
    88
bulwahn@32667
    89
(** fundamentals **)
bulwahn@32667
    90
bulwahn@32667
    91
(* syntactic operations *)
bulwahn@32667
    92
bulwahn@32667
    93
fun mk_eq (x, xs) =
bulwahn@32667
    94
  let fun mk_eqs _ [] = []
bulwahn@32667
    95
        | mk_eqs a (b::cs) =
bulwahn@32667
    96
            HOLogic.mk_eq (Free (a, fastype_of b), b) :: mk_eqs a cs
bulwahn@32667
    97
  in mk_eqs x xs end;
bulwahn@32667
    98
bulwahn@32667
    99
fun mk_scomp (t, u) =
bulwahn@32667
   100
  let
bulwahn@32667
   101
    val T = fastype_of t
bulwahn@32667
   102
    val U = fastype_of u
bulwahn@32667
   103
    val [A] = binder_types T
bulwahn@34948
   104
    val D = body_type U                   
bulwahn@32667
   105
  in 
bulwahn@32667
   106
    Const (@{const_name "scomp"}, T --> U --> A --> D) $ t $ u
bulwahn@32667
   107
  end;
bulwahn@32667
   108
bulwahn@32667
   109
fun dest_funT (Type ("fun",[S, T])) = (S, T)
bulwahn@32667
   110
  | dest_funT T = raise TYPE ("dest_funT", [T], [])
bulwahn@32667
   111
 
bulwahn@32667
   112
fun mk_fun_comp (t, u) =
bulwahn@32667
   113
  let
bulwahn@32667
   114
    val (_, B) = dest_funT (fastype_of t)
bulwahn@32667
   115
    val (C, A) = dest_funT (fastype_of u)
bulwahn@32667
   116
  in
bulwahn@32667
   117
    Const(@{const_name "Fun.comp"}, (A --> B) --> (C --> A) --> C --> B) $ t $ u
bulwahn@32667
   118
  end;
bulwahn@32667
   119
bulwahn@32667
   120
fun dest_randomT (Type ("fun", [@{typ Random.seed},
haftmann@37678
   121
  Type (@{type_name Product_Type.prod}, [Type (@{type_name Product_Type.prod}, [T, @{typ "unit => Code_Evaluation.term"}]) ,@{typ Random.seed}])])) = T
bulwahn@32667
   122
  | dest_randomT T = raise TYPE ("dest_randomT", [T], [])
bulwahn@32667
   123
bulwahn@33473
   124
fun mk_tracing s t =
bulwahn@33473
   125
  Const(@{const_name Code_Evaluation.tracing},
bulwahn@33473
   126
    @{typ String.literal} --> (fastype_of t) --> (fastype_of t)) $ (HOLogic.mk_literal s) $ t
bulwahn@33473
   127
bulwahn@34948
   128
val strip_intro_concl = (strip_comb o HOLogic.dest_Trueprop o Logic.strip_imp_concl o prop_of)
bulwahn@34948
   129
bulwahn@34948
   130
(* derivation trees for modes of premises *)
bulwahn@34948
   131
bulwahn@34948
   132
datatype mode_derivation = Mode_App of mode_derivation * mode_derivation | Context of mode
bulwahn@34948
   133
  | Mode_Pair of mode_derivation * mode_derivation | Term of mode
bulwahn@32667
   134
bulwahn@34948
   135
fun string_of_derivation (Mode_App (m1, m2)) =
bulwahn@34948
   136
  "App (" ^ string_of_derivation m1 ^ ", " ^ string_of_derivation m2 ^ ")"
bulwahn@34948
   137
  | string_of_derivation (Mode_Pair (m1, m2)) =
bulwahn@34948
   138
  "Pair (" ^ string_of_derivation m1 ^ ", " ^ string_of_derivation m2 ^ ")"
bulwahn@34948
   139
  | string_of_derivation (Term m) = "Term (" ^ string_of_mode m ^ ")"
bulwahn@34948
   140
  | string_of_derivation (Context m) = "Context (" ^ string_of_mode m ^ ")"
bulwahn@32667
   141
bulwahn@34948
   142
fun strip_mode_derivation deriv =
bulwahn@32667
   143
  let
bulwahn@34948
   144
    fun strip (Mode_App (deriv1, deriv2)) ds = strip deriv1 (deriv2 :: ds)
bulwahn@34948
   145
      | strip deriv ds = (deriv, ds)
bulwahn@34948
   146
  in
bulwahn@34948
   147
    strip deriv []
bulwahn@34948
   148
  end
bulwahn@34948
   149
bulwahn@34948
   150
fun mode_of (Context m) = m
bulwahn@34948
   151
  | mode_of (Term m) = m
bulwahn@34948
   152
  | mode_of (Mode_App (d1, d2)) =
bulwahn@34948
   153
    (case mode_of d1 of Fun (m, m') =>
bulwahn@35885
   154
        (if eq_mode (m, mode_of d2) then m' else raise Fail "mode_of")
bulwahn@35885
   155
      | _ => raise Fail "mode_of2")
bulwahn@34948
   156
  | mode_of (Mode_Pair (d1, d2)) =
bulwahn@34948
   157
    Pair (mode_of d1, mode_of d2)
bulwahn@34948
   158
bulwahn@34948
   159
fun head_mode_of deriv = mode_of (fst (strip_mode_derivation deriv))
bulwahn@32667
   160
bulwahn@34948
   161
fun param_derivations_of deriv =
bulwahn@32667
   162
  let
bulwahn@34948
   163
    val (_, argument_derivs) = strip_mode_derivation deriv
bulwahn@34948
   164
    fun param_derivation (Mode_Pair (m1, m2)) =
bulwahn@34948
   165
        param_derivation m1 @ param_derivation m2
bulwahn@34948
   166
      | param_derivation (Term _) = []
bulwahn@34948
   167
      | param_derivation m = [m]
bulwahn@34948
   168
  in
bulwahn@34948
   169
    maps param_derivation argument_derivs
bulwahn@34948
   170
  end
bulwahn@32667
   171
bulwahn@34948
   172
fun collect_context_modes (Mode_App (m1, m2)) =
bulwahn@34948
   173
      collect_context_modes m1 @ collect_context_modes m2
bulwahn@34948
   174
  | collect_context_modes (Mode_Pair (m1, m2)) =
bulwahn@34948
   175
      collect_context_modes m1 @ collect_context_modes m2
bulwahn@34948
   176
  | collect_context_modes (Context m) = [m]
bulwahn@34948
   177
  | collect_context_modes (Term _) = []
bulwahn@32668
   178
bulwahn@34948
   179
(* representation of inferred clauses with modes *)
bulwahn@32667
   180
bulwahn@34948
   181
type moded_clause = term list * (indprem * mode_derivation) list
bulwahn@34948
   182
bulwahn@35324
   183
type 'a pred_mode_table = (string * ((bool * mode) * 'a) list) list
bulwahn@32667
   184
bulwahn@34948
   185
(* book-keeping *)
bulwahn@34948
   186
bulwahn@32667
   187
datatype predfun_data = PredfunData of {
bulwahn@32667
   188
  definition : thm,
bulwahn@32667
   189
  intro : thm,
bulwahn@35884
   190
  elim : thm,
bulwahn@35884
   191
  neg_intro : thm option
bulwahn@32667
   192
};
bulwahn@32667
   193
bulwahn@32667
   194
fun rep_predfun_data (PredfunData data) = data;
bulwahn@32667
   195
bulwahn@35884
   196
fun mk_predfun_data (definition, ((intro, elim), neg_intro)) =
bulwahn@35884
   197
  PredfunData {definition = definition, intro = intro, elim = elim, neg_intro = neg_intro}
bulwahn@32667
   198
bulwahn@32667
   199
datatype pred_data = PredData of {
bulwahn@32667
   200
  intros : thm list,
bulwahn@32667
   201
  elim : thm option,
bulwahn@34948
   202
  function_names : (compilation * (mode * string) list) list,
bulwahn@34948
   203
  predfun_data : (mode * predfun_data) list,
bulwahn@34948
   204
  needs_random : mode list
bulwahn@32667
   205
};
bulwahn@32667
   206
bulwahn@32667
   207
fun rep_pred_data (PredData data) = data;
bulwahn@34948
   208
bulwahn@35887
   209
fun mk_pred_data ((intros, elim), (function_names, (predfun_data, needs_random))) =
bulwahn@34948
   210
  PredData {intros = intros, elim = elim,
bulwahn@34948
   211
    function_names = function_names, predfun_data = predfun_data, needs_random = needs_random}
bulwahn@34948
   212
bulwahn@34948
   213
fun map_pred_data f (PredData {intros, elim, function_names, predfun_data, needs_random}) =
bulwahn@35887
   214
  mk_pred_data (f ((intros, elim), (function_names, (predfun_data, needs_random))))
bulwahn@33144
   215
bulwahn@32667
   216
fun eq_option eq (NONE, NONE) = true
bulwahn@32667
   217
  | eq_option eq (SOME x, SOME y) = eq (x, y)
bulwahn@32667
   218
  | eq_option eq _ = false
bulwahn@33144
   219
bulwahn@32667
   220
fun eq_pred_data (PredData d1, PredData d2) = 
bulwahn@35885
   221
  eq_list Thm.eq_thm (#intros d1, #intros d2) andalso
bulwahn@35885
   222
  eq_option Thm.eq_thm (#elim d1, #elim d2)
bulwahn@33144
   223
wenzelm@33522
   224
structure PredData = Theory_Data
bulwahn@32667
   225
(
bulwahn@32667
   226
  type T = pred_data Graph.T;
bulwahn@32667
   227
  val empty = Graph.empty;
bulwahn@32667
   228
  val extend = I;
wenzelm@33522
   229
  val merge = Graph.merge eq_pred_data;
bulwahn@32667
   230
);
bulwahn@32667
   231
bulwahn@32667
   232
(* queries *)
bulwahn@32667
   233
bulwahn@37007
   234
fun lookup_pred_data ctxt name =
bulwahn@37007
   235
  Option.map rep_pred_data (try (Graph.get_node (PredData.get (ProofContext.theory_of ctxt))) name)
bulwahn@32667
   236
bulwahn@37007
   237
fun the_pred_data ctxt name = case lookup_pred_data ctxt name
bulwahn@32667
   238
 of NONE => error ("No such predicate " ^ quote name)  
bulwahn@32667
   239
  | SOME data => data;
bulwahn@32667
   240
bulwahn@37007
   241
val is_registered = is_some oo lookup_pred_data
bulwahn@32667
   242
bulwahn@37003
   243
val all_preds_of = Graph.keys o PredData.get o ProofContext.theory_of
bulwahn@32667
   244
bulwahn@37007
   245
val intros_of = #intros oo the_pred_data
bulwahn@32667
   246
bulwahn@37007
   247
fun the_elim_of ctxt name = case #elim (the_pred_data ctxt name)
bulwahn@32667
   248
 of NONE => error ("No elimination rule for predicate " ^ quote name)
bulwahn@37007
   249
  | SOME thm => thm
bulwahn@32667
   250
  
bulwahn@37007
   251
val has_elim = is_some o #elim oo the_pred_data
bulwahn@32667
   252
bulwahn@37003
   253
fun function_names_of compilation ctxt name =
bulwahn@37007
   254
  case AList.lookup (op =) (#function_names (the_pred_data ctxt name)) compilation of
bulwahn@34948
   255
    NONE => error ("No " ^ string_of_compilation compilation
bulwahn@34948
   256
      ^ "functions defined for predicate " ^ quote name)
bulwahn@34948
   257
  | SOME fun_names => fun_names
bulwahn@32667
   258
bulwahn@37003
   259
fun function_name_of compilation ctxt name mode =
bulwahn@35324
   260
  case AList.lookup eq_mode
bulwahn@37003
   261
    (function_names_of compilation ctxt name) mode of
bulwahn@34948
   262
    NONE => error ("No " ^ string_of_compilation compilation
bulwahn@36019
   263
      ^ " function defined for mode " ^ string_of_mode mode ^ " of predicate " ^ quote name)
bulwahn@34948
   264
  | SOME function_name => function_name
bulwahn@34948
   265
bulwahn@37003
   266
fun modes_of compilation ctxt name = map fst (function_names_of compilation ctxt name)
bulwahn@32667
   267
bulwahn@37003
   268
fun all_modes_of compilation ctxt =
bulwahn@37003
   269
  map_filter (fn name => Option.map (pair name) (try (modes_of compilation ctxt) name))
bulwahn@37003
   270
    (all_preds_of ctxt)
bulwahn@34948
   271
bulwahn@34948
   272
val all_random_modes_of = all_modes_of Random
bulwahn@34948
   273
bulwahn@37007
   274
fun defined_functions compilation ctxt name = case lookup_pred_data ctxt name of
bulwahn@37001
   275
    NONE => false
bulwahn@37001
   276
  | SOME data => AList.defined (op =) (#function_names data) compilation
bulwahn@32667
   277
bulwahn@37003
   278
fun needs_random ctxt s m =
bulwahn@37007
   279
  member (op =) (#needs_random (the_pred_data ctxt s)) m
bulwahn@37003
   280
bulwahn@37007
   281
fun lookup_predfun_data ctxt name mode =
bulwahn@33483
   282
  Option.map rep_predfun_data
bulwahn@37007
   283
    (AList.lookup (op =) (#predfun_data (the_pred_data ctxt name)) mode)
bulwahn@32667
   284
bulwahn@37007
   285
fun the_predfun_data ctxt name mode =
bulwahn@37007
   286
  case lookup_predfun_data ctxt name mode of
bulwahn@34948
   287
    NONE => error ("No function defined for mode " ^ string_of_mode mode ^
bulwahn@34948
   288
      " of predicate " ^ name)
bulwahn@34948
   289
  | SOME data => data;
bulwahn@32667
   290
bulwahn@37007
   291
val predfun_definition_of = #definition ooo the_predfun_data
bulwahn@32667
   292
bulwahn@37007
   293
val predfun_intro_of = #intro ooo the_predfun_data
bulwahn@32667
   294
bulwahn@37007
   295
val predfun_elim_of = #elim ooo the_predfun_data
bulwahn@32667
   296
bulwahn@37007
   297
val predfun_neg_intro_of = #neg_intro ooo the_predfun_data
bulwahn@35884
   298
bulwahn@38072
   299
val intros_graph_of =
bulwahn@38072
   300
  Graph.map_nodes (#intros o rep_pred_data) o PredData.get o ProofContext.theory_of
bulwahn@38072
   301
bulwahn@32667
   302
(* diagnostic display functions *)
bulwahn@32667
   303
bulwahn@37004
   304
fun print_modes options modes =
bulwahn@33251
   305
  if show_modes options then
bulwahn@33326
   306
    tracing ("Inferred modes:\n" ^
bulwahn@33251
   307
      cat_lines (map (fn (s, ms) => s ^ ": " ^ commas (map
bulwahn@35324
   308
        (fn (p, m) => string_of_mode m ^ (if p then "pos" else "neg")) ms)) modes))
bulwahn@33251
   309
  else ()
bulwahn@32667
   310
bulwahn@37004
   311
fun print_pred_mode_table string_of_entry pred_mode_table =
bulwahn@32667
   312
  let
bulwahn@35324
   313
    fun print_mode pred ((pol, mode), entry) =  "mode : " ^ string_of_mode mode
bulwahn@33619
   314
      ^ string_of_entry pred mode entry
bulwahn@32667
   315
    fun print_pred (pred, modes) =
bulwahn@32667
   316
      "predicate " ^ pred ^ ": " ^ cat_lines (map (print_mode pred) modes)
bulwahn@33326
   317
    val _ = tracing (cat_lines (map print_pred pred_mode_table))
bulwahn@32667
   318
  in () end;
bulwahn@32667
   319
bulwahn@37003
   320
fun string_of_prem ctxt (Prem t) =
bulwahn@37003
   321
    (Syntax.string_of_term ctxt t) ^ "(premise)"
bulwahn@37003
   322
  | string_of_prem ctxt (Negprem t) =
bulwahn@37003
   323
    (Syntax.string_of_term ctxt (HOLogic.mk_not t)) ^ "(negative premise)"
bulwahn@37003
   324
  | string_of_prem ctxt (Sidecond t) =
bulwahn@37003
   325
    (Syntax.string_of_term ctxt t) ^ "(sidecondition)"
bulwahn@37003
   326
  | string_of_prem ctxt _ = raise Fail "string_of_prem: unexpected input"
bulwahn@33130
   327
bulwahn@37003
   328
fun string_of_clause ctxt pred (ts, prems) =
bulwahn@33130
   329
  (space_implode " --> "
bulwahn@37003
   330
  (map (string_of_prem ctxt) prems)) ^ " --> " ^ pred ^ " "
bulwahn@37003
   331
   ^ (space_implode " " (map (Syntax.string_of_term ctxt) ts))
bulwahn@33130
   332
bulwahn@37005
   333
fun print_compiled_terms options ctxt =
bulwahn@33139
   334
  if show_compilation options then
bulwahn@37005
   335
    print_pred_mode_table (fn _ => fn _ => Syntax.string_of_term ctxt)
bulwahn@33139
   336
  else K ()
bulwahn@33139
   337
bulwahn@37007
   338
fun print_stored_rules ctxt =
bulwahn@32667
   339
  let
bulwahn@37007
   340
    val preds = Graph.keys (PredData.get (ProofContext.theory_of ctxt))
bulwahn@32667
   341
    fun print pred () = let
bulwahn@32667
   342
      val _ = writeln ("predicate: " ^ pred)
bulwahn@32667
   343
      val _ = writeln ("introrules: ")
bulwahn@37007
   344
      val _ = fold (fn thm => fn u => writeln (Display.string_of_thm ctxt thm))
bulwahn@37007
   345
        (rev (intros_of ctxt pred)) ()
bulwahn@32667
   346
    in
bulwahn@37007
   347
      if (has_elim ctxt pred) then
bulwahn@37007
   348
        writeln ("elimrule: " ^ Display.string_of_thm ctxt (the_elim_of ctxt pred))
bulwahn@32667
   349
      else
bulwahn@32667
   350
        writeln ("no elimrule defined")
bulwahn@32667
   351
    end
bulwahn@32667
   352
  in
bulwahn@32667
   353
    fold print preds ()
bulwahn@32667
   354
  end;
bulwahn@32667
   355
bulwahn@37003
   356
fun print_all_modes compilation ctxt =
bulwahn@32667
   357
  let
bulwahn@32667
   358
    val _ = writeln ("Inferred modes:")
bulwahn@32667
   359
    fun print (pred, modes) u =
bulwahn@32667
   360
      let
bulwahn@32667
   361
        val _ = writeln ("predicate: " ^ pred)
bulwahn@34948
   362
        val _ = writeln ("modes: " ^ (commas (map string_of_mode modes)))
bulwahn@33619
   363
      in u end
bulwahn@32667
   364
  in
bulwahn@37003
   365
    fold print (all_modes_of compilation ctxt) ()
bulwahn@32667
   366
  end
bulwahn@33129
   367
bulwahn@33132
   368
(* validity checks *)
bulwahn@33752
   369
(* EXPECTED MODE and PROPOSED_MODE are largely the same; define a clear semantics for those! *)
bulwahn@33132
   370
bulwahn@33752
   371
fun check_expected_modes preds options modes =
bulwahn@33752
   372
  case expected_modes options of
bulwahn@33752
   373
    SOME (s, ms) => (case AList.lookup (op =) modes s of
bulwahn@33752
   374
      SOME modes =>
bulwahn@33752
   375
        let
bulwahn@35324
   376
          val modes' = map snd modes
bulwahn@33752
   377
        in
bulwahn@34948
   378
          if not (eq_set eq_mode (ms, modes')) then
bulwahn@33752
   379
            error ("expected modes were not inferred:\n"
bulwahn@34948
   380
            ^ "  inferred modes for " ^ s ^ ": " ^ commas (map string_of_mode modes')  ^ "\n"
bulwahn@34948
   381
            ^ "  expected modes for " ^ s ^ ": " ^ commas (map string_of_mode ms))
bulwahn@33752
   382
          else ()
bulwahn@33752
   383
        end
bulwahn@33752
   384
      | NONE => ())
bulwahn@33752
   385
  | NONE => ()
bulwahn@33752
   386
bulwahn@33752
   387
fun check_proposed_modes preds options modes extra_modes errors =
bulwahn@33752
   388
  case proposed_modes options of
bulwahn@33752
   389
    SOME (s, ms) => (case AList.lookup (op =) modes s of
bulwahn@33752
   390
      SOME inferred_ms =>
bulwahn@33752
   391
        let
bulwahn@33752
   392
          val preds_without_modes = map fst (filter (null o snd) (modes @ extra_modes))
bulwahn@35324
   393
          val modes' = map snd inferred_ms
bulwahn@33752
   394
        in
bulwahn@34948
   395
          if not (eq_set eq_mode (ms, modes')) then
bulwahn@33752
   396
            error ("expected modes were not inferred:\n"
bulwahn@34948
   397
            ^ "  inferred modes for " ^ s ^ ": " ^ commas (map string_of_mode modes')  ^ "\n"
bulwahn@34948
   398
            ^ "  expected modes for " ^ s ^ ": " ^ commas (map string_of_mode ms) ^ "\n"
bulwahn@33752
   399
            ^ "For the following clauses, the following modes could not be inferred: " ^ "\n"
bulwahn@33752
   400
            ^ cat_lines errors ^
bulwahn@33752
   401
            (if not (null preds_without_modes) then
bulwahn@33752
   402
              "\n" ^ "No mode inferred for the predicates " ^ commas preds_without_modes
bulwahn@33752
   403
            else ""))
bulwahn@33752
   404
          else ()
bulwahn@33752
   405
        end
bulwahn@33752
   406
      | NONE => ())
bulwahn@33752
   407
  | NONE => ()
bulwahn@33132
   408
bulwahn@33144
   409
(* importing introduction rules *)
bulwahn@33129
   410
bulwahn@33129
   411
fun unify_consts thy cs intr_ts =
bulwahn@33129
   412
  (let
bulwahn@33129
   413
     val add_term_consts_2 = fold_aterms (fn Const c => insert (op =) c | _ => I);
bulwahn@33129
   414
     fun varify (t, (i, ts)) =
wenzelm@35845
   415
       let val t' = map_types (Logic.incr_tvar (i + 1)) (#2 (Type.varify_global [] t))
bulwahn@33129
   416
       in (maxidx_of_term t', t'::ts) end;
bulwahn@33150
   417
     val (i, cs') = List.foldr varify (~1, []) cs;
bulwahn@33150
   418
     val (i', intr_ts') = List.foldr varify (i, []) intr_ts;
bulwahn@33129
   419
     val rec_consts = fold add_term_consts_2 cs' [];
bulwahn@33129
   420
     val intr_consts = fold add_term_consts_2 intr_ts' [];
bulwahn@33129
   421
     fun unify (cname, cT) =
wenzelm@33317
   422
       let val consts = map snd (filter (fn c => fst c = cname) intr_consts)
bulwahn@33129
   423
       in fold (Sign.typ_unify thy) ((replicate (length consts) cT) ~~ consts) end;
bulwahn@33129
   424
     val (env, _) = fold unify rec_consts (Vartab.empty, i');
bulwahn@33129
   425
     val subst = map_types (Envir.norm_type env)
bulwahn@33129
   426
   in (map subst cs', map subst intr_ts')
bulwahn@33129
   427
   end) handle Type.TUNIFY =>
bulwahn@33129
   428
     (warning "Occurrences of recursive constant have non-unifiable types"; (cs, intr_ts));
bulwahn@33129
   429
bulwahn@34948
   430
fun import_intros inp_pred [] ctxt =
bulwahn@33146
   431
  let
bulwahn@34948
   432
    val ([outp_pred], ctxt') = Variable.import_terms true [inp_pred] ctxt
bulwahn@34948
   433
    val T = fastype_of outp_pred
bulwahn@34948
   434
    (* TODO: put in a function for this next line! *)
bulwahn@34948
   435
    val paramTs = ho_argsT_of (hd (all_modes_of_typ T)) (binder_types T)
bulwahn@34948
   436
    val (param_names, ctxt'') = Variable.variant_fixes
bulwahn@34948
   437
      (map (fn i => "p" ^ (string_of_int i)) (1 upto (length paramTs))) ctxt'
bulwahn@33629
   438
    val params = map2 (curry Free) param_names paramTs
bulwahn@34948
   439
  in
bulwahn@34948
   440
    (((outp_pred, params), []), ctxt')
bulwahn@34948
   441
  end
bulwahn@34948
   442
  | import_intros inp_pred (th :: ths) ctxt =
bulwahn@33129
   443
    let
bulwahn@34948
   444
      val ((_, [th']), ctxt') = Variable.import true [th] ctxt
bulwahn@33129
   445
      val thy = ProofContext.theory_of ctxt'
bulwahn@34948
   446
      val (pred, args) = strip_intro_concl th'
bulwahn@34948
   447
      val T = fastype_of pred
bulwahn@34948
   448
      val ho_args = ho_args_of (hd (all_modes_of_typ T)) args
bulwahn@33146
   449
      fun subst_of (pred', pred) =
bulwahn@33146
   450
        let
bulwahn@33146
   451
          val subst = Sign.typ_match thy (fastype_of pred', fastype_of pred) Vartab.empty
bulwahn@33146
   452
        in map (fn (indexname, (s, T)) => ((indexname, s), T)) (Vartab.dest subst) end
bulwahn@33129
   453
      fun instantiate_typ th =
bulwahn@33129
   454
        let
bulwahn@34948
   455
          val (pred', _) = strip_intro_concl th
bulwahn@33129
   456
          val _ = if not (fst (dest_Const pred) = fst (dest_Const pred')) then
bulwahn@35885
   457
            raise Fail "Trying to instantiate another predicate" else ()
bulwahn@33146
   458
        in Thm.certify_instantiate (subst_of (pred', pred), []) th end;
bulwahn@33129
   459
      fun instantiate_ho_args th =
bulwahn@33129
   460
        let
bulwahn@34948
   461
          val (_, args') = (strip_comb o HOLogic.dest_Trueprop o Logic.strip_imp_concl o prop_of) th
bulwahn@34948
   462
          val ho_args' = map dest_Var (ho_args_of (hd (all_modes_of_typ T)) args')
bulwahn@34948
   463
        in Thm.certify_instantiate ([], ho_args' ~~ ho_args) th end
bulwahn@33146
   464
      val outp_pred =
bulwahn@33146
   465
        Term_Subst.instantiate (subst_of (inp_pred, pred), []) inp_pred
bulwahn@33129
   466
      val ((_, ths'), ctxt1) =
bulwahn@33129
   467
        Variable.import false (map (instantiate_typ #> instantiate_ho_args) ths) ctxt'
bulwahn@33129
   468
    in
bulwahn@34948
   469
      (((outp_pred, ho_args), th' :: ths'), ctxt1)
bulwahn@33129
   470
    end
bulwahn@33129
   471
bulwahn@33129
   472
(* generation of case rules from user-given introduction rules *)
bulwahn@33129
   473
haftmann@37678
   474
fun mk_args2 (Type (@{type_name Product_Type.prod}, [T1, T2])) st =
bulwahn@34948
   475
    let
bulwahn@34948
   476
      val (t1, st') = mk_args2 T1 st
bulwahn@34948
   477
      val (t2, st'') = mk_args2 T2 st'
bulwahn@34948
   478
    in
bulwahn@34948
   479
      (HOLogic.mk_prod (t1, t2), st'')
bulwahn@34948
   480
    end
bulwahn@35884
   481
  (*| mk_args2 (T as Type ("fun", _)) (params, ctxt) = 
bulwahn@34948
   482
    let
bulwahn@34948
   483
      val (S, U) = strip_type T
bulwahn@34948
   484
    in
bulwahn@34948
   485
      if U = HOLogic.boolT then
bulwahn@34948
   486
        (hd params, (tl params, ctxt))
bulwahn@34948
   487
      else
bulwahn@34948
   488
        let
bulwahn@34948
   489
          val ([x], ctxt') = Variable.variant_fixes ["x"] ctxt
bulwahn@34948
   490
        in
bulwahn@34948
   491
          (Free (x, T), (params, ctxt'))
bulwahn@34948
   492
        end
bulwahn@35884
   493
    end*)
bulwahn@34948
   494
  | mk_args2 T (params, ctxt) =
bulwahn@34948
   495
    let
bulwahn@34948
   496
      val ([x], ctxt') = Variable.variant_fixes ["x"] ctxt
bulwahn@34948
   497
    in
bulwahn@34948
   498
      (Free (x, T), (params, ctxt'))
bulwahn@34948
   499
    end
bulwahn@35884
   500
bulwahn@34948
   501
fun mk_casesrule ctxt pred introrules =
bulwahn@33129
   502
  let
bulwahn@35884
   503
    (* TODO: can be simplified if parameters are not treated specially ? *)
bulwahn@34948
   504
    val (((pred, params), intros_th), ctxt1) = import_intros pred introrules ctxt
bulwahn@35884
   505
    (* TODO: distinct required ? -- test case with more than one parameter! *)
bulwahn@35884
   506
    val params = distinct (op aconv) params
bulwahn@33129
   507
    val intros = map prop_of intros_th
bulwahn@33129
   508
    val ([propname], ctxt2) = Variable.variant_fixes ["thesis"] ctxt1
bulwahn@33129
   509
    val prop = HOLogic.mk_Trueprop (Free (propname, HOLogic.boolT))
bulwahn@34948
   510
    val argsT = binder_types (fastype_of pred)
bulwahn@35884
   511
    (* TODO: can be simplified if parameters are not treated specially ? <-- see uncommented code! *)
bulwahn@34948
   512
    val (argvs, _) = fold_map mk_args2 argsT (params, ctxt2)
bulwahn@33129
   513
    fun mk_case intro =
bulwahn@33129
   514
      let
bulwahn@34948
   515
        val (_, args) = (strip_comb o HOLogic.dest_Trueprop o Logic.strip_imp_concl) intro
bulwahn@33129
   516
        val prems = Logic.strip_imp_prems intro
bulwahn@35884
   517
        val eqprems =
bulwahn@35884
   518
          map2 (HOLogic.mk_Trueprop oo (curry HOLogic.mk_eq)) argvs args
bulwahn@35884
   519
        val frees = map Free (fold Term.add_frees (args @ prems) [])
bulwahn@33129
   520
      in fold Logic.all frees (Logic.list_implies (eqprems @ prems, prop)) end
bulwahn@34948
   521
    val assm = HOLogic.mk_Trueprop (list_comb (pred, argvs))
bulwahn@33129
   522
    val cases = map mk_case intros
bulwahn@33129
   523
  in Logic.list_implies (assm :: cases, prop) end;
bulwahn@33129
   524
bulwahn@35884
   525
fun dest_conjunct_prem th =
bulwahn@35884
   526
  case HOLogic.dest_Trueprop (prop_of th) of
haftmann@38795
   527
    (Const (@{const_name HOL.conj}, _) $ t $ t') =>
bulwahn@35884
   528
      dest_conjunct_prem (th RS @{thm conjunct1})
bulwahn@35884
   529
        @ dest_conjunct_prem (th RS @{thm conjunct2})
bulwahn@35884
   530
    | _ => [th]
bulwahn@35884
   531
bulwahn@35884
   532
fun prove_casesrule ctxt (pred, (pre_cases_rule, nparams)) cases_rule =
bulwahn@35884
   533
  let
bulwahn@35884
   534
    val thy = ProofContext.theory_of ctxt
bulwahn@35884
   535
    val nargs = length (binder_types (fastype_of pred))
bulwahn@35884
   536
    fun PEEK f dependent_tactic st = dependent_tactic (f st) st
bulwahn@35884
   537
    fun meta_eq_of th = th RS @{thm eq_reflection}
bulwahn@35884
   538
    val tuple_rew_rules = map meta_eq_of [@{thm fst_conv}, @{thm snd_conv}, @{thm Pair_eq}]
bulwahn@35884
   539
    fun instantiate i n {context = ctxt, params = p, prems = prems,
bulwahn@35884
   540
      asms = a, concl = cl, schematics = s}  =
bulwahn@35884
   541
      let
bulwahn@36510
   542
        fun term_pair_of (ix, (ty,t)) = (Var (ix,ty), t)
bulwahn@36510
   543
        fun inst_of_matches tts = fold (Pattern.match thy) tts (Vartab.empty, Vartab.empty)
bulwahn@36510
   544
          |> snd |> Vartab.dest |> map (pairself (cterm_of thy) o term_pair_of)
bulwahn@35884
   545
        val (cases, (eqs, prems)) = apsnd (chop (nargs - nparams)) (chop n prems)
bulwahn@35884
   546
        val case_th = MetaSimplifier.simplify true
bulwahn@36509
   547
          (@{thm Predicate.eq_is_eq} :: map meta_eq_of eqs) (nth cases (i - 1))
bulwahn@35884
   548
        val prems' = maps (dest_conjunct_prem o MetaSimplifier.simplify true tuple_rew_rules) prems
bulwahn@35884
   549
        val pats = map (swap o HOLogic.dest_eq o HOLogic.dest_Trueprop) (take nargs (prems_of case_th))
bulwahn@36510
   550
        val case_th' = Thm.instantiate ([], inst_of_matches pats) case_th
bulwahn@36510
   551
          OF (replicate nargs @{thm refl})
bulwahn@36510
   552
        val thesis =
bulwahn@36510
   553
          Thm.instantiate ([], inst_of_matches (prems_of case_th' ~~ map prop_of prems')) case_th'
bulwahn@36510
   554
            OF prems'
bulwahn@35884
   555
      in
bulwahn@35884
   556
        (rtac thesis 1)
bulwahn@35884
   557
      end
bulwahn@35884
   558
    val tac =
bulwahn@35884
   559
      etac pre_cases_rule 1
bulwahn@35884
   560
      THEN
bulwahn@35884
   561
      (PEEK nprems_of
bulwahn@35884
   562
        (fn n =>
bulwahn@35884
   563
          ALLGOALS (fn i =>
bulwahn@35884
   564
            MetaSimplifier.rewrite_goal_tac [@{thm split_paired_all}] i
bulwahn@35884
   565
            THEN (SUBPROOF (instantiate i n) ctxt i))))
bulwahn@35884
   566
  in
bulwahn@35884
   567
    Goal.prove ctxt (Term.add_free_names cases_rule []) [] cases_rule (fn _ => tac)
bulwahn@35884
   568
  end
bulwahn@35884
   569
bulwahn@34948
   570
(** preprocessing rules **)
bulwahn@32667
   571
bulwahn@32667
   572
fun imp_prems_conv cv ct =
bulwahn@32667
   573
  case Thm.term_of ct of
bulwahn@32667
   574
    Const ("==>", _) $ _ $ _ => Conv.combination_conv (Conv.arg_conv cv) (imp_prems_conv cv) ct
bulwahn@32667
   575
  | _ => Conv.all_conv ct
bulwahn@32667
   576
bulwahn@32667
   577
fun Trueprop_conv cv ct =
bulwahn@32667
   578
  case Thm.term_of ct of
haftmann@38558
   579
    Const (@{const_name Trueprop}, _) $ _ => Conv.arg_conv cv ct  
bulwahn@35885
   580
  | _ => raise Fail "Trueprop_conv"
bulwahn@32667
   581
bulwahn@32667
   582
fun preprocess_intro thy rule =
bulwahn@32667
   583
  Conv.fconv_rule
bulwahn@32667
   584
    (imp_prems_conv
bulwahn@32667
   585
      (Trueprop_conv (Conv.try_conv (Conv.rewr_conv (Thm.symmetric @{thm Predicate.eq_is_eq})))))
bulwahn@32667
   586
    (Thm.transfer thy rule)
bulwahn@32667
   587
bulwahn@37003
   588
fun preprocess_elim ctxt elimrule =
bulwahn@32667
   589
  let
haftmann@38864
   590
    fun replace_eqs (Const (@{const_name Trueprop}, _) $ (Const (@{const_name HOL.eq}, T) $ lhs $ rhs)) =
bulwahn@32667
   591
       HOLogic.mk_Trueprop (Const (@{const_name Predicate.eq}, T) $ lhs $ rhs)
bulwahn@32667
   592
     | replace_eqs t = t
bulwahn@37003
   593
    val thy = ProofContext.theory_of ctxt
bulwahn@33128
   594
    val ((_, [elimrule]), ctxt') = Variable.import false [elimrule] ctxt
bulwahn@33128
   595
    val prems = Thm.prems_of elimrule
bulwahn@34948
   596
    val nargs = length (snd (strip_comb (HOLogic.dest_Trueprop (hd prems))))
bulwahn@32667
   597
    fun preprocess_case t =
bulwahn@33128
   598
      let
bulwahn@32667
   599
       val params = Logic.strip_params t
bulwahn@32667
   600
       val (assums1, assums2) = chop nargs (Logic.strip_assums_hyp t)
bulwahn@32667
   601
       val assums_hyp' = assums1 @ (map replace_eqs assums2)
bulwahn@33128
   602
      in
bulwahn@32667
   603
       list_all (params, Logic.list_implies (assums_hyp', Logic.strip_assums_concl t))
bulwahn@33128
   604
      end
bulwahn@32667
   605
    val cases' = map preprocess_case (tl prems)
bulwahn@32667
   606
    val elimrule' = Logic.list_implies ((hd prems) :: cases', Thm.concl_of elimrule)
bulwahn@32667
   607
    val bigeq = (Thm.symmetric (Conv.implies_concl_conv
bulwahn@32667
   608
      (MetaSimplifier.rewrite true [@{thm Predicate.eq_is_eq}])
bulwahn@32667
   609
        (cterm_of thy elimrule')))
bulwahn@35884
   610
    val tac = (fn _ => Skip_Proof.cheat_tac thy)
bulwahn@33109
   611
    val eq = Goal.prove ctxt' [] [] (Logic.mk_equals ((Thm.prop_of elimrule), elimrule')) tac
bulwahn@32667
   612
  in
bulwahn@33109
   613
    Thm.equal_elim eq elimrule |> singleton (Variable.export ctxt' ctxt)
bulwahn@32667
   614
  end;
bulwahn@32667
   615
bulwahn@33124
   616
fun expand_tuples_elim th = th
bulwahn@33124
   617
bulwahn@35887
   618
val no_compilation = ([], ([], []))
bulwahn@33483
   619
bulwahn@37007
   620
fun fetch_pred_data ctxt name =
bulwahn@37007
   621
  case try (Inductive.the_inductive ctxt) name of
bulwahn@32667
   622
    SOME (info as (_, result)) => 
bulwahn@32667
   623
      let
bulwahn@32667
   624
        fun is_intro_of intro =
bulwahn@32667
   625
          let
bulwahn@32667
   626
            val (const, _) = strip_comb (HOLogic.dest_Trueprop (concl_of intro))
bulwahn@37007
   627
          in (fst (dest_Const const) = name) end;
bulwahn@37007
   628
        val thy = ProofContext.theory_of ctxt
bulwahn@33752
   629
        val intros =
bulwahn@33124
   630
          (map (expand_tuples thy #> preprocess_intro thy) (filter is_intro_of (#intrs result)))
bulwahn@33146
   631
        val index = find_index (fn s => s = name) (#names (fst info))
bulwahn@33146
   632
        val pre_elim = nth (#elims result) index
bulwahn@33146
   633
        val pred = nth (#preds result) index
bulwahn@35884
   634
        val nparams = length (Inductive.params_of (#raw_induct result))
bulwahn@35884
   635
        val elim_t = mk_casesrule ctxt pred intros
bulwahn@33124
   636
        val elim =
bulwahn@35884
   637
          prove_casesrule ctxt (pred, (pre_elim, nparams)) elim_t
bulwahn@32667
   638
      in
bulwahn@34948
   639
        mk_pred_data ((intros, SOME elim), no_compilation)
bulwahn@33483
   640
      end
bulwahn@32667
   641
  | NONE => error ("No such predicate: " ^ quote name)
bulwahn@33124
   642
bulwahn@34948
   643
fun add_predfun_data name mode data =
bulwahn@32667
   644
  let
bulwahn@35887
   645
    val add = (apsnd o apsnd o apfst) (cons (mode, mk_predfun_data data))
bulwahn@32667
   646
  in PredData.map (Graph.map_node name (map_pred_data add)) end
bulwahn@32667
   647
bulwahn@37003
   648
fun is_inductive_predicate ctxt name =
bulwahn@37003
   649
  is_some (try (Inductive.the_inductive ctxt) name)
bulwahn@32667
   650
bulwahn@37003
   651
fun depending_preds_of ctxt (key, value) =
bulwahn@32667
   652
  let
bulwahn@32667
   653
    val intros = (#intros o rep_pred_data) value
bulwahn@32667
   654
  in
bulwahn@32667
   655
    fold Term.add_const_names (map Thm.prop_of intros) []
bulwahn@33482
   656
      |> filter (fn c => (not (c = key)) andalso
bulwahn@37003
   657
        (is_inductive_predicate ctxt c orelse is_registered ctxt c))
bulwahn@32667
   658
  end;
bulwahn@32667
   659
bulwahn@33629
   660
fun add_intro thm thy =
bulwahn@33629
   661
  let
bulwahn@34948
   662
    val (name, T) = dest_Const (fst (strip_intro_concl thm))
bulwahn@33629
   663
    fun cons_intro gr =
bulwahn@32667
   664
     case try (Graph.get_node gr) name of
bulwahn@32667
   665
       SOME pred_data => Graph.map_node name (map_pred_data
bulwahn@34948
   666
         (apfst (fn (intros, elim) => (intros @ [thm], elim)))) gr
bulwahn@34948
   667
     | NONE => Graph.new_node (name, mk_pred_data (([thm], NONE), no_compilation)) gr
bulwahn@32667
   668
  in PredData.map cons_intro thy end
bulwahn@32667
   669
bulwahn@33629
   670
fun set_elim thm =
bulwahn@33629
   671
  let
bulwahn@32667
   672
    val (name, _) = dest_Const (fst 
bulwahn@32667
   673
      (strip_comb (HOLogic.dest_Trueprop (hd (prems_of thm)))))
bulwahn@34948
   674
    fun set (intros, _) = (intros, SOME thm)
bulwahn@32667
   675
  in PredData.map (Graph.map_node name (map_pred_data (apfst set))) end
bulwahn@32667
   676
bulwahn@34948
   677
fun register_predicate (constname, pre_intros, pre_elim) thy =
bulwahn@33629
   678
  let
bulwahn@33752
   679
    val intros = map (preprocess_intro thy) pre_intros
bulwahn@37003
   680
    val elim = preprocess_elim (ProofContext.init_global thy) pre_elim
bulwahn@32667
   681
  in
bulwahn@33146
   682
    if not (member (op =) (Graph.keys (PredData.get thy)) constname) then
bulwahn@32668
   683
      PredData.map
bulwahn@33482
   684
        (Graph.new_node (constname,
bulwahn@34948
   685
          mk_pred_data ((intros, SOME elim), no_compilation))) thy
bulwahn@32668
   686
    else thy
bulwahn@32667
   687
  end
bulwahn@32667
   688
bulwahn@33146
   689
fun register_intros (constname, pre_intros) thy =
bulwahn@32668
   690
  let
bulwahn@33146
   691
    val T = Sign.the_const_type thy constname
bulwahn@34948
   692
    fun constname_of_intro intr = fst (dest_Const (fst (strip_intro_concl intr)))
bulwahn@33146
   693
    val _ = if not (forall (fn intr => constname_of_intro intr = constname) pre_intros) then
bulwahn@33146
   694
      error ("register_intros: Introduction rules of different constants are used\n" ^
bulwahn@33146
   695
        "expected rules for " ^ constname ^ ", but received rules for " ^
bulwahn@33146
   696
          commas (map constname_of_intro pre_intros))
bulwahn@33146
   697
      else ()
bulwahn@33146
   698
    val pred = Const (constname, T)
bulwahn@32672
   699
    val pre_elim = 
wenzelm@35021
   700
      (Drule.export_without_context o Skip_Proof.make_thm thy)
wenzelm@36610
   701
      (mk_casesrule (ProofContext.init_global thy) pred pre_intros)
bulwahn@34948
   702
  in register_predicate (constname, pre_intros, pre_elim) thy end
bulwahn@32668
   703
bulwahn@34948
   704
fun defined_function_of compilation pred =
bulwahn@32667
   705
  let
bulwahn@35887
   706
    val set = (apsnd o apfst) (cons (compilation, []))
bulwahn@32667
   707
  in
bulwahn@32667
   708
    PredData.map (Graph.map_node pred (map_pred_data set))
bulwahn@32667
   709
  end
bulwahn@32667
   710
bulwahn@34948
   711
fun set_function_name compilation pred mode name =
bulwahn@32667
   712
  let
bulwahn@35887
   713
    val set = (apsnd o apfst)
bulwahn@34948
   714
      (AList.map_default (op =) (compilation, [(mode, name)]) (cons (mode, name)))
bulwahn@33473
   715
  in
bulwahn@33473
   716
    PredData.map (Graph.map_node pred (map_pred_data set))
bulwahn@33473
   717
  end
bulwahn@33473
   718
bulwahn@34948
   719
fun set_needs_random name modes =
bulwahn@33473
   720
  let
bulwahn@35887
   721
    val set = (apsnd o apsnd o apsnd) (K modes)
bulwahn@32667
   722
  in
bulwahn@34948
   723
    PredData.map (Graph.map_node name (map_pred_data set))
bulwahn@32667
   724
  end
bulwahn@32667
   725
bulwahn@36038
   726
(* registration of alternative function names *)
bulwahn@36038
   727
bulwahn@36038
   728
structure Alt_Compilations_Data = Theory_Data
bulwahn@36038
   729
(
bulwahn@36038
   730
  type T = (mode * (compilation_funs -> typ -> term)) list Symtab.table;
bulwahn@36038
   731
  val empty = Symtab.empty;
bulwahn@36038
   732
  val extend = I;
wenzelm@38759
   733
  fun merge data : T = Symtab.merge (K true) data;
bulwahn@36038
   734
);
bulwahn@36038
   735
bulwahn@37003
   736
fun alternative_compilation_of_global thy pred_name mode =
bulwahn@36038
   737
  AList.lookup eq_mode (Symtab.lookup_list (Alt_Compilations_Data.get thy) pred_name) mode
bulwahn@36038
   738
bulwahn@37003
   739
fun alternative_compilation_of ctxt pred_name mode =
bulwahn@37003
   740
  AList.lookup eq_mode
bulwahn@37003
   741
    (Symtab.lookup_list (Alt_Compilations_Data.get (ProofContext.theory_of ctxt)) pred_name) mode
bulwahn@37003
   742
bulwahn@36038
   743
fun force_modes_and_compilations pred_name compilations =
bulwahn@36038
   744
  let
bulwahn@36038
   745
    (* thm refl is a dummy thm *)
bulwahn@36038
   746
    val modes = map fst compilations
bulwahn@36038
   747
    val (needs_random, non_random_modes) = pairself (map fst)
bulwahn@36038
   748
      (List.partition (fn (m, (fun_name, random)) => random) compilations)
bulwahn@36038
   749
    val non_random_dummys = map (rpair "dummy") non_random_modes
bulwahn@36038
   750
    val all_dummys = map (rpair "dummy") modes
bulwahn@36038
   751
    val dummy_function_names = map (rpair all_dummys) Predicate_Compile_Aux.random_compilations
bulwahn@36038
   752
      @ map (rpair non_random_dummys) Predicate_Compile_Aux.non_random_compilations
bulwahn@36038
   753
    val alt_compilations = map (apsnd fst) compilations
bulwahn@36038
   754
  in
bulwahn@36038
   755
    PredData.map (Graph.new_node
bulwahn@36038
   756
      (pred_name, mk_pred_data (([], SOME @{thm refl}), (dummy_function_names, ([], needs_random)))))
bulwahn@36038
   757
    #> Alt_Compilations_Data.map (Symtab.insert (K false) (pred_name, alt_compilations))
bulwahn@36038
   758
  end
bulwahn@36038
   759
bulwahn@36038
   760
fun functional_compilation fun_name mode compfuns T =
bulwahn@36038
   761
  let
bulwahn@36038
   762
    val (inpTs, outpTs) = split_map_modeT (fn _ => fn T => (SOME T, NONE))
bulwahn@36038
   763
      mode (binder_types T)
bulwahn@36038
   764
    val bs = map (pair "x") inpTs
bulwahn@36038
   765
    val bounds = map Bound (rev (0 upto (length bs) - 1))
bulwahn@36038
   766
    val f = Const (fun_name, inpTs ---> HOLogic.mk_tupleT outpTs)
bulwahn@36038
   767
  in list_abs (bs, mk_single compfuns (list_comb (f, bounds))) end
bulwahn@36038
   768
bulwahn@36038
   769
fun register_alternative_function pred_name mode fun_name =
bulwahn@36038
   770
  Alt_Compilations_Data.map (Symtab.insert_list (eq_pair eq_mode (K false))
bulwahn@36038
   771
    (pred_name, (mode, functional_compilation fun_name mode)))
bulwahn@36038
   772
bulwahn@36038
   773
fun force_modes_and_functions pred_name fun_names =
bulwahn@36038
   774
  force_modes_and_compilations pred_name
bulwahn@36038
   775
    (map (fn (mode, (fun_name, random)) => (mode, (functional_compilation fun_name mode, random)))
bulwahn@36038
   776
    fun_names)
bulwahn@36038
   777
bulwahn@36019
   778
(* compilation modifiers *)
bulwahn@36019
   779
bulwahn@36019
   780
structure Comp_Mod =
bulwahn@36019
   781
struct
bulwahn@36019
   782
bulwahn@36019
   783
datatype comp_modifiers = Comp_Modifiers of
bulwahn@36019
   784
{
bulwahn@36019
   785
  compilation : compilation,
bulwahn@36019
   786
  function_name_prefix : string,
bulwahn@36019
   787
  compfuns : compilation_funs,
bulwahn@36019
   788
  mk_random : typ -> term list -> term,
bulwahn@36019
   789
  modify_funT : typ -> typ,
bulwahn@36019
   790
  additional_arguments : string list -> term list,
bulwahn@36019
   791
  wrap_compilation : compilation_funs -> string -> typ -> mode -> term list -> term -> term,
bulwahn@36019
   792
  transform_additional_arguments : indprem -> term list -> term list
bulwahn@36019
   793
}
bulwahn@36019
   794
bulwahn@36019
   795
fun dest_comp_modifiers (Comp_Modifiers c) = c
bulwahn@36019
   796
bulwahn@36019
   797
val compilation = #compilation o dest_comp_modifiers
bulwahn@36019
   798
val function_name_prefix = #function_name_prefix o dest_comp_modifiers
bulwahn@36019
   799
val compfuns = #compfuns o dest_comp_modifiers
bulwahn@36019
   800
bulwahn@36019
   801
val mk_random = #mk_random o dest_comp_modifiers
bulwahn@36019
   802
val funT_of' = funT_of o compfuns
bulwahn@36019
   803
val modify_funT = #modify_funT o dest_comp_modifiers
bulwahn@36019
   804
fun funT_of comp mode = modify_funT comp o funT_of' comp mode
bulwahn@36019
   805
bulwahn@36019
   806
val additional_arguments = #additional_arguments o dest_comp_modifiers
bulwahn@36019
   807
val wrap_compilation = #wrap_compilation o dest_comp_modifiers
bulwahn@36019
   808
val transform_additional_arguments = #transform_additional_arguments o dest_comp_modifiers
bulwahn@36019
   809
bulwahn@36019
   810
end;
bulwahn@36019
   811
bulwahn@36019
   812
val depth_limited_comp_modifiers = Comp_Mod.Comp_Modifiers
bulwahn@36019
   813
  {
bulwahn@36019
   814
  compilation = Depth_Limited,
bulwahn@36019
   815
  function_name_prefix = "depth_limited_",
bulwahn@36019
   816
  compfuns = PredicateCompFuns.compfuns,
bulwahn@36019
   817
  mk_random = (fn _ => error "no random generation"),
bulwahn@36019
   818
  additional_arguments = fn names =>
bulwahn@36019
   819
    let
bulwahn@36019
   820
      val depth_name = Name.variant names "depth"
bulwahn@36019
   821
    in [Free (depth_name, @{typ code_numeral})] end,
bulwahn@36019
   822
  modify_funT = (fn T => let val (Ts, U) = strip_type T
bulwahn@36019
   823
  val Ts' = [@{typ code_numeral}] in (Ts @ Ts') ---> U end),
bulwahn@36019
   824
  wrap_compilation =
bulwahn@36019
   825
    fn compfuns => fn s => fn T => fn mode => fn additional_arguments => fn compilation =>
bulwahn@36019
   826
    let
bulwahn@36019
   827
      val [depth] = additional_arguments
bulwahn@36019
   828
      val (_, Ts) = split_modeT' mode (binder_types T)
bulwahn@36019
   829
      val T' = mk_predT compfuns (HOLogic.mk_tupleT Ts)
bulwahn@36019
   830
      val if_const = Const (@{const_name "If"}, @{typ bool} --> T' --> T' --> T')
bulwahn@36019
   831
    in
bulwahn@36019
   832
      if_const $ HOLogic.mk_eq (depth, @{term "0 :: code_numeral"})
bulwahn@36019
   833
        $ mk_bot compfuns (dest_predT compfuns T')
bulwahn@36019
   834
        $ compilation
bulwahn@36019
   835
    end,
bulwahn@36019
   836
  transform_additional_arguments =
bulwahn@36019
   837
    fn prem => fn additional_arguments =>
bulwahn@36019
   838
    let
bulwahn@36019
   839
      val [depth] = additional_arguments
bulwahn@36019
   840
      val depth' =
bulwahn@36019
   841
        Const (@{const_name Groups.minus}, @{typ "code_numeral => code_numeral => code_numeral"})
bulwahn@36019
   842
          $ depth $ Const (@{const_name Groups.one}, @{typ "Code_Numeral.code_numeral"})
bulwahn@36019
   843
    in [depth'] end
bulwahn@36019
   844
  }
bulwahn@36019
   845
bulwahn@36019
   846
val random_comp_modifiers = Comp_Mod.Comp_Modifiers
bulwahn@36019
   847
  {
bulwahn@36019
   848
  compilation = Random,
bulwahn@36019
   849
  function_name_prefix = "random_",
bulwahn@36019
   850
  compfuns = PredicateCompFuns.compfuns,
bulwahn@36019
   851
  mk_random = (fn T => fn additional_arguments =>
bulwahn@36019
   852
  list_comb (Const(@{const_name Quickcheck.iter},
bulwahn@36019
   853
  [@{typ code_numeral}, @{typ code_numeral}, @{typ Random.seed}] ---> 
bulwahn@36019
   854
    PredicateCompFuns.mk_predT T), additional_arguments)),
bulwahn@36019
   855
  modify_funT = (fn T =>
bulwahn@36019
   856
    let
bulwahn@36019
   857
      val (Ts, U) = strip_type T
bulwahn@36019
   858
      val Ts' = [@{typ code_numeral}, @{typ code_numeral}, @{typ "code_numeral * code_numeral"}]
bulwahn@36019
   859
    in (Ts @ Ts') ---> U end),
bulwahn@36019
   860
  additional_arguments = (fn names =>
bulwahn@36019
   861
    let
bulwahn@36019
   862
      val [nrandom, size, seed] = Name.variant_list names ["nrandom", "size", "seed"]
bulwahn@36019
   863
    in
bulwahn@36019
   864
      [Free (nrandom, @{typ code_numeral}), Free (size, @{typ code_numeral}),
bulwahn@36019
   865
        Free (seed, @{typ "code_numeral * code_numeral"})]
bulwahn@36019
   866
    end),
bulwahn@36019
   867
  wrap_compilation = K (K (K (K (K I))))
bulwahn@36019
   868
    : (compilation_funs -> string -> typ -> mode -> term list -> term -> term),
bulwahn@36019
   869
  transform_additional_arguments = K I : (indprem -> term list -> term list)
bulwahn@36019
   870
  }
bulwahn@36019
   871
bulwahn@36019
   872
val depth_limited_random_comp_modifiers = Comp_Mod.Comp_Modifiers
bulwahn@36019
   873
  {
bulwahn@36019
   874
  compilation = Depth_Limited_Random,
bulwahn@36019
   875
  function_name_prefix = "depth_limited_random_",
bulwahn@36019
   876
  compfuns = PredicateCompFuns.compfuns,
bulwahn@36019
   877
  mk_random = (fn T => fn additional_arguments =>
bulwahn@36019
   878
  list_comb (Const(@{const_name Quickcheck.iter},
bulwahn@36019
   879
  [@{typ code_numeral}, @{typ code_numeral}, @{typ Random.seed}] ---> 
bulwahn@36019
   880
    PredicateCompFuns.mk_predT T), tl additional_arguments)),
bulwahn@36019
   881
  modify_funT = (fn T =>
bulwahn@36019
   882
    let
bulwahn@36019
   883
      val (Ts, U) = strip_type T
bulwahn@36019
   884
      val Ts' = [@{typ code_numeral}, @{typ code_numeral}, @{typ code_numeral},
bulwahn@36019
   885
        @{typ "code_numeral * code_numeral"}]
bulwahn@36019
   886
    in (Ts @ Ts') ---> U end),
bulwahn@36019
   887
  additional_arguments = (fn names =>
bulwahn@36019
   888
    let
bulwahn@36019
   889
      val [depth, nrandom, size, seed] = Name.variant_list names ["depth", "nrandom", "size", "seed"]
bulwahn@36019
   890
    in
bulwahn@36019
   891
      [Free (depth, @{typ code_numeral}), Free (nrandom, @{typ code_numeral}),
bulwahn@36019
   892
        Free (size, @{typ code_numeral}), Free (seed, @{typ "code_numeral * code_numeral"})]
bulwahn@36019
   893
    end),
bulwahn@36019
   894
  wrap_compilation =
bulwahn@36019
   895
  fn compfuns => fn s => fn T => fn mode => fn additional_arguments => fn compilation =>
bulwahn@36019
   896
    let
bulwahn@36019
   897
      val depth = hd (additional_arguments)
bulwahn@36019
   898
      val (_, Ts) = split_map_modeT (fn m => fn T => (SOME (funT_of compfuns m T), NONE))
bulwahn@36019
   899
        mode (binder_types T)
bulwahn@36019
   900
      val T' = mk_predT compfuns (HOLogic.mk_tupleT Ts)
bulwahn@36019
   901
      val if_const = Const (@{const_name "If"}, @{typ bool} --> T' --> T' --> T')
bulwahn@36019
   902
    in
bulwahn@36019
   903
      if_const $ HOLogic.mk_eq (depth, @{term "0 :: code_numeral"})
bulwahn@36019
   904
        $ mk_bot compfuns (dest_predT compfuns T')
bulwahn@36019
   905
        $ compilation
bulwahn@36019
   906
    end,
bulwahn@36019
   907
  transform_additional_arguments =
bulwahn@36019
   908
    fn prem => fn additional_arguments =>
bulwahn@36019
   909
    let
bulwahn@36019
   910
      val [depth, nrandom, size, seed] = additional_arguments
bulwahn@36019
   911
      val depth' =
bulwahn@36019
   912
        Const (@{const_name Groups.minus}, @{typ "code_numeral => code_numeral => code_numeral"})
bulwahn@36019
   913
          $ depth $ Const (@{const_name Groups.one}, @{typ "Code_Numeral.code_numeral"})
bulwahn@36019
   914
    in [depth', nrandom, size, seed] end
bulwahn@36019
   915
}
bulwahn@36019
   916
bulwahn@36019
   917
val predicate_comp_modifiers = Comp_Mod.Comp_Modifiers
bulwahn@36019
   918
  {
bulwahn@36019
   919
  compilation = Pred,
bulwahn@36019
   920
  function_name_prefix = "",
bulwahn@36019
   921
  compfuns = PredicateCompFuns.compfuns,
bulwahn@36019
   922
  mk_random = (fn _ => error "no random generation"),
bulwahn@36019
   923
  modify_funT = I,
bulwahn@36019
   924
  additional_arguments = K [],
bulwahn@36019
   925
  wrap_compilation = K (K (K (K (K I))))
bulwahn@36019
   926
   : (compilation_funs -> string -> typ -> mode -> term list -> term -> term),
bulwahn@36019
   927
  transform_additional_arguments = K I : (indprem -> term list -> term list)
bulwahn@36019
   928
  }
bulwahn@36019
   929
bulwahn@36019
   930
val annotated_comp_modifiers = Comp_Mod.Comp_Modifiers
bulwahn@36019
   931
  {
bulwahn@36019
   932
  compilation = Annotated,
bulwahn@36019
   933
  function_name_prefix = "annotated_",
bulwahn@36019
   934
  compfuns = PredicateCompFuns.compfuns,
bulwahn@36019
   935
  mk_random = (fn _ => error "no random generation"),
bulwahn@36019
   936
  modify_funT = I,
bulwahn@36019
   937
  additional_arguments = K [],
bulwahn@36019
   938
  wrap_compilation =
bulwahn@36019
   939
    fn compfuns => fn s => fn T => fn mode => fn additional_arguments => fn compilation =>
bulwahn@36019
   940
      mk_tracing ("calling predicate " ^ s ^
bulwahn@36019
   941
        " with mode " ^ string_of_mode mode) compilation,
bulwahn@36019
   942
  transform_additional_arguments = K I : (indprem -> term list -> term list)
bulwahn@36019
   943
  }
bulwahn@36019
   944
bulwahn@36019
   945
val dseq_comp_modifiers = Comp_Mod.Comp_Modifiers
bulwahn@36019
   946
  {
bulwahn@36019
   947
  compilation = DSeq,
bulwahn@36019
   948
  function_name_prefix = "dseq_",
bulwahn@36019
   949
  compfuns = DSequence_CompFuns.compfuns,
bulwahn@36019
   950
  mk_random = (fn _ => error "no random generation"),
bulwahn@36019
   951
  modify_funT = I,
bulwahn@36019
   952
  additional_arguments = K [],
bulwahn@36019
   953
  wrap_compilation = K (K (K (K (K I))))
bulwahn@36019
   954
   : (compilation_funs -> string -> typ -> mode -> term list -> term -> term),
bulwahn@36019
   955
  transform_additional_arguments = K I : (indprem -> term list -> term list)
bulwahn@36019
   956
  }
bulwahn@36019
   957
bulwahn@36019
   958
val pos_random_dseq_comp_modifiers = Comp_Mod.Comp_Modifiers
bulwahn@36019
   959
  {
bulwahn@36019
   960
  compilation = Pos_Random_DSeq,
bulwahn@36019
   961
  function_name_prefix = "random_dseq_",
bulwahn@36019
   962
  compfuns = Random_Sequence_CompFuns.compfuns,
bulwahn@36019
   963
  mk_random = (fn T => fn additional_arguments =>
bulwahn@36019
   964
  let
bulwahn@36019
   965
    val random = Const ("Quickcheck.random_class.random",
bulwahn@36019
   966
      @{typ code_numeral} --> @{typ Random.seed} -->
bulwahn@36019
   967
        HOLogic.mk_prodT (HOLogic.mk_prodT (T, @{typ "unit => term"}), @{typ Random.seed}))
bulwahn@36019
   968
  in
bulwahn@36019
   969
    Const ("Random_Sequence.Random", (@{typ code_numeral} --> @{typ Random.seed} -->
bulwahn@36019
   970
      HOLogic.mk_prodT (HOLogic.mk_prodT (T, @{typ "unit => term"}), @{typ Random.seed})) -->
bulwahn@36019
   971
      Random_Sequence_CompFuns.mk_random_dseqT T) $ random
bulwahn@36019
   972
  end),
bulwahn@36019
   973
bulwahn@36019
   974
  modify_funT = I,
bulwahn@36019
   975
  additional_arguments = K [],
bulwahn@36019
   976
  wrap_compilation = K (K (K (K (K I))))
bulwahn@36019
   977
   : (compilation_funs -> string -> typ -> mode -> term list -> term -> term),
bulwahn@36019
   978
  transform_additional_arguments = K I : (indprem -> term list -> term list)
bulwahn@36019
   979
  }
bulwahn@36019
   980
bulwahn@36019
   981
val neg_random_dseq_comp_modifiers = Comp_Mod.Comp_Modifiers
bulwahn@36019
   982
  {
bulwahn@36019
   983
  compilation = Neg_Random_DSeq,
bulwahn@36019
   984
  function_name_prefix = "random_dseq_neg_",
bulwahn@36019
   985
  compfuns = Random_Sequence_CompFuns.compfuns,
bulwahn@36019
   986
  mk_random = (fn _ => error "no random generation"),
bulwahn@36019
   987
  modify_funT = I,
bulwahn@36019
   988
  additional_arguments = K [],
bulwahn@36019
   989
  wrap_compilation = K (K (K (K (K I))))
bulwahn@36019
   990
   : (compilation_funs -> string -> typ -> mode -> term list -> term -> term),
bulwahn@36019
   991
  transform_additional_arguments = K I : (indprem -> term list -> term list)
bulwahn@36019
   992
  }
bulwahn@36019
   993
bulwahn@36019
   994
bulwahn@36019
   995
val new_pos_random_dseq_comp_modifiers = Comp_Mod.Comp_Modifiers
bulwahn@36019
   996
  {
bulwahn@36019
   997
  compilation = New_Pos_Random_DSeq,
bulwahn@36019
   998
  function_name_prefix = "new_random_dseq_",
bulwahn@36019
   999
  compfuns = New_Pos_Random_Sequence_CompFuns.compfuns,
bulwahn@36019
  1000
  mk_random = (fn T => fn additional_arguments =>
bulwahn@36019
  1001
  let
bulwahn@36019
  1002
    val random = Const ("Quickcheck.random_class.random",
bulwahn@36019
  1003
      @{typ code_numeral} --> @{typ Random.seed} -->
bulwahn@36019
  1004
        HOLogic.mk_prodT (HOLogic.mk_prodT (T, @{typ "unit => term"}), @{typ Random.seed}))
bulwahn@36019
  1005
  in
bulwahn@36019
  1006
    Const ("New_Random_Sequence.Random", (@{typ code_numeral} --> @{typ Random.seed} -->
bulwahn@36019
  1007
      HOLogic.mk_prodT (HOLogic.mk_prodT (T, @{typ "unit => term"}), @{typ Random.seed})) -->
bulwahn@36019
  1008
      New_Pos_Random_Sequence_CompFuns.mk_pos_random_dseqT T) $ random
bulwahn@36019
  1009
  end),
bulwahn@36019
  1010
  modify_funT = I,
bulwahn@36019
  1011
  additional_arguments = K [],
bulwahn@36019
  1012
  wrap_compilation = K (K (K (K (K I))))
bulwahn@36019
  1013
   : (compilation_funs -> string -> typ -> mode -> term list -> term -> term),
bulwahn@36019
  1014
  transform_additional_arguments = K I : (indprem -> term list -> term list)
bulwahn@36019
  1015
  }
bulwahn@36019
  1016
bulwahn@36019
  1017
val new_neg_random_dseq_comp_modifiers = Comp_Mod.Comp_Modifiers
bulwahn@36019
  1018
  {
bulwahn@36019
  1019
  compilation = New_Neg_Random_DSeq,
bulwahn@36019
  1020
  function_name_prefix = "new_random_dseq_neg_",
bulwahn@36019
  1021
  compfuns = New_Neg_Random_Sequence_CompFuns.compfuns,
bulwahn@36019
  1022
  mk_random = (fn _ => error "no random generation"),
bulwahn@36019
  1023
  modify_funT = I,
bulwahn@36019
  1024
  additional_arguments = K [],
bulwahn@36019
  1025
  wrap_compilation = K (K (K (K (K I))))
bulwahn@36019
  1026
   : (compilation_funs -> string -> typ -> mode -> term list -> term -> term),
bulwahn@36019
  1027
  transform_additional_arguments = K I : (indprem -> term list -> term list)
bulwahn@36019
  1028
  }
bulwahn@36019
  1029
bulwahn@36019
  1030
fun negative_comp_modifiers_of comp_modifiers =
bulwahn@36019
  1031
    (case Comp_Mod.compilation comp_modifiers of
bulwahn@36019
  1032
      Pos_Random_DSeq => neg_random_dseq_comp_modifiers
bulwahn@36019
  1033
    | Neg_Random_DSeq => pos_random_dseq_comp_modifiers
bulwahn@36019
  1034
    | New_Pos_Random_DSeq => new_neg_random_dseq_comp_modifiers
bulwahn@36019
  1035
    | New_Neg_Random_DSeq => new_pos_random_dseq_comp_modifiers
bulwahn@36019
  1036
    | c => comp_modifiers)
bulwahn@36019
  1037
bulwahn@34948
  1038
(** mode analysis **)
bulwahn@32672
  1039
bulwahn@35411
  1040
type mode_analysis_options = {use_random : bool, reorder_premises : bool, infer_pos_and_neg_modes : bool}
bulwahn@35324
  1041
bulwahn@32667
  1042
fun is_constrt thy =
bulwahn@32667
  1043
  let
bulwahn@32667
  1044
    val cnstrs = flat (maps
bulwahn@32667
  1045
      (map (fn (_, (Tname, _, cs)) => map (apsnd (rpair Tname o length)) cs) o #descr o snd)
bulwahn@32667
  1046
      (Symtab.dest (Datatype.get_all thy)));
bulwahn@32667
  1047
    fun check t = (case strip_comb t of
bulwahn@32667
  1048
        (Free _, []) => true
bulwahn@32667
  1049
      | (Const (s, T), ts) => (case (AList.lookup (op =) cnstrs s, body_type T) of
bulwahn@33482
  1050
            (SOME (i, Tname), Type (Tname', _)) =>
bulwahn@33482
  1051
              length ts = i andalso Tname = Tname' andalso forall check ts
bulwahn@32667
  1052
          | _ => false)
bulwahn@32667
  1053
      | _ => false)
bulwahn@32667
  1054
  in check end;
bulwahn@32667
  1055
bulwahn@32667
  1056
(*** check if a type is an equality type (i.e. doesn't contain fun)
bulwahn@32667
  1057
  FIXME this is only an approximation ***)
bulwahn@32667
  1058
fun is_eqT (Type (s, Ts)) = s <> "fun" andalso forall is_eqT Ts
bulwahn@32667
  1059
  | is_eqT _ = true;
bulwahn@32667
  1060
bulwahn@32667
  1061
fun term_vs tm = fold_aterms (fn Free (x, T) => cons x | _ => I) tm [];
bulwahn@32667
  1062
val terms_vs = distinct (op =) o maps term_vs;
bulwahn@32667
  1063
bulwahn@32667
  1064
(** collect all Frees in a term (with duplicates!) **)
bulwahn@32667
  1065
fun term_vTs tm =
bulwahn@32667
  1066
  fold_aterms (fn Free xT => cons xT | _ => I) tm [];
bulwahn@32667
  1067
bulwahn@33138
  1068
fun subsets i j =
bulwahn@33138
  1069
  if i <= j then
bulwahn@33138
  1070
    let
bulwahn@33138
  1071
      fun merge xs [] = xs
bulwahn@33138
  1072
        | merge [] ys = ys
bulwahn@33138
  1073
        | merge (x::xs) (y::ys) = if length x >= length y then x::merge xs (y::ys)
bulwahn@33138
  1074
            else y::merge (x::xs) ys;
bulwahn@33138
  1075
      val is = subsets (i+1) j
bulwahn@33138
  1076
    in merge (map (fn ks => i::ks) is) is end
bulwahn@33138
  1077
  else [[]];
bulwahn@32667
  1078
bulwahn@35324
  1079
fun print_failed_mode options thy modes p (pol, m) rs is =
bulwahn@33130
  1080
  if show_mode_inference options then
bulwahn@33130
  1081
    let
bulwahn@33752
  1082
      val _ = tracing ("Clauses " ^ commas (map (fn i => string_of_int (i + 1)) is) ^ " of " ^
bulwahn@34948
  1083
        p ^ " violates mode " ^ string_of_mode m)
bulwahn@33130
  1084
    in () end
bulwahn@33130
  1085
  else ()
bulwahn@33130
  1086
bulwahn@35324
  1087
fun error_of p (pol, m) is =
bulwahn@35885
  1088
  "  Clauses " ^ commas (map (fn i => string_of_int (i + 1)) is) ^ " of " ^
bulwahn@35885
  1089
        p ^ " violates mode " ^ string_of_mode m
bulwahn@34948
  1090
bulwahn@34948
  1091
fun is_all_input mode =
bulwahn@34948
  1092
  let
bulwahn@34948
  1093
    fun is_all_input' (Fun _) = true
bulwahn@34948
  1094
      | is_all_input' (Pair (m1, m2)) = is_all_input' m1 andalso is_all_input' m2
bulwahn@34948
  1095
      | is_all_input' Input = true
bulwahn@34948
  1096
      | is_all_input' Output = false
bulwahn@34948
  1097
  in
bulwahn@34948
  1098
    forall is_all_input' (strip_fun_mode mode)
bulwahn@34948
  1099
  end
bulwahn@34948
  1100
bulwahn@34948
  1101
fun all_input_of T =
bulwahn@34948
  1102
  let
bulwahn@34948
  1103
    val (Ts, U) = strip_type T
haftmann@37678
  1104
    fun input_of (Type (@{type_name Product_Type.prod}, [T1, T2])) = Pair (input_of T1, input_of T2)
bulwahn@34948
  1105
      | input_of _ = Input
bulwahn@34948
  1106
  in
bulwahn@34948
  1107
    if U = HOLogic.boolT then
bulwahn@34948
  1108
      fold_rev (curry Fun) (map input_of Ts) Bool
bulwahn@34948
  1109
    else
bulwahn@35885
  1110
      raise Fail "all_input_of: not a predicate"
bulwahn@34948
  1111
  end
bulwahn@34948
  1112
bulwahn@34948
  1113
fun partial_hd [] = NONE
bulwahn@34948
  1114
  | partial_hd (x :: xs) = SOME x
bulwahn@34948
  1115
bulwahn@34948
  1116
fun term_vs tm = fold_aterms (fn Free (x, T) => cons x | _ => I) tm [];
bulwahn@34948
  1117
val terms_vs = distinct (op =) o maps term_vs;
bulwahn@34948
  1118
bulwahn@34948
  1119
fun input_mode T =
bulwahn@34948
  1120
  let
bulwahn@34948
  1121
    val (Ts, U) = strip_type T
bulwahn@34948
  1122
  in
bulwahn@34948
  1123
    fold_rev (curry Fun) (map (K Input) Ts) Input
bulwahn@34948
  1124
  end
bulwahn@34948
  1125
bulwahn@34948
  1126
fun output_mode T =
bulwahn@34948
  1127
  let
bulwahn@34948
  1128
    val (Ts, U) = strip_type T
bulwahn@34948
  1129
  in
bulwahn@34948
  1130
    fold_rev (curry Fun) (map (K Output) Ts) Output
bulwahn@34948
  1131
  end
bulwahn@34948
  1132
bulwahn@35891
  1133
fun is_invertible_function ctxt (Const (f, _)) = is_constr ctxt f
bulwahn@35891
  1134
  | is_invertible_function ctxt _ = false
bulwahn@34948
  1135
bulwahn@35891
  1136
fun non_invertible_subterms ctxt (t as Free _) = []
bulwahn@35891
  1137
  | non_invertible_subterms ctxt t = 
bulwahn@35891
  1138
  let
bulwahn@35891
  1139
    val (f, args) = strip_comb t
bulwahn@35891
  1140
  in
bulwahn@35891
  1141
    if is_invertible_function ctxt f then
bulwahn@35891
  1142
      maps (non_invertible_subterms ctxt) args
bulwahn@34948
  1143
    else
bulwahn@34948
  1144
      [t]
bulwahn@35891
  1145
  end
bulwahn@33752
  1146
bulwahn@35891
  1147
fun collect_non_invertible_subterms ctxt (f as Free _) (names, eqs) = (f, (names, eqs))
bulwahn@35891
  1148
  | collect_non_invertible_subterms ctxt t (names, eqs) =
bulwahn@34948
  1149
    case (strip_comb t) of (f, args) =>
bulwahn@35891
  1150
      if is_invertible_function ctxt f then
bulwahn@34948
  1151
          let
bulwahn@34948
  1152
            val (args', (names', eqs')) =
bulwahn@35891
  1153
              fold_map (collect_non_invertible_subterms ctxt) args (names, eqs)
bulwahn@34948
  1154
          in
bulwahn@34948
  1155
            (list_comb (f, args'), (names', eqs'))
bulwahn@34948
  1156
          end
bulwahn@34948
  1157
        else
bulwahn@34948
  1158
          let
bulwahn@34948
  1159
            val s = Name.variant names "x"
bulwahn@34948
  1160
            val v = Free (s, fastype_of t)
bulwahn@34948
  1161
          in
bulwahn@34948
  1162
            (v, (s :: names, HOLogic.mk_eq (v, t) :: eqs))
bulwahn@34948
  1163
          end
bulwahn@34948
  1164
(*
bulwahn@34948
  1165
  if is_constrt thy t then (t, (names, eqs)) else
bulwahn@34948
  1166
    let
bulwahn@34948
  1167
      val s = Name.variant names "x"
bulwahn@34948
  1168
      val v = Free (s, fastype_of t)
bulwahn@34948
  1169
    in (v, (s::names, HOLogic.mk_eq (v, t)::eqs)) end;
bulwahn@34948
  1170
*)
bulwahn@34948
  1171
bulwahn@37003
  1172
fun is_possible_output ctxt vs t =
bulwahn@34948
  1173
  forall
bulwahn@34948
  1174
    (fn t => is_eqT (fastype_of t) andalso forall (member (op =) vs) (term_vs t))
bulwahn@37003
  1175
      (non_invertible_subterms ctxt t)
bulwahn@35324
  1176
  andalso
bulwahn@35324
  1177
    (forall (is_eqT o snd)
bulwahn@35324
  1178
      (inter (fn ((f', _), f) => f = f') vs (Term.add_frees t [])))
bulwahn@33752
  1179
bulwahn@35891
  1180
fun vars_of_destructable_term ctxt (Free (x, _)) = [x]
bulwahn@35891
  1181
  | vars_of_destructable_term ctxt t =
bulwahn@35891
  1182
  let
bulwahn@35891
  1183
    val (f, args) = strip_comb t
bulwahn@35891
  1184
  in
bulwahn@35891
  1185
    if is_invertible_function ctxt f then
bulwahn@35891
  1186
      maps (vars_of_destructable_term ctxt) args
bulwahn@34948
  1187
    else
bulwahn@34948
  1188
      []
bulwahn@35891
  1189
  end
bulwahn@34948
  1190
bulwahn@37003
  1191
fun is_constructable vs t = forall (member (op =) vs) (term_vs t)
bulwahn@34948
  1192
bulwahn@34948
  1193
fun missing_vars vs t = subtract (op =) vs (term_vs t)
bulwahn@34948
  1194
haftmann@37391
  1195
fun output_terms (Const (@{const_name Pair}, _) $ t1 $ t2, Mode_Pair (d1, d2)) =
bulwahn@35324
  1196
    output_terms (t1, d1)  @ output_terms (t2, d2)
bulwahn@35324
  1197
  | output_terms (t1 $ t2, Mode_App (d1, d2)) =
bulwahn@35324
  1198
    output_terms (t1, d1)  @ output_terms (t2, d2)
bulwahn@35324
  1199
  | output_terms (t, Term Output) = [t]
bulwahn@35324
  1200
  | output_terms _ = []
bulwahn@35324
  1201
bulwahn@35324
  1202
fun lookup_mode modes (Const (s, T)) =
bulwahn@35324
  1203
   (case (AList.lookup (op =) modes s) of
bulwahn@35324
  1204
      SOME ms => SOME (map (fn m => (Context m, [])) ms)
bulwahn@35324
  1205
    | NONE => NONE)
bulwahn@35324
  1206
  | lookup_mode modes (Free (x, _)) =
bulwahn@35324
  1207
    (case (AList.lookup (op =) modes x) of
bulwahn@35324
  1208
      SOME ms => SOME (map (fn m => (Context m , [])) ms)
bulwahn@35324
  1209
    | NONE => NONE)
bulwahn@35324
  1210
haftmann@37391
  1211
fun derivations_of (ctxt : Proof.context) modes vs (Const (@{const_name Pair}, _) $ t1 $ t2) (Pair (m1, m2)) =
bulwahn@34948
  1212
    map_product
bulwahn@34948
  1213
      (fn (m1, mvars1) => fn (m2, mvars2) => (Mode_Pair (m1, m2), union (op =) mvars1 mvars2))
bulwahn@37003
  1214
        (derivations_of ctxt modes vs t1 m1) (derivations_of ctxt modes vs t2 m2)
bulwahn@37003
  1215
  | derivations_of ctxt modes vs t (m as Fun _) =
bulwahn@35324
  1216
    (*let
bulwahn@35324
  1217
      val (p, args) = strip_comb t
bulwahn@35324
  1218
    in
bulwahn@35324
  1219
      (case lookup_mode modes p of
bulwahn@35324
  1220
        SOME ms => map_filter (fn (Context m, []) => let
bulwahn@35324
  1221
          val ms = strip_fun_mode m
bulwahn@35324
  1222
          val (argms, restms) = chop (length args) ms
bulwahn@35324
  1223
          val m' = fold_rev (curry Fun) restms Bool
bulwahn@35324
  1224
        in
bulwahn@35324
  1225
          if forall (fn m => eq_mode (Input, m)) argms andalso eq_mode (m', mode) then
bulwahn@35324
  1226
            SOME (fold (curry Mode_App) (map Term argms) (Context m), missing_vars vs t)
bulwahn@35324
  1227
          else NONE
bulwahn@35324
  1228
        end) ms
bulwahn@35324
  1229
      | NONE => (if is_all_input mode then [(Context mode, [])] else []))
bulwahn@35324
  1230
    end*)
bulwahn@37003
  1231
    (case try (all_derivations_of ctxt modes vs) t  of
bulwahn@35324
  1232
      SOME derivs =>
bulwahn@35324
  1233
        filter (fn (d, mvars) => eq_mode (mode_of d, m) andalso null (output_terms (t, d))) derivs
bulwahn@35324
  1234
    | NONE => (if is_all_input m then [(Context m, [])] else []))
bulwahn@37003
  1235
  | derivations_of ctxt modes vs t m =
bulwahn@35324
  1236
    if eq_mode (m, Input) then
bulwahn@35324
  1237
      [(Term Input, missing_vars vs t)]
bulwahn@35324
  1238
    else if eq_mode (m, Output) then
bulwahn@37003
  1239
      (if is_possible_output ctxt vs t then [(Term Output, [])] else [])
bulwahn@35324
  1240
    else []
haftmann@37391
  1241
and all_derivations_of ctxt modes vs (Const (@{const_name Pair}, _) $ t1 $ t2) =
bulwahn@34948
  1242
  let
bulwahn@37003
  1243
    val derivs1 = all_derivations_of ctxt modes vs t1
bulwahn@37003
  1244
    val derivs2 = all_derivations_of ctxt modes vs t2
bulwahn@34948
  1245
  in
bulwahn@34948
  1246
    map_product
bulwahn@34948
  1247
      (fn (m1, mvars1) => fn (m2, mvars2) => (Mode_Pair (m1, m2), union (op =) mvars1 mvars2))
bulwahn@34948
  1248
        derivs1 derivs2
bulwahn@34948
  1249
  end
bulwahn@37003
  1250
  | all_derivations_of ctxt modes vs (t1 $ t2) =
bulwahn@33146
  1251
  let
bulwahn@37003
  1252
    val derivs1 = all_derivations_of ctxt modes vs t1
bulwahn@34948
  1253
  in
bulwahn@34948
  1254
    maps (fn (d1, mvars1) =>
bulwahn@34948
  1255
      case mode_of d1 of
bulwahn@34948
  1256
        Fun (m', _) => map (fn (d2, mvars2) =>
bulwahn@37003
  1257
          (Mode_App (d1, d2), union (op =) mvars1 mvars2)) (derivations_of ctxt modes vs t2 m')
bulwahn@35885
  1258
        | _ => raise Fail "Something went wrong") derivs1
bulwahn@34948
  1259
  end
bulwahn@37003
  1260
  | all_derivations_of _ modes vs (Const (s, T)) = the (lookup_mode modes (Const (s, T)))
bulwahn@37003
  1261
  | all_derivations_of _ modes vs (Free (x, T)) = the (lookup_mode modes (Free (x, T)))
bulwahn@35885
  1262
  | all_derivations_of _ modes vs _ = raise Fail "all_derivations_of"
bulwahn@34948
  1263
bulwahn@34948
  1264
fun rev_option_ord ord (NONE, NONE) = EQUAL
bulwahn@34948
  1265
  | rev_option_ord ord (NONE, SOME _) = GREATER
bulwahn@34948
  1266
  | rev_option_ord ord (SOME _, NONE) = LESS
bulwahn@34948
  1267
  | rev_option_ord ord (SOME x, SOME y) = ord (x, y)
bulwahn@34948
  1268
bulwahn@34948
  1269
fun random_mode_in_deriv modes t deriv =
bulwahn@34948
  1270
  case try dest_Const (fst (strip_comb t)) of
bulwahn@34948
  1271
    SOME (s, _) =>
bulwahn@34948
  1272
      (case AList.lookup (op =) modes s of
bulwahn@34948
  1273
        SOME ms =>
bulwahn@35324
  1274
          (case AList.lookup (op =) (map (fn ((p, m), r) => (m, r)) ms) (head_mode_of deriv) of
bulwahn@34948
  1275
            SOME r => r
bulwahn@34948
  1276
          | NONE => false)
bulwahn@34948
  1277
      | NONE => false)
bulwahn@34948
  1278
  | NONE => false
bulwahn@34948
  1279
bulwahn@34948
  1280
fun number_of_output_positions mode =
bulwahn@34948
  1281
  let
bulwahn@34948
  1282
    val args = strip_fun_mode mode
bulwahn@34948
  1283
    fun contains_output (Fun _) = false
bulwahn@34948
  1284
      | contains_output Input = false
bulwahn@34948
  1285
      | contains_output Output = true
bulwahn@34948
  1286
      | contains_output (Pair (m1, m2)) = contains_output m1 orelse contains_output m2
bulwahn@34948
  1287
  in
bulwahn@34948
  1288
    length (filter contains_output args)
bulwahn@34948
  1289
  end
bulwahn@34948
  1290
bulwahn@34948
  1291
fun lex_ord ord1 ord2 (x, x') =
bulwahn@34948
  1292
  case ord1 (x, x') of
bulwahn@34948
  1293
    EQUAL => ord2 (x, x')
bulwahn@34948
  1294
  | ord => ord
bulwahn@34948
  1295
bulwahn@36247
  1296
fun lexl_ord [] (x, x') = EQUAL
bulwahn@36247
  1297
  | lexl_ord (ord :: ords') (x, x') =
bulwahn@36247
  1298
    case ord (x, x') of
bulwahn@36247
  1299
      EQUAL => lexl_ord ords' (x, x')
bulwahn@36247
  1300
    | ord => ord
bulwahn@36247
  1301
bulwahn@37003
  1302
fun deriv_ord' ctxt pol pred modes t1 t2 ((deriv1, mvars1), (deriv2, mvars2)) =
bulwahn@34948
  1303
  let
bulwahn@36247
  1304
    (* prefer functional modes if it is a function *)
bulwahn@36247
  1305
    fun fun_ord ((t1, deriv1, mvars1), (t2, deriv2, mvars2)) =
bulwahn@36247
  1306
      let
bulwahn@36247
  1307
        fun is_functional t mode =
bulwahn@36247
  1308
          case try (fst o dest_Const o fst o strip_comb) t of
bulwahn@36247
  1309
            NONE => false
bulwahn@37003
  1310
          | SOME c => is_some (alternative_compilation_of ctxt c mode)
bulwahn@36247
  1311
      in
bulwahn@36247
  1312
        case (is_functional t1 (head_mode_of deriv1), is_functional t2 (head_mode_of deriv2)) of
bulwahn@36247
  1313
          (true, true) => EQUAL
bulwahn@36247
  1314
        | (true, false) => LESS
bulwahn@36247
  1315
        | (false, true) => GREATER
bulwahn@36247
  1316
        | (false, false) => EQUAL
bulwahn@36247
  1317
      end
bulwahn@36028
  1318
    (* prefer modes without requirement for generating random values *)
bulwahn@34948
  1319
    fun mvars_ord ((t1, deriv1, mvars1), (t2, deriv2, mvars2)) =
bulwahn@34948
  1320
      int_ord (length mvars1, length mvars2)
bulwahn@36028
  1321
    (* prefer non-random modes *)
bulwahn@34948
  1322
    fun random_mode_ord ((t1, deriv1, mvars1), (t2, deriv2, mvars2)) =
bulwahn@34948
  1323
      int_ord (if random_mode_in_deriv modes t1 deriv1 then 1 else 0,
bulwahn@34948
  1324
        if random_mode_in_deriv modes t1 deriv1 then 1 else 0)
bulwahn@36028
  1325
    (* prefer modes with more input and less output *)
bulwahn@34948
  1326
    fun output_mode_ord ((t1, deriv1, mvars1), (t2, deriv2, mvars2)) =
bulwahn@34948
  1327
      int_ord (number_of_output_positions (head_mode_of deriv1),
bulwahn@34948
  1328
        number_of_output_positions (head_mode_of deriv2))
bulwahn@36028
  1329
    (* prefer recursive calls *)
bulwahn@36028
  1330
    fun is_rec_premise t =
bulwahn@36028
  1331
      case fst (strip_comb t) of Const (c, T) => c = pred | _ => false
bulwahn@36028
  1332
    fun recursive_ord ((t1, deriv1, mvars1), (t2, deriv2, mvars2)) =
bulwahn@36028
  1333
      int_ord (if is_rec_premise t1 then 0 else 1,
bulwahn@36028
  1334
        if is_rec_premise t2 then 0 else 1)
bulwahn@36247
  1335
    val ord = lexl_ord [mvars_ord, fun_ord, random_mode_ord, output_mode_ord, recursive_ord]
bulwahn@34948
  1336
  in
bulwahn@36028
  1337
    ord ((t1, deriv1, mvars1), (t2, deriv2, mvars2))
bulwahn@34948
  1338
  end
bulwahn@34948
  1339
bulwahn@37003
  1340
fun deriv_ord ctxt pol pred modes t = deriv_ord' ctxt pol pred modes t t
bulwahn@34948
  1341
bulwahn@36247
  1342
fun premise_ord thy pol pred modes ((prem1, a1), (prem2, a2)) =
bulwahn@36258
  1343
  rev_option_ord (deriv_ord' thy pol pred modes (dest_indprem prem1) (dest_indprem prem2)) (a1, a2)
bulwahn@34948
  1344
bulwahn@34948
  1345
fun print_mode_list modes =
bulwahn@34948
  1346
  tracing ("modes: " ^ (commas (map (fn (s, ms) => s ^ ": " ^
bulwahn@34948
  1347
    commas (map (fn (m, r) => string_of_mode m ^ (if r then " random " else " not ")) ms)) modes)))
bulwahn@34948
  1348
bulwahn@37003
  1349
fun select_mode_prem (mode_analysis_options : mode_analysis_options) (ctxt : Proof.context) pred
bulwahn@36028
  1350
  pol (modes, (pos_modes, neg_modes)) vs ps =
bulwahn@34948
  1351
  let
bulwahn@35324
  1352
    fun choose_mode_of_prem (Prem t) = partial_hd
bulwahn@37003
  1353
        (sort (deriv_ord ctxt pol pred modes t) (all_derivations_of ctxt pos_modes vs t))
bulwahn@35324
  1354
      | choose_mode_of_prem (Sidecond t) = SOME (Context Bool, missing_vars vs t)
bulwahn@35324
  1355
      | choose_mode_of_prem (Negprem t) = partial_hd
bulwahn@37003
  1356
          (sort (deriv_ord ctxt (not pol) pred modes t)
bulwahn@36247
  1357
          (filter (fn (d, missing_vars) => is_all_input (head_mode_of d))
bulwahn@37003
  1358
             (all_derivations_of ctxt neg_modes vs t)))
bulwahn@37003
  1359
      | choose_mode_of_prem p = raise Fail ("choose_mode_of_prem: " ^ string_of_prem ctxt p)
bulwahn@34948
  1360
  in
bulwahn@35324
  1361
    if #reorder_premises mode_analysis_options then
bulwahn@37003
  1362
      partial_hd (sort (premise_ord ctxt pol pred modes) (ps ~~ map choose_mode_of_prem ps))
bulwahn@35324
  1363
    else
bulwahn@35324
  1364
      SOME (hd ps, choose_mode_of_prem (hd ps))
bulwahn@34948
  1365
  end
bulwahn@34948
  1366
bulwahn@37003
  1367
fun check_mode_clause' (mode_analysis_options : mode_analysis_options) ctxt pred param_vs (modes :
bulwahn@35324
  1368
  (string * ((bool * mode) * bool) list) list) ((pol, mode) : bool * mode) (ts, ps) =
bulwahn@34948
  1369
  let
bulwahn@36258
  1370
    val vTs = distinct (op =) (fold Term.add_frees (map dest_indprem ps) (fold Term.add_frees ts []))
bulwahn@35324
  1371
    val modes' = modes @ (param_vs ~~ map (fn x => [((true, x), false), ((false, x), false)]) (ho_arg_modes_of mode))
bulwahn@35324
  1372
    fun retrieve_modes_of_pol pol = map (fn (s, ms) =>
bulwahn@35324
  1373
      (s, map_filter (fn ((p, m), r) => if p = pol then SOME m else NONE | _ => NONE) ms))
bulwahn@35324
  1374
    val (pos_modes', neg_modes') =
bulwahn@35324
  1375
      if #infer_pos_and_neg_modes mode_analysis_options then
bulwahn@35324
  1376
        (retrieve_modes_of_pol pol modes', retrieve_modes_of_pol (not pol) modes')
bulwahn@35324
  1377
      else
bulwahn@35324
  1378
        let
bulwahn@35324
  1379
          val modes = map (fn (s, ms) => (s, map (fn ((p, m), r) => m) ms)) modes'
bulwahn@35324
  1380
        in (modes, modes) end
bulwahn@35324
  1381
    val (in_ts, out_ts) = split_mode mode ts
bulwahn@37003
  1382
    val in_vs = maps (vars_of_destructable_term ctxt) in_ts
bulwahn@34948
  1383
    val out_vs = terms_vs out_ts
bulwahn@35324
  1384
    fun known_vs_after p vs = (case p of
bulwahn@35324
  1385
        Prem t => union (op =) vs (term_vs t)
bulwahn@35324
  1386
      | Sidecond t => union (op =) vs (term_vs t)
bulwahn@35324
  1387
      | Negprem t => union (op =) vs (term_vs t)
bulwahn@35885
  1388
      | _ => raise Fail "I do not know")
bulwahn@34948
  1389
    fun check_mode_prems acc_ps rnd vs [] = SOME (acc_ps, vs, rnd)
bulwahn@34948
  1390
      | check_mode_prems acc_ps rnd vs ps =
bulwahn@35324
  1391
        (case
bulwahn@37003
  1392
          (select_mode_prem mode_analysis_options ctxt pred pol (modes', (pos_modes', neg_modes')) vs ps) of
bulwahn@35324
  1393
          SOME (p, SOME (deriv, [])) => check_mode_prems ((p, deriv) :: acc_ps) rnd
bulwahn@35324
  1394
            (known_vs_after p vs) (filter_out (equal p) ps)
bulwahn@34948
  1395
        | SOME (p, SOME (deriv, missing_vars)) =>
bulwahn@35324
  1396
          if #use_random mode_analysis_options andalso pol then
bulwahn@34948
  1397
            check_mode_prems ((p, deriv) :: (map
bulwahn@35324
  1398
              (fn v => (Generator (v, the (AList.lookup (op =) vTs v)), Term Output))
bulwahn@35324
  1399
                (distinct (op =) missing_vars))
bulwahn@35324
  1400
                @ acc_ps) true (known_vs_after p vs) (filter_out (equal p) ps)
bulwahn@34948
  1401
          else NONE
bulwahn@34948
  1402
        | SOME (p, NONE) => NONE
bulwahn@34948
  1403
        | NONE => NONE)
bulwahn@34948
  1404
  in
bulwahn@34948
  1405
    case check_mode_prems [] false in_vs ps of
bulwahn@34948
  1406
      NONE => NONE
bulwahn@34948
  1407
    | SOME (acc_ps, vs, rnd) =>
bulwahn@37003
  1408
      if forall (is_constructable vs) (in_ts @ out_ts) then
bulwahn@34948
  1409
        SOME (ts, rev acc_ps, rnd)
bulwahn@34948
  1410
      else
bulwahn@35324
  1411
        if #use_random mode_analysis_options andalso pol then
bulwahn@34948
  1412
          let
bulwahn@35324
  1413
             val generators = map
bulwahn@34948
  1414
              (fn v => (Generator (v, the (AList.lookup (op =) vTs v)), Term Output))
bulwahn@35324
  1415
                (subtract (op =) vs (terms_vs (in_ts @ out_ts)))
bulwahn@34948
  1416
          in
bulwahn@34948
  1417
            SOME (ts, rev (generators @ acc_ps), true)
bulwahn@34948
  1418
          end
bulwahn@34948
  1419
        else
bulwahn@34948
  1420
          NONE
bulwahn@34948
  1421
  end
bulwahn@34948
  1422
bulwahn@34948
  1423
datatype result = Success of bool | Error of string
bulwahn@34948
  1424
bulwahn@35324
  1425
fun check_modes_pred' mode_analysis_options options thy param_vs clauses modes (p, (ms : ((bool * mode) * bool) list)) =
bulwahn@34948
  1426
  let
bulwahn@34948
  1427
    fun split xs =
bulwahn@34948
  1428
      let
bulwahn@34948
  1429
        fun split' [] (ys, zs) = (rev ys, rev zs)
bulwahn@34948
  1430
          | split' ((m, Error z) :: xs) (ys, zs) = split' xs (ys, z :: zs)
bulwahn@35324
  1431
          | split' (((m : bool * mode), Success rnd) :: xs) (ys, zs) = split' xs ((m, rnd) :: ys, zs)
bulwahn@34948
  1432
       in
bulwahn@34948
  1433
         split' xs ([], [])
bulwahn@34948
  1434
       end
bulwahn@34948
  1435
    val rs = these (AList.lookup (op =) clauses p)
bulwahn@34948
  1436
    fun check_mode m =
bulwahn@34948
  1437
      let
bulwahn@35324
  1438
        val res = Output.cond_timeit false "work part of check_mode for one mode" (fn _ => 
bulwahn@36028
  1439
          map (check_mode_clause' mode_analysis_options thy p param_vs modes m) rs)
bulwahn@34948
  1440
      in
bulwahn@35324
  1441
        Output.cond_timeit false "aux part of check_mode for one mode" (fn _ => 
bulwahn@34948
  1442
        case find_indices is_none res of
bulwahn@34948
  1443
          [] => Success (exists (fn SOME (_, _, true) => true | _ => false) res)
bulwahn@35324
  1444
        | is => (print_failed_mode options thy modes p m rs is; Error (error_of p m is)))
bulwahn@34948
  1445
      end
bulwahn@35324
  1446
    val _ = if show_mode_inference options then
bulwahn@35324
  1447
        tracing ("checking " ^ string_of_int (length ms) ^ " modes ...")
bulwahn@35324
  1448
      else ()
bulwahn@35324
  1449
    val res = Output.cond_timeit false "check_mode" (fn _ => map (fn (m, _) => (m, check_mode m)) ms)
bulwahn@34948
  1450
    val (ms', errors) = split res
bulwahn@33752
  1451
  in
bulwahn@35324
  1452
    ((p, (ms' : ((bool * mode) * bool) list)), errors)
bulwahn@32667
  1453
  end;
bulwahn@32667
  1454
bulwahn@35324
  1455
fun get_modes_pred' mode_analysis_options thy param_vs clauses modes (p, ms) =
bulwahn@32667
  1456
  let
bulwahn@34948
  1457
    val rs = these (AList.lookup (op =) clauses p)
bulwahn@32667
  1458
  in
bulwahn@34948
  1459
    (p, map (fn (m, rnd) =>
bulwahn@35324
  1460
      (m, map
bulwahn@35324
  1461
        ((fn (ts, ps, rnd) => (ts, ps)) o the o
bulwahn@36028
  1462
          check_mode_clause' mode_analysis_options thy p param_vs modes m) rs)) ms)
bulwahn@32667
  1463
  end;
bulwahn@33137
  1464
bulwahn@35324
  1465
fun fixp f (x : (string * ((bool * mode) * bool) list) list) =
bulwahn@32667
  1466
  let val y = f x
bulwahn@32667
  1467
  in if x = y then x else fixp f y end;
bulwahn@32667
  1468
bulwahn@35324
  1469
fun fixp_with_state f (x : (string * ((bool * mode) * bool) list) list, state) =
bulwahn@33752
  1470
  let
bulwahn@33752
  1471
    val (y, state') = f (x, state)
bulwahn@33752
  1472
  in
bulwahn@33752
  1473
    if x = y then (y, state') else fixp_with_state f (y, state')
bulwahn@33752
  1474
  end
bulwahn@33752
  1475
bulwahn@35324
  1476
fun string_of_ext_mode ((pol, mode), rnd) =
bulwahn@35324
  1477
  string_of_mode mode ^ "(" ^ (if pol then "pos" else "neg") ^ ", "
bulwahn@35324
  1478
  ^ (if rnd then "rnd" else "nornd") ^ ")"
bulwahn@35324
  1479
bulwahn@35324
  1480
fun print_extra_modes options modes =
bulwahn@35324
  1481
  if show_mode_inference options then
bulwahn@35324
  1482
    tracing ("Modes of inferred predicates: " ^
bulwahn@35324
  1483
      cat_lines (map (fn (s, ms) => s ^ ": " ^ commas (map string_of_ext_mode ms)) modes))
bulwahn@35324
  1484
  else ()
bulwahn@35324
  1485
bulwahn@35324
  1486
fun infer_modes mode_analysis_options options compilation preds all_modes param_vs clauses thy =
bulwahn@32667
  1487
  let
bulwahn@37003
  1488
    val ctxt = ProofContext.init_global thy  
bulwahn@35324
  1489
    val collect_errors = false
bulwahn@35324
  1490
    fun appair f (x1, x2) (y1, y2) = (f x1 y1, f x2 y2)
bulwahn@37003
  1491
    fun add_needs_random s (false, m) = ((false, m), false)
bulwahn@37003
  1492
      | add_needs_random s (true, m) = ((true, m), needs_random ctxt s m)
bulwahn@37003
  1493
    fun add_polarity_and_random_bit s b ms = map (fn m => add_needs_random s (b, m)) ms
bulwahn@35324
  1494
    val prednames = map fst preds
bulwahn@35324
  1495
    (* extramodes contains all modes of all constants, should we only use the necessary ones
bulwahn@35324
  1496
       - what is the impact on performance? *)
bulwahn@36251
  1497
    fun predname_of (Prem t) =
bulwahn@36251
  1498
        (case try dest_Const (fst (strip_comb t)) of SOME (c, _) => insert (op =) c | NONE => I)
bulwahn@36251
  1499
      | predname_of (Negprem t) =
bulwahn@36251
  1500
        (case try dest_Const (fst (strip_comb t)) of SOME (c, _) => insert (op =) c | NONE => I)
bulwahn@36251
  1501
      | predname_of _ = I
bulwahn@36251
  1502
    val relevant_prednames = fold (fn (_, clauses') =>
bulwahn@36251
  1503
      fold (fn (_, ps) => fold Term.add_const_names (map dest_indprem ps)) clauses') clauses []
bulwahn@35324
  1504
    val extra_modes =
bulwahn@35324
  1505
      if #infer_pos_and_neg_modes mode_analysis_options then
bulwahn@33752
  1506
        let
bulwahn@35324
  1507
          val pos_extra_modes =
bulwahn@37003
  1508
            map_filter (fn name => Option.map (pair name) (try (modes_of compilation ctxt) name))
bulwahn@36251
  1509
            relevant_prednames
bulwahn@36251
  1510
            |> filter_out (fn (name, _) => member (op =) prednames name)
bulwahn@35324
  1511
          val neg_extra_modes =
bulwahn@36251
  1512
          map_filter (fn name => Option.map (pair name)
bulwahn@37003
  1513
            (try (modes_of (negative_compilation_of compilation) ctxt) name))
bulwahn@36251
  1514
            relevant_prednames
bulwahn@35324
  1515
            |> filter_out (fn (name, _) => member (op =) prednames name)
bulwahn@35324
  1516
        in
bulwahn@35324
  1517
          map (fn (s, ms) => (s, (add_polarity_and_random_bit s true ms)
bulwahn@35324
  1518
                @ add_polarity_and_random_bit s false (the (AList.lookup (op =) neg_extra_modes s))))
bulwahn@35324
  1519
            pos_extra_modes
bulwahn@35324
  1520
        end
bulwahn@35324
  1521
      else
bulwahn@35324
  1522
        map (fn (s, ms) => (s, (add_polarity_and_random_bit s true ms)))
bulwahn@37003
  1523
          (map_filter (fn name => Option.map (pair name) (try (modes_of compilation ctxt) name))
bulwahn@36251
  1524
            relevant_prednames
bulwahn@36251
  1525
          |> filter_out (fn (name, _) => member (op =) prednames name))
bulwahn@35324
  1526
    val _ = print_extra_modes options extra_modes
bulwahn@35324
  1527
    val start_modes =
bulwahn@35324
  1528
      if #infer_pos_and_neg_modes mode_analysis_options then
bulwahn@35324
  1529
        map (fn (s, ms) => (s, map (fn m => ((true, m), false)) ms @
bulwahn@35324
  1530
          (map (fn m => ((false, m), false)) ms))) all_modes
bulwahn@35324
  1531
      else
bulwahn@35324
  1532
        map (fn (s, ms) => (s, map (fn m => ((true, m), false)) ms)) all_modes
bulwahn@35324
  1533
    fun iteration modes = map
bulwahn@37003
  1534
      (check_modes_pred' mode_analysis_options options ctxt param_vs clauses
bulwahn@36028
  1535
        (modes @ extra_modes)) modes
bulwahn@35324
  1536
    val ((modes : (string * ((bool * mode) * bool) list) list), errors) =
bulwahn@35324
  1537
      Output.cond_timeit false "Fixpount computation of mode analysis" (fn () =>
bulwahn@35324
  1538
      if collect_errors then
bulwahn@35324
  1539
        fixp_with_state (fn (modes, errors) =>
bulwahn@35324
  1540
          let
bulwahn@35324
  1541
            val (modes', new_errors) = split_list (iteration modes)
bulwahn@35324
  1542
          in (modes', errors @ flat new_errors) end) (start_modes, [])
bulwahn@35324
  1543
        else
bulwahn@35324
  1544
          (fixp (fn modes => map fst (iteration modes)) start_modes, []))
bulwahn@37003
  1545
    val moded_clauses = map (get_modes_pred' mode_analysis_options ctxt param_vs clauses
bulwahn@35324
  1546
      (modes @ extra_modes)) modes
bulwahn@34948
  1547
    val thy' = fold (fn (s, ms) => if member (op =) (map fst preds) s then
bulwahn@35324
  1548
      set_needs_random s (map_filter (fn ((true, m), true) => SOME m | _ => NONE) ms) else I)
bulwahn@35324
  1549
      modes thy
bulwahn@32667
  1550
  in
bulwahn@35324
  1551
    ((moded_clauses, errors), thy')
bulwahn@32667
  1552
  end;
bulwahn@32667
  1553
bulwahn@32667
  1554
(* term construction *)
bulwahn@32667
  1555
bulwahn@32667
  1556
fun mk_v (names, vs) s T = (case AList.lookup (op =) vs s of
bulwahn@32667
  1557
      NONE => (Free (s, T), (names, (s, [])::vs))
bulwahn@32667
  1558
    | SOME xs =>
bulwahn@32667
  1559
        let
bulwahn@32667
  1560
          val s' = Name.variant names s;
bulwahn@32667
  1561
          val v = Free (s', T)
bulwahn@32667
  1562
        in
bulwahn@32667
  1563
          (v, (s'::names, AList.update (op =) (s, v::xs) vs))
bulwahn@32667
  1564
        end);
bulwahn@32667
  1565
bulwahn@32667
  1566
fun distinct_v (Free (s, T)) nvs = mk_v nvs s T
bulwahn@32667
  1567
  | distinct_v (t $ u) nvs =
bulwahn@32667
  1568
      let
bulwahn@32667
  1569
        val (t', nvs') = distinct_v t nvs;
bulwahn@32667
  1570
        val (u', nvs'') = distinct_v u nvs';
bulwahn@32667
  1571
      in (t' $ u', nvs'') end
bulwahn@32667
  1572
  | distinct_v x nvs = (x, nvs);
bulwahn@32667
  1573
bulwahn@33147
  1574
(** specific rpred functions -- move them to the correct place in this file *)
bulwahn@33147
  1575
bulwahn@33147
  1576
fun mk_Eval_of additional_arguments ((x, T), NONE) names = (x, names)
bulwahn@33147
  1577
  | mk_Eval_of additional_arguments ((x, T), SOME mode) names =
wenzelm@33268
  1578
  let
bulwahn@33147
  1579
    val Ts = binder_types T
wenzelm@33268
  1580
    fun mk_split_lambda [] t = lambda (Free (Name.variant names "x", HOLogic.unitT)) t
wenzelm@33268
  1581
      | mk_split_lambda [x] t = lambda x t
wenzelm@33268
  1582
      | mk_split_lambda xs t =
wenzelm@33268
  1583
      let
wenzelm@33268
  1584
        fun mk_split_lambda' (x::y::[]) t = HOLogic.mk_split (lambda x (lambda y t))
wenzelm@33268
  1585
          | mk_split_lambda' (x::xs) t = HOLogic.mk_split (lambda x (mk_split_lambda' xs t))
wenzelm@33268
  1586
      in
wenzelm@33268
  1587
        mk_split_lambda' xs t
wenzelm@33268
  1588
      end;
wenzelm@33268
  1589
    fun mk_arg (i, T) =
wenzelm@33268
  1590
      let
wenzelm@33268
  1591
        val vname = Name.variant names ("x" ^ string_of_int i)
wenzelm@33268
  1592
        val default = Free (vname, T)
wenzelm@33268
  1593
      in 
wenzelm@33268
  1594
        case AList.lookup (op =) mode i of
wenzelm@33268
  1595
          NONE => (([], [default]), [default])
wenzelm@33268
  1596
        | SOME NONE => (([default], []), [default])
wenzelm@33268
  1597
        | SOME (SOME pis) =>
wenzelm@33268
  1598
          case HOLogic.strip_tupleT T of
wenzelm@33268
  1599
            [] => error "pair mode but unit tuple" (*(([default], []), [default])*)
wenzelm@33268
  1600
          | [_] => error "pair mode but not a tuple" (*(([default], []), [default])*)
wenzelm@33268
  1601
          | Ts =>
wenzelm@33268
  1602
            let
wenzelm@33268
  1603
              val vnames = Name.variant_list names
wenzelm@33268
  1604
                (map (fn j => "x" ^ string_of_int i ^ "p" ^ string_of_int j)
wenzelm@33268
  1605
                  (1 upto length Ts))
bulwahn@33629
  1606
              val args = map2 (curry Free) vnames Ts
wenzelm@33268
  1607
              fun split_args (i, arg) (ins, outs) =
wenzelm@33268
  1608
                if member (op =) pis i then
wenzelm@33268
  1609
                  (arg::ins, outs)
wenzelm@33268
  1610
                else
wenzelm@33268
  1611
                  (ins, arg::outs)
wenzelm@33268
  1612
              val (inargs, outargs) = fold_rev split_args ((1 upto length Ts) ~~ args) ([], [])
wenzelm@33268
  1613
              fun tuple args = if null args then [] else [HOLogic.mk_tuple args]
wenzelm@33268
  1614
            in ((tuple inargs, tuple outargs), args) end
wenzelm@33268
  1615
      end
wenzelm@33268
  1616
    val (inoutargs, args) = split_list (map mk_arg (1 upto (length Ts) ~~ Ts))
bulwahn@33147
  1617
    val (inargs, outargs) = pairself flat (split_list inoutargs)
wenzelm@33268
  1618
    val r = PredicateCompFuns.mk_Eval 
bulwahn@33148
  1619
      (list_comb (x, inargs @ additional_arguments), HOLogic.mk_tuple outargs)
bulwahn@33147
  1620
    val t = fold_rev mk_split_lambda args r
bulwahn@33147
  1621
  in
bulwahn@33147
  1622
    (t, names)
bulwahn@33147
  1623
  end;
bulwahn@33147
  1624
bulwahn@34948
  1625
(* TODO: uses param_vs -- change necessary for compilation with new modes *)
bulwahn@36019
  1626
fun compile_arg compilation_modifiers additional_arguments ctxt param_vs iss arg = 
bulwahn@33147
  1627
  let
bulwahn@33147
  1628
    fun map_params (t as Free (f, T)) =
bulwahn@33147
  1629
      if member (op =) param_vs f then
bulwahn@34948
  1630
        case (AList.lookup (op =) (param_vs ~~ iss) f) of
bulwahn@33147
  1631
          SOME is =>
bulwahn@33147
  1632
            let
bulwahn@34948
  1633
              val _ = error "compile_arg: A parameter in a input position -- do we have a test case?"
bulwahn@34948
  1634
              val T' = Comp_Mod.funT_of compilation_modifiers is T
bulwahn@34948
  1635
            in t(*fst (mk_Eval_of additional_arguments ((Free (f, T'), T), is) [])*) end
bulwahn@33147
  1636
        | NONE => t
bulwahn@33147
  1637
      else t
bulwahn@33147
  1638
      | map_params t = t
bulwahn@33147
  1639
    in map_aterms map_params arg end
bulwahn@33147
  1640
bulwahn@36019
  1641
fun compile_match compilation_modifiers additional_arguments
bulwahn@35891
  1642
  param_vs iss ctxt eqs eqs' out_ts success_t =
bulwahn@32667
  1643
  let
bulwahn@36019
  1644
    val compfuns = Comp_Mod.compfuns compilation_modifiers
bulwahn@32667
  1645
    val eqs'' = maps mk_eq eqs @ eqs'
bulwahn@33147
  1646
    val eqs'' =
bulwahn@36019
  1647
      map (compile_arg compilation_modifiers additional_arguments ctxt param_vs iss) eqs''
bulwahn@32667
  1648
    val names = fold Term.add_free_names (success_t :: eqs'' @ out_ts) [];
bulwahn@32667
  1649
    val name = Name.variant names "x";
bulwahn@32667
  1650
    val name' = Name.variant (name :: names) "y";
bulwahn@33148
  1651
    val T = HOLogic.mk_tupleT (map fastype_of out_ts);
bulwahn@32667
  1652
    val U = fastype_of success_t;
bulwahn@36254
  1653
    val U' = dest_predT compfuns U;
bulwahn@32667
  1654
    val v = Free (name, T);
bulwahn@32667
  1655
    val v' = Free (name', T);
bulwahn@32667
  1656
  in
bulwahn@35891
  1657
    lambda v (fst (Datatype.make_case ctxt Datatype_Case.Quiet [] v
bulwahn@33148
  1658
      [(HOLogic.mk_tuple out_ts,
bulwahn@32667
  1659
        if null eqs'' then success_t
bulwahn@32667
  1660
        else Const (@{const_name HOL.If}, HOLogic.boolT --> U --> U --> U) $
bulwahn@32667
  1661
          foldr1 HOLogic.mk_conj eqs'' $ success_t $
bulwahn@32667
  1662
            mk_bot compfuns U'),
bulwahn@32667
  1663
       (v', mk_bot compfuns U')]))
bulwahn@32667
  1664
  end;
bulwahn@32667
  1665
bulwahn@35891
  1666
fun string_of_tderiv ctxt (t, deriv) = 
bulwahn@35324
  1667
  (case (t, deriv) of
bulwahn@35324
  1668
    (t1 $ t2, Mode_App (deriv1, deriv2)) =>
bulwahn@35891
  1669
      string_of_tderiv ctxt (t1, deriv1) ^ " $ " ^ string_of_tderiv ctxt (t2, deriv2)
haftmann@37391
  1670
  | (Const (@{const_name Pair}, _) $ t1 $ t2, Mode_Pair (deriv1, deriv2)) =>
bulwahn@35891
  1671
    "(" ^ string_of_tderiv ctxt (t1, deriv1) ^ ", " ^ string_of_tderiv ctxt (t2, deriv2) ^ ")"
bulwahn@35891
  1672
  | (t, Term Input) => Syntax.string_of_term ctxt t ^ "[Input]"
bulwahn@35891
  1673
  | (t, Term Output) => Syntax.string_of_term ctxt t ^ "[Output]"
bulwahn@35891
  1674
  | (t, Context m) => Syntax.string_of_term ctxt t ^ "[" ^ string_of_mode m ^ "]")
bulwahn@35324
  1675
bulwahn@36020
  1676
fun compile_expr compilation_modifiers ctxt (t, deriv) additional_arguments =
bulwahn@32667
  1677
  let
bulwahn@36019
  1678
    val compfuns = Comp_Mod.compfuns compilation_modifiers
bulwahn@34948
  1679
    fun expr_of (t, deriv) =
bulwahn@34948
  1680
      (case (t, deriv) of
bulwahn@34948
  1681
        (t, Term Input) => SOME t
bulwahn@34948
  1682
      | (t, Term Output) => NONE
bulwahn@34948
  1683
      | (Const (name, T), Context mode) =>
bulwahn@37003
  1684
        (case alternative_compilation_of ctxt name mode of
bulwahn@36038
  1685
          SOME alt_comp => SOME (alt_comp compfuns T)
bulwahn@36034
  1686
        | NONE =>
bulwahn@36034
  1687
          SOME (Const (function_name_of (Comp_Mod.compilation compilation_modifiers)
bulwahn@37003
  1688
            ctxt name mode,
bulwahn@36034
  1689
            Comp_Mod.funT_of compilation_modifiers mode T)))
bulwahn@34948
  1690
      | (Free (s, T), Context m) =>
bulwahn@34948
  1691
        SOME (Free (s, Comp_Mod.funT_of compilation_modifiers m T))
bulwahn@34948
  1692
      | (t, Context m) =>
bulwahn@34948
  1693
        let
bulwahn@34948
  1694
          val bs = map (pair "x") (binder_types (fastype_of t))
bulwahn@34948
  1695
          val bounds = map Bound (rev (0 upto (length bs) - 1))
bulwahn@34948
  1696
        in SOME (list_abs (bs, mk_if compfuns (list_comb (t, bounds)))) end
haftmann@37391
  1697
      | (Const (@{const_name Pair}, _) $ t1 $ t2, Mode_Pair (d1, d2)) =>
bulwahn@34948
  1698
        (case (expr_of (t1, d1), expr_of (t2, d2)) of
bulwahn@34948
  1699
          (NONE, NONE) => NONE
bulwahn@34948
  1700
        | (NONE, SOME t) => SOME t
bulwahn@34948
  1701
        | (SOME t, NONE) => SOME t
bulwahn@34948
  1702
        | (SOME t1, SOME t2) => SOME (HOLogic.mk_prod (t1, t2)))
bulwahn@34948
  1703
      | (t1 $ t2, Mode_App (deriv1, deriv2)) =>
bulwahn@34948
  1704
        (case (expr_of (t1, deriv1), expr_of (t2, deriv2)) of
bulwahn@34948
  1705
          (SOME t, NONE) => SOME t
bulwahn@34948
  1706
         | (SOME t, SOME u) => SOME (t $ u)
bulwahn@34948
  1707
         | _ => error "something went wrong here!"))
bulwahn@32667
  1708
  in
bulwahn@35879
  1709
    list_comb (the (expr_of (t, deriv)), additional_arguments)
bulwahn@34948
  1710
  end
bulwahn@33145
  1711
bulwahn@36019
  1712
fun compile_clause compilation_modifiers ctxt all_vs param_vs additional_arguments
bulwahn@36254
  1713
  mode inp (in_ts, out_ts) moded_ps =
bulwahn@32667
  1714
  let
bulwahn@36019
  1715
    val compfuns = Comp_Mod.compfuns compilation_modifiers
bulwahn@36254
  1716
    val iss = ho_arg_modes_of mode (* FIXME! *)
bulwahn@36019
  1717
    val compile_match = compile_match compilation_modifiers
bulwahn@35891
  1718
      additional_arguments param_vs iss ctxt
bulwahn@32667
  1719
    val (in_ts', (all_vs', eqs)) =
bulwahn@35891
  1720
      fold_map (collect_non_invertible_subterms ctxt) in_ts (all_vs, []);
bulwahn@32667
  1721
    fun compile_prems out_ts' vs names [] =
bulwahn@32667
  1722
          let
bulwahn@32667
  1723
            val (out_ts'', (names', eqs')) =
bulwahn@35891
  1724
              fold_map (collect_non_invertible_subterms ctxt) out_ts' (names, []);
bulwahn@32667
  1725
            val (out_ts''', (names'', constr_vs)) = fold_map distinct_v
bulwahn@32667
  1726
              out_ts'' (names', map (rpair []) vs);
bulwahn@32667
  1727
          in
bulwahn@33147
  1728
            compile_match constr_vs (eqs @ eqs') out_ts'''
bulwahn@33148
  1729
              (mk_single compfuns (HOLogic.mk_tuple out_ts))
bulwahn@32667
  1730
          end
bulwahn@34948
  1731
      | compile_prems out_ts vs names ((p, deriv) :: ps) =
bulwahn@32667
  1732
          let
bulwahn@32667
  1733
            val vs' = distinct (op =) (flat (vs :: map term_vs out_ts));
bulwahn@32667
  1734
            val (out_ts', (names', eqs)) =
bulwahn@35891
  1735
              fold_map (collect_non_invertible_subterms ctxt) out_ts (names, [])
bulwahn@32667
  1736
            val (out_ts'', (names'', constr_vs')) = fold_map distinct_v
bulwahn@32667
  1737
              out_ts' ((names', map (rpair []) vs))
bulwahn@34948
  1738
            val mode = head_mode_of deriv
bulwahn@33143
  1739
            val additional_arguments' =
bulwahn@33330
  1740
              Comp_Mod.transform_additional_arguments compilation_modifiers p additional_arguments
bulwahn@32667
  1741
            val (compiled_clause, rest) = case p of
bulwahn@34948
  1742
               Prem t =>
bulwahn@32667
  1743
                 let
bulwahn@33138
  1744
                   val u =
bulwahn@36020
  1745
                     compile_expr compilation_modifiers ctxt (t, deriv) additional_arguments'
bulwahn@34948
  1746
                   val (_, out_ts''') = split_mode mode (snd (strip_comb t))
bulwahn@32667
  1747
                   val rest = compile_prems out_ts''' vs' names'' ps
bulwahn@32667
  1748
                 in
bulwahn@32667
  1749
                   (u, rest)
bulwahn@32667
  1750
                 end
bulwahn@34948
  1751
             | Negprem t =>
bulwahn@32667
  1752
                 let
bulwahn@36019
  1753
                   val neg_compilation_modifiers =
bulwahn@36019
  1754
                     negative_comp_modifiers_of compilation_modifiers
bulwahn@33143
  1755
                   val u = mk_not compfuns
bulwahn@36020
  1756
                     (compile_expr neg_compilation_modifiers ctxt (t, deriv) additional_arguments')
bulwahn@34948
  1757
                   val (_, out_ts''') = split_mode mode (snd (strip_comb t))
bulwahn@32667
  1758
                   val rest = compile_prems out_ts''' vs' names'' ps
bulwahn@32667
  1759
                 in
bulwahn@32667
  1760
                   (u, rest)
bulwahn@32667
  1761
                 end
bulwahn@32667
  1762
             | Sidecond t =>
bulwahn@32667
  1763
                 let
bulwahn@36019
  1764
                   val t = compile_arg compilation_modifiers additional_arguments
bulwahn@35891
  1765
                     ctxt param_vs iss t
bulwahn@32667
  1766
                   val rest = compile_prems [] vs' names'' ps;
bulwahn@32667
  1767
                 in
bulwahn@32667
  1768
                   (mk_if compfuns t, rest)
bulwahn@32667
  1769
                 end
bulwahn@32667
  1770
             | Generator (v, T) =>
bulwahn@32667
  1771
                 let
bulwahn@35880
  1772
                   val u = Comp_Mod.mk_random compilation_modifiers T additional_arguments
bulwahn@32667
  1773
                   val rest = compile_prems [Free (v, T)]  vs' names'' ps;
bulwahn@32667
  1774
                 in
bulwahn@32667
  1775
                   (u, rest)
bulwahn@32667
  1776
                 end
bulwahn@32667
  1777
          in
bulwahn@33147
  1778
            compile_match constr_vs' eqs out_ts''
bulwahn@32667
  1779
              (mk_bind compfuns (compiled_clause, rest))
bulwahn@32667
  1780
          end
bulwahn@32667
  1781
    val prem_t = compile_prems in_ts' param_vs all_vs' moded_ps;
bulwahn@32667
  1782
  in
bulwahn@32667
  1783
    mk_bind compfuns (mk_single compfuns inp, prem_t)
bulwahn@32667
  1784
  end
bulwahn@32667
  1785
bulwahn@36254
  1786
(* switch detection *)
bulwahn@36254
  1787
bulwahn@36254
  1788
(** argument position of an inductive predicates and the executable functions **)
bulwahn@36254
  1789
bulwahn@36254
  1790
type position = int * int list
bulwahn@36254
  1791
bulwahn@36254
  1792
fun input_positions_pair Input = [[]]
bulwahn@36254
  1793
  | input_positions_pair Output = []
bulwahn@36254
  1794
  | input_positions_pair (Fun _) = []
bulwahn@36254
  1795
  | input_positions_pair (Pair (m1, m2)) =
bulwahn@36254
  1796
    map (cons 1) (input_positions_pair m1) @ map (cons 2) (input_positions_pair m2)
bulwahn@36254
  1797
bulwahn@36254
  1798
fun input_positions_of_mode mode = flat (map_index
bulwahn@36254
  1799
   (fn (i, Input) => [(i, [])]
bulwahn@36254
  1800
   | (_, Output) => []
bulwahn@36254
  1801
   | (_, Fun _) => []
bulwahn@36254
  1802
   | (i, m as Pair (m1, m2)) => map (pair i) (input_positions_pair m))
bulwahn@36254
  1803
     (Predicate_Compile_Aux.strip_fun_mode mode))
bulwahn@36254
  1804
bulwahn@36254
  1805
fun argument_position_pair mode [] = []
bulwahn@36254
  1806
  | argument_position_pair (Pair (Fun _, m2)) (2 :: is) = argument_position_pair m2 is
bulwahn@36254
  1807
  | argument_position_pair (Pair (m1, m2)) (i :: is) =
bulwahn@36254
  1808
    (if eq_mode (m1, Output) andalso i = 2 then
bulwahn@36254
  1809
      argument_position_pair m2 is
bulwahn@36254
  1810
    else if eq_mode (m2, Output) andalso i = 1 then
bulwahn@36254
  1811
      argument_position_pair m1 is
bulwahn@36254
  1812
    else (i :: argument_position_pair (if i = 1 then m1 else m2) is))
bulwahn@36254
  1813
bulwahn@36254
  1814
fun argument_position_of mode (i, is) =
bulwahn@36254
  1815
  (i - (length (filter (fn Output => true | Fun _ => true | _ => false)
bulwahn@36254
  1816
    (List.take (strip_fun_mode mode, i)))),
bulwahn@36254
  1817
  argument_position_pair (nth (strip_fun_mode mode) i) is)
bulwahn@36254
  1818
bulwahn@36254
  1819
fun nth_pair [] t = t
bulwahn@36254
  1820
  | nth_pair (1 :: is) (Const (@{const_name Pair}, _) $ t1 $ _) = nth_pair is t1
bulwahn@36254
  1821
  | nth_pair (2 :: is) (Const (@{const_name Pair}, _) $ _ $ t2) = nth_pair is t2
bulwahn@36254
  1822
  | nth_pair _ _ = raise Fail "unexpected input for nth_tuple"
bulwahn@36254
  1823
bulwahn@36254
  1824
(** switch detection analysis **)
bulwahn@36254
  1825
bulwahn@37005
  1826
fun find_switch_test ctxt (i, is) (ts, prems) =
bulwahn@36254
  1827
  let
bulwahn@36254
  1828
    val t = nth_pair is (nth ts i)
bulwahn@36254
  1829
    val T = fastype_of t
bulwahn@36254
  1830
  in
bulwahn@36254
  1831
    case T of
bulwahn@36254
  1832
      TFree _ => NONE
bulwahn@36254
  1833
    | Type (Tcon, _) =>
bulwahn@37005
  1834
      (case Datatype_Data.get_constrs (ProofContext.theory_of ctxt) Tcon of
bulwahn@36254
  1835
        NONE => NONE
bulwahn@36254
  1836
      | SOME cs =>
bulwahn@36254
  1837
        (case strip_comb t of
bulwahn@36254
  1838
          (Var _, []) => NONE
bulwahn@36254
  1839
        | (Free _, []) => NONE
bulwahn@36254
  1840
        | (Const (c, T), _) => if AList.defined (op =) cs c then SOME (c, T) else NONE))
bulwahn@36254
  1841
  end
bulwahn@36254
  1842
bulwahn@37005
  1843
fun partition_clause ctxt pos moded_clauses =
bulwahn@36254
  1844
  let
bulwahn@36254
  1845
    fun insert_list eq (key, value) = AList.map_default eq (key, []) (cons value)
bulwahn@36254
  1846
    fun find_switch_test' moded_clause (cases, left) =
bulwahn@37005
  1847
      case find_switch_test ctxt pos moded_clause of
bulwahn@36254
  1848
        SOME (c, T) => (insert_list (op =) ((c, T), moded_clause) cases, left)
bulwahn@36254
  1849
      | NONE => (cases, moded_clause :: left)
bulwahn@36254
  1850
  in
bulwahn@36254
  1851
    fold find_switch_test' moded_clauses ([], [])
bulwahn@36254
  1852
  end
bulwahn@36254
  1853
bulwahn@36254
  1854
datatype switch_tree =
bulwahn@36254
  1855
  Atom of moded_clause list | Node of (position * ((string * typ) * switch_tree) list) * switch_tree
bulwahn@36254
  1856
bulwahn@37005
  1857
fun mk_switch_tree ctxt mode moded_clauses =
bulwahn@36254
  1858
  let
bulwahn@36254
  1859
    fun select_best_switch moded_clauses input_position best_switch =
bulwahn@36254
  1860
      let
bulwahn@36254
  1861
        val ord = option_ord (rev_order o int_ord o (pairself (length o snd o snd)))
bulwahn@37005
  1862
        val partition = partition_clause ctxt input_position moded_clauses
bulwahn@36254
  1863
        val switch = if (length (fst partition) > 1) then SOME (input_position, partition) else NONE
bulwahn@36254
  1864
      in
bulwahn@36254
  1865
        case ord (switch, best_switch) of LESS => best_switch
bulwahn@36254
  1866
          | EQUAL => best_switch | GREATER => switch
bulwahn@36254
  1867
      end
bulwahn@36254
  1868
    fun detect_switches moded_clauses =
bulwahn@36254
  1869
      case fold (select_best_switch moded_clauses) (input_positions_of_mode mode) NONE of
bulwahn@36254
  1870
        SOME (best_pos, (switched_on, left_clauses)) =>
bulwahn@36254
  1871
          Node ((best_pos, map (apsnd detect_switches) switched_on),
bulwahn@36254
  1872
            detect_switches left_clauses)
bulwahn@36254
  1873
      | NONE => Atom moded_clauses
bulwahn@36254
  1874
  in
bulwahn@36254
  1875
    detect_switches moded_clauses
bulwahn@36254
  1876
  end
bulwahn@36254
  1877
bulwahn@36254
  1878
(** compilation of detected switches **)
bulwahn@36254
  1879
bulwahn@36254
  1880
fun destruct_constructor_pattern (pat, obj) =
bulwahn@36254
  1881
  (case strip_comb pat of
bulwahn@36254
  1882
    (f as Free _, []) => cons (pat, obj)
bulwahn@36254
  1883
  | (Const (c, T), pat_args) =>
bulwahn@36254
  1884
    (case strip_comb obj of
bulwahn@36254
  1885
      (Const (c', T'), obj_args) =>
bulwahn@36254
  1886
        (if c = c' andalso T = T' then
bulwahn@36254
  1887
          fold destruct_constructor_pattern (pat_args ~~ obj_args)
bulwahn@36254
  1888
        else raise Fail "pattern and object mismatch")
bulwahn@36254
  1889
    | _ => raise Fail "unexpected object")
bulwahn@36254
  1890
  | _ => raise Fail "unexpected pattern")
bulwahn@36254
  1891
bulwahn@36254
  1892
bulwahn@36254
  1893
fun compile_switch compilation_modifiers ctxt all_vs param_vs additional_arguments mode
bulwahn@36254
  1894
  in_ts' outTs switch_tree =
bulwahn@36254
  1895
  let
bulwahn@36254
  1896
    val compfuns = Comp_Mod.compfuns compilation_modifiers
bulwahn@36254
  1897
    val thy = ProofContext.theory_of ctxt
bulwahn@36254
  1898
    fun compile_switch_tree _ _ (Atom []) = NONE
bulwahn@36254
  1899
      | compile_switch_tree all_vs ctxt_eqs (Atom moded_clauses) =
bulwahn@36254
  1900
        let
bulwahn@36254
  1901
          val in_ts' = map (Pattern.rewrite_term thy ctxt_eqs []) in_ts'
bulwahn@36254
  1902
          fun compile_clause' (ts, moded_ps) =
bulwahn@36254
  1903
            let
bulwahn@36254
  1904
              val (ts, out_ts) = split_mode mode ts
bulwahn@36254
  1905
              val subst = fold destruct_constructor_pattern (in_ts' ~~ ts) []
bulwahn@36254
  1906
              val (fsubst, pat') = List.partition (fn (_, Free _) => true | _ => false) subst
bulwahn@36254
  1907
              val moded_ps' = (map o apfst o map_indprem)
bulwahn@36254
  1908
                (Pattern.rewrite_term thy (map swap fsubst) []) moded_ps
bulwahn@36254
  1909
              val inp = HOLogic.mk_tuple (map fst pat')
bulwahn@36254
  1910
              val in_ts' = map (Pattern.rewrite_term thy (map swap fsubst) []) (map snd pat')
bulwahn@36254
  1911
              val out_ts' = map (Pattern.rewrite_term thy (map swap fsubst) []) out_ts
bulwahn@36254
  1912
            in
bulwahn@36254
  1913
              compile_clause compilation_modifiers ctxt all_vs param_vs additional_arguments
bulwahn@36254
  1914
                mode inp (in_ts', out_ts') moded_ps'
bulwahn@36254
  1915
            end
bulwahn@36254
  1916
        in SOME (foldr1 (mk_sup compfuns) (map compile_clause' moded_clauses)) end
bulwahn@36254
  1917
    | compile_switch_tree all_vs ctxt_eqs (Node ((position, switched_clauses), left_clauses)) =
bulwahn@36254
  1918
      let
bulwahn@36254
  1919
        val (i, is) = argument_position_of mode position
bulwahn@36254
  1920
        val inp_var = nth_pair is (nth in_ts' i)
bulwahn@36254
  1921
        val x = Name.variant all_vs "x"
bulwahn@36254
  1922
        val xt = Free (x, fastype_of inp_var)
bulwahn@36254
  1923
        fun compile_single_case ((c, T), switched) =
bulwahn@36254
  1924
          let
bulwahn@36254
  1925
            val Ts = binder_types T
bulwahn@36254
  1926
            val argnames = Name.variant_list (x :: all_vs)
bulwahn@36254
  1927
              (map (fn i => "c" ^ string_of_int i) (1 upto length Ts))
bulwahn@36254
  1928
            val args = map2 (curry Free) argnames Ts
bulwahn@36254
  1929
            val pattern = list_comb (Const (c, T), args)
bulwahn@36254
  1930
            val ctxt_eqs' = (inp_var, pattern) :: ctxt_eqs
bulwahn@36254
  1931
            val compilation = the_default (mk_bot compfuns (HOLogic.mk_tupleT outTs))
bulwahn@36254
  1932
              (compile_switch_tree (argnames @ x :: all_vs) ctxt_eqs' switched)
bulwahn@36254
  1933
        in
bulwahn@36254
  1934
          (pattern, compilation)
bulwahn@36254
  1935
        end
bulwahn@36254
  1936
        val switch = fst (Datatype.make_case ctxt Datatype_Case.Quiet [] inp_var
bulwahn@36254
  1937
          ((map compile_single_case switched_clauses) @
bulwahn@36254
  1938
            [(xt, mk_bot compfuns (HOLogic.mk_tupleT outTs))]))
bulwahn@36254
  1939
      in
bulwahn@36254
  1940
        case compile_switch_tree all_vs ctxt_eqs left_clauses of
bulwahn@36254
  1941
          NONE => SOME switch
bulwahn@36254
  1942
        | SOME left_comp => SOME (mk_sup compfuns (switch, left_comp))
bulwahn@36254
  1943
      end
bulwahn@36254
  1944
  in
bulwahn@36254
  1945
    compile_switch_tree all_vs [] switch_tree
bulwahn@36254
  1946
  end
bulwahn@36254
  1947
bulwahn@36254
  1948
(* compilation of predicates *)
bulwahn@36254
  1949
bulwahn@37005
  1950
fun compile_pred options compilation_modifiers ctxt all_vs param_vs s T (pol, mode) moded_cls =
bulwahn@32667
  1951
  let
bulwahn@36020
  1952
    val compilation_modifiers = if pol then compilation_modifiers else
bulwahn@36020
  1953
      negative_comp_modifiers_of compilation_modifiers
bulwahn@35879
  1954
    val additional_arguments = Comp_Mod.additional_arguments compilation_modifiers
bulwahn@33482
  1955
      (all_vs @ param_vs)
bulwahn@34948
  1956
    val compfuns = Comp_Mod.compfuns compilation_modifiers
bulwahn@34948
  1957
    fun is_param_type (T as Type ("fun",[_ , T'])) =
bulwahn@34948
  1958
      is_some (try (dest_predT compfuns) T) orelse is_param_type T'
bulwahn@34948
  1959
      | is_param_type T = is_some (try (dest_predT compfuns) T)
bulwahn@34948
  1960
    val (inpTs, outTs) = split_map_modeT (fn m => fn T => (SOME (funT_of compfuns m T), NONE)) mode
bulwahn@34948
  1961
      (binder_types T)
bulwahn@34948
  1962
    val predT = mk_predT compfuns (HOLogic.mk_tupleT outTs)
bulwahn@34948
  1963
    val funT = Comp_Mod.funT_of compilation_modifiers mode T
bulwahn@34948
  1964
    val (in_ts, _) = fold_map (fold_map_aterms_prodT (curry HOLogic.mk_prod)
bulwahn@34948
  1965
      (fn T => fn (param_vs, names) =>
bulwahn@36018
  1966
        if is_param_type T then
bulwahn@34948
  1967
          (Free (hd param_vs, T), (tl param_vs, names))
bulwahn@34948
  1968
        else
bulwahn@34948
  1969
          let
bulwahn@34948
  1970
            val new = Name.variant names "x"
bulwahn@34948
  1971
          in (Free (new, T), (param_vs, new :: names)) end)) inpTs
bulwahn@34948
  1972
        (param_vs, (all_vs @ param_vs))
bulwahn@34948
  1973
    val in_ts' = map_filter (map_filter_prod
bulwahn@34948
  1974
      (fn t as Free (x, _) => if member (op =) param_vs x then NONE else SOME t | t => SOME t)) in_ts
bulwahn@36254
  1975
    val compilation =
bulwahn@36254
  1976
      if detect_switches options then
bulwahn@36254
  1977
        the_default (mk_bot compfuns (HOLogic.mk_tupleT outTs))
bulwahn@36254
  1978
          (compile_switch compilation_modifiers ctxt all_vs param_vs additional_arguments
bulwahn@37005
  1979
            mode in_ts' outTs (mk_switch_tree ctxt mode moded_cls))
bulwahn@36254
  1980
      else
bulwahn@36254
  1981
        let
bulwahn@36254
  1982
          val cl_ts =
bulwahn@36254
  1983
            map (fn (ts, moded_prems) => 
bulwahn@36254
  1984
              compile_clause compilation_modifiers ctxt all_vs param_vs additional_arguments
bulwahn@36254
  1985
              mode (HOLogic.mk_tuple in_ts') (split_mode mode ts) moded_prems) moded_cls;
bulwahn@36254
  1986
        in
bulwahn@36254
  1987
          Comp_Mod.wrap_compilation compilation_modifiers compfuns s T mode additional_arguments
bulwahn@36254
  1988
            (if null cl_ts then
bulwahn@36254
  1989
              mk_bot compfuns (HOLogic.mk_tupleT outTs)
bulwahn@36254
  1990
            else
bulwahn@36254
  1991
              foldr1 (mk_sup compfuns) cl_ts)
bulwahn@36254
  1992
        end
bulwahn@33143
  1993
    val fun_const =
bulwahn@35891
  1994
      Const (function_name_of (Comp_Mod.compilation compilation_modifiers)
bulwahn@37003
  1995
      ctxt s mode, funT)
bulwahn@32667
  1996
  in
bulwahn@33143
  1997
    HOLogic.mk_Trueprop
bulwahn@34948
  1998
      (HOLogic.mk_eq (list_comb (fun_const, in_ts @ additional_arguments), compilation))
bulwahn@32667
  1999
  end;
bulwahn@33143
  2000
bulwahn@36254
  2001
(** special setup for simpset **)
haftmann@34974
  2002
val HOL_basic_ss' = HOL_basic_ss addsimps (@{thms HOL.simp_thms} @ [@{thm Pair_eq}])
bulwahn@32667
  2003
  setSolver (mk_solver "all_tac_solver" (fn _ => fn _ => all_tac))
wenzelm@33268
  2004
  setSolver (mk_solver "True_solver" (fn _ => rtac @{thm TrueI}))
bulwahn@32667
  2005
bulwahn@32667
  2006
(* Definition of executable functions and their intro and elim rules *)
bulwahn@32667
  2007
bulwahn@32667
  2008
fun print_arities arities = tracing ("Arities:\n" ^
bulwahn@32667
  2009
  cat_lines (map (fn (s, (ks, k)) => s ^ ": " ^
bulwahn@32667
  2010
    space_implode " -> " (map
bulwahn@32667
  2011
      (fn NONE => "X" | SOME k' => string_of_int k')
bulwahn@32667
  2012
        (ks @ [SOME k]))) arities));
bulwahn@32667
  2013
bulwahn@34948
  2014
fun split_lambda (x as Free _) t = lambda x t
haftmann@37391
  2015
  | split_lambda (Const (@{const_name Pair}, _) $ t1 $ t2) t =
bulwahn@34948
  2016
    HOLogic.mk_split (split_lambda t1 (split_lambda t2 t))
bulwahn@34948
  2017
  | split_lambda (Const ("Product_Type.Unity", _)) t = Abs ("x", HOLogic.unitT, t)
bulwahn@34948
  2018
  | split_lambda t _ = raise (TERM ("split_lambda", [t]))
bulwahn@34948
  2019
haftmann@37591
  2020
fun strip_split_abs (Const (@{const_name prod_case}, _) $ t) = strip_split_abs t
bulwahn@34948
  2021
  | strip_split_abs (Abs (_, _, t)) = strip_split_abs t
bulwahn@34948
  2022
  | strip_split_abs t = t
bulwahn@34948
  2023
haftmann@37678
  2024
fun mk_args is_eval (m as Pair (m1, m2), T as Type (@{type_name Product_Type.prod}, [T1, T2])) names =
bulwahn@35324
  2025
    if eq_mode (m, Input) orelse eq_mode (m, Output) then
bulwahn@35324
  2026
      let
bulwahn@35324
  2027
        val x = Name.variant names "x"
bulwahn@35324
  2028
      in
bulwahn@35324
  2029
        (Free (x, T), x :: names)
bulwahn@35324
  2030
      end
bulwahn@35324
  2031
    else
bulwahn@35324
  2032
      let
bulwahn@35324
  2033
        val (t1, names') = mk_args is_eval (m1, T1) names
bulwahn@35324
  2034
        val (t2, names'') = mk_args is_eval (m2, T2) names'
bulwahn@35324
  2035
      in
bulwahn@35324
  2036
        (HOLogic.mk_prod (t1, t2), names'')
bulwahn@35324
  2037
      end
bulwahn@34948
  2038
  | mk_args is_eval ((m as Fun _), T) names =
bulwahn@34948
  2039
    let
bulwahn@34948
  2040
      val funT = funT_of PredicateCompFuns.compfuns m T
bulwahn@34948
  2041
      val x = Name.variant names "x"
bulwahn@34948
  2042
      val (args, _) = fold_map (mk_args is_eval) (strip_fun_mode m ~~ binder_types T) (x :: names)
bulwahn@34948
  2043
      val (inargs, outargs) = split_map_mode (fn _ => fn t => (SOME t, NONE)) m args
bulwahn@34948
  2044
      val t = fold_rev split_lambda args (PredicateCompFuns.mk_Eval
bulwahn@34948
  2045
        (list_comb (Free (x, funT), inargs), HOLogic.mk_tuple outargs))
bulwahn@34948
  2046
    in
bulwahn@34948
  2047
      (if is_eval then t else Free (x, funT), x :: names)
bulwahn@34948
  2048
    end
bulwahn@34948
  2049
  | mk_args is_eval (_, T) names =
bulwahn@34948
  2050
    let
bulwahn@34948
  2051
      val x = Name.variant names "x"
wenzelm@33268
  2052
    in
bulwahn@34948
  2053
      (Free (x, T), x :: names)
wenzelm@33268
  2054
    end
bulwahn@34948
  2055
bulwahn@37003
  2056
fun create_intro_elim_rule ctxt mode defthm mode_id funT pred =
bulwahn@34948
  2057
  let
bulwahn@34948
  2058
    val funtrm = Const (mode_id, funT)
bulwahn@34948
  2059
    val Ts = binder_types (fastype_of pred)
bulwahn@34948
  2060
    val (args, argnames) = fold_map (mk_args true) (strip_fun_mode mode ~~ Ts) []
bulwahn@34948
  2061
    fun strip_eval _ t =
bulwahn@34948
  2062
      let
bulwahn@34948
  2063
        val t' = strip_split_abs t
bulwahn@34948
  2064
        val (r, _) = PredicateCompFuns.dest_Eval t'
bulwahn@34948
  2065
      in (SOME (fst (strip_comb r)), NONE) end
bulwahn@34948
  2066
    val (inargs, outargs) = split_map_mode strip_eval mode args
bulwahn@34948
  2067
    val eval_hoargs = ho_args_of mode args
bulwahn@34948
  2068
    val hoargTs = ho_argsT_of mode Ts
bulwahn@34948
  2069
    val hoarg_names' =
bulwahn@34948
  2070
      Name.variant_list argnames ((map (fn i => "x" ^ string_of_int i)) (1 upto (length hoargTs)))
bulwahn@34948
  2071
    val hoargs' = map2 (curry Free) hoarg_names' hoargTs
bulwahn@34948
  2072
    val args' = replace_ho_args mode hoargs' args
bulwahn@34948
  2073
    val predpropI = HOLogic.mk_Trueprop (list_comb (pred, args'))
bulwahn@34948
  2074
    val predpropE = HOLogic.mk_Trueprop (list_comb (pred, args))
bulwahn@34948
  2075
    val param_eqs = map2 (HOLogic.mk_Trueprop oo (curry HOLogic.mk_eq)) eval_hoargs hoargs'
bulwahn@34948
  2076
    val funpropE = HOLogic.mk_Trueprop (PredicateCompFuns.mk_Eval (list_comb (funtrm, inargs),
bulwahn@34948
  2077
                    if null outargs then Free("y", HOLogic.unitT) else HOLogic.mk_tuple outargs))
bulwahn@34948
  2078
    val funpropI = HOLogic.mk_Trueprop (PredicateCompFuns.mk_Eval (list_comb (funtrm, inargs),
bulwahn@34948
  2079
                     HOLogic.mk_tuple outargs))
bulwahn@34948
  2080
    val introtrm = Logic.list_implies (predpropI :: param_eqs, funpropI)
bulwahn@34948
  2081
    val simprules = [defthm, @{thm eval_pred},
bulwahn@34948
  2082
      @{thm "split_beta"}, @{thm "fst_conv"}, @{thm "snd_conv"}, @{thm pair_collapse}]
bulwahn@34948
  2083
    val unfolddef_tac = Simplifier.asm_full_simp_tac (HOL_basic_ss addsimps simprules) 1
bulwahn@37003
  2084
    val introthm = Goal.prove ctxt
bulwahn@34948
  2085
      (argnames @ hoarg_names' @ ["y"]) [] introtrm (fn _ => unfolddef_tac)
bulwahn@34948
  2086
    val P = HOLogic.mk_Trueprop (Free ("P", HOLogic.boolT));
bulwahn@34948
  2087
    val elimtrm = Logic.list_implies ([funpropE, Logic.mk_implies (predpropE, P)], P)
bulwahn@37003
  2088
    val elimthm = Goal.prove ctxt
bulwahn@34948
  2089
      (argnames @ ["y", "P"]) [] elimtrm (fn _ => unfolddef_tac)
bulwahn@35884
  2090
    val opt_neg_introthm =
bulwahn@35884
  2091
      if is_all_input mode then
bulwahn@35884
  2092
        let
bulwahn@35884
  2093
          val neg_predpropI = HOLogic.mk_Trueprop (HOLogic.mk_not (list_comb (pred, args')))
bulwahn@35884
  2094
          val neg_funpropI =
bulwahn@35884
  2095
            HOLogic.mk_Trueprop (PredicateCompFuns.mk_Eval
bulwahn@35884
  2096
              (PredicateCompFuns.mk_not (list_comb (funtrm, inargs)), HOLogic.unit))
bulwahn@35884
  2097
          val neg_introtrm = Logic.list_implies (neg_predpropI :: param_eqs, neg_funpropI)
bulwahn@35884
  2098
          val tac =
bulwahn@35884
  2099
            Simplifier.asm_full_simp_tac (HOL_basic_ss addsimps
bulwahn@35884
  2100
              (@{thm if_False} :: @{thm Predicate.not_pred_eq} :: simprules)) 1
bulwahn@35884
  2101
            THEN rtac @{thm Predicate.singleI} 1
bulwahn@37003
  2102
        in SOME (Goal.prove ctxt (argnames @ hoarg_names') []
bulwahn@35884
  2103
            neg_introtrm (fn _ => tac))
bulwahn@35884
  2104
        end
bulwahn@35884
  2105
      else NONE
bulwahn@34948
  2106
  in
bulwahn@35884
  2107
    ((introthm, elimthm), opt_neg_introthm)
bulwahn@34948
  2108
  end
bulwahn@32667
  2109
bulwahn@33620
  2110
fun create_constname_of_mode options thy prefix name T mode = 
bulwahn@32667
  2111
  let
bulwahn@33626
  2112
    val system_proposal = prefix ^ (Long_Name.base_name name)
bulwahn@34948
  2113
      ^ "_" ^ ascii_string_of_mode mode
bulwahn@34948
  2114
    val name = the_default system_proposal (proposed_names options name mode)
bulwahn@32667
  2115
  in
bulwahn@33620
  2116
    Sign.full_bname thy name
bulwahn@32667
  2117
  end;
bulwahn@32667
  2118
bulwahn@33620
  2119
fun create_definitions options preds (name, modes) thy =
bulwahn@32667
  2120
  let
bulwahn@32667
  2121
    val compfuns = PredicateCompFuns.compfuns
bulwahn@32667
  2122
    val T = AList.lookup (op =) preds name |> the
bulwahn@34948
  2123
    fun create_definition mode thy =
bulwahn@33752
  2124
      let
bulwahn@33752
  2125
        val mode_cname = create_constname_of_mode options thy "" name T mode
bulwahn@33752
  2126
        val mode_cbasename = Long_Name.base_name mode_cname
bulwahn@34948
  2127
        val funT = funT_of compfuns mode T
bulwahn@34948
  2128
        val (args, _) = fold_map (mk_args true) ((strip_fun_mode mode) ~~ (binder_types T)) []
bulwahn@34948
  2129
        fun strip_eval m t =
bulwahn@33752
  2130
          let
bulwahn@34948
  2131
            val t' = strip_split_abs t
bulwahn@34948
  2132
            val (r, _) = PredicateCompFuns.dest_Eval t'
bulwahn@34948
  2133
          in (SOME (fst (strip_comb r)), NONE) end