src/Tools/subtyping.ML
author traytel
Tue Dec 21 01:12:14 2010 +0100 (2010-12-21)
changeset 41353 684003dbda54
parent 40939 2c150063cd4d
child 42284 326f57825e1a
permissions -rw-r--r--
Enabled non fully polymorphic map functions in subtyping
wenzelm@40281
     1
(*  Title:      Tools/subtyping.ML
wenzelm@40281
     2
    Author:     Dmitriy Traytel, TU Muenchen
wenzelm@40281
     3
wenzelm@40281
     4
Coercive subtyping via subtype constraints.
wenzelm@40281
     5
*)
wenzelm@40281
     6
wenzelm@40281
     7
signature SUBTYPING =
wenzelm@40281
     8
sig
traytel@41353
     9
  datatype variance = COVARIANT | CONTRAVARIANT | INVARIANT | INVARIANT_TO of typ;
wenzelm@40939
    10
  val coercion_enabled: bool Config.T
wenzelm@40281
    11
  val infer_types: Proof.context -> (string -> typ option) -> (indexname -> typ option) ->
wenzelm@40281
    12
    term list -> term list
wenzelm@40284
    13
  val add_type_map: term -> Context.generic -> Context.generic
wenzelm@40284
    14
  val add_coercion: term -> Context.generic -> Context.generic
traytel@40836
    15
  val gen_coercion: Proof.context -> typ Vartab.table -> (typ * typ) -> term
wenzelm@40283
    16
  val setup: theory -> theory
wenzelm@40281
    17
end;
wenzelm@40281
    18
wenzelm@40283
    19
structure Subtyping: SUBTYPING =
wenzelm@40281
    20
struct
wenzelm@40281
    21
wenzelm@40281
    22
(** coercions data **)
wenzelm@40281
    23
traytel@41353
    24
datatype variance = COVARIANT | CONTRAVARIANT | INVARIANT | INVARIANT_TO of typ;
wenzelm@40281
    25
wenzelm@40281
    26
datatype data = Data of
wenzelm@40282
    27
  {coes: term Symreltab.table,  (*coercions table*)
wenzelm@40282
    28
   coes_graph: unit Graph.T,  (*coercions graph*)
wenzelm@40282
    29
   tmaps: (term * variance list) Symtab.table};  (*map functions*)
wenzelm@40281
    30
wenzelm@40281
    31
fun make_data (coes, coes_graph, tmaps) =
wenzelm@40281
    32
  Data {coes = coes, coes_graph = coes_graph, tmaps = tmaps};
wenzelm@40281
    33
wenzelm@40281
    34
structure Data = Generic_Data
wenzelm@40281
    35
(
wenzelm@40281
    36
  type T = data;
wenzelm@40281
    37
  val empty = make_data (Symreltab.empty, Graph.empty, Symtab.empty);
wenzelm@40281
    38
  val extend = I;
wenzelm@40281
    39
  fun merge
wenzelm@40281
    40
    (Data {coes = coes1, coes_graph = coes_graph1, tmaps = tmaps1},
wenzelm@40281
    41
      Data {coes = coes2, coes_graph = coes_graph2, tmaps = tmaps2}) =
wenzelm@40281
    42
    make_data (Symreltab.merge (op aconv) (coes1, coes2),
wenzelm@40281
    43
      Graph.merge (op =) (coes_graph1, coes_graph2),
wenzelm@40281
    44
      Symtab.merge (eq_pair (op aconv) (op =)) (tmaps1, tmaps2));
wenzelm@40281
    45
);
wenzelm@40281
    46
wenzelm@40281
    47
fun map_data f =
wenzelm@40281
    48
  Data.map (fn Data {coes, coes_graph, tmaps} =>
wenzelm@40281
    49
    make_data (f (coes, coes_graph, tmaps)));
wenzelm@40281
    50
wenzelm@40281
    51
fun map_coes f =
wenzelm@40281
    52
  map_data (fn (coes, coes_graph, tmaps) =>
wenzelm@40281
    53
    (f coes, coes_graph, tmaps));
wenzelm@40281
    54
wenzelm@40281
    55
fun map_coes_graph f =
wenzelm@40281
    56
  map_data (fn (coes, coes_graph, tmaps) =>
wenzelm@40281
    57
    (coes, f coes_graph, tmaps));
wenzelm@40281
    58
wenzelm@40281
    59
fun map_coes_and_graph f =
wenzelm@40281
    60
  map_data (fn (coes, coes_graph, tmaps) =>
wenzelm@40281
    61
    let val (coes', coes_graph') = f (coes, coes_graph);
wenzelm@40281
    62
    in (coes', coes_graph', tmaps) end);
wenzelm@40281
    63
wenzelm@40281
    64
fun map_tmaps f =
wenzelm@40281
    65
  map_data (fn (coes, coes_graph, tmaps) =>
wenzelm@40281
    66
    (coes, coes_graph, f tmaps));
wenzelm@40281
    67
wenzelm@40285
    68
val rep_data = (fn Data args => args) o Data.get o Context.Proof;
wenzelm@40281
    69
wenzelm@40281
    70
val coes_of = #coes o rep_data;
wenzelm@40281
    71
val coes_graph_of = #coes_graph o rep_data;
wenzelm@40281
    72
val tmaps_of = #tmaps o rep_data;
wenzelm@40281
    73
wenzelm@40281
    74
wenzelm@40281
    75
wenzelm@40281
    76
(** utils **)
wenzelm@40281
    77
wenzelm@40281
    78
fun nameT (Type (s, [])) = s;
wenzelm@40281
    79
fun t_of s = Type (s, []);
wenzelm@40286
    80
wenzelm@40281
    81
fun sort_of (TFree (_, S)) = SOME S
wenzelm@40281
    82
  | sort_of (TVar (_, S)) = SOME S
wenzelm@40281
    83
  | sort_of _ = NONE;
wenzelm@40281
    84
wenzelm@40281
    85
val is_typeT = fn (Type _) => true | _ => false;
traytel@41353
    86
val is_stypeT = fn (Type (_, [])) => true | _ => false;
wenzelm@40282
    87
val is_compT = fn (Type (_, _ :: _)) => true | _ => false;
wenzelm@40281
    88
val is_freeT = fn (TFree _) => true | _ => false;
wenzelm@40286
    89
val is_fixedvarT = fn (TVar (xi, _)) => not (Type_Infer.is_param xi) | _ => false;
traytel@41353
    90
val is_funtype = fn (Type ("fun", [_, _])) => true | _ => false;
wenzelm@40281
    91
wenzelm@40281
    92
traytel@40836
    93
(* unification *)
wenzelm@40281
    94
traytel@40836
    95
exception TYPE_INFERENCE_ERROR of unit -> string;
wenzelm@40281
    96
exception NO_UNIFIER of string * typ Vartab.table;
wenzelm@40281
    97
wenzelm@40281
    98
fun unify weak ctxt =
wenzelm@40281
    99
  let
wenzelm@40281
   100
    val thy = ProofContext.theory_of ctxt;
wenzelm@40281
   101
    val pp = Syntax.pp ctxt;
wenzelm@40281
   102
    val arity_sorts = Type.arity_sorts pp (Sign.tsig_of thy);
wenzelm@40281
   103
wenzelm@40282
   104
wenzelm@40281
   105
    (* adjust sorts of parameters *)
wenzelm@40281
   106
wenzelm@40281
   107
    fun not_of_sort x S' S =
wenzelm@40281
   108
      "Variable " ^ x ^ "::" ^ Syntax.string_of_sort ctxt S' ^ " not of sort " ^
wenzelm@40281
   109
        Syntax.string_of_sort ctxt S;
wenzelm@40281
   110
wenzelm@40281
   111
    fun meet (_, []) tye_idx = tye_idx
wenzelm@40281
   112
      | meet (Type (a, Ts), S) (tye_idx as (tye, _)) =
wenzelm@40281
   113
          meets (Ts, arity_sorts a S handle ERROR msg => raise NO_UNIFIER (msg, tye)) tye_idx
wenzelm@40281
   114
      | meet (TFree (x, S'), S) (tye_idx as (tye, _)) =
wenzelm@40281
   115
          if Sign.subsort thy (S', S) then tye_idx
wenzelm@40281
   116
          else raise NO_UNIFIER (not_of_sort x S' S, tye)
wenzelm@40281
   117
      | meet (TVar (xi, S'), S) (tye_idx as (tye, idx)) =
wenzelm@40281
   118
          if Sign.subsort thy (S', S) then tye_idx
wenzelm@40281
   119
          else if Type_Infer.is_param xi then
wenzelm@40286
   120
            (Vartab.update_new
wenzelm@40286
   121
              (xi, Type_Infer.mk_param idx (Sign.inter_sort thy (S', S))) tye, idx + 1)
wenzelm@40281
   122
          else raise NO_UNIFIER (not_of_sort (Term.string_of_vname xi) S' S, tye)
wenzelm@40281
   123
    and meets (T :: Ts, S :: Ss) (tye_idx as (tye, _)) =
wenzelm@40286
   124
          meets (Ts, Ss) (meet (Type_Infer.deref tye T, S) tye_idx)
wenzelm@40281
   125
      | meets _ tye_idx = tye_idx;
wenzelm@40281
   126
wenzelm@40281
   127
    val weak_meet = if weak then fn _ => I else meet
wenzelm@40281
   128
wenzelm@40281
   129
wenzelm@40281
   130
    (* occurs check and assignment *)
wenzelm@40281
   131
wenzelm@40281
   132
    fun occurs_check tye xi (TVar (xi', _)) =
wenzelm@40281
   133
          if xi = xi' then raise NO_UNIFIER ("Occurs check!", tye)
wenzelm@40281
   134
          else
wenzelm@40281
   135
            (case Vartab.lookup tye xi' of
wenzelm@40281
   136
              NONE => ()
wenzelm@40281
   137
            | SOME T => occurs_check tye xi T)
wenzelm@40281
   138
      | occurs_check tye xi (Type (_, Ts)) = List.app (occurs_check tye xi) Ts
wenzelm@40281
   139
      | occurs_check _ _ _ = ();
wenzelm@40281
   140
wenzelm@40281
   141
    fun assign xi (T as TVar (xi', _)) S env =
wenzelm@40281
   142
          if xi = xi' then env
wenzelm@40281
   143
          else env |> weak_meet (T, S) |>> Vartab.update_new (xi, T)
wenzelm@40281
   144
      | assign xi T S (env as (tye, _)) =
wenzelm@40281
   145
          (occurs_check tye xi T; env |> weak_meet (T, S) |>> Vartab.update_new (xi, T));
wenzelm@40281
   146
wenzelm@40281
   147
wenzelm@40281
   148
    (* unification *)
wenzelm@40281
   149
wenzelm@40281
   150
    fun show_tycon (a, Ts) =
wenzelm@40281
   151
      quote (Syntax.string_of_typ ctxt (Type (a, replicate (length Ts) dummyT)));
wenzelm@40281
   152
wenzelm@40281
   153
    fun unif (T1, T2) (env as (tye, _)) =
wenzelm@40286
   154
      (case pairself (`Type_Infer.is_paramT o Type_Infer.deref tye) (T1, T2) of
wenzelm@40281
   155
        ((true, TVar (xi, S)), (_, T)) => assign xi T S env
wenzelm@40281
   156
      | ((_, T), (true, TVar (xi, S))) => assign xi T S env
wenzelm@40281
   157
      | ((_, Type (a, Ts)), (_, Type (b, Us))) =>
wenzelm@40281
   158
          if weak andalso null Ts andalso null Us then env
wenzelm@40281
   159
          else if a <> b then
wenzelm@40281
   160
            raise NO_UNIFIER
wenzelm@40281
   161
              ("Clash of types " ^ show_tycon (a, Ts) ^ " and " ^ show_tycon (b, Us), tye)
wenzelm@40281
   162
          else fold unif (Ts ~~ Us) env
wenzelm@40281
   163
      | ((_, T), (_, U)) => if T = U then env else raise NO_UNIFIER ("", tye));
wenzelm@40281
   164
wenzelm@40281
   165
  in unif end;
wenzelm@40281
   166
wenzelm@40281
   167
val weak_unify = unify true;
wenzelm@40281
   168
val strong_unify = unify false;
wenzelm@40281
   169
wenzelm@40281
   170
wenzelm@40281
   171
(* Typ_Graph shortcuts *)
wenzelm@40281
   172
wenzelm@40281
   173
val add_edge = Typ_Graph.add_edge_acyclic;
wenzelm@40281
   174
fun get_preds G T = Typ_Graph.all_preds G [T];
wenzelm@40281
   175
fun get_succs G T = Typ_Graph.all_succs G [T];
wenzelm@40281
   176
fun maybe_new_typnode T G = perhaps (try (Typ_Graph.new_node (T, ()))) G;
wenzelm@40281
   177
fun maybe_new_typnodes Ts G = fold maybe_new_typnode Ts G;
wenzelm@40282
   178
fun new_imm_preds G Ts =
wenzelm@40281
   179
  subtract (op =) Ts (distinct (op =) (maps (Typ_Graph.imm_preds G) Ts));
wenzelm@40282
   180
fun new_imm_succs G Ts =
wenzelm@40281
   181
  subtract op= Ts (distinct (op =) (maps (Typ_Graph.imm_succs G) Ts));
wenzelm@40281
   182
wenzelm@40281
   183
wenzelm@40281
   184
(* Graph shortcuts *)
wenzelm@40281
   185
wenzelm@40281
   186
fun maybe_new_node s G = perhaps (try (Graph.new_node (s, ()))) G
wenzelm@40281
   187
fun maybe_new_nodes ss G = fold maybe_new_node ss G
wenzelm@40281
   188
wenzelm@40281
   189
wenzelm@40281
   190
wenzelm@40281
   191
(** error messages **)
wenzelm@40281
   192
traytel@40836
   193
fun gen_msg err msg = 
traytel@40836
   194
  err () ^ "\nNow trying to infer coercions:\n\nCoercion inference failed" ^ 
traytel@40836
   195
  (if msg = "" then "" else ": " ^ msg) ^ "\n";
traytel@40836
   196
wenzelm@40281
   197
fun prep_output ctxt tye bs ts Ts =
wenzelm@40281
   198
  let
wenzelm@40281
   199
    val (Ts_bTs', ts') = Type_Infer.finish ctxt tye (Ts @ map snd bs, ts);
wenzelm@40281
   200
    val (Ts', Ts'') = chop (length Ts) Ts_bTs';
wenzelm@40281
   201
    fun prep t =
wenzelm@40281
   202
      let val xs = rev (Term.variant_frees t (rev (map fst bs ~~ Ts'')))
wenzelm@40281
   203
      in Term.subst_bounds (map Syntax.mark_boundT xs, t) end;
wenzelm@40281
   204
  in (map prep ts', Ts') end;
wenzelm@40281
   205
wenzelm@40281
   206
fun err_loose i = error ("Loose bound variable: B." ^ string_of_int i);
traytel@40836
   207
  
traytel@40836
   208
fun unif_failed msg =
traytel@40836
   209
  "Type unification failed" ^ (if msg = "" then "" else ": " ^ msg) ^ "\n\n";
traytel@40836
   210
  
traytel@40836
   211
fun err_appl_msg ctxt msg tye bs t T u U () =
traytel@40836
   212
  let val ([t', u'], [T', U']) = prep_output ctxt tye bs [t, u] [T, U]
traytel@40836
   213
  in unif_failed msg ^ Type.appl_error (Syntax.pp ctxt) t' T' u' U' ^ "\n" end;
wenzelm@40281
   214
wenzelm@40281
   215
fun err_list ctxt msg tye Ts =
wenzelm@40281
   216
  let
wenzelm@40281
   217
    val (_, Ts') = prep_output ctxt tye [] [] Ts;
traytel@40836
   218
    val text = cat_lines ([msg,
traytel@40836
   219
      "Cannot unify a list of types that should be the same:",
wenzelm@40281
   220
      (Pretty.string_of (Pretty.list "[" "]" (map (Pretty.typ (Syntax.pp ctxt)) Ts')))]);
wenzelm@40281
   221
  in
wenzelm@40281
   222
    error text
wenzelm@40281
   223
  end;
wenzelm@40281
   224
wenzelm@40281
   225
fun err_bound ctxt msg tye packs =
wenzelm@40281
   226
  let
wenzelm@40281
   227
    val pp = Syntax.pp ctxt;
wenzelm@40281
   228
    val (ts, Ts) = fold
wenzelm@40281
   229
      (fn (bs, t $ u, U, _, U') => fn (ts, Ts) =>
traytel@40836
   230
        let val (t', T') = prep_output ctxt tye bs [t, u] [U', U]
wenzelm@40282
   231
        in (t' :: ts, T' :: Ts) end)
wenzelm@40281
   232
      packs ([], []);
traytel@40836
   233
    val text = cat_lines ([msg, "Cannot fulfil subtype constraints:"] @
wenzelm@40281
   234
        (map2 (fn [t, u] => fn [T, U] => Pretty.string_of (
wenzelm@40281
   235
          Pretty.block [
wenzelm@40281
   236
            Pretty.typ pp T, Pretty.brk 2, Pretty.str "<:", Pretty.brk 2, Pretty.typ pp U,
wenzelm@40281
   237
            Pretty.brk 3, Pretty.str "from function application", Pretty.brk 2,
traytel@40836
   238
            Pretty.block [Pretty.term pp (t $ u)]]))
wenzelm@40281
   239
        ts Ts))
wenzelm@40281
   240
  in
wenzelm@40281
   241
    error text
wenzelm@40281
   242
  end;
wenzelm@40281
   243
wenzelm@40281
   244
wenzelm@40281
   245
wenzelm@40281
   246
(** constraint generation **)
wenzelm@40281
   247
traytel@40836
   248
fun generate_constraints ctxt err =
wenzelm@40281
   249
  let
wenzelm@40281
   250
    fun gen cs _ (Const (_, T)) tye_idx = (T, tye_idx, cs)
wenzelm@40281
   251
      | gen cs _ (Free (_, T)) tye_idx = (T, tye_idx, cs)
wenzelm@40281
   252
      | gen cs _ (Var (_, T)) tye_idx = (T, tye_idx, cs)
wenzelm@40281
   253
      | gen cs bs (Bound i) tye_idx =
wenzelm@40281
   254
          (snd (nth bs i handle Subscript => err_loose i), tye_idx, cs)
wenzelm@40281
   255
      | gen cs bs (Abs (x, T, t)) tye_idx =
wenzelm@40281
   256
          let val (U, tye_idx', cs') = gen cs ((x, T) :: bs) t tye_idx
wenzelm@40281
   257
          in (T --> U, tye_idx', cs') end
wenzelm@40281
   258
      | gen cs bs (t $ u) tye_idx =
wenzelm@40281
   259
          let
wenzelm@40281
   260
            val (T, tye_idx', cs') = gen cs bs t tye_idx;
wenzelm@40281
   261
            val (U', (tye, idx), cs'') = gen cs' bs u tye_idx';
wenzelm@40286
   262
            val U = Type_Infer.mk_param idx [];
wenzelm@40286
   263
            val V = Type_Infer.mk_param (idx + 1) [];
wenzelm@40281
   264
            val tye_idx''= strong_unify ctxt (U --> V, T) (tye, idx + 2)
traytel@41353
   265
              handle NO_UNIFIER (msg, _) => error (gen_msg err msg);
wenzelm@40281
   266
            val error_pack = (bs, t $ u, U, V, U');
wenzelm@40281
   267
          in (V, tye_idx'', ((U', U), error_pack) :: cs'') end;
wenzelm@40281
   268
  in
wenzelm@40281
   269
    gen [] []
wenzelm@40281
   270
  end;
wenzelm@40281
   271
wenzelm@40281
   272
wenzelm@40281
   273
wenzelm@40281
   274
(** constraint resolution **)
wenzelm@40281
   275
wenzelm@40281
   276
exception BOUND_ERROR of string;
wenzelm@40281
   277
traytel@40836
   278
fun process_constraints ctxt err cs tye_idx =
wenzelm@40281
   279
  let
wenzelm@40285
   280
    val coes_graph = coes_graph_of ctxt;
wenzelm@40285
   281
    val tmaps = tmaps_of ctxt;
wenzelm@40281
   282
    val tsig = Sign.tsig_of (ProofContext.theory_of ctxt);
wenzelm@40281
   283
    val pp = Syntax.pp ctxt;
wenzelm@40281
   284
    val arity_sorts = Type.arity_sorts pp tsig;
wenzelm@40281
   285
    val subsort = Type.subsort tsig;
wenzelm@40281
   286
wenzelm@40281
   287
    fun split_cs _ [] = ([], [])
wenzelm@40282
   288
      | split_cs f (c :: cs) =
wenzelm@40281
   289
          (case pairself f (fst c) of
wenzelm@40281
   290
            (false, false) => apsnd (cons c) (split_cs f cs)
wenzelm@40281
   291
          | _ => apfst (cons c) (split_cs f cs));
traytel@41353
   292
          
traytel@41353
   293
    fun unify_list (T :: Ts) tye_idx =
traytel@41353
   294
      fold (fn U => fn tye_idx' => strong_unify ctxt (T, U) tye_idx') Ts tye_idx;      
wenzelm@40281
   295
wenzelm@40282
   296
wenzelm@40281
   297
    (* check whether constraint simplification will terminate using weak unification *)
wenzelm@40282
   298
traytel@41353
   299
    val _ = fold (fn (TU, _) => fn tye_idx =>
traytel@41353
   300
      weak_unify ctxt TU tye_idx handle NO_UNIFIER (msg, _) =>
traytel@40836
   301
        error (gen_msg err ("weak unification of subtype constraints fails\n" ^ msg))) cs tye_idx;
wenzelm@40281
   302
wenzelm@40281
   303
wenzelm@40281
   304
    (* simplify constraints *)
wenzelm@40282
   305
wenzelm@40281
   306
    fun simplify_constraints cs tye_idx =
wenzelm@40281
   307
      let
wenzelm@40281
   308
        fun contract a Ts Us error_pack done todo tye idx =
wenzelm@40281
   309
          let
wenzelm@40281
   310
            val arg_var =
wenzelm@40281
   311
              (case Symtab.lookup tmaps a of
wenzelm@40281
   312
                (*everything is invariant for unknown constructors*)
wenzelm@40281
   313
                NONE => replicate (length Ts) INVARIANT
wenzelm@40281
   314
              | SOME av => snd av);
wenzelm@40281
   315
            fun new_constraints (variance, constraint) (cs, tye_idx) =
wenzelm@40281
   316
              (case variance of
wenzelm@40281
   317
                COVARIANT => (constraint :: cs, tye_idx)
wenzelm@40281
   318
              | CONTRAVARIANT => (swap constraint :: cs, tye_idx)
traytel@41353
   319
              | INVARIANT_TO T => (cs, unify_list [T, fst constraint, snd constraint] tye_idx
traytel@41353
   320
                  handle NO_UNIFIER (msg, _) => 
traytel@41353
   321
                    err_list ctxt (gen_msg err 
traytel@41353
   322
                      "failed to unify invariant arguments w.r.t. to the known map function") 
traytel@41353
   323
                      (fst tye_idx) Ts)
wenzelm@40281
   324
              | INVARIANT => (cs, strong_unify ctxt constraint tye_idx
traytel@41353
   325
                  handle NO_UNIFIER (msg, _) => 
traytel@41353
   326
                    error (gen_msg err ("failed to unify invariant arguments" ^ msg))));
wenzelm@40281
   327
            val (new, (tye', idx')) = apfst (fn cs => (cs ~~ replicate (length cs) error_pack))
wenzelm@40281
   328
              (fold new_constraints (arg_var ~~ (Ts ~~ Us)) ([], (tye, idx)));
wenzelm@40281
   329
            val test_update = is_compT orf is_freeT orf is_fixedvarT;
wenzelm@40281
   330
            val (ch, done') =
wenzelm@40286
   331
              if not (null new) then ([], done)
wenzelm@40286
   332
              else split_cs (test_update o Type_Infer.deref tye') done;
wenzelm@40281
   333
            val todo' = ch @ todo;
wenzelm@40281
   334
          in
wenzelm@40281
   335
            simplify done' (new @ todo') (tye', idx')
wenzelm@40281
   336
          end
wenzelm@40281
   337
        (*xi is definitely a parameter*)
wenzelm@40281
   338
        and expand varleq xi S a Ts error_pack done todo tye idx =
wenzelm@40281
   339
          let
wenzelm@40281
   340
            val n = length Ts;
wenzelm@40286
   341
            val args = map2 Type_Infer.mk_param (idx upto idx + n - 1) (arity_sorts a S);
wenzelm@40281
   342
            val tye' = Vartab.update_new (xi, Type(a, args)) tye;
wenzelm@40286
   343
            val (ch, done') = split_cs (is_compT o Type_Infer.deref tye') done;
wenzelm@40281
   344
            val todo' = ch @ todo;
wenzelm@40281
   345
            val new =
wenzelm@40281
   346
              if varleq then (Type(a, args), Type (a, Ts))
wenzelm@40286
   347
              else (Type (a, Ts), Type (a, args));
wenzelm@40281
   348
          in
wenzelm@40281
   349
            simplify done' ((new, error_pack) :: todo') (tye', idx + n)
wenzelm@40281
   350
          end
wenzelm@40281
   351
        (*TU is a pair of a parameter and a free/fixed variable*)
traytel@41353
   352
        and eliminate TU done todo tye idx =
wenzelm@40281
   353
          let
wenzelm@40286
   354
            val [TVar (xi, S)] = filter Type_Infer.is_paramT TU;
wenzelm@40286
   355
            val [T] = filter_out Type_Infer.is_paramT TU;
wenzelm@40281
   356
            val SOME S' = sort_of T;
wenzelm@40281
   357
            val test_update = if is_freeT T then is_freeT else is_fixedvarT;
wenzelm@40281
   358
            val tye' = Vartab.update_new (xi, T) tye;
wenzelm@40286
   359
            val (ch, done') = split_cs (test_update o Type_Infer.deref tye') done;
wenzelm@40281
   360
            val todo' = ch @ todo;
wenzelm@40281
   361
          in
wenzelm@40281
   362
            if subsort (S', S) (*TODO check this*)
wenzelm@40281
   363
            then simplify done' todo' (tye', idx)
traytel@40836
   364
            else error (gen_msg err "sort mismatch")
wenzelm@40281
   365
          end
wenzelm@40281
   366
        and simplify done [] tye_idx = (done, tye_idx)
wenzelm@40281
   367
          | simplify done (((T, U), error_pack) :: todo) (tye_idx as (tye, idx)) =
wenzelm@40286
   368
              (case (Type_Infer.deref tye T, Type_Infer.deref tye U) of
wenzelm@40281
   369
                (Type (a, []), Type (b, [])) =>
wenzelm@40281
   370
                  if a = b then simplify done todo tye_idx
wenzelm@40281
   371
                  else if Graph.is_edge coes_graph (a, b) then simplify done todo tye_idx
traytel@40836
   372
                  else error (gen_msg err (a ^ " is not a subtype of " ^ b))
wenzelm@40281
   373
              | (Type (a, Ts), Type (b, Us)) =>
traytel@40836
   374
                  if a <> b then error (gen_msg err "different constructors")
traytel@40836
   375
                    (fst tye_idx) error_pack
wenzelm@40281
   376
                  else contract a Ts Us error_pack done todo tye idx
wenzelm@40282
   377
              | (TVar (xi, S), Type (a, Ts as (_ :: _))) =>
wenzelm@40281
   378
                  expand true xi S a Ts error_pack done todo tye idx
wenzelm@40282
   379
              | (Type (a, Ts as (_ :: _)), TVar (xi, S)) =>
wenzelm@40281
   380
                  expand false xi S a Ts error_pack done todo tye idx
wenzelm@40281
   381
              | (T, U) =>
wenzelm@40281
   382
                  if T = U then simplify done todo tye_idx
wenzelm@40282
   383
                  else if exists (is_freeT orf is_fixedvarT) [T, U] andalso
wenzelm@40286
   384
                    exists Type_Infer.is_paramT [T, U]
traytel@41353
   385
                  then eliminate [T, U] done todo tye idx
wenzelm@40281
   386
                  else if exists (is_freeT orf is_fixedvarT) [T, U]
traytel@40836
   387
                  then error (gen_msg err "not eliminated free/fixed variables")
wenzelm@40282
   388
                  else simplify (((T, U), error_pack) :: done) todo tye_idx);
wenzelm@40281
   389
      in
wenzelm@40281
   390
        simplify [] cs tye_idx
wenzelm@40281
   391
      end;
wenzelm@40281
   392
wenzelm@40281
   393
wenzelm@40281
   394
    (* do simplification *)
wenzelm@40282
   395
wenzelm@40281
   396
    val (cs', tye_idx') = simplify_constraints cs tye_idx;
traytel@40836
   397
    
traytel@40836
   398
    fun find_error_pack lower T' = map_filter 
traytel@40836
   399
      (fn ((T, U), pack) => if if lower then T' = U else T' = T then SOME pack else NONE) cs';
traytel@40836
   400
      
traytel@40836
   401
    fun find_cycle_packs nodes = 
traytel@40836
   402
      let
traytel@40836
   403
        val (but_last, last) = split_last nodes
traytel@40836
   404
        val pairs = (last, hd nodes) :: (but_last ~~ tl nodes);
traytel@40836
   405
      in
traytel@40836
   406
        map_filter
wenzelm@40838
   407
          (fn (TU, pack) => if member (op =) pairs TU then SOME pack else NONE)
traytel@40836
   408
          cs'
traytel@40836
   409
      end;
wenzelm@40281
   410
wenzelm@40281
   411
    (*styps stands either for supertypes or for subtypes of a type T
wenzelm@40281
   412
      in terms of the subtype-relation (excluding T itself)*)
wenzelm@40282
   413
    fun styps super T =
wenzelm@40281
   414
      (if super then Graph.imm_succs else Graph.imm_preds) coes_graph T
wenzelm@40281
   415
        handle Graph.UNDEF _ => [];
wenzelm@40281
   416
wenzelm@40282
   417
    fun minmax sup (T :: Ts) =
wenzelm@40281
   418
      let
wenzelm@40281
   419
        fun adjust T U = if sup then (T, U) else (U, T);
wenzelm@40281
   420
        fun extract T [] = T
wenzelm@40282
   421
          | extract T (U :: Us) =
wenzelm@40281
   422
              if Graph.is_edge coes_graph (adjust T U) then extract T Us
wenzelm@40281
   423
              else if Graph.is_edge coes_graph (adjust U T) then extract U Us
traytel@40836
   424
              else raise BOUND_ERROR "uncomparable types in type list";
wenzelm@40281
   425
      in
wenzelm@40281
   426
        t_of (extract T Ts)
wenzelm@40281
   427
      end;
wenzelm@40281
   428
wenzelm@40282
   429
    fun ex_styp_of_sort super T styps_and_sorts =
wenzelm@40281
   430
      let
wenzelm@40281
   431
        fun adjust T U = if super then (T, U) else (U, T);
wenzelm@40282
   432
        fun styp_test U Ts = forall
wenzelm@40281
   433
          (fn T => T = U orelse Graph.is_edge coes_graph (adjust U T)) Ts;
wenzelm@40281
   434
        fun fitting Ts S U = Type.of_sort tsig (t_of U, S) andalso styp_test U Ts
wenzelm@40281
   435
      in
wenzelm@40281
   436
        forall (fn (Ts, S) => exists (fitting Ts S) (T :: styps super T)) styps_and_sorts
wenzelm@40281
   437
      end;
wenzelm@40281
   438
wenzelm@40281
   439
    (* computes the tightest possible, correct assignment for 'a::S
wenzelm@40281
   440
       e.g. in the supremum case (sup = true):
wenzelm@40281
   441
               ------- 'a::S---
wenzelm@40281
   442
              /        /    \  \
wenzelm@40281
   443
             /        /      \  \
wenzelm@40281
   444
        'b::C1   'c::C2 ...  T1 T2 ...
wenzelm@40281
   445
wenzelm@40281
   446
       sorts - list of sorts [C1, C2, ...]
wenzelm@40281
   447
       T::Ts - non-empty list of base types [T1, T2, ...]
wenzelm@40281
   448
    *)
wenzelm@40282
   449
    fun tightest sup S styps_and_sorts (T :: Ts) =
wenzelm@40281
   450
      let
wenzelm@40281
   451
        fun restriction T = Type.of_sort tsig (t_of T, S)
wenzelm@40281
   452
          andalso ex_styp_of_sort (not sup) T styps_and_sorts;
wenzelm@40281
   453
        fun candidates T = inter (op =) (filter restriction (T :: styps sup T));
wenzelm@40281
   454
      in
wenzelm@40281
   455
        (case fold candidates Ts (filter restriction (T :: styps sup T)) of
traytel@40836
   456
          [] => raise BOUND_ERROR ("no " ^ (if sup then "supremum" else "infimum"))
wenzelm@40281
   457
        | [T] => t_of T
wenzelm@40281
   458
        | Ts => minmax sup Ts)
wenzelm@40281
   459
      end;
wenzelm@40281
   460
wenzelm@40281
   461
    fun build_graph G [] tye_idx = (G, tye_idx)
wenzelm@40282
   462
      | build_graph G ((T, U) :: cs) tye_idx =
wenzelm@40281
   463
        if T = U then build_graph G cs tye_idx
wenzelm@40281
   464
        else
wenzelm@40281
   465
          let
wenzelm@40281
   466
            val G' = maybe_new_typnodes [T, U] G;
wenzelm@40281
   467
            val (G'', tye_idx') = (add_edge (T, U) G', tye_idx)
wenzelm@40281
   468
              handle Typ_Graph.CYCLES cycles =>
wenzelm@40281
   469
                let
traytel@40836
   470
                  val (tye, idx) = 
traytel@40836
   471
                    fold 
traytel@40836
   472
                      (fn cycle => fn tye_idx' => (unify_list cycle tye_idx'
traytel@41353
   473
                        handle NO_UNIFIER (msg, _) => 
traytel@40836
   474
                          err_bound ctxt 
traytel@40836
   475
                            (gen_msg err ("constraint cycle not unifiable" ^ msg)) (fst tye_idx)
traytel@40836
   476
                            (find_cycle_packs cycle)))
traytel@40836
   477
                      cycles tye_idx
wenzelm@40281
   478
                in
traytel@40836
   479
                  collapse (tye, idx) cycles G
traytel@40836
   480
                end
wenzelm@40281
   481
          in
wenzelm@40281
   482
            build_graph G'' cs tye_idx'
wenzelm@40281
   483
          end
traytel@40836
   484
    and collapse (tye, idx) cycles G = (*nodes non-empty list*)
wenzelm@40281
   485
      let
traytel@40836
   486
        (*all cycles collapse to one node,
traytel@40836
   487
          because all of them share at least the nodes x and y*)
traytel@40836
   488
        val nodes = (distinct (op =) (flat cycles));
traytel@40836
   489
        val T = Type_Infer.deref tye (hd nodes);
wenzelm@40281
   490
        val P = new_imm_preds G nodes;
wenzelm@40281
   491
        val S = new_imm_succs G nodes;
wenzelm@40281
   492
        val G' = Typ_Graph.del_nodes (tl nodes) G;
traytel@40836
   493
        fun check_and_gen super T' =
traytel@40836
   494
          let val U = Type_Infer.deref tye T';
traytel@40836
   495
          in
traytel@40836
   496
            if not (is_typeT T) orelse not (is_typeT U) orelse T = U
traytel@40836
   497
            then if super then (hd nodes, T') else (T', hd nodes)
traytel@40836
   498
            else 
traytel@40836
   499
              if super andalso 
traytel@40836
   500
                Graph.is_edge coes_graph (nameT T, nameT U) then (hd nodes, T')
traytel@40836
   501
              else if not super andalso 
traytel@40836
   502
                Graph.is_edge coes_graph (nameT U, nameT T) then (T', hd nodes)
traytel@40836
   503
              else err_bound ctxt (gen_msg err "cycle elimination produces inconsistent graph")
traytel@40836
   504
                    (fst tye_idx) 
traytel@40836
   505
                    (maps find_cycle_packs cycles @ find_error_pack super T')
traytel@40836
   506
          end;
wenzelm@40281
   507
      in
traytel@40836
   508
        build_graph G' (map (check_and_gen false) P @ map (check_and_gen true) S) (tye, idx)
wenzelm@40281
   509
      end;
wenzelm@40281
   510
wenzelm@40281
   511
    fun assign_bound lower G key (tye_idx as (tye, _)) =
wenzelm@40286
   512
      if Type_Infer.is_paramT (Type_Infer.deref tye key) then
wenzelm@40281
   513
        let
wenzelm@40286
   514
          val TVar (xi, S) = Type_Infer.deref tye key;
wenzelm@40281
   515
          val get_bound = if lower then get_preds else get_succs;
wenzelm@40281
   516
          val raw_bound = get_bound G key;
wenzelm@40286
   517
          val bound = map (Type_Infer.deref tye) raw_bound;
wenzelm@40286
   518
          val not_params = filter_out Type_Infer.is_paramT bound;
wenzelm@40282
   519
          fun to_fulfil T =
wenzelm@40281
   520
            (case sort_of T of
wenzelm@40281
   521
              NONE => NONE
wenzelm@40282
   522
            | SOME S =>
wenzelm@40286
   523
                SOME
wenzelm@40286
   524
                  (map nameT
wenzelm@40286
   525
                    (filter_out Type_Infer.is_paramT (map (Type_Infer.deref tye) (get_bound G T))),
wenzelm@40286
   526
                      S));
wenzelm@40281
   527
          val styps_and_sorts = distinct (op =) (map_filter to_fulfil raw_bound);
wenzelm@40281
   528
          val assignment =
wenzelm@40281
   529
            if null bound orelse null not_params then NONE
wenzelm@40281
   530
            else SOME (tightest lower S styps_and_sorts (map nameT not_params)
traytel@40836
   531
                handle BOUND_ERROR msg => 
traytel@40836
   532
                  err_bound ctxt (gen_msg err msg) tye (find_error_pack lower key))
wenzelm@40281
   533
        in
wenzelm@40281
   534
          (case assignment of
wenzelm@40281
   535
            NONE => tye_idx
wenzelm@40281
   536
          | SOME T =>
wenzelm@40286
   537
              if Type_Infer.is_paramT T then tye_idx
wenzelm@40281
   538
              else if lower then (*upper bound check*)
wenzelm@40281
   539
                let
wenzelm@40286
   540
                  val other_bound = map (Type_Infer.deref tye) (get_succs G key);
wenzelm@40281
   541
                  val s = nameT T;
wenzelm@40281
   542
                in
wenzelm@40281
   543
                  if subset (op = o apfst nameT) (filter is_typeT other_bound, s :: styps true s)
wenzelm@40281
   544
                  then apfst (Vartab.update (xi, T)) tye_idx
traytel@40836
   545
                  else err_bound ctxt (gen_msg err ("assigned simple type " ^ s ^
wenzelm@40281
   546
                    " clashes with the upper bound of variable " ^
traytel@40836
   547
                    Syntax.string_of_typ ctxt (TVar(xi, S)))) tye (find_error_pack (not lower) key)
wenzelm@40281
   548
                end
wenzelm@40281
   549
              else apfst (Vartab.update (xi, T)) tye_idx)
wenzelm@40281
   550
        end
wenzelm@40281
   551
      else tye_idx;
wenzelm@40281
   552
wenzelm@40281
   553
    val assign_lb = assign_bound true;
wenzelm@40281
   554
    val assign_ub = assign_bound false;
wenzelm@40281
   555
wenzelm@40281
   556
    fun assign_alternating ts' ts G tye_idx =
wenzelm@40281
   557
      if ts' = ts then tye_idx
wenzelm@40281
   558
      else
wenzelm@40281
   559
        let
wenzelm@40281
   560
          val (tye_idx' as (tye, _)) = fold (assign_lb G) ts tye_idx
wenzelm@40281
   561
            |> fold (assign_ub G) ts;
wenzelm@40281
   562
        in
traytel@40836
   563
          assign_alternating ts 
traytel@40836
   564
            (filter (Type_Infer.is_paramT o Type_Infer.deref tye) ts) G tye_idx'
wenzelm@40281
   565
        end;
wenzelm@40281
   566
wenzelm@40281
   567
    (*Unify all weakly connected components of the constraint forest,
wenzelm@40282
   568
      that contain only params. These are the only WCCs that contain
wenzelm@40281
   569
      params anyway.*)
wenzelm@40281
   570
    fun unify_params G (tye_idx as (tye, _)) =
wenzelm@40281
   571
      let
wenzelm@40286
   572
        val max_params =
wenzelm@40286
   573
          filter (Type_Infer.is_paramT o Type_Infer.deref tye) (Typ_Graph.maximals G);
wenzelm@40281
   574
        val to_unify = map (fn T => T :: get_preds G T) max_params;
wenzelm@40281
   575
      in
traytel@40836
   576
        fold 
traytel@40836
   577
          (fn Ts => fn tye_idx' => unify_list Ts tye_idx'
traytel@41353
   578
            handle NO_UNIFIER (msg, _) => err_list ctxt (gen_msg err msg) (fst tye_idx) Ts)
traytel@40836
   579
          to_unify tye_idx
wenzelm@40281
   580
      end;
wenzelm@40281
   581
wenzelm@40281
   582
    fun solve_constraints G tye_idx = tye_idx
wenzelm@40281
   583
      |> assign_alternating [] (Typ_Graph.keys G) G
wenzelm@40281
   584
      |> unify_params G;
wenzelm@40281
   585
  in
wenzelm@40281
   586
    build_graph Typ_Graph.empty (map fst cs') tye_idx'
wenzelm@40281
   587
      |-> solve_constraints
wenzelm@40281
   588
  end;
wenzelm@40281
   589
wenzelm@40281
   590
wenzelm@40281
   591
wenzelm@40281
   592
(** coercion insertion **)
wenzelm@40281
   593
traytel@40836
   594
fun gen_coercion ctxt tye (T1, T2) =
traytel@40836
   595
  (case pairself (Type_Infer.deref tye) (T1, T2) of
traytel@40836
   596
    ((Type (a, [])), (Type (b, []))) =>
traytel@40836
   597
        if a = b
traytel@40836
   598
        then Abs (Name.uu, Type (a, []), Bound 0)
traytel@40836
   599
        else
traytel@40836
   600
          (case Symreltab.lookup (coes_of ctxt) (a, b) of
traytel@40836
   601
            NONE => raise Fail (a ^ " is not a subtype of " ^ b)
traytel@40836
   602
          | SOME co => co)
traytel@40836
   603
  | ((Type (a, Ts)), (Type (b, Us))) =>
traytel@40836
   604
        if a <> b
traytel@40836
   605
        then raise Fail ("Different constructors: " ^ a ^ " and " ^ b)
traytel@40836
   606
        else
traytel@40836
   607
          let
traytel@40836
   608
            fun inst t Ts =
traytel@40836
   609
              Term.subst_vars
traytel@40836
   610
                (((Term.add_tvar_namesT (fastype_of t) []) ~~ rev Ts), []) t;
traytel@41353
   611
            fun sub_co (COVARIANT, TU) = SOME (gen_coercion ctxt tye TU)
traytel@41353
   612
              | sub_co (CONTRAVARIANT, TU) = SOME (gen_coercion ctxt tye (swap TU))
traytel@41353
   613
              | sub_co (INVARIANT_TO T, _) = NONE;
traytel@40836
   614
            fun ts_of [] = []
traytel@40836
   615
              | ts_of (Type ("fun", [x1, x2]) :: xs) = x1 :: x2 :: (ts_of xs);
traytel@40836
   616
          in
traytel@40836
   617
            (case Symtab.lookup (tmaps_of ctxt) a of
traytel@40836
   618
              NONE => raise Fail ("No map function for " ^ a ^ " known")
traytel@40836
   619
            | SOME tmap =>
traytel@40836
   620
                let
traytel@41353
   621
                  val used_coes = map_filter sub_co ((snd tmap) ~~ (Ts ~~ Us));
traytel@40836
   622
                in
traytel@40836
   623
                  Term.list_comb
traytel@40836
   624
                    (inst (fst tmap) (ts_of (map fastype_of used_coes)), used_coes)
traytel@40836
   625
                end)
traytel@40836
   626
          end
traytel@40836
   627
  | (T, U) =>
traytel@40836
   628
        if Type.could_unify (T, U)
traytel@40836
   629
        then Abs (Name.uu, T, Bound 0)
traytel@40836
   630
        else raise Fail ("Cannot generate coercion from "
traytel@40836
   631
          ^ Syntax.string_of_typ ctxt T ^ " to " ^ Syntax.string_of_typ ctxt U));
traytel@40836
   632
wenzelm@40281
   633
fun insert_coercions ctxt tye ts =
wenzelm@40281
   634
  let
wenzelm@40281
   635
    fun insert _ (Const (c, T)) =
traytel@40836
   636
          let val T' = T;
wenzelm@40281
   637
          in (Const (c, T'), T') end
wenzelm@40281
   638
      | insert _ (Free (x, T)) =
traytel@40836
   639
          let val T' = T;
wenzelm@40281
   640
          in (Free (x, T'), T') end
wenzelm@40281
   641
      | insert _ (Var (xi, T)) =
traytel@40836
   642
          let val T' = T;
wenzelm@40281
   643
          in (Var (xi, T'), T') end
wenzelm@40281
   644
      | insert bs (Bound i) =
traytel@40836
   645
          let val T = nth bs i handle Subscript => err_loose i;
wenzelm@40281
   646
          in (Bound i, T) end
wenzelm@40281
   647
      | insert bs (Abs (x, T, t)) =
wenzelm@40281
   648
          let
traytel@40836
   649
            val T' = T;
wenzelm@40282
   650
            val (t', T'') = insert (T' :: bs) t;
wenzelm@40281
   651
          in
wenzelm@40281
   652
            (Abs (x, T', t'), T' --> T'')
wenzelm@40281
   653
          end
wenzelm@40281
   654
      | insert bs (t $ u) =
wenzelm@40281
   655
          let
traytel@40836
   656
            val (t', Type ("fun", [U, T])) = apsnd (Type_Infer.deref tye) (insert bs t);
wenzelm@40281
   657
            val (u', U') = insert bs u;
wenzelm@40281
   658
          in
traytel@40836
   659
            if can (fn TU => strong_unify ctxt TU (tye, 0)) (U, U')
traytel@40836
   660
            then (t' $ u', T)
traytel@40836
   661
            else (t' $ (gen_coercion ctxt tye (U', U) $ u'), T)
wenzelm@40281
   662
          end
wenzelm@40281
   663
  in
wenzelm@40281
   664
    map (fst o insert []) ts
wenzelm@40281
   665
  end;
wenzelm@40281
   666
wenzelm@40281
   667
wenzelm@40281
   668
wenzelm@40281
   669
(** assembling the pipeline **)
wenzelm@40281
   670
wenzelm@40281
   671
fun infer_types ctxt const_type var_type raw_ts =
wenzelm@40281
   672
  let
wenzelm@40281
   673
    val (idx, ts) = Type_Infer.prepare ctxt const_type var_type raw_ts;
wenzelm@40281
   674
traytel@40836
   675
    fun inf _ (t as (Const (_, T))) tye_idx = (t, T, tye_idx)
traytel@40836
   676
      | inf _ (t as (Free (_, T))) tye_idx = (t, T, tye_idx)
traytel@40836
   677
      | inf _ (t as (Var (_, T))) tye_idx = (t, T, tye_idx)
traytel@40836
   678
      | inf bs (t as (Bound i)) tye_idx =
traytel@40836
   679
          (t, snd (nth bs i handle Subscript => err_loose i), tye_idx)
traytel@40836
   680
      | inf bs (Abs (x, T, t)) tye_idx =
traytel@40836
   681
          let val (t', U, tye_idx') = inf ((x, T) :: bs) t tye_idx
traytel@40836
   682
          in (Abs (x, T, t'), T --> U, tye_idx') end
traytel@40836
   683
      | inf bs (t $ u) tye_idx =
traytel@40836
   684
          let
traytel@40836
   685
            val (t', T, tye_idx') = inf bs t tye_idx;
traytel@40836
   686
            val (u', U, (tye, idx)) = inf bs u tye_idx';
traytel@40836
   687
            val V = Type_Infer.mk_param idx [];
traytel@40836
   688
            val (tu, tye_idx'') = (t' $ u', strong_unify ctxt (U --> V, T) (tye, idx + 1))
traytel@40836
   689
              handle NO_UNIFIER (msg, tye') => 
traytel@40836
   690
                raise TYPE_INFERENCE_ERROR (err_appl_msg ctxt msg tye' bs t T u U);
traytel@40836
   691
          in (tu, V, tye_idx'') end;
wenzelm@40281
   692
traytel@40938
   693
    fun infer_single t tye_idx = 
traytel@40836
   694
      let val (t, _, tye_idx') = inf [] t tye_idx;
traytel@40938
   695
      in (t, tye_idx') end;
traytel@40836
   696
      
traytel@40938
   697
    val (ts', (tye, _)) = (fold_map infer_single ts (Vartab.empty, idx)
traytel@40836
   698
      handle TYPE_INFERENCE_ERROR err =>     
traytel@40836
   699
        let
traytel@40836
   700
          fun gen_single t (tye_idx, constraints) =
traytel@40836
   701
            let val (_, tye_idx', constraints') = generate_constraints ctxt err t tye_idx
traytel@40836
   702
            in (tye_idx', constraints' @ constraints) end;
traytel@40836
   703
      
traytel@40836
   704
          val (tye_idx, constraints) = fold gen_single ts ((Vartab.empty, idx), []);
traytel@40836
   705
          val (tye, idx) = process_constraints ctxt err constraints tye_idx;
traytel@40836
   706
        in 
traytel@40836
   707
          (insert_coercions ctxt tye ts, (tye, idx))
traytel@40836
   708
        end);
wenzelm@40281
   709
wenzelm@40281
   710
    val (_, ts'') = Type_Infer.finish ctxt tye ([], ts');
wenzelm@40281
   711
  in ts'' end;
wenzelm@40281
   712
wenzelm@40281
   713
wenzelm@40281
   714
wenzelm@40281
   715
(** installation **)
wenzelm@40281
   716
wenzelm@40283
   717
(* term check *)
wenzelm@40283
   718
wenzelm@40281
   719
fun coercion_infer_types ctxt =
wenzelm@40281
   720
  infer_types ctxt
wenzelm@40281
   721
    (try (Consts.the_constraint (ProofContext.consts_of ctxt)))
wenzelm@40281
   722
    (ProofContext.def_type ctxt);
wenzelm@40281
   723
wenzelm@40939
   724
val (coercion_enabled, coercion_enabled_setup) = Attrib.config_bool "coercion_enabled" (K false);
wenzelm@40939
   725
wenzelm@40283
   726
val add_term_check =
wenzelm@40283
   727
  Syntax.add_term_check ~100 "coercions"
wenzelm@40283
   728
    (fn xs => fn ctxt =>
wenzelm@40939
   729
      if Config.get ctxt coercion_enabled then
wenzelm@40939
   730
        let val xs' = coercion_infer_types ctxt xs
wenzelm@40939
   731
        in if eq_list (op aconv) (xs, xs') then NONE else SOME (xs', ctxt) end
wenzelm@40939
   732
      else NONE);
wenzelm@40281
   733
wenzelm@40281
   734
wenzelm@40283
   735
(* declarations *)
wenzelm@40281
   736
wenzelm@40284
   737
fun add_type_map raw_t context =
wenzelm@40281
   738
  let
wenzelm@40281
   739
    val ctxt = Context.proof_of context;
wenzelm@40284
   740
    val t = singleton (Variable.polymorphic ctxt) raw_t;
wenzelm@40281
   741
traytel@41353
   742
    fun err_str t = "\n\nThe provided function has the type\n" ^ 
traytel@41353
   743
      Syntax.string_of_typ ctxt (fastype_of t) ^ 
traytel@41353
   744
      "\n\nThe general type signature of a map function is" ^
traytel@41353
   745
      "\nf1 => f2 => ... => fn => C [x1, ..., xn] => C [y1, ..., yn]" ^
wenzelm@40281
   746
      "\nwhere C is a constructor and fi is of type (xi => yi) or (yi => xi)";
traytel@41353
   747
      
traytel@41353
   748
    val ((fis, T1), T2) = apfst split_last (strip_type (fastype_of t))
traytel@41353
   749
      handle Empty => error ("Not a proper map function:" ^ err_str t);
traytel@41353
   750
    
wenzelm@40281
   751
    fun gen_arg_var ([], []) = []
wenzelm@40282
   752
      | gen_arg_var ((T, T') :: Ts, (U, U') :: Us) =
traytel@41353
   753
          if U = U' then
traytel@41353
   754
            if is_stypeT U then INVARIANT_TO U :: gen_arg_var ((T, T') :: Ts, Us)
traytel@41353
   755
            else error ("Invariant xi and yi should be base types:" ^ err_str t)
traytel@41353
   756
          else if T = U andalso T' = U' then COVARIANT :: gen_arg_var (Ts, Us)
wenzelm@40281
   757
          else if T = U' andalso T' = U then CONTRAVARIANT :: gen_arg_var (Ts, Us)
traytel@41353
   758
          else error ("Functions do not apply to arguments correctly:" ^ err_str t)
traytel@41353
   759
      | gen_arg_var (_, Ts) = 
traytel@41353
   760
          if forall (op = andf is_stypeT o fst) Ts 
traytel@41353
   761
          then map (INVARIANT_TO o fst) Ts
traytel@41353
   762
          else error ("Different numbers of functions and variant arguments\n" ^ err_str t);
wenzelm@40281
   763
traytel@41353
   764
    (*retry flag needed to adjust the type lists, when given a map over type constructor fun*)
traytel@41353
   765
    fun check_map_fun fis (Type (C1, Ts)) (Type (C2, Us)) retry =
traytel@41353
   766
          if C1 = C2 andalso not (null fis) andalso forall is_funtype fis
traytel@41353
   767
          then ((map dest_funT fis, Ts ~~ Us), C1)
traytel@41353
   768
          else error ("Not a proper map function:" ^ err_str t)
traytel@41353
   769
      | check_map_fun fis T1 T2 true =
traytel@41353
   770
          let val (fis', T') = split_last fis
traytel@41353
   771
          in check_map_fun fis' T' (T1 --> T2) false end
traytel@41353
   772
      | check_map_fun _ _ _ _ = error ("Not a proper map function:" ^ err_str t);
wenzelm@40281
   773
traytel@41353
   774
    val res = check_map_fun fis T1 T2 true;
wenzelm@40281
   775
    val res_av = gen_arg_var (fst res);
wenzelm@40281
   776
  in
wenzelm@40281
   777
    map_tmaps (Symtab.update (snd res, (t, res_av))) context
wenzelm@40281
   778
  end;
wenzelm@40281
   779
wenzelm@40284
   780
fun add_coercion raw_t context =
wenzelm@40281
   781
  let
wenzelm@40281
   782
    val ctxt = Context.proof_of context;
wenzelm@40284
   783
    val t = singleton (Variable.polymorphic ctxt) raw_t;
wenzelm@40281
   784
wenzelm@40281
   785
    fun err_coercion () = error ("Bad type for coercion " ^
wenzelm@40281
   786
        Syntax.string_of_term ctxt t ^ ":\n" ^
wenzelm@40281
   787
        Syntax.string_of_typ ctxt (fastype_of t));
wenzelm@40281
   788
wenzelm@40840
   789
    val (T1, T2) = Term.dest_funT (fastype_of t)
wenzelm@40840
   790
      handle TYPE _ => err_coercion ();
wenzelm@40281
   791
wenzelm@40281
   792
    val a =
wenzelm@40281
   793
      (case T1 of
wenzelm@40281
   794
        Type (x, []) => x
wenzelm@40281
   795
      | _ => err_coercion ());
wenzelm@40281
   796
wenzelm@40281
   797
    val b =
wenzelm@40281
   798
      (case T2 of
wenzelm@40281
   799
        Type (x, []) => x
wenzelm@40281
   800
      | _ => err_coercion ());
wenzelm@40281
   801
wenzelm@40281
   802
    fun coercion_data_update (tab, G) =
wenzelm@40281
   803
      let
wenzelm@40281
   804
        val G' = maybe_new_nodes [a, b] G
wenzelm@40281
   805
        val G'' = Graph.add_edge_trans_acyclic (a, b) G'
wenzelm@40281
   806
          handle Graph.CYCLES _ => error (a ^ " is already a subtype of " ^ b ^
wenzelm@40281
   807
            "!\n\nCannot add coercion of type: " ^ a ^ " => " ^ b);
wenzelm@40281
   808
        val new_edges =
wenzelm@40281
   809
          flat (Graph.dest G'' |> map (fn (x, ys) => ys |> map_filter (fn y =>
wenzelm@40281
   810
            if Graph.is_edge G' (x, y) then NONE else SOME (x, y))));
wenzelm@40281
   811
        val G_and_new = Graph.add_edge (a, b) G';
wenzelm@40281
   812
wenzelm@40281
   813
        fun complex_coercion tab G (a, b) =
wenzelm@40281
   814
          let
wenzelm@40281
   815
            val path = hd (Graph.irreducible_paths G (a, b))
traytel@40836
   816
            val path' = fst (split_last path) ~~ tl path
wenzelm@40281
   817
          in Abs (Name.uu, Type (a, []),
wenzelm@40281
   818
              fold (fn t => fn u => t $ u) (map (the o Symreltab.lookup tab) path') (Bound 0))
wenzelm@40281
   819
          end;
wenzelm@40281
   820
wenzelm@40281
   821
        val tab' = fold
wenzelm@40281
   822
          (fn pair => fn tab => Symreltab.update (pair, complex_coercion tab G_and_new pair) tab)
wenzelm@40281
   823
          (filter (fn pair => pair <> (a, b)) new_edges)
wenzelm@40281
   824
          (Symreltab.update ((a, b), t) tab);
wenzelm@40281
   825
      in
wenzelm@40281
   826
        (tab', G'')
wenzelm@40281
   827
      end;
wenzelm@40281
   828
  in
wenzelm@40281
   829
    map_coes_and_graph coercion_data_update context
wenzelm@40281
   830
  end;
wenzelm@40281
   831
wenzelm@40283
   832
wenzelm@40283
   833
(* theory setup *)
wenzelm@40283
   834
wenzelm@40283
   835
val setup =
wenzelm@40939
   836
  coercion_enabled_setup #>
wenzelm@40283
   837
  Context.theory_map add_term_check #>
wenzelm@40284
   838
  Attrib.setup @{binding coercion}
wenzelm@40284
   839
    (Args.term >> (fn t => Thm.declaration_attribute (K (add_coercion t))))
wenzelm@40281
   840
    "declaration of new coercions" #>
traytel@40297
   841
  Attrib.setup @{binding coercion_map}
wenzelm@40284
   842
    (Args.term >> (fn t => Thm.declaration_attribute (K (add_type_map t))))
wenzelm@40283
   843
    "declaration of new map functions";
wenzelm@40281
   844
wenzelm@40281
   845
end;