src/HOL/Tools/Nitpick/nitpick_mono.ML
author blanchet
Tue Dec 07 11:56:56 2010 +0100 (2010-12-07)
changeset 41054 e58d1cdda832
parent 41052 3db267a01c1d
child 41109 97bf008b9cfe
permissions -rw-r--r--
simplify monotonicity code after killing "fin_fun" optimization
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@41001
    14
    hol_context -> bool -> typ -> term list * term list -> bool
blanchet@33192
    15
end;
blanchet@33192
    16
blanchet@33232
    17
structure Nitpick_Mono : NITPICK_MONO =
blanchet@33192
    18
struct
blanchet@33192
    19
blanchet@33232
    20
open Nitpick_Util
blanchet@33232
    21
open Nitpick_HOL
blanchet@33192
    22
blanchet@40990
    23
structure PL = PropLogic
blanchet@40990
    24
blanchet@40985
    25
datatype sign = Plus | Minus
blanchet@40985
    26
blanchet@33192
    27
type var = int
blanchet@33192
    28
blanchet@40985
    29
datatype annotation = Gen | New | Fls | Tru
blanchet@40985
    30
datatype annotation_atom = A of annotation | V of var
blanchet@33192
    31
blanchet@40996
    32
type assign_literal = var * (sign * annotation)
blanchet@33192
    33
blanchet@35385
    34
datatype mtyp =
blanchet@35385
    35
  MAlpha |
blanchet@40985
    36
  MFun of mtyp * annotation_atom * mtyp |
blanchet@35385
    37
  MPair of mtyp * mtyp |
blanchet@35385
    38
  MType of string * mtyp list |
blanchet@35385
    39
  MRec of string * typ list
blanchet@33192
    40
blanchet@35385
    41
type mdata =
blanchet@35070
    42
  {hol_ctxt: hol_context,
blanchet@35190
    43
   binarize: bool,
blanchet@33192
    44
   alpha_T: typ,
blanchet@33192
    45
   max_fresh: int Unsynchronized.ref,
blanchet@35665
    46
   datatype_mcache: ((string * typ list) * mtyp) list Unsynchronized.ref,
blanchet@35665
    47
   constr_mcache: (styp * mtyp) list Unsynchronized.ref}
blanchet@33192
    48
blanchet@35812
    49
exception UNSOLVABLE of unit
blanchet@35665
    50
exception MTYPE of string * mtyp list * typ list
blanchet@33192
    51
blanchet@38179
    52
val trace = Unsynchronized.ref false
blanchet@38179
    53
fun trace_msg msg = if !trace then tracing (msg ()) else ()
blanchet@33192
    54
blanchet@40985
    55
fun string_for_sign Plus = "+"
blanchet@40985
    56
  | string_for_sign Minus = "-"
blanchet@40985
    57
blanchet@40985
    58
fun negate_sign Plus = Minus
blanchet@40985
    59
  | negate_sign Minus = Plus
blanchet@40985
    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@40985
    67
fun string_for_annotation Gen = "G"
blanchet@40985
    68
  | string_for_annotation New = "N"
blanchet@40985
    69
  | string_for_annotation Fls = "F"
blanchet@40985
    70
  | string_for_annotation Tru = "T"
blanchet@33192
    71
blanchet@40985
    72
fun string_for_annotation_atom (A a) = string_for_annotation a
blanchet@40985
    73
  | string_for_annotation_atom (V x) = string_for_var x
blanchet@33192
    74
blanchet@40996
    75
fun string_for_assign_literal (x, (sn, a)) =
blanchet@40996
    76
  string_for_var x ^ (case sn of Plus => " = " | Minus => " \<noteq> ") ^
blanchet@40996
    77
  string_for_annotation a
blanchet@33192
    78
blanchet@35385
    79
val bool_M = MType (@{type_name bool}, [])
blanchet@35386
    80
val dummy_M = MType (nitpick_prefix ^ "dummy", [])
blanchet@33192
    81
blanchet@35385
    82
fun is_MRec (MRec _) = true
blanchet@35385
    83
  | is_MRec _ = false
blanchet@35385
    84
fun dest_MFun (MFun z) = z
blanchet@35665
    85
  | dest_MFun M = raise MTYPE ("Nitpick_Mono.dest_MFun", [M], [])
blanchet@33192
    86
blanchet@33192
    87
val no_prec = 100
blanchet@33192
    88
blanchet@35385
    89
fun precedence_of_mtype (MFun _) = 1
blanchet@35385
    90
  | precedence_of_mtype (MPair _) = 2
blanchet@35385
    91
  | precedence_of_mtype _ = no_prec
blanchet@33192
    92
blanchet@35385
    93
val string_for_mtype =
blanchet@33192
    94
  let
blanchet@35385
    95
    fun aux outer_prec M =
blanchet@33192
    96
      let
blanchet@35385
    97
        val prec = precedence_of_mtype M
blanchet@33192
    98
        val need_parens = (prec < outer_prec)
blanchet@33192
    99
      in
blanchet@33192
   100
        (if need_parens then "(" else "") ^
blanchet@35386
   101
        (if M = dummy_M then
blanchet@35386
   102
           "_"
blanchet@35386
   103
         else case M of
blanchet@35386
   104
             MAlpha => "\<alpha>"
blanchet@40988
   105
           | MFun (M1, aa, M2) =>
blanchet@35386
   106
             aux (prec + 1) M1 ^ " \<Rightarrow>\<^bsup>" ^
blanchet@40988
   107
             string_for_annotation_atom aa ^ "\<^esup> " ^ aux prec M2
blanchet@35386
   108
           | MPair (M1, M2) => aux (prec + 1) M1 ^ " \<times> " ^ aux prec M2
blanchet@35386
   109
           | MType (s, []) =>
blanchet@35386
   110
             if s = @{type_name prop} orelse s = @{type_name bool} then "o"
blanchet@35386
   111
             else s
blanchet@35386
   112
           | MType (s, Ms) => "(" ^ commas (map (aux 0) Ms) ^ ") " ^ s
blanchet@35386
   113
           | MRec (s, _) => "[" ^ s ^ "]") ^
blanchet@33192
   114
        (if need_parens then ")" else "")
blanchet@33192
   115
      end
blanchet@33192
   116
  in aux 0 end
blanchet@33192
   117
blanchet@35385
   118
fun flatten_mtype (MPair (M1, M2)) = maps flatten_mtype [M1, M2]
blanchet@35385
   119
  | flatten_mtype (MType (_, Ms)) = maps flatten_mtype Ms
blanchet@35385
   120
  | flatten_mtype M = [M]
blanchet@35385
   121
blanchet@41054
   122
fun initial_mdata hol_ctxt binarize alpha_T =
blanchet@35190
   123
  ({hol_ctxt = hol_ctxt, binarize = binarize, alpha_T = alpha_T,
blanchet@41054
   124
    max_fresh = Unsynchronized.ref 0, datatype_mcache = Unsynchronized.ref [],
blanchet@35665
   125
    constr_mcache = Unsynchronized.ref []} : mdata)
blanchet@33192
   126
blanchet@33192
   127
fun could_exist_alpha_subtype alpha_T (T as Type (_, Ts)) =
blanchet@34936
   128
    T = alpha_T orelse (not (is_fp_iterator_type T) andalso
blanchet@34936
   129
                        exists (could_exist_alpha_subtype alpha_T) Ts)
blanchet@33192
   130
  | could_exist_alpha_subtype alpha_T T = (T = alpha_T)
blanchet@35385
   131
fun could_exist_alpha_sub_mtype _ (alpha_T as TFree _) T =
blanchet@34121
   132
    could_exist_alpha_subtype alpha_T T
blanchet@37256
   133
  | could_exist_alpha_sub_mtype ctxt alpha_T T =
blanchet@37256
   134
    (T = alpha_T orelse is_datatype ctxt [(NONE, true)] T)
blanchet@33192
   135
blanchet@35385
   136
fun exists_alpha_sub_mtype MAlpha = true
blanchet@35385
   137
  | exists_alpha_sub_mtype (MFun (M1, _, M2)) =
blanchet@35385
   138
    exists exists_alpha_sub_mtype [M1, M2]
blanchet@35385
   139
  | exists_alpha_sub_mtype (MPair (M1, M2)) =
blanchet@35385
   140
    exists exists_alpha_sub_mtype [M1, M2]
blanchet@35385
   141
  | exists_alpha_sub_mtype (MType (_, Ms)) = exists exists_alpha_sub_mtype Ms
blanchet@35385
   142
  | exists_alpha_sub_mtype (MRec _) = true
blanchet@33192
   143
blanchet@35385
   144
fun exists_alpha_sub_mtype_fresh MAlpha = true
blanchet@35385
   145
  | exists_alpha_sub_mtype_fresh (MFun (_, V _, _)) = true
blanchet@35385
   146
  | exists_alpha_sub_mtype_fresh (MFun (_, _, M2)) =
blanchet@35385
   147
    exists_alpha_sub_mtype_fresh M2
blanchet@35385
   148
  | exists_alpha_sub_mtype_fresh (MPair (M1, M2)) =
blanchet@35385
   149
    exists exists_alpha_sub_mtype_fresh [M1, M2]
blanchet@35385
   150
  | exists_alpha_sub_mtype_fresh (MType (_, Ms)) =
blanchet@35385
   151
    exists exists_alpha_sub_mtype_fresh Ms
blanchet@35385
   152
  | exists_alpha_sub_mtype_fresh (MRec _) = true
blanchet@33192
   153
blanchet@35385
   154
fun constr_mtype_for_binders z Ms =
blanchet@40985
   155
  fold_rev (fn M => curry3 MFun M (A Gen)) Ms (MRec z)
blanchet@33192
   156
blanchet@35385
   157
fun repair_mtype _ _ MAlpha = MAlpha
blanchet@40988
   158
  | repair_mtype cache seen (MFun (M1, aa, M2)) =
blanchet@40988
   159
    MFun (repair_mtype cache seen M1, aa, repair_mtype cache seen M2)
blanchet@35385
   160
  | repair_mtype cache seen (MPair Mp) =
blanchet@35385
   161
    MPair (pairself (repair_mtype cache seen) Mp)
blanchet@35385
   162
  | repair_mtype cache seen (MType (s, Ms)) =
blanchet@35385
   163
    MType (s, maps (flatten_mtype o repair_mtype cache seen) Ms)
blanchet@35385
   164
  | repair_mtype cache seen (MRec (z as (s, _))) =
blanchet@33192
   165
    case AList.lookup (op =) cache z |> the of
blanchet@35385
   166
      MRec _ => MType (s, [])
blanchet@35385
   167
    | M => if member (op =) seen M then MType (s, [])
blanchet@35385
   168
           else repair_mtype cache (M :: seen) M
blanchet@33192
   169
blanchet@35665
   170
fun repair_datatype_mcache cache =
blanchet@33192
   171
  let
blanchet@35385
   172
    fun repair_one (z, M) =
blanchet@33192
   173
      Unsynchronized.change cache
blanchet@35385
   174
          (AList.update (op =) (z, repair_mtype (!cache) [] M))
blanchet@33192
   175
  in List.app repair_one (rev (!cache)) end
blanchet@33192
   176
blanchet@35665
   177
fun repair_constr_mcache dtype_cache constr_mcache =
blanchet@33192
   178
  let
blanchet@35385
   179
    fun repair_one (x, M) =
blanchet@35665
   180
      Unsynchronized.change constr_mcache
blanchet@35385
   181
          (AList.update (op =) (x, repair_mtype dtype_cache [] M))
blanchet@35665
   182
  in List.app repair_one (!constr_mcache) end
blanchet@35665
   183
blanchet@35665
   184
fun is_fin_fun_supported_type @{typ prop} = true
blanchet@35665
   185
  | is_fin_fun_supported_type @{typ bool} = true
blanchet@35665
   186
  | is_fin_fun_supported_type (Type (@{type_name option}, _)) = true
blanchet@35665
   187
  | is_fin_fun_supported_type _ = false
blanchet@41009
   188
blanchet@41009
   189
(* TODO: clean this up *)
blanchet@35665
   190
fun fin_fun_body _ _ (t as @{term False}) = SOME t
blanchet@35665
   191
  | fin_fun_body _ _ (t as Const (@{const_name None}, _)) = SOME t
blanchet@35665
   192
  | fin_fun_body dom_T ran_T
blanchet@35665
   193
                 ((t0 as Const (@{const_name If}, _))
haftmann@38864
   194
                  $ (t1 as Const (@{const_name HOL.eq}, _) $ Bound 0 $ t1')
blanchet@35665
   195
                  $ t2 $ t3) =
blanchet@35665
   196
    (if loose_bvar1 (t1', 0) then
blanchet@35665
   197
       NONE
blanchet@35665
   198
     else case fin_fun_body dom_T ran_T t3 of
blanchet@35665
   199
       NONE => NONE
blanchet@35665
   200
     | SOME t3 =>
blanchet@35665
   201
       SOME (t0 $ (Const (@{const_name is_unknown}, dom_T --> bool_T) $ t1')
blanchet@35665
   202
                $ (Const (@{const_name unknown}, ran_T)) $ (t0 $ t1 $ t2 $ t3)))
blanchet@35665
   203
  | fin_fun_body _ _ _ = NONE
blanchet@33192
   204
blanchet@41054
   205
(* FIXME: make sure well-annotated *)
blanchet@40998
   206
blanchet@35672
   207
fun fresh_mfun_for_fun_type (mdata as {max_fresh, ...} : mdata) all_minus
blanchet@35672
   208
                            T1 T2 =
blanchet@33192
   209
  let
blanchet@35672
   210
    val M1 = fresh_mtype_for_type mdata all_minus T1
blanchet@35672
   211
    val M2 = fresh_mtype_for_type mdata all_minus T2
blanchet@40988
   212
    val aa = if not all_minus andalso exists_alpha_sub_mtype_fresh M1 andalso
blanchet@40988
   213
                is_fin_fun_supported_type (body_type T2) then
blanchet@40988
   214
               V (Unsynchronized.inc max_fresh)
blanchet@40988
   215
             else
blanchet@40988
   216
               A Gen
blanchet@40988
   217
  in (M1, aa, M2) end
blanchet@37256
   218
and fresh_mtype_for_type (mdata as {hol_ctxt as {ctxt, ...}, binarize, alpha_T,
blanchet@35672
   219
                                    datatype_mcache, constr_mcache, ...})
blanchet@35672
   220
                         all_minus =
blanchet@35385
   221
  let
blanchet@35385
   222
    fun do_type T =
blanchet@33192
   223
      if T = alpha_T then
blanchet@35385
   224
        MAlpha
blanchet@33192
   225
      else case T of
blanchet@35665
   226
        Type (@{type_name fun}, [T1, T2]) =>
blanchet@39342
   227
        MFun (fresh_mfun_for_fun_type mdata all_minus T1 T2)
blanchet@38190
   228
      | Type (@{type_name prod}, [T1, T2]) => MPair (pairself do_type (T1, T2))
blanchet@33192
   229
      | Type (z as (s, _)) =>
blanchet@37256
   230
        if could_exist_alpha_sub_mtype ctxt alpha_T T then
blanchet@35665
   231
          case AList.lookup (op =) (!datatype_mcache) z of
blanchet@35385
   232
            SOME M => M
blanchet@33192
   233
          | NONE =>
blanchet@33192
   234
            let
blanchet@35665
   235
              val _ = Unsynchronized.change datatype_mcache (cons (z, MRec z))
blanchet@35219
   236
              val xs = binarized_and_boxed_datatype_constrs hol_ctxt binarize T
blanchet@35385
   237
              val (all_Ms, constr_Ms) =
blanchet@35385
   238
                fold_rev (fn (_, T') => fn (all_Ms, constr_Ms) =>
blanchet@33192
   239
                             let
blanchet@35385
   240
                               val binder_Ms = map do_type (binder_types T')
blanchet@35385
   241
                               val new_Ms = filter exists_alpha_sub_mtype_fresh
blanchet@35385
   242
                                                   binder_Ms
blanchet@35385
   243
                               val constr_M = constr_mtype_for_binders z
blanchet@35385
   244
                                                                       binder_Ms
blanchet@33192
   245
                             in
blanchet@35385
   246
                               (union (op =) new_Ms all_Ms,
blanchet@35385
   247
                                constr_M :: constr_Ms)
blanchet@33192
   248
                             end)
blanchet@33192
   249
                         xs ([], [])
blanchet@35385
   250
              val M = MType (s, all_Ms)
blanchet@35665
   251
              val _ = Unsynchronized.change datatype_mcache
blanchet@35385
   252
                          (AList.update (op =) (z, M))
blanchet@35665
   253
              val _ = Unsynchronized.change constr_mcache
blanchet@35385
   254
                          (append (xs ~~ constr_Ms))
blanchet@33192
   255
            in
blanchet@35665
   256
              if forall (not o is_MRec o snd) (!datatype_mcache) then
blanchet@35665
   257
                (repair_datatype_mcache datatype_mcache;
blanchet@35665
   258
                 repair_constr_mcache (!datatype_mcache) constr_mcache;
blanchet@35665
   259
                 AList.lookup (op =) (!datatype_mcache) z |> the)
blanchet@33192
   260
              else
blanchet@35385
   261
                M
blanchet@33192
   262
            end
blanchet@33192
   263
        else
blanchet@35385
   264
          MType (s, [])
blanchet@37260
   265
      | _ => MType (simple_string_of_typ T, [])
blanchet@33192
   266
  in do_type end
blanchet@33192
   267
blanchet@41054
   268
val ground_and_sole_base_constrs = []
blanchet@41054
   269
(* FIXME: [@{const_name Nil}, @{const_name None}], cf. lists_empty *)
blanchet@41009
   270
blanchet@35385
   271
fun prodM_factors (MPair (M1, M2)) = maps prodM_factors [M1, M2]
blanchet@35385
   272
  | prodM_factors M = [M]
blanchet@35665
   273
fun curried_strip_mtype (MFun (M1, _, M2)) =
blanchet@35385
   274
    curried_strip_mtype M2 |>> append (prodM_factors M1)
blanchet@35385
   275
  | curried_strip_mtype M = ([], M)
blanchet@35385
   276
fun sel_mtype_from_constr_mtype s M =
blanchet@41009
   277
  let
blanchet@41009
   278
    val (arg_Ms, dataM) = curried_strip_mtype M
blanchet@41009
   279
    val a = if member (op =) ground_and_sole_base_constrs
blanchet@41009
   280
                             (constr_name_for_sel_like s) then
blanchet@41009
   281
              Fls
blanchet@41009
   282
            else
blanchet@41009
   283
              Gen
blanchet@41009
   284
  in
blanchet@41009
   285
    MFun (dataM, A a,
blanchet@35385
   286
          case sel_no_from_name s of ~1 => bool_M | n => nth arg_Ms n)
blanchet@33192
   287
  end
blanchet@33192
   288
blanchet@37256
   289
fun mtype_for_constr (mdata as {hol_ctxt = {ctxt, ...}, alpha_T, constr_mcache,
blanchet@33192
   290
                                ...}) (x as (_, T)) =
blanchet@37256
   291
  if could_exist_alpha_sub_mtype ctxt alpha_T T then
blanchet@35665
   292
    case AList.lookup (op =) (!constr_mcache) x of
blanchet@35385
   293
      SOME M => M
blanchet@35384
   294
    | NONE => if T = alpha_T then
blanchet@35672
   295
                let val M = fresh_mtype_for_type mdata false T in
blanchet@35665
   296
                  (Unsynchronized.change constr_mcache (cons (x, M)); M)
blanchet@35384
   297
                end
blanchet@35384
   298
              else
blanchet@35672
   299
                (fresh_mtype_for_type mdata false (body_type T);
blanchet@35665
   300
                 AList.lookup (op =) (!constr_mcache) x |> the)
blanchet@33192
   301
  else
blanchet@35672
   302
    fresh_mtype_for_type mdata false T
blanchet@35385
   303
fun mtype_for_sel (mdata as {hol_ctxt, binarize, ...}) (x as (s, _)) =
blanchet@35190
   304
  x |> binarized_and_boxed_constr_for_sel hol_ctxt binarize
blanchet@35385
   305
    |> mtype_for_constr mdata |> sel_mtype_from_constr_mtype s
blanchet@33192
   306
blanchet@40989
   307
fun resolve_annotation_atom asgs (V x) =
blanchet@40989
   308
    x |> AList.lookup (op =) asgs |> Option.map A |> the_default (V x)
blanchet@40988
   309
  | resolve_annotation_atom _ aa = aa
blanchet@40989
   310
fun resolve_mtype asgs =
blanchet@33192
   311
  let
blanchet@35385
   312
    fun aux MAlpha = MAlpha
blanchet@40988
   313
      | aux (MFun (M1, aa, M2)) =
blanchet@40989
   314
        MFun (aux M1, resolve_annotation_atom asgs aa, aux M2)
blanchet@35385
   315
      | aux (MPair Mp) = MPair (pairself aux Mp)
blanchet@35385
   316
      | aux (MType (s, Ms)) = MType (s, map aux Ms)
blanchet@35385
   317
      | aux (MRec z) = MRec z
blanchet@33192
   318
  in aux end
blanchet@33192
   319
blanchet@40996
   320
datatype comp_op = Eq | Neq | Leq
blanchet@33192
   321
blanchet@40985
   322
type comp = annotation_atom * annotation_atom * comp_op * var list
blanchet@40995
   323
type assign_clause = assign_literal list
blanchet@33192
   324
blanchet@40994
   325
type constraint_set = comp list * assign_clause list
blanchet@33192
   326
blanchet@33192
   327
fun string_for_comp_op Eq = "="
blanchet@40996
   328
  | string_for_comp_op Neq = "\<noteq>"
blanchet@33192
   329
  | string_for_comp_op Leq = "\<le>"
blanchet@33192
   330
blanchet@40990
   331
fun string_for_comp (aa1, aa2, cmp, xs) =
blanchet@40990
   332
  string_for_annotation_atom aa1 ^ " " ^ string_for_comp_op cmp ^
blanchet@40990
   333
  subscript_string_for_vars " \<and> " xs ^ " " ^ string_for_annotation_atom aa2
blanchet@33192
   334
blanchet@40999
   335
fun string_for_assign_clause NONE = "\<top>"
blanchet@40999
   336
  | string_for_assign_clause (SOME []) = "\<bot>"
blanchet@40999
   337
  | string_for_assign_clause (SOME asgs) =
blanchet@40995
   338
    space_implode " \<or> " (map string_for_assign_literal asgs)
blanchet@40990
   339
blanchet@40996
   340
fun add_assign_literal (x, (sn, a)) clauses =
blanchet@40996
   341
  if exists (fn [(x', (sn', a'))] =>
blanchet@40996
   342
                x = x' andalso ((sn = sn' andalso a <> a') orelse
blanchet@40996
   343
                                (sn <> sn' andalso a = a'))
blanchet@40996
   344
              | _ => false) clauses then
blanchet@40994
   345
    NONE
blanchet@40994
   346
  else
blanchet@41017
   347
    SOME ([(x, (sn, a))] :: clauses)
blanchet@33192
   348
blanchet@40991
   349
fun add_assign_disjunct _ NONE = NONE
blanchet@40991
   350
  | add_assign_disjunct asg (SOME asgs) = SOME (insert (op =) asg asgs)
blanchet@40991
   351
blanchet@40999
   352
fun add_assign_clause NONE = I
blanchet@40999
   353
  | add_assign_clause (SOME clause) = insert (op =) clause
blanchet@40997
   354
blanchet@40996
   355
fun annotation_comp Eq a1 a2 = (a1 = a2)
blanchet@40996
   356
  | annotation_comp Neq a1 a2 = (a1 <> a2)
blanchet@40996
   357
  | annotation_comp Leq a1 a2 = (a1 = a2 orelse a2 = Gen)
blanchet@40996
   358
blanchet@40997
   359
fun sign_for_comp_op Eq = Plus
blanchet@40997
   360
  | sign_for_comp_op Neq = Minus
blanchet@40997
   361
  | sign_for_comp_op Leq = raise BAD ("sign_for_comp_op", "unexpected \"Leq\"")
blanchet@40996
   362
blanchet@40996
   363
fun do_annotation_atom_comp Leq [] aa1 aa2 (cset as (comps, clauses)) =
blanchet@40988
   364
    (case (aa1, aa2) of
blanchet@40996
   365
       (A a1, A a2) => if annotation_comp Leq a1 a2 then SOME cset else NONE
blanchet@40996
   366
     | _ => SOME (insert (op =) (aa1, aa2, Leq, []) comps, clauses))
blanchet@40996
   367
  | do_annotation_atom_comp cmp [] aa1 aa2 (cset as (comps, clauses)) =
blanchet@40996
   368
    (case (aa1, aa2) of
blanchet@40996
   369
       (A a1, A a2) => if annotation_comp cmp a1 a2 then SOME cset else NONE
blanchet@40988
   370
     | (V x1, A a2) =>
blanchet@40997
   371
       clauses |> add_assign_literal (x1, (sign_for_comp_op cmp, a2))
blanchet@40996
   372
               |> Option.map (pair comps)
blanchet@40996
   373
     | (A _, V _) => do_annotation_atom_comp cmp [] aa2 aa1 cset
blanchet@40996
   374
     | (V _, V _) => SOME (insert (op =) (aa1, aa2, cmp, []) comps, clauses))
blanchet@40994
   375
  | do_annotation_atom_comp cmp xs aa1 aa2 (comps, clauses) =
blanchet@40994
   376
    SOME (insert (op =) (aa1, aa2, cmp, xs) comps, clauses)
blanchet@33192
   377
blanchet@40997
   378
fun add_annotation_atom_comp cmp xs aa1 aa2 (comps, clauses) =
blanchet@40998
   379
  (trace_msg (fn () => "*** Add " ^ string_for_comp (aa1, aa2, cmp, xs));
blanchet@40994
   380
   case do_annotation_atom_comp cmp xs aa1 aa2 (comps, clauses) of
blanchet@40993
   381
     NONE => (trace_msg (K "**** Unsolvable"); raise UNSOLVABLE ())
blanchet@40994
   382
   | SOME cset => cset)
blanchet@40993
   383
blanchet@35385
   384
fun do_mtype_comp _ _ _ _ NONE = NONE
blanchet@40994
   385
  | do_mtype_comp _ _ MAlpha MAlpha cset = cset
blanchet@40988
   386
  | do_mtype_comp Eq xs (MFun (M11, aa1, M12)) (MFun (M21, aa2, M22))
blanchet@40994
   387
                  (SOME cset) =
blanchet@40994
   388
    cset |> do_annotation_atom_comp Eq xs aa1 aa2
blanchet@40994
   389
         |> do_mtype_comp Eq xs M11 M21 |> do_mtype_comp Eq xs M12 M22
blanchet@40988
   390
  | do_mtype_comp Leq xs (MFun (M11, aa1, M12)) (MFun (M21, aa2, M22))
blanchet@40994
   391
                  (SOME cset) =
blanchet@35385
   392
    (if exists_alpha_sub_mtype M11 then
blanchet@40994
   393
       cset |> do_annotation_atom_comp Leq xs aa1 aa2
blanchet@40994
   394
            |> do_mtype_comp Leq xs M21 M11
blanchet@40994
   395
            |> (case aa2 of
blanchet@40994
   396
                  A Gen => I
blanchet@40994
   397
                | A _ => do_mtype_comp Leq xs M11 M21
blanchet@40994
   398
                | V x => do_mtype_comp Leq (x :: xs) M11 M21)
blanchet@33192
   399
     else
blanchet@40994
   400
       SOME cset)
blanchet@35385
   401
    |> do_mtype_comp Leq xs M12 M22
blanchet@35385
   402
  | do_mtype_comp cmp xs (M1 as MPair (M11, M12)) (M2 as MPair (M21, M22))
blanchet@40994
   403
                  cset =
blanchet@40994
   404
    (cset |> fold (uncurry (do_mtype_comp cmp xs)) [(M11, M21), (M12, M22)]
blanchet@41017
   405
     handle ListPair.UnequalLengths =>
blanchet@35665
   406
            raise MTYPE ("Nitpick_Mono.do_mtype_comp", [M1, M2], []))
blanchet@40994
   407
  | do_mtype_comp _ _ (MType _) (MType _) cset =
blanchet@40994
   408
    cset (* no need to compare them thanks to the cache *)
blanchet@35665
   409
  | do_mtype_comp cmp _ M1 M2 _ =
blanchet@35665
   410
    raise MTYPE ("Nitpick_Mono.do_mtype_comp (" ^ string_for_comp_op cmp ^ ")",
blanchet@35665
   411
                 [M1, M2], [])
blanchet@33192
   412
blanchet@40994
   413
fun add_mtype_comp cmp M1 M2 cset =
blanchet@40991
   414
  (trace_msg (fn () => "*** Add " ^ string_for_mtype M1 ^ " " ^
blanchet@40991
   415
                       string_for_comp_op cmp ^ " " ^ string_for_mtype M2);
blanchet@40994
   416
   case SOME cset |> do_mtype_comp cmp [] M1 M2 of
blanchet@40991
   417
     NONE => (trace_msg (K "**** Unsolvable"); raise UNSOLVABLE ())
blanchet@40994
   418
   | SOME cset => cset)
blanchet@33192
   419
blanchet@35385
   420
val add_mtypes_equal = add_mtype_comp Eq
blanchet@35385
   421
val add_is_sub_mtype = add_mtype_comp Leq
blanchet@33192
   422
blanchet@35385
   423
fun do_notin_mtype_fv _ _ _ NONE = NONE
blanchet@40994
   424
  | do_notin_mtype_fv Minus _ MAlpha cset = cset
blanchet@35385
   425
  | do_notin_mtype_fv Plus [] MAlpha _ = NONE
blanchet@40996
   426
  | do_notin_mtype_fv Plus [asg] MAlpha (SOME clauses) =
blanchet@40996
   427
    clauses |> add_assign_literal asg
blanchet@41000
   428
  | do_notin_mtype_fv Plus unless MAlpha (SOME clauses) =
blanchet@41000
   429
    SOME (insert (op =) unless clauses)
blanchet@41000
   430
  | do_notin_mtype_fv sn unless (MFun (M1, A a, M2)) cset =
blanchet@41000
   431
    cset |> (if a <> Gen andalso sn = Plus then do_notin_mtype_fv Plus unless M1
blanchet@40994
   432
             else I)
blanchet@41000
   433
         |> (if a = Gen orelse sn = Plus then do_notin_mtype_fv Minus unless M1
blanchet@40994
   434
             else I)
blanchet@41000
   435
         |> do_notin_mtype_fv sn unless M2
blanchet@41000
   436
  | do_notin_mtype_fv Plus unless (MFun (M1, V x, M2)) cset =
blanchet@41000
   437
    cset |> (case add_assign_disjunct (x, (Plus, Gen)) (SOME unless) of
blanchet@40994
   438
               NONE => I
blanchet@41000
   439
             | SOME unless' => do_notin_mtype_fv Plus unless' M1)
blanchet@41000
   440
         |> do_notin_mtype_fv Minus unless M1
blanchet@41000
   441
         |> do_notin_mtype_fv Plus unless M2
blanchet@41000
   442
  | do_notin_mtype_fv Minus unless (MFun (M1, V x, M2)) cset =
blanchet@40996
   443
    cset |> (case fold (fn a => add_assign_disjunct (x, (Plus, a))) [Fls, Tru]
blanchet@41000
   444
                       (SOME unless) of
blanchet@40994
   445
               NONE => I
blanchet@41000
   446
             | SOME unless' => do_notin_mtype_fv Plus unless' M1)
blanchet@41000
   447
         |> do_notin_mtype_fv Minus unless M2
blanchet@41000
   448
  | do_notin_mtype_fv sn unless (MPair (M1, M2)) cset =
blanchet@41000
   449
    cset |> fold (do_notin_mtype_fv sn unless) [M1, M2]
blanchet@41000
   450
  | do_notin_mtype_fv sn unless (MType (_, Ms)) cset =
blanchet@41000
   451
    cset |> fold (do_notin_mtype_fv sn unless) Ms
blanchet@40994
   452
 | do_notin_mtype_fv _ _ M _ =
blanchet@40994
   453
   raise MTYPE ("Nitpick_Mono.do_notin_mtype_fv", [M], [])
blanchet@33192
   454
blanchet@41000
   455
fun add_notin_mtype_fv sn unless M (comps, clauses) =
blanchet@40985
   456
  (trace_msg (fn () => "*** Add " ^ string_for_mtype M ^ " is " ^
blanchet@40985
   457
                       (case sn of Minus => "concrete" | Plus => "complete"));
blanchet@41000
   458
   case SOME clauses |> do_notin_mtype_fv sn unless M of
blanchet@40985
   459
     NONE => (trace_msg (K "**** Unsolvable"); raise UNSOLVABLE ())
blanchet@40994
   460
   | SOME clauses => (comps, clauses))
blanchet@33192
   461
blanchet@35665
   462
val add_mtype_is_concrete = add_notin_mtype_fv Minus
blanchet@35665
   463
val add_mtype_is_complete = add_notin_mtype_fv Plus
blanchet@33192
   464
blanchet@40986
   465
val bool_table =
blanchet@40986
   466
  [(Gen, (false, false)),
blanchet@40986
   467
   (New, (false, true)),
blanchet@40986
   468
   (Fls, (true, false)),
blanchet@40986
   469
   (Tru, (true, true))]
blanchet@40986
   470
blanchet@40993
   471
fun fst_var n = 2 * n
blanchet@40993
   472
fun snd_var n = 2 * n + 1
blanchet@40993
   473
blanchet@40986
   474
val bools_from_annotation = AList.lookup (op =) bool_table #> the
blanchet@40986
   475
val annotation_from_bools = AList.find (op =) bool_table #> the_single
blanchet@33192
   476
blanchet@40990
   477
fun prop_for_bool b = if b then PL.True else PL.False
blanchet@40990
   478
fun prop_for_bool_var_equality (v1, v2) =
blanchet@40999
   479
  PL.SAnd (PL.SOr (PL.BoolVar v1, PL.SNot (PL.BoolVar v2)),
blanchet@40999
   480
           PL.SOr (PL.SNot (PL.BoolVar v1), PL.BoolVar v2))
blanchet@40996
   481
fun prop_for_assign (x, a) =
blanchet@40986
   482
  let val (b1, b2) = bools_from_annotation a in
blanchet@40999
   483
    PL.SAnd (PL.BoolVar (fst_var x) |> not b1 ? PL.SNot,
blanchet@40999
   484
             PL.BoolVar (snd_var x) |> not b2 ? PL.SNot)
blanchet@40986
   485
  end
blanchet@40996
   486
fun prop_for_assign_literal (x, (Plus, a)) = prop_for_assign (x, a)
blanchet@40999
   487
  | prop_for_assign_literal (x, (Minus, a)) = PL.SNot (prop_for_assign (x, a))
blanchet@40990
   488
fun prop_for_atom_assign (A a', a) = prop_for_bool (a = a')
blanchet@40996
   489
  | prop_for_atom_assign (V x, a) = prop_for_assign_literal (x, (Plus, a))
blanchet@40990
   490
fun prop_for_atom_equality (aa1, A a2) = prop_for_atom_assign (aa1, a2)
blanchet@40990
   491
  | prop_for_atom_equality (A a1, aa2) = prop_for_atom_assign (aa2, a1)
blanchet@40990
   492
  | prop_for_atom_equality (V x1, V x2) =
blanchet@40999
   493
    PL.SAnd (prop_for_bool_var_equality (pairself fst_var (x1, x2)),
blanchet@40999
   494
             prop_for_bool_var_equality (pairself snd_var (x1, x2)))
blanchet@40995
   495
val prop_for_assign_clause = PL.exists o map prop_for_assign_literal
blanchet@40995
   496
fun prop_for_exists_var_assign_literal xs a =
blanchet@40996
   497
  PL.exists (map (fn x => prop_for_assign_literal (x, (Plus, a))) xs)
blanchet@40988
   498
fun prop_for_comp (aa1, aa2, Eq, []) =
blanchet@40990
   499
    PL.SAnd (prop_for_comp (aa1, aa2, Leq, []),
blanchet@40990
   500
             prop_for_comp (aa2, aa1, Leq, []))
blanchet@40996
   501
  | prop_for_comp (aa1, aa2, Neq, []) =
blanchet@40999
   502
    PL.SNot (prop_for_comp (aa1, aa2, Eq, []))
blanchet@40988
   503
  | prop_for_comp (aa1, aa2, Leq, []) =
blanchet@40990
   504
    PL.SOr (prop_for_atom_equality (aa1, aa2), prop_for_atom_assign (aa2, Gen))
blanchet@40988
   505
  | prop_for_comp (aa1, aa2, cmp, xs) =
blanchet@40995
   506
    PL.SOr (prop_for_exists_var_assign_literal xs Gen,
blanchet@40990
   507
            prop_for_comp (aa1, aa2, cmp, []))
blanchet@33192
   508
blanchet@40990
   509
fun extract_assigns max_var assigns asgs =
blanchet@33192
   510
  fold (fn x => fn accum =>
blanchet@40989
   511
           if AList.defined (op =) asgs x then
blanchet@33192
   512
             accum
blanchet@40986
   513
           else case (fst_var x, snd_var x) |> pairself assigns of
blanchet@40986
   514
             (NONE, NONE) => accum
blanchet@40993
   515
           | bp => (x, annotation_from_bools (pairself (the_default false) bp))
blanchet@40993
   516
                   :: accum)
blanchet@40989
   517
       (max_var downto 1) asgs
blanchet@33192
   518
blanchet@41001
   519
fun print_problem comps clauses =
blanchet@41001
   520
  trace_msg (fn () => "*** Problem:\n" ^
blanchet@41001
   521
                      cat_lines (map string_for_comp comps @
blanchet@41001
   522
                                 map (string_for_assign_clause o SOME) clauses))
blanchet@33192
   523
blanchet@40989
   524
fun print_solution asgs =
blanchet@40989
   525
  trace_msg (fn () => "*** Solution:\n" ^
blanchet@40989
   526
      (asgs
blanchet@40989
   527
       |> map swap
blanchet@40989
   528
       |> AList.group (op =)
blanchet@40989
   529
       |> map (fn (a, xs) => string_for_annotation a ^ ": " ^
blanchet@41005
   530
                             string_for_vars ", " (sort int_ord xs))
blanchet@40989
   531
       |> space_implode "\n"))
blanchet@33192
   532
blanchet@41007
   533
(* The ML solver timeout should correspond more or less to the overhead of
blanchet@41007
   534
   invoking an external prover. *)
blanchet@41007
   535
val ml_solver_timeout = SOME (seconds 0.02)
blanchet@41007
   536
blanchet@41007
   537
fun solve tac_timeout max_var (comps, clauses) =
blanchet@40146
   538
  let
blanchet@41013
   539
    val asgs =
blanchet@41013
   540
      map_filter (fn [(x, (Plus, a))] => SOME (x, a) | _ => NONE) clauses
blanchet@40146
   541
    fun do_assigns assigns =
blanchet@40990
   542
      SOME (extract_assigns max_var assigns asgs |> tap print_solution)
blanchet@41001
   543
    val _ = print_problem comps clauses
blanchet@40993
   544
    val prop =
blanchet@41001
   545
      PL.all (map prop_for_comp comps @ map prop_for_assign_clause clauses)
blanchet@40146
   546
  in
blanchet@40990
   547
    if PL.eval (K false) prop then
blanchet@40990
   548
      do_assigns (K (SOME false))
blanchet@40990
   549
    else if PL.eval (K true) prop then
blanchet@40990
   550
      do_assigns (K (SOME true))
blanchet@40146
   551
    else
blanchet@40146
   552
      let
blanchet@40146
   553
        (* use the first ML solver (to avoid startup overhead) *)
blanchet@41007
   554
        val (ml_solvers, nonml_solvers) =
blanchet@41007
   555
          !SatSolver.solvers
blanchet@41007
   556
          |> List.partition (member (op =) ["dptsat", "dpll"] o fst)
blanchet@41007
   557
        val res =
blanchet@41007
   558
          if null nonml_solvers then
blanchet@41007
   559
            time_limit tac_timeout (snd (hd ml_solvers)) prop
blanchet@41007
   560
          else
blanchet@41007
   561
            time_limit ml_solver_timeout (snd (hd ml_solvers)) prop
blanchet@41007
   562
            handle TimeLimit.TimeOut =>
blanchet@41007
   563
                   time_limit tac_timeout (SatSolver.invoke_solver "auto") prop
blanchet@40146
   564
      in
blanchet@41007
   565
        case res of
blanchet@40146
   566
          SatSolver.SATISFIABLE assigns => do_assigns assigns
blanchet@40994
   567
        | _ => (trace_msg (K "*** Unsolvable"); NONE)
blanchet@40146
   568
      end
blanchet@41007
   569
      handle TimeLimit.TimeOut => (trace_msg (K "*** Timed out"); NONE)
blanchet@40146
   570
  end
blanchet@33192
   571
blanchet@40998
   572
type mcontext =
blanchet@35665
   573
  {bound_Ts: typ list,
blanchet@35665
   574
   bound_Ms: mtyp list,
blanchet@40998
   575
   frame: (int * annotation_atom) list,
blanchet@35385
   576
   frees: (styp * mtyp) list,
blanchet@35385
   577
   consts: (styp * mtyp) list}
blanchet@33192
   578
blanchet@40998
   579
fun string_for_bound ctxt Ms (j, aa) =
blanchet@40998
   580
  Syntax.string_of_term ctxt (Bound (length Ms - j - 1)) ^ " :\<^bsup>" ^
blanchet@40998
   581
  string_for_annotation_atom aa ^ "\<^esup> " ^
blanchet@40998
   582
  string_for_mtype (nth Ms (length Ms - j - 1))
blanchet@40998
   583
fun string_for_free relevant_frees ((s, _), M) =
blanchet@40998
   584
  if member (op =) relevant_frees s then SOME (s ^ " : " ^ string_for_mtype M)
blanchet@40998
   585
  else NONE
blanchet@40998
   586
fun string_for_mcontext ctxt t {bound_Ms, frame, frees, ...} =
blanchet@40998
   587
  (map_filter (string_for_free (Term.add_free_names t [])) frees @
blanchet@40998
   588
   map (string_for_bound ctxt bound_Ms) frame)
blanchet@40998
   589
  |> commas |> enclose "[" "]"
blanchet@33192
   590
blanchet@40987
   591
val initial_gamma =
blanchet@40998
   592
  {bound_Ts = [], bound_Ms = [], frame = [], frees = [], consts = []}
blanchet@33192
   593
blanchet@40998
   594
fun push_bound aa T M {bound_Ts, bound_Ms, frame, frees, consts} =
blanchet@40987
   595
  {bound_Ts = T :: bound_Ts, bound_Ms = M :: bound_Ms,
blanchet@40998
   596
   frame = frame @ [(length bound_Ts, aa)], frees = frees, consts = consts}
blanchet@40998
   597
fun pop_bound {bound_Ts, bound_Ms, frame, frees, consts} =
blanchet@40993
   598
  {bound_Ts = tl bound_Ts, bound_Ms = tl bound_Ms,
blanchet@40998
   599
   frame = frame |> filter_out (fn (j, _) => j = length bound_Ts - 1),
blanchet@40987
   600
   frees = frees, consts = consts}
blanchet@35665
   601
  handle List.Empty => initial_gamma (* FIXME: needed? *)
blanchet@33192
   602
blanchet@40998
   603
fun set_frame frame ({bound_Ts, bound_Ms, frees, consts, ...} : mcontext) =
blanchet@40998
   604
  {bound_Ts = bound_Ts, bound_Ms = bound_Ms, frame = frame, frees = frees,
blanchet@40998
   605
   consts = consts}
blanchet@40994
   606
blanchet@40998
   607
fun add_comp_frame aa cmp = fold (add_annotation_atom_comp cmp [] aa o snd)
blanchet@40994
   608
blanchet@40994
   609
fun add_bound_frame j frame =
blanchet@40994
   610
  let
blanchet@40994
   611
    val (new_frame, gen_frame) = List.partition (curry (op =) j o fst) frame
blanchet@40994
   612
  in
blanchet@40998
   613
    add_comp_frame (A New) Leq new_frame
blanchet@40998
   614
    #> add_comp_frame (A Gen) Eq gen_frame
blanchet@40994
   615
  end
blanchet@40994
   616
blanchet@40997
   617
fun fresh_frame ({max_fresh, ...} : mdata) fls tru =
blanchet@40997
   618
  map (apsnd (fn aa =>
blanchet@40997
   619
                 case (aa, fls, tru) of
blanchet@40997
   620
                   (A Fls, SOME a, _) => A a
blanchet@40997
   621
                 | (A Tru, _, SOME a) => A a
blanchet@40997
   622
                 | (A Gen, _, _) => A Gen
blanchet@40997
   623
                 | _ => V (Unsynchronized.inc max_fresh)))
blanchet@40994
   624
blanchet@40997
   625
fun conj_clauses res_aa aa1 aa2 =
blanchet@40997
   626
  [[(aa1, (Neq, Tru)), (aa2, (Neq, Tru)), (res_aa, (Eq, Tru))],
blanchet@40997
   627
   [(aa1, (Neq, Fls)), (res_aa, (Eq, Fls))],
blanchet@40997
   628
   [(aa2, (Neq, Fls)), (res_aa, (Eq, Fls))],
blanchet@40997
   629
   [(aa1, (Neq, Gen)), (aa2, (Eq, Fls)), (res_aa, (Eq, Gen))],
blanchet@40997
   630
   [(aa1, (Neq, New)), (aa2, (Eq, Fls)), (res_aa, (Eq, Gen))],
blanchet@40997
   631
   [(aa1, (Eq, Fls)), (aa2, (Neq, Gen)), (res_aa, (Eq, Gen))],
blanchet@40997
   632
   [(aa1, (Eq, Fls)), (aa2, (Neq, New)), (res_aa, (Eq, Gen))]]
blanchet@40997
   633
blanchet@40997
   634
fun disj_clauses res_aa aa1 aa2 =
blanchet@40997
   635
  [[(aa1, (Neq, Tru)), (res_aa, (Eq, Tru))],
blanchet@40997
   636
   [(aa2, (Neq, Tru)), (res_aa, (Eq, Tru))],
blanchet@40997
   637
   [(aa1, (Neq, Fls)), (aa2, (Neq, Fls)), (res_aa, (Eq, Fls))],
blanchet@40997
   638
   [(aa1, (Neq, Gen)), (aa2, (Eq, Tru)), (res_aa, (Eq, Gen))],
blanchet@40997
   639
   [(aa1, (Neq, New)), (aa2, (Eq, Tru)), (res_aa, (Eq, Gen))],
blanchet@40997
   640
   [(aa1, (Eq, Tru)), (aa2, (Neq, Gen)), (res_aa, (Eq, Gen))],
blanchet@40997
   641
   [(aa1, (Eq, Tru)), (aa2, (Neq, New)), (res_aa, (Eq, Gen))]]
blanchet@40994
   642
blanchet@40997
   643
fun imp_clauses res_aa aa1 aa2 =
blanchet@40997
   644
  [[(aa1, (Neq, Fls)), (res_aa, (Eq, Tru))],
blanchet@40997
   645
   [(aa2, (Neq, Tru)), (res_aa, (Eq, Tru))],
blanchet@40997
   646
   [(aa1, (Neq, Tru)), (aa2, (Neq, Fls)), (res_aa, (Eq, Fls))],
blanchet@40997
   647
   [(aa1, (Neq, Gen)), (aa2, (Eq, Tru)), (res_aa, (Eq, Gen))],
blanchet@40997
   648
   [(aa1, (Neq, New)), (aa2, (Eq, Tru)), (res_aa, (Eq, Gen))],
blanchet@40997
   649
   [(aa1, (Eq, Fls)), (aa2, (Neq, Gen)), (res_aa, (Eq, Gen))],
blanchet@40997
   650
   [(aa1, (Eq, Fls)), (aa2, (Neq, New)), (res_aa, (Eq, Gen))]]
blanchet@40997
   651
blanchet@41054
   652
val meta_conj_spec = ("\<and>", conj_clauses)
blanchet@41054
   653
val meta_imp_spec = ("\<implies>", imp_clauses)
blanchet@41054
   654
val conj_spec = ("\<and>", conj_clauses)
blanchet@41054
   655
val disj_spec = ("\<or>", disj_clauses)
blanchet@41054
   656
val imp_spec = ("\<implies>", imp_clauses)
blanchet@41003
   657
blanchet@40999
   658
fun add_annotation_clause_from_quasi_clause _ NONE = NONE
blanchet@40999
   659
  | add_annotation_clause_from_quasi_clause [] accum = accum
blanchet@40999
   660
  | add_annotation_clause_from_quasi_clause ((aa, (cmp, a)) :: rest) accum =
blanchet@40999
   661
    case aa of
blanchet@40999
   662
      A a' => if annotation_comp cmp a' a then NONE
blanchet@40999
   663
              else add_annotation_clause_from_quasi_clause rest accum
blanchet@40999
   664
    | V x => add_annotation_clause_from_quasi_clause rest accum
blanchet@40999
   665
             |> Option.map (cons (x, (sign_for_comp_op cmp, a)))
blanchet@40995
   666
blanchet@41000
   667
fun assign_clause_from_quasi_clause unless =
blanchet@41000
   668
  add_annotation_clause_from_quasi_clause unless (SOME [])
blanchet@40995
   669
blanchet@40997
   670
fun add_connective_var conn mk_quasi_clauses res_aa aa1 aa2 =
blanchet@40997
   671
  (trace_msg (fn () => "*** Add " ^ string_for_annotation_atom res_aa ^ " = " ^
blanchet@40997
   672
                       string_for_annotation_atom aa1 ^ " " ^ conn ^ " " ^
blanchet@40997
   673
                       string_for_annotation_atom aa2);
blanchet@40999
   674
   fold (add_assign_clause o assign_clause_from_quasi_clause)
blanchet@40999
   675
        (mk_quasi_clauses res_aa aa1 aa2))
blanchet@40997
   676
fun add_connective_frames conn mk_quasi_clauses res_frame frame1 frame2 =
blanchet@40997
   677
  fold I (map3 (fn (_, res_aa) => fn (_, aa1) => fn (_, aa2) =>
blanchet@40997
   678
                   add_connective_var conn mk_quasi_clauses res_aa aa1 aa2)
blanchet@40997
   679
               res_frame frame1 frame2)
blanchet@40995
   680
blanchet@40998
   681
fun kill_unused_in_frame is_in (accum as ({frame, ...}, _)) =
blanchet@40998
   682
  let val (used_frame, unused_frame) = List.partition is_in frame in
blanchet@40998
   683
    accum |>> set_frame used_frame
blanchet@40998
   684
          ||> add_comp_frame (A Gen) Eq unused_frame
blanchet@40998
   685
  end
blanchet@40998
   686
blanchet@40998
   687
fun split_frame is_in_fun (gamma as {frame, ...}, cset) =
blanchet@40998
   688
  let
blanchet@40998
   689
    fun bubble fun_frame arg_frame [] cset =
blanchet@40998
   690
        ((rev fun_frame, rev arg_frame), cset)
blanchet@40998
   691
      | bubble fun_frame arg_frame ((bound as (_, aa)) :: rest) cset =
blanchet@40998
   692
        if is_in_fun bound then
blanchet@40998
   693
          bubble (bound :: fun_frame) arg_frame rest
blanchet@40998
   694
                 (cset |> add_comp_frame aa Leq arg_frame)
blanchet@40998
   695
        else
blanchet@40998
   696
          bubble fun_frame (bound :: arg_frame) rest cset
blanchet@40998
   697
  in cset |> bubble [] [] frame ||> pair gamma end
blanchet@40998
   698
blanchet@40998
   699
fun add_annotation_atom_comp_alt _ (A Gen) _ _ = I
blanchet@40998
   700
  | add_annotation_atom_comp_alt _ (A _) _ _ =
blanchet@40998
   701
    (trace_msg (K "*** Expected G"); raise UNSOLVABLE ())
blanchet@40998
   702
  | add_annotation_atom_comp_alt cmp (V x) aa1 aa2 =
blanchet@40998
   703
    add_annotation_atom_comp cmp [x] aa1 aa2
blanchet@40998
   704
blanchet@40999
   705
fun add_arg_order1 ((_, aa), (_, prev_aa)) = I
blanchet@40998
   706
  add_annotation_atom_comp_alt Neq prev_aa (A Gen) aa
blanchet@40999
   707
fun add_app1 fun_aa ((_, res_aa), (_, arg_aa)) = I
blanchet@40999
   708
  let
blanchet@40999
   709
    val clause = [(arg_aa, (Eq, New)), (res_aa, (Eq, Gen))]
blanchet@40999
   710
                 |> assign_clause_from_quasi_clause
blanchet@40999
   711
  in
blanchet@40999
   712
    trace_msg (fn () => "*** Add " ^ string_for_assign_clause clause);
blanchet@40999
   713
    apsnd (add_assign_clause clause)
blanchet@40999
   714
    #> add_annotation_atom_comp_alt Leq arg_aa fun_aa res_aa
blanchet@40999
   715
  end
blanchet@40998
   716
fun add_app _ [] [] = I
blanchet@40998
   717
  | add_app fun_aa res_frame arg_frame =
blanchet@40998
   718
    add_comp_frame (A New) Leq arg_frame
blanchet@40998
   719
    #> fold add_arg_order1 (tl arg_frame ~~ (fst (split_last arg_frame)))
blanchet@40998
   720
    #> fold (add_app1 fun_aa) (res_frame ~~ arg_frame)
blanchet@40998
   721
blanchet@41054
   722
fun consider_connective mdata (conn, mk_quasi_clauses) do_t1 do_t2
blanchet@41003
   723
                        (accum as ({frame, ...}, _)) =
blanchet@41003
   724
  let
blanchet@41003
   725
    val frame1 = fresh_frame mdata (SOME Tru) NONE frame
blanchet@41003
   726
    val frame2 = fresh_frame mdata (SOME Fls) NONE frame
blanchet@41003
   727
  in
blanchet@41054
   728
    accum |>> set_frame frame1 |> do_t1
blanchet@41054
   729
          |>> set_frame frame2 |> do_t2
blanchet@41054
   730
          |>> set_frame frame
blanchet@41054
   731
          ||> apsnd (add_connective_frames conn mk_quasi_clauses frame frame1
blanchet@41054
   732
                                           frame2)
blanchet@41003
   733
  end
blanchet@41003
   734
blanchet@39359
   735
fun consider_term (mdata as {hol_ctxt = {thy, ctxt, stds, ...}, alpha_T,
blanchet@39359
   736
                             max_fresh, ...}) =
blanchet@33192
   737
  let
blanchet@37476
   738
    fun is_enough_eta_expanded t =
blanchet@37476
   739
      case strip_comb t of
blanchet@39359
   740
        (Const x, ts) => the_default 0 (arity_of_built_in_const thy stds x)
blanchet@37476
   741
        <= length ts
blanchet@37476
   742
      | _ => true
blanchet@35672
   743
    val mtype_for = fresh_mtype_for_type mdata false
blanchet@35385
   744
    fun do_all T (gamma, cset) =
blanchet@33192
   745
      let
blanchet@35385
   746
        val abs_M = mtype_for (domain_type (domain_type T))
blanchet@41012
   747
        val x = Unsynchronized.inc max_fresh
blanchet@35386
   748
        val body_M = mtype_for (body_type T)
blanchet@33192
   749
      in
blanchet@41012
   750
        (MFun (MFun (abs_M, V x, body_M), A Gen, body_M),
blanchet@41012
   751
         (gamma, cset |> add_mtype_is_complete [(x, (Plus, Tru))] abs_M))
blanchet@33192
   752
      end
blanchet@33192
   753
    fun do_equals T (gamma, cset) =
blanchet@40997
   754
      let
blanchet@40997
   755
        val M = mtype_for (domain_type T)
blanchet@41014
   756
        val x = Unsynchronized.inc max_fresh
blanchet@40997
   757
      in
blanchet@41014
   758
        (MFun (M, A Gen, MFun (M, V x, mtype_for (nth_range_type 2 T))),
blanchet@41000
   759
         (gamma, cset |> add_mtype_is_concrete [] M
blanchet@41014
   760
                      |> add_annotation_atom_comp Leq [] (A Fls) (V x)))
blanchet@33192
   761
      end
blanchet@33192
   762
    fun do_robust_set_operation T (gamma, cset) =
blanchet@33192
   763
      let
blanchet@33192
   764
        val set_T = domain_type T
blanchet@35385
   765
        val M1 = mtype_for set_T
blanchet@35385
   766
        val M2 = mtype_for set_T
blanchet@35385
   767
        val M3 = mtype_for set_T
blanchet@33192
   768
      in
blanchet@40985
   769
        (MFun (M1, A Gen, MFun (M2, A Gen, M3)),
blanchet@35385
   770
         (gamma, cset |> add_is_sub_mtype M1 M3 |> add_is_sub_mtype M2 M3))
blanchet@33192
   771
      end
blanchet@33192
   772
    fun do_fragile_set_operation T (gamma, cset) =
blanchet@33192
   773
      let
blanchet@33192
   774
        val set_T = domain_type T
blanchet@35385
   775
        val set_M = mtype_for set_T
blanchet@35665
   776
        fun custom_mtype_for (T as Type (@{type_name fun}, [T1, T2])) =
blanchet@35385
   777
            if T = set_T then set_M
blanchet@40985
   778
            else MFun (custom_mtype_for T1, A Gen, custom_mtype_for T2)
blanchet@35385
   779
          | custom_mtype_for T = mtype_for T
blanchet@33192
   780
      in
blanchet@41000
   781
        (custom_mtype_for T, (gamma, cset |> add_mtype_is_concrete [] set_M))
blanchet@33192
   782
      end
blanchet@33192
   783
    fun do_pair_constr T accum =
blanchet@35385
   784
      case mtype_for (nth_range_type 2 T) of
blanchet@35385
   785
        M as MPair (a_M, b_M) =>
blanchet@40985
   786
        (MFun (a_M, A Gen, MFun (b_M, A Gen, M)), accum)
blanchet@35665
   787
      | M => raise MTYPE ("Nitpick_Mono.consider_term.do_pair_constr", [M], [])
blanchet@33192
   788
    fun do_nth_pair_sel n T =
blanchet@35385
   789
      case mtype_for (domain_type T) of
blanchet@35385
   790
        M as MPair (a_M, b_M) =>
blanchet@40985
   791
        pair (MFun (M, A Gen, if n = 0 then a_M else b_M))
blanchet@35665
   792
      | M => raise MTYPE ("Nitpick_Mono.consider_term.do_nth_pair_sel", [M], [])
blanchet@41054
   793
    and do_connect spec t1 t2 accum =
blanchet@41054
   794
      (bool_M, consider_connective mdata spec (snd o do_term t1)
blanchet@41054
   795
                                   (snd o do_term t2) accum)
blanchet@40998
   796
    and do_term t
blanchet@40998
   797
            (accum as (gamma as {bound_Ts, bound_Ms, frame, frees, consts},
blanchet@40998
   798
                       cset)) =
blanchet@40998
   799
      (trace_msg (fn () => "  " ^ string_for_mcontext ctxt t gamma ^
blanchet@40998
   800
                           " \<turnstile> " ^ Syntax.string_of_term ctxt t ^
blanchet@40998
   801
                           " : _?");
blanchet@40993
   802
       case t of
blanchet@41054
   803
         @{const False} => (bool_M, accum ||> add_comp_frame (A Fls) Leq frame)
blanchet@41018
   804
       | Const (@{const_name None}, T) =>
blanchet@41054
   805
         (mtype_for T, accum ||> add_comp_frame (A Fls) Leq frame)
blanchet@41054
   806
       | @{const True} => (bool_M, accum ||> add_comp_frame (A Tru) Leq frame)
blanchet@41016
   807
       | (t0 as Const (@{const_name HOL.eq}, _)) $ Bound 0 $ t2 =>
blanchet@41016
   808
         (* hack to exploit symmetry of equality when typing "insert" *)
blanchet@41016
   809
         (if t2 = Bound 0 then do_term @{term True}
blanchet@41016
   810
          else do_term (t0 $ t2 $ Bound 0)) accum
blanchet@40994
   811
       | Const (x as (s, T)) =>
blanchet@40993
   812
         (case AList.lookup (op =) consts x of
blanchet@40993
   813
            SOME M => (M, accum)
blanchet@40993
   814
          | NONE =>
blanchet@40994
   815
            if not (could_exist_alpha_subtype alpha_T T) then
blanchet@40994
   816
              (mtype_for T, accum)
blanchet@40994
   817
            else case s of
blanchet@40994
   818
              @{const_name all} => do_all T accum
blanchet@40994
   819
            | @{const_name "=="} => do_equals T accum
blanchet@40994
   820
            | @{const_name All} => do_all T accum
blanchet@40994
   821
            | @{const_name Ex} =>
blanchet@40994
   822
              let val set_T = domain_type T in
blanchet@40994
   823
                do_term (Abs (Name.uu, set_T,
blanchet@40994
   824
                              @{const Not} $ (HOLogic.mk_eq
blanchet@40994
   825
                                  (Abs (Name.uu, domain_type set_T,
blanchet@40994
   826
                                        @{const False}),
blanchet@40994
   827
                                   Bound 0)))) accum
blanchet@40994
   828
              end
blanchet@40994
   829
            | @{const_name HOL.eq} => do_equals T accum
blanchet@40994
   830
            | @{const_name The} =>
blanchet@40994
   831
              (trace_msg (K "*** The"); raise UNSOLVABLE ())
blanchet@40994
   832
            | @{const_name Eps} =>
blanchet@40994
   833
              (trace_msg (K "*** Eps"); raise UNSOLVABLE ())
blanchet@40994
   834
            | @{const_name If} =>
blanchet@40994
   835
              do_robust_set_operation (range_type T) accum
blanchet@40994
   836
              |>> curry3 MFun bool_M (A Gen)
blanchet@40994
   837
            | @{const_name Pair} => do_pair_constr T accum
blanchet@40994
   838
            | @{const_name fst} => do_nth_pair_sel 0 T accum
blanchet@40994
   839
            | @{const_name snd} => do_nth_pair_sel 1 T accum
blanchet@40994
   840
            | @{const_name Id} =>
blanchet@40994
   841
              (MFun (mtype_for (domain_type T), A Gen, bool_M), accum)
blanchet@40994
   842
            | @{const_name converse} =>
blanchet@40994
   843
              let
blanchet@40994
   844
                val x = Unsynchronized.inc max_fresh
blanchet@40994
   845
                fun mtype_for_set T =
blanchet@40994
   846
                  MFun (mtype_for (domain_type T), V x, bool_M)
blanchet@40994
   847
                val ab_set_M = domain_type T |> mtype_for_set
blanchet@40994
   848
                val ba_set_M = range_type T |> mtype_for_set
blanchet@41011
   849
              in
blanchet@41011
   850
                (MFun (ab_set_M, A Gen, ba_set_M),
blanchet@41011
   851
                 accum ||> add_annotation_atom_comp Neq [] (V x) (A New))
blanchet@41011
   852
              end
blanchet@40994
   853
            | @{const_name trancl} => do_fragile_set_operation T accum
blanchet@40994
   854
            | @{const_name rel_comp} =>
blanchet@40994
   855
              let
blanchet@40994
   856
                val x = Unsynchronized.inc max_fresh
blanchet@40994
   857
                fun mtype_for_set T =
blanchet@40994
   858
                  MFun (mtype_for (domain_type T), V x, bool_M)
blanchet@40994
   859
                val bc_set_M = domain_type T |> mtype_for_set
blanchet@40994
   860
                val ab_set_M = domain_type (range_type T) |> mtype_for_set
blanchet@40994
   861
                val ac_set_M = nth_range_type 2 T |> mtype_for_set
blanchet@40994
   862
              in
blanchet@40994
   863
                (MFun (bc_set_M, A Gen, MFun (ab_set_M, A Gen, ac_set_M)),
blanchet@41011
   864
                 accum ||> add_annotation_atom_comp Neq [] (V x) (A New))
blanchet@40994
   865
              end
blanchet@40994
   866
            | @{const_name finite} =>
blanchet@41011
   867
              let
blanchet@41011
   868
                val M1 = mtype_for (domain_type (domain_type T))
blanchet@41011
   869
                val a = if exists_alpha_sub_mtype M1 then Fls else Gen
blanchet@41011
   870
              in (MFun (MFun (M1, A a, bool_M), A Gen, bool_M), accum) end
blanchet@41050
   871
            | @{const_name prod} =>
blanchet@40994
   872
              let
blanchet@40994
   873
                val x = Unsynchronized.inc max_fresh
blanchet@40994
   874
                fun mtype_for_set T =
blanchet@40994
   875
                  MFun (mtype_for (domain_type T), V x, bool_M)
blanchet@41050
   876
                val a_set_M = mtype_for_set (domain_type T)
blanchet@40994
   877
                val b_set_M =
blanchet@40994
   878
                  mtype_for_set (range_type (domain_type (range_type T)))
blanchet@40994
   879
                val ab_set_M = mtype_for_set (nth_range_type 2 T)
blanchet@40994
   880
              in
blanchet@41050
   881
                (MFun (a_set_M, A Gen, MFun (b_set_M, A Gen, ab_set_M)),
blanchet@41011
   882
                 accum ||> add_annotation_atom_comp Neq [] (V x) (A New))
blanchet@40994
   883
              end
blanchet@40993
   884
            | _ =>
blanchet@40994
   885
              if s = @{const_name safe_The} then
blanchet@33192
   886
                let
blanchet@40994
   887
                  val a_set_M = mtype_for (domain_type T)
blanchet@40994
   888
                  val a_M = dest_MFun a_set_M |> #1
blanchet@40994
   889
                in (MFun (a_set_M, A Gen, a_M), accum) end
blanchet@40994
   890
              else if s = @{const_name ord_class.less_eq} andalso
blanchet@40994
   891
                      is_set_type (domain_type T) then
blanchet@40994
   892
                do_fragile_set_operation T accum
blanchet@40994
   893
              else if is_sel s then
blanchet@40994
   894
                (mtype_for_sel mdata x, accum)
blanchet@40994
   895
              else if is_constr ctxt stds x then
blanchet@40994
   896
                (mtype_for_constr mdata x, accum)
blanchet@40994
   897
              else if is_built_in_const thy stds x then
blanchet@40994
   898
                (fresh_mtype_for_type mdata true T, accum)
blanchet@40994
   899
              else
blanchet@40994
   900
                let val M = mtype_for T in
blanchet@40998
   901
                  (M, ({bound_Ts = bound_Ts, bound_Ms = bound_Ms, frame = frame,
blanchet@40998
   902
                        frees = frees, consts = (x, M) :: consts}, cset))
blanchet@40994
   903
                end)
blanchet@40998
   904
           ||> apsnd (add_comp_frame (A Gen) Eq frame)
blanchet@33192
   905
         | Free (x as (_, T)) =>
blanchet@33192
   906
           (case AList.lookup (op =) frees x of
blanchet@35385
   907
              SOME M => (M, accum)
blanchet@33192
   908
            | NONE =>
blanchet@35385
   909
              let val M = mtype_for T in
blanchet@40998
   910
                (M, ({bound_Ts = bound_Ts, bound_Ms = bound_Ms, frame = frame,
blanchet@40998
   911
                      frees = (x, M) :: frees, consts = consts}, cset))
blanchet@40994
   912
              end)
blanchet@41054
   913
           ||> apsnd (add_comp_frame (A Gen) Eq frame)
blanchet@38179
   914
         | Var _ => (trace_msg (K "*** Var"); raise UNSOLVABLE ())
blanchet@40994
   915
         | Bound j =>
blanchet@41054
   916
           (nth bound_Ms j,
blanchet@40998
   917
            accum ||> add_bound_frame (length bound_Ts - j - 1) frame)
blanchet@41054
   918
         | Abs (_, T, t') =>
blanchet@35665
   919
           (case fin_fun_body T (fastype_of1 (T :: bound_Ts, t')) t' of
blanchet@35665
   920
              SOME t' =>
blanchet@35665
   921
              let
blanchet@35665
   922
                val M = mtype_for T
blanchet@41014
   923
                val x = Unsynchronized.inc max_fresh
blanchet@41054
   924
                val (M', accum) = do_term t' (accum |>> push_bound (V x) T M)
blanchet@41014
   925
              in
blanchet@41054
   926
                (MFun (M, V x, M'),
blanchet@41014
   927
                 accum |>> pop_bound
blanchet@41014
   928
                       ||> add_annotation_atom_comp Leq [] (A Fls) (V x))
blanchet@41014
   929
              end
blanchet@35665
   930
            | NONE =>
blanchet@35665
   931
              ((case t' of
blanchet@35665
   932
                  t1' $ Bound 0 =>
blanchet@37476
   933
                  if not (loose_bvar1 (t1', 0)) andalso
blanchet@37476
   934
                     is_enough_eta_expanded t1' then
blanchet@35665
   935
                    do_term (incr_boundvars ~1 t1') accum
blanchet@35665
   936
                  else
blanchet@35665
   937
                    raise SAME ()
haftmann@38864
   938
                | (t11 as Const (@{const_name HOL.eq}, _)) $ Bound 0 $ t13 =>
blanchet@37476
   939
                  if not (loose_bvar1 (t13, 0)) then
blanchet@37476
   940
                    do_term (incr_boundvars ~1 (t11 $ t13)) accum
blanchet@37476
   941
                  else
blanchet@37476
   942
                    raise SAME ()
blanchet@35665
   943
                | _ => raise SAME ())
blanchet@35665
   944
               handle SAME () =>
blanchet@35665
   945
                      let
blanchet@35665
   946
                        val M = mtype_for T
blanchet@41014
   947
                        val x = Unsynchronized.inc max_fresh
blanchet@41054
   948
                        val (M', accum) =
blanchet@41014
   949
                          do_term t' (accum |>> push_bound (V x) T M)
blanchet@41054
   950
                      in (MFun (M, V x, M'), accum |>> pop_bound) end))
blanchet@41054
   951
         | @{const Not} $ t1 => do_connect imp_spec t1 @{const False} accum
blanchet@41054
   952
         | @{const conj} $ t1 $ t2 => do_connect conj_spec t1 t2 accum
blanchet@41054
   953
         | @{const disj} $ t1 $ t2 => do_connect disj_spec t1 t2 accum
blanchet@41054
   954
         | @{const implies} $ t1 $ t2 => do_connect imp_spec t1 t2 accum
blanchet@33192
   955
         | Const (@{const_name Let}, _) $ t1 $ t2 =>
blanchet@33192
   956
           do_term (betapply (t2, t1)) accum
blanchet@33192
   957
         | t1 $ t2 =>
blanchet@33192
   958
           let
blanchet@40998
   959
             fun is_in t (j, _) = loose_bvar1 (t, length bound_Ts - j - 1)
blanchet@40998
   960
             val accum as ({frame, ...}, _) =
blanchet@40998
   961
               accum |> kill_unused_in_frame (is_in t)
blanchet@40998
   962
             val ((frame1a, frame1b), accum) = accum |> split_frame (is_in t1)
blanchet@40998
   963
             val frame2a = frame1a |> map (apsnd (K (A Gen)))
blanchet@40998
   964
             val frame2b =
blanchet@40998
   965
               frame1b |> map (apsnd (fn _ => V (Unsynchronized.inc max_fresh)))
blanchet@40998
   966
             val frame2 = frame2a @ frame2b
blanchet@41054
   967
             val (M1, accum) = accum |>> set_frame frame1a |> do_term t1
blanchet@41054
   968
             val (M2, accum) = accum |>> set_frame frame2 |> do_term t2
blanchet@33192
   969
           in
blanchet@35812
   970
             let
blanchet@41054
   971
               val (M11, aa, M12) = M1 |> dest_MFun
blanchet@40998
   972
             in
blanchet@41054
   973
               (M12, accum |>> set_frame frame
blanchet@41054
   974
                           ||> add_is_sub_mtype M2 M11
blanchet@41054
   975
                           ||> add_app aa frame1b frame2b)
blanchet@40998
   976
             end
blanchet@33192
   977
           end)
blanchet@41054
   978
        |> tap (fn (M, (gamma, _)) =>
blanchet@40998
   979
                   trace_msg (fn () => "  " ^ string_for_mcontext ctxt t gamma ^
blanchet@40998
   980
                                       " \<turnstile> " ^
blanchet@41054
   981
                                       Syntax.string_of_term ctxt t ^ " : " ^
blanchet@41054
   982
                                       string_for_mtype M))
blanchet@33192
   983
  in do_term end
blanchet@33192
   984
blanchet@41001
   985
fun force_gen_funs 0 _ = I
blanchet@41001
   986
  | force_gen_funs n (M as MFun (M1, _, M2)) =
blanchet@41001
   987
    add_mtypes_equal M (MFun (M1, A Gen, M2)) #> force_gen_funs (n - 1) M2
blanchet@41001
   988
  | force_gen_funs _ M = raise MTYPE ("Nitpick_Mono.force_gen_funs", [M], [])
blanchet@41054
   989
fun consider_general_equals mdata def t1 t2 accum =
blanchet@35386
   990
  let
blanchet@41054
   991
    val (M1, accum) = consider_term mdata t1 accum
blanchet@41054
   992
    val (M2, accum) = consider_term mdata t2 accum
blanchet@35665
   993
    val accum = accum ||> add_mtypes_equal M1 M2
blanchet@35386
   994
  in
blanchet@41054
   995
    if def then
blanchet@41054
   996
      let
blanchet@41054
   997
        val (head1, args1) = strip_comb t1
blanchet@41054
   998
        val (head_M1, accum) = consider_term mdata head1 accum
blanchet@41054
   999
      in accum ||> force_gen_funs (length args1) head_M1 end
blanchet@41054
  1000
    else
blanchet@41054
  1001
      accum
blanchet@35386
  1002
  end
blanchet@35386
  1003
blanchet@41000
  1004
fun consider_general_formula (mdata as {hol_ctxt = {ctxt, ...}, max_fresh,
blanchet@41000
  1005
                                        ...}) =
blanchet@33192
  1006
  let
blanchet@35672
  1007
    val mtype_for = fresh_mtype_for_type mdata false
blanchet@41054
  1008
    val do_term = snd oo consider_term mdata
blanchet@40998
  1009
    fun do_formula sn t (accum as (gamma, _)) =
blanchet@41000
  1010
      let
blanchet@41054
  1011
        fun do_quantifier quant_s abs_T body_t =
blanchet@41000
  1012
          let
blanchet@41000
  1013
            val abs_M = mtype_for abs_T
blanchet@41000
  1014
            val x = Unsynchronized.inc max_fresh
blanchet@41000
  1015
            val side_cond = ((sn = Minus) = (quant_s = @{const_name Ex}))
blanchet@41001
  1016
            fun ann () = if quant_s = @{const_name Ex} then Fls else Tru
blanchet@41000
  1017
          in
blanchet@41054
  1018
            accum ||> side_cond
blanchet@41054
  1019
                      ? add_mtype_is_complete [(x, (Plus, ann ()))] abs_M
blanchet@41054
  1020
                  |>> push_bound (V x) abs_T abs_M
blanchet@41054
  1021
                  |> do_formula sn body_t
blanchet@41054
  1022
                  |>> pop_bound
blanchet@41000
  1023
          end
blanchet@41054
  1024
        fun do_connect spec neg1 t1 t2 =
blanchet@41054
  1025
          consider_connective mdata spec
blanchet@41003
  1026
              (do_formula (sn |> neg1 ? negate_sign) t1) (do_formula sn t2)
blanchet@41054
  1027
        fun do_equals t1 t2 =
blanchet@41000
  1028
          case sn of
blanchet@41000
  1029
            Plus => do_term t accum
blanchet@41054
  1030
          | Minus => consider_general_equals mdata false t1 t2 accum
blanchet@41000
  1031
      in
blanchet@41004
  1032
        trace_msg (fn () => "  " ^ string_for_mcontext ctxt t gamma ^
blanchet@41004
  1033
                            " \<turnstile> " ^ Syntax.string_of_term ctxt t ^
blanchet@41004
  1034
                            " : o\<^sup>" ^ string_for_sign sn ^ "?");
blanchet@41004
  1035
        case t of
blanchet@41054
  1036
          Const (s as @{const_name all}, _) $ Abs (_, T1, t1) =>
blanchet@41054
  1037
          do_quantifier s T1 t1
blanchet@41054
  1038
        | Const (@{const_name "=="}, _) $ t1 $ t2 => do_equals t1 t2
blanchet@41054
  1039
        | @{const Trueprop} $ t1 => do_formula sn t1 accum
blanchet@41054
  1040
        | Const (s as @{const_name All}, _) $ Abs (_, T1, t1) =>
blanchet@41054
  1041
          do_quantifier s T1 t1
blanchet@41054
  1042
        | Const (s as @{const_name Ex}, T0) $ (t1 as Abs (_, T1, t1')) =>
blanchet@41004
  1043
          (case sn of
blanchet@41054
  1044
             Plus => do_quantifier s T1 t1'
blanchet@41004
  1045
           | Minus =>
blanchet@41054
  1046
             (* FIXME: Needed? *)
blanchet@41004
  1047
             do_term (@{const Not}
blanchet@41004
  1048
                      $ (HOLogic.eq_const (domain_type T0) $ t1
blanchet@41004
  1049
                         $ Abs (Name.uu, T1, @{const False}))) accum)
blanchet@41054
  1050
        | Const (@{const_name HOL.eq}, _) $ t1 $ t2 => do_equals t1 t2
blanchet@41004
  1051
        | Const (@{const_name Let}, _) $ t1 $ t2 =>
blanchet@41004
  1052
          do_formula sn (betapply (t2, t1)) accum
blanchet@41004
  1053
        | @{const Pure.conjunction} $ t1 $ t2 =>
blanchet@41054
  1054
          do_connect meta_conj_spec false t1 t2 accum
blanchet@41054
  1055
        | @{const "==>"} $ t1 $ t2 => do_connect meta_imp_spec true t1 t2 accum
blanchet@41054
  1056
        | @{const Not} $ t1 => do_connect imp_spec true t1 @{const False} accum
blanchet@41054
  1057
        | @{const conj} $ t1 $ t2 => do_connect conj_spec false t1 t2 accum
blanchet@41054
  1058
        | @{const disj} $ t1 $ t2 => do_connect disj_spec false t1 t2 accum
blanchet@41054
  1059
        | @{const implies} $ t1 $ t2 => do_connect imp_spec true t1 t2 accum
blanchet@41004
  1060
        | _ => do_term t accum
blanchet@41000
  1061
      end
blanchet@41054
  1062
      |> tap (fn (gamma, _) =>
blanchet@41000
  1063
                 trace_msg (fn () => string_for_mcontext ctxt t gamma ^
blanchet@41000
  1064
                                     " \<turnstile> " ^
blanchet@41054
  1065
                                     Syntax.string_of_term ctxt t ^
blanchet@41054
  1066
                                     " : o\<^sup>" ^ string_for_sign sn))
blanchet@33192
  1067
  in do_formula end
blanchet@33192
  1068
blanchet@33192
  1069
(* The harmless axiom optimization below is somewhat too aggressive in the face
blanchet@33192
  1070
   of (rather peculiar) user-defined axioms. *)
blanchet@33192
  1071
val harmless_consts =
blanchet@33192
  1072
  [@{const_name ord_class.less}, @{const_name ord_class.less_eq}]
blanchet@33192
  1073
val bounteous_consts = [@{const_name bisim}]
blanchet@33192
  1074
blanchet@41054
  1075
fun is_harmless_axiom {hol_ctxt = {thy, stds, ...}, ...} t =
blanchet@35665
  1076
    Term.add_consts t []
blanchet@39359
  1077
    |> filter_out (is_built_in_const thy stds)
blanchet@35665
  1078
    |> (forall (member (op =) harmless_consts o original_name o fst) orf
blanchet@35665
  1079
        exists (member (op =) bounteous_consts o fst))
blanchet@33192
  1080
blanchet@35665
  1081
fun consider_nondefinitional_axiom mdata t =
blanchet@41054
  1082
  if is_harmless_axiom mdata t then I
blanchet@35386
  1083
  else consider_general_formula mdata Plus t
blanchet@33192
  1084
blanchet@37256
  1085
fun consider_definitional_axiom (mdata as {hol_ctxt = {ctxt, ...}, ...}) t =
blanchet@37256
  1086
  if not (is_constr_pattern_formula ctxt t) then
blanchet@35386
  1087
    consider_nondefinitional_axiom mdata t
blanchet@35665
  1088
  else if is_harmless_axiom mdata t then
blanchet@41054
  1089
    I
blanchet@33192
  1090
  else
blanchet@33192
  1091
    let
blanchet@35672
  1092
      val mtype_for = fresh_mtype_for_type mdata false
blanchet@41054
  1093
      val do_term = snd oo consider_term mdata
blanchet@41054
  1094
      fun do_all abs_T body_t accum =
blanchet@41054
  1095
        accum |>> push_bound (A Gen) abs_T (mtype_for abs_T)
blanchet@41054
  1096
              |> do_formula body_t
blanchet@41054
  1097
              |>> pop_bound
blanchet@41054
  1098
      and do_implies t1 t2 = do_term t1 #> do_formula t2
blanchet@35812
  1099
      and do_formula t accum =
blanchet@41002
  1100
        case t of
blanchet@41054
  1101
          Const (@{const_name all}, _) $ Abs (_, T1, t1) => do_all T1 t1 accum
blanchet@41054
  1102
        | @{const Trueprop} $ t1 => do_formula t1 accum
blanchet@41054
  1103
        | Const (@{const_name "=="}, _) $ t1 $ t2 =>
blanchet@41054
  1104
          consider_general_equals mdata true t1 t2 accum
blanchet@41054
  1105
        | @{const "==>"} $ t1 $ t2 => do_implies t1 t2 accum
blanchet@41054
  1106
        | @{const Pure.conjunction} $ t1 $ t2 =>
blanchet@41054
  1107
          fold (do_formula) [t1, t2] accum
blanchet@41054
  1108
        | Const (@{const_name All}, _) $ Abs (_, T1, t1) => do_all T1 t1 accum
blanchet@41054
  1109
        | Const (@{const_name HOL.eq}, _) $ t1 $ t2 =>
blanchet@41054
  1110
          consider_general_equals mdata true t1 t2 accum
blanchet@41054
  1111
        | @{const conj} $ t1 $ t2 => fold (do_formula) [t1, t2] accum
blanchet@41054
  1112
        | @{const implies} $ t1 $ t2 => do_implies t1 t2 accum
blanchet@41002
  1113
        | _ => raise TERM ("Nitpick_Mono.consider_definitional_axiom.\
blanchet@41002
  1114
                           \do_formula", [t])
blanchet@33192
  1115
    in do_formula t end
blanchet@33192
  1116
blanchet@40989
  1117
fun string_for_mtype_of_term ctxt asgs t M =
blanchet@40989
  1118
  Syntax.string_of_term ctxt t ^ " : " ^ string_for_mtype (resolve_mtype asgs M)
blanchet@33192
  1119
blanchet@40998
  1120
fun print_mcontext ctxt asgs ({frees, consts, ...} : mcontext) =
blanchet@38179
  1121
  trace_msg (fn () =>
blanchet@40989
  1122
      map (fn (x, M) => string_for_mtype_of_term ctxt asgs (Free x) M) frees @
blanchet@40989
  1123
      map (fn (x, M) => string_for_mtype_of_term ctxt asgs (Const x) M) consts
blanchet@37476
  1124
      |> cat_lines)
blanchet@33192
  1125
blanchet@41054
  1126
fun formulas_monotonic (hol_ctxt as {ctxt, tac_timeout, ...}) binarize alpha_T
blanchet@41054
  1127
                       (nondef_ts, def_ts) =
blanchet@33192
  1128
  let
blanchet@41054
  1129
    val _ = trace_msg (fn () => "****** Monotonicity analysis: " ^
blanchet@38179
  1130
                                string_for_mtype MAlpha ^ " is " ^
blanchet@38179
  1131
                                Syntax.string_of_typ ctxt alpha_T)
blanchet@41054
  1132
    val mdata as {max_fresh, ...} = initial_mdata hol_ctxt binarize alpha_T
blanchet@41054
  1133
    val (gamma, cset) =
blanchet@41054
  1134
      (initial_gamma, ([], []))
blanchet@41054
  1135
      |> consider_general_formula mdata Plus (hd nondef_ts)
blanchet@41054
  1136
      |> fold (consider_nondefinitional_axiom mdata) (tl nondef_ts)
blanchet@41054
  1137
      |> fold (consider_definitional_axiom mdata) def_ts
blanchet@33192
  1138
  in
blanchet@41007
  1139
    case solve tac_timeout (!max_fresh) cset of
blanchet@41054
  1140
      SOME asgs => (print_mcontext ctxt asgs gamma; true)
blanchet@41054
  1141
    | _ => false
blanchet@33192
  1142
  end
blanchet@41054
  1143
  handle UNSOLVABLE () => false
blanchet@35812
  1144
       | MTYPE (loc, Ms, Ts) =>
blanchet@35665
  1145
         raise BAD (loc, commas (map string_for_mtype Ms @
blanchet@35665
  1146
                                 map (Syntax.string_of_typ ctxt) Ts))
blanchet@35665
  1147
blanchet@33192
  1148
end;