src/HOL/Tools/Nitpick/nitpick_model.ML
author blanchet
Sat Apr 24 16:17:30 2010 +0200 (2010-04-24)
changeset 36384 76d5fd5a45fb
parent 35845 e5980f0ad025
child 36385 ff5f88702590
permissions -rw-r--r--
cosmetics
blanchet@33982
     1
(*  Title:      HOL/Tools/Nitpick/nitpick_model.ML
blanchet@33192
     2
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@34982
     3
    Copyright   2009, 2010
blanchet@33192
     4
blanchet@33192
     5
Model reconstruction for Nitpick.
blanchet@33192
     6
*)
blanchet@33192
     7
blanchet@33192
     8
signature NITPICK_MODEL =
blanchet@33192
     9
sig
blanchet@33705
    10
  type styp = Nitpick_Util.styp
blanchet@33232
    11
  type scope = Nitpick_Scope.scope
blanchet@33232
    12
  type rep = Nitpick_Rep.rep
blanchet@33232
    13
  type nut = Nitpick_Nut.nut
blanchet@33192
    14
blanchet@33192
    15
  type params = {
blanchet@33192
    16
    show_skolems: bool,
blanchet@33192
    17
    show_datatypes: bool,
blanchet@33192
    18
    show_consts: bool}
blanchet@36384
    19
blanchet@35712
    20
  type term_postprocessor =
blanchet@35712
    21
    Proof.context -> string -> (typ -> term list) -> typ -> term -> term
blanchet@33192
    22
blanchet@33192
    23
  structure NameTable : TABLE
blanchet@33192
    24
blanchet@35712
    25
  val irrelevant : string
blanchet@35712
    26
  val unknown : string
blanchet@35712
    27
  val unrep : string
blanchet@35711
    28
  val register_term_postprocessor :
blanchet@35711
    29
    typ -> term_postprocessor -> theory -> theory
blanchet@35711
    30
  val unregister_term_postprocessor : typ -> theory -> theory
blanchet@33192
    31
  val tuple_list_for_name :
blanchet@33192
    32
    nut NameTable.table -> Kodkod.raw_bound list -> nut -> int list list
blanchet@35712
    33
  val dest_plain_fun : term -> bool * (term list * term list)
blanchet@33192
    34
  val reconstruct_hol_model :
blanchet@33192
    35
    params -> scope -> (term option * int list) list -> styp list -> nut list
blanchet@33192
    36
    -> nut list -> nut list -> nut NameTable.table -> Kodkod.raw_bound list
blanchet@33192
    37
    -> Pretty.T * bool
blanchet@33192
    38
  val prove_hol_model :
blanchet@33192
    39
    scope -> Time.time option -> nut list -> nut list -> nut NameTable.table
blanchet@33192
    40
    -> Kodkod.raw_bound list -> term -> bool option
blanchet@33192
    41
end;
blanchet@33192
    42
blanchet@33232
    43
structure Nitpick_Model : NITPICK_MODEL =
blanchet@33192
    44
struct
blanchet@33192
    45
blanchet@33232
    46
open Nitpick_Util
blanchet@33232
    47
open Nitpick_HOL
blanchet@33232
    48
open Nitpick_Scope
blanchet@33232
    49
open Nitpick_Peephole
blanchet@33232
    50
open Nitpick_Rep
blanchet@33232
    51
open Nitpick_Nut
blanchet@33192
    52
blanchet@34126
    53
structure KK = Kodkod
blanchet@34126
    54
blanchet@33192
    55
type params = {
blanchet@33192
    56
  show_skolems: bool,
blanchet@33192
    57
  show_datatypes: bool,
blanchet@33192
    58
  show_consts: bool}
blanchet@33192
    59
blanchet@35712
    60
type term_postprocessor =
blanchet@35712
    61
  Proof.context -> string -> (typ -> term list) -> typ -> term -> term
blanchet@35711
    62
blanchet@35711
    63
structure Data = Theory_Data(
blanchet@35711
    64
  type T = (typ * term_postprocessor) list
blanchet@35711
    65
  val empty = []
blanchet@35711
    66
  val extend = I
blanchet@35711
    67
  fun merge (ps1, ps2) = AList.merge (op =) (K true) (ps1, ps2))
blanchet@35711
    68
blanchet@35712
    69
val irrelevant = "_"
blanchet@33192
    70
val unknown = "?"
blanchet@33192
    71
val unrep = "\<dots>"
blanchet@33192
    72
val maybe_mixfix = "_\<^sup>?"
blanchet@33192
    73
val base_mixfix = "_\<^bsub>base\<^esub>"
blanchet@33192
    74
val step_mixfix = "_\<^bsub>step\<^esub>"
blanchet@33192
    75
val abs_mixfix = "\<guillemotleft>_\<guillemotright>"
blanchet@35718
    76
val arg_var_prefix = "x"
blanchet@35179
    77
val cyclic_co_val_name = "\<omega>"
blanchet@35188
    78
val cyclic_const_prefix = "\<xi>"
blanchet@35188
    79
val cyclic_type_name = nitpick_prefix ^ cyclic_const_prefix
blanchet@34982
    80
val opt_flag = nitpick_prefix ^ "opt"
blanchet@34982
    81
val non_opt_flag = nitpick_prefix ^ "non_opt"
blanchet@33192
    82
blanchet@35076
    83
type atom_pool = ((string * int) * int list) list
blanchet@35076
    84
blanchet@35718
    85
(* Proof.context -> ((string * string) * (string * string)) * Proof.context *)
blanchet@35718
    86
fun add_wacky_syntax ctxt =
blanchet@35718
    87
  let
blanchet@35718
    88
    (* term -> string *)
blanchet@35718
    89
    val name_of = fst o dest_Const
blanchet@35718
    90
    val thy = ProofContext.theory_of ctxt |> Context.reject_draft
blanchet@35718
    91
    val (maybe_t, thy) =
blanchet@35718
    92
      Sign.declare_const ((@{binding nitpick_maybe}, @{typ "'a => 'a"}),
blanchet@35718
    93
                          Mixfix (maybe_mixfix, [1000], 1000)) thy
blanchet@35718
    94
    val (abs_t, thy) =
blanchet@35718
    95
      Sign.declare_const ((@{binding nitpick_abs}, @{typ "'a => 'b"}),
blanchet@35718
    96
                          Mixfix (abs_mixfix, [40], 40)) thy
blanchet@35718
    97
    val (base_t, thy) =
blanchet@35718
    98
      Sign.declare_const ((@{binding nitpick_base}, @{typ "'a => 'a"}),
blanchet@35718
    99
                          Mixfix (base_mixfix, [1000], 1000)) thy
blanchet@35718
   100
    val (step_t, thy) =
blanchet@35718
   101
      Sign.declare_const ((@{binding nitpick_step}, @{typ "'a => 'a"}),
blanchet@35718
   102
                          Mixfix (step_mixfix, [1000], 1000)) thy
blanchet@35718
   103
  in
blanchet@35718
   104
    (pairself (pairself name_of) ((maybe_t, abs_t), (base_t, step_t)),
blanchet@35718
   105
     ProofContext.transfer_syntax thy ctxt)
blanchet@35718
   106
  end
blanchet@35718
   107
blanchet@35718
   108
(** Term reconstruction **)
blanchet@35718
   109
blanchet@35076
   110
(* atom_pool Unsynchronized.ref -> string -> int -> int -> string *)
blanchet@35076
   111
fun nth_atom_suffix pool s j k =
blanchet@35076
   112
  (case AList.lookup (op =) (!pool) (s, k) of
blanchet@35076
   113
     SOME js =>
blanchet@35076
   114
     (case find_index (curry (op =) j) js of
blanchet@35076
   115
        ~1 => (Unsynchronized.change pool (cons ((s, k), j :: js));
blanchet@35076
   116
               length js + 1)
blanchet@35076
   117
      | n => length js - n)
blanchet@35076
   118
   | NONE => (Unsynchronized.change pool (cons ((s, k), [j])); 1))
blanchet@35076
   119
  |> nat_subscript
blanchet@33884
   120
  |> (s <> "" andalso Symbol.is_ascii_digit (List.last (explode s)))
blanchet@33884
   121
     ? prefix "\<^isub>,"
blanchet@35076
   122
(* atom_pool Unsynchronized.ref -> string -> typ -> int -> int -> string *)
blanchet@35280
   123
fun nth_atom_name pool prefix (Type (s, _)) j k =
blanchet@34982
   124
    let val s' = shortest_name s in
blanchet@34982
   125
      prefix ^ (if String.isPrefix "\\" s' then s' else substring (s', 0, 1)) ^
blanchet@35076
   126
      nth_atom_suffix pool s j k
blanchet@34982
   127
    end
blanchet@35280
   128
  | nth_atom_name pool prefix (TFree (s, _)) j k =
blanchet@35076
   129
    prefix ^ perhaps (try (unprefix "'")) s ^ nth_atom_suffix pool s j k
blanchet@35076
   130
  | nth_atom_name _ _ T _ _ =
blanchet@35076
   131
    raise TYPE ("Nitpick_Model.nth_atom_name", [T], [])
blanchet@35076
   132
(* atom_pool Unsynchronized.ref -> bool -> typ -> int -> int -> term *)
blanchet@35076
   133
fun nth_atom pool for_auto T j k =
blanchet@33192
   134
  if for_auto then
blanchet@35076
   135
    Free (nth_atom_name pool (hd (space_explode "." nitpick_prefix)) T j k, T)
blanchet@33192
   136
  else
blanchet@35076
   137
    Const (nth_atom_name pool "" T j k, T)
blanchet@33192
   138
blanchet@34126
   139
(* term -> real *)
blanchet@35177
   140
fun extract_real_number (Const (@{const_name divide}, _) $ t1 $ t2) =
blanchet@34126
   141
    real (snd (HOLogic.dest_number t1)) / real (snd (HOLogic.dest_number t2))
blanchet@34126
   142
  | extract_real_number t = real (snd (HOLogic.dest_number t))
blanchet@34124
   143
(* term * term -> order *)
blanchet@34124
   144
fun nice_term_ord (Abs (_, _, t1), Abs (_, _, t2)) = nice_term_ord (t1, t2)
blanchet@34126
   145
  | nice_term_ord tp = Real.compare (pairself extract_real_number tp)
blanchet@34124
   146
    handle TERM ("dest_number", _) =>
blanchet@34126
   147
           case tp of
blanchet@34124
   148
             (t11 $ t12, t21 $ t22) =>
blanchet@34124
   149
             (case nice_term_ord (t11, t21) of
blanchet@34124
   150
                EQUAL => nice_term_ord (t12, t22)
blanchet@34124
   151
              | ord => ord)
wenzelm@35408
   152
           | _ => Term_Ord.fast_term_ord tp
blanchet@34124
   153
blanchet@35711
   154
(* typ -> term_postprocessor -> theory -> theory *)
blanchet@35711
   155
fun register_term_postprocessor T p = Data.map (cons (T, p))
blanchet@35711
   156
(* typ -> theory -> theory *)
blanchet@35711
   157
fun unregister_term_postprocessor T = Data.map (AList.delete (op =) T)
blanchet@35711
   158
blanchet@34126
   159
(* nut NameTable.table -> KK.raw_bound list -> nut -> int list list *)
blanchet@33192
   160
fun tuple_list_for_name rel_table bounds name =
blanchet@33192
   161
  the (AList.lookup (op =) bounds (the_rel rel_table name)) handle NUT _ => [[]]
blanchet@33192
   162
blanchet@33192
   163
(* term -> term *)
blanchet@35665
   164
fun unarize_unbox_etc_term (Const (@{const_name FinFun}, _) $ t1) =
blanchet@35665
   165
    unarize_unbox_etc_term t1
blanchet@35665
   166
  | unarize_unbox_etc_term (Const (@{const_name FunBox}, _) $ t1) =
blanchet@35665
   167
    unarize_unbox_etc_term t1
blanchet@35665
   168
  | unarize_unbox_etc_term
blanchet@35665
   169
        (Const (@{const_name PairBox},
blanchet@35665
   170
                Type (@{type_name fun}, [T1, Type (@{type_name fun}, [T2, _])]))
blanchet@35665
   171
         $ t1 $ t2) =
blanchet@35665
   172
    let val Ts = map uniterize_unarize_unbox_etc_type [T1, T2] in
blanchet@35665
   173
      Const (@{const_name Pair}, Ts ---> Type (@{type_name "*"}, Ts))
blanchet@35665
   174
      $ unarize_unbox_etc_term t1 $ unarize_unbox_etc_term t2
blanchet@33192
   175
    end
blanchet@35665
   176
  | unarize_unbox_etc_term (Const (s, T)) =
blanchet@35665
   177
    Const (s, uniterize_unarize_unbox_etc_type T)
blanchet@35665
   178
  | unarize_unbox_etc_term (t1 $ t2) =
blanchet@35665
   179
    unarize_unbox_etc_term t1 $ unarize_unbox_etc_term t2
blanchet@35665
   180
  | unarize_unbox_etc_term (Free (s, T)) =
blanchet@35665
   181
    Free (s, uniterize_unarize_unbox_etc_type T)
blanchet@35665
   182
  | unarize_unbox_etc_term (Var (x, T)) =
blanchet@35665
   183
    Var (x, uniterize_unarize_unbox_etc_type T)
blanchet@35665
   184
  | unarize_unbox_etc_term (Bound j) = Bound j
blanchet@35665
   185
  | unarize_unbox_etc_term (Abs (s, T, t')) =
blanchet@35665
   186
    Abs (s, uniterize_unarize_unbox_etc_type T, unarize_unbox_etc_term t')
blanchet@33192
   187
blanchet@33192
   188
(* typ -> typ -> (typ * typ) * (typ * typ) *)
blanchet@35665
   189
fun factor_out_types (T1 as Type (@{type_name "*"}, [T11, T12]))
blanchet@35665
   190
                     (T2 as Type (@{type_name "*"}, [T21, T22])) =
blanchet@33192
   191
    let val (n1, n2) = pairself num_factors_in_type (T11, T21) in
blanchet@33192
   192
      if n1 = n2 then
blanchet@33192
   193
        let
blanchet@33192
   194
          val ((T11', opt_T12'), (T21', opt_T22')) = factor_out_types T12 T22
blanchet@33192
   195
        in
blanchet@35665
   196
          ((Type (@{type_name "*"}, [T11, T11']), opt_T12'),
blanchet@35665
   197
           (Type (@{type_name "*"}, [T21, T21']), opt_T22'))
blanchet@33192
   198
        end
blanchet@33192
   199
      else if n1 < n2 then
blanchet@33192
   200
        case factor_out_types T1 T21 of
blanchet@33192
   201
          (p1, (T21', NONE)) => (p1, (T21', SOME T22))
blanchet@33192
   202
        | (p1, (T21', SOME T22')) =>
blanchet@35665
   203
          (p1, (T21', SOME (Type (@{type_name "*"}, [T22', T22]))))
blanchet@33192
   204
      else
blanchet@33192
   205
        swap (factor_out_types T2 T1)
blanchet@33192
   206
    end
blanchet@35665
   207
  | factor_out_types (Type (@{type_name "*"}, [T11, T12])) T2 =
blanchet@35665
   208
    ((T11, SOME T12), (T2, NONE))
blanchet@35665
   209
  | factor_out_types T1 (Type (@{type_name "*"}, [T21, T22])) =
blanchet@35665
   210
    ((T1, NONE), (T21, SOME T22))
blanchet@33192
   211
  | factor_out_types T1 T2 = ((T1, NONE), (T2, NONE))
blanchet@33192
   212
blanchet@33192
   213
(* bool -> typ -> typ -> (term * term) list -> term *)
blanchet@33192
   214
fun make_plain_fun maybe_opt T1 T2 =
blanchet@33192
   215
  let
blanchet@33192
   216
    (* typ -> typ -> (term * term) list -> term *)
blanchet@33192
   217
    fun aux T1 T2 [] =
blanchet@34982
   218
        Const (if maybe_opt then opt_flag else non_opt_flag, T1 --> T2)
blanchet@35712
   219
      | aux T1 T2 ((t1, t2) :: tps) =
blanchet@34124
   220
        Const (@{const_name fun_upd}, (T1 --> T2) --> T1 --> T2 --> T1 --> T2)
blanchet@35712
   221
        $ aux T1 T2 tps $ t1 $ t2
blanchet@33192
   222
  in aux T1 T2 o rev end
blanchet@33192
   223
(* term -> bool *)
blanchet@34982
   224
fun is_plain_fun (Const (s, _)) = (s = opt_flag orelse s = non_opt_flag)
blanchet@33192
   225
  | is_plain_fun (Const (@{const_name fun_upd}, _) $ t0 $ _ $ _) =
blanchet@33192
   226
    is_plain_fun t0
blanchet@33192
   227
  | is_plain_fun _ = false
blanchet@33192
   228
(* term -> bool * (term list * term list) *)
blanchet@33192
   229
val dest_plain_fun =
blanchet@33192
   230
  let
blanchet@34982
   231
    (* term -> bool * (term list * term list) *)
blanchet@35712
   232
    fun aux (Abs (_, _, Const (s, _))) = (s <> irrelevant, ([], []))
blanchet@35712
   233
      | aux (Const (s, _)) = (s <> non_opt_flag, ([], []))
blanchet@33192
   234
      | aux (Const (@{const_name fun_upd}, _) $ t0 $ t1 $ t2) =
blanchet@35712
   235
        let val (maybe_opt, (ts1, ts2)) = aux t0 in
blanchet@35712
   236
          (maybe_opt, (t1 :: ts1, t2 :: ts2))
blanchet@35712
   237
        end
blanchet@33232
   238
      | aux t = raise TERM ("Nitpick_Model.dest_plain_fun", [t])
blanchet@33192
   239
  in apsnd (pairself rev) o aux end
blanchet@33192
   240
blanchet@33565
   241
(* typ -> typ -> typ -> term -> term * term *)
blanchet@33565
   242
fun break_in_two T T1 T2 t =
blanchet@33565
   243
  let
blanchet@33565
   244
    val ps = HOLogic.flat_tupleT_paths T
blanchet@33565
   245
    val cut = length (HOLogic.strip_tupleT T1)
blanchet@33565
   246
    val (ps1, ps2) = pairself HOLogic.flat_tupleT_paths (T1, T2)
blanchet@33565
   247
    val (ts1, ts2) = t |> HOLogic.strip_ptuple ps |> chop cut
blanchet@33565
   248
  in (HOLogic.mk_ptuple ps1 T1 ts1, HOLogic.mk_ptuple ps2 T2 ts2) end
blanchet@33192
   249
(* typ -> term -> term -> term *)
blanchet@35665
   250
fun pair_up (Type (@{type_name "*"}, [T1', T2']))
blanchet@33192
   251
            (t1 as Const (@{const_name Pair},
blanchet@35665
   252
                          Type (@{type_name fun},
blanchet@35665
   253
                                [_, Type (@{type_name fun}, [_, T1])]))
blanchet@35665
   254
             $ t11 $ t12) t2 =
blanchet@33192
   255
    if T1 = T1' then HOLogic.mk_prod (t1, t2)
blanchet@33192
   256
    else HOLogic.mk_prod (t11, pair_up T2' t12 t2)
blanchet@33192
   257
  | pair_up _ t1 t2 = HOLogic.mk_prod (t1, t2)
blanchet@33192
   258
(* typ -> term -> term list * term list -> (term * term) list*)
blanchet@33192
   259
fun multi_pair_up T1 t1 (ts2, ts3) = map2 (pair o pair_up T1 t1) ts2 ts3
blanchet@33192
   260
blanchet@33192
   261
(* typ -> typ -> typ -> term -> term *)
blanchet@35665
   262
fun typecast_fun (Type (@{type_name fun}, [T1', T2'])) T1 T2 t =
blanchet@33192
   263
    let
blanchet@33565
   264
      (* typ -> typ -> typ -> typ -> term -> term *)
blanchet@33565
   265
      fun do_curry T1 T1a T1b T2 t =
blanchet@33192
   266
        let
blanchet@35712
   267
          val (maybe_opt, tsp) = dest_plain_fun t
blanchet@35712
   268
          val tps =
blanchet@35712
   269
            tsp |>> map (break_in_two T1 T1a T1b)
blanchet@35712
   270
                |> uncurry (map2 (fn (t1a, t1b) => fn t2 => (t1a, (t1b, t2))))
blanchet@35712
   271
                |> AList.coalesce (op =)
blanchet@35712
   272
                |> map (apsnd (make_plain_fun maybe_opt T1b T2))
blanchet@35712
   273
        in make_plain_fun maybe_opt T1a (T1b --> T2) tps end
blanchet@33192
   274
      (* typ -> typ -> term -> term *)
blanchet@33192
   275
      and do_uncurry T1 T2 t =
blanchet@33192
   276
        let
blanchet@33192
   277
          val (maybe_opt, tsp) = dest_plain_fun t
blanchet@35712
   278
          val tps =
blanchet@33192
   279
            tsp |> op ~~
blanchet@33192
   280
                |> maps (fn (t1, t2) =>
blanchet@33192
   281
                            multi_pair_up T1 t1 (snd (dest_plain_fun t2)))
blanchet@35712
   282
        in make_plain_fun maybe_opt T1 T2 tps end
blanchet@33192
   283
      (* typ -> typ -> typ -> typ -> term -> term *)
blanchet@33192
   284
      and do_arrow T1' T2' _ _ (Const (s, _)) = Const (s, T1' --> T2')
blanchet@33192
   285
        | do_arrow T1' T2' T1 T2
blanchet@33192
   286
                   (Const (@{const_name fun_upd}, _) $ t0 $ t1 $ t2) =
blanchet@33192
   287
          Const (@{const_name fun_upd},
blanchet@34124
   288
                 (T1' --> T2') --> T1' --> T2' --> T1' --> T2')
blanchet@33192
   289
          $ do_arrow T1' T2' T1 T2 t0 $ do_term T1' T1 t1 $ do_term T2' T2 t2
blanchet@33192
   290
        | do_arrow _ _ _ _ t =
blanchet@33232
   291
          raise TERM ("Nitpick_Model.typecast_fun.do_arrow", [t])
blanchet@33192
   292
      and do_fun T1' T2' T1 T2 t =
blanchet@33192
   293
        case factor_out_types T1' T1 of
blanchet@33192
   294
          ((_, NONE), (_, NONE)) => t |> do_arrow T1' T2' T1 T2
blanchet@33192
   295
        | ((_, NONE), (T1a, SOME T1b)) =>
blanchet@33565
   296
          t |> do_curry T1 T1a T1b T2 |> do_arrow T1' T2' T1a (T1b --> T2)
blanchet@33192
   297
        | ((T1a', SOME T1b'), (_, NONE)) =>
blanchet@33192
   298
          t |> do_arrow T1a' (T1b' --> T2') T1 T2 |> do_uncurry T1' T2'
blanchet@33232
   299
        | _ => raise TYPE ("Nitpick_Model.typecast_fun.do_fun", [T1, T1'], [])
blanchet@33192
   300
      (* typ -> typ -> term -> term *)
blanchet@35665
   301
      and do_term (Type (@{type_name fun}, [T1', T2']))
blanchet@35665
   302
                  (Type (@{type_name fun}, [T1, T2])) t =
blanchet@33192
   303
          do_fun T1' T2' T1 T2 t
blanchet@35665
   304
        | do_term (T' as Type (@{type_name "*"}, Ts' as [T1', T2']))
blanchet@35665
   305
                  (Type (@{type_name "*"}, [T1, T2]))
blanchet@33192
   306
                  (Const (@{const_name Pair}, _) $ t1 $ t2) =
blanchet@33192
   307
          Const (@{const_name Pair}, Ts' ---> T')
blanchet@33192
   308
          $ do_term T1' T1 t1 $ do_term T2' T2 t2
blanchet@33192
   309
        | do_term T' T t =
blanchet@33192
   310
          if T = T' then t
blanchet@33232
   311
          else raise TYPE ("Nitpick_Model.typecast_fun.do_term", [T, T'], [])
blanchet@33192
   312
    in if T1' = T1 andalso T2' = T2 then t else do_fun T1' T2' T1 T2 t end
blanchet@34998
   313
  | typecast_fun T' _ _ _ =
blanchet@34998
   314
    raise TYPE ("Nitpick_Model.typecast_fun", [T'], [])
blanchet@33192
   315
blanchet@33192
   316
(* term -> string *)
blanchet@33192
   317
fun truth_const_sort_key @{const True} = "0"
blanchet@33192
   318
  | truth_const_sort_key @{const False} = "2"
blanchet@33192
   319
  | truth_const_sort_key _ = "1"
blanchet@33192
   320
blanchet@33192
   321
(* typ -> term list -> term *)
blanchet@35665
   322
fun mk_tuple (Type (@{type_name "*"}, [T1, T2])) ts =
blanchet@33192
   323
    HOLogic.mk_prod (mk_tuple T1 ts,
blanchet@33192
   324
        mk_tuple T2 (List.drop (ts, length (HOLogic.flatten_tupleT T1))))
blanchet@33192
   325
  | mk_tuple _ (t :: _) = t
blanchet@34124
   326
  | mk_tuple T [] = raise TYPE ("Nitpick_Model.mk_tuple", [T], [])
blanchet@33192
   327
blanchet@35711
   328
(* theory -> typ * typ -> bool *)
blanchet@35711
   329
fun varified_type_match thy (candid_T, pat_T) =
wenzelm@35845
   330
  strict_type_match thy (candid_T, Logic.varifyT_global pat_T)
blanchet@35711
   331
blanchet@35712
   332
(* atom_pool -> (string * string) * (string * string) -> scope -> nut list
blanchet@35712
   333
   -> nut list -> nut list -> nut NameTable.table -> KK.raw_bound list -> typ
blanchet@35712
   334
   -> term list *)
blanchet@35712
   335
fun all_values_of_type pool wacky_names (scope as {card_assigns, ...} : scope)
blanchet@35712
   336
                       sel_names rel_table bounds card T =
blanchet@35712
   337
  let
blanchet@35712
   338
    val card = if card = 0 then card_of_type card_assigns T else card
blanchet@35712
   339
    (* nat -> term *)
blanchet@35712
   340
    fun nth_value_of_type n =
blanchet@35712
   341
      let
blanchet@35712
   342
        (* bool -> term *)
blanchet@35712
   343
        fun term unfold =
blanchet@35712
   344
          reconstruct_term unfold pool wacky_names scope sel_names rel_table
blanchet@35712
   345
                           bounds T T (Atom (card, 0)) [[n]]
blanchet@35712
   346
      in
blanchet@35712
   347
        case term false of
blanchet@35712
   348
          t as Const (s, _) =>
blanchet@35712
   349
          if String.isPrefix cyclic_const_prefix s then
blanchet@35712
   350
            HOLogic.mk_eq (t, term true)
blanchet@35712
   351
          else
blanchet@35712
   352
            t
blanchet@35712
   353
        | t => t
blanchet@35712
   354
      end
blanchet@35712
   355
  in index_seq 0 card |> map nth_value_of_type |> sort nice_term_ord end
blanchet@35280
   356
(* bool -> atom_pool -> (string * string) * (string * string) -> scope
blanchet@35280
   357
   -> nut list -> nut list -> nut list -> nut NameTable.table
blanchet@35280
   358
   -> KK.raw_bound list -> typ -> typ -> rep -> int list list -> term *)
blanchet@35712
   359
and reconstruct_term unfold pool (wacky_names as ((maybe_name, abs_name), _))
blanchet@35712
   360
        (scope as {hol_ctxt as {ctxt, thy, stds, ...}, binarize, card_assigns,
blanchet@35712
   361
                   bits, datatypes, ofs, ...}) sel_names rel_table bounds =
blanchet@33192
   362
  let
blanchet@33192
   363
    val for_auto = (maybe_name = "")
blanchet@34124
   364
    (* int list list -> int *)
blanchet@34124
   365
    fun value_of_bits jss =
blanchet@34124
   366
      let
blanchet@34124
   367
        val j0 = offset_of_type ofs @{typ unsigned_bit}
blanchet@34124
   368
        val js = map (Integer.add (~ j0) o the_single) jss
blanchet@34124
   369
      in
blanchet@34124
   370
        fold (fn j => Integer.add (reasonable_power 2 j |> j = bits ? op ~))
blanchet@34124
   371
             js 0
blanchet@34124
   372
      end
blanchet@35712
   373
    (* typ -> term list *)
blanchet@35712
   374
    val all_values =
blanchet@35712
   375
      all_values_of_type pool wacky_names scope sel_names rel_table bounds 0
blanchet@35712
   376
    (* typ -> term -> term *)
blanchet@35712
   377
    fun postprocess_term (Type (@{type_name fun}, _)) = I
blanchet@35712
   378
      | postprocess_term T =
blanchet@35712
   379
        if null (Data.get thy) then
blanchet@35712
   380
          I
blanchet@35712
   381
        else case AList.lookup (varified_type_match thy) (Data.get thy) T of
blanchet@35712
   382
          SOME postproc => postproc ctxt maybe_name all_values T
blanchet@35712
   383
        | NONE => I
blanchet@35712
   384
    (* typ list -> term -> term *)
blanchet@35712
   385
    fun postprocess_subterms Ts (t1 $ t2) =
blanchet@35712
   386
        let val t = postprocess_subterms Ts t1 $ postprocess_subterms Ts t2 in
blanchet@35712
   387
          postprocess_term (fastype_of1 (Ts, t)) t
blanchet@35712
   388
        end
blanchet@35712
   389
      | postprocess_subterms Ts (Abs (s, T, t')) =
blanchet@35712
   390
        Abs (s, T, postprocess_subterms (T :: Ts) t')
blanchet@35712
   391
      | postprocess_subterms Ts t = postprocess_term (fastype_of1 (Ts, t)) t
blanchet@33192
   392
    (* bool -> typ -> typ -> (term * term) list -> term *)
blanchet@35388
   393
    fun make_set maybe_opt T1 T2 tps =
blanchet@33192
   394
      let
wenzelm@35402
   395
        val empty_const = Const (@{const_abbrev Set.empty}, T1 --> T2)
blanchet@33192
   396
        val insert_const = Const (@{const_name insert},
blanchet@34124
   397
                                  T1 --> (T1 --> T2) --> T1 --> T2)
blanchet@33192
   398
        (* (term * term) list -> term *)
blanchet@33192
   399
        fun aux [] =
blanchet@35385
   400
            if maybe_opt andalso not (is_complete_type datatypes false T1) then
blanchet@33192
   401
              insert_const $ Const (unrep, T1) $ empty_const
blanchet@33192
   402
            else
blanchet@33192
   403
              empty_const
blanchet@33192
   404
          | aux ((t1, t2) :: zs) =
blanchet@35388
   405
            aux zs
blanchet@35388
   406
            |> t2 <> @{const False}
blanchet@35388
   407
               ? curry (op $)
blanchet@35388
   408
                       (insert_const
blanchet@35388
   409
                        $ (t1 |> t2 <> @{const True}
blanchet@35388
   410
                                 ? curry (op $)
blanchet@35388
   411
                                         (Const (maybe_name, T1 --> T1))))
blanchet@35388
   412
      in
blanchet@35388
   413
        if forall (fn (_, t) => t <> @{const True} andalso t <> @{const False})
blanchet@35388
   414
                  tps then
blanchet@35388
   415
          Const (unknown, T1 --> T2)
blanchet@35388
   416
        else
blanchet@35388
   417
          aux tps
blanchet@35388
   418
      end
blanchet@35665
   419
    (* bool -> typ -> typ -> typ -> (term * term) list -> term *)
blanchet@35665
   420
    fun make_map maybe_opt T1 T2 T2' =
blanchet@33192
   421
      let
blanchet@33192
   422
        val update_const = Const (@{const_name fun_upd},
blanchet@34124
   423
                                  (T1 --> T2) --> T1 --> T2 --> T1 --> T2)
blanchet@33192
   424
        (* (term * term) list -> term *)
wenzelm@35402
   425
        fun aux' [] = Const (@{const_abbrev Map.empty}, T1 --> T2)
blanchet@35712
   426
          | aux' ((t1, t2) :: tps) =
blanchet@33192
   427
            (case t2 of
blanchet@35712
   428
               Const (@{const_name None}, _) => aux' tps
blanchet@35712
   429
             | _ => update_const $ aux' tps $ t1 $ t2)
blanchet@35712
   430
        fun aux tps =
blanchet@35665
   431
          if maybe_opt andalso not (is_complete_type datatypes false T1) then
blanchet@35712
   432
            update_const $ aux' tps $ Const (unrep, T1)
blanchet@33192
   433
            $ (Const (@{const_name Some}, T2' --> T2) $ Const (unknown, T2'))
blanchet@33192
   434
          else
blanchet@35712
   435
            aux' tps
blanchet@33192
   436
      in aux end
blanchet@33192
   437
    (* typ list -> term -> term *)
blanchet@34982
   438
    fun polish_funs Ts t =
blanchet@33192
   439
      (case fastype_of1 (Ts, t) of
blanchet@35665
   440
         Type (@{type_name fun}, [T1, T2]) =>
blanchet@33192
   441
         if is_plain_fun t then
blanchet@33192
   442
           case T2 of
blanchet@33192
   443
             @{typ bool} =>
blanchet@33192
   444
             let
blanchet@33192
   445
               val (maybe_opt, ts_pair) =
blanchet@34982
   446
                 dest_plain_fun t ||> pairself (map (polish_funs Ts))
blanchet@33192
   447
             in
blanchet@33192
   448
               make_set maybe_opt T1 T2
blanchet@33192
   449
                        (sort_wrt (truth_const_sort_key o snd) (op ~~ ts_pair))
blanchet@33192
   450
             end
blanchet@33192
   451
           | Type (@{type_name option}, [T2']) =>
blanchet@33192
   452
             let
blanchet@35665
   453
               val (maybe_opt, ts_pair) =
blanchet@35665
   454
                 dest_plain_fun t ||> pairself (map (polish_funs Ts))
blanchet@35665
   455
             in make_map maybe_opt T1 T2 T2' (rev (op ~~ ts_pair)) end
blanchet@33192
   456
           | _ => raise SAME ()
blanchet@33192
   457
         else
blanchet@33192
   458
           raise SAME ()
blanchet@33192
   459
       | _ => raise SAME ())
blanchet@33192
   460
      handle SAME () =>
blanchet@33192
   461
             case t of
blanchet@34982
   462
               (t1 as Const (@{const_name fun_upd}, _) $ t11 $ _)
blanchet@34982
   463
               $ (t2 as Const (s, _)) =>
blanchet@34982
   464
               if s = unknown then polish_funs Ts t11
blanchet@34982
   465
               else polish_funs Ts t1 $ polish_funs Ts t2
blanchet@34982
   466
             | t1 $ t2 => polish_funs Ts t1 $ polish_funs Ts t2
blanchet@34982
   467
             | Abs (s, T, t') => Abs (s, T, polish_funs (T :: Ts) t')
blanchet@35665
   468
             | Const (s, Type (@{type_name fun}, [T1, T2])) =>
blanchet@34982
   469
               if s = opt_flag orelse s = non_opt_flag then
blanchet@35712
   470
                 Abs ("x", T1,
blanchet@35712
   471
                      Const (if is_complete_type datatypes false T1 then
blanchet@35712
   472
                               irrelevant
blanchet@35712
   473
                             else
blanchet@35712
   474
                               unknown, T2))
blanchet@34982
   475
               else
blanchet@34982
   476
                 t
blanchet@34982
   477
             | t => t
blanchet@33192
   478
    (* bool -> typ -> typ -> typ -> term list -> term list -> term *)
blanchet@33192
   479
    fun make_fun maybe_opt T1 T2 T' ts1 ts2 =
blanchet@34126
   480
      ts1 ~~ ts2 |> sort (nice_term_ord o pairself fst)
blanchet@34998
   481
                 |> make_plain_fun maybe_opt T1 T2
blanchet@35665
   482
                 |> unarize_unbox_etc_term
blanchet@35665
   483
                 |> typecast_fun (uniterize_unarize_unbox_etc_type T')
blanchet@35665
   484
                                 (uniterize_unarize_unbox_etc_type T1)
blanchet@35665
   485
                                 (uniterize_unarize_unbox_etc_type T2)
blanchet@33192
   486
    (* (typ * int) list -> typ -> typ -> int -> term *)
blanchet@35665
   487
    fun term_for_atom seen (T as Type (@{type_name fun}, [T1, T2])) T' j _ =
blanchet@33192
   488
        let
blanchet@33192
   489
          val k1 = card_of_type card_assigns T1
blanchet@33192
   490
          val k2 = card_of_type card_assigns T2
blanchet@33192
   491
        in
blanchet@35665
   492
          term_for_rep true seen T T' (Vect (k1, Atom (k2, 0)))
blanchet@33192
   493
                       [nth_combination (replicate k1 (k2, 0)) j]
blanchet@33192
   494
          handle General.Subscript =>
blanchet@33232
   495
                 raise ARG ("Nitpick_Model.reconstruct_term.term_for_atom",
blanchet@33192
   496
                            signed_string_of_int j ^ " for " ^
blanchet@33192
   497
                            string_for_rep (Vect (k1, Atom (k2, 0))))
blanchet@33192
   498
        end
blanchet@35665
   499
      | term_for_atom seen (Type (@{type_name "*"}, [T1, T2])) _ j k =
blanchet@35075
   500
        let
blanchet@35075
   501
          val k1 = card_of_type card_assigns T1
blanchet@35075
   502
          val k2 = k div k1
blanchet@35075
   503
        in
blanchet@33192
   504
          list_comb (HOLogic.pair_const T1 T2,
blanchet@35075
   505
                     map3 (fn T => term_for_atom seen T T) [T1, T2]
blanchet@35075
   506
                          [j div k2, j mod k2] [k1, k2]) (* ### k2 or k1? FIXME *)
blanchet@33192
   507
        end
blanchet@35075
   508
      | term_for_atom seen @{typ prop} _ j k =
blanchet@35075
   509
        HOLogic.mk_Trueprop (term_for_atom seen bool_T bool_T j k)
blanchet@35075
   510
      | term_for_atom _ @{typ bool} _ j _ =
blanchet@33192
   511
        if j = 0 then @{const False} else @{const True}
blanchet@35075
   512
      | term_for_atom _ @{typ unit} _ _ _ = @{const Unity}
blanchet@35075
   513
      | term_for_atom seen T _ j k =
blanchet@35220
   514
        if T = nat_T andalso is_standard_datatype thy stds nat_T then
blanchet@33192
   515
          HOLogic.mk_number nat_T j
blanchet@33192
   516
        else if T = int_T then
blanchet@35075
   517
          HOLogic.mk_number int_T (int_for_atom (k, 0) j)
blanchet@33192
   518
        else if is_fp_iterator_type T then
blanchet@35075
   519
          HOLogic.mk_number nat_T (k - j - 1)
blanchet@33192
   520
        else if T = @{typ bisim_iterator} then
blanchet@33192
   521
          HOLogic.mk_number nat_T j
blanchet@33192
   522
        else case datatype_spec datatypes T of
blanchet@35076
   523
          NONE => nth_atom pool for_auto T j k
blanchet@35076
   524
        | SOME {deep = false, ...} => nth_atom pool for_auto T j k
blanchet@35179
   525
        | SOME {co, standard, constrs, ...} =>
blanchet@33192
   526
          let
blanchet@33192
   527
            (* styp -> int list *)
blanchet@33192
   528
            fun tuples_for_const (s, T) =
blanchet@33192
   529
              tuple_list_for_name rel_table bounds (ConstName (s, T, Any))
blanchet@35180
   530
            (* unit -> term *)
blanchet@35180
   531
            fun cyclic_atom () =
blanchet@35180
   532
              nth_atom pool for_auto (Type (cyclic_type_name, [])) j k
blanchet@35180
   533
            fun cyclic_var () = Var ((nth_atom_name pool "" T j k, 0), T)
blanchet@35180
   534
blanchet@33192
   535
            val discr_jsss = map (tuples_for_const o discr_for_constr o #const)
blanchet@33192
   536
                                 constrs
blanchet@33192
   537
            val real_j = j + offset_of_type ofs T
blanchet@33192
   538
            val constr_x as (constr_s, constr_T) =
blanchet@33192
   539
              get_first (fn (jss, {const, ...}) =>
blanchet@34121
   540
                            if member (op =) jss [real_j] then SOME const
blanchet@34121
   541
                            else NONE)
blanchet@33192
   542
                        (discr_jsss ~~ constrs) |> the
blanchet@33192
   543
            val arg_Ts = curried_binder_types constr_T
blanchet@35190
   544
            val sel_xs =
blanchet@35190
   545
              map (binarized_and_boxed_nth_sel_for_constr hol_ctxt binarize
blanchet@35190
   546
                                                          constr_x)
blanchet@35190
   547
                  (index_seq 0 (length arg_Ts))
blanchet@33192
   548
            val sel_Rs =
blanchet@33192
   549
              map (fn x => get_first
blanchet@33192
   550
                               (fn ConstName (s', T', R) =>
blanchet@33192
   551
                                   if (s', T') = x then SOME R else NONE
blanchet@33232
   552
                                 | u => raise NUT ("Nitpick_Model.reconstruct_\
blanchet@33192
   553
                                                   \term.term_for_atom", [u]))
blanchet@33192
   554
                               sel_names |> the) sel_xs
blanchet@33192
   555
            val arg_Rs = map (snd o dest_Func) sel_Rs
blanchet@33192
   556
            val sel_jsss = map tuples_for_const sel_xs
blanchet@33192
   557
            val arg_jsss =
blanchet@33192
   558
              map (map_filter (fn js => if hd js = real_j then SOME (tl js)
blanchet@33192
   559
                                        else NONE)) sel_jsss
blanchet@33192
   560
            val uncur_arg_Ts = binder_types constr_T
blanchet@35179
   561
            val maybe_cyclic = co orelse not standard
blanchet@33192
   562
          in
blanchet@35180
   563
            if maybe_cyclic andalso not (null seen) andalso
blanchet@35188
   564
               member (op =) (seen |> unfold ? (fst o split_last)) (T, j) then
blanchet@35180
   565
              cyclic_var ()
blanchet@34124
   566
            else if constr_s = @{const_name Word} then
blanchet@34124
   567
              HOLogic.mk_number
blanchet@34124
   568
                  (if T = @{typ "unsigned_bit word"} then nat_T else int_T)
blanchet@34124
   569
                  (value_of_bits (the_single arg_jsss))
blanchet@33192
   570
            else
blanchet@33192
   571
              let
blanchet@35179
   572
                val seen = seen |> maybe_cyclic ? cons (T, j)
blanchet@33192
   573
                val ts =
blanchet@33192
   574
                  if length arg_Ts = 0 then
blanchet@33192
   575
                    []
blanchet@33192
   576
                  else
blanchet@35665
   577
                    map3 (fn Ts =>
blanchet@35665
   578
                             term_for_rep (constr_s <> @{const_name FinFun})
blanchet@35665
   579
                                          seen Ts Ts) arg_Ts arg_Rs arg_jsss
blanchet@33192
   580
                    |> mk_tuple (HOLogic.mk_tupleT uncur_arg_Ts)
blanchet@33192
   581
                    |> dest_n_tuple (length uncur_arg_Ts)
blanchet@33192
   582
                val t =
blanchet@33192
   583
                  if constr_s = @{const_name Abs_Frac} then
blanchet@35711
   584
                    case ts of
blanchet@35711
   585
                      [Const (@{const_name Pair}, _) $ t1 $ t2] =>
blanchet@35711
   586
                      frac_from_term_pair (body_type T) t1 t2
blanchet@35711
   587
                    | _ => raise TERM ("Nitpick_Model.reconstruct_term.\
blanchet@35711
   588
                                       \term_for_atom (Abs_Frac)", ts)
blanchet@34936
   589
                  else if not for_auto andalso
blanchet@34936
   590
                          (is_abs_fun thy constr_x orelse
blanchet@34936
   591
                           constr_s = @{const_name Quot}) then
blanchet@33192
   592
                    Const (abs_name, constr_T) $ the_single ts
blanchet@33192
   593
                  else
blanchet@33192
   594
                    list_comb (Const constr_x, ts)
blanchet@33192
   595
              in
blanchet@35179
   596
                if maybe_cyclic then
blanchet@35180
   597
                  let val var = cyclic_var () in
blanchet@35188
   598
                    if unfold andalso not standard andalso
blanchet@35180
   599
                       length seen = 1 andalso
blanchet@35180
   600
                       exists_subterm (fn Const (s, _) =>
blanchet@35188
   601
                                          String.isPrefix cyclic_const_prefix s
blanchet@35180
   602
                                        | t' => t' = var) t then
blanchet@35188
   603
                      subst_atomic [(var, cyclic_atom ())] t
blanchet@35180
   604
                    else if exists_subterm (curry (op =) var) t then
blanchet@35179
   605
                      if co then
blanchet@35179
   606
                        Const (@{const_name The}, (T --> bool_T) --> T)
blanchet@35179
   607
                        $ Abs (cyclic_co_val_name, T,
blanchet@35179
   608
                               Const (@{const_name "op ="}, T --> T --> bool_T)
blanchet@35180
   609
                               $ Bound 0 $ abstract_over (var, t))
blanchet@35179
   610
                      else
blanchet@35180
   611
                        cyclic_atom ()
blanchet@33192
   612
                    else
blanchet@33192
   613
                      t
blanchet@33192
   614
                  end
blanchet@33192
   615
                else
blanchet@33192
   616
                  t
blanchet@33192
   617
              end
blanchet@33192
   618
          end
blanchet@33192
   619
    (* (typ * int) list -> int -> rep -> typ -> typ -> typ -> int list
blanchet@33192
   620
       -> term *)
blanchet@33192
   621
    and term_for_vect seen k R T1 T2 T' js =
blanchet@35075
   622
      make_fun true T1 T2 T'
blanchet@35075
   623
               (map (fn j => term_for_atom seen T1 T1 j k) (index_seq 0 k))
blanchet@35665
   624
               (map (term_for_rep true seen T2 T2 R o single)
blanchet@33192
   625
                    (batch_list (arity_of_rep R) js))
blanchet@35665
   626
    (* bool -> (typ * int) list -> typ -> typ -> rep -> int list list -> term *)
blanchet@35665
   627
    and term_for_rep _ seen T T' Unit [[]] = term_for_atom seen T T' 0 1
blanchet@35665
   628
      | term_for_rep _ seen T T' (R as Atom (k, j0)) [[j]] =
blanchet@35075
   629
        if j >= j0 andalso j < j0 + k then term_for_atom seen T T' (j - j0) k
blanchet@33232
   630
        else raise REP ("Nitpick_Model.reconstruct_term.term_for_rep", [R])
blanchet@35665
   631
      | term_for_rep _ seen (Type (@{type_name "*"}, [T1, T2])) _
blanchet@35665
   632
                     (Struct [R1, R2]) [js] =
blanchet@33192
   633
        let
blanchet@33192
   634
          val arity1 = arity_of_rep R1
blanchet@33192
   635
          val (js1, js2) = chop arity1 js
blanchet@33192
   636
        in
blanchet@33192
   637
          list_comb (HOLogic.pair_const T1 T2,
blanchet@35665
   638
                     map3 (fn T => term_for_rep true seen T T) [T1, T2] [R1, R2]
blanchet@33192
   639
                          [[js1], [js2]])
blanchet@33192
   640
        end
blanchet@35665
   641
      | term_for_rep _ seen (Type (@{type_name fun}, [T1, T2])) T'
blanchet@35665
   642
                     (Vect (k, R')) [js] =
blanchet@33192
   643
        term_for_vect seen k R' T1 T2 T' js
blanchet@35665
   644
      | term_for_rep _ seen (Type (@{type_name fun}, [T1, T2])) T'
blanchet@35665
   645
                     (Func (R1, Formula Neut)) jss =
blanchet@33192
   646
        let
blanchet@33192
   647
          val jss1 = all_combinations_for_rep R1
blanchet@35665
   648
          val ts1 = map (term_for_rep true seen T1 T1 R1 o single) jss1
blanchet@33192
   649
          val ts2 =
blanchet@35665
   650
            map (fn js => term_for_rep true seen T2 T2 (Atom (2, 0))
blanchet@35385
   651
                                       [[int_from_bool (member (op =) jss js)]])
blanchet@34121
   652
                jss1
blanchet@33192
   653
        in make_fun false T1 T2 T' ts1 ts2 end
blanchet@35665
   654
      | term_for_rep maybe_opt seen (Type (@{type_name fun}, [T1, T2])) T'
blanchet@35665
   655
                     (Func (R1, R2)) jss =
blanchet@33192
   656
        let
blanchet@33192
   657
          val arity1 = arity_of_rep R1
blanchet@33192
   658
          val jss1 = all_combinations_for_rep R1
blanchet@35665
   659
          val ts1 = map (term_for_rep false seen T1 T1 R1 o single) jss1
blanchet@33192
   660
          val grouped_jss2 = AList.group (op =) (map (chop arity1) jss)
blanchet@35665
   661
          val ts2 = map (term_for_rep false seen T2 T2 R2 o the_default []
blanchet@33192
   662
                         o AList.lookup (op =) grouped_jss2) jss1
blanchet@35665
   663
        in make_fun maybe_opt T1 T2 T' ts1 ts2 end
blanchet@35665
   664
      | term_for_rep _ seen T T' (Opt R) jss =
blanchet@35665
   665
        if null jss then Const (unknown, T)
blanchet@35665
   666
        else term_for_rep true seen T T' R jss
blanchet@35665
   667
      | term_for_rep _ _ T _ R jss =
blanchet@33232
   668
        raise ARG ("Nitpick_Model.reconstruct_term.term_for_rep",
blanchet@33192
   669
                   Refute.string_of_typ T ^ " " ^ string_for_rep R ^ " " ^
blanchet@33192
   670
                   string_of_int (length jss))
blanchet@35712
   671
  in
blanchet@35712
   672
    postprocess_subterms [] o polish_funs [] o unarize_unbox_etc_term
blanchet@35712
   673
    oooo term_for_rep true []
blanchet@35712
   674
  end
blanchet@33192
   675
blanchet@35718
   676
(** Constant postprocessing **)
blanchet@35718
   677
blanchet@35718
   678
(* int -> typ -> typ list *)
blanchet@35718
   679
fun dest_n_tuple_type 1 T = [T]
blanchet@35718
   680
  | dest_n_tuple_type n (Type (_, [T1, T2])) =
blanchet@35718
   681
    T1 :: dest_n_tuple_type (n - 1) T2
blanchet@35718
   682
  | dest_n_tuple_type _ T =
blanchet@35718
   683
    raise TYPE ("Nitpick_Model.dest_n_tuple_type", [T], [])
blanchet@35718
   684
blanchet@35718
   685
(* theory -> const_table -> styp -> int list *)
blanchet@35718
   686
fun const_format thy def_table (x as (s, T)) =
blanchet@35718
   687
  if String.isPrefix unrolled_prefix s then
blanchet@35718
   688
    const_format thy def_table (original_name s, range_type T)
blanchet@35718
   689
  else if String.isPrefix skolem_prefix s then
blanchet@35718
   690
    let
blanchet@35718
   691
      val k = unprefix skolem_prefix s
blanchet@35718
   692
              |> strip_first_name_sep |> fst |> space_explode "@"
blanchet@35718
   693
              |> hd |> Int.fromString |> the
blanchet@35718
   694
    in [k, num_binder_types T - k] end
blanchet@35718
   695
  else if original_name s <> s then
blanchet@35718
   696
    [num_binder_types T]
blanchet@35718
   697
  else case def_of_const thy def_table x of
blanchet@35718
   698
    SOME t' => if fixpoint_kind_of_rhs t' <> NoFp then
blanchet@35718
   699
                 let val k = length (strip_abs_vars t') in
blanchet@35718
   700
                   [k, num_binder_types T - k]
blanchet@35718
   701
                 end
blanchet@35718
   702
               else
blanchet@35718
   703
                 [num_binder_types T]
blanchet@35718
   704
  | NONE => [num_binder_types T]
blanchet@35718
   705
(* int list -> int list -> int list *)
blanchet@35718
   706
fun intersect_formats _ [] = []
blanchet@35718
   707
  | intersect_formats [] _ = []
blanchet@35718
   708
  | intersect_formats ks1 ks2 =
blanchet@35718
   709
    let val ((ks1', k1), (ks2', k2)) = pairself split_last (ks1, ks2) in
blanchet@35718
   710
      intersect_formats (ks1' @ (if k1 > k2 then [k1 - k2] else []))
blanchet@35718
   711
                        (ks2' @ (if k2 > k1 then [k2 - k1] else [])) @
blanchet@35718
   712
      [Int.min (k1, k2)]
blanchet@35718
   713
    end
blanchet@35718
   714
blanchet@35718
   715
(* theory -> const_table -> (term option * int list) list -> term -> int list *)
blanchet@35718
   716
fun lookup_format thy def_table formats t =
blanchet@35718
   717
  case AList.lookup (fn (SOME x, SOME y) =>
blanchet@35718
   718
                        (term_match thy) (x, y) | _ => false)
blanchet@35718
   719
                    formats (SOME t) of
blanchet@35718
   720
    SOME format => format
blanchet@35718
   721
  | NONE => let val format = the (AList.lookup (op =) formats NONE) in
blanchet@35718
   722
              case t of
blanchet@35718
   723
                Const x => intersect_formats format
blanchet@35718
   724
                                             (const_format thy def_table x)
blanchet@35718
   725
              | _ => format
blanchet@35718
   726
            end
blanchet@35718
   727
blanchet@35718
   728
(* int list -> int list -> typ -> typ *)
blanchet@35718
   729
fun format_type default_format format T =
blanchet@35718
   730
  let
blanchet@35718
   731
    val T = uniterize_unarize_unbox_etc_type T
blanchet@35718
   732
    val format = format |> filter (curry (op <) 0)
blanchet@35718
   733
  in
blanchet@35718
   734
    if forall (curry (op =) 1) format then
blanchet@35718
   735
      T
blanchet@35718
   736
    else
blanchet@35718
   737
      let
blanchet@35718
   738
        val (binder_Ts, body_T) = strip_type T
blanchet@35718
   739
        val batched =
blanchet@35718
   740
          binder_Ts
blanchet@35718
   741
          |> map (format_type default_format default_format)
blanchet@35718
   742
          |> rev |> chunk_list_unevenly (rev format)
blanchet@35718
   743
          |> map (HOLogic.mk_tupleT o rev)
blanchet@35718
   744
      in List.foldl (op -->) body_T batched end
blanchet@35718
   745
  end
blanchet@35718
   746
(* theory -> const_table -> (term option * int list) list -> term -> typ *)
blanchet@35718
   747
fun format_term_type thy def_table formats t =
blanchet@35718
   748
  format_type (the (AList.lookup (op =) formats NONE))
blanchet@35718
   749
              (lookup_format thy def_table formats t) (fastype_of t)
blanchet@35718
   750
blanchet@35718
   751
(* int list -> int -> int list -> int list *)
blanchet@35718
   752
fun repair_special_format js m format =
blanchet@35718
   753
  m - 1 downto 0 |> chunk_list_unevenly (rev format)
blanchet@35718
   754
                 |> map (rev o filter_out (member (op =) js))
blanchet@35718
   755
                 |> filter_out null |> map length |> rev
blanchet@35718
   756
blanchet@35718
   757
(* hol_context -> string * string -> (term option * int list) list
blanchet@35718
   758
   -> styp -> term * typ *)
blanchet@35718
   759
fun user_friendly_const ({thy, evals, def_table, skolems, special_funs, ...}
blanchet@35718
   760
                         : hol_context) (base_name, step_name) formats =
blanchet@35718
   761
  let
blanchet@35718
   762
    val default_format = the (AList.lookup (op =) formats NONE)
blanchet@35718
   763
    (* styp -> term * typ *)
blanchet@35718
   764
    fun do_const (x as (s, T)) =
blanchet@35718
   765
      (if String.isPrefix special_prefix s then
blanchet@35718
   766
         let
blanchet@35718
   767
           (* term -> term *)
blanchet@35718
   768
           val do_term = map_aterms (fn Const x => fst (do_const x) | t' => t')
blanchet@35718
   769
           val (x' as (_, T'), js, ts) =
blanchet@35718
   770
             AList.find (op =) (!special_funs) (s, unarize_unbox_etc_type T)
blanchet@35718
   771
             |> the_single
blanchet@35718
   772
           val max_j = List.last js
blanchet@35718
   773
           val Ts = List.take (binder_types T', max_j + 1)
blanchet@35718
   774
           val missing_js = filter_out (member (op =) js) (0 upto max_j)
blanchet@35718
   775
           val missing_Ts = filter_indices missing_js Ts
blanchet@35718
   776
           (* int -> indexname *)
blanchet@35718
   777
           fun nth_missing_var n =
blanchet@35718
   778
             ((arg_var_prefix ^ nat_subscript (n + 1), 0), nth missing_Ts n)
blanchet@35718
   779
           val missing_vars = map nth_missing_var (0 upto length missing_js - 1)
blanchet@35718
   780
           val vars = special_bounds ts @ missing_vars
blanchet@35718
   781
           val ts' =
blanchet@35718
   782
             map (fn j =>
blanchet@35718
   783
                     case AList.lookup (op =) (js ~~ ts) j of
blanchet@35718
   784
                       SOME t => do_term t
blanchet@35718
   785
                     | NONE =>
blanchet@35718
   786
                       Var (nth missing_vars
blanchet@35718
   787
                                (find_index (curry (op =) j) missing_js)))
blanchet@35718
   788
                 (0 upto max_j)
blanchet@35718
   789
           val t = do_const x' |> fst
blanchet@35718
   790
           val format =
blanchet@35718
   791
             case AList.lookup (fn (SOME t1, SOME t2) => term_match thy (t1, t2)
blanchet@35718
   792
                                 | _ => false) formats (SOME t) of
blanchet@35718
   793
               SOME format =>
blanchet@35718
   794
               repair_special_format js (num_binder_types T') format
blanchet@35718
   795
             | NONE =>
blanchet@35718
   796
               const_format thy def_table x'
blanchet@35718
   797
               |> repair_special_format js (num_binder_types T')
blanchet@35718
   798
               |> intersect_formats default_format
blanchet@35718
   799
         in
blanchet@35718
   800
           (list_comb (t, ts') |> fold_rev abs_var vars,
blanchet@35718
   801
            format_type default_format format T)
blanchet@35718
   802
         end
blanchet@35718
   803
       else if String.isPrefix uncurry_prefix s then
blanchet@35718
   804
         let
blanchet@35718
   805
           val (ss, s') = unprefix uncurry_prefix s
blanchet@35718
   806
                          |> strip_first_name_sep |>> space_explode "@"
blanchet@35718
   807
         in
blanchet@35718
   808
           if String.isPrefix step_prefix s' then
blanchet@35718
   809
             do_const (s', T)
blanchet@35718
   810
           else
blanchet@35718
   811
             let
blanchet@35718
   812
               val k = the (Int.fromString (hd ss))
blanchet@35718
   813
               val j = the (Int.fromString (List.last ss))
blanchet@35718
   814
               val (before_Ts, (tuple_T, rest_T)) =
blanchet@35718
   815
                 strip_n_binders j T ||> (strip_n_binders 1 #>> hd)
blanchet@35718
   816
               val T' = before_Ts ---> dest_n_tuple_type k tuple_T ---> rest_T
blanchet@35718
   817
             in do_const (s', T') end
blanchet@35718
   818
         end
blanchet@35718
   819
       else if String.isPrefix unrolled_prefix s then
blanchet@35718
   820
         let val t = Const (original_name s, range_type T) in
blanchet@35718
   821
           (lambda (Free (iter_var_prefix, nat_T)) t,
blanchet@35718
   822
            format_type default_format
blanchet@35718
   823
                        (lookup_format thy def_table formats t) T)
blanchet@35718
   824
         end
blanchet@35718
   825
       else if String.isPrefix base_prefix s then
blanchet@35718
   826
         (Const (base_name, T --> T) $ Const (unprefix base_prefix s, T),
blanchet@35718
   827
          format_type default_format default_format T)
blanchet@35718
   828
       else if String.isPrefix step_prefix s then
blanchet@35718
   829
         (Const (step_name, T --> T) $ Const (unprefix step_prefix s, T),
blanchet@35718
   830
          format_type default_format default_format T)
blanchet@35718
   831
       else if String.isPrefix quot_normal_prefix s then
blanchet@35718
   832
         let val t = Const (nitpick_prefix ^ "normalize quotient type", T) in
blanchet@35718
   833
           (t, format_term_type thy def_table formats t)
blanchet@35718
   834
         end
blanchet@35718
   835
       else if String.isPrefix skolem_prefix s then
blanchet@35718
   836
         let
blanchet@35718
   837
           val ss = the (AList.lookup (op =) (!skolems) s)
blanchet@35718
   838
           val (Ts, Ts') = chop (length ss) (binder_types T)
blanchet@35718
   839
           val frees = map Free (ss ~~ Ts)
blanchet@35718
   840
           val s' = original_name s
blanchet@35718
   841
         in
blanchet@35718
   842
           (fold lambda frees (Const (s', Ts' ---> T)),
blanchet@35718
   843
            format_type default_format
blanchet@35718
   844
                        (lookup_format thy def_table formats (Const x)) T)
blanchet@35718
   845
         end
blanchet@35718
   846
       else if String.isPrefix eval_prefix s then
blanchet@35718
   847
         let
blanchet@35718
   848
           val t = nth evals (the (Int.fromString (unprefix eval_prefix s)))
blanchet@35718
   849
         in (t, format_term_type thy def_table formats t) end
blanchet@35718
   850
       else if s = @{const_name undefined_fast_The} then
blanchet@35718
   851
         (Const (nitpick_prefix ^ "The fallback", T),
blanchet@35718
   852
          format_type default_format
blanchet@35718
   853
                      (lookup_format thy def_table formats
blanchet@35718
   854
                           (Const (@{const_name The}, (T --> bool_T) --> T))) T)
blanchet@35718
   855
       else if s = @{const_name undefined_fast_Eps} then
blanchet@35718
   856
         (Const (nitpick_prefix ^ "Eps fallback", T),
blanchet@35718
   857
          format_type default_format
blanchet@35718
   858
                      (lookup_format thy def_table formats
blanchet@35718
   859
                           (Const (@{const_name Eps}, (T --> bool_T) --> T))) T)
blanchet@35718
   860
       else
blanchet@35718
   861
         let val t = Const (original_name s, T) in
blanchet@35718
   862
           (t, format_term_type thy def_table formats t)
blanchet@35718
   863
         end)
blanchet@35718
   864
      |>> map_types uniterize_unarize_unbox_etc_type
blanchet@35718
   865
      |>> shorten_names_in_term |>> Term.map_abs_vars shortest_name
blanchet@35718
   866
  in do_const end
blanchet@35718
   867
blanchet@35718
   868
(* styp -> string *)
blanchet@35718
   869
fun assign_operator_for_const (s, T) =
blanchet@35718
   870
  if String.isPrefix ubfp_prefix s then
blanchet@35718
   871
    if is_fun_type T then "\<subseteq>" else "\<le>"
blanchet@35718
   872
  else if String.isPrefix lbfp_prefix s then
blanchet@35718
   873
    if is_fun_type T then "\<supseteq>" else "\<ge>"
blanchet@35718
   874
  else if original_name s <> s then
blanchet@35718
   875
    assign_operator_for_const (strip_first_name_sep s |> snd, T)
blanchet@35718
   876
  else
blanchet@35718
   877
    "="
blanchet@35718
   878
blanchet@35718
   879
(** Model reconstruction **)
blanchet@35718
   880
blanchet@35180
   881
(* atom_pool -> scope -> nut list -> nut NameTable.table -> KK.raw_bound list
blanchet@35180
   882
   -> nut -> term *)
blanchet@35180
   883
fun term_for_name pool scope sel_names rel_table bounds name =
blanchet@33192
   884
  let val T = type_of name in
blanchet@33192
   885
    tuple_list_for_name rel_table bounds name
blanchet@35280
   886
    |> reconstruct_term false pool (("", ""), ("", "")) scope sel_names
blanchet@35280
   887
                        rel_table bounds T T (rep_of name)
blanchet@33192
   888
  end
blanchet@33192
   889
blanchet@33192
   890
(* term -> term *)
blanchet@33192
   891
fun unfold_outer_the_binders (t as Const (@{const_name The}, _)
blanchet@33192
   892
                                   $ Abs (s, T, Const (@{const_name "op ="}, _)
blanchet@33192
   893
                                                $ Bound 0 $ t')) =
blanchet@33192
   894
    betapply (Abs (s, T, t'), t) |> unfold_outer_the_binders
blanchet@33192
   895
  | unfold_outer_the_binders t = t
blanchet@33192
   896
(* typ list -> int -> term * term -> bool *)
blanchet@33192
   897
fun bisimilar_values _ 0 _ = true
blanchet@33192
   898
  | bisimilar_values coTs max_depth (t1, t2) =
blanchet@33192
   899
    let val T = fastype_of t1 in
blanchet@33192
   900
      if exists_subtype (member (op =) coTs) T then
blanchet@33192
   901
        let
blanchet@33192
   902
          val ((head1, args1), (head2, args2)) =
blanchet@33192
   903
            pairself (strip_comb o unfold_outer_the_binders) (t1, t2)
blanchet@34121
   904
          val max_depth = max_depth - (if member (op =) coTs T then 1 else 0)
blanchet@33192
   905
        in
blanchet@34936
   906
          head1 = head2 andalso
blanchet@34936
   907
          forall (bisimilar_values coTs max_depth) (args1 ~~ args2)
blanchet@33192
   908
        end
blanchet@33192
   909
      else
blanchet@33192
   910
        t1 = t2
blanchet@33192
   911
    end
blanchet@33192
   912
blanchet@33192
   913
(* params -> scope -> (term option * int list) list -> styp list -> nut list
blanchet@34126
   914
  -> nut list -> nut list -> nut NameTable.table -> KK.raw_bound list
blanchet@33192
   915
  -> Pretty.T * bool *)
blanchet@33192
   916
fun reconstruct_hol_model {show_skolems, show_datatypes, show_consts}
blanchet@35280
   917
        ({hol_ctxt = {thy, ctxt, max_bisim_depth, boxes, stds, wfs, user_axioms,
blanchet@35280
   918
                      debug, binary_ints, destroy_constrs, specialize,
blanchet@35280
   919
                      skolemize, star_linear_preds, uncurry, fast_descrs,
blanchet@35280
   920
                      tac_timeout, evals, case_names, def_table, nondef_table,
blanchet@35807
   921
                      user_nondefs, simp_table, psimp_table, choice_spec_table,
blanchet@35807
   922
                      intro_table, ground_thm_table, ersatz_table, skolems,
blanchet@35807
   923
                      special_funs, unrolled_preds, wf_cache, constr_cache},
blanchet@35190
   924
         binarize, card_assigns, bits, bisim_depth, datatypes, ofs} : scope)
blanchet@34124
   925
        formats all_frees free_names sel_names nonsel_names rel_table bounds =
blanchet@33192
   926
  let
blanchet@35180
   927
    val pool = Unsynchronized.ref []
blanchet@35280
   928
    val (wacky_names as (_, base_step_names), ctxt) =
blanchet@33192
   929
      add_wacky_syntax ctxt
blanchet@35070
   930
    val hol_ctxt =
blanchet@33192
   931
      {thy = thy, ctxt = ctxt, max_bisim_depth = max_bisim_depth, boxes = boxes,
blanchet@34982
   932
       stds = stds, wfs = wfs, user_axioms = user_axioms, debug = debug,
blanchet@34124
   933
       binary_ints = binary_ints, destroy_constrs = destroy_constrs,
blanchet@34124
   934
       specialize = specialize, skolemize = skolemize,
blanchet@34124
   935
       star_linear_preds = star_linear_preds, uncurry = uncurry,
blanchet@34124
   936
       fast_descrs = fast_descrs, tac_timeout = tac_timeout, evals = evals,
blanchet@34124
   937
       case_names = case_names, def_table = def_table,
blanchet@33192
   938
       nondef_table = nondef_table, user_nondefs = user_nondefs,
blanchet@33192
   939
       simp_table = simp_table, psimp_table = psimp_table,
blanchet@35807
   940
       choice_spec_table = choice_spec_table, intro_table = intro_table,
blanchet@35807
   941
       ground_thm_table = ground_thm_table, ersatz_table = ersatz_table,
blanchet@35807
   942
       skolems = skolems, special_funs = special_funs,
blanchet@35807
   943
       unrolled_preds = unrolled_preds, wf_cache = wf_cache,
blanchet@35807
   944
       constr_cache = constr_cache}
blanchet@35190
   945
    val scope = {hol_ctxt = hol_ctxt, binarize = binarize,
blanchet@35190
   946
                 card_assigns = card_assigns, bits = bits,
blanchet@35190
   947
                 bisim_depth = bisim_depth, datatypes = datatypes, ofs = ofs}
blanchet@35180
   948
    (* bool -> typ -> typ -> rep -> int list list -> term *)
blanchet@35188
   949
    fun term_for_rep unfold =
blanchet@35188
   950
      reconstruct_term unfold pool wacky_names scope sel_names rel_table bounds
blanchet@35188
   951
    (* nat -> typ -> nat -> term *)
blanchet@35180
   952
    fun nth_value_of_type card T n =
blanchet@35188
   953
      let
blanchet@35188
   954
        (* bool -> term *)
blanchet@35188
   955
        fun aux unfold = term_for_rep unfold T T (Atom (card, 0)) [[n]]
blanchet@35188
   956
      in
blanchet@35188
   957
        case aux false of
blanchet@35188
   958
          t as Const (s, _) =>
blanchet@35188
   959
          if String.isPrefix cyclic_const_prefix s then
blanchet@35188
   960
            HOLogic.mk_eq (t, aux true)
blanchet@35188
   961
          else
blanchet@35188
   962
            t
blanchet@35188
   963
        | t => t
blanchet@35188
   964
      end
blanchet@35712
   965
    (* nat -> typ -> term list *)
blanchet@35712
   966
    val all_values =
blanchet@35712
   967
      all_values_of_type pool wacky_names scope sel_names rel_table bounds
blanchet@33192
   968
    (* dtype_spec list -> dtype_spec -> bool *)
blanchet@33192
   969
    fun is_codatatype_wellformed (cos : dtype_spec list)
blanchet@33192
   970
                                 ({typ, card, ...} : dtype_spec) =
blanchet@33192
   971
      let
blanchet@35712
   972
        val ts = all_values card typ
blanchet@33192
   973
        val max_depth = Integer.sum (map #card cos)
blanchet@33192
   974
      in
blanchet@33192
   975
        forall (not o bisimilar_values (map #typ cos) max_depth)
blanchet@33192
   976
               (all_distinct_unordered_pairs_of ts)
blanchet@33192
   977
      end
blanchet@33192
   978
    (* string -> Pretty.T *)
blanchet@33192
   979
    fun pretty_for_assign name =
blanchet@33192
   980
      let
blanchet@33192
   981
        val (oper, (t1, T'), T) =
blanchet@33192
   982
          case name of
blanchet@33192
   983
            FreeName (s, T, _) =>
blanchet@35665
   984
            let val t = Free (s, uniterize_unarize_unbox_etc_type T) in
blanchet@33192
   985
              ("=", (t, format_term_type thy def_table formats t), T)
blanchet@33192
   986
            end
blanchet@33192
   987
          | ConstName (s, T, _) =>
blanchet@33192
   988
            (assign_operator_for_const (s, T),
blanchet@35280
   989
             user_friendly_const hol_ctxt base_step_names formats (s, T), T)
blanchet@33232
   990
          | _ => raise NUT ("Nitpick_Model.reconstruct_hol_model.\
blanchet@33192
   991
                            \pretty_for_assign", [name])
blanchet@33192
   992
        val t2 = if rep_of name = Any then
blanchet@33192
   993
                   Const (@{const_name undefined}, T')
blanchet@33192
   994
                 else
blanchet@33192
   995
                   tuple_list_for_name rel_table bounds name
blanchet@35180
   996
                   |> term_for_rep false T T' (rep_of name)
blanchet@33192
   997
      in
blanchet@33192
   998
        Pretty.block (Pretty.breaks
blanchet@33571
   999
            [setmp_show_all_types (Syntax.pretty_term ctxt) t1,
blanchet@33192
  1000
             Pretty.str oper, Syntax.pretty_term ctxt t2])
blanchet@33192
  1001
      end
blanchet@33192
  1002
    (* dtype_spec -> Pretty.T *)
blanchet@34123
  1003
    fun pretty_for_datatype ({typ, card, complete, ...} : dtype_spec) =
blanchet@33192
  1004
      Pretty.block (Pretty.breaks
blanchet@35665
  1005
          (Syntax.pretty_typ ctxt (uniterize_unarize_unbox_etc_type typ) ::
blanchet@35665
  1006
           (case typ of
blanchet@35665
  1007
              Type (@{type_name fin_fun}, _) => [Pretty.str "[finite]"]
blanchet@35665
  1008
            | Type (@{type_name fun_box}, _) => [Pretty.str "[boxed]"]
blanchet@35665
  1009
            | Type (@{type_name pair_box}, _) => [Pretty.str "[boxed]"]
blanchet@35665
  1010
            | _ => []) @
blanchet@35665
  1011
           [Pretty.str "=",
blanchet@35665
  1012
            Pretty.enum "," "{" "}"
blanchet@35712
  1013
                (map (Syntax.pretty_term ctxt) (all_values card typ) @
blanchet@35665
  1014
                 (if fun_from_pair complete false then []
blanchet@35665
  1015
                  else [Pretty.str unrep]))]))
blanchet@33192
  1016
    (* typ -> dtype_spec list *)
blanchet@33192
  1017
    fun integer_datatype T =
blanchet@33192
  1018
      [{typ = T, card = card_of_type card_assigns T, co = false,
blanchet@35385
  1019
        standard = true, complete = (false, false), concrete = (true, true),
blanchet@35385
  1020
        deep = true, constrs = []}]
blanchet@33232
  1021
      handle TYPE ("Nitpick_HOL.card_of_type", _, _) => []
blanchet@33192
  1022
    val (codatatypes, datatypes) =
blanchet@34982
  1023
      datatypes |> filter #deep |> List.partition #co
blanchet@35220
  1024
                ||> append (integer_datatype int_T
blanchet@35220
  1025
                            |> is_standard_datatype thy stds nat_T
blanchet@35220
  1026
                               ? append (integer_datatype nat_T))
blanchet@33192
  1027
    val block_of_datatypes =
blanchet@33192
  1028
      if show_datatypes andalso not (null datatypes) then
blanchet@33192
  1029
        [Pretty.big_list ("Datatype" ^ plural_s_for_list datatypes ^ ":")
blanchet@33192
  1030
                         (map pretty_for_datatype datatypes)]
blanchet@33192
  1031
      else
blanchet@33192
  1032
        []
blanchet@33192
  1033
    val block_of_codatatypes =
blanchet@33192
  1034
      if show_datatypes andalso not (null codatatypes) then
blanchet@33192
  1035
        [Pretty.big_list ("Codatatype" ^ plural_s_for_list codatatypes ^ ":")
blanchet@33192
  1036
                         (map pretty_for_datatype codatatypes)]
blanchet@33192
  1037
      else
blanchet@33192
  1038
        []
blanchet@33192
  1039
    (* bool -> string -> nut list -> Pretty.T list *)
blanchet@33192
  1040
    fun block_of_names show title names =
blanchet@33192
  1041
      if show andalso not (null names) then
blanchet@33192
  1042
        Pretty.str (title ^ plural_s_for_list names ^ ":")
blanchet@33192
  1043
        :: map (Pretty.indent indent_size o pretty_for_assign)
blanchet@33192
  1044
               (sort_wrt (original_name o nickname_of) names)
blanchet@33192
  1045
      else
blanchet@33192
  1046
        []
blanchet@33192
  1047
    val (skolem_names, nonskolem_nonsel_names) =
blanchet@33192
  1048
      List.partition is_skolem_name nonsel_names
blanchet@33192
  1049
    val (eval_names, noneval_nonskolem_nonsel_names) =
blanchet@33192
  1050
      List.partition (String.isPrefix eval_prefix o nickname_of)
blanchet@33192
  1051
                     nonskolem_nonsel_names
blanchet@35665
  1052
      ||> filter_out (member (op =) [@{const_name bisim},
blanchet@35665
  1053
                                     @{const_name bisim_iterator_max}]
blanchet@34121
  1054
                      o nickname_of)
blanchet@33192
  1055
    val free_names =
blanchet@33192
  1056
      map (fn x as (s, T) =>
blanchet@34121
  1057
              case filter (curry (op =) x
blanchet@35280
  1058
                       o pairf nickname_of
blanchet@35665
  1059
                               (uniterize_unarize_unbox_etc_type o type_of))
blanchet@35190
  1060
                       free_names of
blanchet@33192
  1061
                [name] => name
blanchet@33192
  1062
              | [] => FreeName (s, T, Any)
blanchet@33232
  1063
              | _ => raise TERM ("Nitpick_Model.reconstruct_hol_model",
blanchet@33192
  1064
                                 [Const x])) all_frees
blanchet@33192
  1065
    val chunks = block_of_names true "Free variable" free_names @
blanchet@33192
  1066
                 block_of_names show_skolems "Skolem constant" skolem_names @
blanchet@33192
  1067
                 block_of_names true "Evaluated term" eval_names @
blanchet@33192
  1068
                 block_of_datatypes @ block_of_codatatypes @
blanchet@33192
  1069
                 block_of_names show_consts "Constant"
blanchet@33192
  1070
                                noneval_nonskolem_nonsel_names
blanchet@33192
  1071
  in
blanchet@33192
  1072
    (Pretty.chunks (if null chunks then [Pretty.str "Empty assignment"]
blanchet@33192
  1073
                    else chunks),
blanchet@34936
  1074
     bisim_depth >= 0 orelse
blanchet@34936
  1075
     forall (is_codatatype_wellformed codatatypes) codatatypes)
blanchet@33192
  1076
  end
blanchet@33192
  1077
blanchet@33192
  1078
(* scope -> Time.time option -> nut list -> nut list -> nut NameTable.table
blanchet@34126
  1079
   -> KK.raw_bound list -> term -> bool option *)
blanchet@35280
  1080
fun prove_hol_model (scope as {hol_ctxt = {thy, ctxt, debug, ...},
blanchet@34998
  1081
                               card_assigns, ...})
blanchet@33192
  1082
                    auto_timeout free_names sel_names rel_table bounds prop =
blanchet@33192
  1083
  let
blanchet@35076
  1084
    val pool = Unsynchronized.ref []
blanchet@33192
  1085
    (* typ * int -> term *)
blanchet@33192
  1086
    fun free_type_assm (T, k) =
blanchet@33192
  1087
      let
blanchet@33192
  1088
        (* int -> term *)
blanchet@35076
  1089
        fun atom j = nth_atom pool true T j k
blanchet@33192
  1090
        fun equation_for_atom j = HOLogic.eq_const T $ Bound 0 $ atom j
blanchet@33192
  1091
        val eqs = map equation_for_atom (index_seq 0 k)
blanchet@33192
  1092
        val compreh_assm =
blanchet@33192
  1093
          Const (@{const_name All}, (T --> bool_T) --> bool_T)
blanchet@33192
  1094
              $ Abs ("x", T, foldl1 HOLogic.mk_disj eqs)
blanchet@33192
  1095
        val distinct_assm = distinctness_formula T (map atom (index_seq 0 k))
blanchet@34998
  1096
      in s_conj (compreh_assm, distinct_assm) end
blanchet@33192
  1097
    (* nut -> term *)
blanchet@33192
  1098
    fun free_name_assm name =
blanchet@33192
  1099
      HOLogic.mk_eq (Free (nickname_of name, type_of name),
blanchet@35180
  1100
                     term_for_name pool scope sel_names rel_table bounds name)
blanchet@33192
  1101
    val freeT_assms = map free_type_assm (filter (is_TFree o fst) card_assigns)
blanchet@33192
  1102
    val model_assms = map free_name_assm free_names
blanchet@34998
  1103
    val assm = foldr1 s_conj (freeT_assms @ model_assms)
blanchet@33192
  1104
    (* bool -> bool *)
blanchet@33192
  1105
    fun try_out negate =
blanchet@33192
  1106
      let
blanchet@33192
  1107
        val concl = (negate ? curry (op $) @{const Not})
wenzelm@35625
  1108
                    (Object_Logic.atomize_term thy prop)
blanchet@34998
  1109
        val prop = HOLogic.mk_Trueprop (HOLogic.mk_imp (assm, concl))
blanchet@33192
  1110
                   |> map_types (map_type_tfree
blanchet@34998
  1111
                                     (fn (s, []) => TFree (s, HOLogic.typeS)
blanchet@34998
  1112
                                       | x => TFree x))
blanchet@34998
  1113
       val _ = if debug then
blanchet@34998
  1114
                 priority ((if negate then "Genuineness" else "Spuriousness") ^
blanchet@34998
  1115
                           " goal: " ^ Syntax.string_of_term ctxt prop ^ ".")
blanchet@34998
  1116
               else
blanchet@34998
  1117
                 ()
blanchet@34998
  1118
        val goal = prop |> cterm_of thy |> Goal.init
blanchet@33192
  1119
      in
blanchet@33192
  1120
        (goal |> SINGLE (DETERM_TIMEOUT auto_timeout
blanchet@33192
  1121
                                        (auto_tac (clasimpset_of ctxt)))
blanchet@33192
  1122
              |> the |> Goal.finish ctxt; true)
blanchet@33192
  1123
        handle THM _ => false
blanchet@33192
  1124
             | TimeLimit.TimeOut => false
blanchet@33192
  1125
      end
blanchet@33192
  1126
  in
blanchet@33705
  1127
    if try_out false then SOME true
blanchet@33705
  1128
    else if try_out true then SOME false
blanchet@33192
  1129
    else NONE
blanchet@33192
  1130
  end
blanchet@33192
  1131
blanchet@33192
  1132
end;