src/Tools/nbe.ML
author wenzelm
Thu Jun 09 20:22:22 2011 +0200 (2011-06-09)
changeset 43329 84472e198515
parent 43323 28e71a685c84
child 43619 3803869014aa
permissions -rw-r--r--
tuned signature: Name.invent and Name.invent_names;
haftmann@24590
     1
(*  Title:      Tools/nbe.ML
haftmann@24155
     2
    Authors:    Klaus Aehlig, LMU Muenchen; Tobias Nipkow, Florian Haftmann, TU Muenchen
haftmann@24155
     3
haftmann@24839
     4
Normalization by evaluation, based on generic code generator.
haftmann@24155
     5
*)
haftmann@24155
     6
haftmann@24155
     7
signature NBE =
haftmann@24155
     8
sig
haftmann@41247
     9
  val dynamic_conv: theory -> conv
haftmann@41184
    10
  val dynamic_value: theory -> term -> term
haftmann@41184
    11
  val static_conv: theory -> string list -> conv
haftmann@41184
    12
  val static_value: theory -> string list -> term -> term
haftmann@25101
    13
wenzelm@25204
    14
  datatype Univ =
haftmann@26064
    15
      Const of int * Univ list               (*named (uninterpreted) constants*)
haftmann@25924
    16
    | DFree of string * int                  (*free (uninterpreted) dictionary parameters*)
haftmann@24155
    17
    | BVar of int * Univ list
haftmann@28350
    18
    | Abs of (int * (Univ list -> Univ)) * Univ list
haftmann@25924
    19
  val apps: Univ -> Univ list -> Univ        (*explicit applications*)
haftmann@25944
    20
  val abss: int -> (Univ list -> Univ) -> Univ
haftmann@28337
    21
                                             (*abstractions as closures*)
haftmann@41037
    22
  val same: Univ * Univ -> bool
haftmann@24155
    23
haftmann@39388
    24
  val put_result: (unit -> Univ list -> Univ list) -> Proof.context -> Proof.context
wenzelm@32740
    25
  val trace: bool Unsynchronized.ref
haftmann@25924
    26
haftmann@26747
    27
  val setup: theory -> theory
haftmann@32544
    28
  val add_const_alias: thm -> theory -> theory
haftmann@24155
    29
end;
haftmann@24155
    30
haftmann@24155
    31
structure Nbe: NBE =
haftmann@24155
    32
struct
haftmann@24155
    33
haftmann@24155
    34
(* generic non-sense *)
haftmann@24155
    35
wenzelm@32740
    36
val trace = Unsynchronized.ref false;
haftmann@32544
    37
fun traced f x = if !trace then (tracing (f x); x) else x;
haftmann@24155
    38
haftmann@24155
    39
haftmann@32544
    40
(** certificates and oracle for "trivial type classes" **)
haftmann@32544
    41
wenzelm@33522
    42
structure Triv_Class_Data = Theory_Data
haftmann@32544
    43
(
haftmann@32544
    44
  type T = (class * thm) list;
haftmann@32544
    45
  val empty = [];
haftmann@32544
    46
  val extend = I;
wenzelm@33522
    47
  fun merge data : T = AList.merge (op =) (K true) data;
haftmann@32544
    48
);
haftmann@32544
    49
haftmann@32544
    50
fun add_const_alias thm thy =
haftmann@32544
    51
  let
haftmann@32544
    52
    val (ofclass, eqn) = case try Logic.dest_equals (Thm.prop_of thm)
haftmann@32544
    53
     of SOME ofclass_eq => ofclass_eq
haftmann@32544
    54
      | _ => error ("Bad certificate: " ^ Display.string_of_thm_global thy thm);
haftmann@32544
    55
    val (T, class) = case try Logic.dest_of_class ofclass
haftmann@32544
    56
     of SOME T_class => T_class
haftmann@32544
    57
      | _ => error ("Bad certificate: " ^ Display.string_of_thm_global thy thm);
haftmann@32544
    58
    val tvar = case try Term.dest_TVar T
haftmann@32544
    59
     of SOME (tvar as (_, sort)) => if null (filter (can (AxClass.get_info thy)) sort)
haftmann@32544
    60
          then tvar
haftmann@32544
    61
          else error ("Bad sort: " ^ Display.string_of_thm_global thy thm)
haftmann@32544
    62
      | _ => error ("Bad type: " ^ Display.string_of_thm_global thy thm);
haftmann@32544
    63
    val _ = if Term.add_tvars eqn [] = [tvar] then ()
haftmann@32544
    64
      else error ("Inconsistent type: " ^ Display.string_of_thm_global thy thm);
haftmann@32544
    65
    val lhs_rhs = case try Logic.dest_equals eqn
haftmann@32544
    66
     of SOME lhs_rhs => lhs_rhs
haftmann@32544
    67
      | _ => error ("Not an equation: " ^ Syntax.string_of_term_global thy eqn);
haftmann@40362
    68
    val c_c' = case try (pairself (AxClass.unoverload_const thy o dest_Const)) lhs_rhs
haftmann@32544
    69
     of SOME c_c' => c_c'
haftmann@32544
    70
      | _ => error ("Not an equation with two constants: "
haftmann@32544
    71
          ^ Syntax.string_of_term_global thy eqn);
haftmann@32544
    72
    val _ = if the_list (AxClass.class_of_param thy (snd c_c')) = [class] then ()
haftmann@32544
    73
      else error ("Inconsistent class: " ^ Display.string_of_thm_global thy thm);
haftmann@32544
    74
  in Triv_Class_Data.map (AList.update (op =) (class, thm)) thy end;
haftmann@32544
    75
haftmann@32544
    76
local
haftmann@32544
    77
haftmann@32544
    78
val get_triv_classes = map fst o Triv_Class_Data.get;
haftmann@32544
    79
haftmann@32544
    80
val (_, triv_of_class) = Context.>>> (Context.map_theory_result
haftmann@36982
    81
  (Thm.add_oracle (Binding.name "triv_of_class", fn (thy, T, class) =>
haftmann@32544
    82
    Thm.cterm_of thy (Logic.mk_of_class (T, class)))));
haftmann@32544
    83
haftmann@32544
    84
in
haftmann@32544
    85
haftmann@32544
    86
fun lift_triv_classes_conv thy conv ct =
haftmann@32544
    87
  let
haftmann@32544
    88
    val algebra = Sign.classes_of thy;
haftmann@36982
    89
    val certT = Thm.ctyp_of thy;
haftmann@32544
    90
    val triv_classes = get_triv_classes thy;
haftmann@36982
    91
    fun additional_classes sort = filter_out (fn class => Sorts.sort_le algebra (sort, [class])) triv_classes;
haftmann@36982
    92
    fun mk_entry (v, sort) =
haftmann@36982
    93
      let
haftmann@36982
    94
        val T = TFree (v, sort);
haftmann@36982
    95
        val cT = certT T;
haftmann@36982
    96
        val triv_sort = additional_classes sort;
haftmann@36982
    97
      in
haftmann@36982
    98
        (v, (Sorts.inter_sort algebra (sort, triv_sort),
haftmann@36982
    99
          (cT, AList.make (fn class => Thm.of_class (cT, class)) sort
haftmann@36982
   100
            @ AList.make (fn class => triv_of_class (thy, T, class)) triv_sort)))
haftmann@36982
   101
      end;
haftmann@36982
   102
    val vs_tab = map mk_entry (Term.add_tfrees (Thm.term_of ct) []);
haftmann@36982
   103
    fun instantiate thm =
haftmann@36982
   104
      let
haftmann@36982
   105
        val cert_tvars = map (certT o TVar) (Term.add_tvars
haftmann@36982
   106
          ((fst o Logic.dest_equals o Logic.strip_imp_concl o Thm.prop_of) thm) []);
haftmann@36982
   107
        val instantiation =
haftmann@36982
   108
          map2 (fn cert_tvar => fn (_, (_, (cT, _))) => (cert_tvar, cT)) cert_tvars vs_tab;
haftmann@36982
   109
      in Thm.instantiate (instantiation, []) thm end;
haftmann@36982
   110
    fun of_class (TFree (v, _), class) =
haftmann@36982
   111
          the (AList.lookup (op =) ((snd o snd o the o AList.lookup (op =) vs_tab) v) class)
haftmann@36982
   112
      | of_class (T, _) = error ("Bad type " ^ Syntax.string_of_typ_global thy T);
haftmann@32544
   113
    fun strip_of_class thm =
haftmann@32544
   114
      let
haftmann@36982
   115
        val prems_of_class = Thm.prop_of thm
haftmann@36982
   116
          |> Logic.strip_imp_prems
haftmann@36982
   117
          |> map (Logic.dest_of_class #> of_class);
haftmann@36982
   118
      in fold Thm.elim_implies prems_of_class thm end;
wenzelm@36770
   119
  in
wenzelm@36770
   120
    ct
haftmann@36982
   121
    |> (Drule.cterm_fun o map_types o map_type_tfree)
haftmann@36982
   122
        (fn (v, sort) => TFree (v, (fst o the o AList.lookup (op =) vs_tab) v))
haftmann@32544
   123
    |> conv
haftmann@36982
   124
    |> Thm.strip_shyps
wenzelm@35845
   125
    |> Thm.varifyT_global
haftmann@36982
   126
    |> Thm.unconstrainT
haftmann@36982
   127
    |> instantiate
haftmann@32544
   128
    |> strip_of_class
haftmann@32544
   129
  end;
haftmann@32544
   130
haftmann@32544
   131
fun lift_triv_classes_rew thy rew t =
haftmann@32544
   132
  let
haftmann@32544
   133
    val algebra = Sign.classes_of thy;
haftmann@32544
   134
    val triv_classes = get_triv_classes thy;
haftmann@32544
   135
    val vs = Term.add_tfrees t [];
haftmann@32544
   136
  in t
haftmann@32544
   137
    |> (map_types o map_type_tfree)
haftmann@32544
   138
        (fn (v, sort) => TFree (v, Sorts.inter_sort algebra (sort, triv_classes)))
haftmann@32544
   139
    |> rew
haftmann@32544
   140
    |> (map_types o map_type_tfree)
haftmann@32544
   141
        (fn (v, _) => TFree (v, the (AList.lookup (op =) vs v)))
haftmann@32544
   142
  end;
haftmann@32544
   143
haftmann@32544
   144
end;
haftmann@32544
   145
haftmann@32544
   146
haftmann@32544
   147
(** the semantic universe **)
haftmann@24155
   148
haftmann@24155
   149
(*
haftmann@24155
   150
   Functions are given by their semantical function value. To avoid
haftmann@24155
   151
   trouble with the ML-type system, these functions have the most
haftmann@24155
   152
   generic type, that is "Univ list -> Univ". The calling convention is
haftmann@24155
   153
   that the arguments come as a list, the last argument first. In
haftmann@24155
   154
   other words, a function call that usually would look like
haftmann@24155
   155
haftmann@24155
   156
   f x_1 x_2 ... x_n   or   f(x_1,x_2, ..., x_n)
haftmann@24155
   157
haftmann@24155
   158
   would be in our convention called as
haftmann@24155
   159
haftmann@24155
   160
              f [x_n,..,x_2,x_1]
haftmann@24155
   161
haftmann@24155
   162
   Moreover, to handle functions that are still waiting for some
haftmann@24155
   163
   arguments we have additionally a list of arguments collected to far
haftmann@24155
   164
   and the number of arguments we're still waiting for.
haftmann@24155
   165
*)
haftmann@24155
   166
wenzelm@25204
   167
datatype Univ =
haftmann@26064
   168
    Const of int * Univ list           (*named (uninterpreted) constants*)
haftmann@25924
   169
  | DFree of string * int              (*free (uninterpreted) dictionary parameters*)
haftmann@27499
   170
  | BVar of int * Univ list            (*bound variables, named*)
haftmann@24155
   171
  | Abs of (int * (Univ list -> Univ)) * Univ list
haftmann@27499
   172
                                       (*abstractions as closures*);
haftmann@24155
   173
haftmann@35371
   174
haftmann@24155
   175
(* constructor functions *)
haftmann@24155
   176
haftmann@25944
   177
fun abss n f = Abs ((n, f), []);
haftmann@25924
   178
fun apps (Abs ((n, f), xs)) ys = let val k = n - length ys in
haftmann@27499
   179
      case int_ord (k, 0)
haftmann@27499
   180
       of EQUAL => f (ys @ xs)
haftmann@27499
   181
        | LESS => let val (zs, ws) = chop (~ k) ys in apps (f (ws @ xs)) zs end
haftmann@27499
   182
        | GREATER => Abs ((k, f), ys @ xs) (*note: reverse convention also for apps!*)
haftmann@27499
   183
      end
haftmann@25924
   184
  | apps (Const (name, xs)) ys = Const (name, ys @ xs)
haftmann@27499
   185
  | apps (BVar (n, xs)) ys = BVar (n, ys @ xs);
haftmann@24155
   186
haftmann@41037
   187
fun same (Const (k, xs), Const (l, ys)) = k = l andalso eq_list same (xs, ys)
haftmann@41037
   188
  | same (DFree (s, k), DFree (t, l)) = s = t andalso k = l
haftmann@41037
   189
  | same (BVar (k, xs), BVar (l, ys)) = k = l andalso eq_list same (xs, ys)
haftmann@41037
   190
  | same _ = false;
haftmann@40730
   191
haftmann@24155
   192
haftmann@24155
   193
(** assembling and compiling ML code from terms **)
haftmann@24155
   194
haftmann@24155
   195
(* abstract ML syntax *)
haftmann@24155
   196
haftmann@24155
   197
infix 9 `$` `$$`;
haftmann@24155
   198
fun e1 `$` e2 = "(" ^ e1 ^ " " ^ e2 ^ ")";
haftmann@25101
   199
fun e `$$` [] = e
haftmann@25101
   200
  | e `$$` es = "(" ^ e ^ " " ^ space_implode " " es ^ ")";
haftmann@24590
   201
fun ml_abs v e = "(fn " ^ v ^ " => " ^ e ^ ")";
haftmann@24155
   202
haftmann@24155
   203
fun ml_cases t cs =
haftmann@24155
   204
  "(case " ^ t ^ " of " ^ space_implode " | " (map (fn (p, t) => p ^ " => " ^ t) cs) ^ ")";
haftmann@25944
   205
fun ml_Let d e = "let\n" ^ d ^ " in " ^ e ^ " end";
haftmann@28337
   206
fun ml_as v t = "(" ^ v ^ " as " ^ t ^ ")";
haftmann@24155
   207
haftmann@28350
   208
fun ml_and [] = "true"
haftmann@28350
   209
  | ml_and [x] = x
haftmann@28350
   210
  | ml_and xs = "(" ^ space_implode " andalso " xs ^ ")";
haftmann@28350
   211
fun ml_if b x y = "(if " ^ b ^ " then " ^ x ^ " else " ^ y ^ ")";
haftmann@28350
   212
haftmann@24155
   213
fun ml_list es = "[" ^ commas es ^ "]";
haftmann@24155
   214
haftmann@24155
   215
fun ml_fundefs ([(name, [([], e)])]) =
haftmann@24155
   216
      "val " ^ name ^ " = " ^ e ^ "\n"
haftmann@24155
   217
  | ml_fundefs (eqs :: eqss) =
haftmann@24155
   218
      let
haftmann@24155
   219
        fun fundef (name, eqs) =
haftmann@24155
   220
          let
haftmann@24155
   221
            fun eqn (es, e) = name ^ " " ^ space_implode " " es ^ " = " ^ e
haftmann@24155
   222
          in space_implode "\n  | " (map eqn eqs) end;
haftmann@24155
   223
      in
haftmann@24155
   224
        (prefix "fun " o fundef) eqs :: map (prefix "and " o fundef) eqss
wenzelm@26931
   225
        |> cat_lines
haftmann@24155
   226
        |> suffix "\n"
haftmann@24155
   227
      end;
haftmann@24155
   228
haftmann@35371
   229
haftmann@25944
   230
(* nbe specific syntax and sandbox communication *)
haftmann@25944
   231
wenzelm@41472
   232
structure Univs = Proof_Data
wenzelm@41472
   233
(
haftmann@39388
   234
  type T = unit -> Univ list -> Univ list
wenzelm@41472
   235
  (* FIXME avoid user error with non-user text *)
haftmann@39399
   236
  fun init _ () = error "Univs"
haftmann@39388
   237
);
haftmann@39388
   238
val put_result = Univs.put;
haftmann@24155
   239
haftmann@24155
   240
local
haftmann@41068
   241
  val prefix =     "Nbe.";
haftmann@41068
   242
  val name_put =   prefix ^ "put_result";
haftmann@41068
   243
  val name_ref =   prefix ^ "univs_ref";
haftmann@41068
   244
  val name_const = prefix ^ "Const";
haftmann@41068
   245
  val name_abss =  prefix ^ "abss";
haftmann@41068
   246
  val name_apps =  prefix ^ "apps";
haftmann@41068
   247
  val name_same =  prefix ^ "same";
haftmann@24155
   248
in
haftmann@24155
   249
haftmann@39388
   250
val univs_cookie = (Univs.get, put_result, name_put);
haftmann@25944
   251
haftmann@28337
   252
fun nbe_fun 0 "" = "nbe_value"
haftmann@28337
   253
  | nbe_fun i c = "c_" ^ translate_string (fn "." => "_" | c => c) c ^ "_" ^ string_of_int i;
haftmann@25101
   254
fun nbe_dict v n = "d_" ^ v ^ "_" ^ string_of_int n;
haftmann@24155
   255
fun nbe_bound v = "v_" ^ v;
haftmann@31888
   256
fun nbe_bound_optional NONE = "_"
haftmann@35500
   257
  | nbe_bound_optional (SOME v) = nbe_bound v;
haftmann@28337
   258
fun nbe_default v = "w_" ^ v;
haftmann@24155
   259
haftmann@25924
   260
(*note: these three are the "turning spots" where proper argument order is established!*)
haftmann@25924
   261
fun nbe_apps t [] = t
haftmann@25924
   262
  | nbe_apps t ts = name_apps `$$` [t, ml_list (rev ts)];
haftmann@28337
   263
fun nbe_apps_local i c ts = nbe_fun i c `$` ml_list (rev ts);
haftmann@28337
   264
fun nbe_apps_constr idx_of c ts =
haftmann@28337
   265
  let
haftmann@28337
   266
    val c' = if !trace then string_of_int (idx_of c) ^ " (*" ^ c ^ "*)"
haftmann@28337
   267
      else string_of_int (idx_of c);
haftmann@28337
   268
  in name_const `$` ("(" ^ c' ^ ", " ^ ml_list (rev ts) ^ ")") end;
haftmann@25924
   269
haftmann@24155
   270
fun nbe_abss 0 f = f `$` ml_list []
haftmann@25944
   271
  | nbe_abss n f = name_abss `$$` [string_of_int n, f];
haftmann@24155
   272
haftmann@41037
   273
fun nbe_same (v1, v2) = "(" ^ name_same ^ " (" ^ nbe_bound v1 ^ ", " ^ nbe_bound v2 ^ "))";
haftmann@28350
   274
haftmann@24155
   275
end;
haftmann@24155
   276
haftmann@28054
   277
open Basic_Code_Thingol;
haftmann@24155
   278
haftmann@35371
   279
haftmann@25865
   280
(* code generation *)
haftmann@24155
   281
haftmann@26064
   282
fun assemble_eqnss idx_of deps eqnss =
haftmann@25944
   283
  let
haftmann@25944
   284
    fun prep_eqns (c, (vs, eqns)) =
haftmann@25924
   285
      let
haftmann@25944
   286
        val dicts = maps (fn (v, sort) => map_index (nbe_dict v o fst) sort) vs;
haftmann@28337
   287
        val num_args = length dicts + ((length o fst o hd) eqns);
haftmann@25944
   288
      in (c, (num_args, (dicts, eqns))) end;
haftmann@25944
   289
    val eqnss' = map prep_eqns eqnss;
haftmann@25944
   290
haftmann@25944
   291
    fun assemble_constapp c dss ts = 
haftmann@25944
   292
      let
haftmann@41118
   293
        val ts' = (maps o map) assemble_dict dss @ ts;
haftmann@25944
   294
      in case AList.lookup (op =) eqnss' c
haftmann@28337
   295
       of SOME (num_args, _) => if num_args <= length ts'
haftmann@28337
   296
            then let val (ts1, ts2) = chop num_args ts'
haftmann@28337
   297
            in nbe_apps (nbe_apps_local 0 c ts1) ts2
haftmann@28337
   298
            end else nbe_apps (nbe_abss num_args (nbe_fun 0 c)) ts'
haftmann@25944
   299
        | NONE => if member (op =) deps c
haftmann@28337
   300
            then nbe_apps (nbe_fun 0 c) ts'
haftmann@28337
   301
            else nbe_apps_constr idx_of c ts'
haftmann@25924
   302
      end
haftmann@41100
   303
    and assemble_classrels classrels =
haftmann@41100
   304
      fold_rev (fn classrel => assemble_constapp classrel [] o single) classrels
haftmann@41118
   305
    and assemble_dict (Dict (classrels, x)) =
haftmann@41118
   306
          assemble_classrels classrels (assemble_plain_dict x)
haftmann@41118
   307
    and assemble_plain_dict (Dict_Const (inst, dss)) =
haftmann@41118
   308
          assemble_constapp inst dss []
haftmann@41118
   309
      | assemble_plain_dict (Dict_Var (v, (n, _))) =
haftmann@41118
   310
          nbe_dict v n
haftmann@25924
   311
haftmann@28350
   312
    fun assemble_iterm constapp =
haftmann@24155
   313
      let
haftmann@28350
   314
        fun of_iterm match_cont t =
haftmann@25944
   315
          let
haftmann@28054
   316
            val (t', ts) = Code_Thingol.unfold_app t
haftmann@28350
   317
          in of_iapp match_cont t' (fold_rev (cons o of_iterm NONE) ts []) end
haftmann@31049
   318
        and of_iapp match_cont (IConst (c, ((_, dss), _))) ts = constapp c dss ts
haftmann@31889
   319
          | of_iapp match_cont (IVar v) ts = nbe_apps (nbe_bound_optional v) ts
haftmann@31724
   320
          | of_iapp match_cont ((v, _) `|=> t) ts =
haftmann@31888
   321
              nbe_apps (nbe_abss 1 (ml_abs (ml_list [nbe_bound_optional v]) (of_iterm NONE t))) ts
haftmann@28350
   322
          | of_iapp match_cont (ICase (((t, _), cs), t0)) ts =
haftmann@28350
   323
              nbe_apps (ml_cases (of_iterm NONE t)
haftmann@28350
   324
                (map (fn (p, t) => (of_iterm NONE p, of_iterm match_cont t)) cs
haftmann@28350
   325
                  @ [("_", case match_cont of SOME s => s | NONE => of_iterm NONE t0)])) ts
haftmann@25944
   326
      in of_iterm end;
haftmann@24155
   327
haftmann@28350
   328
    fun subst_nonlin_vars args =
haftmann@28350
   329
      let
haftmann@28350
   330
        val vs = (fold o Code_Thingol.fold_varnames)
wenzelm@33002
   331
          (fn v => AList.map_default (op =) (v, 0) (Integer.add 1)) args [];
haftmann@28350
   332
        val names = Name.make_context (map fst vs);
wenzelm@43329
   333
        fun declare v k ctxt =
wenzelm@43329
   334
          let val vs = Name.invent ctxt v k
haftmann@28350
   335
          in (vs, fold Name.declare vs ctxt) end;
haftmann@28350
   336
        val (vs_renames, _) = fold_map (fn (v, k) => if k > 1
haftmann@28350
   337
          then declare v (k - 1) #>> (fn vs => (v, vs))
haftmann@28350
   338
          else pair (v, [])) vs names;
haftmann@28350
   339
        val samepairs = maps (fn (v, vs) => map (pair v) vs) vs_renames;
haftmann@28350
   340
        fun subst_vars (t as IConst _) samepairs = (t, samepairs)
haftmann@31889
   341
          | subst_vars (t as IVar NONE) samepairs = (t, samepairs)
haftmann@31889
   342
          | subst_vars (t as IVar (SOME v)) samepairs = (case AList.lookup (op =) samepairs v
haftmann@31889
   343
             of SOME v' => (IVar (SOME v'), AList.delete (op =) v samepairs)
haftmann@28350
   344
              | NONE => (t, samepairs))
haftmann@28350
   345
          | subst_vars (t1 `$ t2) samepairs = samepairs
haftmann@28350
   346
              |> subst_vars t1
haftmann@28350
   347
              ||>> subst_vars t2
haftmann@28350
   348
              |>> (op `$)
haftmann@28350
   349
          | subst_vars (ICase (_, t)) samepairs = subst_vars t samepairs;
haftmann@28350
   350
        val (args', _) = fold_map subst_vars args samepairs;
haftmann@28350
   351
      in (samepairs, args') end;
haftmann@28350
   352
haftmann@28337
   353
    fun assemble_eqn c dicts default_args (i, (args, rhs)) =
haftmann@28337
   354
      let
haftmann@28337
   355
        val is_eval = (c = "");
haftmann@28337
   356
        val default_rhs = nbe_apps_local (i+1) c (dicts @ default_args);
haftmann@28337
   357
        val match_cont = if is_eval then NONE else SOME default_rhs;
haftmann@28350
   358
        val assemble_arg = assemble_iterm
haftmann@28350
   359
          (fn c => fn _ => fn ts => nbe_apps_constr idx_of c ts) NONE;
haftmann@35371
   360
        val assemble_rhs = assemble_iterm assemble_constapp match_cont;
haftmann@28350
   361
        val (samepairs, args') = subst_nonlin_vars args;
haftmann@28350
   362
        val s_args = map assemble_arg args';
haftmann@28350
   363
        val s_rhs = if null samepairs then assemble_rhs rhs
haftmann@41037
   364
          else ml_if (ml_and (map nbe_same samepairs))
haftmann@28350
   365
            (assemble_rhs rhs) default_rhs;
haftmann@28337
   366
        val eqns = if is_eval then
haftmann@28350
   367
            [([ml_list (rev (dicts @ s_args))], s_rhs)]
haftmann@28337
   368
          else
haftmann@28350
   369
            [([ml_list (rev (dicts @ map2 ml_as default_args s_args))], s_rhs),
haftmann@28337
   370
              ([ml_list (rev (dicts @ default_args))], default_rhs)]
haftmann@28337
   371
      in (nbe_fun i c, eqns) end;
haftmann@28337
   372
haftmann@25944
   373
    fun assemble_eqns (c, (num_args, (dicts, eqns))) =
haftmann@25944
   374
      let
haftmann@28337
   375
        val default_args = map nbe_default
wenzelm@43329
   376
          (Name.invent Name.context "a" (num_args - length dicts));
haftmann@28337
   377
        val eqns' = map_index (assemble_eqn c dicts default_args) eqns
haftmann@28337
   378
          @ (if c = "" then [] else [(nbe_fun (length eqns) c,
haftmann@28337
   379
            [([ml_list (rev (dicts @ default_args))],
haftmann@28337
   380
              nbe_apps_constr idx_of c (dicts @ default_args))])]);
haftmann@28337
   381
      in (eqns', nbe_abss num_args (nbe_fun 0 c)) end;
haftmann@24155
   382
haftmann@25944
   383
    val (fun_vars, fun_vals) = map_split assemble_eqns eqnss';
haftmann@28337
   384
    val deps_vars = ml_list (map (nbe_fun 0) deps);
haftmann@28337
   385
  in ml_abs deps_vars (ml_Let (ml_fundefs (flat fun_vars)) (ml_list fun_vals)) end;
haftmann@25944
   386
haftmann@35371
   387
haftmann@39392
   388
(* compile equations *)
haftmann@25944
   389
haftmann@39392
   390
fun compile_eqnss thy nbe_program raw_deps [] = []
haftmann@39392
   391
  | compile_eqnss thy nbe_program raw_deps eqnss =
haftmann@24155
   392
      let
wenzelm@42361
   393
        val ctxt = Proof_Context.init_global thy;
haftmann@26064
   394
        val (deps, deps_vals) = split_list (map_filter
haftmann@39392
   395
          (fn dep => Option.map (fn univ => (dep, univ)) (fst ((Graph.get_node nbe_program dep)))) raw_deps);
haftmann@26064
   396
        val idx_of = raw_deps
haftmann@39392
   397
          |> map (fn dep => (dep, snd (Graph.get_node nbe_program dep)))
haftmann@26064
   398
          |> AList.lookup (op =)
haftmann@26064
   399
          |> (fn f => the o f);
haftmann@26064
   400
        val s = assemble_eqnss idx_of deps eqnss;
haftmann@24155
   401
        val cs = map fst eqnss;
haftmann@25944
   402
      in
haftmann@25944
   403
        s
haftmann@32544
   404
        |> traced (fn s => "\n--- code to be evaluated:\n" ^ s)
haftmann@38931
   405
        |> pair ""
haftmann@39911
   406
        |> Code_Runtime.value ctxt univs_cookie
haftmann@25944
   407
        |> (fn f => f deps_vals)
haftmann@25944
   408
        |> (fn univs => cs ~~ univs)
haftmann@25944
   409
      end;
haftmann@25190
   410
wenzelm@30672
   411
haftmann@39392
   412
(* extract equations from statements *)
haftmann@24155
   413
haftmann@37437
   414
fun eqns_of_stmt (_, Code_Thingol.Fun (_, ((_, []), _))) =
haftmann@25101
   415
      []
haftmann@37437
   416
  | eqns_of_stmt (const, Code_Thingol.Fun (_, (((vs, _), eqns), _))) =
haftmann@25101
   417
      [(const, (vs, map fst eqns))]
haftmann@28054
   418
  | eqns_of_stmt (_, Code_Thingol.Datatypecons _) =
haftmann@25101
   419
      []
haftmann@28054
   420
  | eqns_of_stmt (_, Code_Thingol.Datatype _) =
haftmann@25101
   421
      []
haftmann@37447
   422
  | eqns_of_stmt (class, Code_Thingol.Class (_, (v, (super_classes, classparams)))) =
haftmann@25101
   423
      let
haftmann@37384
   424
        val names = map snd super_classes @ map fst classparams;
wenzelm@43329
   425
        val params = Name.invent Name.context "d" (length names);
haftmann@25101
   426
        fun mk (k, name) =
haftmann@25101
   427
          (name, ([(v, [])],
haftmann@31889
   428
            [([IConst (class, (([], []), [])) `$$ map (IVar o SOME) params],
haftmann@31889
   429
              IVar (SOME (nth params k)))]));
haftmann@25101
   430
      in map_index mk names end
haftmann@28054
   431
  | eqns_of_stmt (_, Code_Thingol.Classrel _) =
haftmann@25101
   432
      []
haftmann@28054
   433
  | eqns_of_stmt (_, Code_Thingol.Classparam _) =
haftmann@25101
   434
      []
haftmann@37449
   435
  | eqns_of_stmt (inst, Code_Thingol.Classinst ((class, (_, arity_args)), (super_instances, (classparam_instances, _)))) =
haftmann@37384
   436
      [(inst, (arity_args, [([], IConst (class, (([], []), [])) `$$
haftmann@37384
   437
        map (fn (_, (_, (inst, dss))) => IConst (inst, (([], dss), []))) super_instances
haftmann@37384
   438
        @ map (IConst o snd o fst) classparam_instances)]))];
haftmann@24155
   439
haftmann@39392
   440
haftmann@39392
   441
(* compile whole programs *)
haftmann@39392
   442
haftmann@39399
   443
fun ensure_const_idx name (nbe_program, (maxidx, idx_tab)) =
haftmann@39399
   444
  if can (Graph.get_node nbe_program) name
haftmann@39399
   445
  then (nbe_program, (maxidx, idx_tab))
haftmann@39399
   446
  else (Graph.new_node (name, (NONE, maxidx)) nbe_program,
haftmann@39399
   447
    (maxidx + 1, Inttab.update_new (maxidx, name) idx_tab));
haftmann@39399
   448
haftmann@39392
   449
fun compile_stmts thy stmts_deps =
haftmann@25101
   450
  let
haftmann@25101
   451
    val names = map (fst o fst) stmts_deps;
haftmann@25101
   452
    val names_deps = map (fn ((name, _), deps) => (name, deps)) stmts_deps;
haftmann@25101
   453
    val eqnss = maps (eqns_of_stmt o fst) stmts_deps;
haftmann@26064
   454
    val refl_deps = names_deps
haftmann@25190
   455
      |> maps snd
haftmann@25190
   456
      |> distinct (op =)
haftmann@26064
   457
      |> fold (insert (op =)) names;
haftmann@39392
   458
    fun compile nbe_program = eqnss
haftmann@39392
   459
      |> compile_eqnss thy nbe_program refl_deps
haftmann@39392
   460
      |> rpair nbe_program;
haftmann@25101
   461
  in
haftmann@39399
   462
    fold ensure_const_idx refl_deps
haftmann@26064
   463
    #> apfst (fold (fn (name, deps) => fold (curry Graph.add_edge name) deps) names_deps
haftmann@26064
   464
      #> compile
haftmann@26064
   465
      #-> fold (fn (name, univ) => (Graph.map_node name o apfst) (K (SOME univ))))
haftmann@25101
   466
  end;
haftmann@24155
   467
haftmann@39392
   468
fun compile_program thy program =
haftmann@25101
   469
  let
haftmann@39392
   470
    fun add_stmts names (nbe_program, (maxidx, idx_tab)) = if exists ((can o Graph.get_node) nbe_program) names
haftmann@39392
   471
      then (nbe_program, (maxidx, idx_tab))
haftmann@39392
   472
      else (nbe_program, (maxidx, idx_tab))
haftmann@39392
   473
        |> compile_stmts thy (map (fn name => ((name, Graph.get_node program name),
haftmann@27103
   474
          Graph.imm_succs program name)) names);
haftmann@28706
   475
  in
haftmann@28706
   476
    fold_rev add_stmts (Graph.strong_conn program)
haftmann@28706
   477
  end;
haftmann@24155
   478
haftmann@25944
   479
haftmann@25944
   480
(** evaluation **)
haftmann@25944
   481
haftmann@39392
   482
(* term evaluation by compilation *)
haftmann@25944
   483
haftmann@39392
   484
fun compile_term thy nbe_program deps (vs : (string * sort) list, t) =
haftmann@25924
   485
  let 
haftmann@25924
   486
    val dict_frees = maps (fn (v, sort) => map_index (curry DFree v o fst) sort) vs;
haftmann@25924
   487
  in
haftmann@31064
   488
    ("", (vs, [([], t)]))
haftmann@39392
   489
    |> singleton (compile_eqnss thy nbe_program deps)
haftmann@25924
   490
    |> snd
haftmann@31064
   491
    |> (fn t => apps t (rev dict_frees))
haftmann@25924
   492
  end;
haftmann@24155
   493
haftmann@35371
   494
haftmann@39392
   495
(* reconstruction *)
haftmann@24155
   496
haftmann@30947
   497
fun typ_of_itype program vs (ityco `%% itys) =
haftmann@30947
   498
      let
haftmann@30947
   499
        val Code_Thingol.Datatype (tyco, _) = Graph.get_node program ityco;
haftmann@30947
   500
      in Type (tyco, map (typ_of_itype program vs) itys) end
haftmann@30947
   501
  | typ_of_itype program vs (ITyVar v) =
haftmann@30947
   502
      let
haftmann@30947
   503
        val sort = (the o AList.lookup (op =) vs) v;
haftmann@30947
   504
      in TFree ("'" ^ v, sort) end;
haftmann@30947
   505
haftmann@28663
   506
fun term_of_univ thy program idx_tab t =
haftmann@24155
   507
  let
haftmann@25101
   508
    fun take_until f [] = []
haftmann@25101
   509
      | take_until f (x::xs) = if f x then [] else x :: take_until f xs;
haftmann@28663
   510
    fun is_dict (Const (idx, _)) = (case (Graph.get_node program o the o Inttab.lookup idx_tab) idx
haftmann@28663
   511
         of Code_Thingol.Class _ => true
haftmann@28663
   512
          | Code_Thingol.Classrel _ => true
haftmann@28663
   513
          | Code_Thingol.Classinst _ => true
haftmann@28663
   514
          | _ => false)
haftmann@25101
   515
      | is_dict (DFree _) = true
haftmann@25101
   516
      | is_dict _ = false;
haftmann@28663
   517
    fun const_of_idx idx = (case (Graph.get_node program o the o Inttab.lookup idx_tab) idx
haftmann@35371
   518
     of Code_Thingol.Fun (c, _) => c
haftmann@35371
   519
      | Code_Thingol.Datatypecons (c, _) => c
haftmann@35371
   520
      | Code_Thingol.Classparam (c, _) => c);
haftmann@24155
   521
    fun of_apps bounds (t, ts) =
haftmann@24155
   522
      fold_map (of_univ bounds) ts
haftmann@24155
   523
      #>> (fn ts' => list_comb (t, rev ts'))
haftmann@26064
   524
    and of_univ bounds (Const (idx, ts)) typidx =
haftmann@24155
   525
          let
haftmann@25101
   526
            val ts' = take_until is_dict ts;
haftmann@28663
   527
            val c = const_of_idx idx;
haftmann@31957
   528
            val T = map_type_tvar (fn ((v, i), _) =>
wenzelm@37145
   529
              Type_Infer.param typidx (v ^ string_of_int i, []))
haftmann@31957
   530
                (Sign.the_const_type thy c);
haftmann@30022
   531
            val typidx' = typidx + 1;
haftmann@31957
   532
          in of_apps bounds (Term.Const (c, T), ts') typidx' end
haftmann@27499
   533
      | of_univ bounds (BVar (n, ts)) typidx =
haftmann@27499
   534
          of_apps bounds (Bound (bounds - n - 1), ts) typidx
haftmann@24155
   535
      | of_univ bounds (t as Abs _) typidx =
haftmann@24155
   536
          typidx
haftmann@25924
   537
          |> of_univ (bounds + 1) (apps t [BVar (bounds, [])])
haftmann@24155
   538
          |-> (fn t' => pair (Term.Abs ("u", dummyT, t')))
haftmann@24155
   539
  in of_univ 0 t 0 |> fst end;
haftmann@24155
   540
haftmann@35371
   541
haftmann@39392
   542
(* evaluation with type reconstruction *)
haftmann@39392
   543
haftmann@39392
   544
fun eval_term thy program (nbe_program, idx_tab) ((vs0, (vs, ty)), t) deps =
haftmann@39392
   545
  let
haftmann@39392
   546
    val ctxt = Syntax.init_pretty_global thy;
haftmann@39392
   547
    val string_of_term = Syntax.string_of_term (Config.put show_types true ctxt);
haftmann@39392
   548
    val ty' = typ_of_itype program vs0 ty;
wenzelm@42405
   549
    fun type_infer t =
wenzelm@42405
   550
      Syntax.check_term (Config.put Type_Infer_Context.const_sorts false ctxt)
wenzelm@42405
   551
        (Type.constraint ty' t);
haftmann@39392
   552
    fun check_tvars t =
haftmann@39392
   553
      if null (Term.add_tvars t []) then t
haftmann@39392
   554
      else error ("Illegal schematic type variables in normalized term: " ^ string_of_term t);
haftmann@39392
   555
  in
haftmann@39392
   556
    compile_term thy nbe_program deps (vs, t)
haftmann@39392
   557
    |> term_of_univ thy program idx_tab
haftmann@39392
   558
    |> traced (fn t => "Normalized:\n" ^ string_of_term t)
haftmann@39392
   559
    |> type_infer
haftmann@39392
   560
    |> traced (fn t => "Types inferred:\n" ^ string_of_term t)
haftmann@39392
   561
    |> check_tvars
haftmann@39392
   562
    |> traced (fn _ => "---\n")
haftmann@39392
   563
  end;
haftmann@39392
   564
haftmann@39436
   565
haftmann@25101
   566
(* function store *)
haftmann@25101
   567
haftmann@34173
   568
structure Nbe_Functions = Code_Data
haftmann@25101
   569
(
haftmann@35500
   570
  type T = (Univ option * int) Graph.T * (int * string Inttab.table);
haftmann@35500
   571
  val empty = (Graph.empty, (0, Inttab.empty));
haftmann@25101
   572
);
haftmann@25101
   573
haftmann@39399
   574
fun compile ignore_cache thy program =
haftmann@24155
   575
  let
haftmann@39392
   576
    val (nbe_program, (_, idx_tab)) =
haftmann@39399
   577
      Nbe_Functions.change (if ignore_cache then NONE else SOME thy)
haftmann@39399
   578
        (compile_program thy program);
haftmann@39392
   579
  in (nbe_program, idx_tab) end;
haftmann@24155
   580
haftmann@32544
   581
haftmann@39396
   582
(* dynamic evaluation oracle *)
haftmann@24155
   583
haftmann@30947
   584
fun mk_equals thy lhs raw_rhs =
haftmann@26747
   585
  let
haftmann@30947
   586
    val ty = Thm.typ_of (Thm.ctyp_of_term lhs);
haftmann@30947
   587
    val eq = Thm.cterm_of thy (Term.Const ("==", ty --> ty --> propT));
haftmann@30947
   588
    val rhs = Thm.cterm_of thy raw_rhs;
haftmann@30947
   589
  in Thm.mk_binop eq lhs rhs end;
haftmann@26747
   590
haftmann@38669
   591
val (_, raw_oracle) = Context.>>> (Context.map_theory_result
haftmann@39399
   592
  (Thm.add_oracle (Binding.name "normalization_by_evaluation",
haftmann@39399
   593
    fn (thy, program, nbe_program_idx_tab, vsp_ty_t, deps, ct) =>
haftmann@39399
   594
      mk_equals thy ct (eval_term thy program nbe_program_idx_tab vsp_ty_t deps))));
haftmann@31064
   595
haftmann@39399
   596
fun oracle thy program nbe_program_idx_tab vsp_ty_t deps ct =
haftmann@39399
   597
  raw_oracle (thy, program, nbe_program_idx_tab, vsp_ty_t, deps, ct);
haftmann@30942
   598
haftmann@41247
   599
fun dynamic_conv thy = lift_triv_classes_conv thy (Code_Thingol.dynamic_conv thy
haftmann@41247
   600
    (K (fn program => oracle thy program (compile false thy program))));
haftmann@24155
   601
haftmann@41184
   602
fun dynamic_value thy = lift_triv_classes_rew thy
haftmann@41184
   603
  (Code_Thingol.dynamic_value thy I
haftmann@39606
   604
    (K (fn program => eval_term thy program (compile false thy program))));
haftmann@39399
   605
haftmann@41184
   606
fun static_conv thy consts =
haftmann@41184
   607
  lift_triv_classes_conv thy (Code_Thingol.static_conv thy consts
haftmann@41346
   608
    (K (fn program => fn _ => let val nbe_program = compile true thy program
haftmann@41346
   609
      in oracle thy program nbe_program end)));
haftmann@24839
   610
haftmann@41184
   611
fun static_value thy consts = lift_triv_classes_rew thy
haftmann@41184
   612
  (Code_Thingol.static_value thy I consts
haftmann@41346
   613
    (K (fn program => fn _ => let val nbe_program = compile true thy program
haftmann@41346
   614
      in eval_term thy program (compile false thy program) end)));
haftmann@41184
   615
haftmann@35371
   616
haftmann@39396
   617
(** setup **)
haftmann@24155
   618
wenzelm@42361
   619
val setup = Value.add_evaluator ("nbe", dynamic_value o Proof_Context.theory_of);
haftmann@24155
   620
haftmann@24155
   621
end;
haftmann@28337
   622