src/Pure/type_infer.ML
author wenzelm
Sun Sep 12 19:04:02 2010 +0200 (2010-09-12)
changeset 39288 f1ae2493d93f
parent 39287 d30be6791038
child 39289 92b50c8bb67b
permissions -rw-r--r--
eliminated aliases of Type.constraint;
wenzelm@2957
     1
(*  Title:      Pure/type_infer.ML
wenzelm@2957
     2
    Author:     Stefan Berghofer and Markus Wenzel, TU Muenchen
wenzelm@2957
     3
wenzelm@22698
     4
Simple type inference.
wenzelm@2957
     5
*)
wenzelm@2957
     6
wenzelm@2957
     7
signature TYPE_INFER =
wenzelm@2957
     8
sig
wenzelm@8087
     9
  val anyT: sort -> typ
wenzelm@8611
    10
  val polymorphicT: typ -> typ
wenzelm@24504
    11
  val is_param: indexname -> bool
wenzelm@14788
    12
  val param: int -> string * sort -> typ
wenzelm@22771
    13
  val paramify_vars: typ -> typ
wenzelm@18339
    14
  val paramify_dummies: typ -> int -> typ * int
wenzelm@24764
    15
  val fixate_params: Name.context -> term list -> term list
wenzelm@22698
    16
  val appl_error: Pretty.pp -> string -> term -> typ -> term -> typ -> string list
wenzelm@24485
    17
  val infer_types: Pretty.pp -> Type.tsig -> (typ list -> typ list) ->
wenzelm@27263
    18
    (string -> typ option) -> (indexname -> typ option) -> Name.context -> int ->
wenzelm@27263
    19
    term list -> term list
wenzelm@2957
    20
end;
wenzelm@2957
    21
wenzelm@37145
    22
structure Type_Infer: TYPE_INFER =
wenzelm@2957
    23
struct
wenzelm@2957
    24
wenzelm@2957
    25
wenzelm@22698
    26
(** type parameters and constraints **)
wenzelm@2957
    27
wenzelm@22698
    28
fun anyT S = TFree ("'_dummy_", S);
wenzelm@2957
    29
wenzelm@22698
    30
(*indicate polymorphic Vars*)
wenzelm@22698
    31
fun polymorphicT T = Type ("_polymorphic_", [T]);
wenzelm@2957
    32
wenzelm@22698
    33
wenzelm@39286
    34
(* type inference parameters -- may get instantiated *)
wenzelm@2957
    35
wenzelm@24504
    36
fun is_param (x, _: int) = String.isPrefix "?" x;
wenzelm@22698
    37
fun param i (x, S) = TVar (("?" ^ x, i), S);
wenzelm@22698
    38
wenzelm@32002
    39
val paramify_vars =
wenzelm@32146
    40
  Same.commit
wenzelm@32146
    41
    (Term_Subst.map_atypsT_same
wenzelm@32146
    42
      (fn TVar ((x, i), S) => (param i (x, S)) | _ => raise Same.SAME));
wenzelm@22771
    43
wenzelm@22698
    44
val paramify_dummies =
wenzelm@22698
    45
  let
wenzelm@22698
    46
    fun dummy S maxidx = (param (maxidx + 1) ("'dummy", S), maxidx + 1);
wenzelm@2957
    47
wenzelm@22698
    48
    fun paramify (TFree ("'_dummy_", S)) maxidx = dummy S maxidx
wenzelm@22698
    49
      | paramify (Type ("dummy", _)) maxidx = dummy [] maxidx
wenzelm@22698
    50
      | paramify (Type (a, Ts)) maxidx =
wenzelm@22698
    51
          let val (Ts', maxidx') = fold_map paramify Ts maxidx
wenzelm@22698
    52
          in (Type (a, Ts'), maxidx') end
wenzelm@22698
    53
      | paramify T maxidx = (T, maxidx);
wenzelm@22698
    54
  in paramify end;
wenzelm@2957
    55
wenzelm@24764
    56
fun fixate_params name_context ts =
wenzelm@24764
    57
  let
wenzelm@24764
    58
    fun subst_param (xi, S) (inst, used) =
wenzelm@24764
    59
      if is_param xi then
wenzelm@24764
    60
        let
wenzelm@24848
    61
          val [a] = Name.invents used Name.aT 1;
wenzelm@24764
    62
          val used' = Name.declare a used;
wenzelm@24764
    63
        in (((xi, S), TFree (a, S)) :: inst, used') end
wenzelm@24764
    64
      else (inst, used);
wenzelm@24764
    65
    val name_context' = (fold o fold_types) Term.declare_typ_names ts name_context;
wenzelm@24764
    66
    val (inst, _) = fold_rev subst_param (fold Term.add_tvars ts []) ([], name_context');
wenzelm@31977
    67
  in (map o map_types) (Term_Subst.instantiateT inst) ts end;
wenzelm@24764
    68
wenzelm@2957
    69
wenzelm@2957
    70
wenzelm@2957
    71
(** pretyps and preterms **)
wenzelm@2957
    72
wenzelm@2957
    73
datatype pretyp =
wenzelm@2957
    74
  PType of string * pretyp list |
wenzelm@2957
    75
  PTFree of string * sort |
wenzelm@2957
    76
  PTVar of indexname * sort |
berghofe@32141
    77
  Param of int * sort;
wenzelm@2957
    78
wenzelm@2957
    79
datatype preterm =
wenzelm@2957
    80
  PConst of string * pretyp |
wenzelm@2957
    81
  PFree of string * pretyp |
wenzelm@2957
    82
  PVar of indexname * pretyp |
wenzelm@2957
    83
  PBound of int |
wenzelm@2957
    84
  PAbs of string * pretyp * preterm |
wenzelm@2957
    85
  PAppl of preterm * preterm |
wenzelm@2957
    86
  Constraint of preterm * pretyp;
wenzelm@2957
    87
wenzelm@2957
    88
wenzelm@2957
    89
(* utils *)
wenzelm@2957
    90
wenzelm@32146
    91
fun deref tye (T as Param (i, S)) =
wenzelm@32146
    92
      (case Inttab.lookup tye i of
wenzelm@32146
    93
        NONE => T
wenzelm@32146
    94
      | SOME U => deref tye U)
berghofe@32141
    95
  | deref tye T = T;
wenzelm@2957
    96
wenzelm@16195
    97
fun fold_pretyps f (PConst (_, T)) x = f T x
wenzelm@16195
    98
  | fold_pretyps f (PFree (_, T)) x = f T x
wenzelm@16195
    99
  | fold_pretyps f (PVar (_, T)) x = f T x
wenzelm@16195
   100
  | fold_pretyps _ (PBound _) x = x
wenzelm@16195
   101
  | fold_pretyps f (PAbs (_, T, t)) x = fold_pretyps f t (f T x)
wenzelm@16195
   102
  | fold_pretyps f (PAppl (t, u)) x = fold_pretyps f u (fold_pretyps f t x)
wenzelm@16195
   103
  | fold_pretyps f (Constraint (t, T)) x = f T (fold_pretyps f t x);
wenzelm@2957
   104
wenzelm@2957
   105
wenzelm@2957
   106
wenzelm@2957
   107
(** raw typs/terms to pretyps/preterms **)
wenzelm@2957
   108
wenzelm@20668
   109
(* pretyp_of *)
wenzelm@2957
   110
wenzelm@39287
   111
fun pretyp_of typ params_idx =
wenzelm@2957
   112
  let
berghofe@32141
   113
    val (params', idx) = fold_atyps
wenzelm@20668
   114
      (fn TVar (xi as (x, _), S) =>
berghofe@32141
   115
          (fn ps_idx as (ps, idx) =>
wenzelm@39287
   116
            if is_param xi andalso not (Vartab.defined ps xi)
berghofe@32141
   117
            then (Vartab.update (xi, Param (idx, S)) ps, idx + 1) else ps_idx)
berghofe@32141
   118
        | _ => I) typ params_idx;
wenzelm@2957
   119
berghofe@32141
   120
    fun pre_of (TVar (v as (xi, _))) idx =
wenzelm@20735
   121
          (case Vartab.lookup params' xi of
skalberg@15531
   122
            NONE => PTVar v
berghofe@32141
   123
          | SOME p => p, idx)
berghofe@32141
   124
      | pre_of (TFree ("'_dummy_", S)) idx = (Param (idx, S), idx + 1)
berghofe@32141
   125
      | pre_of (TFree v) idx = (PTFree v, idx)
berghofe@32141
   126
      | pre_of (T as Type (a, Ts)) idx =
berghofe@32141
   127
          if T = dummyT then (Param (idx, []), idx + 1)
berghofe@32141
   128
          else
berghofe@32141
   129
            let val (Ts', idx') = fold_map pre_of Ts idx
berghofe@32141
   130
            in (PType (a, Ts'), idx') end;
berghofe@32141
   131
berghofe@32141
   132
    val (ptyp, idx') = pre_of typ idx;
berghofe@32141
   133
  in (ptyp, (params', idx')) end;
wenzelm@2957
   134
wenzelm@2957
   135
wenzelm@20668
   136
(* preterm_of *)
wenzelm@2957
   137
wenzelm@39287
   138
fun preterm_of const_type tm (vparams, params, idx) =
wenzelm@2957
   139
  let
berghofe@32141
   140
    fun add_vparm xi (ps_idx as (ps, idx)) =
wenzelm@20735
   141
      if not (Vartab.defined ps xi) then
berghofe@32141
   142
        (Vartab.update (xi, Param (idx, [])) ps, idx + 1)
berghofe@32141
   143
      else ps_idx;
wenzelm@2957
   144
berghofe@32141
   145
    val (vparams', idx') = fold_aterms
wenzelm@20668
   146
      (fn Var (_, Type ("_polymorphic_", _)) => I
wenzelm@20668
   147
        | Var (xi, _) => add_vparm xi
wenzelm@20668
   148
        | Free (x, _) => add_vparm (x, ~1)
wenzelm@20668
   149
        | _ => I)
berghofe@32141
   150
      tm (vparams, idx);
wenzelm@20735
   151
    fun var_param xi = the (Vartab.lookup vparams' xi);
wenzelm@2957
   152
wenzelm@39287
   153
    fun polyT_of T idx = apsnd snd (pretyp_of (paramify_vars T) (Vartab.empty, idx));
wenzelm@2957
   154
wenzelm@22698
   155
    fun constraint T t ps =
wenzelm@20668
   156
      if T = dummyT then (t, ps)
wenzelm@2957
   157
      else
wenzelm@39287
   158
        let val (T', ps') = pretyp_of T ps
wenzelm@20668
   159
        in (Constraint (t, T'), ps') end;
wenzelm@2957
   160
berghofe@32141
   161
    fun pre_of (Const (c, T)) (ps, idx) =
wenzelm@2957
   162
          (case const_type c of
berghofe@32141
   163
            SOME U =>
berghofe@32141
   164
              let val (pU, idx') = polyT_of U idx
berghofe@32141
   165
              in constraint T (PConst (c, pU)) (ps, idx') end
wenzelm@39286
   166
          | NONE => raise TYPE ("Undeclared constant: " ^ quote c, [], []))
berghofe@32141
   167
      | pre_of (Var (xi, Type ("_polymorphic_", [T]))) (ps, idx) =
berghofe@32141
   168
          let val (pT, idx') = polyT_of T idx
berghofe@32141
   169
          in (PVar (xi, pT), (ps, idx')) end
berghofe@32141
   170
      | pre_of (Var (xi, T)) ps_idx = constraint T (PVar (xi, var_param xi)) ps_idx
berghofe@32141
   171
      | pre_of (Free (x, T)) ps_idx = constraint T (PFree (x, var_param (x, ~1))) ps_idx
berghofe@32141
   172
      | pre_of (Const ("_type_constraint_", Type ("fun", [T, _])) $ t) ps_idx =
berghofe@32141
   173
          pre_of t ps_idx |-> constraint T
berghofe@32141
   174
      | pre_of (Bound i) ps_idx = (PBound i, ps_idx)
berghofe@32141
   175
      | pre_of (Abs (x, T, t)) ps_idx =
wenzelm@2957
   176
          let
wenzelm@39287
   177
            val (T', ps_idx') = pretyp_of T ps_idx;
berghofe@32141
   178
            val (t', ps_idx'') = pre_of t ps_idx';
berghofe@32141
   179
          in (PAbs (x, T', t'), ps_idx'') end
berghofe@32141
   180
      | pre_of (t $ u) ps_idx =
wenzelm@2957
   181
          let
berghofe@32141
   182
            val (t', ps_idx') = pre_of t ps_idx;
berghofe@32141
   183
            val (u', ps_idx'') = pre_of u ps_idx';
berghofe@32141
   184
          in (PAppl (t', u'), ps_idx'') end;
wenzelm@2957
   185
berghofe@32141
   186
    val (tm', (params', idx'')) = pre_of tm (params, idx');
berghofe@32141
   187
  in (tm', (vparams', params', idx'')) end;
wenzelm@2957
   188
wenzelm@2957
   189
wenzelm@2957
   190
wenzelm@2957
   191
(** pretyps/terms to typs/terms **)
wenzelm@2957
   192
wenzelm@2957
   193
(* add_parms *)
wenzelm@2957
   194
wenzelm@32146
   195
fun add_parmsT tye T =
wenzelm@32146
   196
  (case deref tye T of
berghofe@32141
   197
    PType (_, Ts) => fold (add_parmsT tye) Ts
berghofe@32141
   198
  | Param (i, _) => insert (op =) i
wenzelm@32146
   199
  | _ => I);
wenzelm@2957
   200
berghofe@32141
   201
fun add_parms tye = fold_pretyps (add_parmsT tye);
wenzelm@2957
   202
wenzelm@2957
   203
wenzelm@2957
   204
(* add_names *)
wenzelm@2957
   205
wenzelm@32146
   206
fun add_namesT tye T =
wenzelm@32146
   207
  (case deref tye T of
berghofe@32141
   208
    PType (_, Ts) => fold (add_namesT tye) Ts
berghofe@32141
   209
  | PTFree (x, _) => Name.declare x
berghofe@32141
   210
  | PTVar ((x, _), _) => Name.declare x
wenzelm@32146
   211
  | Param _ => I);
wenzelm@2957
   212
berghofe@32141
   213
fun add_names tye = fold_pretyps (add_namesT tye);
wenzelm@2957
   214
wenzelm@2957
   215
wenzelm@2957
   216
(* simple_typ/term_of *)
wenzelm@2957
   217
wenzelm@32146
   218
fun simple_typ_of tye f T =
wenzelm@32146
   219
  (case deref tye T of
berghofe@32141
   220
    PType (a, Ts) => Type (a, map (simple_typ_of tye f) Ts)
berghofe@32141
   221
  | PTFree v => TFree v
berghofe@32141
   222
  | PTVar v => TVar v
wenzelm@32146
   223
  | Param (i, S) => TVar (f i, S));
wenzelm@2957
   224
wenzelm@2957
   225
(*convert types, drop constraints*)
berghofe@32141
   226
fun simple_term_of tye f (PConst (c, T)) = Const (c, simple_typ_of tye f T)
berghofe@32141
   227
  | simple_term_of tye f (PFree (x, T)) = Free (x, simple_typ_of tye f T)
berghofe@32141
   228
  | simple_term_of tye f (PVar (xi, T)) = Var (xi, simple_typ_of tye f T)
berghofe@32141
   229
  | simple_term_of tye f (PBound i) = Bound i
berghofe@32141
   230
  | simple_term_of tye f (PAbs (x, T, t)) =
berghofe@32141
   231
      Abs (x, simple_typ_of tye f T, simple_term_of tye f t)
berghofe@32141
   232
  | simple_term_of tye f (PAppl (t, u)) =
berghofe@32141
   233
      simple_term_of tye f t $ simple_term_of tye f u
berghofe@32141
   234
  | simple_term_of tye f (Constraint (t, _)) = simple_term_of tye f t;
wenzelm@2957
   235
wenzelm@2957
   236
berghofe@32141
   237
(* typs_terms_of *)
wenzelm@2957
   238
berghofe@32141
   239
fun typs_terms_of tye used maxidx (Ts, ts) =
wenzelm@2957
   240
  let
berghofe@32141
   241
    val used' = fold (add_names tye) ts (fold (add_namesT tye) Ts used);
berghofe@32141
   242
    val parms = rev (fold (add_parms tye) ts (fold (add_parmsT tye) Ts []));
wenzelm@27263
   243
    val names = Name.invents used' ("?" ^ Name.aT) (length parms);
berghofe@32141
   244
    val tab = Inttab.make (parms ~~ names);
berghofe@32141
   245
    fun f i = (the (Inttab.lookup tab i), maxidx + 1);
berghofe@32141
   246
  in (map (simple_typ_of tye f) Ts, map (simple_term_of tye f) ts) end;
wenzelm@2957
   247
wenzelm@2957
   248
wenzelm@2957
   249
berghofe@32141
   250
(** order-sorted unification of types **)
wenzelm@2957
   251
berghofe@32141
   252
exception NO_UNIFIER of string * pretyp Inttab.table;
wenzelm@2957
   253
wenzelm@19465
   254
fun unify pp tsig =
wenzelm@2957
   255
  let
wenzelm@2957
   256
    (* adjust sorts of parameters *)
wenzelm@2957
   257
wenzelm@19465
   258
    fun not_of_sort x S' S =
wenzelm@14828
   259
      "Variable " ^ x ^ "::" ^ Pretty.string_of_sort pp S' ^ " not of sort " ^
wenzelm@14828
   260
        Pretty.string_of_sort pp S;
wenzelm@2957
   261
berghofe@32141
   262
    fun meet (_, []) tye_idx = tye_idx
berghofe@32141
   263
      | meet (Param (i, S'), S) (tye_idx as (tye, idx)) =
berghofe@32141
   264
          if Type.subsort tsig (S', S) then tye_idx
berghofe@32141
   265
          else (Inttab.update_new (i,
berghofe@32141
   266
            Param (idx, Type.inter_sort tsig (S', S))) tye, idx + 1)
berghofe@32141
   267
      | meet (PType (a, Ts), S) (tye_idx as (tye, _)) =
berghofe@32141
   268
          meets (Ts, Type.arity_sorts pp tsig a S
berghofe@32141
   269
            handle ERROR msg => raise NO_UNIFIER (msg, tye)) tye_idx
berghofe@32141
   270
      | meet (PTFree (x, S'), S) (tye_idx as (tye, _)) =
berghofe@32141
   271
          if Type.subsort tsig (S', S) then tye_idx
berghofe@32141
   272
          else raise NO_UNIFIER (not_of_sort x S' S, tye)
berghofe@32141
   273
      | meet (PTVar (xi, S'), S) (tye_idx as (tye, _)) =
berghofe@32141
   274
          if Type.subsort tsig (S', S) then tye_idx
berghofe@32141
   275
          else raise NO_UNIFIER (not_of_sort (Term.string_of_vname xi) S' S, tye)
berghofe@32141
   276
    and meets (T :: Ts, S :: Ss) (tye_idx as (tye, _)) =
berghofe@32141
   277
          meets (Ts, Ss) (meet (deref tye T, S) tye_idx)
berghofe@32141
   278
      | meets _ tye_idx = tye_idx;
wenzelm@2957
   279
wenzelm@2957
   280
wenzelm@35013
   281
    (* occurs check and assignment *)
wenzelm@2957
   282
berghofe@32141
   283
    fun occurs_check tye i (Param (i', S)) =
berghofe@32141
   284
          if i = i' then raise NO_UNIFIER ("Occurs check!", tye)
wenzelm@32146
   285
          else
wenzelm@32146
   286
            (case Inttab.lookup tye i' of
berghofe@32141
   287
              NONE => ()
berghofe@32141
   288
            | SOME T => occurs_check tye i T)
berghofe@32141
   289
      | occurs_check tye i (PType (_, Ts)) = List.app (occurs_check tye i) Ts
berghofe@32141
   290
      | occurs_check _ _ _ = ();
wenzelm@2957
   291
berghofe@37235
   292
    fun assign i (T as Param (i', _)) S tye_idx =
berghofe@32141
   293
          if i = i' then tye_idx
berghofe@37235
   294
          else tye_idx |> meet (T, S) |>> Inttab.update_new (i, T)
berghofe@37235
   295
      | assign i T S (tye_idx as (tye, _)) =
berghofe@37235
   296
          (occurs_check tye i T; tye_idx |> meet (T, S) |>> Inttab.update_new (i, T));
wenzelm@2957
   297
wenzelm@2957
   298
wenzelm@2957
   299
    (* unification *)
wenzelm@2957
   300
wenzelm@39286
   301
    fun show_tycon (a, Ts) =
wenzelm@39286
   302
      quote (Pretty.string_of_typ pp (Type (a, replicate (length Ts) dummyT)));
wenzelm@39286
   303
wenzelm@32146
   304
    fun unif (T1, T2) (tye_idx as (tye, idx)) =
wenzelm@32146
   305
      (case (deref tye T1, deref tye T2) of
berghofe@32141
   306
        (Param (i, S), T) => assign i T S tye_idx
berghofe@32141
   307
      | (T, Param (i, S)) => assign i T S tye_idx
berghofe@32141
   308
      | (PType (a, Ts), PType (b, Us)) =>
wenzelm@2979
   309
          if a <> b then
wenzelm@39286
   310
            raise NO_UNIFIER
wenzelm@39286
   311
              ("Clash of types " ^ show_tycon (a, Ts) ^ " and " ^ show_tycon (b, Us), tye)
berghofe@32141
   312
          else fold unif (Ts ~~ Us) tye_idx
wenzelm@32146
   313
      | (T, U) => if T = U then tye_idx else raise NO_UNIFIER ("", tye));
wenzelm@2957
   314
wenzelm@2957
   315
  in unif end;
wenzelm@2957
   316
wenzelm@2957
   317
wenzelm@2957
   318
wenzelm@2957
   319
(** type inference **)
wenzelm@2957
   320
wenzelm@22698
   321
(* appl_error *)
wenzelm@22698
   322
wenzelm@14828
   323
fun appl_error pp why t T u U =
wenzelm@8087
   324
 ["Type error in application: " ^ why,
wenzelm@8087
   325
  "",
wenzelm@8087
   326
  Pretty.string_of (Pretty.block
wenzelm@14828
   327
    [Pretty.str "Operator:", Pretty.brk 2, Pretty.term pp t,
wenzelm@14828
   328
      Pretty.str " ::", Pretty.brk 1, Pretty.typ pp T]),
wenzelm@8087
   329
  Pretty.string_of (Pretty.block
wenzelm@14828
   330
    [Pretty.str "Operand:", Pretty.brk 3, Pretty.term pp u,
wenzelm@14828
   331
      Pretty.str " ::", Pretty.brk 1, Pretty.typ pp U]),
wenzelm@8087
   332
  ""];
wenzelm@8087
   333
nipkow@5635
   334
berghofe@32141
   335
(* infer *)
wenzelm@2957
   336
wenzelm@19465
   337
fun infer pp tsig =
wenzelm@2957
   338
  let
wenzelm@2979
   339
    (* errors *)
wenzelm@2957
   340
wenzelm@2979
   341
    fun unif_failed msg =
wenzelm@14828
   342
      "Type unification failed" ^ (if msg = "" then "" else ": " ^ msg) ^ "\n";
wenzelm@2979
   343
berghofe@32141
   344
    fun prep_output tye bs ts Ts =
wenzelm@2957
   345
      let
berghofe@32141
   346
        val (Ts_bTs', ts') = typs_terms_of tye Name.context ~1 (Ts @ map snd bs, ts);
wenzelm@19012
   347
        val (Ts', Ts'') = chop (length Ts) Ts_bTs';
wenzelm@27263
   348
        fun prep t =
wenzelm@27263
   349
          let val xs = rev (Term.variant_frees t (rev (map fst bs ~~ Ts'')))
wenzelm@27263
   350
          in Term.subst_bounds (map Syntax.mark_boundT xs, t) end;
wenzelm@27263
   351
      in (map prep ts', Ts') end;
wenzelm@2979
   352
wenzelm@2979
   353
    fun err_loose i =
wenzelm@3784
   354
      raise TYPE ("Loose bound variable: B." ^ string_of_int i, [], []);
wenzelm@2979
   355
berghofe@32141
   356
    fun err_appl msg tye bs t T u U =
wenzelm@2979
   357
      let
berghofe@32141
   358
        val ([t', u'], [T', U']) = prep_output tye bs [t, u] [T, U];
wenzelm@3510
   359
        val why =
wenzelm@3510
   360
          (case T' of
wenzelm@14828
   361
            Type ("fun", _) => "Incompatible operand type"
wenzelm@14828
   362
          | _ => "Operator not of function type");
wenzelm@14828
   363
        val text = unif_failed msg ^ cat_lines (appl_error pp why t' T' u' U');
wenzelm@3784
   364
      in raise TYPE (text, [T', U'], [t', u']) end;
wenzelm@2979
   365
berghofe@32141
   366
    fun err_constraint msg tye bs t T U =
wenzelm@2979
   367
      let
berghofe@32141
   368
        val ([t'], [T', U']) = prep_output tye bs [t] [T, U];
wenzelm@2979
   369
        val text = cat_lines
wenzelm@2979
   370
         [unif_failed msg,
nipkow@5635
   371
          "Cannot meet type constraint:", "",
wenzelm@14828
   372
          Pretty.string_of (Pretty.block
wenzelm@14828
   373
           [Pretty.str "Term:", Pretty.brk 2, Pretty.term pp t',
wenzelm@14828
   374
            Pretty.str " ::", Pretty.brk 1, Pretty.typ pp T']),
wenzelm@14828
   375
          Pretty.string_of (Pretty.block
wenzelm@14828
   376
           [Pretty.str "Type:", Pretty.brk 2, Pretty.typ pp U']), ""];
wenzelm@3784
   377
      in raise TYPE (text, [T', U'], [t']) end;
wenzelm@2979
   378
wenzelm@2979
   379
wenzelm@2979
   380
    (* main *)
wenzelm@2979
   381
wenzelm@19465
   382
    val unif = unify pp tsig;
wenzelm@2957
   383
berghofe@32141
   384
    fun inf _ (PConst (_, T)) tye_idx = (T, tye_idx)
berghofe@32141
   385
      | inf _ (PFree (_, T)) tye_idx = (T, tye_idx)
berghofe@32141
   386
      | inf _ (PVar (_, T)) tye_idx = (T, tye_idx)
berghofe@32141
   387
      | inf bs (PBound i) tye_idx =
berghofe@32141
   388
          (snd (nth bs i handle Subscript => err_loose i), tye_idx)
berghofe@32141
   389
      | inf bs (PAbs (x, T, t)) tye_idx =
berghofe@32141
   390
          let val (U, tye_idx') = inf ((x, T) :: bs) t tye_idx
berghofe@32141
   391
          in (PType ("fun", [T, U]), tye_idx') end
berghofe@32141
   392
      | inf bs (PAppl (t, u)) tye_idx =
wenzelm@2957
   393
          let
berghofe@32141
   394
            val (T, tye_idx') = inf bs t tye_idx;
berghofe@32141
   395
            val (U, (tye, idx)) = inf bs u tye_idx';
berghofe@32141
   396
            val V = Param (idx, []);
wenzelm@2957
   397
            val U_to_V = PType ("fun", [U, V]);
berghofe@32141
   398
            val tye_idx'' = unif (U_to_V, T) (tye, idx + 1)
berghofe@32141
   399
              handle NO_UNIFIER (msg, tye') => err_appl msg tye' bs t T u U;
berghofe@32141
   400
          in (V, tye_idx'') end
berghofe@32141
   401
      | inf bs (Constraint (t, U)) tye_idx =
berghofe@32141
   402
          let val (T, tye_idx') = inf bs t tye_idx in
berghofe@32141
   403
            (T,
berghofe@32141
   404
             unif (T, U) tye_idx'
wenzelm@32146
   405
               handle NO_UNIFIER (msg, tye) => err_constraint msg tye bs t T U)
wenzelm@2957
   406
          end;
wenzelm@2957
   407
wenzelm@2957
   408
  in inf [] end;
wenzelm@2957
   409
wenzelm@2957
   410
wenzelm@22698
   411
(* infer_types *)
wenzelm@2957
   412
wenzelm@27263
   413
fun infer_types pp tsig check_typs const_type var_type used maxidx raw_ts =
wenzelm@2957
   414
  let
wenzelm@22698
   415
    (*constrain vars*)
wenzelm@22698
   416
    val get_type = the_default dummyT o var_type;
wenzelm@22698
   417
    val constrain_vars = Term.map_aterms
wenzelm@39288
   418
      (fn Free (x, T) => Type.constraint T (Free (x, get_type (x, ~1)))
wenzelm@39288
   419
        | Var (xi, T) => Type.constraint T (Var (xi, get_type xi))
wenzelm@22698
   420
        | t => t);
wenzelm@22698
   421
wenzelm@27263
   422
    (*convert to preterms*)
wenzelm@27263
   423
    val ts = burrow_types check_typs raw_ts;
berghofe@32141
   424
    val (ts', (_, _, idx)) =
wenzelm@39287
   425
      fold_map (preterm_of const_type o constrain_vars) ts
berghofe@32141
   426
      (Vartab.empty, Vartab.empty, 0);
wenzelm@2957
   427
wenzelm@27263
   428
    (*do type inference*)
berghofe@32141
   429
    val (tye, _) = fold (snd oo infer pp tsig) ts' (Inttab.empty, idx);
berghofe@32141
   430
  in #2 (typs_terms_of tye used maxidx ([], ts')) end;
wenzelm@14788
   431
wenzelm@2957
   432
end;