src/HOL/Tools/Nitpick/nitpick_model.ML
author blanchet
Fri Dec 04 17:19:59 2009 +0100 (2009-12-04)
changeset 33982 1ae222745c4a
parent 33884 a0c43f185fef
child 34121 5e831d805118
permissions -rw-r--r--
fixed paths in Nitpick's ML file headers
     1 (*  Title:      HOL/Tools/Nitpick/nitpick_model.ML
     2     Author:     Jasmin Blanchette, TU Muenchen
     3     Copyright   2009
     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_skolems: bool,
    17     show_datatypes: bool,
    18     show_consts: bool}
    19 
    20   structure NameTable : TABLE
    21 
    22   val tuple_list_for_name :
    23     nut NameTable.table -> Kodkod.raw_bound list -> nut -> int list list
    24   val reconstruct_hol_model :
    25     params -> scope -> (term option * int list) list -> styp list -> nut list
    26     -> nut list -> nut list -> nut NameTable.table -> Kodkod.raw_bound list
    27     -> Pretty.T * bool
    28   val prove_hol_model :
    29     scope -> Time.time option -> nut list -> nut list -> nut NameTable.table
    30     -> Kodkod.raw_bound list -> term -> bool option
    31 end;
    32 
    33 structure Nitpick_Model : NITPICK_MODEL =
    34 struct
    35 
    36 open Nitpick_Util
    37 open Nitpick_HOL
    38 open Nitpick_Scope
    39 open Nitpick_Peephole
    40 open Nitpick_Rep
    41 open Nitpick_Nut
    42 
    43 type params = {
    44   show_skolems: bool,
    45   show_datatypes: bool,
    46   show_consts: bool}
    47 
    48 val unknown = "?"
    49 val unrep = "\<dots>"
    50 val maybe_mixfix = "_\<^sup>?"
    51 val base_mixfix = "_\<^bsub>base\<^esub>"
    52 val step_mixfix = "_\<^bsub>step\<^esub>"
    53 val abs_mixfix = "\<guillemotleft>_\<guillemotright>"
    54 val non_opt_name = nitpick_prefix ^ "non_opt"
    55 
    56 (* string -> int -> string *)
    57 fun atom_suffix s j =
    58   nat_subscript (j + 1)
    59   |> (s <> "" andalso Symbol.is_ascii_digit (List.last (explode s)))
    60      ? prefix "\<^isub>,"
    61 (* string -> typ -> int -> string *)
    62 fun atom_name prefix (T as Type (s, _)) j =
    63     prefix ^ substring (short_name s, 0, 1) ^ atom_suffix s j
    64   | atom_name prefix (T as TFree (s, _)) j =
    65     prefix ^ perhaps (try (unprefix "'")) s ^ atom_suffix s j
    66   | atom_name _ T _ = raise TYPE ("Nitpick_Model.atom_name", [T], [])
    67 (* bool -> typ -> int -> term *)
    68 fun atom for_auto T j =
    69   if for_auto then
    70     Free (atom_name (hd (space_explode "." nitpick_prefix)) T j, T)
    71   else
    72     Const (atom_name "" T j, T)
    73 
    74 (* nut NameTable.table -> Kodkod.raw_bound list -> nut -> int list list *)
    75 fun tuple_list_for_name rel_table bounds name =
    76   the (AList.lookup (op =) bounds (the_rel rel_table name)) handle NUT _ => [[]]
    77 
    78 (* term -> term *)
    79 fun unbox_term (Const (@{const_name FunBox}, _) $ t1) = unbox_term t1
    80   | unbox_term (Const (@{const_name PairBox},
    81                        Type ("fun", [T1, Type ("fun", [T2, T3])])) $ t1 $ t2) =
    82     let val Ts = map unbox_type [T1, T2] in
    83       Const (@{const_name Pair}, Ts ---> Type ("*", Ts))
    84       $ unbox_term t1 $ unbox_term t2
    85     end
    86   | unbox_term (Const (s, T)) = Const (s, unbox_type T)
    87   | unbox_term (t1 $ t2) = unbox_term t1 $ unbox_term t2
    88   | unbox_term (Free (s, T)) = Free (s, unbox_type T)
    89   | unbox_term (Var (x, T)) = Var (x, unbox_type T)
    90   | unbox_term (Bound j) = Bound j
    91   | unbox_term (Abs (s, T, t')) = Abs (s, unbox_type T, unbox_term t')
    92 
    93 (* typ -> typ -> (typ * typ) * (typ * typ) *)
    94 fun factor_out_types (T1 as Type ("*", [T11, T12]))
    95                      (T2 as Type ("*", [T21, T22])) =
    96     let val (n1, n2) = pairself num_factors_in_type (T11, T21) in
    97       if n1 = n2 then
    98         let
    99           val ((T11', opt_T12'), (T21', opt_T22')) = factor_out_types T12 T22
   100         in
   101           ((Type ("*", [T11, T11']), opt_T12'),
   102            (Type ("*", [T21, T21']), opt_T22'))
   103         end
   104       else if n1 < n2 then
   105         case factor_out_types T1 T21 of
   106           (p1, (T21', NONE)) => (p1, (T21', SOME T22))
   107         | (p1, (T21', SOME T22')) =>
   108           (p1, (T21', SOME (Type ("*", [T22', T22]))))
   109       else
   110         swap (factor_out_types T2 T1)
   111     end
   112   | factor_out_types (Type ("*", [T11, T12])) T2 = ((T11, SOME T12), (T2, NONE))
   113   | factor_out_types T1 (Type ("*", [T21, T22])) = ((T1, NONE), (T21, SOME T22))
   114   | factor_out_types T1 T2 = ((T1, NONE), (T2, NONE))
   115 
   116 (* bool -> typ -> typ -> (term * term) list -> term *)
   117 fun make_plain_fun maybe_opt T1 T2 =
   118   let
   119     (* typ -> typ -> (term * term) list -> term *)
   120     fun aux T1 T2 [] =
   121         Const (if maybe_opt orelse T2 <> bool_T then @{const_name undefined}
   122                else non_opt_name, T1 --> T2)
   123       | aux T1 T2 ((t1, t2) :: ps) =
   124         Const (@{const_name fun_upd}, [T1 --> T2, T1, T2] ---> T1 --> T2)
   125         $ aux T1 T2 ps $ t1 $ t2
   126   in aux T1 T2 o rev end
   127 (* term -> bool *)
   128 fun is_plain_fun (Const (s, _)) = s mem [@{const_name undefined}, non_opt_name]
   129   | is_plain_fun (Const (@{const_name fun_upd}, _) $ t0 $ _ $ _) =
   130     is_plain_fun t0
   131   | is_plain_fun _ = false
   132 (* term -> bool * (term list * term list) *)
   133 val dest_plain_fun =
   134   let
   135     (* term -> term list * term list *)
   136     fun aux (Const (s, _)) = (s <> non_opt_name, ([], []))
   137       | aux (Const (@{const_name fun_upd}, _) $ t0 $ t1 $ t2) =
   138         let val (s, (ts1, ts2)) = aux t0 in (s, (t1 :: ts1, t2 :: ts2)) end
   139       | aux t = raise TERM ("Nitpick_Model.dest_plain_fun", [t])
   140   in apsnd (pairself rev) o aux end
   141 
   142 (* typ -> typ -> typ -> term -> term * term *)
   143 fun break_in_two T T1 T2 t =
   144   let
   145     val ps = HOLogic.flat_tupleT_paths T
   146     val cut = length (HOLogic.strip_tupleT T1)
   147     val (ps1, ps2) = pairself HOLogic.flat_tupleT_paths (T1, T2)
   148     val (ts1, ts2) = t |> HOLogic.strip_ptuple ps |> chop cut
   149   in (HOLogic.mk_ptuple ps1 T1 ts1, HOLogic.mk_ptuple ps2 T2 ts2) end
   150 (* typ -> term -> term -> term *)
   151 fun pair_up (Type ("*", [T1', T2']))
   152             (t1 as Const (@{const_name Pair},
   153                           Type ("fun", [_, Type ("fun", [_, T1])])) $ t11 $ t12)
   154             t2 =
   155     if T1 = T1' then HOLogic.mk_prod (t1, t2)
   156     else HOLogic.mk_prod (t11, pair_up T2' t12 t2)
   157   | pair_up _ t1 t2 = HOLogic.mk_prod (t1, t2)
   158 (* typ -> term -> term list * term list -> (term * term) list*)
   159 fun multi_pair_up T1 t1 (ts2, ts3) = map2 (pair o pair_up T1 t1) ts2 ts3
   160 
   161 (* typ -> typ -> typ -> term -> term *)
   162 fun typecast_fun (Type ("fun", [T1', T2'])) T1 T2 t =
   163     let
   164       (* typ -> typ -> typ -> typ -> term -> term *)
   165       fun do_curry T1 T1a T1b T2 t =
   166         let
   167           val (maybe_opt, ps) = dest_plain_fun t
   168           val ps =
   169             ps |>> map (break_in_two T1 T1a T1b)
   170                |> uncurry (map2 (fn (t1a, t1b) => fn t2 => (t1a, (t1b, t2))))
   171                |> AList.coalesce (op =)
   172                |> map (apsnd (make_plain_fun maybe_opt T1b T2))
   173         in make_plain_fun maybe_opt T1a (T1b --> T2) ps end
   174       (* typ -> typ -> term -> term *)
   175       and do_uncurry T1 T2 t =
   176         let
   177           val (maybe_opt, tsp) = dest_plain_fun t
   178           val ps =
   179             tsp |> op ~~
   180                 |> maps (fn (t1, t2) =>
   181                             multi_pair_up T1 t1 (snd (dest_plain_fun t2)))
   182         in make_plain_fun maybe_opt T1 T2 ps end
   183       (* typ -> typ -> typ -> typ -> term -> term *)
   184       and do_arrow T1' T2' _ _ (Const (s, _)) = Const (s, T1' --> T2')
   185         | do_arrow T1' T2' T1 T2
   186                    (Const (@{const_name fun_upd}, _) $ t0 $ t1 $ t2) =
   187           Const (@{const_name fun_upd},
   188                  [T1' --> T2', T1', T2'] ---> T1' --> T2')
   189           $ do_arrow T1' T2' T1 T2 t0 $ do_term T1' T1 t1 $ do_term T2' T2 t2
   190         | do_arrow _ _ _ _ t =
   191           raise TERM ("Nitpick_Model.typecast_fun.do_arrow", [t])
   192       and do_fun T1' T2' T1 T2 t =
   193         case factor_out_types T1' T1 of
   194           ((_, NONE), (_, NONE)) => t |> do_arrow T1' T2' T1 T2
   195         | ((_, NONE), (T1a, SOME T1b)) =>
   196           t |> do_curry T1 T1a T1b T2 |> do_arrow T1' T2' T1a (T1b --> T2)
   197         | ((T1a', SOME T1b'), (_, NONE)) =>
   198           t |> do_arrow T1a' (T1b' --> T2') T1 T2 |> do_uncurry T1' T2'
   199         | _ => raise TYPE ("Nitpick_Model.typecast_fun.do_fun", [T1, T1'], [])
   200       (* typ -> typ -> term -> term *)
   201       and do_term (Type ("fun", [T1', T2'])) (Type ("fun", [T1, T2])) t =
   202           do_fun T1' T2' T1 T2 t
   203         | do_term (T' as Type ("*", Ts' as [T1', T2'])) (Type ("*", [T1, T2]))
   204                   (Const (@{const_name Pair}, _) $ t1 $ t2) =
   205           Const (@{const_name Pair}, Ts' ---> T')
   206           $ do_term T1' T1 t1 $ do_term T2' T2 t2
   207         | do_term T' T t =
   208           if T = T' then t
   209           else raise TYPE ("Nitpick_Model.typecast_fun.do_term", [T, T'], [])
   210     in if T1' = T1 andalso T2' = T2 then t else do_fun T1' T2' T1 T2 t end
   211   | typecast_fun T' _ _ _ = raise TYPE ("Nitpick_Model.typecast_fun", [T'], [])
   212 
   213 (* term -> string *)
   214 fun truth_const_sort_key @{const True} = "0"
   215   | truth_const_sort_key @{const False} = "2"
   216   | truth_const_sort_key _ = "1"
   217 
   218 (* typ -> term list -> term *)
   219 fun mk_tuple (Type ("*", [T1, T2])) ts =
   220     HOLogic.mk_prod (mk_tuple T1 ts,
   221         mk_tuple T2 (List.drop (ts, length (HOLogic.flatten_tupleT T1))))
   222   | mk_tuple _ (t :: _) = t
   223 
   224 (* string * string * string * string -> scope -> nut list -> nut list
   225    -> nut list -> nut NameTable.table -> Kodkod.raw_bound list -> typ -> typ
   226    -> rep -> int list list -> term *)
   227 fun reconstruct_term (maybe_name, base_name, step_name, abs_name)
   228         ({ext_ctxt as {thy, ctxt, ...}, card_assigns, datatypes, ofs, ...}
   229          : scope) sel_names rel_table bounds =
   230   let
   231     val for_auto = (maybe_name = "")
   232     (* bool -> typ -> typ -> (term * term) list -> term *)
   233     fun make_set maybe_opt T1 T2 =
   234       let
   235         val empty_const = Const (@{const_name Set.empty}, T1 --> T2)
   236         val insert_const = Const (@{const_name insert},
   237                                   [T1, T1 --> T2] ---> T1 --> T2)
   238         (* (term * term) list -> term *)
   239         fun aux [] =
   240             if maybe_opt andalso not (is_precise_type datatypes T1) then
   241               insert_const $ Const (unrep, T1) $ empty_const
   242             else
   243               empty_const
   244           | aux ((t1, t2) :: zs) =
   245             aux zs |> t2 <> @{const False}
   246                       ? curry (op $) (insert_const
   247                                       $ (t1 |> t2 <> @{const True}
   248                                                ? curry (op $)
   249                                                        (Const (maybe_name,
   250                                                                T1 --> T1))))
   251       in aux end
   252     (* typ -> typ -> typ -> (term * term) list -> term *)
   253     fun make_map T1 T2 T2' =
   254       let
   255         val update_const = Const (@{const_name fun_upd},
   256                                   [T1 --> T2, T1, T2] ---> T1 --> T2)
   257         (* (term * term) list -> term *)
   258         fun aux' [] = Const (@{const_name Map.empty}, T1 --> T2)
   259           | aux' ((t1, t2) :: ps) =
   260             (case t2 of
   261                Const (@{const_name None}, _) => aux' ps
   262              | _ => update_const $ aux' ps $ t1 $ t2)
   263         fun aux ps =
   264           if not (is_precise_type datatypes T1) then
   265             update_const $ aux' ps $ Const (unrep, T1)
   266             $ (Const (@{const_name Some}, T2' --> T2) $ Const (unknown, T2'))
   267           else
   268             aux' ps
   269       in aux end
   270     (* typ list -> term -> term *)
   271     fun setify_mapify_funs Ts t =
   272       (case fastype_of1 (Ts, t) of
   273          Type ("fun", [T1, T2]) =>
   274          if is_plain_fun t then
   275            case T2 of
   276              @{typ bool} =>
   277              let
   278                val (maybe_opt, ts_pair) =
   279                  dest_plain_fun t ||> pairself (map (setify_mapify_funs Ts))
   280              in
   281                make_set maybe_opt T1 T2
   282                         (sort_wrt (truth_const_sort_key o snd) (op ~~ ts_pair))
   283              end
   284            | Type (@{type_name option}, [T2']) =>
   285              let
   286                val ts_pair = snd (dest_plain_fun t)
   287                              |> pairself (map (setify_mapify_funs Ts))
   288              in make_map T1 T2 T2' (rev (op ~~ ts_pair)) end
   289            | _ => raise SAME ()
   290          else
   291            raise SAME ()
   292        | _ => raise SAME ())
   293       handle SAME () =>
   294              case t of
   295                t1 $ t2 => setify_mapify_funs Ts t1 $ setify_mapify_funs Ts t2
   296              | Abs (s, T, t') => Abs (s, T, setify_mapify_funs (T :: Ts) t')
   297              | _ => t
   298     (* bool -> typ -> typ -> typ -> term list -> term list -> term *)
   299     fun make_fun maybe_opt T1 T2 T' ts1 ts2 =
   300       ts1 ~~ ts2 |> T1 = @{typ bisim_iterator} ? rev
   301                  |> make_plain_fun (maybe_opt andalso not for_auto) T1 T2
   302                  |> unbox_term
   303                  |> typecast_fun (unbox_type T') (unbox_type T1) (unbox_type T2)
   304     (* (typ * int) list -> typ -> typ -> int -> term *)
   305     fun term_for_atom seen (T as Type ("fun", [T1, T2])) T' j =
   306         let
   307           val k1 = card_of_type card_assigns T1
   308           val k2 = card_of_type card_assigns T2
   309         in
   310           term_for_rep seen T T' (Vect (k1, Atom (k2, 0)))
   311                        [nth_combination (replicate k1 (k2, 0)) j]
   312           handle General.Subscript =>
   313                  raise ARG ("Nitpick_Model.reconstruct_term.term_for_atom",
   314                             signed_string_of_int j ^ " for " ^
   315                             string_for_rep (Vect (k1, Atom (k2, 0))))
   316         end
   317       | term_for_atom seen (Type ("*", [T1, T2])) _ j =
   318         let val k1 = card_of_type card_assigns T1 in
   319           list_comb (HOLogic.pair_const T1 T2,
   320                      map2 (fn T => term_for_atom seen T T) [T1, T2]
   321                           [j div k1, j mod k1])
   322         end
   323       | term_for_atom seen @{typ prop} _ j =
   324         HOLogic.mk_Trueprop (term_for_atom seen bool_T bool_T j)
   325       | term_for_atom _ @{typ bool} _ j =
   326         if j = 0 then @{const False} else @{const True}
   327       | term_for_atom _ @{typ unit} _ _ = @{const Unity}
   328       | term_for_atom seen T _ j =
   329         if T = nat_T then
   330           HOLogic.mk_number nat_T j
   331         else if T = int_T then
   332           HOLogic.mk_number int_T
   333               (int_for_atom (card_of_type card_assigns int_T, 0) j)
   334         else if is_fp_iterator_type T then
   335           HOLogic.mk_number nat_T (card_of_type card_assigns T - j - 1)
   336         else if T = @{typ bisim_iterator} then
   337           HOLogic.mk_number nat_T j
   338         else case datatype_spec datatypes T of
   339           NONE => atom for_auto T j
   340         | SOME {shallow = true, ...} => atom for_auto T j
   341         | SOME {co, constrs, ...} =>
   342           let
   343             (* styp -> int list *)
   344             fun tuples_for_const (s, T) =
   345               tuple_list_for_name rel_table bounds (ConstName (s, T, Any))
   346             (* unit -> indexname * typ *)
   347             fun var () = ((atom_name "" T j, 0), T)
   348             val discr_jsss = map (tuples_for_const o discr_for_constr o #const)
   349                                  constrs
   350             val real_j = j + offset_of_type ofs T
   351             val constr_x as (constr_s, constr_T) =
   352               get_first (fn (jss, {const, ...}) =>
   353                             if [real_j] mem jss then SOME const else NONE)
   354                         (discr_jsss ~~ constrs) |> the
   355             val arg_Ts = curried_binder_types constr_T
   356             val sel_xs = map (boxed_nth_sel_for_constr ext_ctxt constr_x)
   357                              (index_seq 0 (length arg_Ts))
   358             val sel_Rs =
   359               map (fn x => get_first
   360                                (fn ConstName (s', T', R) =>
   361                                    if (s', T') = x then SOME R else NONE
   362                                  | u => raise NUT ("Nitpick_Model.reconstruct_\
   363                                                    \term.term_for_atom", [u]))
   364                                sel_names |> the) sel_xs
   365             val arg_Rs = map (snd o dest_Func) sel_Rs
   366             val sel_jsss = map tuples_for_const sel_xs
   367             val arg_jsss =
   368               map (map_filter (fn js => if hd js = real_j then SOME (tl js)
   369                                         else NONE)) sel_jsss
   370             val uncur_arg_Ts = binder_types constr_T
   371           in
   372             if co andalso (T, j) mem seen then
   373               Var (var ())
   374             else
   375               let
   376                 val seen = seen |> co ? cons (T, j)
   377                 val ts =
   378                   if length arg_Ts = 0 then
   379                     []
   380                   else
   381                     map3 (fn Ts => term_for_rep seen Ts Ts) arg_Ts arg_Rs
   382                          arg_jsss
   383                     |> mk_tuple (HOLogic.mk_tupleT uncur_arg_Ts)
   384                     |> dest_n_tuple (length uncur_arg_Ts)
   385                 val t =
   386                   if constr_s = @{const_name Abs_Frac} then
   387                     let
   388                       val num_T = body_type T
   389                       (* int -> term *)
   390                       val mk_num = HOLogic.mk_number num_T
   391                     in
   392                       case ts of
   393                         [Const (@{const_name Pair}, _) $ t1 $ t2] =>
   394                         (case snd (HOLogic.dest_number t1) of
   395                            0 => mk_num 0
   396                          | n1 => case HOLogic.dest_number t2 |> snd of
   397                                    1 => mk_num n1
   398                                  | n2 => Const (@{const_name HOL.divide},
   399                                                 [num_T, num_T] ---> num_T)
   400                                          $ mk_num n1 $ mk_num n2)
   401                       | _ => raise TERM ("Nitpick_Model.reconstruct_term.term_\
   402                                          \for_atom (Abs_Frac)", ts)
   403                     end
   404                   else if not for_auto andalso is_abs_fun thy constr_x then
   405                     Const (abs_name, constr_T) $ the_single ts
   406                   else
   407                     list_comb (Const constr_x, ts)
   408               in
   409                 if co then
   410                   let val var = var () in
   411                     if exists_subterm (equal (Var var)) t then
   412                       Const (@{const_name The}, (T --> bool_T) --> T)
   413                       $ Abs ("\<omega>", T,
   414                              Const (@{const_name "op ="}, [T, T] ---> bool_T)
   415                              $ Bound 0 $ abstract_over (Var var, t))
   416                     else
   417                       t
   418                   end
   419                 else
   420                   t
   421               end
   422           end
   423     (* (typ * int) list -> int -> rep -> typ -> typ -> typ -> int list
   424        -> term *)
   425     and term_for_vect seen k R T1 T2 T' js =
   426       make_fun true T1 T2 T' (map (term_for_atom seen T1 T1) (index_seq 0 k))
   427                (map (term_for_rep seen T2 T2 R o single)
   428                     (batch_list (arity_of_rep R) js))
   429     (* (typ * int) list -> typ -> typ -> rep -> int list list -> term *)
   430     and term_for_rep seen T T' Unit [[]] = term_for_atom seen T T' 0
   431       | term_for_rep seen T T' (R as Atom (k, j0)) [[j]] =
   432         if j >= j0 andalso j < j0 + k then term_for_atom seen T T' (j - j0)
   433         else raise REP ("Nitpick_Model.reconstruct_term.term_for_rep", [R])
   434       | term_for_rep seen (Type ("*", [T1, T2])) _ (Struct [R1, R2]) [js] =
   435         let
   436           val arity1 = arity_of_rep R1
   437           val (js1, js2) = chop arity1 js
   438         in
   439           list_comb (HOLogic.pair_const T1 T2,
   440                      map3 (fn T => term_for_rep seen T T) [T1, T2] [R1, R2]
   441                           [[js1], [js2]])
   442         end
   443       | term_for_rep seen (Type ("fun", [T1, T2])) T' (R as Vect (k, R')) [js] =
   444         term_for_vect seen k R' T1 T2 T' js
   445       | term_for_rep seen (Type ("fun", [T1, T2])) T' (Func (R1, Formula Neut))
   446                      jss =
   447         let
   448           val jss1 = all_combinations_for_rep R1
   449           val ts1 = map (term_for_rep seen T1 T1 R1 o single) jss1
   450           val ts2 =
   451             map (fn js => term_for_rep seen T2 T2 (Atom (2, 0))
   452                                        [[int_for_bool (js mem jss)]]) jss1
   453         in make_fun false T1 T2 T' ts1 ts2 end
   454       | term_for_rep seen (Type ("fun", [T1, T2])) T' (Func (R1, R2)) jss =
   455         let
   456           val arity1 = arity_of_rep R1
   457           val jss1 = all_combinations_for_rep R1
   458           val ts1 = map (term_for_rep seen T1 T1 R1 o single) jss1
   459           val grouped_jss2 = AList.group (op =) (map (chop arity1) jss)
   460           val ts2 = map (term_for_rep seen T2 T2 R2 o the_default []
   461                          o AList.lookup (op =) grouped_jss2) jss1
   462         in make_fun true T1 T2 T' ts1 ts2 end
   463       | term_for_rep seen T T' (Opt R) jss =
   464         if null jss then Const (unknown, T) else term_for_rep seen T T' R jss
   465       | term_for_rep seen T _ R jss =
   466         raise ARG ("Nitpick_Model.reconstruct_term.term_for_rep",
   467                    Refute.string_of_typ T ^ " " ^ string_for_rep R ^ " " ^
   468                    string_of_int (length jss))
   469   in
   470     (not for_auto ? setify_mapify_funs []) o unbox_term oooo term_for_rep []
   471   end
   472 
   473 (* scope -> nut list -> nut NameTable.table -> Kodkod.raw_bound list -> nut
   474    -> term *)
   475 fun term_for_name scope sel_names rel_table bounds name =
   476   let val T = type_of name in
   477     tuple_list_for_name rel_table bounds name
   478     |> reconstruct_term ("", "", "", "") scope sel_names rel_table bounds T T
   479                         (rep_of name)
   480   end
   481 
   482 (* Proof.context
   483    -> (string * string * string * string * string) * Proof.context *)
   484 fun add_wacky_syntax ctxt =
   485   let
   486     (* term -> string *)
   487     val name_of = fst o dest_Const
   488     val thy = ProofContext.theory_of ctxt |> Context.reject_draft
   489     val (maybe_t, thy) =
   490       Sign.declare_const ((@{binding nitpick_maybe}, @{typ "'a => 'a"}),
   491                           Mixfix (maybe_mixfix, [1000], 1000)) thy
   492     val (base_t, thy) =
   493       Sign.declare_const ((@{binding nitpick_base}, @{typ "'a => 'a"}),
   494                           Mixfix (base_mixfix, [1000], 1000)) thy
   495     val (step_t, thy) =
   496       Sign.declare_const ((@{binding nitpick_step}, @{typ "'a => 'a"}),
   497                           Mixfix (step_mixfix, [1000], 1000)) thy
   498     val (abs_t, thy) =
   499       Sign.declare_const ((@{binding nitpick_abs}, @{typ "'a => 'b"}),
   500                           Mixfix (abs_mixfix, [40], 40)) thy
   501   in
   502     ((name_of maybe_t, name_of base_t, name_of step_t, name_of abs_t),
   503      ProofContext.transfer_syntax thy ctxt)
   504   end
   505 
   506 (* term -> term *)
   507 fun unfold_outer_the_binders (t as Const (@{const_name The}, _)
   508                                    $ Abs (s, T, Const (@{const_name "op ="}, _)
   509                                                 $ Bound 0 $ t')) =
   510     betapply (Abs (s, T, t'), t) |> unfold_outer_the_binders
   511   | unfold_outer_the_binders t = t
   512 (* typ list -> int -> term * term -> bool *)
   513 fun bisimilar_values _ 0 _ = true
   514   | bisimilar_values coTs max_depth (t1, t2) =
   515     let val T = fastype_of t1 in
   516       if exists_subtype (member (op =) coTs) T then
   517         let
   518           val ((head1, args1), (head2, args2)) =
   519             pairself (strip_comb o unfold_outer_the_binders) (t1, t2)
   520           val max_depth = max_depth - (if T mem coTs then 1 else 0)
   521         in
   522           head1 = head2
   523           andalso forall (bisimilar_values coTs max_depth) (args1 ~~ args2)
   524         end
   525       else
   526         t1 = t2
   527     end
   528 
   529 (* params -> scope -> (term option * int list) list -> styp list -> nut list
   530   -> nut list -> nut list -> nut NameTable.table -> Kodkod.raw_bound list
   531   -> Pretty.T * bool *)
   532 fun reconstruct_hol_model {show_skolems, show_datatypes, show_consts}
   533         ({ext_ctxt as {thy, ctxt, max_bisim_depth, boxes, user_axioms, debug,
   534                        wfs, destroy_constrs, specialize, skolemize,
   535                        star_linear_preds, uncurry, fast_descrs, tac_timeout,
   536                        evals, case_names, def_table, nondef_table, user_nondefs,
   537                        simp_table, psimp_table, intro_table, ground_thm_table,
   538                        ersatz_table, skolems, special_funs, unrolled_preds,
   539                        wf_cache, constr_cache},
   540          card_assigns, bisim_depth, datatypes, ofs} : scope) formats all_frees
   541         free_names sel_names nonsel_names rel_table bounds =
   542   let
   543     val (wacky_names as (_, base_name, step_name, _), ctxt) =
   544       add_wacky_syntax ctxt
   545     val ext_ctxt =
   546       {thy = thy, ctxt = ctxt, max_bisim_depth = max_bisim_depth, boxes = boxes,
   547        wfs = wfs, user_axioms = user_axioms, debug = debug,
   548        destroy_constrs = destroy_constrs, specialize = specialize,
   549        skolemize = skolemize, star_linear_preds = star_linear_preds,
   550        uncurry = uncurry, fast_descrs = fast_descrs, tac_timeout = tac_timeout,
   551        evals = evals, case_names = case_names, def_table = def_table,
   552        nondef_table = nondef_table, user_nondefs = user_nondefs,
   553        simp_table = simp_table, psimp_table = psimp_table,
   554        intro_table = intro_table, ground_thm_table = ground_thm_table,
   555        ersatz_table = ersatz_table, skolems = skolems,
   556        special_funs = special_funs, unrolled_preds = unrolled_preds,
   557        wf_cache = wf_cache, constr_cache = constr_cache}
   558     val scope = {ext_ctxt = ext_ctxt, card_assigns = card_assigns,
   559                  bisim_depth = bisim_depth, datatypes = datatypes, ofs = ofs}
   560     (* typ -> typ -> rep -> int list list -> term *)
   561     val term_for_rep = reconstruct_term wacky_names scope sel_names rel_table
   562                                         bounds
   563     (* typ -> typ -> typ *)
   564     fun nth_value_of_type T card n = term_for_rep T T (Atom (card, 0)) [[n]]
   565     (* dtype_spec list -> dtype_spec -> bool *)
   566     fun is_codatatype_wellformed (cos : dtype_spec list)
   567                                  ({typ, card, ...} : dtype_spec) =
   568       let
   569         val ts = map (nth_value_of_type typ card) (index_seq 0 card)
   570         val max_depth = Integer.sum (map #card cos)
   571       in
   572         forall (not o bisimilar_values (map #typ cos) max_depth)
   573                (all_distinct_unordered_pairs_of ts)
   574       end
   575     (* string -> Pretty.T *)
   576     fun pretty_for_assign name =
   577       let
   578         val (oper, (t1, T'), T) =
   579           case name of
   580             FreeName (s, T, _) =>
   581             let val t = Free (s, unbox_type T) in
   582               ("=", (t, format_term_type thy def_table formats t), T)
   583             end
   584           | ConstName (s, T, _) =>
   585             (assign_operator_for_const (s, T),
   586              user_friendly_const ext_ctxt (base_name, step_name) formats (s, T),
   587              T)
   588           | _ => raise NUT ("Nitpick_Model.reconstruct_hol_model.\
   589                             \pretty_for_assign", [name])
   590         val t2 = if rep_of name = Any then
   591                    Const (@{const_name undefined}, T')
   592                  else
   593                    tuple_list_for_name rel_table bounds name
   594                    |> term_for_rep T T' (rep_of name)
   595       in
   596         Pretty.block (Pretty.breaks
   597             [setmp_show_all_types (Syntax.pretty_term ctxt) t1,
   598              Pretty.str oper, Syntax.pretty_term ctxt t2])
   599       end
   600     (* dtype_spec -> Pretty.T *)
   601     fun pretty_for_datatype ({typ, card, precise, ...} : dtype_spec) =
   602       Pretty.block (Pretty.breaks
   603           [Syntax.pretty_typ ctxt (unbox_type typ), Pretty.str "=",
   604            Pretty.enum "," "{" "}"
   605                (map (Syntax.pretty_term ctxt o nth_value_of_type typ card)
   606                     (index_seq 0 card) @
   607                 (if precise then [] else [Pretty.str unrep]))])
   608     (* typ -> dtype_spec list *)
   609     fun integer_datatype T =
   610       [{typ = T, card = card_of_type card_assigns T, co = false,
   611         precise = false, shallow = false, constrs = []}]
   612       handle TYPE ("Nitpick_HOL.card_of_type", _, _) => []
   613     val (codatatypes, datatypes) =
   614       datatypes |> filter_out #shallow
   615                 |> List.partition #co
   616                 ||> append (integer_datatype nat_T @ integer_datatype int_T)
   617     val block_of_datatypes =
   618       if show_datatypes andalso not (null datatypes) then
   619         [Pretty.big_list ("Datatype" ^ plural_s_for_list datatypes ^ ":")
   620                          (map pretty_for_datatype datatypes)]
   621       else
   622         []
   623     val block_of_codatatypes =
   624       if show_datatypes andalso not (null codatatypes) then
   625         [Pretty.big_list ("Codatatype" ^ plural_s_for_list codatatypes ^ ":")
   626                          (map pretty_for_datatype codatatypes)]
   627       else
   628         []
   629     (* bool -> string -> nut list -> Pretty.T list *)
   630     fun block_of_names show title names =
   631       if show andalso not (null names) then
   632         Pretty.str (title ^ plural_s_for_list names ^ ":")
   633         :: map (Pretty.indent indent_size o pretty_for_assign)
   634                (sort_wrt (original_name o nickname_of) names)
   635       else
   636         []
   637     val (skolem_names, nonskolem_nonsel_names) =
   638       List.partition is_skolem_name nonsel_names
   639     val (eval_names, noneval_nonskolem_nonsel_names) =
   640       List.partition (String.isPrefix eval_prefix o nickname_of)
   641                      nonskolem_nonsel_names
   642       ||> filter_out (equal @{const_name bisim_iterator_max} o nickname_of)
   643     val free_names =
   644       map (fn x as (s, T) =>
   645               case filter (equal x o pairf nickname_of (unbox_type o type_of))
   646                           free_names of
   647                 [name] => name
   648               | [] => FreeName (s, T, Any)
   649               | _ => raise TERM ("Nitpick_Model.reconstruct_hol_model",
   650                                  [Const x])) all_frees
   651     val chunks = block_of_names true "Free variable" free_names @
   652                  block_of_names show_skolems "Skolem constant" skolem_names @
   653                  block_of_names true "Evaluated term" eval_names @
   654                  block_of_datatypes @ block_of_codatatypes @
   655                  block_of_names show_consts "Constant"
   656                                 noneval_nonskolem_nonsel_names
   657   in
   658     (Pretty.chunks (if null chunks then [Pretty.str "Empty assignment"]
   659                     else chunks),
   660      bisim_depth >= 0
   661      orelse forall (is_codatatype_wellformed codatatypes) codatatypes)
   662   end
   663 
   664 (* scope -> Time.time option -> nut list -> nut list -> nut NameTable.table
   665    -> Kodkod.raw_bound list -> term -> bool option *)
   666 fun prove_hol_model (scope as {ext_ctxt as {thy, ctxt, ...}, card_assigns, ...})
   667                     auto_timeout free_names sel_names rel_table bounds prop =
   668   let
   669     (* typ * int -> term *)
   670     fun free_type_assm (T, k) =
   671       let
   672         (* int -> term *)
   673         val atom = atom true T
   674         fun equation_for_atom j = HOLogic.eq_const T $ Bound 0 $ atom j
   675         val eqs = map equation_for_atom (index_seq 0 k)
   676         val compreh_assm =
   677           Const (@{const_name All}, (T --> bool_T) --> bool_T)
   678               $ Abs ("x", T, foldl1 HOLogic.mk_disj eqs)
   679         val distinct_assm = distinctness_formula T (map atom (index_seq 0 k))
   680       in HOLogic.mk_conj (compreh_assm, distinct_assm) end
   681     (* nut -> term *)
   682     fun free_name_assm name =
   683       HOLogic.mk_eq (Free (nickname_of name, type_of name),
   684                      term_for_name scope sel_names rel_table bounds name)
   685     val freeT_assms = map free_type_assm (filter (is_TFree o fst) card_assigns)
   686     val model_assms = map free_name_assm free_names
   687     val assm = List.foldr HOLogic.mk_conj @{const True}
   688                           (freeT_assms @ model_assms)
   689     (* bool -> bool *)
   690     fun try_out negate =
   691       let
   692         val concl = (negate ? curry (op $) @{const Not})
   693                     (ObjectLogic.atomize_term thy prop)
   694         val goal = HOLogic.mk_Trueprop (HOLogic.mk_imp (assm, concl))
   695                    |> map_types (map_type_tfree
   696                           (fn (s, []) => TFree (s, HOLogic.typeS)
   697                             | x => TFree x))
   698                    |> cterm_of thy |> Goal.init
   699       in
   700         (goal |> SINGLE (DETERM_TIMEOUT auto_timeout
   701                                         (auto_tac (clasimpset_of ctxt)))
   702               |> the |> Goal.finish ctxt; true)
   703         handle THM _ => false
   704              | TimeLimit.TimeOut => false
   705       end
   706   in
   707     if try_out false then SOME true
   708     else if try_out true then SOME false
   709     else NONE
   710   end
   711 
   712 end;