src/Tools/Code/code_thingol.ML
author wenzelm
Thu Mar 25 21:27:04 2010 +0100 (2010-03-25)
changeset 35961 00e48e1d9afd
parent 35845 e5980f0ad025
child 36102 a51d1d154c71
permissions -rw-r--r--
Sorts.of_sort_derivation: do not use slow Graph.irreducible_paths here, which not always needed (SUBTLE CHANGE IN SEMANTICS);
officially export weaken as Sorts.classrel_derivation;
tuned comments;
haftmann@24219
     1
(*  Title:      Tools/code/code_thingol.ML
haftmann@24219
     2
    Author:     Florian Haftmann, TU Muenchen
haftmann@24219
     3
haftmann@24219
     4
Intermediate language ("Thin-gol") representing executable code.
haftmann@24918
     5
Representation and translation.
haftmann@24219
     6
*)
haftmann@24219
     7
haftmann@24219
     8
infix 8 `%%;
haftmann@24219
     9
infix 4 `$;
haftmann@24219
    10
infix 4 `$$;
haftmann@31724
    11
infixr 3 `|=>;
haftmann@31724
    12
infixr 3 `|==>;
haftmann@24219
    13
haftmann@24219
    14
signature BASIC_CODE_THINGOL =
haftmann@24219
    15
sig
haftmann@24219
    16
  type vname = string;
haftmann@24219
    17
  datatype dict =
haftmann@24219
    18
      DictConst of string * dict list list
haftmann@24219
    19
    | DictVar of string list * (vname * (int * int));
haftmann@24219
    20
  datatype itype =
haftmann@24219
    21
      `%% of string * itype list
haftmann@24219
    22
    | ITyVar of vname;
haftmann@31049
    23
  type const = string * ((itype list * dict list list) * itype list (*types of arguments*))
haftmann@24219
    24
  datatype iterm =
haftmann@24591
    25
      IConst of const
haftmann@31889
    26
    | IVar of vname option
haftmann@24219
    27
    | `$ of iterm * iterm
haftmann@31888
    28
    | `|=> of (vname option * itype) * iterm
haftmann@24219
    29
    | ICase of ((iterm * itype) * (iterm * iterm) list) * iterm;
haftmann@24219
    30
        (*((term, type), [(selector pattern, body term )]), primitive term)*)
haftmann@24219
    31
  val `$$ : iterm * iterm list -> iterm;
haftmann@31888
    32
  val `|==> : (vname option * itype) list * iterm -> iterm;
haftmann@24219
    33
  type typscheme = (vname * sort) list * itype;
haftmann@24219
    34
end;
haftmann@24219
    35
haftmann@24219
    36
signature CODE_THINGOL =
haftmann@24219
    37
sig
haftmann@28663
    38
  include BASIC_CODE_THINGOL
haftmann@34084
    39
  val fun_tyco: string
haftmann@28663
    40
  val unfoldl: ('a -> ('a * 'b) option) -> 'a -> 'a * 'b list
haftmann@28663
    41
  val unfoldr: ('a -> ('b * 'a) option) -> 'a -> 'b list * 'a
haftmann@28663
    42
  val unfold_fun: itype -> itype list * itype
haftmann@28663
    43
  val unfold_app: iterm -> iterm * iterm list
haftmann@31888
    44
  val unfold_abs: iterm -> (vname option * itype) list * iterm
haftmann@28663
    45
  val split_let: iterm -> (((iterm * itype) * iterm) * iterm) option
haftmann@28663
    46
  val unfold_let: iterm -> ((iterm * itype) * iterm) list * iterm
haftmann@31889
    47
  val split_pat_abs: iterm -> ((iterm * itype) * iterm) option
haftmann@31889
    48
  val unfold_pat_abs: iterm -> (iterm * itype) list * iterm
haftmann@31049
    49
  val unfold_const_app: iterm -> (const * iterm list) option
haftmann@32909
    50
  val is_IVar: iterm -> bool
haftmann@31049
    51
  val eta_expand: int -> const * iterm list -> iterm
haftmann@28663
    52
  val contains_dictvar: iterm -> bool
haftmann@28663
    53
  val locally_monomorphic: iterm -> bool
haftmann@31935
    54
  val add_constnames: iterm -> string list -> string list
haftmann@32917
    55
  val add_tyconames: iterm -> string list -> string list
haftmann@28663
    56
  val fold_varnames: (string -> 'a -> 'a) -> iterm -> 'a -> 'a
haftmann@28663
    57
haftmann@28663
    58
  type naming
haftmann@28706
    59
  val empty_naming: naming
haftmann@28663
    60
  val lookup_class: naming -> class -> string option
haftmann@28663
    61
  val lookup_classrel: naming -> class * class -> string option
haftmann@28663
    62
  val lookup_tyco: naming -> string -> string option
haftmann@28663
    63
  val lookup_instance: naming -> class * string -> string option
haftmann@28663
    64
  val lookup_const: naming -> string -> string option
haftmann@31054
    65
  val ensure_declared_const: theory -> string -> naming -> string * naming
haftmann@24219
    66
haftmann@24918
    67
  datatype stmt =
haftmann@27024
    68
      NoStmt
haftmann@35226
    69
    | Fun of string * (typscheme * ((iterm list * iterm) * (thm option * bool)) list)
haftmann@28663
    70
    | Datatype of string * ((vname * sort) list * (string * itype list) list)
haftmann@28663
    71
    | Datatypecons of string * string
haftmann@28663
    72
    | Class of class * (vname * ((class * string) list * (string * itype) list))
haftmann@24219
    73
    | Classrel of class * class
haftmann@28663
    74
    | Classparam of string * class
haftmann@24219
    75
    | Classinst of (class * (string * (vname * sort) list))
haftmann@24219
    76
          * ((class * (string * (string * dict list list))) list
haftmann@28663
    77
        * ((string * const) * (thm * bool)) list)
haftmann@28663
    78
  type program = stmt Graph.T
haftmann@28663
    79
  val empty_funs: program -> string list
haftmann@28663
    80
  val map_terms_bottom_up: (iterm -> iterm) -> iterm -> iterm
haftmann@28663
    81
  val map_terms_stmt: (iterm -> iterm) -> stmt -> stmt
haftmann@28663
    82
  val is_cons: program -> string -> bool
haftmann@28663
    83
  val contr_classparam_typs: program -> string -> itype option list
haftmann@32895
    84
  val labelled_name: theory -> program -> string -> string
haftmann@32895
    85
  val group_stmts: theory -> program
haftmann@32895
    86
    -> ((string * stmt) list * (string * stmt) list
haftmann@32895
    87
      * ((string * stmt) list * (string * stmt) list)) list
haftmann@24219
    88
haftmann@31036
    89
  val read_const_exprs: theory -> string list -> string list * string list
haftmann@28663
    90
  val consts_program: theory -> string list -> string list * (naming * program)
haftmann@32123
    91
  val eval_conv: theory
haftmann@31063
    92
    -> (naming -> program -> ((string * sort) list * typscheme) * iterm -> string list -> cterm -> thm)
haftmann@28663
    93
    -> cterm -> thm
haftmann@32123
    94
  val eval: theory -> ((term -> term) -> 'a -> 'a)
haftmann@31063
    95
    -> (naming -> program -> ((string * sort) list * typscheme) * iterm -> string list -> 'a)
haftmann@28663
    96
    -> term -> 'a
haftmann@24219
    97
end;
haftmann@24219
    98
haftmann@28054
    99
structure Code_Thingol: CODE_THINGOL =
haftmann@24219
   100
struct
haftmann@24219
   101
haftmann@24219
   102
(** auxiliary **)
haftmann@24219
   103
haftmann@24219
   104
fun unfoldl dest x =
haftmann@24219
   105
  case dest x
haftmann@24219
   106
   of NONE => (x, [])
haftmann@24219
   107
    | SOME (x1, x2) =>
haftmann@24219
   108
        let val (x', xs') = unfoldl dest x1 in (x', xs' @ [x2]) end;
haftmann@24219
   109
haftmann@24219
   110
fun unfoldr dest x =
haftmann@24219
   111
  case dest x
haftmann@24219
   112
   of NONE => ([], x)
haftmann@24219
   113
    | SOME (x1, x2) =>
haftmann@24219
   114
        let val (xs', x') = unfoldr dest x2 in (x1::xs', x') end;
haftmann@24219
   115
haftmann@24219
   116
haftmann@29962
   117
(** language core - types, terms **)
haftmann@24219
   118
haftmann@24219
   119
type vname = string;
haftmann@24219
   120
haftmann@24219
   121
datatype dict =
haftmann@24219
   122
    DictConst of string * dict list list
haftmann@24219
   123
  | DictVar of string list * (vname * (int * int));
haftmann@24219
   124
haftmann@24219
   125
datatype itype =
haftmann@24219
   126
    `%% of string * itype list
haftmann@24219
   127
  | ITyVar of vname;
haftmann@24219
   128
haftmann@31049
   129
type const = string * ((itype list * dict list list) * itype list (*types of arguments*))
haftmann@24591
   130
haftmann@24219
   131
datatype iterm =
haftmann@24591
   132
    IConst of const
haftmann@31889
   133
  | IVar of vname option
haftmann@24219
   134
  | `$ of iterm * iterm
haftmann@31888
   135
  | `|=> of (vname option * itype) * iterm
haftmann@24219
   136
  | ICase of ((iterm * itype) * (iterm * iterm) list) * iterm;
haftmann@24219
   137
    (*see also signature*)
haftmann@24219
   138
haftmann@32909
   139
fun is_IVar (IVar _) = true
haftmann@32909
   140
  | is_IVar _ = false;
haftmann@32909
   141
haftmann@24219
   142
val op `$$ = Library.foldl (op `$);
haftmann@31724
   143
val op `|==> = Library.foldr (op `|=>);
haftmann@24219
   144
haftmann@24219
   145
val unfold_app = unfoldl
haftmann@24219
   146
  (fn op `$ t => SOME t
haftmann@24219
   147
    | _ => NONE);
haftmann@24219
   148
haftmann@31874
   149
val unfold_abs = unfoldr
haftmann@31874
   150
  (fn op `|=> t => SOME t
haftmann@24219
   151
    | _ => NONE);
haftmann@24219
   152
haftmann@24219
   153
val split_let = 
haftmann@24219
   154
  (fn ICase (((td, ty), [(p, t)]), _) => SOME (((p, ty), td), t)
haftmann@24219
   155
    | _ => NONE);
haftmann@24219
   156
haftmann@24219
   157
val unfold_let = unfoldr split_let;
haftmann@24219
   158
haftmann@24219
   159
fun unfold_const_app t =
haftmann@24219
   160
 case unfold_app t
haftmann@24219
   161
  of (IConst c, ts) => SOME (c, ts)
haftmann@24219
   162
   | _ => NONE;
haftmann@24219
   163
haftmann@32917
   164
fun fold_constexprs f =
haftmann@32917
   165
  let
haftmann@32917
   166
    fun fold' (IConst c) = f c
haftmann@32917
   167
      | fold' (IVar _) = I
haftmann@32917
   168
      | fold' (t1 `$ t2) = fold' t1 #> fold' t2
haftmann@32917
   169
      | fold' (_ `|=> t) = fold' t
haftmann@32917
   170
      | fold' (ICase (((t, _), ds), _)) = fold' t
haftmann@32917
   171
          #> fold (fn (pat, body) => fold' pat #> fold' body) ds
haftmann@32917
   172
  in fold' end;
haftmann@32917
   173
haftmann@32917
   174
val add_constnames = fold_constexprs (fn (c, _) => insert (op =) c);
haftmann@32917
   175
haftmann@32917
   176
fun add_tycos (tyco `%% tys) = insert (op =) tyco #> fold add_tycos tys
haftmann@32917
   177
  | add_tycos (ITyVar _) = I;
haftmann@32917
   178
haftmann@32917
   179
val add_tyconames = fold_constexprs (fn (_, ((tys, _), _)) => fold add_tycos tys);
haftmann@24219
   180
haftmann@24219
   181
fun fold_varnames f =
haftmann@24219
   182
  let
haftmann@31935
   183
    fun fold_aux add f =
haftmann@31935
   184
      let
haftmann@31935
   185
        fun fold_term _ (IConst _) = I
haftmann@31935
   186
          | fold_term vs (IVar (SOME v)) = if member (op =) vs v then I else f v
haftmann@31935
   187
          | fold_term _ (IVar NONE) = I
haftmann@31935
   188
          | fold_term vs (t1 `$ t2) = fold_term vs t1 #> fold_term vs t2
haftmann@31935
   189
          | fold_term vs ((SOME v, _) `|=> t) = fold_term (insert (op =) v vs) t
haftmann@31935
   190
          | fold_term vs ((NONE, _) `|=> t) = fold_term vs t
haftmann@31935
   191
          | fold_term vs (ICase (((t, _), ds), _)) = fold_term vs t #> fold (fold_case vs) ds
haftmann@31935
   192
        and fold_case vs (p, t) = fold_term (add p vs) t;
haftmann@31935
   193
      in fold_term [] end;
haftmann@31935
   194
    fun add t = fold_aux add (insert (op =)) t;
haftmann@31935
   195
  in fold_aux add f end;
haftmann@24219
   196
haftmann@31935
   197
fun exists_var t v = fold_varnames (fn w => fn b => v = w orelse b) t false;
haftmann@31874
   198
haftmann@31889
   199
fun split_pat_abs ((NONE, ty) `|=> t) = SOME ((IVar NONE, ty), t)
haftmann@31888
   200
  | split_pat_abs ((SOME v, ty) `|=> t) = SOME (case t
haftmann@31889
   201
     of ICase (((IVar (SOME w), _), [(p, t')]), _) =>
haftmann@31888
   202
          if v = w andalso (exists_var p v orelse not (exists_var t' v))
haftmann@31889
   203
          then ((p, ty), t')
haftmann@31889
   204
          else ((IVar (SOME v), ty), t)
haftmann@31889
   205
      | _ => ((IVar (SOME v), ty), t))
haftmann@31888
   206
  | split_pat_abs _ = NONE;
haftmann@31874
   207
haftmann@31874
   208
val unfold_pat_abs = unfoldr split_pat_abs;
haftmann@24219
   209
haftmann@31890
   210
fun unfold_abs_eta [] t = ([], t)
haftmann@31890
   211
  | unfold_abs_eta (_ :: tys) (v_ty `|=> t) =
haftmann@31890
   212
      let
haftmann@31890
   213
        val (vs_tys, t') = unfold_abs_eta tys t;
haftmann@31890
   214
      in (v_ty :: vs_tys, t') end
haftmann@31892
   215
  | unfold_abs_eta tys t =
haftmann@31890
   216
      let
haftmann@31890
   217
        val ctxt = fold_varnames Name.declare t Name.context;
haftmann@31890
   218
        val vs_tys = (map o apfst) SOME (Name.names ctxt "a" tys);
haftmann@31890
   219
      in (vs_tys, t `$$ map (IVar o fst) vs_tys) end;
haftmann@31890
   220
haftmann@27711
   221
fun eta_expand k (c as (_, (_, tys)), ts) =
haftmann@24219
   222
  let
haftmann@24219
   223
    val j = length ts;
haftmann@24219
   224
    val l = k - j;
haftmann@24219
   225
    val ctxt = (fold o fold_varnames) Name.declare ts Name.context;
haftmann@31889
   226
    val vs_tys = (map o apfst) SOME
haftmann@33957
   227
      (Name.names ctxt "a" ((take l o drop j) tys));
haftmann@31889
   228
  in vs_tys `|==> IConst c `$$ ts @ map (IVar o fst) vs_tys end;
haftmann@24219
   229
haftmann@24662
   230
fun contains_dictvar t =
haftmann@24662
   231
  let
haftmann@31935
   232
    fun cont_dict (DictConst (_, dss)) = (exists o exists) cont_dict dss
haftmann@31935
   233
      | cont_dict (DictVar _) = true;
haftmann@31935
   234
    fun cont_term (IConst (_, ((_, dss), _))) = (exists o exists) cont_dict dss
haftmann@31935
   235
      | cont_term (IVar _) = false
haftmann@31935
   236
      | cont_term (t1 `$ t2) = cont_term t1 orelse cont_term t2
haftmann@31935
   237
      | cont_term (_ `|=> t) = cont_term t
haftmann@31935
   238
      | cont_term (ICase (_, t)) = cont_term t;
haftmann@31935
   239
  in cont_term t end;
haftmann@24662
   240
  
haftmann@25621
   241
fun locally_monomorphic (IConst _) = false
haftmann@25621
   242
  | locally_monomorphic (IVar _) = true
haftmann@25621
   243
  | locally_monomorphic (t `$ _) = locally_monomorphic t
haftmann@31724
   244
  | locally_monomorphic (_ `|=> t) = locally_monomorphic t
haftmann@25621
   245
  | locally_monomorphic (ICase ((_, ds), _)) = exists (locally_monomorphic o snd) ds;
haftmann@25621
   246
haftmann@25621
   247
haftmann@28688
   248
(** namings **)
haftmann@28663
   249
haftmann@28663
   250
(* policies *)
haftmann@28663
   251
haftmann@28663
   252
local
wenzelm@33172
   253
  fun thyname_of_class thy = #theory_name o Name_Space.the_entry (Sign.class_space thy);
wenzelm@33172
   254
  fun thyname_of_instance thy inst = case AxClass.thynames_of_arity thy inst
wenzelm@33172
   255
   of [] => error ("No such instance: " ^ quote (snd inst ^ " :: " ^ fst inst))
haftmann@28663
   256
    | thyname :: _ => thyname;
haftmann@28706
   257
  fun thyname_of_const thy c = case AxClass.class_of_param thy c
haftmann@28706
   258
   of SOME class => thyname_of_class thy class
haftmann@35299
   259
    | NONE => (case Code.get_type_of_constr_or_abstr thy c
haftmann@35226
   260
       of SOME (tyco, _) => Codegen.thyname_of_type thy tyco
wenzelm@33172
   261
        | NONE => Codegen.thyname_of_const thy c);
haftmann@33420
   262
  fun purify_base "==>" = "follows"
haftmann@33420
   263
    | purify_base "op &" = "and"
haftmann@31036
   264
    | purify_base "op |" = "or"
haftmann@31036
   265
    | purify_base "op -->" = "implies"
haftmann@31036
   266
    | purify_base "op :" = "member"
haftmann@31036
   267
    | purify_base "op =" = "eq"
haftmann@31036
   268
    | purify_base "*" = "product"
haftmann@31036
   269
    | purify_base "+" = "sum"
haftmann@31036
   270
    | purify_base s = Name.desymbolize false s;
haftmann@28663
   271
  fun namify thy get_basename get_thyname name =
haftmann@28663
   272
    let
haftmann@28663
   273
      val prefix = get_thyname thy name;
haftmann@31036
   274
      val base = (purify_base o get_basename) name;
wenzelm@30364
   275
    in Long_Name.append prefix base end;
haftmann@28663
   276
in
haftmann@28663
   277
wenzelm@30364
   278
fun namify_class thy = namify thy Long_Name.base_name thyname_of_class;
haftmann@28663
   279
fun namify_classrel thy = namify thy (fn (class1, class2) => 
wenzelm@33172
   280
    Long_Name.base_name class2 ^ "_" ^ Long_Name.base_name class1)
wenzelm@33172
   281
  (fn thy => thyname_of_class thy o fst);
haftmann@28663
   282
  (*order fits nicely with composed projections*)
haftmann@28688
   283
fun namify_tyco thy "fun" = "Pure.fun"
wenzelm@33172
   284
  | namify_tyco thy tyco = namify thy Long_Name.base_name Codegen.thyname_of_type tyco;
haftmann@28663
   285
fun namify_instance thy = namify thy (fn (class, tyco) => 
wenzelm@30364
   286
  Long_Name.base_name class ^ "_" ^ Long_Name.base_name tyco) thyname_of_instance;
wenzelm@30364
   287
fun namify_const thy = namify thy Long_Name.base_name thyname_of_const;
haftmann@28663
   288
haftmann@28663
   289
end; (* local *)
haftmann@28663
   290
haftmann@28663
   291
haftmann@28688
   292
(* data *)
haftmann@28663
   293
haftmann@28663
   294
datatype naming = Naming of {
haftmann@28663
   295
  class: class Symtab.table * Name.context,
haftmann@30648
   296
  classrel: string Symreltab.table * Name.context,
haftmann@28663
   297
  tyco: string Symtab.table * Name.context,
haftmann@30648
   298
  instance: string Symreltab.table * Name.context,
haftmann@28663
   299
  const: string Symtab.table * Name.context
haftmann@28663
   300
}
haftmann@28663
   301
haftmann@28663
   302
fun dest_Naming (Naming naming) = naming;
haftmann@28663
   303
haftmann@28663
   304
val empty_naming = Naming {
haftmann@28663
   305
  class = (Symtab.empty, Name.context),
haftmann@30648
   306
  classrel = (Symreltab.empty, Name.context),
haftmann@28663
   307
  tyco = (Symtab.empty, Name.context),
haftmann@30648
   308
  instance = (Symreltab.empty, Name.context),
haftmann@28663
   309
  const = (Symtab.empty, Name.context)
haftmann@28663
   310
};
haftmann@28663
   311
haftmann@28663
   312
local
haftmann@28663
   313
  fun mk_naming (class, classrel, tyco, instance, const) =
haftmann@28663
   314
    Naming { class = class, classrel = classrel,
haftmann@28663
   315
      tyco = tyco, instance = instance, const = const };
haftmann@28663
   316
  fun map_naming f (Naming { class, classrel, tyco, instance, const }) =
haftmann@28663
   317
    mk_naming (f (class, classrel, tyco, instance, const));
haftmann@28663
   318
in
haftmann@28663
   319
  fun map_class f = map_naming
haftmann@28663
   320
    (fn (class, classrel, tyco, inst, const) =>
haftmann@28663
   321
      (f class, classrel, tyco, inst, const));
haftmann@28663
   322
  fun map_classrel f = map_naming
haftmann@28663
   323
    (fn (class, classrel, tyco, inst, const) =>
haftmann@28663
   324
      (class, f classrel, tyco, inst, const));
haftmann@28663
   325
  fun map_tyco f = map_naming
haftmann@28663
   326
    (fn (class, classrel, tyco, inst, const) =>
haftmann@28663
   327
      (class, classrel, f tyco, inst, const));
haftmann@28663
   328
  fun map_instance f = map_naming
haftmann@28663
   329
    (fn (class, classrel, tyco, inst, const) =>
haftmann@28663
   330
      (class, classrel, tyco, f inst, const));
haftmann@28663
   331
  fun map_const f = map_naming
haftmann@28663
   332
    (fn (class, classrel, tyco, inst, const) =>
haftmann@28663
   333
      (class, classrel, tyco, inst, f const));
haftmann@28663
   334
end; (*local*)
haftmann@28663
   335
haftmann@28663
   336
fun add_variant update (thing, name) (tab, used) =
haftmann@28663
   337
  let
haftmann@28663
   338
    val (name', used') = yield_singleton Name.variants name used;
haftmann@28663
   339
    val tab' = update (thing, name') tab;
haftmann@28663
   340
  in (tab', used') end;
haftmann@28663
   341
haftmann@28663
   342
fun declare thy mapp lookup update namify thing =
haftmann@28663
   343
  mapp (add_variant update (thing, namify thy thing))
haftmann@28663
   344
  #> `(fn naming => the (lookup naming thing));
haftmann@28663
   345
haftmann@28688
   346
haftmann@28688
   347
(* lookup and declare *)
haftmann@28688
   348
haftmann@28688
   349
local
haftmann@28688
   350
haftmann@28688
   351
val suffix_class = "class";
haftmann@28688
   352
val suffix_classrel = "classrel"
haftmann@28688
   353
val suffix_tyco = "tyco";
haftmann@28688
   354
val suffix_instance = "inst";
haftmann@28688
   355
val suffix_const = "const";
haftmann@28688
   356
haftmann@28688
   357
fun add_suffix nsp NONE = NONE
wenzelm@30364
   358
  | add_suffix nsp (SOME name) = SOME (Long_Name.append name nsp);
haftmann@28688
   359
haftmann@28688
   360
in
haftmann@28688
   361
haftmann@28663
   362
val lookup_class = add_suffix suffix_class
haftmann@28663
   363
  oo Symtab.lookup o fst o #class o dest_Naming;
haftmann@28663
   364
val lookup_classrel = add_suffix suffix_classrel
haftmann@30648
   365
  oo Symreltab.lookup o fst o #classrel o dest_Naming;
haftmann@28663
   366
val lookup_tyco = add_suffix suffix_tyco
haftmann@28663
   367
  oo Symtab.lookup o fst o #tyco o dest_Naming;
haftmann@28663
   368
val lookup_instance = add_suffix suffix_instance
haftmann@30648
   369
  oo Symreltab.lookup o fst o #instance o dest_Naming;
haftmann@28663
   370
val lookup_const = add_suffix suffix_const
haftmann@28663
   371
  oo Symtab.lookup o fst o #const o dest_Naming;
haftmann@28663
   372
haftmann@28663
   373
fun declare_class thy = declare thy map_class
haftmann@28663
   374
  lookup_class Symtab.update_new namify_class;
haftmann@28663
   375
fun declare_classrel thy = declare thy map_classrel
haftmann@30648
   376
  lookup_classrel Symreltab.update_new namify_classrel;
haftmann@28663
   377
fun declare_tyco thy = declare thy map_tyco
haftmann@28663
   378
  lookup_tyco Symtab.update_new namify_tyco;
haftmann@28663
   379
fun declare_instance thy = declare thy map_instance
haftmann@30648
   380
  lookup_instance Symreltab.update_new namify_instance;
haftmann@28663
   381
fun declare_const thy = declare thy map_const
haftmann@28663
   382
  lookup_const Symtab.update_new namify_const;
haftmann@28663
   383
haftmann@31054
   384
fun ensure_declared_const thy const naming =
haftmann@31054
   385
  case lookup_const naming const
haftmann@31054
   386
   of SOME const' => (const', naming)
haftmann@31054
   387
    | NONE => declare_const thy const naming;
haftmann@31054
   388
haftmann@34084
   389
val fun_tyco = "Pure.fun.tyco" (*depends on suffix_tyco and namify_tyco!*);
haftmann@34084
   390
haftmann@28688
   391
val unfold_fun = unfoldr
haftmann@34084
   392
  (fn tyco `%% [ty1, ty2] => if tyco = fun_tyco then SOME (ty1, ty2) else NONE
haftmann@28688
   393
    | _ => NONE); (*depends on suffix_tyco and namify_tyco!*)
haftmann@28688
   394
haftmann@28688
   395
end; (* local *)
haftmann@28688
   396
haftmann@24219
   397
haftmann@27103
   398
(** statements, abstract programs **)
haftmann@24219
   399
haftmann@24219
   400
type typscheme = (vname * sort) list * itype;
haftmann@24918
   401
datatype stmt =
haftmann@27024
   402
    NoStmt
haftmann@35226
   403
  | Fun of string * (typscheme * ((iterm list * iterm) * (thm option * bool)) list)
haftmann@28663
   404
  | Datatype of string * ((vname * sort) list * (string * itype list) list)
haftmann@28663
   405
  | Datatypecons of string * string
haftmann@28663
   406
  | Class of class * (vname * ((class * string) list * (string * itype) list))
haftmann@24219
   407
  | Classrel of class * class
haftmann@28663
   408
  | Classparam of string * class
haftmann@24219
   409
  | Classinst of (class * (string * (vname * sort) list))
haftmann@24219
   410
        * ((class * (string * (string * dict list list))) list
haftmann@28350
   411
      * ((string * const) * (thm * bool)) list);
haftmann@24219
   412
haftmann@27103
   413
type program = stmt Graph.T;
haftmann@24219
   414
haftmann@27103
   415
fun empty_funs program =
haftmann@28663
   416
  Graph.fold (fn (name, (Fun (c, (_, [])), _)) => cons c
haftmann@27103
   417
               | _ => I) program [];
haftmann@24219
   418
haftmann@27711
   419
fun map_terms_bottom_up f (t as IConst _) = f t
haftmann@27711
   420
  | map_terms_bottom_up f (t as IVar _) = f t
haftmann@27711
   421
  | map_terms_bottom_up f (t1 `$ t2) = f
haftmann@27711
   422
      (map_terms_bottom_up f t1 `$ map_terms_bottom_up f t2)
haftmann@31724
   423
  | map_terms_bottom_up f ((v, ty) `|=> t) = f
haftmann@31724
   424
      ((v, ty) `|=> map_terms_bottom_up f t)
haftmann@27711
   425
  | map_terms_bottom_up f (ICase (((t, ty), ps), t0)) = f
haftmann@27711
   426
      (ICase (((map_terms_bottom_up f t, ty), (map o pairself)
haftmann@27711
   427
        (map_terms_bottom_up f) ps), map_terms_bottom_up f t0));
haftmann@27711
   428
haftmann@27711
   429
fun map_terms_stmt f NoStmt = NoStmt
haftmann@28663
   430
  | map_terms_stmt f (Fun (c, (tysm, eqs))) = Fun (c, (tysm, (map o apfst)
haftmann@28663
   431
      (fn (ts, t) => (map f ts, f t)) eqs))
haftmann@27711
   432
  | map_terms_stmt f (stmt as Datatype _) = stmt
haftmann@27711
   433
  | map_terms_stmt f (stmt as Datatypecons _) = stmt
haftmann@27711
   434
  | map_terms_stmt f (stmt as Class _) = stmt
haftmann@27711
   435
  | map_terms_stmt f (stmt as Classrel _) = stmt
haftmann@27711
   436
  | map_terms_stmt f (stmt as Classparam _) = stmt
haftmann@33990
   437
  | map_terms_stmt f (Classinst (arity, (superinsts, classparams))) =
haftmann@33990
   438
      Classinst (arity, (superinsts, (map o apfst o apsnd) (fn const =>
haftmann@33990
   439
        case f (IConst const) of IConst const' => const') classparams));
haftmann@27711
   440
haftmann@27103
   441
fun is_cons program name = case Graph.get_node program name
haftmann@24219
   442
 of Datatypecons _ => true
haftmann@24219
   443
  | _ => false;
haftmann@24219
   444
haftmann@27103
   445
fun contr_classparam_typs program name = case Graph.get_node program name
haftmann@28663
   446
 of Classparam (_, class) => let
haftmann@28663
   447
        val Class (_, (_, (_, params))) = Graph.get_node program class;
haftmann@25621
   448
        val SOME ty = AList.lookup (op =) params name;
haftmann@25621
   449
        val (tys, res_ty) = unfold_fun ty;
haftmann@25621
   450
        fun no_tyvar (_ `%% tys) = forall no_tyvar tys
haftmann@25621
   451
          | no_tyvar (ITyVar _) = false;
haftmann@25621
   452
      in if no_tyvar res_ty
haftmann@25621
   453
        then map (fn ty => if no_tyvar ty then NONE else SOME ty) tys
haftmann@25621
   454
        else []
haftmann@25621
   455
      end
haftmann@25621
   456
  | _ => [];
haftmann@25621
   457
haftmann@32895
   458
fun labelled_name thy program name = case Graph.get_node program name
haftmann@32895
   459
 of Fun (c, _) => quote (Code.string_of_const thy c)
haftmann@32895
   460
  | Datatype (tyco, _) => "type " ^ quote (Sign.extern_type thy tyco)
haftmann@32895
   461
  | Datatypecons (c, _) => quote (Code.string_of_const thy c)
haftmann@32895
   462
  | Class (class, _) => "class " ^ quote (Sign.extern_class thy class)
haftmann@32895
   463
  | Classrel (sub, super) => let
haftmann@32895
   464
        val Class (sub, _) = Graph.get_node program sub
haftmann@32895
   465
        val Class (super, _) = Graph.get_node program super
haftmann@32895
   466
      in quote (Sign.extern_class thy sub ^ " < " ^ Sign.extern_class thy super) end
haftmann@32895
   467
  | Classparam (c, _) => quote (Code.string_of_const thy c)
haftmann@32895
   468
  | Classinst ((class, (tyco, _)), _) => let
haftmann@32895
   469
        val Class (class, _) = Graph.get_node program class
haftmann@32895
   470
        val Datatype (tyco, _) = Graph.get_node program tyco
haftmann@32895
   471
      in quote (Sign.extern_type thy tyco ^ " :: " ^ Sign.extern_class thy class) end
haftmann@32895
   472
haftmann@32895
   473
fun group_stmts thy program =
haftmann@32895
   474
  let
haftmann@32895
   475
    fun is_fun (_, Fun _) = true | is_fun _ = false;
haftmann@32895
   476
    fun is_datatypecons (_, Datatypecons _) = true | is_datatypecons _ = false;
haftmann@32895
   477
    fun is_datatype (_, Datatype _) = true | is_datatype _ = false;
haftmann@32895
   478
    fun is_class (_, Class _) = true | is_class _ = false;
haftmann@32895
   479
    fun is_classrel (_, Classrel _) = true | is_classrel _ = false;
haftmann@32895
   480
    fun is_classparam (_, Classparam _) = true | is_classparam _ = false;
haftmann@32895
   481
    fun is_classinst (_, Classinst _) = true | is_classinst _ = false;
haftmann@32895
   482
    fun group stmts =
haftmann@32895
   483
      if forall (is_datatypecons orf is_datatype) stmts
haftmann@32895
   484
      then (filter is_datatype stmts, [], ([], []))
haftmann@32895
   485
      else if forall (is_class orf is_classrel orf is_classparam) stmts
haftmann@32895
   486
      then ([], filter is_class stmts, ([], []))
haftmann@32895
   487
      else if forall (is_fun orf is_classinst) stmts
haftmann@32895
   488
      then ([], [], List.partition is_fun stmts)
haftmann@32895
   489
      else error ("Illegal mutual dependencies: " ^
haftmann@32895
   490
        (commas o map (labelled_name thy program o fst)) stmts)
haftmann@32895
   491
  in
haftmann@32895
   492
    rev (Graph.strong_conn program)
haftmann@32895
   493
    |> map (AList.make (Graph.get_node program))
haftmann@32895
   494
    |> map group
haftmann@32895
   495
  end;
haftmann@32895
   496
haftmann@24219
   497
haftmann@27103
   498
(** translation kernel **)
haftmann@24219
   499
haftmann@28724
   500
(* generic mechanisms *)
haftmann@28724
   501
haftmann@28663
   502
fun ensure_stmt lookup declare generate thing (dep, (naming, program)) =
haftmann@24219
   503
  let
haftmann@28706
   504
    fun add_dep name = case dep of NONE => I
haftmann@28706
   505
      | SOME dep => Graph.add_edge (dep, name);
haftmann@28706
   506
    val (name, naming') = case lookup naming thing
haftmann@28706
   507
     of SOME name => (name, naming)
haftmann@28706
   508
      | NONE => declare thing naming;
haftmann@28706
   509
  in case try (Graph.get_node program) name
haftmann@28706
   510
   of SOME stmt => program
haftmann@28663
   511
        |> add_dep name
haftmann@28706
   512
        |> pair naming'
haftmann@28663
   513
        |> pair dep
haftmann@28663
   514
        |> pair name
haftmann@28706
   515
    | NONE => program
haftmann@28706
   516
        |> Graph.default_node (name, NoStmt)
haftmann@28706
   517
        |> add_dep name
haftmann@28706
   518
        |> pair naming'
haftmann@28706
   519
        |> curry generate (SOME name)
haftmann@28706
   520
        ||> snd
haftmann@28706
   521
        |-> (fn stmt => (apsnd o Graph.map_node name) (K stmt))
haftmann@28706
   522
        |> pair dep
haftmann@28706
   523
        |> pair name
haftmann@24219
   524
  end;
haftmann@24219
   525
haftmann@35226
   526
fun translation_error thy some_thm msg sub_msg =
haftmann@35226
   527
  let
haftmann@35226
   528
    val err_thm = case some_thm
haftmann@35226
   529
     of SOME thm => "\n(in code equation " ^ Display.string_of_thm_global thy thm ^ ")" | NONE => "";
haftmann@35226
   530
  in error (msg ^ err_thm ^ ":\n" ^ sub_msg) end;
haftmann@35226
   531
haftmann@35226
   532
fun not_wellsorted thy some_thm ty sort e =
haftmann@26972
   533
  let
haftmann@26972
   534
    val err_class = Sorts.class_error (Syntax.pp_global thy) e;
haftmann@26972
   535
    val err_typ = "Type " ^ Syntax.string_of_typ_global thy ty ^ " not of sort "
haftmann@26972
   536
      ^ Syntax.string_of_sort_global thy sort;
haftmann@35226
   537
  in translation_error thy some_thm "Wellsortedness error" (err_typ ^ "\n" ^ err_class) end;
haftmann@26972
   538
haftmann@28724
   539
haftmann@28724
   540
(* translation *)
haftmann@28724
   541
haftmann@32873
   542
fun ensure_tyco thy algbr eqngr tyco =
haftmann@30932
   543
  let
haftmann@30932
   544
    val stmt_datatype =
haftmann@30932
   545
      let
haftmann@35299
   546
        val (vs, cos) = Code.get_type thy tyco;
haftmann@30932
   547
      in
haftmann@32873
   548
        fold_map (translate_tyvar_sort thy algbr eqngr) vs
haftmann@30932
   549
        ##>> fold_map (fn (c, tys) =>
haftmann@32873
   550
          ensure_const thy algbr eqngr c
haftmann@32873
   551
          ##>> fold_map (translate_typ thy algbr eqngr) tys) cos
haftmann@30932
   552
        #>> (fn info => Datatype (tyco, info))
haftmann@30932
   553
      end;
haftmann@30932
   554
  in ensure_stmt lookup_tyco (declare_tyco thy) stmt_datatype tyco end
haftmann@32873
   555
and ensure_const thy algbr eqngr c =
haftmann@30932
   556
  let
haftmann@30932
   557
    fun stmt_datatypecons tyco =
haftmann@32873
   558
      ensure_tyco thy algbr eqngr tyco
haftmann@30932
   559
      #>> (fn tyco => Datatypecons (c, tyco));
haftmann@30932
   560
    fun stmt_classparam class =
haftmann@32873
   561
      ensure_class thy algbr eqngr class
haftmann@30932
   562
      #>> (fn class => Classparam (c, class));
haftmann@34891
   563
    fun stmt_fun cert =
haftmann@32872
   564
      let
haftmann@35226
   565
        val ((vs, ty), eqns) = Code.equations_of_cert thy cert;
haftmann@32872
   566
      in
haftmann@32873
   567
        fold_map (translate_tyvar_sort thy algbr eqngr) vs
haftmann@32873
   568
        ##>> translate_typ thy algbr eqngr ty
haftmann@32873
   569
        ##>> fold_map (translate_eqn thy algbr eqngr) eqns
haftmann@32872
   570
        #>> (fn info => Fun (c, info))
haftmann@32872
   571
      end;
haftmann@35299
   572
    val stmt_const = case Code.get_type_of_constr_or_abstr thy c
haftmann@35226
   573
     of SOME (tyco, _) => stmt_datatypecons tyco
haftmann@30932
   574
      | NONE => (case AxClass.class_of_param thy c
haftmann@30932
   575
         of SOME class => stmt_classparam class
haftmann@34891
   576
          | NONE => stmt_fun (Code_Preproc.cert eqngr c))
haftmann@30932
   577
  in ensure_stmt lookup_const (declare_const thy) stmt_const c end
haftmann@32873
   578
and ensure_class thy (algbr as (_, algebra)) eqngr class =
haftmann@24918
   579
  let
haftmann@28924
   580
    val superclasses = (Sorts.minimize_sort algebra o Sorts.super_classes algebra) class;
wenzelm@24969
   581
    val cs = #params (AxClass.get_info thy class);
haftmann@24918
   582
    val stmt_class =
haftmann@32873
   583
      fold_map (fn superclass => ensure_class thy algbr eqngr superclass
haftmann@32873
   584
        ##>> ensure_classrel thy algbr eqngr (class, superclass)) superclasses
haftmann@32873
   585
      ##>> fold_map (fn (c, ty) => ensure_const thy algbr eqngr c
haftmann@32873
   586
        ##>> translate_typ thy algbr eqngr ty) cs
haftmann@28663
   587
      #>> (fn info => Class (class, (unprefix "'" Name.aT, info)))
haftmann@28663
   588
  in ensure_stmt lookup_class (declare_class thy) stmt_class class end
haftmann@32873
   589
and ensure_classrel thy algbr eqngr (subclass, superclass) =
haftmann@24918
   590
  let
haftmann@24918
   591
    val stmt_classrel =
haftmann@32873
   592
      ensure_class thy algbr eqngr subclass
haftmann@32873
   593
      ##>> ensure_class thy algbr eqngr superclass
haftmann@24918
   594
      #>> Classrel;
haftmann@28663
   595
  in ensure_stmt lookup_classrel (declare_classrel thy) stmt_classrel (subclass, superclass) end
haftmann@32873
   596
and ensure_inst thy (algbr as (_, algebra)) eqngr (class, tyco) =
haftmann@24918
   597
  let
haftmann@28924
   598
    val superclasses = (Sorts.minimize_sort algebra o Sorts.super_classes algebra) class;
wenzelm@24969
   599
    val classparams = these (try (#params o AxClass.get_info thy) class);
haftmann@24918
   600
    val vs = Name.names Name.context "'a" (Sorts.mg_domain algebra tyco [class]);
haftmann@24918
   601
    val sorts' = Sorts.mg_domain (Sign.classes_of thy) tyco [class];
haftmann@24918
   602
    val vs' = map2 (fn (v, sort1) => fn sort2 => (v,
haftmann@24918
   603
      Sorts.inter_sort (Sign.classes_of thy) (sort1, sort2))) vs sorts';
haftmann@24918
   604
    val arity_typ = Type (tyco, map TFree vs);
haftmann@24918
   605
    val arity_typ' = Type (tyco, map (fn (v, sort) => TVar ((v, 0), sort)) vs');
haftmann@28688
   606
    fun translate_superarity superclass =
haftmann@32873
   607
      ensure_class thy algbr eqngr superclass
haftmann@32873
   608
      ##>> ensure_classrel thy algbr eqngr (class, superclass)
haftmann@32873
   609
      ##>> translate_dicts thy algbr eqngr NONE (arity_typ, [superclass])
haftmann@24918
   610
      #>> (fn ((superclass, classrel), [DictConst (inst, dss)]) =>
haftmann@24918
   611
            (superclass, (classrel, (inst, dss))));
haftmann@28688
   612
    fun translate_classparam_inst (c, ty) =
haftmann@24918
   613
      let
haftmann@24918
   614
        val c_inst = Const (c, map_type_tfree (K arity_typ') ty);
haftmann@25597
   615
        val thm = AxClass.unoverload_conv thy (Thm.cterm_of thy c_inst);
wenzelm@35845
   616
        val c_ty = (apsnd Logic.unvarifyT_global o dest_Const o snd
haftmann@24918
   617
          o Logic.dest_equals o Thm.prop_of) thm;
haftmann@24918
   618
      in
haftmann@32873
   619
        ensure_const thy algbr eqngr c
haftmann@35226
   620
        ##>> translate_const thy algbr eqngr NONE (SOME thm) c_ty
haftmann@28350
   621
        #>> (fn (c, IConst c_inst) => ((c, c_inst), (thm, true)))
haftmann@24918
   622
      end;
haftmann@24918
   623
    val stmt_inst =
haftmann@32873
   624
      ensure_class thy algbr eqngr class
haftmann@32873
   625
      ##>> ensure_tyco thy algbr eqngr tyco
haftmann@32873
   626
      ##>> fold_map (translate_tyvar_sort thy algbr eqngr) vs
haftmann@28688
   627
      ##>> fold_map translate_superarity superclasses
haftmann@28688
   628
      ##>> fold_map translate_classparam_inst classparams
haftmann@33990
   629
      #>> (fn ((((class, tyco), arity), superinsts), classparams) =>
haftmann@33990
   630
             Classinst ((class, (tyco, arity)), (superinsts, classparams)));
haftmann@28663
   631
  in ensure_stmt lookup_instance (declare_instance thy) stmt_inst (class, tyco) end
haftmann@32873
   632
and translate_typ thy algbr eqngr (TFree (v, _)) =
haftmann@30932
   633
      pair (ITyVar (unprefix "'" v))
haftmann@32873
   634
  | translate_typ thy algbr eqngr (Type (tyco, tys)) =
haftmann@32873
   635
      ensure_tyco thy algbr eqngr tyco
haftmann@32873
   636
      ##>> fold_map (translate_typ thy algbr eqngr) tys
haftmann@30932
   637
      #>> (fn (tyco, tys) => tyco `%% tys)
haftmann@35226
   638
and translate_term thy algbr eqngr some_abs some_thm (Const (c, ty)) =
haftmann@35226
   639
      translate_app thy algbr eqngr some_abs some_thm ((c, ty), [])
haftmann@35226
   640
  | translate_term thy algbr eqngr some_abs some_thm (Free (v, _)) =
haftmann@31889
   641
      pair (IVar (SOME v))
haftmann@35226
   642
  | translate_term thy algbr eqngr some_abs some_thm (Abs (v, ty, t)) =
haftmann@24918
   643
      let
haftmann@32273
   644
        val (v', t') = Syntax.variant_abs (Name.desymbolize false v, ty, t);
haftmann@32273
   645
        val v'' = if member (op =) (Term.add_free_names t' []) v'
haftmann@32273
   646
          then SOME v' else NONE
haftmann@24918
   647
      in
haftmann@32873
   648
        translate_typ thy algbr eqngr ty
haftmann@35226
   649
        ##>> translate_term thy algbr eqngr some_abs some_thm t'
haftmann@32273
   650
        #>> (fn (ty, t) => (v'', ty) `|=> t)
haftmann@24918
   651
      end
haftmann@35226
   652
  | translate_term thy algbr eqngr some_abs some_thm (t as _ $ _) =
haftmann@24918
   653
      case strip_comb t
haftmann@24918
   654
       of (Const (c, ty), ts) =>
haftmann@35226
   655
            translate_app thy algbr eqngr some_abs some_thm ((c, ty), ts)
haftmann@24918
   656
        | (t', ts) =>
haftmann@35226
   657
            translate_term thy algbr eqngr some_abs some_thm t'
haftmann@35226
   658
            ##>> fold_map (translate_term thy algbr eqngr some_abs some_thm) ts
haftmann@24918
   659
            #>> (fn (t, ts) => t `$$ ts)
haftmann@35226
   660
and translate_eqn thy algbr eqngr ((some_abs, (args, rhs)), (some_thm, proper)) =
haftmann@35226
   661
  fold_map (translate_term thy algbr eqngr some_abs some_thm) args
haftmann@35226
   662
  ##>> translate_term thy algbr eqngr some_abs some_thm rhs
haftmann@35226
   663
  #>> rpair (some_thm, proper)
haftmann@35226
   664
and translate_const thy algbr eqngr some_abs some_thm (c, ty) =
haftmann@30932
   665
  let
haftmann@35226
   666
    val _ = if (case some_abs of NONE => true | SOME abs => not (c = abs))
haftmann@35226
   667
        andalso Code.is_abstr thy c
haftmann@35226
   668
        then translation_error thy some_thm
haftmann@35226
   669
          "Abstraction violation" ("constant " ^ Code.string_of_const thy c)
haftmann@35226
   670
      else ()
haftmann@26972
   671
    val tys = Sign.const_typargs thy (c, ty);
haftmann@32873
   672
    val sorts = Code_Preproc.sortargs eqngr c;
haftmann@26972
   673
    val tys_args = (fst o Term.strip_type) ty;
haftmann@26972
   674
  in
haftmann@32873
   675
    ensure_const thy algbr eqngr c
haftmann@32873
   676
    ##>> fold_map (translate_typ thy algbr eqngr) tys
haftmann@35226
   677
    ##>> fold_map (translate_dicts thy algbr eqngr some_thm) (tys ~~ sorts)
haftmann@32873
   678
    ##>> fold_map (translate_typ thy algbr eqngr) tys_args
haftmann@31049
   679
    #>> (fn (((c, tys), iss), tys_args) => IConst (c, ((tys, iss), tys_args)))
haftmann@26972
   680
  end
haftmann@35226
   681
and translate_app_const thy algbr eqngr some_abs some_thm (c_ty, ts) =
haftmann@35226
   682
  translate_const thy algbr eqngr some_abs some_thm c_ty
haftmann@35226
   683
  ##>> fold_map (translate_term thy algbr eqngr some_abs some_thm) ts
haftmann@24918
   684
  #>> (fn (t, ts) => t `$$ ts)
haftmann@35226
   685
and translate_case thy algbr eqngr some_abs some_thm (num_args, (t_pos, case_pats)) (c_ty, ts) =
haftmann@24918
   686
  let
haftmann@31892
   687
    fun arg_types num_args ty = (fst o chop num_args o fst o strip_type) ty;
haftmann@31892
   688
    val tys = arg_types num_args (snd c_ty);
haftmann@29952
   689
    val ty = nth tys t_pos;
haftmann@31957
   690
    fun mk_constr c t = let val n = Code.args_number thy c
haftmann@31957
   691
      in ((c, arg_types n (fastype_of t) ---> ty), n) end;
haftmann@31892
   692
    val constrs = if null case_pats then []
haftmann@31892
   693
      else map2 mk_constr case_pats (nth_drop t_pos ts);
haftmann@31892
   694
    fun casify naming constrs ty ts =
haftmann@24918
   695
      let
haftmann@31935
   696
        val undefineds = map_filter (lookup_const naming) (Code.undefineds thy);
haftmann@31935
   697
        fun collapse_clause vs_map ts body =
haftmann@31935
   698
          let
haftmann@31935
   699
          in case body
haftmann@31935
   700
           of IConst (c, _) => if member (op =) undefineds c
haftmann@31935
   701
                then []
haftmann@31935
   702
                else [(ts, body)]
haftmann@31935
   703
            | ICase (((IVar (SOME v), _), subclauses), _) =>
haftmann@31935
   704
                if forall (fn (pat', body') => exists_var pat' v
haftmann@31935
   705
                  orelse not (exists_var body' v)) subclauses
haftmann@31935
   706
                then case AList.lookup (op =) vs_map v
haftmann@31935
   707
                 of SOME i => maps (fn (pat', body') =>
haftmann@31935
   708
                      collapse_clause (AList.delete (op =) v vs_map)
haftmann@31935
   709
                        (nth_map i (K pat') ts) body') subclauses
haftmann@31935
   710
                  | NONE => [(ts, body)]
haftmann@31935
   711
                else [(ts, body)]
haftmann@31935
   712
            | _ => [(ts, body)]
haftmann@31935
   713
          end;
haftmann@31935
   714
        fun mk_clause mk tys t =
haftmann@31935
   715
          let
haftmann@31935
   716
            val (vs, body) = unfold_abs_eta tys t;
haftmann@31935
   717
            val vs_map = fold_index (fn (i, (SOME v, _)) => cons (v, i) | _ => I) vs [];
haftmann@31935
   718
            val ts = map (IVar o fst) vs;
haftmann@31935
   719
          in map mk (collapse_clause vs_map ts body) end;
haftmann@31892
   720
        val t = nth ts t_pos;
haftmann@31892
   721
        val ts_clause = nth_drop t_pos ts;
haftmann@31935
   722
        val clauses = if null case_pats
haftmann@31935
   723
          then mk_clause (fn ([t], body) => (t, body)) [ty] (the_single ts_clause)
haftmann@31935
   724
          else maps (fn ((constr as IConst (_, (_, tys)), n), t) =>
haftmann@33957
   725
            mk_clause (fn (ts, body) => (constr `$$ ts, body)) (take n tys) t)
haftmann@31935
   726
              (constrs ~~ ts_clause);
haftmann@31892
   727
      in ((t, ty), clauses) end;
haftmann@24918
   728
  in
haftmann@35226
   729
    translate_const thy algbr eqngr some_abs some_thm c_ty
haftmann@35226
   730
    ##>> fold_map (fn (constr, n) => translate_const thy algbr eqngr some_abs some_thm constr #>> rpair n) constrs
haftmann@32873
   731
    ##>> translate_typ thy algbr eqngr ty
haftmann@35226
   732
    ##>> fold_map (translate_term thy algbr eqngr some_abs some_thm) ts
haftmann@31892
   733
    #-> (fn (((t, constrs), ty), ts) =>
haftmann@31892
   734
      `(fn (_, (naming, _)) => ICase (casify naming constrs ty ts, t `$$ ts)))
haftmann@24918
   735
  end
haftmann@35226
   736
and translate_app_case thy algbr eqngr some_abs some_thm (case_scheme as (num_args, _)) ((c, ty), ts) =
haftmann@29973
   737
  if length ts < num_args then
haftmann@29973
   738
    let
haftmann@29973
   739
      val k = length ts;
haftmann@33957
   740
      val tys = (take (num_args - k) o drop k o fst o strip_type) ty;
haftmann@29973
   741
      val ctxt = (fold o fold_aterms) Term.declare_term_frees ts Name.context;
haftmann@29973
   742
      val vs = Name.names ctxt "a" tys;
haftmann@29973
   743
    in
haftmann@32873
   744
      fold_map (translate_typ thy algbr eqngr) tys
haftmann@35226
   745
      ##>> translate_case thy algbr eqngr some_abs some_thm case_scheme ((c, ty), ts @ map Free vs)
haftmann@31888
   746
      #>> (fn (tys, t) => map2 (fn (v, _) => pair (SOME v)) vs tys `|==> t)
haftmann@29973
   747
    end
haftmann@29973
   748
  else if length ts > num_args then
haftmann@35226
   749
    translate_case thy algbr eqngr some_abs some_thm case_scheme ((c, ty), take num_args ts)
haftmann@35226
   750
    ##>> fold_map (translate_term thy algbr eqngr some_abs some_thm) (drop num_args ts)
haftmann@29973
   751
    #>> (fn (t, ts) => t `$$ ts)
haftmann@29973
   752
  else
haftmann@35226
   753
    translate_case thy algbr eqngr some_abs some_thm case_scheme ((c, ty), ts)
haftmann@35226
   754
and translate_app thy algbr eqngr some_abs some_thm (c_ty_ts as ((c, _), _)) =
haftmann@29973
   755
  case Code.get_case_scheme thy c
haftmann@35226
   756
   of SOME case_scheme => translate_app_case thy algbr eqngr some_abs some_thm case_scheme c_ty_ts
haftmann@35226
   757
    | NONE => translate_app_const thy algbr eqngr some_abs some_thm c_ty_ts
haftmann@32873
   758
and translate_tyvar_sort thy (algbr as (proj_sort, _)) eqngr (v, sort) =
haftmann@32873
   759
  fold_map (ensure_class thy algbr eqngr) (proj_sort sort)
haftmann@30932
   760
  #>> (fn sort => (unprefix "'" v, sort))
haftmann@35226
   761
and translate_dicts thy (algbr as (proj_sort, algebra)) eqngr some_thm (ty, sort) =
haftmann@30932
   762
  let
haftmann@30932
   763
    datatype typarg =
haftmann@30932
   764
        Global of (class * string) * typarg list list
haftmann@30932
   765
      | Local of (class * class) list * (string * (int * sort));
haftmann@30932
   766
    fun class_relation (Global ((_, tyco), yss), _) class =
haftmann@30932
   767
          Global ((class, tyco), yss)
haftmann@30932
   768
      | class_relation (Local (classrels, v), subclass) superclass =
haftmann@30932
   769
          Local ((subclass, superclass) :: classrels, v);
haftmann@30932
   770
    fun type_constructor tyco yss class =
haftmann@30932
   771
      Global ((class, tyco), (map o map) fst yss);
haftmann@30932
   772
    fun type_variable (TFree (v, sort)) =
haftmann@30932
   773
      let
haftmann@30932
   774
        val sort' = proj_sort sort;
haftmann@30932
   775
      in map_index (fn (n, class) => (Local ([], (v, (n, sort'))), class)) sort' end;
wenzelm@32795
   776
    val typargs = Sorts.of_sort_derivation algebra
wenzelm@35961
   777
      {class_relation = Sorts.classrel_derivation algebra class_relation,
wenzelm@35961
   778
       type_constructor = type_constructor,
haftmann@30932
   779
       type_variable = type_variable} (ty, proj_sort sort)
haftmann@35226
   780
      handle Sorts.CLASS_ERROR e => not_wellsorted thy some_thm ty sort e;
haftmann@30932
   781
    fun mk_dict (Global (inst, yss)) =
haftmann@32873
   782
          ensure_inst thy algbr eqngr inst
haftmann@30932
   783
          ##>> (fold_map o fold_map) mk_dict yss
haftmann@30932
   784
          #>> (fn (inst, dss) => DictConst (inst, dss))
haftmann@31962
   785
      | mk_dict (Local (classrels, (v, (n, sort)))) =
haftmann@32873
   786
          fold_map (ensure_classrel thy algbr eqngr) classrels
haftmann@31962
   787
          #>> (fn classrels => DictVar (classrels, (unprefix "'" v, (n, length sort))))
haftmann@30932
   788
  in fold_map mk_dict typargs end;
haftmann@24918
   789
haftmann@25969
   790
haftmann@27103
   791
(* store *)
haftmann@27103
   792
haftmann@34173
   793
structure Program = Code_Data
haftmann@27103
   794
(
haftmann@28663
   795
  type T = naming * program;
haftmann@28663
   796
  val empty = (empty_naming, Graph.empty);
haftmann@27103
   797
);
haftmann@27103
   798
haftmann@34251
   799
fun invoke_generation thy (algebra, eqngr) f name =
haftmann@34251
   800
  Program.change_yield thy (fn naming_program => (NONE, naming_program)
haftmann@32873
   801
    |> f thy algebra eqngr name
haftmann@28663
   802
    |-> (fn name => fn (_, naming_program) => (name, naming_program)));
haftmann@27103
   803
haftmann@27103
   804
haftmann@27103
   805
(* program generation *)
haftmann@27103
   806
haftmann@27103
   807
fun consts_program thy cs =
haftmann@27103
   808
  let
haftmann@28663
   809
    fun project_consts cs (naming, program) =
haftmann@27103
   810
      let
haftmann@27103
   811
        val cs_all = Graph.all_succs program cs;
haftmann@28663
   812
      in (cs, (naming, Graph.subgraph (member (op =) cs_all) program)) end;
haftmann@32873
   813
    fun generate_consts thy algebra eqngr =
haftmann@32873
   814
      fold_map (ensure_const thy algebra eqngr);
haftmann@27103
   815
  in
haftmann@31125
   816
    invoke_generation thy (Code_Preproc.obtain thy cs []) generate_consts cs
haftmann@27103
   817
    |-> project_consts
haftmann@27103
   818
  end;
haftmann@27103
   819
haftmann@27103
   820
haftmann@27103
   821
(* value evaluation *)
haftmann@25969
   822
haftmann@32873
   823
fun ensure_value thy algbr eqngr t =
haftmann@24918
   824
  let
haftmann@24918
   825
    val ty = fastype_of t;
haftmann@24918
   826
    val vs = fold_term_types (K (fold_atyps (insert (eq_fst op =)
haftmann@24918
   827
      o dest_TFree))) t [];
haftmann@24918
   828
    val stmt_value =
haftmann@32873
   829
      fold_map (translate_tyvar_sort thy algbr eqngr) vs
haftmann@32873
   830
      ##>> translate_typ thy algbr eqngr ty
haftmann@35226
   831
      ##>> translate_term thy algbr eqngr NONE NONE (Code.subst_signatures thy t)
haftmann@28663
   832
      #>> (fn ((vs, ty), t) => Fun
haftmann@35226
   833
        (Term.dummy_patternN, ((vs, ty), [(([], t), (NONE, true))])));
haftmann@31063
   834
    fun term_value (dep, (naming, program1)) =
haftmann@25969
   835
      let
haftmann@30947
   836
        val Fun (_, (vs_ty, [(([], t), _)])) =
haftmann@28663
   837
          Graph.get_node program1 Term.dummy_patternN;
haftmann@28663
   838
        val deps = Graph.imm_succs program1 Term.dummy_patternN;
haftmann@28663
   839
        val program2 = Graph.del_nodes [Term.dummy_patternN] program1;
haftmann@27103
   840
        val deps_all = Graph.all_succs program2 deps;
haftmann@27103
   841
        val program3 = Graph.subgraph (member (op =) deps_all) program2;
haftmann@31063
   842
      in (((naming, program3), ((vs_ty, t), deps)), (dep, (naming, program2))) end;
haftmann@26011
   843
  in
haftmann@28663
   844
    ensure_stmt ((K o K) NONE) pair stmt_value Term.dummy_patternN
haftmann@26011
   845
    #> snd
haftmann@31063
   846
    #> term_value
haftmann@26011
   847
  end;
haftmann@24219
   848
haftmann@32873
   849
fun base_evaluator thy evaluator algebra eqngr vs t =
haftmann@30942
   850
  let
haftmann@31063
   851
    val (((naming, program), (((vs', ty'), t'), deps)), _) =
haftmann@32873
   852
      invoke_generation thy (algebra, eqngr) ensure_value t;
haftmann@30947
   853
    val vs'' = map (fn (v, _) => (v, (the o AList.lookup (op =) vs o prefix "'") v)) vs';
haftmann@31063
   854
  in evaluator naming program ((vs'', (vs', ty')), t') deps end;
haftmann@30942
   855
haftmann@32123
   856
fun eval_conv thy = Code_Preproc.eval_conv thy o base_evaluator thy;
haftmann@32123
   857
fun eval thy postproc = Code_Preproc.eval thy postproc o base_evaluator thy;
haftmann@30942
   858
haftmann@30942
   859
haftmann@30942
   860
(** diagnostic commands **)
haftmann@30942
   861
haftmann@31036
   862
fun read_const_exprs thy =
haftmann@31036
   863
  let
haftmann@31036
   864
    fun consts_of some_thyname =
haftmann@31036
   865
      let
haftmann@31036
   866
        val thy' = case some_thyname
haftmann@31036
   867
         of SOME thyname => ThyInfo.the_theory thyname thy
haftmann@31036
   868
          | NONE => thy;
haftmann@31036
   869
        val cs = Symtab.fold (fn (c, (_, NONE)) => cons c | _ => I)
haftmann@31036
   870
          ((snd o #constants o Consts.dest o #consts o Sign.rep_sg) thy') [];
haftmann@34013
   871
        fun belongs_here c = forall
haftmann@34013
   872
          (fn thy'' => not (Sign.declared_const thy'' c)) (Theory.parents_of thy')
haftmann@34013
   873
      in if is_some some_thyname then filter belongs_here cs else cs end;
haftmann@31036
   874
    fun read_const_expr "*" = ([], consts_of NONE)
haftmann@31036
   875
      | read_const_expr s = if String.isSuffix ".*" s
haftmann@31036
   876
          then ([], consts_of (SOME (unsuffix ".*" s)))
haftmann@31156
   877
          else ([Code.read_const thy s], []);
haftmann@31036
   878
  in pairself flat o split_list o map read_const_expr end;
haftmann@31036
   879
haftmann@30942
   880
fun code_depgr thy consts =
haftmann@30942
   881
  let
haftmann@31125
   882
    val (_, eqngr) = Code_Preproc.obtain thy consts [];
haftmann@34173
   883
    val all_consts = Graph.all_succs eqngr consts;
haftmann@34891
   884
  in Graph.subgraph (member (op =) all_consts) eqngr end;
haftmann@30942
   885
haftmann@31125
   886
fun code_thms thy = Pretty.writeln o Code_Preproc.pretty thy o code_depgr thy;
haftmann@30942
   887
haftmann@30942
   888
fun code_deps thy consts =
haftmann@27103
   889
  let
haftmann@30942
   890
    val eqngr = code_depgr thy consts;
haftmann@30942
   891
    val constss = Graph.strong_conn eqngr;
haftmann@30942
   892
    val mapping = Symtab.empty |> fold (fn consts => fold (fn const =>
haftmann@30942
   893
      Symtab.update (const, consts)) consts) constss;
haftmann@30942
   894
    fun succs consts = consts
haftmann@30942
   895
      |> maps (Graph.imm_succs eqngr)
haftmann@30942
   896
      |> subtract (op =) consts
haftmann@30942
   897
      |> map (the o Symtab.lookup mapping)
haftmann@30942
   898
      |> distinct (op =);
haftmann@30942
   899
    val conn = [] |> fold (fn consts => cons (consts, succs consts)) constss;
haftmann@31156
   900
    fun namify consts = map (Code.string_of_const thy) consts
haftmann@30942
   901
      |> commas;
haftmann@30942
   902
    val prgr = map (fn (consts, constss) =>
haftmann@30942
   903
      { name = namify consts, ID = namify consts, dir = "", unfold = true,
haftmann@30942
   904
        path = "", parents = map namify constss }) conn;
haftmann@30942
   905
  in Present.display_graph prgr end;
haftmann@30942
   906
haftmann@30942
   907
local
haftmann@27103
   908
haftmann@30942
   909
structure P = OuterParse
haftmann@30942
   910
and K = OuterKeyword
haftmann@30942
   911
haftmann@31036
   912
fun code_thms_cmd thy = code_thms thy o op @ o read_const_exprs thy;
haftmann@31036
   913
fun code_deps_cmd thy = code_deps thy o op @ o read_const_exprs thy;
haftmann@30942
   914
haftmann@30942
   915
in
haftmann@30942
   916
haftmann@30942
   917
val _ =
haftmann@30942
   918
  OuterSyntax.improper_command "code_thms" "print system of code equations for code" OuterKeyword.diag
haftmann@34173
   919
    (Scan.repeat1 P.term_group
haftmann@30942
   920
      >> (fn cs => Toplevel.no_timing o Toplevel.unknown_theory
haftmann@30942
   921
        o Toplevel.keep ((fn thy => code_thms_cmd thy cs) o Toplevel.theory_of)));
haftmann@30942
   922
haftmann@30942
   923
val _ =
haftmann@30942
   924
  OuterSyntax.improper_command "code_deps" "visualize dependencies of code equations for code" OuterKeyword.diag
haftmann@34173
   925
    (Scan.repeat1 P.term_group
haftmann@30942
   926
      >> (fn cs => Toplevel.no_timing o Toplevel.unknown_theory
haftmann@30942
   927
        o Toplevel.keep ((fn thy => code_deps_cmd thy cs) o Toplevel.theory_of)));
haftmann@30942
   928
haftmann@30942
   929
end;
haftmann@27103
   930
haftmann@24219
   931
end; (*struct*)
haftmann@24219
   932
haftmann@24219
   933
haftmann@28054
   934
structure Basic_Code_Thingol: BASIC_CODE_THINGOL = Code_Thingol;