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