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