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