src/Tools/code/code_thingol.ML
author haftmann
Mon Dec 01 12:17:02 2008 +0100 (2008-12-01)
changeset 28924 5c8781b7d6a4
parent 28724 4656aacba2bc
child 29272 fb3ccf499df5
permissions -rw-r--r--
code_funcgr interface includes also sort algebra
haftmann@24219
     1
(*  Title:      Tools/code/code_thingol.ML
haftmann@24219
     2
    ID:         $Id$
haftmann@24219
     3
    Author:     Florian Haftmann, TU Muenchen
haftmann@24219
     4
haftmann@24219
     5
Intermediate language ("Thin-gol") representing executable code.
haftmann@24918
     6
Representation and translation.
haftmann@24219
     7
*)
haftmann@24219
     8
haftmann@24219
     9
infix 8 `%%;
haftmann@24219
    10
infix 4 `$;
haftmann@24219
    11
infix 4 `$$;
haftmann@24219
    12
infixr 3 `|->;
haftmann@24219
    13
infixr 3 `|-->;
haftmann@24219
    14
haftmann@24219
    15
signature BASIC_CODE_THINGOL =
haftmann@24219
    16
sig
haftmann@24219
    17
  type vname = string;
haftmann@24219
    18
  datatype dict =
haftmann@24219
    19
      DictConst of string * dict list list
haftmann@24219
    20
    | DictVar of string list * (vname * (int * int));
haftmann@24219
    21
  datatype itype =
haftmann@24219
    22
      `%% of string * itype list
haftmann@24219
    23
    | ITyVar of vname;
haftmann@24591
    24
  type const = string * (dict list list * itype list (*types of arguments*))
haftmann@24219
    25
  datatype iterm =
haftmann@24591
    26
      IConst of const
haftmann@24219
    27
    | IVar of vname
haftmann@24219
    28
    | `$ of iterm * iterm
haftmann@24219
    29
    | `|-> of (vname * itype) * iterm
haftmann@24219
    30
    | ICase of ((iterm * itype) * (iterm * iterm) list) * iterm;
haftmann@24219
    31
        (*((term, type), [(selector pattern, body term )]), primitive term)*)
haftmann@24219
    32
  val `$$ : iterm * iterm list -> iterm;
haftmann@24219
    33
  val `|--> : (vname * itype) list * iterm -> iterm;
haftmann@24219
    34
  type typscheme = (vname * sort) list * itype;
haftmann@24219
    35
end;
haftmann@24219
    36
haftmann@24219
    37
signature CODE_THINGOL =
haftmann@24219
    38
sig
haftmann@28663
    39
  include BASIC_CODE_THINGOL
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@28663
    44
  val split_abs: iterm -> (((vname * iterm option) * itype) * iterm) option
haftmann@28663
    45
  val unfold_abs: iterm -> ((vname * iterm option) * itype) list * iterm
haftmann@28663
    46
  val split_let: iterm -> (((iterm * itype) * iterm) * iterm) option
haftmann@28663
    47
  val unfold_let: iterm -> ((iterm * itype) * iterm) list * iterm
haftmann@24219
    48
  val unfold_const_app: iterm ->
haftmann@28663
    49
    ((string * (dict list list * itype list)) * iterm list) option
haftmann@24219
    50
  val collapse_let: ((vname * itype) * iterm) * iterm
haftmann@28663
    51
    -> (iterm * itype) * (iterm * iterm) list
haftmann@28663
    52
  val eta_expand: int -> (string * (dict list list * itype list)) * iterm list -> iterm
haftmann@28663
    53
  val contains_dictvar: iterm -> bool
haftmann@28663
    54
  val locally_monomorphic: iterm -> bool
haftmann@28663
    55
  val fold_constnames: (string -> 'a -> 'a) -> iterm -> 'a -> 'a
haftmann@28663
    56
  val fold_varnames: (string -> 'a -> 'a) -> iterm -> 'a -> 'a
haftmann@28663
    57
  val fold_unbound_varnames: (string -> 'a -> 'a) -> iterm -> 'a -> 'a
haftmann@28663
    58
haftmann@28663
    59
  type naming
haftmann@28706
    60
  val empty_naming: naming
haftmann@28663
    61
  val lookup_class: naming -> class -> string option
haftmann@28663
    62
  val lookup_classrel: naming -> class * class -> string option
haftmann@28663
    63
  val lookup_tyco: naming -> string -> string option
haftmann@28663
    64
  val lookup_instance: naming -> class * string -> string option
haftmann@28663
    65
  val lookup_const: naming -> string -> string option
haftmann@24219
    66
haftmann@24918
    67
  datatype stmt =
haftmann@27024
    68
      NoStmt
haftmann@28663
    69
    | Fun of string * (typscheme * ((iterm list * iterm) * (thm * bool)) list)
haftmann@28663
    70
    | Datatype of string * ((vname * sort) list * (string * itype list) list)
haftmann@28663
    71
    | Datatypecons of string * string
haftmann@28663
    72
    | Class of class * (vname * ((class * string) list * (string * itype) list))
haftmann@24219
    73
    | Classrel of class * class
haftmann@28663
    74
    | Classparam of string * class
haftmann@24219
    75
    | Classinst of (class * (string * (vname * sort) list))
haftmann@24219
    76
          * ((class * (string * (string * dict list list))) list
haftmann@28663
    77
        * ((string * const) * (thm * bool)) list)
haftmann@28663
    78
  type program = stmt Graph.T
haftmann@28663
    79
  val empty_funs: program -> string list
haftmann@28663
    80
  val map_terms_bottom_up: (iterm -> iterm) -> iterm -> iterm
haftmann@28663
    81
  val map_terms_stmt: (iterm -> iterm) -> stmt -> stmt
haftmann@28663
    82
  val is_cons: program -> string -> bool
haftmann@28663
    83
  val contr_classparam_typs: program -> string -> itype option list
haftmann@24219
    84
haftmann@28663
    85
  val consts_program: theory -> string list -> string list * (naming * program)
haftmann@28663
    86
  val cached_program: theory -> naming * program
haftmann@27103
    87
  val eval_conv: theory
haftmann@28663
    88
    -> (term -> term * (naming -> program -> typscheme * iterm -> string list -> thm))
haftmann@28663
    89
    -> cterm -> thm
haftmann@27103
    90
  val eval_term: theory
haftmann@28663
    91
    -> (term -> term * (naming -> program -> typscheme * iterm -> string list -> 'a))
haftmann@28663
    92
    -> term -> 'a
haftmann@24219
    93
end;
haftmann@24219
    94
haftmann@28054
    95
structure Code_Thingol: CODE_THINGOL =
haftmann@24219
    96
struct
haftmann@24219
    97
haftmann@24219
    98
(** auxiliary **)
haftmann@24219
    99
haftmann@24219
   100
fun unfoldl dest x =
haftmann@24219
   101
  case dest x
haftmann@24219
   102
   of NONE => (x, [])
haftmann@24219
   103
    | SOME (x1, x2) =>
haftmann@24219
   104
        let val (x', xs') = unfoldl dest x1 in (x', xs' @ [x2]) end;
haftmann@24219
   105
haftmann@24219
   106
fun unfoldr dest x =
haftmann@24219
   107
  case dest x
haftmann@24219
   108
   of NONE => ([], x)
haftmann@24219
   109
    | SOME (x1, x2) =>
haftmann@24219
   110
        let val (xs', x') = unfoldr dest x2 in (x1::xs', x') end;
haftmann@24219
   111
haftmann@24219
   112
haftmann@28369
   113
(** language core - types, patterns, expressions **)
haftmann@24219
   114
haftmann@24219
   115
type vname = string;
haftmann@24219
   116
haftmann@24219
   117
datatype dict =
haftmann@24219
   118
    DictConst of string * dict list list
haftmann@24219
   119
  | DictVar of string list * (vname * (int * int));
haftmann@24219
   120
haftmann@24219
   121
datatype itype =
haftmann@24219
   122
    `%% of string * itype list
haftmann@24219
   123
  | ITyVar of vname;
haftmann@24219
   124
haftmann@24591
   125
type const = string * (dict list list * itype list (*types of arguments*))
haftmann@24591
   126
haftmann@24219
   127
datatype iterm =
haftmann@24591
   128
    IConst of const
haftmann@24219
   129
  | IVar of vname
haftmann@24219
   130
  | `$ of iterm * iterm
haftmann@24219
   131
  | `|-> of (vname * itype) * iterm
haftmann@24219
   132
  | ICase of ((iterm * itype) * (iterm * iterm) list) * iterm;
haftmann@24219
   133
    (*see also signature*)
haftmann@24219
   134
haftmann@24219
   135
(*
haftmann@24219
   136
  variable naming conventions
haftmann@24219
   137
haftmann@24219
   138
  bare names:
haftmann@24219
   139
    variable names          v
haftmann@24219
   140
    class names             class
haftmann@24219
   141
    type constructor names  tyco
haftmann@24219
   142
    datatype names          dtco
haftmann@24837
   143
    const names (general)   c (const)
haftmann@24219
   144
    constructor names       co
haftmann@24837
   145
    class parameter names   classparam
haftmann@24219
   146
    arbitrary name          s
haftmann@24219
   147
haftmann@24837
   148
    v, c, co, classparam also annotated with types etc.
haftmann@24219
   149
haftmann@24219
   150
  constructs:
haftmann@24219
   151
    sort                    sort
haftmann@24219
   152
    type parameters         vs
haftmann@24219
   153
    type                    ty
haftmann@24219
   154
    type schemes            tysm
haftmann@24219
   155
    term                    t
haftmann@24219
   156
    (term as pattern)       p
haftmann@24219
   157
    instance (class, tyco)  inst
haftmann@24219
   158
 *)
haftmann@24219
   159
haftmann@24219
   160
val op `$$ = Library.foldl (op `$);
haftmann@24219
   161
val op `|--> = Library.foldr (op `|->);
haftmann@24219
   162
haftmann@24219
   163
val unfold_app = unfoldl
haftmann@24219
   164
  (fn op `$ t => SOME t
haftmann@24219
   165
    | _ => NONE);
haftmann@24219
   166
haftmann@24219
   167
val split_abs =
haftmann@24219
   168
  (fn (v, ty) `|-> (t as ICase (((IVar w, _), [(p, t')]), _)) =>
haftmann@24219
   169
        if v = w then SOME (((v, SOME p), ty), t') else SOME (((v, NONE), ty), t)
haftmann@24219
   170
    | (v, ty) `|-> t => SOME (((v, NONE), ty), t)
haftmann@24219
   171
    | _ => NONE);
haftmann@24219
   172
haftmann@24219
   173
val unfold_abs = unfoldr split_abs;
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@24219
   186
fun fold_aiterms f (t as IConst _) = f t
haftmann@24219
   187
  | fold_aiterms f (t as IVar _) = f t
haftmann@24219
   188
  | fold_aiterms f (t1 `$ t2) = fold_aiterms f t1 #> fold_aiterms f t2
haftmann@24219
   189
  | fold_aiterms f (t as _ `|-> t') = f t #> fold_aiterms f t'
haftmann@24219
   190
  | fold_aiterms f (ICase (_, t)) = fold_aiterms f t;
haftmann@24219
   191
haftmann@24219
   192
fun fold_constnames f =
haftmann@24219
   193
  let
haftmann@24219
   194
    fun add (IConst (c, _)) = f c
haftmann@24219
   195
      | add _ = I;
haftmann@24219
   196
  in fold_aiterms add end;
haftmann@24219
   197
haftmann@24219
   198
fun fold_varnames f =
haftmann@24219
   199
  let
haftmann@24219
   200
    fun add (IVar v) = f v
haftmann@24219
   201
      | add ((v, _) `|-> _) = f v
haftmann@24219
   202
      | add _ = I;
haftmann@24219
   203
  in fold_aiterms add end;
haftmann@24219
   204
haftmann@24219
   205
fun fold_unbound_varnames f =
haftmann@24219
   206
  let
haftmann@24219
   207
    fun add _ (IConst _) = I
haftmann@24219
   208
      | add vs (IVar v) = if not (member (op =) vs v) then f v else I
haftmann@24219
   209
      | add vs (t1 `$ t2) = add vs t1 #> add vs t2
haftmann@24219
   210
      | add vs ((v, _) `|-> t) = add (insert (op =) v vs) t
haftmann@24219
   211
      | add vs (ICase (_, t)) = add vs t;
haftmann@24219
   212
  in add [] end;
haftmann@24219
   213
haftmann@24219
   214
fun collapse_let (((v, ty), se), be as ICase (((IVar w, _), ds), _)) =
haftmann@24219
   215
      let
haftmann@24219
   216
        fun exists_v t = fold_unbound_varnames (fn w => fn b =>
haftmann@24219
   217
          b orelse v = w) t false;
haftmann@24219
   218
      in if v = w andalso forall (fn (t1, t2) =>
haftmann@24219
   219
        exists_v t1 orelse not (exists_v t2)) ds
haftmann@24219
   220
        then ((se, ty), ds)
haftmann@24219
   221
        else ((se, ty), [(IVar v, be)])
haftmann@24219
   222
      end
haftmann@24219
   223
  | collapse_let (((v, ty), se), be) =
haftmann@24219
   224
      ((se, ty), [(IVar v, be)])
haftmann@24219
   225
haftmann@27711
   226
fun eta_expand k (c as (_, (_, tys)), ts) =
haftmann@24219
   227
  let
haftmann@24219
   228
    val j = length ts;
haftmann@24219
   229
    val l = k - j;
haftmann@24219
   230
    val ctxt = (fold o fold_varnames) Name.declare ts Name.context;
haftmann@24219
   231
    val vs_tys = Name.names ctxt "a" ((curry Library.take l o curry Library.drop j) tys);
haftmann@24219
   232
  in vs_tys `|--> IConst c `$$ ts @ map (fn (v, _) => IVar v) vs_tys end;
haftmann@24219
   233
haftmann@24662
   234
fun contains_dictvar t =
haftmann@24662
   235
  let
haftmann@24662
   236
    fun contains (DictConst (_, dss)) = (fold o fold) contains dss
haftmann@24662
   237
      | contains (DictVar _) = K true;
haftmann@24662
   238
  in
haftmann@24662
   239
    fold_aiterms
haftmann@24662
   240
      (fn IConst (_, (dss, _)) => (fold o fold) contains dss | _ => I) t false
haftmann@24662
   241
  end;
haftmann@24662
   242
  
haftmann@25621
   243
fun locally_monomorphic (IConst _) = false
haftmann@25621
   244
  | locally_monomorphic (IVar _) = true
haftmann@25621
   245
  | locally_monomorphic (t `$ _) = locally_monomorphic t
haftmann@25621
   246
  | locally_monomorphic (_ `|-> t) = locally_monomorphic t
haftmann@25621
   247
  | locally_monomorphic (ICase ((_, ds), _)) = exists (locally_monomorphic o snd) ds;
haftmann@25621
   248
haftmann@25621
   249
haftmann@28688
   250
(** namings **)
haftmann@28663
   251
haftmann@28663
   252
(* policies *)
haftmann@28663
   253
haftmann@28663
   254
local
haftmann@28663
   255
  fun thyname_of thy f x = the (AList.lookup (op =) (f x) Markup.theory_nameN);
haftmann@28663
   256
  fun thyname_of_class thy =
haftmann@28663
   257
    thyname_of thy (ProofContext.query_class (ProofContext.init thy));
haftmann@28663
   258
  fun thyname_of_tyco thy =
haftmann@28663
   259
    thyname_of thy (Type.the_tags (Sign.tsig_of thy));
haftmann@28663
   260
  fun thyname_of_instance thy inst = case AxClass.arity_property thy inst Markup.theory_nameN
haftmann@28663
   261
   of [] => error ("no such instance: " ^ quote (snd inst ^ " :: " ^ fst inst))
haftmann@28663
   262
    | thyname :: _ => thyname;
haftmann@28706
   263
  fun thyname_of_const thy c = case AxClass.class_of_param thy c
haftmann@28706
   264
   of SOME class => thyname_of_class thy class
haftmann@28706
   265
    | NONE => (case Code.get_datatype_of_constr thy c
haftmann@28706
   266
       of SOME dtco => thyname_of_tyco thy dtco
haftmann@28706
   267
        | NONE => thyname_of thy (Consts.the_tags (Sign.consts_of thy)) c);
haftmann@28663
   268
  fun namify thy get_basename get_thyname name =
haftmann@28663
   269
    let
haftmann@28663
   270
      val prefix = get_thyname thy name;
haftmann@28663
   271
      val base = (Code_Name.purify_base true o get_basename) name;
haftmann@28663
   272
    in NameSpace.append prefix base end;
haftmann@28663
   273
in
haftmann@28663
   274
haftmann@28663
   275
fun namify_class thy = namify thy NameSpace.base thyname_of_class;
haftmann@28663
   276
fun namify_classrel thy = namify thy (fn (class1, class2) => 
haftmann@28663
   277
  NameSpace.base class2 ^ "_" ^ NameSpace.base class1) (fn thy => thyname_of_class thy o fst);
haftmann@28663
   278
  (*order fits nicely with composed projections*)
haftmann@28688
   279
fun namify_tyco thy "fun" = "Pure.fun"
haftmann@28688
   280
  | namify_tyco thy tyco = namify thy NameSpace.base thyname_of_tyco tyco;
haftmann@28663
   281
fun namify_instance thy = namify thy (fn (class, tyco) => 
haftmann@28663
   282
  NameSpace.base class ^ "_" ^ NameSpace.base tyco) thyname_of_instance;
haftmann@28663
   283
fun namify_const thy = namify thy NameSpace.base thyname_of_const;
haftmann@28663
   284
haftmann@28663
   285
end; (* local *)
haftmann@28663
   286
haftmann@28663
   287
haftmann@28688
   288
(* data *)
haftmann@28663
   289
haftmann@28663
   290
structure StringPairTab = Code_Name.StringPairTab;
haftmann@28663
   291
haftmann@28663
   292
datatype naming = Naming of {
haftmann@28663
   293
  class: class Symtab.table * Name.context,
haftmann@28663
   294
  classrel: string StringPairTab.table * Name.context,
haftmann@28663
   295
  tyco: string Symtab.table * Name.context,
haftmann@28663
   296
  instance: string StringPairTab.table * Name.context,
haftmann@28663
   297
  const: string Symtab.table * Name.context
haftmann@28663
   298
}
haftmann@28663
   299
haftmann@28663
   300
fun dest_Naming (Naming naming) = naming;
haftmann@28663
   301
haftmann@28663
   302
val empty_naming = Naming {
haftmann@28663
   303
  class = (Symtab.empty, Name.context),
haftmann@28663
   304
  classrel = (StringPairTab.empty, Name.context),
haftmann@28663
   305
  tyco = (Symtab.empty, Name.context),
haftmann@28663
   306
  instance = (StringPairTab.empty, Name.context),
haftmann@28663
   307
  const = (Symtab.empty, Name.context)
haftmann@28663
   308
};
haftmann@28663
   309
haftmann@28663
   310
local
haftmann@28663
   311
  fun mk_naming (class, classrel, tyco, instance, const) =
haftmann@28663
   312
    Naming { class = class, classrel = classrel,
haftmann@28663
   313
      tyco = tyco, instance = instance, const = const };
haftmann@28663
   314
  fun map_naming f (Naming { class, classrel, tyco, instance, const }) =
haftmann@28663
   315
    mk_naming (f (class, classrel, tyco, instance, const));
haftmann@28663
   316
in
haftmann@28663
   317
  fun map_class f = map_naming
haftmann@28663
   318
    (fn (class, classrel, tyco, inst, const) =>
haftmann@28663
   319
      (f class, classrel, tyco, inst, const));
haftmann@28663
   320
  fun map_classrel f = map_naming
haftmann@28663
   321
    (fn (class, classrel, tyco, inst, const) =>
haftmann@28663
   322
      (class, f classrel, tyco, inst, const));
haftmann@28663
   323
  fun map_tyco f = map_naming
haftmann@28663
   324
    (fn (class, classrel, tyco, inst, const) =>
haftmann@28663
   325
      (class, classrel, f tyco, inst, const));
haftmann@28663
   326
  fun map_instance f = map_naming
haftmann@28663
   327
    (fn (class, classrel, tyco, inst, const) =>
haftmann@28663
   328
      (class, classrel, tyco, f inst, const));
haftmann@28663
   329
  fun map_const f = map_naming
haftmann@28663
   330
    (fn (class, classrel, tyco, inst, const) =>
haftmann@28663
   331
      (class, classrel, tyco, inst, f const));
haftmann@28663
   332
end; (*local*)
haftmann@28663
   333
haftmann@28663
   334
fun add_variant update (thing, name) (tab, used) =
haftmann@28663
   335
  let
haftmann@28663
   336
    val (name', used') = yield_singleton Name.variants name used;
haftmann@28663
   337
    val tab' = update (thing, name') tab;
haftmann@28663
   338
  in (tab', used') end;
haftmann@28663
   339
haftmann@28663
   340
fun declare thy mapp lookup update namify thing =
haftmann@28663
   341
  mapp (add_variant update (thing, namify thy thing))
haftmann@28663
   342
  #> `(fn naming => the (lookup naming thing));
haftmann@28663
   343
haftmann@28688
   344
haftmann@28688
   345
(* lookup and declare *)
haftmann@28688
   346
haftmann@28688
   347
local
haftmann@28688
   348
haftmann@28688
   349
val suffix_class = "class";
haftmann@28688
   350
val suffix_classrel = "classrel"
haftmann@28688
   351
val suffix_tyco = "tyco";
haftmann@28688
   352
val suffix_instance = "inst";
haftmann@28688
   353
val suffix_const = "const";
haftmann@28688
   354
haftmann@28688
   355
fun add_suffix nsp NONE = NONE
haftmann@28688
   356
  | add_suffix nsp (SOME name) = SOME (NameSpace.append name nsp);
haftmann@28688
   357
haftmann@28688
   358
in
haftmann@28688
   359
haftmann@28663
   360
val lookup_class = add_suffix suffix_class
haftmann@28663
   361
  oo Symtab.lookup o fst o #class o dest_Naming;
haftmann@28663
   362
val lookup_classrel = add_suffix suffix_classrel
haftmann@28663
   363
  oo StringPairTab.lookup o fst o #classrel o dest_Naming;
haftmann@28663
   364
val lookup_tyco = add_suffix suffix_tyco
haftmann@28663
   365
  oo Symtab.lookup o fst o #tyco o dest_Naming;
haftmann@28663
   366
val lookup_instance = add_suffix suffix_instance
haftmann@28663
   367
  oo StringPairTab.lookup o fst o #instance o dest_Naming;
haftmann@28663
   368
val lookup_const = add_suffix suffix_const
haftmann@28663
   369
  oo Symtab.lookup o fst o #const o dest_Naming;
haftmann@28663
   370
haftmann@28663
   371
fun declare_class thy = declare thy map_class
haftmann@28663
   372
  lookup_class Symtab.update_new namify_class;
haftmann@28663
   373
fun declare_classrel thy = declare thy map_classrel
haftmann@28663
   374
  lookup_classrel StringPairTab.update_new namify_classrel;
haftmann@28663
   375
fun declare_tyco thy = declare thy map_tyco
haftmann@28663
   376
  lookup_tyco Symtab.update_new namify_tyco;
haftmann@28663
   377
fun declare_instance thy = declare thy map_instance
haftmann@28663
   378
  lookup_instance StringPairTab.update_new namify_instance;
haftmann@28663
   379
fun declare_const thy = declare thy map_const
haftmann@28663
   380
  lookup_const Symtab.update_new namify_const;
haftmann@28663
   381
haftmann@28688
   382
val unfold_fun = unfoldr
haftmann@28688
   383
  (fn "Pure.fun.tyco" `%% [ty1, ty2] => SOME (ty1, ty2)
haftmann@28688
   384
    | _ => NONE); (*depends on suffix_tyco and namify_tyco!*)
haftmann@28688
   385
haftmann@28688
   386
end; (* local *)
haftmann@28688
   387
haftmann@24219
   388
haftmann@27103
   389
(** statements, abstract programs **)
haftmann@24219
   390
haftmann@24219
   391
type typscheme = (vname * sort) list * itype;
haftmann@24918
   392
datatype stmt =
haftmann@27024
   393
    NoStmt
haftmann@28663
   394
  | Fun of string * (typscheme * ((iterm list * iterm) * (thm * bool)) list)
haftmann@28663
   395
  | Datatype of string * ((vname * sort) list * (string * itype list) list)
haftmann@28663
   396
  | Datatypecons of string * string
haftmann@28663
   397
  | Class of class * (vname * ((class * string) list * (string * itype) list))
haftmann@24219
   398
  | Classrel of class * class
haftmann@28663
   399
  | Classparam of string * class
haftmann@24219
   400
  | Classinst of (class * (string * (vname * sort) list))
haftmann@24219
   401
        * ((class * (string * (string * dict list list))) list
haftmann@28350
   402
      * ((string * const) * (thm * bool)) list);
haftmann@24219
   403
haftmann@27103
   404
type program = stmt Graph.T;
haftmann@24219
   405
haftmann@27103
   406
fun empty_funs program =
haftmann@28663
   407
  Graph.fold (fn (name, (Fun (c, (_, [])), _)) => cons c
haftmann@27103
   408
               | _ => I) program [];
haftmann@24219
   409
haftmann@27711
   410
fun map_terms_bottom_up f (t as IConst _) = f t
haftmann@27711
   411
  | map_terms_bottom_up f (t as IVar _) = f t
haftmann@27711
   412
  | map_terms_bottom_up f (t1 `$ t2) = f
haftmann@27711
   413
      (map_terms_bottom_up f t1 `$ map_terms_bottom_up f t2)
haftmann@27711
   414
  | map_terms_bottom_up f ((v, ty) `|-> t) = f
haftmann@27711
   415
      ((v, ty) `|-> map_terms_bottom_up f t)
haftmann@27711
   416
  | map_terms_bottom_up f (ICase (((t, ty), ps), t0)) = f
haftmann@27711
   417
      (ICase (((map_terms_bottom_up f t, ty), (map o pairself)
haftmann@27711
   418
        (map_terms_bottom_up f) ps), map_terms_bottom_up f t0));
haftmann@27711
   419
haftmann@27711
   420
fun map_terms_stmt f NoStmt = NoStmt
haftmann@28663
   421
  | map_terms_stmt f (Fun (c, (tysm, eqs))) = Fun (c, (tysm, (map o apfst)
haftmann@28663
   422
      (fn (ts, t) => (map f ts, f t)) eqs))
haftmann@27711
   423
  | map_terms_stmt f (stmt as Datatype _) = stmt
haftmann@27711
   424
  | map_terms_stmt f (stmt as Datatypecons _) = stmt
haftmann@27711
   425
  | map_terms_stmt f (stmt as Class _) = stmt
haftmann@27711
   426
  | map_terms_stmt f (stmt as Classrel _) = stmt
haftmann@27711
   427
  | map_terms_stmt f (stmt as Classparam _) = stmt
haftmann@27711
   428
  | map_terms_stmt f (Classinst (arity, (superarities, classparms))) =
haftmann@27711
   429
      Classinst (arity, (superarities, (map o apfst o apsnd) (fn const =>
haftmann@27711
   430
        case f (IConst const) of IConst const' => const') classparms));
haftmann@27711
   431
haftmann@27103
   432
fun is_cons program name = case Graph.get_node program name
haftmann@24219
   433
 of Datatypecons _ => true
haftmann@24219
   434
  | _ => false;
haftmann@24219
   435
haftmann@27103
   436
fun contr_classparam_typs program name = case Graph.get_node program name
haftmann@28663
   437
 of Classparam (_, class) => let
haftmann@28663
   438
        val Class (_, (_, (_, params))) = Graph.get_node program class;
haftmann@25621
   439
        val SOME ty = AList.lookup (op =) params name;
haftmann@25621
   440
        val (tys, res_ty) = unfold_fun ty;
haftmann@25621
   441
        fun no_tyvar (_ `%% tys) = forall no_tyvar tys
haftmann@25621
   442
          | no_tyvar (ITyVar _) = false;
haftmann@25621
   443
      in if no_tyvar res_ty
haftmann@25621
   444
        then map (fn ty => if no_tyvar ty then NONE else SOME ty) tys
haftmann@25621
   445
        else []
haftmann@25621
   446
      end
haftmann@25621
   447
  | _ => [];
haftmann@25621
   448
haftmann@24219
   449
haftmann@27103
   450
(** translation kernel **)
haftmann@24219
   451
haftmann@28724
   452
(* generic mechanisms *)
haftmann@28724
   453
haftmann@28663
   454
fun ensure_stmt lookup declare generate thing (dep, (naming, program)) =
haftmann@24219
   455
  let
haftmann@28706
   456
    fun add_dep name = case dep of NONE => I
haftmann@28706
   457
      | SOME dep => Graph.add_edge (dep, name);
haftmann@28706
   458
    val (name, naming') = case lookup naming thing
haftmann@28706
   459
     of SOME name => (name, naming)
haftmann@28706
   460
      | NONE => declare thing naming;
haftmann@28706
   461
  in case try (Graph.get_node program) name
haftmann@28706
   462
   of SOME stmt => program
haftmann@28663
   463
        |> add_dep name
haftmann@28706
   464
        |> pair naming'
haftmann@28663
   465
        |> pair dep
haftmann@28663
   466
        |> pair name
haftmann@28706
   467
    | NONE => program
haftmann@28706
   468
        |> Graph.default_node (name, NoStmt)
haftmann@28706
   469
        |> add_dep name
haftmann@28706
   470
        |> pair naming'
haftmann@28706
   471
        |> curry generate (SOME name)
haftmann@28706
   472
        ||> snd
haftmann@28706
   473
        |-> (fn stmt => (apsnd o Graph.map_node name) (K stmt))
haftmann@28706
   474
        |> pair dep
haftmann@28706
   475
        |> pair name
haftmann@24219
   476
  end;
haftmann@24219
   477
haftmann@26972
   478
fun not_wellsorted thy thm ty sort e =
haftmann@26972
   479
  let
haftmann@26972
   480
    val err_class = Sorts.class_error (Syntax.pp_global thy) e;
haftmann@26972
   481
    val err_thm = case thm
haftmann@26972
   482
     of SOME thm => "\n(in defining equation " ^ Display.string_of_thm thm ^ ")" | NONE => "";
haftmann@26972
   483
    val err_typ = "Type " ^ Syntax.string_of_typ_global thy ty ^ " not of sort "
haftmann@26972
   484
      ^ Syntax.string_of_sort_global thy sort;
haftmann@26972
   485
  in error ("Wellsortedness error" ^ err_thm ^ ":\n" ^ err_typ ^ "\n" ^ err_class) end;
haftmann@26972
   486
haftmann@28724
   487
haftmann@28724
   488
(* translation *)
haftmann@28724
   489
haftmann@26972
   490
fun ensure_class thy (algbr as (_, algebra)) funcgr class =
haftmann@24918
   491
  let
haftmann@28924
   492
    val superclasses = (Sorts.minimize_sort algebra o Sorts.super_classes algebra) class;
wenzelm@24969
   493
    val cs = #params (AxClass.get_info thy class);
haftmann@24918
   494
    val stmt_class =
haftmann@24918
   495
      fold_map (fn superclass => ensure_class thy algbr funcgr superclass
haftmann@24918
   496
        ##>> ensure_classrel thy algbr funcgr (class, superclass)) superclasses
haftmann@24918
   497
      ##>> fold_map (fn (c, ty) => ensure_const thy algbr funcgr c
haftmann@28688
   498
        ##>> translate_typ thy algbr funcgr ty) cs
haftmann@28663
   499
      #>> (fn info => Class (class, (unprefix "'" Name.aT, info)))
haftmann@28663
   500
  in ensure_stmt lookup_class (declare_class thy) stmt_class class end
haftmann@24918
   501
and ensure_classrel thy algbr funcgr (subclass, superclass) =
haftmann@24918
   502
  let
haftmann@24918
   503
    val stmt_classrel =
haftmann@24918
   504
      ensure_class thy algbr funcgr subclass
haftmann@24918
   505
      ##>> ensure_class thy algbr funcgr superclass
haftmann@24918
   506
      #>> Classrel;
haftmann@28663
   507
  in ensure_stmt lookup_classrel (declare_classrel thy) stmt_classrel (subclass, superclass) end
haftmann@28688
   508
and ensure_tyco thy algbr funcgr tyco =
haftmann@28688
   509
  let
haftmann@28688
   510
    val stmt_datatype =
haftmann@24918
   511
      let
haftmann@28688
   512
        val (vs, cos) = Code.get_datatype thy tyco;
haftmann@28688
   513
      in
haftmann@28688
   514
        fold_map (translate_tyvar_sort thy algbr funcgr) vs
haftmann@28688
   515
        ##>> fold_map (fn (c, tys) =>
haftmann@28688
   516
          ensure_const thy algbr funcgr c
haftmann@28688
   517
          ##>> fold_map (translate_typ thy algbr funcgr) tys) cos
haftmann@28688
   518
        #>> (fn info => Datatype (tyco, info))
haftmann@28688
   519
      end;
haftmann@28688
   520
  in ensure_stmt lookup_tyco (declare_tyco thy) stmt_datatype tyco end
haftmann@28688
   521
and translate_tyvar_sort thy (algbr as (proj_sort, _)) funcgr (v, sort) =
haftmann@24918
   522
  fold_map (ensure_class thy algbr funcgr) (proj_sort sort)
haftmann@24918
   523
  #>> (fn sort => (unprefix "'" v, sort))
haftmann@28688
   524
and translate_typ thy algbr funcgr (TFree v_sort) =
haftmann@28688
   525
      translate_tyvar_sort thy algbr funcgr v_sort
haftmann@24918
   526
      #>> (fn (v, sort) => ITyVar v)
haftmann@28688
   527
  | translate_typ thy algbr funcgr (Type (tyco, tys)) =
haftmann@24918
   528
      ensure_tyco thy algbr funcgr tyco
haftmann@28688
   529
      ##>> fold_map (translate_typ thy algbr funcgr) tys
haftmann@24918
   530
      #>> (fn (tyco, tys) => tyco `%% tys)
haftmann@28688
   531
and translate_dicts thy (algbr as (proj_sort, algebra)) funcgr thm (ty, sort) =
haftmann@24918
   532
  let
wenzelm@26939
   533
    val pp = Syntax.pp_global thy;
haftmann@24918
   534
    datatype typarg =
haftmann@24918
   535
        Global of (class * string) * typarg list list
haftmann@24918
   536
      | Local of (class * class) list * (string * (int * sort));
haftmann@24918
   537
    fun class_relation (Global ((_, tyco), yss), _) class =
haftmann@24918
   538
          Global ((class, tyco), yss)
haftmann@24918
   539
      | class_relation (Local (classrels, v), subclass) superclass =
haftmann@24918
   540
          Local ((subclass, superclass) :: classrels, v);
haftmann@28924
   541
    fun norm_typargs ys =
haftmann@28924
   542
      let
haftmann@28924
   543
        val raw_sort = map snd ys;
haftmann@28924
   544
        val sort = Sorts.minimize_sort algebra raw_sort;
haftmann@28924
   545
      in
haftmann@28924
   546
        map_filter (fn (y, class) =>
haftmann@28924
   547
          if member (op =) sort class then SOME y else NONE) ys
haftmann@28924
   548
      end;
haftmann@24918
   549
    fun type_constructor tyco yss class =
haftmann@28924
   550
      Global ((class, tyco), map norm_typargs yss);
haftmann@24918
   551
    fun type_variable (TFree (v, sort)) =
haftmann@24918
   552
      let
haftmann@24918
   553
        val sort' = proj_sort sort;
haftmann@24918
   554
      in map_index (fn (n, class) => (Local ([], (v, (n, sort'))), class)) sort' end;
haftmann@24918
   555
    val typargs = Sorts.of_sort_derivation pp algebra
haftmann@24918
   556
      {class_relation = class_relation, type_constructor = type_constructor,
haftmann@26972
   557
       type_variable = type_variable} (ty, proj_sort sort)
haftmann@26972
   558
      handle Sorts.CLASS_ERROR e => not_wellsorted thy thm ty sort e;
haftmann@24918
   559
    fun mk_dict (Global (inst, yss)) =
haftmann@24918
   560
          ensure_inst thy algbr funcgr inst
haftmann@24918
   561
          ##>> (fold_map o fold_map) mk_dict yss
haftmann@24918
   562
          #>> (fn (inst, dss) => DictConst (inst, dss))
haftmann@24918
   563
      | mk_dict (Local (classrels, (v, (k, sort)))) =
haftmann@24918
   564
          fold_map (ensure_classrel thy algbr funcgr) classrels
haftmann@24918
   565
          #>> (fn classrels => DictVar (classrels, (unprefix "'" v, (k, length sort))))
haftmann@27422
   566
  in fold_map mk_dict typargs end
haftmann@28688
   567
and translate_eq thy algbr funcgr (thm, linear) =
haftmann@24918
   568
  let
haftmann@24918
   569
    val (args, rhs) = (apfst (snd o strip_comb) o Logic.dest_equals
haftmann@24918
   570
      o Logic.unvarify o prop_of) thm;
haftmann@24918
   571
  in
haftmann@28688
   572
    fold_map (translate_term thy algbr funcgr (SOME thm)) args
haftmann@28688
   573
    ##>> translate_term thy algbr funcgr (SOME thm) rhs
haftmann@28350
   574
    #>> rpair (thm, linear)
haftmann@24918
   575
  end
haftmann@26972
   576
and ensure_inst thy (algbr as (_, algebra)) funcgr (class, tyco) =
haftmann@24918
   577
  let
haftmann@28924
   578
    val superclasses = (Sorts.minimize_sort algebra o Sorts.super_classes algebra) class;
wenzelm@24969
   579
    val classparams = these (try (#params o AxClass.get_info thy) class);
haftmann@24918
   580
    val vs = Name.names Name.context "'a" (Sorts.mg_domain algebra tyco [class]);
haftmann@24918
   581
    val sorts' = Sorts.mg_domain (Sign.classes_of thy) tyco [class];
haftmann@24918
   582
    val vs' = map2 (fn (v, sort1) => fn sort2 => (v,
haftmann@24918
   583
      Sorts.inter_sort (Sign.classes_of thy) (sort1, sort2))) vs sorts';
haftmann@24918
   584
    val arity_typ = Type (tyco, map TFree vs);
haftmann@24918
   585
    val arity_typ' = Type (tyco, map (fn (v, sort) => TVar ((v, 0), sort)) vs');
haftmann@28688
   586
    fun translate_superarity superclass =
haftmann@24918
   587
      ensure_class thy algbr funcgr superclass
haftmann@24918
   588
      ##>> ensure_classrel thy algbr funcgr (class, superclass)
haftmann@28688
   589
      ##>> translate_dicts thy algbr funcgr NONE (arity_typ, [superclass])
haftmann@24918
   590
      #>> (fn ((superclass, classrel), [DictConst (inst, dss)]) =>
haftmann@24918
   591
            (superclass, (classrel, (inst, dss))));
haftmann@28688
   592
    fun translate_classparam_inst (c, ty) =
haftmann@24918
   593
      let
haftmann@24918
   594
        val c_inst = Const (c, map_type_tfree (K arity_typ') ty);
haftmann@25597
   595
        val thm = AxClass.unoverload_conv thy (Thm.cterm_of thy c_inst);
haftmann@24918
   596
        val c_ty = (apsnd Logic.unvarifyT o dest_Const o snd
haftmann@24918
   597
          o Logic.dest_equals o Thm.prop_of) thm;
haftmann@24918
   598
      in
haftmann@24918
   599
        ensure_const thy algbr funcgr c
haftmann@28688
   600
        ##>> translate_const thy algbr funcgr (SOME thm) c_ty
haftmann@28350
   601
        #>> (fn (c, IConst c_inst) => ((c, c_inst), (thm, true)))
haftmann@24918
   602
      end;
haftmann@24918
   603
    val stmt_inst =
haftmann@24918
   604
      ensure_class thy algbr funcgr class
haftmann@24918
   605
      ##>> ensure_tyco thy algbr funcgr tyco
haftmann@28688
   606
      ##>> fold_map (translate_tyvar_sort thy algbr funcgr) vs
haftmann@28688
   607
      ##>> fold_map translate_superarity superclasses
haftmann@28688
   608
      ##>> fold_map translate_classparam_inst classparams
haftmann@24918
   609
      #>> (fn ((((class, tyco), arity), superarities), classparams) =>
haftmann@24918
   610
             Classinst ((class, (tyco, arity)), (superarities, classparams)));
haftmann@28663
   611
  in ensure_stmt lookup_instance (declare_instance thy) stmt_inst (class, tyco) end
haftmann@26972
   612
and ensure_const thy algbr funcgr c =
haftmann@24918
   613
  let
haftmann@24918
   614
    fun stmt_datatypecons tyco =
haftmann@24918
   615
      ensure_tyco thy algbr funcgr tyco
haftmann@28663
   616
      #>> (fn tyco => Datatypecons (c, tyco));
haftmann@24918
   617
    fun stmt_classparam class =
haftmann@24918
   618
      ensure_class thy algbr funcgr class
haftmann@28663
   619
      #>> (fn class => Classparam (c, class));
haftmann@28663
   620
    fun stmt_fun ((vs, raw_ty), raw_thms) =
haftmann@24918
   621
      let
haftmann@26972
   622
        val ty = Logic.unvarifyT raw_ty;
haftmann@24918
   623
        val thms = if (null o Term.typ_tfrees) ty orelse (null o fst o strip_type) ty
haftmann@24918
   624
          then raw_thms
haftmann@28423
   625
          else (map o apfst) (Code_Unit.expand_eta thy 1) raw_thms;
haftmann@24918
   626
      in
haftmann@28688
   627
        fold_map (translate_tyvar_sort thy algbr funcgr) vs
haftmann@28688
   628
        ##>> translate_typ thy algbr funcgr ty
haftmann@28688
   629
        ##>> fold_map (translate_eq thy algbr funcgr) thms
haftmann@28663
   630
        #>> (fn info => Fun (c, info))
haftmann@24918
   631
      end;
haftmann@28663
   632
    val stmt_const = case Code.get_datatype_of_constr thy c
haftmann@24918
   633
     of SOME tyco => stmt_datatypecons tyco
haftmann@24918
   634
      | NONE => (case AxClass.class_of_param thy c
haftmann@24918
   635
         of SOME class => stmt_classparam class
haftmann@28663
   636
          | NONE => stmt_fun (Code_Funcgr.typ funcgr c, Code_Funcgr.eqns funcgr c))
haftmann@28663
   637
  in ensure_stmt lookup_const (declare_const thy) stmt_const c end
haftmann@28688
   638
and translate_term thy algbr funcgr thm (Const (c, ty)) =
haftmann@28688
   639
      translate_app thy algbr funcgr thm ((c, ty), [])
haftmann@28688
   640
  | translate_term thy algbr funcgr thm (Free (v, _)) =
haftmann@24918
   641
      pair (IVar v)
haftmann@28688
   642
  | translate_term thy algbr funcgr thm (Abs (abs as (_, ty, _))) =
haftmann@24918
   643
      let
haftmann@24918
   644
        val (v, t) = Syntax.variant_abs abs;
haftmann@24918
   645
      in
haftmann@28688
   646
        translate_typ thy algbr funcgr ty
haftmann@28688
   647
        ##>> translate_term thy algbr funcgr thm t
haftmann@24918
   648
        #>> (fn (ty, t) => (v, ty) `|-> t)
haftmann@24918
   649
      end
haftmann@28688
   650
  | translate_term thy algbr funcgr thm (t as _ $ _) =
haftmann@24918
   651
      case strip_comb t
haftmann@24918
   652
       of (Const (c, ty), ts) =>
haftmann@28688
   653
            translate_app thy algbr funcgr thm ((c, ty), ts)
haftmann@24918
   654
        | (t', ts) =>
haftmann@28688
   655
            translate_term thy algbr funcgr thm t'
haftmann@28688
   656
            ##>> fold_map (translate_term thy algbr funcgr thm) ts
haftmann@24918
   657
            #>> (fn (t, ts) => t `$$ ts)
haftmann@28688
   658
and translate_const thy algbr funcgr thm (c, ty) =
haftmann@26972
   659
  let
haftmann@26972
   660
    val tys = Sign.const_typargs thy (c, ty);
haftmann@28054
   661
    val sorts = (map snd o fst o Code_Funcgr.typ funcgr) c;
haftmann@26972
   662
    val tys_args = (fst o Term.strip_type) ty;
haftmann@26972
   663
  in
haftmann@26972
   664
    ensure_const thy algbr funcgr c
haftmann@28688
   665
    ##>> fold_map (translate_dicts thy algbr funcgr thm) (tys ~~ sorts)
haftmann@28688
   666
    ##>> fold_map (translate_typ thy algbr funcgr) tys_args
haftmann@26972
   667
    #>> (fn ((c, iss), tys) => IConst (c, (iss, tys)))
haftmann@26972
   668
  end
haftmann@28688
   669
and translate_app_default thy algbr funcgr thm (c_ty, ts) =
haftmann@28688
   670
  translate_const thy algbr funcgr thm c_ty
haftmann@28688
   671
  ##>> fold_map (translate_term thy algbr funcgr thm) ts
haftmann@24918
   672
  #>> (fn (t, ts) => t `$$ ts)
haftmann@28688
   673
and translate_case thy algbr funcgr thm n cases (app as ((c, ty), ts)) =
haftmann@24918
   674
  let
haftmann@24918
   675
    val (tys, _) =
haftmann@24918
   676
      (chop (1 + (if null cases then 1 else length cases)) o fst o strip_type) ty;
haftmann@24918
   677
    val dt = nth ts n;
haftmann@24918
   678
    val dty = nth tys n;
haftmann@24918
   679
    fun is_undefined (Const (c, _)) = Code.is_undefined thy c
haftmann@24918
   680
      | is_undefined _ = false;
haftmann@24918
   681
    fun mk_case (co, n) t =
haftmann@24918
   682
      let
haftmann@28708
   683
        val _ = if (is_some o Code.get_datatype_of_constr thy) co then ()
haftmann@28708
   684
          else error ("Non-constructor " ^ quote co
haftmann@28708
   685
            ^ " encountered in case pattern"
haftmann@28708
   686
            ^ (case thm of NONE => ""
haftmann@28708
   687
              | SOME thm => ", in equation\n" ^ Display.string_of_thm thm))
haftmann@24918
   688
        val (vs, body) = Term.strip_abs_eta n t;
haftmann@24918
   689
        val selector = list_comb (Const (co, map snd vs ---> dty), map Free vs);
haftmann@24918
   690
      in if is_undefined body then NONE else SOME (selector, body) end;
haftmann@24918
   691
    fun mk_ds [] =
haftmann@24918
   692
          let
haftmann@24918
   693
            val ([v_ty], body) = Term.strip_abs_eta 1 (the_single (nth_drop n ts))
haftmann@24918
   694
          in [(Free v_ty, body)] end
haftmann@24918
   695
      | mk_ds cases = map_filter (uncurry mk_case)
haftmann@28054
   696
          (AList.make (Code_Unit.no_args thy) cases ~~ nth_drop n ts);
haftmann@24918
   697
  in
haftmann@28688
   698
    translate_term thy algbr funcgr thm dt
haftmann@28688
   699
    ##>> translate_typ thy algbr funcgr dty
haftmann@28688
   700
    ##>> fold_map (fn (pat, body) => translate_term thy algbr funcgr thm pat
haftmann@28688
   701
          ##>> translate_term thy algbr funcgr thm body) (mk_ds cases)
haftmann@28688
   702
    ##>> translate_app_default thy algbr funcgr thm app
haftmann@24918
   703
    #>> (fn (((dt, dty), ds), t0) => ICase (((dt, dty), ds), t0))
haftmann@24918
   704
  end
haftmann@28688
   705
and translate_app thy algbr funcgr thm ((c, ty), ts) = case Code.get_case_data thy c
haftmann@24918
   706
 of SOME (n, cases) => let val i = 1 + (if null cases then 1 else length cases) in
haftmann@24918
   707
      if length ts < i then
haftmann@24918
   708
        let
haftmann@24918
   709
          val k = length ts;
haftmann@24918
   710
          val tys = (curry Library.take (i - k) o curry Library.drop k o fst o strip_type) ty;
haftmann@24918
   711
          val ctxt = (fold o fold_aterms)
haftmann@24918
   712
            (fn Free (v, _) => Name.declare v | _ => I) ts Name.context;
haftmann@24918
   713
          val vs = Name.names ctxt "a" tys;
haftmann@24918
   714
        in
haftmann@28688
   715
          fold_map (translate_typ thy algbr funcgr) tys
haftmann@28688
   716
          ##>> translate_case thy algbr funcgr thm n cases ((c, ty), ts @ map Free vs)
haftmann@24918
   717
          #>> (fn (tys, t) => map2 (fn (v, _) => pair v) vs tys `|--> t)
haftmann@24918
   718
        end
haftmann@24918
   719
      else if length ts > i then
haftmann@28688
   720
        translate_case thy algbr funcgr thm n cases ((c, ty), Library.take (i, ts))
haftmann@28688
   721
        ##>> fold_map (translate_term thy algbr funcgr thm) (Library.drop (i, ts))
haftmann@24918
   722
        #>> (fn (t, ts) => t `$$ ts)
haftmann@24918
   723
      else
haftmann@28688
   724
        translate_case thy algbr funcgr thm n cases ((c, ty), ts)
haftmann@24918
   725
      end
haftmann@28688
   726
  | NONE => translate_app_default thy algbr funcgr thm ((c, ty), ts);
haftmann@24918
   727
haftmann@25969
   728
haftmann@27103
   729
(* store *)
haftmann@27103
   730
haftmann@27103
   731
structure Program = CodeDataFun
haftmann@27103
   732
(
haftmann@28663
   733
  type T = naming * program;
haftmann@28663
   734
  val empty = (empty_naming, Graph.empty);
haftmann@28706
   735
  fun purge thy cs (naming, program) =
haftmann@27609
   736
    let
haftmann@28706
   737
      val names_delete = cs
haftmann@28706
   738
        |> map_filter (lookup_const naming)
haftmann@28706
   739
        |> filter (can (Graph.get_node program))
haftmann@28706
   740
        |> Graph.all_preds program;
haftmann@28706
   741
      val program' = Graph.del_nodes names_delete program;
haftmann@28706
   742
    in (naming, program') end;
haftmann@27103
   743
);
haftmann@27103
   744
haftmann@27103
   745
val cached_program = Program.get;
haftmann@25969
   746
haftmann@28924
   747
fun invoke_generation thy (algebra, funcgr) f name =
haftmann@28663
   748
  Program.change_yield thy (fn naming_program => (NONE, naming_program)
haftmann@28924
   749
    |> f thy algebra funcgr name
haftmann@28663
   750
    |-> (fn name => fn (_, naming_program) => (name, naming_program)));
haftmann@27103
   751
haftmann@27103
   752
haftmann@27103
   753
(* program generation *)
haftmann@27103
   754
haftmann@27103
   755
fun consts_program thy cs =
haftmann@27103
   756
  let
haftmann@28663
   757
    fun project_consts cs (naming, program) =
haftmann@27103
   758
      let
haftmann@27103
   759
        val cs_all = Graph.all_succs program cs;
haftmann@28663
   760
      in (cs, (naming, Graph.subgraph (member (op =) cs_all) program)) end;
haftmann@27103
   761
    fun generate_consts thy algebra funcgr =
haftmann@27103
   762
      fold_map (ensure_const thy algebra funcgr);
haftmann@27103
   763
  in
haftmann@28724
   764
    invoke_generation thy (Code_Funcgr.make thy cs) generate_consts cs
haftmann@27103
   765
    |-> project_consts
haftmann@27103
   766
  end;
haftmann@27103
   767
haftmann@27103
   768
haftmann@27103
   769
(* value evaluation *)
haftmann@25969
   770
haftmann@24918
   771
fun ensure_value thy algbr funcgr t = 
haftmann@24918
   772
  let
haftmann@24918
   773
    val ty = fastype_of t;
haftmann@24918
   774
    val vs = fold_term_types (K (fold_atyps (insert (eq_fst op =)
haftmann@24918
   775
      o dest_TFree))) t [];
haftmann@24918
   776
    val stmt_value =
haftmann@28688
   777
      fold_map (translate_tyvar_sort thy algbr funcgr) vs
haftmann@28688
   778
      ##>> translate_typ thy algbr funcgr ty
haftmann@28688
   779
      ##>> translate_term thy algbr funcgr NONE t
haftmann@28663
   780
      #>> (fn ((vs, ty), t) => Fun
haftmann@28663
   781
        (Term.dummy_patternN, ((vs, ty), [(([], t), (Drule.dummy_thm, true))])));
haftmann@28663
   782
    fun term_value (dep, (naming, program1)) =
haftmann@25969
   783
      let
haftmann@28663
   784
        val Fun (_, ((vs, ty), [(([], t), _)])) =
haftmann@28663
   785
          Graph.get_node program1 Term.dummy_patternN;
haftmann@28663
   786
        val deps = Graph.imm_succs program1 Term.dummy_patternN;
haftmann@28663
   787
        val program2 = Graph.del_nodes [Term.dummy_patternN] program1;
haftmann@27103
   788
        val deps_all = Graph.all_succs program2 deps;
haftmann@27103
   789
        val program3 = Graph.subgraph (member (op =) deps_all) program2;
haftmann@28663
   790
      in (((naming, program3), (((vs, ty), t), deps)), (dep, (naming, program2))) end;
haftmann@26011
   791
  in
haftmann@28663
   792
    ensure_stmt ((K o K) NONE) pair stmt_value Term.dummy_patternN
haftmann@26011
   793
    #> snd
haftmann@26011
   794
    #> term_value
haftmann@26011
   795
  end;
haftmann@24219
   796
haftmann@28724
   797
fun eval thy evaluator t =
haftmann@27103
   798
  let
haftmann@28724
   799
    val (t', evaluator'') = evaluator t;
haftmann@28924
   800
    fun evaluator' algebra funcgr =
haftmann@27103
   801
      let
haftmann@28924
   802
        val (((naming, program), (vs_ty_t, deps)), _) =
haftmann@28924
   803
          invoke_generation thy (algebra, funcgr) ensure_value t';
haftmann@28724
   804
      in evaluator'' naming program vs_ty_t deps end;
haftmann@28724
   805
  in (t', evaluator') end
haftmann@27103
   806
haftmann@28724
   807
fun eval_conv thy = Code_Funcgr.eval_conv thy o eval thy;
haftmann@28724
   808
fun eval_term thy = Code_Funcgr.eval_term thy o eval thy;
haftmann@27103
   809
haftmann@24219
   810
end; (*struct*)
haftmann@24219
   811
haftmann@24219
   812
haftmann@28054
   813
structure Basic_Code_Thingol: BASIC_CODE_THINGOL = Code_Thingol;