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