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