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