src/HOL/Tools/Nitpick/nitpick_model.ML
author blanchet
Thu Mar 11 12:22:11 2010 +0100 (2010-03-11)
changeset 35711 548d3f16404b
parent 35665 ff2bf50505ab
child 35712 77aa29bf14ee
permissions -rw-r--r--
added term postprocessor to Nitpick, to provide custom syntax for typedefs
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@35711
    19
  type term_postprocessor = Proof.context -> typ -> term -> term
blanchet@33192
    20
blanchet@33192
    21
  structure NameTable : TABLE
blanchet@33192
    22
blanchet@35711
    23
  val register_term_postprocessor :
blanchet@35711
    24
    typ -> term_postprocessor -> theory -> theory
blanchet@35711
    25
  val unregister_term_postprocessor : typ -> theory -> theory
blanchet@33192
    26
  val tuple_list_for_name :
blanchet@33192
    27
    nut NameTable.table -> Kodkod.raw_bound list -> nut -> int list list
blanchet@33192
    28
  val reconstruct_hol_model :
blanchet@33192
    29
    params -> scope -> (term option * int list) list -> styp list -> nut list
blanchet@33192
    30
    -> nut list -> nut list -> nut NameTable.table -> Kodkod.raw_bound list
blanchet@33192
    31
    -> Pretty.T * bool
blanchet@33192
    32
  val prove_hol_model :
blanchet@33192
    33
    scope -> Time.time option -> nut list -> nut list -> nut NameTable.table
blanchet@33192
    34
    -> Kodkod.raw_bound list -> term -> bool option
blanchet@33192
    35
end;
blanchet@33192
    36
blanchet@33232
    37
structure Nitpick_Model : NITPICK_MODEL =
blanchet@33192
    38
struct
blanchet@33192
    39
blanchet@33232
    40
open Nitpick_Util
blanchet@33232
    41
open Nitpick_HOL
blanchet@33232
    42
open Nitpick_Scope
blanchet@33232
    43
open Nitpick_Peephole
blanchet@33232
    44
open Nitpick_Rep
blanchet@33232
    45
open Nitpick_Nut
blanchet@33192
    46
blanchet@34126
    47
structure KK = Kodkod
blanchet@34126
    48
blanchet@33192
    49
type params = {
blanchet@33192
    50
  show_skolems: bool,
blanchet@33192
    51
  show_datatypes: bool,
blanchet@33192
    52
  show_consts: bool}
blanchet@33192
    53
blanchet@35711
    54
type term_postprocessor = Proof.context -> typ -> term -> term
blanchet@35711
    55
blanchet@35711
    56
structure Data = Theory_Data(
blanchet@35711
    57
  type T = (typ * term_postprocessor) list
blanchet@35711
    58
  val empty = []
blanchet@35711
    59
  val extend = I
blanchet@35711
    60
  fun merge (ps1, ps2) = AList.merge (op =) (K true) (ps1, ps2))
blanchet@35711
    61
blanchet@33192
    62
val unknown = "?"
blanchet@33192
    63
val unrep = "\<dots>"
blanchet@33192
    64
val maybe_mixfix = "_\<^sup>?"
blanchet@33192
    65
val base_mixfix = "_\<^bsub>base\<^esub>"
blanchet@33192
    66
val step_mixfix = "_\<^bsub>step\<^esub>"
blanchet@33192
    67
val abs_mixfix = "\<guillemotleft>_\<guillemotright>"
blanchet@35179
    68
val cyclic_co_val_name = "\<omega>"
blanchet@35188
    69
val cyclic_const_prefix = "\<xi>"
blanchet@35188
    70
val cyclic_type_name = nitpick_prefix ^ cyclic_const_prefix
blanchet@34982
    71
val opt_flag = nitpick_prefix ^ "opt"
blanchet@34982
    72
val non_opt_flag = nitpick_prefix ^ "non_opt"
blanchet@33192
    73
blanchet@35076
    74
type atom_pool = ((string * int) * int list) list
blanchet@35076
    75
blanchet@35076
    76
(* atom_pool Unsynchronized.ref -> string -> int -> int -> string *)
blanchet@35076
    77
fun nth_atom_suffix pool s j k =
blanchet@35076
    78
  (case AList.lookup (op =) (!pool) (s, k) of
blanchet@35076
    79
     SOME js =>
blanchet@35076
    80
     (case find_index (curry (op =) j) js of
blanchet@35076
    81
        ~1 => (Unsynchronized.change pool (cons ((s, k), j :: js));
blanchet@35076
    82
               length js + 1)
blanchet@35076
    83
      | n => length js - n)
blanchet@35076
    84
   | NONE => (Unsynchronized.change pool (cons ((s, k), [j])); 1))
blanchet@35076
    85
  |> nat_subscript
blanchet@33884
    86
  |> (s <> "" andalso Symbol.is_ascii_digit (List.last (explode s)))
blanchet@33884
    87
     ? prefix "\<^isub>,"
blanchet@35076
    88
(* atom_pool Unsynchronized.ref -> string -> typ -> int -> int -> string *)
blanchet@35280
    89
fun nth_atom_name pool prefix (Type (s, _)) j k =
blanchet@34982
    90
    let val s' = shortest_name s in
blanchet@34982
    91
      prefix ^ (if String.isPrefix "\\" s' then s' else substring (s', 0, 1)) ^
blanchet@35076
    92
      nth_atom_suffix pool s j k
blanchet@34982
    93
    end
blanchet@35280
    94
  | nth_atom_name pool prefix (TFree (s, _)) j k =
blanchet@35076
    95
    prefix ^ perhaps (try (unprefix "'")) s ^ nth_atom_suffix pool s j k
blanchet@35076
    96
  | nth_atom_name _ _ T _ _ =
blanchet@35076
    97
    raise TYPE ("Nitpick_Model.nth_atom_name", [T], [])
blanchet@35076
    98
(* atom_pool Unsynchronized.ref -> bool -> typ -> int -> int -> term *)
blanchet@35076
    99
fun nth_atom pool for_auto T j k =
blanchet@33192
   100
  if for_auto then
blanchet@35076
   101
    Free (nth_atom_name pool (hd (space_explode "." nitpick_prefix)) T j k, T)
blanchet@33192
   102
  else
blanchet@35076
   103
    Const (nth_atom_name pool "" T j k, T)
blanchet@33192
   104
blanchet@34126
   105
(* term -> real *)
blanchet@35177
   106
fun extract_real_number (Const (@{const_name divide}, _) $ t1 $ t2) =
blanchet@34126
   107
    real (snd (HOLogic.dest_number t1)) / real (snd (HOLogic.dest_number t2))
blanchet@34126
   108
  | extract_real_number t = real (snd (HOLogic.dest_number t))
blanchet@34124
   109
(* term * term -> order *)
blanchet@34124
   110
fun nice_term_ord (Abs (_, _, t1), Abs (_, _, t2)) = nice_term_ord (t1, t2)
blanchet@34126
   111
  | nice_term_ord tp = Real.compare (pairself extract_real_number tp)
blanchet@34124
   112
    handle TERM ("dest_number", _) =>
blanchet@34126
   113
           case tp of
blanchet@34124
   114
             (t11 $ t12, t21 $ t22) =>
blanchet@34124
   115
             (case nice_term_ord (t11, t21) of
blanchet@34124
   116
                EQUAL => nice_term_ord (t12, t22)
blanchet@34124
   117
              | ord => ord)
wenzelm@35408
   118
           | _ => Term_Ord.fast_term_ord tp
blanchet@34124
   119
blanchet@35711
   120
(* typ -> term_postprocessor -> theory -> theory *)
blanchet@35711
   121
fun register_term_postprocessor T p = Data.map (cons (T, p))
blanchet@35711
   122
(* typ -> theory -> theory *)
blanchet@35711
   123
fun unregister_term_postprocessor T = Data.map (AList.delete (op =) T)
blanchet@35711
   124
blanchet@34126
   125
(* nut NameTable.table -> KK.raw_bound list -> nut -> int list list *)
blanchet@33192
   126
fun tuple_list_for_name rel_table bounds name =
blanchet@33192
   127
  the (AList.lookup (op =) bounds (the_rel rel_table name)) handle NUT _ => [[]]
blanchet@33192
   128
blanchet@33192
   129
(* term -> term *)
blanchet@35665
   130
fun unarize_unbox_etc_term (Const (@{const_name FinFun}, _) $ t1) =
blanchet@35665
   131
    unarize_unbox_etc_term t1
blanchet@35665
   132
  | unarize_unbox_etc_term (Const (@{const_name FunBox}, _) $ t1) =
blanchet@35665
   133
    unarize_unbox_etc_term t1
blanchet@35665
   134
  | unarize_unbox_etc_term
blanchet@35665
   135
        (Const (@{const_name PairBox},
blanchet@35665
   136
                Type (@{type_name fun}, [T1, Type (@{type_name fun}, [T2, _])]))
blanchet@35665
   137
         $ t1 $ t2) =
blanchet@35665
   138
    let val Ts = map uniterize_unarize_unbox_etc_type [T1, T2] in
blanchet@35665
   139
      Const (@{const_name Pair}, Ts ---> Type (@{type_name "*"}, Ts))
blanchet@35665
   140
      $ unarize_unbox_etc_term t1 $ unarize_unbox_etc_term t2
blanchet@33192
   141
    end
blanchet@35665
   142
  | unarize_unbox_etc_term (Const (s, T)) =
blanchet@35665
   143
    Const (s, uniterize_unarize_unbox_etc_type T)
blanchet@35665
   144
  | unarize_unbox_etc_term (t1 $ t2) =
blanchet@35665
   145
    unarize_unbox_etc_term t1 $ unarize_unbox_etc_term t2
blanchet@35665
   146
  | unarize_unbox_etc_term (Free (s, T)) =
blanchet@35665
   147
    Free (s, uniterize_unarize_unbox_etc_type T)
blanchet@35665
   148
  | unarize_unbox_etc_term (Var (x, T)) =
blanchet@35665
   149
    Var (x, uniterize_unarize_unbox_etc_type T)
blanchet@35665
   150
  | unarize_unbox_etc_term (Bound j) = Bound j
blanchet@35665
   151
  | unarize_unbox_etc_term (Abs (s, T, t')) =
blanchet@35665
   152
    Abs (s, uniterize_unarize_unbox_etc_type T, unarize_unbox_etc_term t')
blanchet@33192
   153
blanchet@33192
   154
(* typ -> typ -> (typ * typ) * (typ * typ) *)
blanchet@35665
   155
fun factor_out_types (T1 as Type (@{type_name "*"}, [T11, T12]))
blanchet@35665
   156
                     (T2 as Type (@{type_name "*"}, [T21, T22])) =
blanchet@33192
   157
    let val (n1, n2) = pairself num_factors_in_type (T11, T21) in
blanchet@33192
   158
      if n1 = n2 then
blanchet@33192
   159
        let
blanchet@33192
   160
          val ((T11', opt_T12'), (T21', opt_T22')) = factor_out_types T12 T22
blanchet@33192
   161
        in
blanchet@35665
   162
          ((Type (@{type_name "*"}, [T11, T11']), opt_T12'),
blanchet@35665
   163
           (Type (@{type_name "*"}, [T21, T21']), opt_T22'))
blanchet@33192
   164
        end
blanchet@33192
   165
      else if n1 < n2 then
blanchet@33192
   166
        case factor_out_types T1 T21 of
blanchet@33192
   167
          (p1, (T21', NONE)) => (p1, (T21', SOME T22))
blanchet@33192
   168
        | (p1, (T21', SOME T22')) =>
blanchet@35665
   169
          (p1, (T21', SOME (Type (@{type_name "*"}, [T22', T22]))))
blanchet@33192
   170
      else
blanchet@33192
   171
        swap (factor_out_types T2 T1)
blanchet@33192
   172
    end
blanchet@35665
   173
  | factor_out_types (Type (@{type_name "*"}, [T11, T12])) T2 =
blanchet@35665
   174
    ((T11, SOME T12), (T2, NONE))
blanchet@35665
   175
  | factor_out_types T1 (Type (@{type_name "*"}, [T21, T22])) =
blanchet@35665
   176
    ((T1, NONE), (T21, SOME T22))
blanchet@33192
   177
  | factor_out_types T1 T2 = ((T1, NONE), (T2, NONE))
blanchet@33192
   178
blanchet@33192
   179
(* bool -> typ -> typ -> (term * term) list -> term *)
blanchet@33192
   180
fun make_plain_fun maybe_opt T1 T2 =
blanchet@33192
   181
  let
blanchet@33192
   182
    (* typ -> typ -> (term * term) list -> term *)
blanchet@33192
   183
    fun aux T1 T2 [] =
blanchet@34982
   184
        Const (if maybe_opt then opt_flag else non_opt_flag, T1 --> T2)
blanchet@33192
   185
      | aux T1 T2 ((t1, t2) :: ps) =
blanchet@34124
   186
        Const (@{const_name fun_upd}, (T1 --> T2) --> T1 --> T2 --> T1 --> T2)
blanchet@33192
   187
        $ aux T1 T2 ps $ t1 $ t2
blanchet@33192
   188
  in aux T1 T2 o rev end
blanchet@33192
   189
(* term -> bool *)
blanchet@34982
   190
fun is_plain_fun (Const (s, _)) = (s = opt_flag orelse s = non_opt_flag)
blanchet@33192
   191
  | is_plain_fun (Const (@{const_name fun_upd}, _) $ t0 $ _ $ _) =
blanchet@33192
   192
    is_plain_fun t0
blanchet@33192
   193
  | is_plain_fun _ = false
blanchet@33192
   194
(* term -> bool * (term list * term list) *)
blanchet@33192
   195
val dest_plain_fun =
blanchet@33192
   196
  let
blanchet@34982
   197
    (* term -> bool * (term list * term list) *)
blanchet@34982
   198
    fun aux (Const (s, _)) = (s <> non_opt_flag, ([], []))
blanchet@33192
   199
      | aux (Const (@{const_name fun_upd}, _) $ t0 $ t1 $ t2) =
blanchet@33192
   200
        let val (s, (ts1, ts2)) = aux t0 in (s, (t1 :: ts1, t2 :: ts2)) end
blanchet@33232
   201
      | aux t = raise TERM ("Nitpick_Model.dest_plain_fun", [t])
blanchet@33192
   202
  in apsnd (pairself rev) o aux end
blanchet@33192
   203
blanchet@33565
   204
(* typ -> typ -> typ -> term -> term * term *)
blanchet@33565
   205
fun break_in_two T T1 T2 t =
blanchet@33565
   206
  let
blanchet@33565
   207
    val ps = HOLogic.flat_tupleT_paths T
blanchet@33565
   208
    val cut = length (HOLogic.strip_tupleT T1)
blanchet@33565
   209
    val (ps1, ps2) = pairself HOLogic.flat_tupleT_paths (T1, T2)
blanchet@33565
   210
    val (ts1, ts2) = t |> HOLogic.strip_ptuple ps |> chop cut
blanchet@33565
   211
  in (HOLogic.mk_ptuple ps1 T1 ts1, HOLogic.mk_ptuple ps2 T2 ts2) end
blanchet@33192
   212
(* typ -> term -> term -> term *)
blanchet@35665
   213
fun pair_up (Type (@{type_name "*"}, [T1', T2']))
blanchet@33192
   214
            (t1 as Const (@{const_name Pair},
blanchet@35665
   215
                          Type (@{type_name fun},
blanchet@35665
   216
                                [_, Type (@{type_name fun}, [_, T1])]))
blanchet@35665
   217
             $ t11 $ t12) t2 =
blanchet@33192
   218
    if T1 = T1' then HOLogic.mk_prod (t1, t2)
blanchet@33192
   219
    else HOLogic.mk_prod (t11, pair_up T2' t12 t2)
blanchet@33192
   220
  | pair_up _ t1 t2 = HOLogic.mk_prod (t1, t2)
blanchet@33192
   221
(* typ -> term -> term list * term list -> (term * term) list*)
blanchet@33192
   222
fun multi_pair_up T1 t1 (ts2, ts3) = map2 (pair o pair_up T1 t1) ts2 ts3
blanchet@33192
   223
blanchet@33192
   224
(* typ -> typ -> typ -> term -> term *)
blanchet@35665
   225
fun typecast_fun (Type (@{type_name fun}, [T1', T2'])) T1 T2 t =
blanchet@33192
   226
    let
blanchet@33565
   227
      (* typ -> typ -> typ -> typ -> term -> term *)
blanchet@33565
   228
      fun do_curry T1 T1a T1b T2 t =
blanchet@33192
   229
        let
blanchet@33192
   230
          val (maybe_opt, ps) = dest_plain_fun t
blanchet@33192
   231
          val ps =
blanchet@33565
   232
            ps |>> map (break_in_two T1 T1a T1b)
blanchet@33192
   233
               |> uncurry (map2 (fn (t1a, t1b) => fn t2 => (t1a, (t1b, t2))))
blanchet@33192
   234
               |> AList.coalesce (op =)
blanchet@33192
   235
               |> map (apsnd (make_plain_fun maybe_opt T1b T2))
blanchet@33192
   236
        in make_plain_fun maybe_opt T1a (T1b --> T2) ps end
blanchet@33192
   237
      (* typ -> typ -> term -> term *)
blanchet@33192
   238
      and do_uncurry T1 T2 t =
blanchet@33192
   239
        let
blanchet@33192
   240
          val (maybe_opt, tsp) = dest_plain_fun t
blanchet@33192
   241
          val ps =
blanchet@33192
   242
            tsp |> op ~~
blanchet@33192
   243
                |> maps (fn (t1, t2) =>
blanchet@33192
   244
                            multi_pair_up T1 t1 (snd (dest_plain_fun t2)))
blanchet@33192
   245
        in make_plain_fun maybe_opt T1 T2 ps end
blanchet@33192
   246
      (* typ -> typ -> typ -> typ -> term -> term *)
blanchet@33192
   247
      and do_arrow T1' T2' _ _ (Const (s, _)) = Const (s, T1' --> T2')
blanchet@33192
   248
        | do_arrow T1' T2' T1 T2
blanchet@33192
   249
                   (Const (@{const_name fun_upd}, _) $ t0 $ t1 $ t2) =
blanchet@33192
   250
          Const (@{const_name fun_upd},
blanchet@34124
   251
                 (T1' --> T2') --> T1' --> T2' --> T1' --> T2')
blanchet@33192
   252
          $ do_arrow T1' T2' T1 T2 t0 $ do_term T1' T1 t1 $ do_term T2' T2 t2
blanchet@33192
   253
        | do_arrow _ _ _ _ t =
blanchet@33232
   254
          raise TERM ("Nitpick_Model.typecast_fun.do_arrow", [t])
blanchet@33192
   255
      and do_fun T1' T2' T1 T2 t =
blanchet@33192
   256
        case factor_out_types T1' T1 of
blanchet@33192
   257
          ((_, NONE), (_, NONE)) => t |> do_arrow T1' T2' T1 T2
blanchet@33192
   258
        | ((_, NONE), (T1a, SOME T1b)) =>
blanchet@33565
   259
          t |> do_curry T1 T1a T1b T2 |> do_arrow T1' T2' T1a (T1b --> T2)
blanchet@33192
   260
        | ((T1a', SOME T1b'), (_, NONE)) =>
blanchet@33192
   261
          t |> do_arrow T1a' (T1b' --> T2') T1 T2 |> do_uncurry T1' T2'
blanchet@33232
   262
        | _ => raise TYPE ("Nitpick_Model.typecast_fun.do_fun", [T1, T1'], [])
blanchet@33192
   263
      (* typ -> typ -> term -> term *)
blanchet@35665
   264
      and do_term (Type (@{type_name fun}, [T1', T2']))
blanchet@35665
   265
                  (Type (@{type_name fun}, [T1, T2])) t =
blanchet@33192
   266
          do_fun T1' T2' T1 T2 t
blanchet@35665
   267
        | do_term (T' as Type (@{type_name "*"}, Ts' as [T1', T2']))
blanchet@35665
   268
                  (Type (@{type_name "*"}, [T1, T2]))
blanchet@33192
   269
                  (Const (@{const_name Pair}, _) $ t1 $ t2) =
blanchet@33192
   270
          Const (@{const_name Pair}, Ts' ---> T')
blanchet@33192
   271
          $ do_term T1' T1 t1 $ do_term T2' T2 t2
blanchet@33192
   272
        | do_term T' T t =
blanchet@33192
   273
          if T = T' then t
blanchet@33232
   274
          else raise TYPE ("Nitpick_Model.typecast_fun.do_term", [T, T'], [])
blanchet@33192
   275
    in if T1' = T1 andalso T2' = T2 then t else do_fun T1' T2' T1 T2 t end
blanchet@34998
   276
  | typecast_fun T' _ _ _ =
blanchet@34998
   277
    raise TYPE ("Nitpick_Model.typecast_fun", [T'], [])
blanchet@33192
   278
blanchet@33192
   279
(* term -> string *)
blanchet@33192
   280
fun truth_const_sort_key @{const True} = "0"
blanchet@33192
   281
  | truth_const_sort_key @{const False} = "2"
blanchet@33192
   282
  | truth_const_sort_key _ = "1"
blanchet@33192
   283
blanchet@33192
   284
(* typ -> term list -> term *)
blanchet@35665
   285
fun mk_tuple (Type (@{type_name "*"}, [T1, T2])) ts =
blanchet@33192
   286
    HOLogic.mk_prod (mk_tuple T1 ts,
blanchet@33192
   287
        mk_tuple T2 (List.drop (ts, length (HOLogic.flatten_tupleT T1))))
blanchet@33192
   288
  | mk_tuple _ (t :: _) = t
blanchet@34124
   289
  | mk_tuple T [] = raise TYPE ("Nitpick_Model.mk_tuple", [T], [])
blanchet@33192
   290
blanchet@35711
   291
(* theory -> typ * typ -> bool *)
blanchet@35711
   292
fun varified_type_match thy (candid_T, pat_T) =
blanchet@35711
   293
  strict_type_match thy (candid_T, Logic.varifyT pat_T)
blanchet@35711
   294
(* Proof.context -> typ -> term -> term *)
blanchet@35711
   295
fun postprocess_term ctxt T =
blanchet@35711
   296
  let val thy = ProofContext.theory_of ctxt in
blanchet@35711
   297
    if null (Data.get thy) then
blanchet@35711
   298
      I
blanchet@35711
   299
    else
blanchet@35711
   300
      (T |> AList.lookup (varified_type_match thy) (Data.get thy)
blanchet@35711
   301
         |> the_default (K (K I))) ctxt T
blanchet@35711
   302
  end
blanchet@35711
   303
blanchet@35280
   304
(* bool -> atom_pool -> (string * string) * (string * string) -> scope
blanchet@35280
   305
   -> nut list -> nut list -> nut list -> nut NameTable.table
blanchet@35280
   306
   -> KK.raw_bound list -> typ -> typ -> rep -> int list list -> term *)
blanchet@35280
   307
fun reconstruct_term unfold pool ((maybe_name, abs_name), _)
blanchet@35711
   308
        ({hol_ctxt as {ctxt, thy, stds, ...}, binarize, card_assigns, bits,
blanchet@35711
   309
          datatypes, ofs, ...} : scope) sel_names rel_table bounds =
blanchet@33192
   310
  let
blanchet@33192
   311
    val for_auto = (maybe_name = "")
blanchet@34124
   312
    (* int list list -> int *)
blanchet@34124
   313
    fun value_of_bits jss =
blanchet@34124
   314
      let
blanchet@34124
   315
        val j0 = offset_of_type ofs @{typ unsigned_bit}
blanchet@34124
   316
        val js = map (Integer.add (~ j0) o the_single) jss
blanchet@34124
   317
      in
blanchet@34124
   318
        fold (fn j => Integer.add (reasonable_power 2 j |> j = bits ? op ~))
blanchet@34124
   319
             js 0
blanchet@34124
   320
      end
blanchet@33192
   321
    (* bool -> typ -> typ -> (term * term) list -> term *)
blanchet@35388
   322
    fun make_set maybe_opt T1 T2 tps =
blanchet@33192
   323
      let
wenzelm@35402
   324
        val empty_const = Const (@{const_abbrev Set.empty}, T1 --> T2)
blanchet@33192
   325
        val insert_const = Const (@{const_name insert},
blanchet@34124
   326
                                  T1 --> (T1 --> T2) --> T1 --> T2)
blanchet@33192
   327
        (* (term * term) list -> term *)
blanchet@33192
   328
        fun aux [] =
blanchet@35385
   329
            if maybe_opt andalso not (is_complete_type datatypes false T1) then
blanchet@33192
   330
              insert_const $ Const (unrep, T1) $ empty_const
blanchet@33192
   331
            else
blanchet@33192
   332
              empty_const
blanchet@33192
   333
          | aux ((t1, t2) :: zs) =
blanchet@35388
   334
            aux zs
blanchet@35388
   335
            |> t2 <> @{const False}
blanchet@35388
   336
               ? curry (op $)
blanchet@35388
   337
                       (insert_const
blanchet@35388
   338
                        $ (t1 |> t2 <> @{const True}
blanchet@35388
   339
                                 ? curry (op $)
blanchet@35388
   340
                                         (Const (maybe_name, T1 --> T1))))
blanchet@35388
   341
      in
blanchet@35388
   342
        if forall (fn (_, t) => t <> @{const True} andalso t <> @{const False})
blanchet@35388
   343
                  tps then
blanchet@35388
   344
          Const (unknown, T1 --> T2)
blanchet@35388
   345
        else
blanchet@35388
   346
          aux tps
blanchet@35388
   347
      end
blanchet@35665
   348
    (* bool -> typ -> typ -> typ -> (term * term) list -> term *)
blanchet@35665
   349
    fun make_map maybe_opt T1 T2 T2' =
blanchet@33192
   350
      let
blanchet@33192
   351
        val update_const = Const (@{const_name fun_upd},
blanchet@34124
   352
                                  (T1 --> T2) --> T1 --> T2 --> T1 --> T2)
blanchet@33192
   353
        (* (term * term) list -> term *)
wenzelm@35402
   354
        fun aux' [] = Const (@{const_abbrev Map.empty}, T1 --> T2)
blanchet@33192
   355
          | aux' ((t1, t2) :: ps) =
blanchet@33192
   356
            (case t2 of
blanchet@33192
   357
               Const (@{const_name None}, _) => aux' ps
blanchet@33192
   358
             | _ => update_const $ aux' ps $ t1 $ t2)
blanchet@33192
   359
        fun aux ps =
blanchet@35665
   360
          if maybe_opt andalso not (is_complete_type datatypes false T1) then
blanchet@33192
   361
            update_const $ aux' ps $ Const (unrep, T1)
blanchet@33192
   362
            $ (Const (@{const_name Some}, T2' --> T2) $ Const (unknown, T2'))
blanchet@33192
   363
          else
blanchet@33192
   364
            aux' ps
blanchet@33192
   365
      in aux end
blanchet@33192
   366
    (* typ list -> term -> term *)
blanchet@34982
   367
    fun polish_funs Ts t =
blanchet@33192
   368
      (case fastype_of1 (Ts, t) of
blanchet@35665
   369
         Type (@{type_name fun}, [T1, T2]) =>
blanchet@33192
   370
         if is_plain_fun t then
blanchet@33192
   371
           case T2 of
blanchet@33192
   372
             @{typ bool} =>
blanchet@33192
   373
             let
blanchet@33192
   374
               val (maybe_opt, ts_pair) =
blanchet@34982
   375
                 dest_plain_fun t ||> pairself (map (polish_funs Ts))
blanchet@33192
   376
             in
blanchet@33192
   377
               make_set maybe_opt T1 T2
blanchet@33192
   378
                        (sort_wrt (truth_const_sort_key o snd) (op ~~ ts_pair))
blanchet@33192
   379
             end
blanchet@33192
   380
           | Type (@{type_name option}, [T2']) =>
blanchet@33192
   381
             let
blanchet@35665
   382
               val (maybe_opt, ts_pair) =
blanchet@35665
   383
                 dest_plain_fun t ||> pairself (map (polish_funs Ts))
blanchet@35665
   384
             in make_map maybe_opt T1 T2 T2' (rev (op ~~ ts_pair)) end
blanchet@33192
   385
           | _ => raise SAME ()
blanchet@33192
   386
         else
blanchet@33192
   387
           raise SAME ()
blanchet@33192
   388
       | _ => raise SAME ())
blanchet@33192
   389
      handle SAME () =>
blanchet@33192
   390
             case t of
blanchet@34982
   391
               (t1 as Const (@{const_name fun_upd}, _) $ t11 $ _)
blanchet@34982
   392
               $ (t2 as Const (s, _)) =>
blanchet@34982
   393
               if s = unknown then polish_funs Ts t11
blanchet@34982
   394
               else polish_funs Ts t1 $ polish_funs Ts t2
blanchet@34982
   395
             | t1 $ t2 => polish_funs Ts t1 $ polish_funs Ts t2
blanchet@34982
   396
             | Abs (s, T, t') => Abs (s, T, polish_funs (T :: Ts) t')
blanchet@35665
   397
             | Const (s, Type (@{type_name fun}, [T1, T2])) =>
blanchet@34982
   398
               if s = opt_flag orelse s = non_opt_flag then
blanchet@34982
   399
                 Abs ("x", T1, Const (unknown, T2))
blanchet@34982
   400
               else
blanchet@34982
   401
                 t
blanchet@34982
   402
             | t => t
blanchet@33192
   403
    (* bool -> typ -> typ -> typ -> term list -> term list -> term *)
blanchet@33192
   404
    fun make_fun maybe_opt T1 T2 T' ts1 ts2 =
blanchet@34126
   405
      ts1 ~~ ts2 |> sort (nice_term_ord o pairself fst)
blanchet@34998
   406
                 |> make_plain_fun maybe_opt T1 T2
blanchet@35665
   407
                 |> unarize_unbox_etc_term
blanchet@35665
   408
                 |> typecast_fun (uniterize_unarize_unbox_etc_type T')
blanchet@35665
   409
                                 (uniterize_unarize_unbox_etc_type T1)
blanchet@35665
   410
                                 (uniterize_unarize_unbox_etc_type T2)
blanchet@33192
   411
    (* (typ * int) list -> typ -> typ -> int -> term *)
blanchet@35665
   412
    fun term_for_atom seen (T as Type (@{type_name fun}, [T1, T2])) T' j _ =
blanchet@33192
   413
        let
blanchet@33192
   414
          val k1 = card_of_type card_assigns T1
blanchet@33192
   415
          val k2 = card_of_type card_assigns T2
blanchet@33192
   416
        in
blanchet@35665
   417
          term_for_rep true seen T T' (Vect (k1, Atom (k2, 0)))
blanchet@33192
   418
                       [nth_combination (replicate k1 (k2, 0)) j]
blanchet@33192
   419
          handle General.Subscript =>
blanchet@33232
   420
                 raise ARG ("Nitpick_Model.reconstruct_term.term_for_atom",
blanchet@33192
   421
                            signed_string_of_int j ^ " for " ^
blanchet@33192
   422
                            string_for_rep (Vect (k1, Atom (k2, 0))))
blanchet@33192
   423
        end
blanchet@35665
   424
      | term_for_atom seen (Type (@{type_name "*"}, [T1, T2])) _ j k =
blanchet@35075
   425
        let
blanchet@35075
   426
          val k1 = card_of_type card_assigns T1
blanchet@35075
   427
          val k2 = k div k1
blanchet@35075
   428
        in
blanchet@33192
   429
          list_comb (HOLogic.pair_const T1 T2,
blanchet@35075
   430
                     map3 (fn T => term_for_atom seen T T) [T1, T2]
blanchet@35075
   431
                          [j div k2, j mod k2] [k1, k2]) (* ### k2 or k1? FIXME *)
blanchet@33192
   432
        end
blanchet@35075
   433
      | term_for_atom seen @{typ prop} _ j k =
blanchet@35075
   434
        HOLogic.mk_Trueprop (term_for_atom seen bool_T bool_T j k)
blanchet@35075
   435
      | term_for_atom _ @{typ bool} _ j _ =
blanchet@33192
   436
        if j = 0 then @{const False} else @{const True}
blanchet@35075
   437
      | term_for_atom _ @{typ unit} _ _ _ = @{const Unity}
blanchet@35075
   438
      | term_for_atom seen T _ j k =
blanchet@35220
   439
        if T = nat_T andalso is_standard_datatype thy stds nat_T then
blanchet@33192
   440
          HOLogic.mk_number nat_T j
blanchet@33192
   441
        else if T = int_T then
blanchet@35075
   442
          HOLogic.mk_number int_T (int_for_atom (k, 0) j)
blanchet@33192
   443
        else if is_fp_iterator_type T then
blanchet@35075
   444
          HOLogic.mk_number nat_T (k - j - 1)
blanchet@33192
   445
        else if T = @{typ bisim_iterator} then
blanchet@33192
   446
          HOLogic.mk_number nat_T j
blanchet@33192
   447
        else case datatype_spec datatypes T of
blanchet@35076
   448
          NONE => nth_atom pool for_auto T j k
blanchet@35076
   449
        | SOME {deep = false, ...} => nth_atom pool for_auto T j k
blanchet@35179
   450
        | SOME {co, standard, constrs, ...} =>
blanchet@33192
   451
          let
blanchet@33192
   452
            (* styp -> int list *)
blanchet@33192
   453
            fun tuples_for_const (s, T) =
blanchet@33192
   454
              tuple_list_for_name rel_table bounds (ConstName (s, T, Any))
blanchet@35180
   455
            (* unit -> term *)
blanchet@35180
   456
            fun cyclic_atom () =
blanchet@35180
   457
              nth_atom pool for_auto (Type (cyclic_type_name, [])) j k
blanchet@35180
   458
            fun cyclic_var () = Var ((nth_atom_name pool "" T j k, 0), T)
blanchet@35180
   459
blanchet@33192
   460
            val discr_jsss = map (tuples_for_const o discr_for_constr o #const)
blanchet@33192
   461
                                 constrs
blanchet@33192
   462
            val real_j = j + offset_of_type ofs T
blanchet@33192
   463
            val constr_x as (constr_s, constr_T) =
blanchet@33192
   464
              get_first (fn (jss, {const, ...}) =>
blanchet@34121
   465
                            if member (op =) jss [real_j] then SOME const
blanchet@34121
   466
                            else NONE)
blanchet@33192
   467
                        (discr_jsss ~~ constrs) |> the
blanchet@33192
   468
            val arg_Ts = curried_binder_types constr_T
blanchet@35190
   469
            val sel_xs =
blanchet@35190
   470
              map (binarized_and_boxed_nth_sel_for_constr hol_ctxt binarize
blanchet@35190
   471
                                                          constr_x)
blanchet@35190
   472
                  (index_seq 0 (length arg_Ts))
blanchet@33192
   473
            val sel_Rs =
blanchet@33192
   474
              map (fn x => get_first
blanchet@33192
   475
                               (fn ConstName (s', T', R) =>
blanchet@33192
   476
                                   if (s', T') = x then SOME R else NONE
blanchet@33232
   477
                                 | u => raise NUT ("Nitpick_Model.reconstruct_\
blanchet@33192
   478
                                                   \term.term_for_atom", [u]))
blanchet@33192
   479
                               sel_names |> the) sel_xs
blanchet@33192
   480
            val arg_Rs = map (snd o dest_Func) sel_Rs
blanchet@33192
   481
            val sel_jsss = map tuples_for_const sel_xs
blanchet@33192
   482
            val arg_jsss =
blanchet@33192
   483
              map (map_filter (fn js => if hd js = real_j then SOME (tl js)
blanchet@33192
   484
                                        else NONE)) sel_jsss
blanchet@33192
   485
            val uncur_arg_Ts = binder_types constr_T
blanchet@35179
   486
            val maybe_cyclic = co orelse not standard
blanchet@33192
   487
          in
blanchet@35180
   488
            if maybe_cyclic andalso not (null seen) andalso
blanchet@35188
   489
               member (op =) (seen |> unfold ? (fst o split_last)) (T, j) then
blanchet@35180
   490
              cyclic_var ()
blanchet@34124
   491
            else if constr_s = @{const_name Word} then
blanchet@34124
   492
              HOLogic.mk_number
blanchet@34124
   493
                  (if T = @{typ "unsigned_bit word"} then nat_T else int_T)
blanchet@34124
   494
                  (value_of_bits (the_single arg_jsss))
blanchet@33192
   495
            else
blanchet@33192
   496
              let
blanchet@35179
   497
                val seen = seen |> maybe_cyclic ? cons (T, j)
blanchet@33192
   498
                val ts =
blanchet@33192
   499
                  if length arg_Ts = 0 then
blanchet@33192
   500
                    []
blanchet@33192
   501
                  else
blanchet@35665
   502
                    map3 (fn Ts =>
blanchet@35665
   503
                             term_for_rep (constr_s <> @{const_name FinFun})
blanchet@35665
   504
                                          seen Ts Ts) arg_Ts arg_Rs arg_jsss
blanchet@33192
   505
                    |> mk_tuple (HOLogic.mk_tupleT uncur_arg_Ts)
blanchet@33192
   506
                    |> dest_n_tuple (length uncur_arg_Ts)
blanchet@33192
   507
                val t =
blanchet@33192
   508
                  if constr_s = @{const_name Abs_Frac} then
blanchet@35711
   509
                    case ts of
blanchet@35711
   510
                      [Const (@{const_name Pair}, _) $ t1 $ t2] =>
blanchet@35711
   511
                      frac_from_term_pair (body_type T) t1 t2
blanchet@35711
   512
                    | _ => raise TERM ("Nitpick_Model.reconstruct_term.\
blanchet@35711
   513
                                       \term_for_atom (Abs_Frac)", ts)
blanchet@34936
   514
                  else if not for_auto andalso
blanchet@34936
   515
                          (is_abs_fun thy constr_x orelse
blanchet@34936
   516
                           constr_s = @{const_name Quot}) then
blanchet@33192
   517
                    Const (abs_name, constr_T) $ the_single ts
blanchet@33192
   518
                  else
blanchet@33192
   519
                    list_comb (Const constr_x, ts)
blanchet@33192
   520
              in
blanchet@35179
   521
                if maybe_cyclic then
blanchet@35180
   522
                  let val var = cyclic_var () in
blanchet@35188
   523
                    if unfold andalso not standard andalso
blanchet@35180
   524
                       length seen = 1 andalso
blanchet@35180
   525
                       exists_subterm (fn Const (s, _) =>
blanchet@35188
   526
                                          String.isPrefix cyclic_const_prefix s
blanchet@35180
   527
                                        | t' => t' = var) t then
blanchet@35188
   528
                      subst_atomic [(var, cyclic_atom ())] t
blanchet@35180
   529
                    else if exists_subterm (curry (op =) var) t then
blanchet@35179
   530
                      if co then
blanchet@35179
   531
                        Const (@{const_name The}, (T --> bool_T) --> T)
blanchet@35179
   532
                        $ Abs (cyclic_co_val_name, T,
blanchet@35179
   533
                               Const (@{const_name "op ="}, T --> T --> bool_T)
blanchet@35180
   534
                               $ Bound 0 $ abstract_over (var, t))
blanchet@35179
   535
                      else
blanchet@35180
   536
                        cyclic_atom ()
blanchet@33192
   537
                    else
blanchet@33192
   538
                      t
blanchet@33192
   539
                  end
blanchet@33192
   540
                else
blanchet@33192
   541
                  t
blanchet@33192
   542
              end
blanchet@33192
   543
          end
blanchet@35711
   544
          |> postprocess_term ctxt T
blanchet@33192
   545
    (* (typ * int) list -> int -> rep -> typ -> typ -> typ -> int list
blanchet@33192
   546
       -> term *)
blanchet@33192
   547
    and term_for_vect seen k R T1 T2 T' js =
blanchet@35075
   548
      make_fun true T1 T2 T'
blanchet@35075
   549
               (map (fn j => term_for_atom seen T1 T1 j k) (index_seq 0 k))
blanchet@35665
   550
               (map (term_for_rep true seen T2 T2 R o single)
blanchet@33192
   551
                    (batch_list (arity_of_rep R) js))
blanchet@35665
   552
    (* bool -> (typ * int) list -> typ -> typ -> rep -> int list list -> term *)
blanchet@35665
   553
    and term_for_rep _ seen T T' Unit [[]] = term_for_atom seen T T' 0 1
blanchet@35665
   554
      | term_for_rep _ seen T T' (R as Atom (k, j0)) [[j]] =
blanchet@35075
   555
        if j >= j0 andalso j < j0 + k then term_for_atom seen T T' (j - j0) k
blanchet@33232
   556
        else raise REP ("Nitpick_Model.reconstruct_term.term_for_rep", [R])
blanchet@35665
   557
      | term_for_rep _ seen (Type (@{type_name "*"}, [T1, T2])) _
blanchet@35665
   558
                     (Struct [R1, R2]) [js] =
blanchet@33192
   559
        let
blanchet@33192
   560
          val arity1 = arity_of_rep R1
blanchet@33192
   561
          val (js1, js2) = chop arity1 js
blanchet@33192
   562
        in
blanchet@33192
   563
          list_comb (HOLogic.pair_const T1 T2,
blanchet@35665
   564
                     map3 (fn T => term_for_rep true seen T T) [T1, T2] [R1, R2]
blanchet@33192
   565
                          [[js1], [js2]])
blanchet@33192
   566
        end
blanchet@35665
   567
      | term_for_rep _ seen (Type (@{type_name fun}, [T1, T2])) T'
blanchet@35665
   568
                     (Vect (k, R')) [js] =
blanchet@33192
   569
        term_for_vect seen k R' T1 T2 T' js
blanchet@35665
   570
      | term_for_rep _ seen (Type (@{type_name fun}, [T1, T2])) T'
blanchet@35665
   571
                     (Func (R1, Formula Neut)) jss =
blanchet@33192
   572
        let
blanchet@33192
   573
          val jss1 = all_combinations_for_rep R1
blanchet@35665
   574
          val ts1 = map (term_for_rep true seen T1 T1 R1 o single) jss1
blanchet@33192
   575
          val ts2 =
blanchet@35665
   576
            map (fn js => term_for_rep true seen T2 T2 (Atom (2, 0))
blanchet@35385
   577
                                       [[int_from_bool (member (op =) jss js)]])
blanchet@34121
   578
                jss1
blanchet@33192
   579
        in make_fun false T1 T2 T' ts1 ts2 end
blanchet@35665
   580
      | term_for_rep maybe_opt seen (Type (@{type_name fun}, [T1, T2])) T'
blanchet@35665
   581
                     (Func (R1, R2)) jss =
blanchet@33192
   582
        let
blanchet@33192
   583
          val arity1 = arity_of_rep R1
blanchet@33192
   584
          val jss1 = all_combinations_for_rep R1
blanchet@35665
   585
          val ts1 = map (term_for_rep false seen T1 T1 R1 o single) jss1
blanchet@33192
   586
          val grouped_jss2 = AList.group (op =) (map (chop arity1) jss)
blanchet@35665
   587
          val ts2 = map (term_for_rep false seen T2 T2 R2 o the_default []
blanchet@33192
   588
                         o AList.lookup (op =) grouped_jss2) jss1
blanchet@35665
   589
        in make_fun maybe_opt T1 T2 T' ts1 ts2 end
blanchet@35665
   590
      | term_for_rep _ seen T T' (Opt R) jss =
blanchet@35665
   591
        if null jss then Const (unknown, T)
blanchet@35665
   592
        else term_for_rep true seen T T' R jss
blanchet@35665
   593
      | term_for_rep _ _ T _ R jss =
blanchet@33232
   594
        raise ARG ("Nitpick_Model.reconstruct_term.term_for_rep",
blanchet@33192
   595
                   Refute.string_of_typ T ^ " " ^ string_for_rep R ^ " " ^
blanchet@33192
   596
                   string_of_int (length jss))
blanchet@35665
   597
  in polish_funs [] o unarize_unbox_etc_term oooo term_for_rep true [] end
blanchet@33192
   598
blanchet@35180
   599
(* atom_pool -> scope -> nut list -> nut NameTable.table -> KK.raw_bound list
blanchet@35180
   600
   -> nut -> term *)
blanchet@35180
   601
fun term_for_name pool scope sel_names rel_table bounds name =
blanchet@33192
   602
  let val T = type_of name in
blanchet@33192
   603
    tuple_list_for_name rel_table bounds name
blanchet@35280
   604
    |> reconstruct_term false pool (("", ""), ("", "")) scope sel_names
blanchet@35280
   605
                        rel_table bounds T T (rep_of name)
blanchet@33192
   606
  end
blanchet@33192
   607
blanchet@35280
   608
(* Proof.context -> ((string * string) * (string * string)) * Proof.context *)
blanchet@33192
   609
fun add_wacky_syntax ctxt =
blanchet@33192
   610
  let
blanchet@33192
   611
    (* term -> string *)
blanchet@33192
   612
    val name_of = fst o dest_Const
blanchet@33192
   613
    val thy = ProofContext.theory_of ctxt |> Context.reject_draft
blanchet@33192
   614
    val (maybe_t, thy) =
blanchet@33202
   615
      Sign.declare_const ((@{binding nitpick_maybe}, @{typ "'a => 'a"}),
blanchet@33202
   616
                          Mixfix (maybe_mixfix, [1000], 1000)) thy
blanchet@35280
   617
    val (abs_t, thy) =
blanchet@35280
   618
      Sign.declare_const ((@{binding nitpick_abs}, @{typ "'a => 'b"}),
blanchet@35280
   619
                          Mixfix (abs_mixfix, [40], 40)) thy
blanchet@33192
   620
    val (base_t, thy) =
blanchet@33202
   621
      Sign.declare_const ((@{binding nitpick_base}, @{typ "'a => 'a"}),
blanchet@33202
   622
                          Mixfix (base_mixfix, [1000], 1000)) thy
blanchet@33192
   623
    val (step_t, thy) =
blanchet@33202
   624
      Sign.declare_const ((@{binding nitpick_step}, @{typ "'a => 'a"}),
blanchet@33202
   625
                          Mixfix (step_mixfix, [1000], 1000)) thy
blanchet@33192
   626
  in
blanchet@35280
   627
    (pairself (pairself name_of) ((maybe_t, abs_t), (base_t, step_t)),
blanchet@33192
   628
     ProofContext.transfer_syntax thy ctxt)
blanchet@33192
   629
  end
blanchet@33192
   630
blanchet@33192
   631
(* term -> term *)
blanchet@33192
   632
fun unfold_outer_the_binders (t as Const (@{const_name The}, _)
blanchet@33192
   633
                                   $ Abs (s, T, Const (@{const_name "op ="}, _)
blanchet@33192
   634
                                                $ Bound 0 $ t')) =
blanchet@33192
   635
    betapply (Abs (s, T, t'), t) |> unfold_outer_the_binders
blanchet@33192
   636
  | unfold_outer_the_binders t = t
blanchet@33192
   637
(* typ list -> int -> term * term -> bool *)
blanchet@33192
   638
fun bisimilar_values _ 0 _ = true
blanchet@33192
   639
  | bisimilar_values coTs max_depth (t1, t2) =
blanchet@33192
   640
    let val T = fastype_of t1 in
blanchet@33192
   641
      if exists_subtype (member (op =) coTs) T then
blanchet@33192
   642
        let
blanchet@33192
   643
          val ((head1, args1), (head2, args2)) =
blanchet@33192
   644
            pairself (strip_comb o unfold_outer_the_binders) (t1, t2)
blanchet@34121
   645
          val max_depth = max_depth - (if member (op =) coTs T then 1 else 0)
blanchet@33192
   646
        in
blanchet@34936
   647
          head1 = head2 andalso
blanchet@34936
   648
          forall (bisimilar_values coTs max_depth) (args1 ~~ args2)
blanchet@33192
   649
        end
blanchet@33192
   650
      else
blanchet@33192
   651
        t1 = t2
blanchet@33192
   652
    end
blanchet@33192
   653
blanchet@33192
   654
(* params -> scope -> (term option * int list) list -> styp list -> nut list
blanchet@34126
   655
  -> nut list -> nut list -> nut NameTable.table -> KK.raw_bound list
blanchet@33192
   656
  -> Pretty.T * bool *)
blanchet@33192
   657
fun reconstruct_hol_model {show_skolems, show_datatypes, show_consts}
blanchet@35280
   658
        ({hol_ctxt = {thy, ctxt, max_bisim_depth, boxes, stds, wfs, user_axioms,
blanchet@35280
   659
                      debug, binary_ints, destroy_constrs, specialize,
blanchet@35280
   660
                      skolemize, star_linear_preds, uncurry, fast_descrs,
blanchet@35280
   661
                      tac_timeout, evals, case_names, def_table, nondef_table,
blanchet@35280
   662
                      user_nondefs, simp_table, psimp_table, intro_table,
blanchet@35280
   663
                      ground_thm_table, ersatz_table, skolems, special_funs,
blanchet@35280
   664
                      unrolled_preds, wf_cache, constr_cache},
blanchet@35190
   665
         binarize, card_assigns, bits, bisim_depth, datatypes, ofs} : scope)
blanchet@34124
   666
        formats all_frees free_names sel_names nonsel_names rel_table bounds =
blanchet@33192
   667
  let
blanchet@35180
   668
    val pool = Unsynchronized.ref []
blanchet@35280
   669
    val (wacky_names as (_, base_step_names), ctxt) =
blanchet@33192
   670
      add_wacky_syntax ctxt
blanchet@35070
   671
    val hol_ctxt =
blanchet@33192
   672
      {thy = thy, ctxt = ctxt, max_bisim_depth = max_bisim_depth, boxes = boxes,
blanchet@34982
   673
       stds = stds, wfs = wfs, user_axioms = user_axioms, debug = debug,
blanchet@34124
   674
       binary_ints = binary_ints, destroy_constrs = destroy_constrs,
blanchet@34124
   675
       specialize = specialize, skolemize = skolemize,
blanchet@34124
   676
       star_linear_preds = star_linear_preds, uncurry = uncurry,
blanchet@34124
   677
       fast_descrs = fast_descrs, tac_timeout = tac_timeout, evals = evals,
blanchet@34124
   678
       case_names = case_names, def_table = def_table,
blanchet@33192
   679
       nondef_table = nondef_table, user_nondefs = user_nondefs,
blanchet@33192
   680
       simp_table = simp_table, psimp_table = psimp_table,
blanchet@33192
   681
       intro_table = intro_table, ground_thm_table = ground_thm_table,
blanchet@33192
   682
       ersatz_table = ersatz_table, skolems = skolems,
blanchet@33192
   683
       special_funs = special_funs, unrolled_preds = unrolled_preds,
blanchet@33580
   684
       wf_cache = wf_cache, constr_cache = constr_cache}
blanchet@35190
   685
    val scope = {hol_ctxt = hol_ctxt, binarize = binarize,
blanchet@35190
   686
                 card_assigns = card_assigns, bits = bits,
blanchet@35190
   687
                 bisim_depth = bisim_depth, datatypes = datatypes, ofs = ofs}
blanchet@35180
   688
    (* bool -> typ -> typ -> rep -> int list list -> term *)
blanchet@35188
   689
    fun term_for_rep unfold =
blanchet@35188
   690
      reconstruct_term unfold pool wacky_names scope sel_names rel_table bounds
blanchet@35188
   691
    (* nat -> typ -> nat -> term *)
blanchet@35180
   692
    fun nth_value_of_type card T n =
blanchet@35188
   693
      let
blanchet@35188
   694
        (* bool -> term *)
blanchet@35188
   695
        fun aux unfold = term_for_rep unfold T T (Atom (card, 0)) [[n]]
blanchet@35188
   696
      in
blanchet@35188
   697
        case aux false of
blanchet@35188
   698
          t as Const (s, _) =>
blanchet@35188
   699
          if String.isPrefix cyclic_const_prefix s then
blanchet@35188
   700
            HOLogic.mk_eq (t, aux true)
blanchet@35188
   701
          else
blanchet@35188
   702
            t
blanchet@35188
   703
        | t => t
blanchet@35188
   704
      end
blanchet@34124
   705
    (* nat -> typ -> typ list *)
blanchet@34124
   706
    fun all_values_of_type card T =
blanchet@34124
   707
      index_seq 0 card |> map (nth_value_of_type card T) |> sort nice_term_ord
blanchet@33192
   708
    (* dtype_spec list -> dtype_spec -> bool *)
blanchet@33192
   709
    fun is_codatatype_wellformed (cos : dtype_spec list)
blanchet@33192
   710
                                 ({typ, card, ...} : dtype_spec) =
blanchet@33192
   711
      let
blanchet@34124
   712
        val ts = all_values_of_type card typ
blanchet@33192
   713
        val max_depth = Integer.sum (map #card cos)
blanchet@33192
   714
      in
blanchet@33192
   715
        forall (not o bisimilar_values (map #typ cos) max_depth)
blanchet@33192
   716
               (all_distinct_unordered_pairs_of ts)
blanchet@33192
   717
      end
blanchet@33192
   718
    (* string -> Pretty.T *)
blanchet@33192
   719
    fun pretty_for_assign name =
blanchet@33192
   720
      let
blanchet@33192
   721
        val (oper, (t1, T'), T) =
blanchet@33192
   722
          case name of
blanchet@33192
   723
            FreeName (s, T, _) =>
blanchet@35665
   724
            let val t = Free (s, uniterize_unarize_unbox_etc_type T) in
blanchet@33192
   725
              ("=", (t, format_term_type thy def_table formats t), T)
blanchet@33192
   726
            end
blanchet@33192
   727
          | ConstName (s, T, _) =>
blanchet@33192
   728
            (assign_operator_for_const (s, T),
blanchet@35280
   729
             user_friendly_const hol_ctxt base_step_names formats (s, T), T)
blanchet@33232
   730
          | _ => raise NUT ("Nitpick_Model.reconstruct_hol_model.\
blanchet@33192
   731
                            \pretty_for_assign", [name])
blanchet@33192
   732
        val t2 = if rep_of name = Any then
blanchet@33192
   733
                   Const (@{const_name undefined}, T')
blanchet@33192
   734
                 else
blanchet@33192
   735
                   tuple_list_for_name rel_table bounds name
blanchet@35180
   736
                   |> term_for_rep false T T' (rep_of name)
blanchet@33192
   737
      in
blanchet@33192
   738
        Pretty.block (Pretty.breaks
blanchet@33571
   739
            [setmp_show_all_types (Syntax.pretty_term ctxt) t1,
blanchet@33192
   740
             Pretty.str oper, Syntax.pretty_term ctxt t2])
blanchet@33192
   741
      end
blanchet@33192
   742
    (* dtype_spec -> Pretty.T *)
blanchet@34123
   743
    fun pretty_for_datatype ({typ, card, complete, ...} : dtype_spec) =
blanchet@33192
   744
      Pretty.block (Pretty.breaks
blanchet@35665
   745
          (Syntax.pretty_typ ctxt (uniterize_unarize_unbox_etc_type typ) ::
blanchet@35665
   746
           (case typ of
blanchet@35665
   747
              Type (@{type_name fin_fun}, _) => [Pretty.str "[finite]"]
blanchet@35665
   748
            | Type (@{type_name fun_box}, _) => [Pretty.str "[boxed]"]
blanchet@35665
   749
            | Type (@{type_name pair_box}, _) => [Pretty.str "[boxed]"]
blanchet@35665
   750
            | _ => []) @
blanchet@35665
   751
           [Pretty.str "=",
blanchet@35665
   752
            Pretty.enum "," "{" "}"
blanchet@35665
   753
                (map (Syntax.pretty_term ctxt) (all_values_of_type card typ) @
blanchet@35665
   754
                 (if fun_from_pair complete false then []
blanchet@35665
   755
                  else [Pretty.str unrep]))]))
blanchet@33192
   756
    (* typ -> dtype_spec list *)
blanchet@33192
   757
    fun integer_datatype T =
blanchet@33192
   758
      [{typ = T, card = card_of_type card_assigns T, co = false,
blanchet@35385
   759
        standard = true, complete = (false, false), concrete = (true, true),
blanchet@35385
   760
        deep = true, constrs = []}]
blanchet@33232
   761
      handle TYPE ("Nitpick_HOL.card_of_type", _, _) => []
blanchet@33192
   762
    val (codatatypes, datatypes) =
blanchet@34982
   763
      datatypes |> filter #deep |> List.partition #co
blanchet@35220
   764
                ||> append (integer_datatype int_T
blanchet@35220
   765
                            |> is_standard_datatype thy stds nat_T
blanchet@35220
   766
                               ? append (integer_datatype nat_T))
blanchet@33192
   767
    val block_of_datatypes =
blanchet@33192
   768
      if show_datatypes andalso not (null datatypes) then
blanchet@33192
   769
        [Pretty.big_list ("Datatype" ^ plural_s_for_list datatypes ^ ":")
blanchet@33192
   770
                         (map pretty_for_datatype datatypes)]
blanchet@33192
   771
      else
blanchet@33192
   772
        []
blanchet@33192
   773
    val block_of_codatatypes =
blanchet@33192
   774
      if show_datatypes andalso not (null codatatypes) then
blanchet@33192
   775
        [Pretty.big_list ("Codatatype" ^ plural_s_for_list codatatypes ^ ":")
blanchet@33192
   776
                         (map pretty_for_datatype codatatypes)]
blanchet@33192
   777
      else
blanchet@33192
   778
        []
blanchet@33192
   779
    (* bool -> string -> nut list -> Pretty.T list *)
blanchet@33192
   780
    fun block_of_names show title names =
blanchet@33192
   781
      if show andalso not (null names) then
blanchet@33192
   782
        Pretty.str (title ^ plural_s_for_list names ^ ":")
blanchet@33192
   783
        :: map (Pretty.indent indent_size o pretty_for_assign)
blanchet@33192
   784
               (sort_wrt (original_name o nickname_of) names)
blanchet@33192
   785
      else
blanchet@33192
   786
        []
blanchet@33192
   787
    val (skolem_names, nonskolem_nonsel_names) =
blanchet@33192
   788
      List.partition is_skolem_name nonsel_names
blanchet@33192
   789
    val (eval_names, noneval_nonskolem_nonsel_names) =
blanchet@33192
   790
      List.partition (String.isPrefix eval_prefix o nickname_of)
blanchet@33192
   791
                     nonskolem_nonsel_names
blanchet@35665
   792
      ||> filter_out (member (op =) [@{const_name bisim},
blanchet@35665
   793
                                     @{const_name bisim_iterator_max}]
blanchet@34121
   794
                      o nickname_of)
blanchet@33192
   795
    val free_names =
blanchet@33192
   796
      map (fn x as (s, T) =>
blanchet@34121
   797
              case filter (curry (op =) x
blanchet@35280
   798
                       o pairf nickname_of
blanchet@35665
   799
                               (uniterize_unarize_unbox_etc_type o type_of))
blanchet@35190
   800
                       free_names of
blanchet@33192
   801
                [name] => name
blanchet@33192
   802
              | [] => FreeName (s, T, Any)
blanchet@33232
   803
              | _ => raise TERM ("Nitpick_Model.reconstruct_hol_model",
blanchet@33192
   804
                                 [Const x])) all_frees
blanchet@33192
   805
    val chunks = block_of_names true "Free variable" free_names @
blanchet@33192
   806
                 block_of_names show_skolems "Skolem constant" skolem_names @
blanchet@33192
   807
                 block_of_names true "Evaluated term" eval_names @
blanchet@33192
   808
                 block_of_datatypes @ block_of_codatatypes @
blanchet@33192
   809
                 block_of_names show_consts "Constant"
blanchet@33192
   810
                                noneval_nonskolem_nonsel_names
blanchet@33192
   811
  in
blanchet@33192
   812
    (Pretty.chunks (if null chunks then [Pretty.str "Empty assignment"]
blanchet@33192
   813
                    else chunks),
blanchet@34936
   814
     bisim_depth >= 0 orelse
blanchet@34936
   815
     forall (is_codatatype_wellformed codatatypes) codatatypes)
blanchet@33192
   816
  end
blanchet@33192
   817
blanchet@33192
   818
(* scope -> Time.time option -> nut list -> nut list -> nut NameTable.table
blanchet@34126
   819
   -> KK.raw_bound list -> term -> bool option *)
blanchet@35280
   820
fun prove_hol_model (scope as {hol_ctxt = {thy, ctxt, debug, ...},
blanchet@34998
   821
                               card_assigns, ...})
blanchet@33192
   822
                    auto_timeout free_names sel_names rel_table bounds prop =
blanchet@33192
   823
  let
blanchet@35076
   824
    val pool = Unsynchronized.ref []
blanchet@33192
   825
    (* typ * int -> term *)
blanchet@33192
   826
    fun free_type_assm (T, k) =
blanchet@33192
   827
      let
blanchet@33192
   828
        (* int -> term *)
blanchet@35076
   829
        fun atom j = nth_atom pool true T j k
blanchet@33192
   830
        fun equation_for_atom j = HOLogic.eq_const T $ Bound 0 $ atom j
blanchet@33192
   831
        val eqs = map equation_for_atom (index_seq 0 k)
blanchet@33192
   832
        val compreh_assm =
blanchet@33192
   833
          Const (@{const_name All}, (T --> bool_T) --> bool_T)
blanchet@33192
   834
              $ Abs ("x", T, foldl1 HOLogic.mk_disj eqs)
blanchet@33192
   835
        val distinct_assm = distinctness_formula T (map atom (index_seq 0 k))
blanchet@34998
   836
      in s_conj (compreh_assm, distinct_assm) end
blanchet@33192
   837
    (* nut -> term *)
blanchet@33192
   838
    fun free_name_assm name =
blanchet@33192
   839
      HOLogic.mk_eq (Free (nickname_of name, type_of name),
blanchet@35180
   840
                     term_for_name pool scope sel_names rel_table bounds name)
blanchet@33192
   841
    val freeT_assms = map free_type_assm (filter (is_TFree o fst) card_assigns)
blanchet@33192
   842
    val model_assms = map free_name_assm free_names
blanchet@34998
   843
    val assm = foldr1 s_conj (freeT_assms @ model_assms)
blanchet@33192
   844
    (* bool -> bool *)
blanchet@33192
   845
    fun try_out negate =
blanchet@33192
   846
      let
blanchet@33192
   847
        val concl = (negate ? curry (op $) @{const Not})
wenzelm@35625
   848
                    (Object_Logic.atomize_term thy prop)
blanchet@34998
   849
        val prop = HOLogic.mk_Trueprop (HOLogic.mk_imp (assm, concl))
blanchet@33192
   850
                   |> map_types (map_type_tfree
blanchet@34998
   851
                                     (fn (s, []) => TFree (s, HOLogic.typeS)
blanchet@34998
   852
                                       | x => TFree x))
blanchet@34998
   853
       val _ = if debug then
blanchet@34998
   854
                 priority ((if negate then "Genuineness" else "Spuriousness") ^
blanchet@34998
   855
                           " goal: " ^ Syntax.string_of_term ctxt prop ^ ".")
blanchet@34998
   856
               else
blanchet@34998
   857
                 ()
blanchet@34998
   858
        val goal = prop |> cterm_of thy |> Goal.init
blanchet@33192
   859
      in
blanchet@33192
   860
        (goal |> SINGLE (DETERM_TIMEOUT auto_timeout
blanchet@33192
   861
                                        (auto_tac (clasimpset_of ctxt)))
blanchet@33192
   862
              |> the |> Goal.finish ctxt; true)
blanchet@33192
   863
        handle THM _ => false
blanchet@33192
   864
             | TimeLimit.TimeOut => false
blanchet@33192
   865
      end
blanchet@33192
   866
  in
blanchet@33705
   867
    if try_out false then SOME true
blanchet@33705
   868
    else if try_out true then SOME false
blanchet@33192
   869
    else NONE
blanchet@33192
   870
  end
blanchet@33192
   871
blanchet@33192
   872
end;