src/HOL/Tools/Nitpick/nitpick_mono.ML
author wenzelm
Fri Nov 26 22:29:41 2010 +0100 (2010-11-26)
changeset 40722 441260986b63
parent 40146 f2a14b6effcf
child 40985 8b870370c26f
permissions -rw-r--r--
make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
blanchet@33982
     1
(*  Title:      HOL/Tools/Nitpick/nitpick_mono.ML
blanchet@33192
     2
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@34982
     3
    Copyright   2009, 2010
blanchet@33192
     4
blanchet@35384
     5
Monotonicity inference for higher-order logic.
blanchet@33192
     6
*)
blanchet@33192
     7
blanchet@33192
     8
signature NITPICK_MONO =
blanchet@33192
     9
sig
blanchet@35070
    10
  type hol_context = Nitpick_HOL.hol_context
blanchet@33192
    11
blanchet@38179
    12
  val trace : bool Unsynchronized.ref
blanchet@33192
    13
  val formulas_monotonic :
blanchet@35386
    14
    hol_context -> bool -> typ -> term list * term list -> bool
blanchet@35665
    15
  val finitize_funs :
blanchet@35665
    16
    hol_context -> bool -> (typ option * bool option) list -> typ
blanchet@35665
    17
    -> term list * term list -> term list * term list
blanchet@33192
    18
end;
blanchet@33192
    19
blanchet@33232
    20
structure Nitpick_Mono : NITPICK_MONO =
blanchet@33192
    21
struct
blanchet@33192
    22
blanchet@33232
    23
open Nitpick_Util
blanchet@33232
    24
open Nitpick_HOL
blanchet@33192
    25
blanchet@33192
    26
type var = int
blanchet@33192
    27
blanchet@34982
    28
datatype sign = Plus | Minus
blanchet@33192
    29
datatype sign_atom = S of sign | V of var
blanchet@33192
    30
blanchet@33192
    31
type literal = var * sign
blanchet@33192
    32
blanchet@35385
    33
datatype mtyp =
blanchet@35385
    34
  MAlpha |
blanchet@35385
    35
  MFun of mtyp * sign_atom * mtyp |
blanchet@35385
    36
  MPair of mtyp * mtyp |
blanchet@35385
    37
  MType of string * mtyp list |
blanchet@35385
    38
  MRec of string * typ list
blanchet@33192
    39
blanchet@35385
    40
datatype mterm =
blanchet@35386
    41
  MRaw of term * mtyp |
blanchet@35385
    42
  MAbs of string * typ * mtyp * sign_atom * mterm |
blanchet@35385
    43
  MApp of mterm * mterm
blanchet@35385
    44
blanchet@35385
    45
type mdata =
blanchet@35070
    46
  {hol_ctxt: hol_context,
blanchet@35190
    47
   binarize: bool,
blanchet@33192
    48
   alpha_T: typ,
blanchet@35665
    49
   no_harmless: bool,
blanchet@33192
    50
   max_fresh: int Unsynchronized.ref,
blanchet@35665
    51
   datatype_mcache: ((string * typ list) * mtyp) list Unsynchronized.ref,
blanchet@35665
    52
   constr_mcache: (styp * mtyp) list Unsynchronized.ref}
blanchet@33192
    53
blanchet@35812
    54
exception UNSOLVABLE of unit
blanchet@35665
    55
exception MTYPE of string * mtyp list * typ list
blanchet@35665
    56
exception MTERM of string * mterm list
blanchet@33192
    57
blanchet@38179
    58
val trace = Unsynchronized.ref false
blanchet@38179
    59
fun trace_msg msg = if !trace then tracing (msg ()) else ()
blanchet@33192
    60
blanchet@33192
    61
val string_for_var = signed_string_of_int
blanchet@33192
    62
fun string_for_vars sep [] = "0\<^bsub>" ^ sep ^ "\<^esub>"
blanchet@33192
    63
  | string_for_vars sep xs = space_implode sep (map string_for_var xs)
blanchet@33192
    64
fun subscript_string_for_vars sep xs =
blanchet@33192
    65
  if null xs then "" else "\<^bsub>" ^ string_for_vars sep xs ^ "\<^esub>"
blanchet@33192
    66
blanchet@34982
    67
fun string_for_sign Plus = "+"
blanchet@34982
    68
  | string_for_sign Minus = "-"
blanchet@33192
    69
blanchet@34982
    70
fun xor sn1 sn2 = if sn1 = sn2 then Plus else Minus
blanchet@34982
    71
val negate = xor Minus
blanchet@33192
    72
blanchet@33192
    73
fun string_for_sign_atom (S sn) = string_for_sign sn
blanchet@35665
    74
  | string_for_sign_atom (V x) = string_for_var x
blanchet@33192
    75
blanchet@33192
    76
fun string_for_literal (x, sn) = string_for_var x ^ " = " ^ string_for_sign sn
blanchet@33192
    77
blanchet@35385
    78
val bool_M = MType (@{type_name bool}, [])
blanchet@35386
    79
val dummy_M = MType (nitpick_prefix ^ "dummy", [])
blanchet@33192
    80
blanchet@35385
    81
fun is_MRec (MRec _) = true
blanchet@35385
    82
  | is_MRec _ = false
blanchet@35385
    83
fun dest_MFun (MFun z) = z
blanchet@35665
    84
  | dest_MFun M = raise MTYPE ("Nitpick_Mono.dest_MFun", [M], [])
blanchet@33192
    85
blanchet@33192
    86
val no_prec = 100
blanchet@33192
    87
blanchet@35385
    88
fun precedence_of_mtype (MFun _) = 1
blanchet@35385
    89
  | precedence_of_mtype (MPair _) = 2
blanchet@35385
    90
  | precedence_of_mtype _ = no_prec
blanchet@33192
    91
blanchet@35385
    92
val string_for_mtype =
blanchet@33192
    93
  let
blanchet@35385
    94
    fun aux outer_prec M =
blanchet@33192
    95
      let
blanchet@35385
    96
        val prec = precedence_of_mtype M
blanchet@33192
    97
        val need_parens = (prec < outer_prec)
blanchet@33192
    98
      in
blanchet@33192
    99
        (if need_parens then "(" else "") ^
blanchet@35386
   100
        (if M = dummy_M then
blanchet@35386
   101
           "_"
blanchet@35386
   102
         else case M of
blanchet@35386
   103
             MAlpha => "\<alpha>"
blanchet@35386
   104
           | MFun (M1, a, M2) =>
blanchet@35386
   105
             aux (prec + 1) M1 ^ " \<Rightarrow>\<^bsup>" ^
blanchet@35386
   106
             string_for_sign_atom a ^ "\<^esup> " ^ aux prec M2
blanchet@35386
   107
           | MPair (M1, M2) => aux (prec + 1) M1 ^ " \<times> " ^ aux prec M2
blanchet@35386
   108
           | MType (s, []) =>
blanchet@35386
   109
             if s = @{type_name prop} orelse s = @{type_name bool} then "o"
blanchet@35386
   110
             else s
blanchet@35386
   111
           | MType (s, Ms) => "(" ^ commas (map (aux 0) Ms) ^ ") " ^ s
blanchet@35386
   112
           | MRec (s, _) => "[" ^ s ^ "]") ^
blanchet@33192
   113
        (if need_parens then ")" else "")
blanchet@33192
   114
      end
blanchet@33192
   115
  in aux 0 end
blanchet@33192
   116
blanchet@35385
   117
fun flatten_mtype (MPair (M1, M2)) = maps flatten_mtype [M1, M2]
blanchet@35385
   118
  | flatten_mtype (MType (_, Ms)) = maps flatten_mtype Ms
blanchet@35385
   119
  | flatten_mtype M = [M]
blanchet@35385
   120
blanchet@35386
   121
fun precedence_of_mterm (MRaw _) = no_prec
blanchet@35385
   122
  | precedence_of_mterm (MAbs _) = 1
blanchet@35385
   123
  | precedence_of_mterm (MApp _) = 2
blanchet@33192
   124
blanchet@35385
   125
fun string_for_mterm ctxt =
blanchet@35385
   126
  let
blanchet@35385
   127
    fun mtype_annotation M = "\<^bsup>" ^ string_for_mtype M ^ "\<^esup>"
blanchet@35385
   128
    fun aux outer_prec m =
blanchet@35385
   129
      let
blanchet@35385
   130
        val prec = precedence_of_mterm m
blanchet@35385
   131
        val need_parens = (prec < outer_prec)
blanchet@35385
   132
      in
blanchet@35385
   133
        (if need_parens then "(" else "") ^
blanchet@35385
   134
        (case m of
blanchet@35386
   135
           MRaw (t, M) => Syntax.string_of_term ctxt t ^ mtype_annotation M
blanchet@35385
   136
         | MAbs (s, _, M, a, m) =>
blanchet@35385
   137
           "\<lambda>" ^ s ^ mtype_annotation M ^ ".\<^bsup>" ^
blanchet@35385
   138
           string_for_sign_atom a ^ "\<^esup> " ^ aux prec m
blanchet@35385
   139
         | MApp (m1, m2) => aux prec m1 ^ " " ^ aux (prec + 1) m2) ^
blanchet@35385
   140
        (if need_parens then ")" else "")
blanchet@35385
   141
      end
blanchet@35385
   142
  in aux 0 end
blanchet@35385
   143
blanchet@35386
   144
fun mtype_of_mterm (MRaw (_, M)) = M
blanchet@35385
   145
  | mtype_of_mterm (MAbs (_, _, M, a, m)) = MFun (M, a, mtype_of_mterm m)
blanchet@35385
   146
  | mtype_of_mterm (MApp (m1, _)) =
blanchet@35385
   147
    case mtype_of_mterm m1 of
blanchet@35385
   148
      MFun (_, _, M12) => M12
blanchet@35665
   149
    | M1 => raise MTYPE ("Nitpick_Mono.mtype_of_mterm", [M1], [])
blanchet@35665
   150
blanchet@35665
   151
fun strip_mcomb (MApp (m1, m2)) = strip_mcomb m1 ||> (fn ms => append ms [m2])
blanchet@35665
   152
  | strip_mcomb m = (m, [])
blanchet@35385
   153
blanchet@35665
   154
fun initial_mdata hol_ctxt binarize no_harmless alpha_T =
blanchet@35190
   155
  ({hol_ctxt = hol_ctxt, binarize = binarize, alpha_T = alpha_T,
blanchet@35665
   156
    no_harmless = no_harmless, max_fresh = Unsynchronized.ref 0,
blanchet@35665
   157
    datatype_mcache = Unsynchronized.ref [],
blanchet@35665
   158
    constr_mcache = Unsynchronized.ref []} : mdata)
blanchet@33192
   159
blanchet@33192
   160
fun could_exist_alpha_subtype alpha_T (T as Type (_, Ts)) =
blanchet@34936
   161
    T = alpha_T orelse (not (is_fp_iterator_type T) andalso
blanchet@34936
   162
                        exists (could_exist_alpha_subtype alpha_T) Ts)
blanchet@33192
   163
  | could_exist_alpha_subtype alpha_T T = (T = alpha_T)
blanchet@35385
   164
fun could_exist_alpha_sub_mtype _ (alpha_T as TFree _) T =
blanchet@34121
   165
    could_exist_alpha_subtype alpha_T T
blanchet@37256
   166
  | could_exist_alpha_sub_mtype ctxt alpha_T T =
blanchet@37256
   167
    (T = alpha_T orelse is_datatype ctxt [(NONE, true)] T)
blanchet@33192
   168
blanchet@35385
   169
fun exists_alpha_sub_mtype MAlpha = true
blanchet@35385
   170
  | exists_alpha_sub_mtype (MFun (M1, _, M2)) =
blanchet@35385
   171
    exists exists_alpha_sub_mtype [M1, M2]
blanchet@35385
   172
  | exists_alpha_sub_mtype (MPair (M1, M2)) =
blanchet@35385
   173
    exists exists_alpha_sub_mtype [M1, M2]
blanchet@35385
   174
  | exists_alpha_sub_mtype (MType (_, Ms)) = exists exists_alpha_sub_mtype Ms
blanchet@35385
   175
  | exists_alpha_sub_mtype (MRec _) = true
blanchet@33192
   176
blanchet@35385
   177
fun exists_alpha_sub_mtype_fresh MAlpha = true
blanchet@35385
   178
  | exists_alpha_sub_mtype_fresh (MFun (_, V _, _)) = true
blanchet@35385
   179
  | exists_alpha_sub_mtype_fresh (MFun (_, _, M2)) =
blanchet@35385
   180
    exists_alpha_sub_mtype_fresh M2
blanchet@35385
   181
  | exists_alpha_sub_mtype_fresh (MPair (M1, M2)) =
blanchet@35385
   182
    exists exists_alpha_sub_mtype_fresh [M1, M2]
blanchet@35385
   183
  | exists_alpha_sub_mtype_fresh (MType (_, Ms)) =
blanchet@35385
   184
    exists exists_alpha_sub_mtype_fresh Ms
blanchet@35385
   185
  | exists_alpha_sub_mtype_fresh (MRec _) = true
blanchet@33192
   186
blanchet@35385
   187
fun constr_mtype_for_binders z Ms =
blanchet@35385
   188
  fold_rev (fn M => curry3 MFun M (S Minus)) Ms (MRec z)
blanchet@33192
   189
blanchet@35385
   190
fun repair_mtype _ _ MAlpha = MAlpha
blanchet@35385
   191
  | repair_mtype cache seen (MFun (M1, a, M2)) =
blanchet@35385
   192
    MFun (repair_mtype cache seen M1, a, repair_mtype cache seen M2)
blanchet@35385
   193
  | repair_mtype cache seen (MPair Mp) =
blanchet@35385
   194
    MPair (pairself (repair_mtype cache seen) Mp)
blanchet@35385
   195
  | repair_mtype cache seen (MType (s, Ms)) =
blanchet@35385
   196
    MType (s, maps (flatten_mtype o repair_mtype cache seen) Ms)
blanchet@35385
   197
  | repair_mtype cache seen (MRec (z as (s, _))) =
blanchet@33192
   198
    case AList.lookup (op =) cache z |> the of
blanchet@35385
   199
      MRec _ => MType (s, [])
blanchet@35385
   200
    | M => if member (op =) seen M then MType (s, [])
blanchet@35385
   201
           else repair_mtype cache (M :: seen) M
blanchet@33192
   202
blanchet@35665
   203
fun repair_datatype_mcache cache =
blanchet@33192
   204
  let
blanchet@35385
   205
    fun repair_one (z, M) =
blanchet@33192
   206
      Unsynchronized.change cache
blanchet@35385
   207
          (AList.update (op =) (z, repair_mtype (!cache) [] M))
blanchet@33192
   208
  in List.app repair_one (rev (!cache)) end
blanchet@33192
   209
blanchet@35665
   210
fun repair_constr_mcache dtype_cache constr_mcache =
blanchet@33192
   211
  let
blanchet@35385
   212
    fun repair_one (x, M) =
blanchet@35665
   213
      Unsynchronized.change constr_mcache
blanchet@35385
   214
          (AList.update (op =) (x, repair_mtype dtype_cache [] M))
blanchet@35665
   215
  in List.app repair_one (!constr_mcache) end
blanchet@35665
   216
blanchet@35665
   217
fun is_fin_fun_supported_type @{typ prop} = true
blanchet@35665
   218
  | is_fin_fun_supported_type @{typ bool} = true
blanchet@35665
   219
  | is_fin_fun_supported_type (Type (@{type_name option}, _)) = true
blanchet@35665
   220
  | is_fin_fun_supported_type _ = false
blanchet@35665
   221
fun fin_fun_body _ _ (t as @{term False}) = SOME t
blanchet@35665
   222
  | fin_fun_body _ _ (t as Const (@{const_name None}, _)) = SOME t
blanchet@35665
   223
  | fin_fun_body dom_T ran_T
blanchet@35665
   224
                 ((t0 as Const (@{const_name If}, _))
haftmann@38864
   225
                  $ (t1 as Const (@{const_name HOL.eq}, _) $ Bound 0 $ t1')
blanchet@35665
   226
                  $ t2 $ t3) =
blanchet@35665
   227
    (if loose_bvar1 (t1', 0) then
blanchet@35665
   228
       NONE
blanchet@35665
   229
     else case fin_fun_body dom_T ran_T t3 of
blanchet@35665
   230
       NONE => NONE
blanchet@35665
   231
     | SOME t3 =>
blanchet@35665
   232
       SOME (t0 $ (Const (@{const_name is_unknown}, dom_T --> bool_T) $ t1')
blanchet@35665
   233
                $ (Const (@{const_name unknown}, ran_T)) $ (t0 $ t1 $ t2 $ t3)))
blanchet@35665
   234
  | fin_fun_body _ _ _ = NONE
blanchet@33192
   235
blanchet@35672
   236
fun fresh_mfun_for_fun_type (mdata as {max_fresh, ...} : mdata) all_minus
blanchet@35672
   237
                            T1 T2 =
blanchet@33192
   238
  let
blanchet@35672
   239
    val M1 = fresh_mtype_for_type mdata all_minus T1
blanchet@35672
   240
    val M2 = fresh_mtype_for_type mdata all_minus T2
blanchet@35672
   241
    val a = if not all_minus andalso exists_alpha_sub_mtype_fresh M1 andalso
blanchet@35672
   242
               is_fin_fun_supported_type (body_type T2) then
blanchet@35385
   243
              V (Unsynchronized.inc max_fresh)
blanchet@35385
   244
            else
blanchet@35385
   245
              S Minus
blanchet@35385
   246
  in (M1, a, M2) end
blanchet@37256
   247
and fresh_mtype_for_type (mdata as {hol_ctxt as {ctxt, ...}, binarize, alpha_T,
blanchet@35672
   248
                                    datatype_mcache, constr_mcache, ...})
blanchet@35672
   249
                         all_minus =
blanchet@35385
   250
  let
blanchet@35385
   251
    fun do_type T =
blanchet@33192
   252
      if T = alpha_T then
blanchet@35385
   253
        MAlpha
blanchet@33192
   254
      else case T of
blanchet@35665
   255
        Type (@{type_name fun}, [T1, T2]) =>
blanchet@39342
   256
        MFun (fresh_mfun_for_fun_type mdata all_minus T1 T2)
blanchet@38190
   257
      | Type (@{type_name prod}, [T1, T2]) => MPair (pairself do_type (T1, T2))
blanchet@33192
   258
      | Type (z as (s, _)) =>
blanchet@37256
   259
        if could_exist_alpha_sub_mtype ctxt alpha_T T then
blanchet@35665
   260
          case AList.lookup (op =) (!datatype_mcache) z of
blanchet@35385
   261
            SOME M => M
blanchet@33192
   262
          | NONE =>
blanchet@33192
   263
            let
blanchet@35665
   264
              val _ = Unsynchronized.change datatype_mcache (cons (z, MRec z))
blanchet@35219
   265
              val xs = binarized_and_boxed_datatype_constrs hol_ctxt binarize T
blanchet@35385
   266
              val (all_Ms, constr_Ms) =
blanchet@35385
   267
                fold_rev (fn (_, T') => fn (all_Ms, constr_Ms) =>
blanchet@33192
   268
                             let
blanchet@35385
   269
                               val binder_Ms = map do_type (binder_types T')
blanchet@35385
   270
                               val new_Ms = filter exists_alpha_sub_mtype_fresh
blanchet@35385
   271
                                                   binder_Ms
blanchet@35385
   272
                               val constr_M = constr_mtype_for_binders z
blanchet@35385
   273
                                                                       binder_Ms
blanchet@33192
   274
                             in
blanchet@35385
   275
                               (union (op =) new_Ms all_Ms,
blanchet@35385
   276
                                constr_M :: constr_Ms)
blanchet@33192
   277
                             end)
blanchet@33192
   278
                         xs ([], [])
blanchet@35385
   279
              val M = MType (s, all_Ms)
blanchet@35665
   280
              val _ = Unsynchronized.change datatype_mcache
blanchet@35385
   281
                          (AList.update (op =) (z, M))
blanchet@35665
   282
              val _ = Unsynchronized.change constr_mcache
blanchet@35385
   283
                          (append (xs ~~ constr_Ms))
blanchet@33192
   284
            in
blanchet@35665
   285
              if forall (not o is_MRec o snd) (!datatype_mcache) then
blanchet@35665
   286
                (repair_datatype_mcache datatype_mcache;
blanchet@35665
   287
                 repair_constr_mcache (!datatype_mcache) constr_mcache;
blanchet@35665
   288
                 AList.lookup (op =) (!datatype_mcache) z |> the)
blanchet@33192
   289
              else
blanchet@35385
   290
                M
blanchet@33192
   291
            end
blanchet@33192
   292
        else
blanchet@35385
   293
          MType (s, [])
blanchet@37260
   294
      | _ => MType (simple_string_of_typ T, [])
blanchet@33192
   295
  in do_type end
blanchet@33192
   296
blanchet@35385
   297
fun prodM_factors (MPair (M1, M2)) = maps prodM_factors [M1, M2]
blanchet@35385
   298
  | prodM_factors M = [M]
blanchet@35665
   299
fun curried_strip_mtype (MFun (M1, _, M2)) =
blanchet@35385
   300
    curried_strip_mtype M2 |>> append (prodM_factors M1)
blanchet@35385
   301
  | curried_strip_mtype M = ([], M)
blanchet@35385
   302
fun sel_mtype_from_constr_mtype s M =
blanchet@35385
   303
  let val (arg_Ms, dataM) = curried_strip_mtype M in
blanchet@35385
   304
    MFun (dataM, S Minus,
blanchet@35385
   305
          case sel_no_from_name s of ~1 => bool_M | n => nth arg_Ms n)
blanchet@33192
   306
  end
blanchet@33192
   307
blanchet@37256
   308
fun mtype_for_constr (mdata as {hol_ctxt = {ctxt, ...}, alpha_T, constr_mcache,
blanchet@33192
   309
                                ...}) (x as (_, T)) =
blanchet@37256
   310
  if could_exist_alpha_sub_mtype ctxt alpha_T T then
blanchet@35665
   311
    case AList.lookup (op =) (!constr_mcache) x of
blanchet@35385
   312
      SOME M => M
blanchet@35384
   313
    | NONE => if T = alpha_T then
blanchet@35672
   314
                let val M = fresh_mtype_for_type mdata false T in
blanchet@35665
   315
                  (Unsynchronized.change constr_mcache (cons (x, M)); M)
blanchet@35384
   316
                end
blanchet@35384
   317
              else
blanchet@35672
   318
                (fresh_mtype_for_type mdata false (body_type T);
blanchet@35665
   319
                 AList.lookup (op =) (!constr_mcache) x |> the)
blanchet@33192
   320
  else
blanchet@35672
   321
    fresh_mtype_for_type mdata false T
blanchet@35385
   322
fun mtype_for_sel (mdata as {hol_ctxt, binarize, ...}) (x as (s, _)) =
blanchet@35190
   323
  x |> binarized_and_boxed_constr_for_sel hol_ctxt binarize
blanchet@35385
   324
    |> mtype_for_constr mdata |> sel_mtype_from_constr_mtype s
blanchet@33192
   325
blanchet@35665
   326
fun resolve_sign_atom lits (V x) =
blanchet@35665
   327
    x |> AList.lookup (op =) lits |> Option.map S |> the_default (V x)
blanchet@35665
   328
  | resolve_sign_atom _ a = a
blanchet@35665
   329
fun resolve_mtype lits =
blanchet@33192
   330
  let
blanchet@35385
   331
    fun aux MAlpha = MAlpha
blanchet@35665
   332
      | aux (MFun (M1, a, M2)) = MFun (aux M1, resolve_sign_atom lits a, aux M2)
blanchet@35385
   333
      | aux (MPair Mp) = MPair (pairself aux Mp)
blanchet@35385
   334
      | aux (MType (s, Ms)) = MType (s, map aux Ms)
blanchet@35385
   335
      | aux (MRec z) = MRec z
blanchet@33192
   336
  in aux end
blanchet@33192
   337
blanchet@33192
   338
datatype comp_op = Eq | Leq
blanchet@33192
   339
blanchet@33192
   340
type comp = sign_atom * sign_atom * comp_op * var list
blanchet@33192
   341
type sign_expr = literal list
blanchet@33192
   342
blanchet@35812
   343
type constraint_set = literal list * comp list * sign_expr list
blanchet@33192
   344
blanchet@33192
   345
fun string_for_comp_op Eq = "="
blanchet@33192
   346
  | string_for_comp_op Leq = "\<le>"
blanchet@33192
   347
blanchet@33192
   348
fun string_for_sign_expr [] = "\<bot>"
blanchet@33192
   349
  | string_for_sign_expr lits =
blanchet@33192
   350
    space_implode " \<or> " (map string_for_literal lits)
blanchet@33192
   351
blanchet@33192
   352
fun do_literal _ NONE = NONE
blanchet@33192
   353
  | do_literal (x, sn) (SOME lits) =
blanchet@33192
   354
    case AList.lookup (op =) lits x of
blanchet@33192
   355
      SOME sn' => if sn = sn' then SOME lits else NONE
blanchet@33192
   356
    | NONE => SOME ((x, sn) :: lits)
blanchet@33192
   357
blanchet@33192
   358
fun do_sign_atom_comp Eq [] a1 a2 (accum as (lits, comps)) =
blanchet@33192
   359
    (case (a1, a2) of
blanchet@33192
   360
       (S sn1, S sn2) => if sn1 = sn2 then SOME accum else NONE
blanchet@33192
   361
     | (V x1, S sn2) =>
blanchet@33192
   362
       Option.map (rpair comps) (do_literal (x1, sn2) (SOME lits))
blanchet@33192
   363
     | (V _, V _) => SOME (lits, insert (op =) (a1, a2, Eq, []) comps)
blanchet@33192
   364
     | _ => do_sign_atom_comp Eq [] a2 a1 accum)
blanchet@33192
   365
  | do_sign_atom_comp Leq [] a1 a2 (accum as (lits, comps)) =
blanchet@33192
   366
    (case (a1, a2) of
blanchet@34982
   367
       (_, S Minus) => SOME accum
blanchet@34982
   368
     | (S Plus, _) => SOME accum
blanchet@34982
   369
     | (S Minus, S Plus) => NONE
blanchet@33192
   370
     | (V _, V _) => SOME (lits, insert (op =) (a1, a2, Leq, []) comps)
blanchet@33192
   371
     | _ => do_sign_atom_comp Eq [] a1 a2 accum)
blanchet@35280
   372
  | do_sign_atom_comp cmp xs a1 a2 (lits, comps) =
blanchet@33192
   373
    SOME (lits, insert (op =) (a1, a2, cmp, xs) comps)
blanchet@33192
   374
blanchet@35385
   375
fun do_mtype_comp _ _ _ _ NONE = NONE
blanchet@35385
   376
  | do_mtype_comp _ _ MAlpha MAlpha accum = accum
blanchet@35385
   377
  | do_mtype_comp Eq xs (MFun (M11, a1, M12)) (MFun (M21, a2, M22))
blanchet@33192
   378
                  (SOME accum) =
blanchet@35385
   379
     accum |> do_sign_atom_comp Eq xs a1 a2 |> do_mtype_comp Eq xs M11 M21
blanchet@35385
   380
           |> do_mtype_comp Eq xs M12 M22
blanchet@35385
   381
  | do_mtype_comp Leq xs (MFun (M11, a1, M12)) (MFun (M21, a2, M22))
blanchet@33192
   382
                  (SOME accum) =
blanchet@35385
   383
    (if exists_alpha_sub_mtype M11 then
blanchet@33192
   384
       accum |> do_sign_atom_comp Leq xs a1 a2
blanchet@35385
   385
             |> do_mtype_comp Leq xs M21 M11
blanchet@33192
   386
             |> (case a2 of
blanchet@34982
   387
                   S Minus => I
blanchet@35385
   388
                 | S Plus => do_mtype_comp Leq xs M11 M21
blanchet@35385
   389
                 | V x => do_mtype_comp Leq (x :: xs) M11 M21)
blanchet@33192
   390
     else
blanchet@33192
   391
       SOME accum)
blanchet@35385
   392
    |> do_mtype_comp Leq xs M12 M22
blanchet@35385
   393
  | do_mtype_comp cmp xs (M1 as MPair (M11, M12)) (M2 as MPair (M21, M22))
blanchet@33192
   394
                  accum =
blanchet@35385
   395
    (accum |> fold (uncurry (do_mtype_comp cmp xs)) [(M11, M21), (M12, M22)]
wenzelm@40722
   396
     handle ListPair.UnequalLengths =>
blanchet@35665
   397
            raise MTYPE ("Nitpick_Mono.do_mtype_comp", [M1, M2], []))
blanchet@35385
   398
  | do_mtype_comp _ _ (MType _) (MType _) accum =
blanchet@33192
   399
    accum (* no need to compare them thanks to the cache *)
blanchet@35665
   400
  | do_mtype_comp cmp _ M1 M2 _ =
blanchet@35665
   401
    raise MTYPE ("Nitpick_Mono.do_mtype_comp (" ^ string_for_comp_op cmp ^ ")",
blanchet@35665
   402
                 [M1, M2], [])
blanchet@33192
   403
blanchet@35832
   404
fun add_mtype_comp cmp M1 M2 ((lits, comps, sexps) : constraint_set) =
blanchet@38179
   405
    (trace_msg (fn () => "*** Add " ^ string_for_mtype M1 ^ " " ^
blanchet@38179
   406
                         string_for_comp_op cmp ^ " " ^ string_for_mtype M2);
blanchet@35385
   407
     case do_mtype_comp cmp [] M1 M2 (SOME (lits, comps)) of
blanchet@38179
   408
       NONE => (trace_msg (K "**** Unsolvable"); raise UNSOLVABLE ())
blanchet@35812
   409
     | SOME (lits, comps) => (lits, comps, sexps))
blanchet@33192
   410
blanchet@35385
   411
val add_mtypes_equal = add_mtype_comp Eq
blanchet@35385
   412
val add_is_sub_mtype = add_mtype_comp Leq
blanchet@33192
   413
blanchet@35385
   414
fun do_notin_mtype_fv _ _ _ NONE = NONE
blanchet@35385
   415
  | do_notin_mtype_fv Minus _ MAlpha accum = accum
blanchet@35385
   416
  | do_notin_mtype_fv Plus [] MAlpha _ = NONE
blanchet@35385
   417
  | do_notin_mtype_fv Plus [(x, sn)] MAlpha (SOME (lits, sexps)) =
blanchet@33192
   418
    SOME lits |> do_literal (x, sn) |> Option.map (rpair sexps)
blanchet@35385
   419
  | do_notin_mtype_fv Plus sexp MAlpha (SOME (lits, sexps)) =
blanchet@33192
   420
    SOME (lits, insert (op =) sexp sexps)
blanchet@35385
   421
  | do_notin_mtype_fv sn sexp (MFun (M1, S sn', M2)) accum =
blanchet@34982
   422
    accum |> (if sn' = Plus andalso sn = Plus then
blanchet@35385
   423
                do_notin_mtype_fv Plus sexp M1
blanchet@34982
   424
              else
blanchet@34982
   425
                I)
blanchet@34982
   426
          |> (if sn' = Minus orelse sn = Plus then
blanchet@35385
   427
                do_notin_mtype_fv Minus sexp M1
blanchet@34982
   428
              else
blanchet@34982
   429
                I)
blanchet@35385
   430
          |> do_notin_mtype_fv sn sexp M2
blanchet@35385
   431
  | do_notin_mtype_fv Plus sexp (MFun (M1, V x, M2)) accum =
blanchet@34982
   432
    accum |> (case do_literal (x, Minus) (SOME sexp) of
blanchet@33192
   433
                NONE => I
blanchet@35385
   434
              | SOME sexp' => do_notin_mtype_fv Plus sexp' M1)
blanchet@35385
   435
          |> do_notin_mtype_fv Minus sexp M1
blanchet@35385
   436
          |> do_notin_mtype_fv Plus sexp M2
blanchet@35385
   437
  | do_notin_mtype_fv Minus sexp (MFun (M1, V x, M2)) accum =
blanchet@34982
   438
    accum |> (case do_literal (x, Plus) (SOME sexp) of
blanchet@33192
   439
                NONE => I
blanchet@35385
   440
              | SOME sexp' => do_notin_mtype_fv Plus sexp' M1)
blanchet@35385
   441
          |> do_notin_mtype_fv Minus sexp M2
blanchet@35385
   442
  | do_notin_mtype_fv sn sexp (MPair (M1, M2)) accum =
blanchet@35385
   443
    accum |> fold (do_notin_mtype_fv sn sexp) [M1, M2]
blanchet@35385
   444
  | do_notin_mtype_fv sn sexp (MType (_, Ms)) accum =
blanchet@35385
   445
    accum |> fold (do_notin_mtype_fv sn sexp) Ms
blanchet@35385
   446
  | do_notin_mtype_fv _ _ M _ =
blanchet@35665
   447
    raise MTYPE ("Nitpick_Mono.do_notin_mtype_fv", [M], [])
blanchet@33192
   448
blanchet@35832
   449
fun add_notin_mtype_fv sn M ((lits, comps, sexps) : constraint_set) =
blanchet@38179
   450
    (trace_msg (fn () => "*** Add " ^ string_for_mtype M ^ " is " ^
blanchet@40058
   451
                         (case sn of Minus => "concrete" | Plus => "complete"));
blanchet@35385
   452
     case do_notin_mtype_fv sn [] M (SOME (lits, sexps)) of
blanchet@38179
   453
       NONE => (trace_msg (K "**** Unsolvable"); raise UNSOLVABLE ())
blanchet@35812
   454
     | SOME (lits, sexps) => (lits, comps, sexps))
blanchet@33192
   455
blanchet@35665
   456
val add_mtype_is_concrete = add_notin_mtype_fv Minus
blanchet@35665
   457
val add_mtype_is_complete = add_notin_mtype_fv Plus
blanchet@33192
   458
blanchet@35384
   459
val bool_from_minus = true
blanchet@35384
   460
blanchet@35384
   461
fun bool_from_sign Plus = not bool_from_minus
blanchet@35384
   462
  | bool_from_sign Minus = bool_from_minus
blanchet@35384
   463
fun sign_from_bool b = if b = bool_from_minus then Minus else Plus
blanchet@33192
   464
blanchet@33192
   465
fun prop_for_literal (x, sn) =
blanchet@33192
   466
  (not (bool_from_sign sn) ? PropLogic.Not) (PropLogic.BoolVar x)
blanchet@33192
   467
fun prop_for_sign_atom_eq (S sn', sn) =
blanchet@33192
   468
    if sn = sn' then PropLogic.True else PropLogic.False
blanchet@33192
   469
  | prop_for_sign_atom_eq (V x, sn) = prop_for_literal (x, sn)
blanchet@33192
   470
fun prop_for_sign_expr xs = PropLogic.exists (map prop_for_literal xs)
blanchet@33192
   471
fun prop_for_exists_eq xs sn =
blanchet@33192
   472
  PropLogic.exists (map (fn x => prop_for_literal (x, sn)) xs)
blanchet@33192
   473
fun prop_for_comp (a1, a2, Eq, []) =
blanchet@33192
   474
    PropLogic.SAnd (prop_for_comp (a1, a2, Leq, []),
blanchet@33192
   475
                    prop_for_comp (a2, a1, Leq, []))
blanchet@33192
   476
  | prop_for_comp (a1, a2, Leq, []) =
blanchet@34982
   477
    PropLogic.SOr (prop_for_sign_atom_eq (a1, Plus),
blanchet@34982
   478
                   prop_for_sign_atom_eq (a2, Minus))
blanchet@33192
   479
  | prop_for_comp (a1, a2, cmp, xs) =
blanchet@34982
   480
    PropLogic.SOr (prop_for_exists_eq xs Minus, prop_for_comp (a1, a2, cmp, []))
blanchet@33192
   481
blanchet@34123
   482
fun literals_from_assignments max_var assigns lits =
blanchet@33192
   483
  fold (fn x => fn accum =>
blanchet@33192
   484
           if AList.defined (op =) lits x then
blanchet@33192
   485
             accum
blanchet@34123
   486
           else case assigns x of
blanchet@33192
   487
             SOME b => (x, sign_from_bool b) :: accum
blanchet@33192
   488
           | NONE => accum) (max_var downto 1) lits
blanchet@33192
   489
blanchet@33192
   490
fun string_for_comp (a1, a2, cmp, xs) =
blanchet@33192
   491
  string_for_sign_atom a1 ^ " " ^ string_for_comp_op cmp ^
blanchet@33192
   492
  subscript_string_for_vars " \<and> " xs ^ " " ^ string_for_sign_atom a2
blanchet@33192
   493
blanchet@33192
   494
fun print_problem lits comps sexps =
blanchet@38179
   495
  trace_msg (fn () => "*** Problem:\n" ^
blanchet@38179
   496
                      cat_lines (map string_for_literal lits @
blanchet@38179
   497
                                 map string_for_comp comps @
blanchet@38179
   498
                                 map string_for_sign_expr sexps))
blanchet@33192
   499
blanchet@33192
   500
fun print_solution lits =
blanchet@34982
   501
  let val (pos, neg) = List.partition (curry (op =) Plus o snd) lits in
blanchet@38179
   502
    trace_msg (fn () => "*** Solution:\n" ^
blanchet@38179
   503
                        "+: " ^ commas (map (string_for_var o fst) pos) ^ "\n" ^
blanchet@38179
   504
                        "-: " ^ commas (map (string_for_var o fst) neg))
blanchet@33192
   505
  end
blanchet@33192
   506
blanchet@35812
   507
fun solve max_var (lits, comps, sexps) =
blanchet@40146
   508
  let
blanchet@40146
   509
    fun do_assigns assigns =
blanchet@40146
   510
      SOME (literals_from_assignments max_var assigns lits
blanchet@40146
   511
            |> tap print_solution)
blanchet@40146
   512
    val _ = print_problem lits comps sexps
blanchet@40146
   513
    val prop = PropLogic.all (map prop_for_literal lits @
blanchet@40146
   514
                              map prop_for_comp comps @
blanchet@40146
   515
                              map prop_for_sign_expr sexps)
blanchet@40146
   516
    val default_val = bool_from_sign Minus
blanchet@40146
   517
  in
blanchet@40146
   518
    if PropLogic.eval (K default_val) prop then
blanchet@40146
   519
      do_assigns (K (SOME default_val))
blanchet@40146
   520
    else
blanchet@40146
   521
      let
blanchet@40146
   522
        (* use the first ML solver (to avoid startup overhead) *)
blanchet@40146
   523
        val solvers = !SatSolver.solvers
blanchet@40146
   524
                      |> filter (member (op =) ["dptsat", "dpll"] o fst)
blanchet@40146
   525
      in
blanchet@40146
   526
        case snd (hd solvers) prop of
blanchet@40146
   527
          SatSolver.SATISFIABLE assigns => do_assigns assigns
blanchet@40146
   528
        | _ => NONE
blanchet@40146
   529
      end
blanchet@40146
   530
  end
blanchet@33192
   531
blanchet@35385
   532
type mtype_schema = mtyp * constraint_set
blanchet@35385
   533
type mtype_context =
blanchet@35665
   534
  {bound_Ts: typ list,
blanchet@35665
   535
   bound_Ms: mtyp list,
blanchet@35385
   536
   frees: (styp * mtyp) list,
blanchet@35385
   537
   consts: (styp * mtyp) list}
blanchet@33192
   538
blanchet@35385
   539
type accumulator = mtype_context * constraint_set
blanchet@33192
   540
blanchet@35665
   541
val initial_gamma = {bound_Ts = [], bound_Ms = [], frees = [], consts = []}
blanchet@33192
   542
blanchet@35665
   543
fun push_bound T M {bound_Ts, bound_Ms, frees, consts} =
blanchet@35665
   544
  {bound_Ts = T :: bound_Ts, bound_Ms = M :: bound_Ms, frees = frees,
blanchet@35665
   545
   consts = consts}
blanchet@35665
   546
fun pop_bound {bound_Ts, bound_Ms, frees, consts} =
blanchet@35665
   547
  {bound_Ts = tl bound_Ts, bound_Ms = tl bound_Ms, frees = frees,
blanchet@35665
   548
   consts = consts}
blanchet@35665
   549
  handle List.Empty => initial_gamma (* FIXME: needed? *)
blanchet@33192
   550
blanchet@39359
   551
fun consider_term (mdata as {hol_ctxt = {thy, ctxt, stds, ...}, alpha_T,
blanchet@39359
   552
                             max_fresh, ...}) =
blanchet@33192
   553
  let
blanchet@37476
   554
    fun is_enough_eta_expanded t =
blanchet@37476
   555
      case strip_comb t of
blanchet@39359
   556
        (Const x, ts) => the_default 0 (arity_of_built_in_const thy stds x)
blanchet@37476
   557
        <= length ts
blanchet@37476
   558
      | _ => true
blanchet@35672
   559
    val mtype_for = fresh_mtype_for_type mdata false
blanchet@35665
   560
    fun plus_set_mtype_for_dom M =
blanchet@35385
   561
      MFun (M, S (if exists_alpha_sub_mtype M then Plus else Minus), bool_M)
blanchet@35385
   562
    fun do_all T (gamma, cset) =
blanchet@33192
   563
      let
blanchet@35385
   564
        val abs_M = mtype_for (domain_type (domain_type T))
blanchet@35386
   565
        val body_M = mtype_for (body_type T)
blanchet@33192
   566
      in
blanchet@35385
   567
        (MFun (MFun (abs_M, S Minus, body_M), S Minus, body_M),
blanchet@35665
   568
         (gamma, cset |> add_mtype_is_complete abs_M))
blanchet@33192
   569
      end
blanchet@33192
   570
    fun do_equals T (gamma, cset) =
blanchet@35385
   571
      let val M = mtype_for (domain_type T) in
blanchet@35385
   572
        (MFun (M, S Minus, MFun (M, V (Unsynchronized.inc max_fresh),
blanchet@35385
   573
                                 mtype_for (nth_range_type 2 T))),
blanchet@35665
   574
         (gamma, cset |> add_mtype_is_concrete M))
blanchet@33192
   575
      end
blanchet@33192
   576
    fun do_robust_set_operation T (gamma, cset) =
blanchet@33192
   577
      let
blanchet@33192
   578
        val set_T = domain_type T
blanchet@35385
   579
        val M1 = mtype_for set_T
blanchet@35385
   580
        val M2 = mtype_for set_T
blanchet@35385
   581
        val M3 = mtype_for set_T
blanchet@33192
   582
      in
blanchet@35385
   583
        (MFun (M1, S Minus, MFun (M2, S Minus, M3)),
blanchet@35385
   584
         (gamma, cset |> add_is_sub_mtype M1 M3 |> add_is_sub_mtype M2 M3))
blanchet@33192
   585
      end
blanchet@33192
   586
    fun do_fragile_set_operation T (gamma, cset) =
blanchet@33192
   587
      let
blanchet@33192
   588
        val set_T = domain_type T
blanchet@35385
   589
        val set_M = mtype_for set_T
blanchet@35665
   590
        fun custom_mtype_for (T as Type (@{type_name fun}, [T1, T2])) =
blanchet@35385
   591
            if T = set_T then set_M
blanchet@35385
   592
            else MFun (custom_mtype_for T1, S Minus, custom_mtype_for T2)
blanchet@35385
   593
          | custom_mtype_for T = mtype_for T
blanchet@33192
   594
      in
blanchet@35665
   595
        (custom_mtype_for T, (gamma, cset |> add_mtype_is_concrete set_M))
blanchet@33192
   596
      end
blanchet@33192
   597
    fun do_pair_constr T accum =
blanchet@35385
   598
      case mtype_for (nth_range_type 2 T) of
blanchet@35385
   599
        M as MPair (a_M, b_M) =>
blanchet@35385
   600
        (MFun (a_M, S Minus, MFun (b_M, S Minus, M)), accum)
blanchet@35665
   601
      | M => raise MTYPE ("Nitpick_Mono.consider_term.do_pair_constr", [M], [])
blanchet@33192
   602
    fun do_nth_pair_sel n T =
blanchet@35385
   603
      case mtype_for (domain_type T) of
blanchet@35385
   604
        M as MPair (a_M, b_M) =>
blanchet@35385
   605
        pair (MFun (M, S Minus, if n = 0 then a_M else b_M))
blanchet@35665
   606
      | M => raise MTYPE ("Nitpick_Mono.consider_term.do_nth_pair_sel", [M], [])
blanchet@35385
   607
    fun do_bounded_quantifier t0 abs_s abs_T connective_t bound_t body_t accum =
blanchet@33192
   608
      let
blanchet@35385
   609
        val abs_M = mtype_for abs_T
blanchet@35665
   610
        val (bound_m, accum) =
blanchet@35665
   611
          accum |>> push_bound abs_T abs_M |> do_term bound_t
blanchet@35665
   612
        val expected_bound_M = plus_set_mtype_for_dom abs_M
blanchet@35385
   613
        val (body_m, accum) =
blanchet@35385
   614
          accum ||> add_mtypes_equal expected_bound_M (mtype_of_mterm bound_m)
blanchet@35385
   615
                |> do_term body_t ||> apfst pop_bound
blanchet@35385
   616
        val bound_M = mtype_of_mterm bound_m
blanchet@39345
   617
        val (M1, a, _) = dest_MFun bound_M
blanchet@33192
   618
      in
blanchet@35386
   619
        (MApp (MRaw (t0, MFun (bound_M, S Minus, bool_M)),
blanchet@35385
   620
               MAbs (abs_s, abs_T, M1, a,
blanchet@35386
   621
                     MApp (MApp (MRaw (connective_t,
blanchet@35386
   622
                                       mtype_for (fastype_of connective_t)),
blanchet@35386
   623
                                 MApp (bound_m, MRaw (Bound 0, M1))),
blanchet@35385
   624
                           body_m))), accum)
blanchet@33192
   625
      end
blanchet@39345
   626
    and do_term t (accum as ({bound_Ts, bound_Ms, frees, consts}, cset)) =
blanchet@38179
   627
        (trace_msg (fn () => "  \<Gamma> \<turnstile> " ^
blanchet@38179
   628
                             Syntax.string_of_term ctxt t ^ " : _?");
blanchet@37704
   629
         case t of
blanchet@33192
   630
           Const (x as (s, T)) =>
blanchet@33192
   631
           (case AList.lookup (op =) consts x of
blanchet@35385
   632
              SOME M => (M, accum)
blanchet@33192
   633
            | NONE =>
blanchet@33192
   634
              if not (could_exist_alpha_subtype alpha_T T) then
blanchet@35385
   635
                (mtype_for T, accum)
blanchet@33192
   636
              else case s of
blanchet@35385
   637
                @{const_name all} => do_all T accum
blanchet@33192
   638
              | @{const_name "=="} => do_equals T accum
blanchet@35385
   639
              | @{const_name All} => do_all T accum
blanchet@35385
   640
              | @{const_name Ex} =>
blanchet@35386
   641
                let val set_T = domain_type T in
blanchet@35386
   642
                  do_term (Abs (Name.uu, set_T,
blanchet@35386
   643
                                @{const Not} $ (HOLogic.mk_eq
blanchet@35386
   644
                                    (Abs (Name.uu, domain_type set_T,
blanchet@35386
   645
                                          @{const False}),
blanchet@35386
   646
                                     Bound 0)))) accum
blanchet@35386
   647
                  |>> mtype_of_mterm
blanchet@35386
   648
                end
haftmann@38864
   649
              | @{const_name HOL.eq} => do_equals T accum
blanchet@37476
   650
              | @{const_name The} =>
blanchet@38179
   651
                (trace_msg (K "*** The"); raise UNSOLVABLE ())
blanchet@37476
   652
              | @{const_name Eps} =>
blanchet@38179
   653
                (trace_msg (K "*** Eps"); raise UNSOLVABLE ())
blanchet@33192
   654
              | @{const_name If} =>
blanchet@33192
   655
                do_robust_set_operation (range_type T) accum
blanchet@35385
   656
                |>> curry3 MFun bool_M (S Minus)
blanchet@33192
   657
              | @{const_name Pair} => do_pair_constr T accum
blanchet@33192
   658
              | @{const_name fst} => do_nth_pair_sel 0 T accum
blanchet@39316
   659
              | @{const_name snd} => do_nth_pair_sel 1 T accum
blanchet@33192
   660
              | @{const_name Id} =>
blanchet@35385
   661
                (MFun (mtype_for (domain_type T), S Minus, bool_M), accum)
blanchet@33192
   662
              | @{const_name converse} =>
blanchet@33192
   663
                let
blanchet@33192
   664
                  val x = Unsynchronized.inc max_fresh
blanchet@35385
   665
                  fun mtype_for_set T =
blanchet@35385
   666
                    MFun (mtype_for (domain_type T), V x, bool_M)
blanchet@35385
   667
                  val ab_set_M = domain_type T |> mtype_for_set
blanchet@35385
   668
                  val ba_set_M = range_type T |> mtype_for_set
blanchet@35385
   669
                in (MFun (ab_set_M, S Minus, ba_set_M), accum) end
blanchet@33192
   670
              | @{const_name trancl} => do_fragile_set_operation T accum
blanchet@33192
   671
              | @{const_name rel_comp} =>
blanchet@33192
   672
                let
blanchet@33192
   673
                  val x = Unsynchronized.inc max_fresh
blanchet@35385
   674
                  fun mtype_for_set T =
blanchet@35385
   675
                    MFun (mtype_for (domain_type T), V x, bool_M)
blanchet@35385
   676
                  val bc_set_M = domain_type T |> mtype_for_set
blanchet@35385
   677
                  val ab_set_M = domain_type (range_type T) |> mtype_for_set
blanchet@35385
   678
                  val ac_set_M = nth_range_type 2 T |> mtype_for_set
blanchet@33192
   679
                in
blanchet@35385
   680
                  (MFun (bc_set_M, S Minus, MFun (ab_set_M, S Minus, ac_set_M)),
blanchet@33192
   681
                   accum)
blanchet@33192
   682
                end
blanchet@33192
   683
              | @{const_name image} =>
blanchet@33192
   684
                let
blanchet@35385
   685
                  val a_M = mtype_for (domain_type (domain_type T))
blanchet@35385
   686
                  val b_M = mtype_for (range_type (domain_type T))
blanchet@33192
   687
                in
blanchet@35385
   688
                  (MFun (MFun (a_M, S Minus, b_M), S Minus,
blanchet@35665
   689
                         MFun (plus_set_mtype_for_dom a_M, S Minus,
blanchet@35665
   690
                               plus_set_mtype_for_dom b_M)), accum)
blanchet@33192
   691
                end
blanchet@35672
   692
              | @{const_name finite} =>
blanchet@35672
   693
                let val M1 = mtype_for (domain_type (domain_type T)) in
blanchet@35672
   694
                  (MFun (plus_set_mtype_for_dom M1, S Minus, bool_M), accum)
blanchet@35672
   695
                end
blanchet@33192
   696
              | @{const_name Sigma} =>
blanchet@33192
   697
                let
blanchet@33192
   698
                  val x = Unsynchronized.inc max_fresh
blanchet@35385
   699
                  fun mtype_for_set T =
blanchet@35385
   700
                    MFun (mtype_for (domain_type T), V x, bool_M)
blanchet@33192
   701
                  val a_set_T = domain_type T
blanchet@35385
   702
                  val a_M = mtype_for (domain_type a_set_T)
blanchet@35385
   703
                  val b_set_M = mtype_for_set (range_type (domain_type
blanchet@33192
   704
                                                               (range_type T)))
blanchet@35385
   705
                  val a_set_M = mtype_for_set a_set_T
blanchet@35385
   706
                  val a_to_b_set_M = MFun (a_M, S Minus, b_set_M)
blanchet@35385
   707
                  val ab_set_M = mtype_for_set (nth_range_type 2 T)
blanchet@33192
   708
                in
blanchet@35385
   709
                  (MFun (a_set_M, S Minus,
blanchet@35385
   710
                         MFun (a_to_b_set_M, S Minus, ab_set_M)), accum)
blanchet@33192
   711
                end
blanchet@35220
   712
              | _ =>
blanchet@39360
   713
                if s = @{const_name safe_The} then
blanchet@35671
   714
                  let
blanchet@35671
   715
                    val a_set_M = mtype_for (domain_type T)
blanchet@35671
   716
                    val a_M = dest_MFun a_set_M |> #1
blanchet@35671
   717
                  in (MFun (a_set_M, S Minus, a_M), accum) end
blanchet@35220
   718
                else if s = @{const_name ord_class.less_eq} andalso
blanchet@35220
   719
                        is_set_type (domain_type T) then
blanchet@35220
   720
                  do_fragile_set_operation T accum
blanchet@35220
   721
                else if is_sel s then
blanchet@35665
   722
                  (mtype_for_sel mdata x, accum)
blanchet@37256
   723
                else if is_constr ctxt stds x then
blanchet@35385
   724
                  (mtype_for_constr mdata x, accum)
blanchet@39359
   725
                else if is_built_in_const thy stds x then
blanchet@35672
   726
                  (fresh_mtype_for_type mdata true T, accum)
blanchet@35220
   727
                else
blanchet@35385
   728
                  let val M = mtype_for T in
blanchet@35665
   729
                    (M, ({bound_Ts = bound_Ts, bound_Ms = bound_Ms,
blanchet@35665
   730
                          frees = frees, consts = (x, M) :: consts}, cset))
blanchet@35386
   731
                  end) |>> curry MRaw t
blanchet@33192
   732
         | Free (x as (_, T)) =>
blanchet@33192
   733
           (case AList.lookup (op =) frees x of
blanchet@35385
   734
              SOME M => (M, accum)
blanchet@33192
   735
            | NONE =>
blanchet@35385
   736
              let val M = mtype_for T in
blanchet@35665
   737
                (M, ({bound_Ts = bound_Ts, bound_Ms = bound_Ms,
blanchet@35665
   738
                      frees = (x, M) :: frees, consts = consts}, cset))
blanchet@35386
   739
              end) |>> curry MRaw t
blanchet@38179
   740
         | Var _ => (trace_msg (K "*** Var"); raise UNSOLVABLE ())
blanchet@35665
   741
         | Bound j => (MRaw (t, nth bound_Ms j), accum)
blanchet@35385
   742
         | Abs (s, T, t') =>
blanchet@35665
   743
           (case fin_fun_body T (fastype_of1 (T :: bound_Ts, t')) t' of
blanchet@35665
   744
              SOME t' =>
blanchet@35665
   745
              let
blanchet@35665
   746
                val M = mtype_for T
blanchet@35665
   747
                val a = V (Unsynchronized.inc max_fresh)
blanchet@35665
   748
                val (m', accum) = do_term t' (accum |>> push_bound T M)
blanchet@35665
   749
              in (MAbs (s, T, M, a, m'), accum |>> pop_bound) end
blanchet@35665
   750
            | NONE =>
blanchet@35665
   751
              ((case t' of
blanchet@35665
   752
                  t1' $ Bound 0 =>
blanchet@37476
   753
                  if not (loose_bvar1 (t1', 0)) andalso
blanchet@37476
   754
                     is_enough_eta_expanded t1' then
blanchet@35665
   755
                    do_term (incr_boundvars ~1 t1') accum
blanchet@35665
   756
                  else
blanchet@35665
   757
                    raise SAME ()
haftmann@38864
   758
                | (t11 as Const (@{const_name HOL.eq}, _)) $ Bound 0 $ t13 =>
blanchet@37476
   759
                  if not (loose_bvar1 (t13, 0)) then
blanchet@37476
   760
                    do_term (incr_boundvars ~1 (t11 $ t13)) accum
blanchet@37476
   761
                  else
blanchet@37476
   762
                    raise SAME ()
blanchet@35665
   763
                | _ => raise SAME ())
blanchet@35665
   764
               handle SAME () =>
blanchet@35665
   765
                      let
blanchet@35665
   766
                        val M = mtype_for T
blanchet@35665
   767
                        val (m', accum) = do_term t' (accum |>> push_bound T M)
blanchet@35665
   768
                      in
blanchet@35665
   769
                        (MAbs (s, T, M, S Minus, m'), accum |>> pop_bound)
blanchet@35665
   770
                      end))
blanchet@35385
   771
         | (t0 as Const (@{const_name All}, _))
haftmann@38786
   772
           $ Abs (s', T', (t10 as @{const HOL.implies}) $ (t11 $ Bound 0) $ t12) =>
blanchet@35385
   773
           do_bounded_quantifier t0 s' T' t10 t11 t12 accum
blanchet@35385
   774
         | (t0 as Const (@{const_name Ex}, _))
haftmann@38795
   775
           $ Abs (s', T', (t10 as @{const HOL.conj}) $ (t11 $ Bound 0) $ t12) =>
blanchet@35385
   776
           do_bounded_quantifier t0 s' T' t10 t11 t12 accum
blanchet@33192
   777
         | Const (@{const_name Let}, _) $ t1 $ t2 =>
blanchet@33192
   778
           do_term (betapply (t2, t1)) accum
blanchet@33192
   779
         | t1 $ t2 =>
blanchet@33192
   780
           let
blanchet@35385
   781
             val (m1, accum) = do_term t1 accum
blanchet@35385
   782
             val (m2, accum) = do_term t2 accum
blanchet@33192
   783
           in
blanchet@35812
   784
             let
blanchet@35812
   785
               val M11 = mtype_of_mterm m1 |> dest_MFun |> #1
blanchet@35812
   786
               val M2 = mtype_of_mterm m2
blanchet@35812
   787
             in (MApp (m1, m2), accum ||> add_is_sub_mtype M2 M11) end
blanchet@33192
   788
           end)
blanchet@38179
   789
        |> tap (fn (m, _) => trace_msg (fn () => "  \<Gamma> \<turnstile> " ^
blanchet@38179
   790
                                                 string_for_mterm ctxt m))
blanchet@33192
   791
  in do_term end
blanchet@33192
   792
blanchet@35665
   793
fun force_minus_funs 0 _ = I
blanchet@35665
   794
  | force_minus_funs n (M as MFun (M1, _, M2)) =
blanchet@35665
   795
    add_mtypes_equal M (MFun (M1, S Minus, M2))
blanchet@35665
   796
    #> force_minus_funs (n - 1) M2
blanchet@35665
   797
  | force_minus_funs _ M =
blanchet@35665
   798
    raise MTYPE ("Nitpick_Mono.force_minus_funs", [M], [])
blanchet@35665
   799
fun consider_general_equals mdata def (x as (_, T)) t1 t2 accum =
blanchet@35386
   800
  let
blanchet@35386
   801
    val (m1, accum) = consider_term mdata t1 accum
blanchet@35386
   802
    val (m2, accum) = consider_term mdata t2 accum
blanchet@35386
   803
    val M1 = mtype_of_mterm m1
blanchet@35386
   804
    val M2 = mtype_of_mterm m2
blanchet@35665
   805
    val accum = accum ||> add_mtypes_equal M1 M2
blanchet@35672
   806
    val body_M = fresh_mtype_for_type mdata false (nth_range_type 2 T)
blanchet@35665
   807
    val m = MApp (MApp (MRaw (Const x,
blanchet@35665
   808
                MFun (M1, S Minus, MFun (M2, S Minus, body_M))), m1), m2)
blanchet@35386
   809
  in
blanchet@35665
   810
    (m, if def then
blanchet@35665
   811
          let val (head_m, arg_ms) = strip_mcomb m1 in
blanchet@35665
   812
            accum ||> force_minus_funs (length arg_ms) (mtype_of_mterm head_m)
blanchet@35665
   813
          end
blanchet@35665
   814
        else
blanchet@35665
   815
          accum)
blanchet@35386
   816
  end
blanchet@35386
   817
blanchet@35385
   818
fun consider_general_formula (mdata as {hol_ctxt = {ctxt, ...}, ...}) =
blanchet@33192
   819
  let
blanchet@35672
   820
    val mtype_for = fresh_mtype_for_type mdata false
blanchet@35386
   821
    val do_term = consider_term mdata
blanchet@35812
   822
    fun do_formula sn t accum =
blanchet@33192
   823
        let
blanchet@35386
   824
          fun do_quantifier (quant_x as (quant_s, _)) abs_s abs_T body_t =
blanchet@33192
   825
            let
blanchet@35385
   826
              val abs_M = mtype_for abs_T
blanchet@34982
   827
              val side_cond = ((sn = Minus) = (quant_s = @{const_name Ex}))
blanchet@35386
   828
              val (body_m, accum) =
blanchet@35665
   829
                accum ||> side_cond ? add_mtype_is_complete abs_M
blanchet@35665
   830
                      |>> push_bound abs_T abs_M |> do_formula sn body_t
blanchet@35386
   831
              val body_M = mtype_of_mterm body_m
blanchet@33192
   832
            in
blanchet@35665
   833
              (MApp (MRaw (Const quant_x,
blanchet@35665
   834
                           MFun (MFun (abs_M, S Minus, body_M), S Minus,
blanchet@35665
   835
                                 body_M)),
blanchet@35386
   836
                     MAbs (abs_s, abs_T, abs_M, S Minus, body_m)),
blanchet@35386
   837
               accum |>> pop_bound)
blanchet@33192
   838
            end
blanchet@35386
   839
          fun do_equals x t1 t2 =
blanchet@33192
   840
            case sn of
blanchet@35386
   841
              Plus => do_term t accum
blanchet@35665
   842
            | Minus => consider_general_equals mdata false x t1 t2 accum
blanchet@33192
   843
        in
blanchet@38179
   844
          (trace_msg (fn () => "  \<Gamma> \<turnstile> " ^
blanchet@38179
   845
                               Syntax.string_of_term ctxt t ^ " : o\<^sup>" ^
blanchet@38179
   846
                               string_for_sign sn ^ "?");
blanchet@37704
   847
           case t of
blanchet@37704
   848
             Const (x as (@{const_name all}, _)) $ Abs (s1, T1, t1) =>
blanchet@37704
   849
             do_quantifier x s1 T1 t1
blanchet@37704
   850
           | Const (x as (@{const_name "=="}, _)) $ t1 $ t2 => do_equals x t1 t2
blanchet@37704
   851
           | @{const Trueprop} $ t1 =>
blanchet@37704
   852
             let val (m1, accum) = do_formula sn t1 accum in
blanchet@37704
   853
               (MApp (MRaw (@{const Trueprop}, mtype_for (bool_T --> prop_T)),
blanchet@37704
   854
                      m1), accum)
blanchet@37704
   855
             end
blanchet@37704
   856
           | @{const Not} $ t1 =>
blanchet@37704
   857
             let val (m1, accum) = do_formula (negate sn) t1 accum in
blanchet@37704
   858
               (MApp (MRaw (@{const Not}, mtype_for (bool_T --> bool_T)), m1),
blanchet@37704
   859
                accum)
blanchet@37704
   860
             end
blanchet@37704
   861
           | Const (x as (@{const_name All}, _)) $ Abs (s1, T1, t1) =>
blanchet@37704
   862
             do_quantifier x s1 T1 t1
blanchet@39345
   863
           | Const (x0 as (@{const_name Ex}, T0))
blanchet@37704
   864
             $ (t1 as Abs (s1, T1, t1')) =>
blanchet@37704
   865
             (case sn of
blanchet@37704
   866
                Plus => do_quantifier x0 s1 T1 t1'
blanchet@37704
   867
              | Minus =>
blanchet@37704
   868
                (* FIXME: Move elsewhere *)
blanchet@37704
   869
                do_term (@{const Not}
blanchet@37704
   870
                         $ (HOLogic.eq_const (domain_type T0) $ t1
blanchet@37704
   871
                            $ Abs (Name.uu, T1, @{const False}))) accum)
haftmann@38864
   872
           | Const (x as (@{const_name HOL.eq}, _)) $ t1 $ t2 =>
blanchet@37704
   873
             do_equals x t1 t2
blanchet@37704
   874
           | Const (@{const_name Let}, _) $ t1 $ t2 =>
blanchet@37704
   875
             do_formula sn (betapply (t2, t1)) accum
blanchet@37704
   876
           | (t0 as Const (s0, _)) $ t1 $ t2 =>
blanchet@38199
   877
             if s0 = @{const_name "==>"} orelse
blanchet@38199
   878
                s0 = @{const_name Pure.conjunction} orelse
haftmann@38795
   879
                s0 = @{const_name HOL.conj} orelse
haftmann@38795
   880
                s0 = @{const_name HOL.disj} orelse
haftmann@38786
   881
                s0 = @{const_name HOL.implies} then
blanchet@37704
   882
               let
blanchet@37704
   883
                 val impl = (s0 = @{const_name "==>"} orelse
haftmann@38786
   884
                             s0 = @{const_name HOL.implies})
blanchet@37704
   885
                 val (m1, accum) = do_formula (sn |> impl ? negate) t1 accum
blanchet@37704
   886
                 val (m2, accum) = do_formula sn t2 accum
blanchet@37704
   887
               in
blanchet@37704
   888
                 (MApp (MApp (MRaw (t0, mtype_for (fastype_of t0)), m1), m2),
blanchet@37704
   889
                  accum)
blanchet@39316
   890
               end
blanchet@37704
   891
             else
blanchet@37704
   892
               do_term t accum
blanchet@37704
   893
           | _ => do_term t accum)
blanchet@33192
   894
        end
blanchet@35386
   895
        |> tap (fn (m, _) =>
blanchet@38179
   896
                   trace_msg (fn () => "\<Gamma> \<turnstile> " ^
blanchet@38179
   897
                                       string_for_mterm ctxt m ^ " : o\<^sup>" ^
blanchet@38179
   898
                                       string_for_sign sn))
blanchet@33192
   899
  in do_formula end
blanchet@33192
   900
blanchet@33192
   901
(* The harmless axiom optimization below is somewhat too aggressive in the face
blanchet@33192
   902
   of (rather peculiar) user-defined axioms. *)
blanchet@33192
   903
val harmless_consts =
blanchet@33192
   904
  [@{const_name ord_class.less}, @{const_name ord_class.less_eq}]
blanchet@33192
   905
val bounteous_consts = [@{const_name bisim}]
blanchet@33192
   906
blanchet@35665
   907
fun is_harmless_axiom ({no_harmless = true, ...} : mdata) _ = false
blanchet@39359
   908
  | is_harmless_axiom {hol_ctxt = {thy, stds, ...}, ...} t =
blanchet@35665
   909
    Term.add_consts t []
blanchet@39359
   910
    |> filter_out (is_built_in_const thy stds)
blanchet@35665
   911
    |> (forall (member (op =) harmless_consts o original_name o fst) orf
blanchet@35665
   912
        exists (member (op =) bounteous_consts o fst))
blanchet@33192
   913
blanchet@35665
   914
fun consider_nondefinitional_axiom mdata t =
blanchet@35665
   915
  if is_harmless_axiom mdata t then pair (MRaw (t, dummy_M))
blanchet@35386
   916
  else consider_general_formula mdata Plus t
blanchet@33192
   917
blanchet@37256
   918
fun consider_definitional_axiom (mdata as {hol_ctxt = {ctxt, ...}, ...}) t =
blanchet@37256
   919
  if not (is_constr_pattern_formula ctxt t) then
blanchet@35386
   920
    consider_nondefinitional_axiom mdata t
blanchet@35665
   921
  else if is_harmless_axiom mdata t then
blanchet@35386
   922
    pair (MRaw (t, dummy_M))
blanchet@33192
   923
  else
blanchet@33192
   924
    let
blanchet@35672
   925
      val mtype_for = fresh_mtype_for_type mdata false
blanchet@35386
   926
      val do_term = consider_term mdata
blanchet@35386
   927
      fun do_all quant_t abs_s abs_T body_t accum =
blanchet@35386
   928
        let
blanchet@35386
   929
          val abs_M = mtype_for abs_T
blanchet@35386
   930
          val (body_m, accum) =
blanchet@35665
   931
            accum |>> push_bound abs_T abs_M |> do_formula body_t
blanchet@35386
   932
          val body_M = mtype_of_mterm body_m
blanchet@35386
   933
        in
blanchet@35665
   934
          (MApp (MRaw (quant_t,
blanchet@35665
   935
                       MFun (MFun (abs_M, S Minus, body_M), S Minus, body_M)),
blanchet@35386
   936
                 MAbs (abs_s, abs_T, abs_M, S Minus, body_m)),
blanchet@35386
   937
           accum |>> pop_bound)
blanchet@33192
   938
        end
blanchet@35386
   939
      and do_conjunction t0 t1 t2 accum =
blanchet@33192
   940
        let
blanchet@35386
   941
          val (m1, accum) = do_formula t1 accum
blanchet@35386
   942
          val (m2, accum) = do_formula t2 accum
blanchet@35386
   943
        in
blanchet@35386
   944
          (MApp (MApp (MRaw (t0, mtype_for (fastype_of t0)), m1), m2), accum)
blanchet@35386
   945
        end
blanchet@35386
   946
      and do_implies t0 t1 t2 accum =
blanchet@35386
   947
        let
blanchet@35386
   948
          val (m1, accum) = do_term t1 accum
blanchet@35386
   949
          val (m2, accum) = do_formula t2 accum
blanchet@35386
   950
        in
blanchet@35386
   951
          (MApp (MApp (MRaw (t0, mtype_for (fastype_of t0)), m1), m2), accum)
blanchet@35386
   952
        end
blanchet@35812
   953
      and do_formula t accum =
blanchet@33192
   954
          case t of
blanchet@35386
   955
            (t0 as Const (@{const_name all}, _)) $ Abs (s1, T1, t1) =>
blanchet@35386
   956
            do_all t0 s1 T1 t1 accum
blanchet@35665
   957
          | @{const Trueprop} $ t1 =>
blanchet@35665
   958
            let val (m1, accum) = do_formula t1 accum in
blanchet@35665
   959
              (MApp (MRaw (@{const Trueprop}, mtype_for (bool_T --> prop_T)),
blanchet@35665
   960
                     m1), accum)
blanchet@35665
   961
            end
blanchet@35386
   962
          | Const (x as (@{const_name "=="}, _)) $ t1 $ t2 =>
blanchet@35665
   963
            consider_general_equals mdata true x t1 t2 accum
blanchet@35386
   964
          | (t0 as @{const "==>"}) $ t1 $ t2 => do_implies t0 t1 t2 accum
blanchet@35386
   965
          | (t0 as @{const Pure.conjunction}) $ t1 $ t2 =>
blanchet@35386
   966
            do_conjunction t0 t1 t2 accum
blanchet@35386
   967
          | (t0 as Const (@{const_name All}, _)) $ Abs (s0, T1, t1) =>
blanchet@35386
   968
            do_all t0 s0 T1 t1 accum
haftmann@38864
   969
          | Const (x as (@{const_name HOL.eq}, _)) $ t1 $ t2 =>
blanchet@35665
   970
            consider_general_equals mdata true x t1 t2 accum
haftmann@38795
   971
          | (t0 as @{const HOL.conj}) $ t1 $ t2 => do_conjunction t0 t1 t2 accum
haftmann@38786
   972
          | (t0 as @{const HOL.implies}) $ t1 $ t2 => do_implies t0 t1 t2 accum
blanchet@33232
   973
          | _ => raise TERM ("Nitpick_Mono.consider_definitional_axiom.\
blanchet@33192
   974
                             \do_formula", [t])
blanchet@33192
   975
    in do_formula t end
blanchet@33192
   976
blanchet@35385
   977
fun string_for_mtype_of_term ctxt lits t M =
blanchet@35665
   978
  Syntax.string_of_term ctxt t ^ " : " ^ string_for_mtype (resolve_mtype lits M)
blanchet@33192
   979
blanchet@35385
   980
fun print_mtype_context ctxt lits ({frees, consts, ...} : mtype_context) =
blanchet@38179
   981
  trace_msg (fn () =>
blanchet@37476
   982
      map (fn (x, M) => string_for_mtype_of_term ctxt lits (Free x) M) frees @
blanchet@37476
   983
      map (fn (x, M) => string_for_mtype_of_term ctxt lits (Const x) M) consts
blanchet@37476
   984
      |> cat_lines)
blanchet@33192
   985
blanchet@35665
   986
fun amass f t (ms, accum) =
blanchet@35386
   987
  let val (m, accum) = f t accum in (m :: ms, accum) end
blanchet@35386
   988
blanchet@35665
   989
fun infer which no_harmless (hol_ctxt as {ctxt, ...}) binarize alpha_T
blanchet@35665
   990
          (nondef_ts, def_ts) =
blanchet@33192
   991
  let
blanchet@38179
   992
    val _ = trace_msg (fn () => "****** " ^ which ^ " analysis: " ^
blanchet@38179
   993
                                string_for_mtype MAlpha ^ " is " ^
blanchet@38179
   994
                                Syntax.string_of_typ ctxt alpha_T)
blanchet@35665
   995
    val mdata as {max_fresh, constr_mcache, ...} =
blanchet@35665
   996
      initial_mdata hol_ctxt binarize no_harmless alpha_T
blanchet@35812
   997
    val accum = (initial_gamma, ([], [], []))
blanchet@35386
   998
    val (nondef_ms, accum) =
blanchet@35665
   999
      ([], accum) |> amass (consider_general_formula mdata Plus) (hd nondef_ts)
blanchet@35665
  1000
                  |> fold (amass (consider_nondefinitional_axiom mdata))
blanchet@35386
  1001
                          (tl nondef_ts)
blanchet@35386
  1002
    val (def_ms, (gamma, cset)) =
blanchet@35665
  1003
      ([], accum) |> fold (amass (consider_definitional_axiom mdata)) def_ts
blanchet@33192
  1004
  in
blanchet@33192
  1005
    case solve (!max_fresh) cset of
blanchet@35665
  1006
      SOME lits => (print_mtype_context ctxt lits gamma;
blanchet@35665
  1007
                    SOME (lits, (nondef_ms, def_ms), !constr_mcache))
blanchet@35665
  1008
    | _ => NONE
blanchet@33192
  1009
  end
blanchet@35812
  1010
  handle UNSOLVABLE () => NONE
blanchet@35812
  1011
       | MTYPE (loc, Ms, Ts) =>
blanchet@35665
  1012
         raise BAD (loc, commas (map string_for_mtype Ms @
blanchet@35665
  1013
                                 map (Syntax.string_of_typ ctxt) Ts))
blanchet@35665
  1014
       | MTERM (loc, ms) =>
blanchet@35665
  1015
         raise BAD (loc, commas (map (string_for_mterm ctxt) ms))
blanchet@35665
  1016
blanchet@35665
  1017
val formulas_monotonic = is_some oooo infer "Monotonicity" false
blanchet@35665
  1018
blanchet@35665
  1019
fun fin_fun_constr T1 T2 =
blanchet@35665
  1020
  (@{const_name FinFun}, (T1 --> T2) --> Type (@{type_name fin_fun}, [T1, T2]))
blanchet@35665
  1021
blanchet@39359
  1022
fun finitize_funs (hol_ctxt as {thy, ctxt, stds, constr_cache, ...})
blanchet@35665
  1023
                  binarize finitizes alpha_T tsp =
blanchet@35665
  1024
  case infer "Finiteness" true hol_ctxt binarize alpha_T tsp of
blanchet@35665
  1025
    SOME (lits, msp, constr_mtypes) =>
blanchet@35812
  1026
    if forall (curry (op =) Minus o snd) lits then
blanchet@35812
  1027
      tsp
blanchet@35812
  1028
    else
blanchet@35812
  1029
      let
blanchet@35812
  1030
        fun should_finitize T a =
blanchet@35812
  1031
          case triple_lookup (type_match thy) finitizes T of
blanchet@35812
  1032
            SOME (SOME false) => false
blanchet@35812
  1033
          | _ => resolve_sign_atom lits a = S Plus
blanchet@35812
  1034
        fun type_from_mtype T M =
blanchet@35812
  1035
          case (M, T) of
blanchet@35812
  1036
            (MAlpha, _) => T
blanchet@35812
  1037
          | (MFun (M1, a, M2), Type (@{type_name fun}, Ts)) =>
blanchet@35812
  1038
            Type (if should_finitize T a then @{type_name fin_fun}
blanchet@35812
  1039
                  else @{type_name fun}, map2 type_from_mtype Ts [M1, M2])
blanchet@38190
  1040
          | (MPair (M1, M2), Type (@{type_name prod}, Ts)) =>
blanchet@38190
  1041
            Type (@{type_name prod}, map2 type_from_mtype Ts [M1, M2])
blanchet@35812
  1042
          | (MType _, _) => T
blanchet@35812
  1043
          | _ => raise MTYPE ("Nitpick_Mono.finitize_funs.type_from_mtype",
blanchet@35812
  1044
                              [M], [T])
blanchet@35812
  1045
        fun finitize_constr (x as (s, T)) =
blanchet@35812
  1046
          (s, case AList.lookup (op =) constr_mtypes x of
blanchet@35812
  1047
                SOME M => type_from_mtype T M
blanchet@35812
  1048
              | NONE => T)
blanchet@37267
  1049
        fun term_from_mterm new_Ts old_Ts m =
blanchet@35812
  1050
          case m of
blanchet@35812
  1051
            MRaw (t, M) =>
blanchet@35812
  1052
            let
blanchet@37267
  1053
              val T = fastype_of1 (old_Ts, t)
blanchet@35812
  1054
              val T' = type_from_mtype T M
blanchet@35812
  1055
            in
blanchet@35812
  1056
              case t of
blanchet@35812
  1057
                Const (x as (s, _)) =>
blanchet@37476
  1058
                if s = @{const_name finite} then
blanchet@35812
  1059
                  case domain_type T' of
blanchet@35812
  1060
                    set_T' as Type (@{type_name fin_fun}, _) =>
blanchet@35812
  1061
                    Abs (Name.uu, set_T', @{const True})
blanchet@35812
  1062
                  | _ => Const (s, T')
blanchet@35812
  1063
                else if s = @{const_name "=="} orelse
haftmann@38864
  1064
                        s = @{const_name HOL.eq} then
blanchet@37476
  1065
                  let
blanchet@37476
  1066
                    val T =
blanchet@37476
  1067
                      case T' of
blanchet@37476
  1068
                        Type (_, [T1, Type (_, [T2, T3])]) =>
blanchet@37476
  1069
                        T1 --> T2 --> T3
blanchet@37476
  1070
                      | _ => raise TYPE ("Nitpick_Mono.finitize_funs.\
blanchet@37476
  1071
                                         \term_from_mterm", [T, T'], [])
blanchet@37476
  1072
                  in coerce_term hol_ctxt new_Ts T' T (Const (s, T)) end
blanchet@39359
  1073
                else if is_built_in_const thy stds x then
blanchet@37267
  1074
                  coerce_term hol_ctxt new_Ts T' T t
blanchet@37256
  1075
                else if is_constr ctxt stds x then
blanchet@35812
  1076
                  Const (finitize_constr x)
blanchet@35812
  1077
                else if is_sel s then
blanchet@35812
  1078
                  let
blanchet@35812
  1079
                    val n = sel_no_from_name s
blanchet@35812
  1080
                    val x' =
blanchet@35812
  1081
                      x |> binarized_and_boxed_constr_for_sel hol_ctxt binarize
blanchet@35812
  1082
                        |> finitize_constr
blanchet@35812
  1083
                    val x'' =
blanchet@35812
  1084
                      binarized_and_boxed_nth_sel_for_constr hol_ctxt binarize
blanchet@35812
  1085
                                                             x' n
blanchet@35812
  1086
                  in Const x'' end
blanchet@35812
  1087
                else
blanchet@35812
  1088
                  Const (s, T')
blanchet@35812
  1089
              | Free (s, T) => Free (s, type_from_mtype T M)
blanchet@35812
  1090
              | Bound _ => t
blanchet@35812
  1091
              | _ => raise MTERM ("Nitpick_Mono.finitize_funs.term_from_mterm",
blanchet@35812
  1092
                                  [m])
blanchet@35812
  1093
            end
blanchet@35812
  1094
          | MApp (m1, m2) =>
blanchet@35812
  1095
            let
blanchet@37267
  1096
              val (t1, t2) = pairself (term_from_mterm new_Ts old_Ts) (m1, m2)
blanchet@37267
  1097
              val (T1, T2) = pairself (curry fastype_of1 new_Ts) (t1, t2)
blanchet@35812
  1098
              val (t1', T2') =
blanchet@35812
  1099
                case T1 of
blanchet@39316
  1100
                  Type (s, [T11, T12]) =>
blanchet@35812
  1101
                  (if s = @{type_name fin_fun} then
blanchet@37256
  1102
                     select_nth_constr_arg ctxt stds (fin_fun_constr T11 T12) t1
blanchet@35812
  1103
                                           0 (T11 --> T12)
blanchet@35812
  1104
                   else
blanchet@35812
  1105
                     t1, T11)
blanchet@35812
  1106
                | _ => raise TYPE ("Nitpick_Mono.finitize_funs.term_from_mterm",
blanchet@35812
  1107
                                   [T1], [])
blanchet@37267
  1108
            in betapply (t1', coerce_term hol_ctxt new_Ts T2' T2 t2) end
blanchet@37267
  1109
          | MAbs (s, old_T, M, a, m') =>
blanchet@35812
  1110
            let
blanchet@37267
  1111
              val new_T = type_from_mtype old_T M
blanchet@37267
  1112
              val t' = term_from_mterm (new_T :: new_Ts) (old_T :: old_Ts) m'
blanchet@37267
  1113
              val T' = fastype_of1 (new_T :: new_Ts, t')
blanchet@35812
  1114
            in
blanchet@37267
  1115
              Abs (s, new_T, t')
blanchet@37267
  1116
              |> should_finitize (new_T --> T') a
blanchet@37267
  1117
                 ? construct_value ctxt stds (fin_fun_constr new_T T') o single
blanchet@35812
  1118
            end
blanchet@35812
  1119
      in
blanchet@35812
  1120
        Unsynchronized.change constr_cache (map (apsnd (map finitize_constr)));
blanchet@37267
  1121
        pairself (map (term_from_mterm [] [])) msp
blanchet@35812
  1122
      end
blanchet@35665
  1123
  | NONE => tsp
blanchet@33192
  1124
blanchet@33192
  1125
end;