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