src/Tools/nbe.ML
author haftmann
Tue Sep 23 18:11:44 2008 +0200 (2008-09-23)
changeset 28337 93964076e7b8
parent 28296 9efd7d4fa2f2
child 28350 715163ec93c0
permissions -rw-r--r--
case default fallback for NBE
haftmann@24590
     1
(*  Title:      Tools/nbe.ML
haftmann@24155
     2
    ID:         $Id$
haftmann@24155
     3
    Authors:    Klaus Aehlig, LMU Muenchen; Tobias Nipkow, Florian Haftmann, TU Muenchen
haftmann@24155
     4
haftmann@24839
     5
Normalization by evaluation, based on generic code generator.
haftmann@24155
     6
*)
haftmann@24155
     7
haftmann@24155
     8
signature NBE =
haftmann@24155
     9
sig
haftmann@25101
    10
  val norm_conv: cterm -> thm
haftmann@25101
    11
  val norm_term: theory -> term -> term
haftmann@25101
    12
wenzelm@25204
    13
  datatype Univ =
haftmann@26064
    14
      Const of int * Univ list               (*named (uninterpreted) constants*)
haftmann@25924
    15
    | Free of string * Univ list             (*free (uninterpreted) variables*)
haftmann@25924
    16
    | DFree of string * int                  (*free (uninterpreted) dictionary parameters*)
haftmann@24155
    17
    | BVar of int * Univ list
haftmann@24155
    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@24155
    22
wenzelm@25204
    23
  val univs_ref: (unit -> Univ list -> Univ list) option ref
haftmann@24155
    24
  val trace: bool ref
haftmann@25924
    25
haftmann@26747
    26
  val setup: theory -> theory
haftmann@24155
    27
end;
haftmann@24155
    28
haftmann@24155
    29
structure Nbe: NBE =
haftmann@24155
    30
struct
haftmann@24155
    31
haftmann@24155
    32
(* generic non-sense *)
haftmann@24155
    33
haftmann@24155
    34
val trace = ref false;
haftmann@24155
    35
fun tracing f x = if !trace then (Output.tracing (f x); x) else x;
haftmann@24155
    36
haftmann@24155
    37
haftmann@24155
    38
(** the semantical universe **)
haftmann@24155
    39
haftmann@24155
    40
(*
haftmann@24155
    41
   Functions are given by their semantical function value. To avoid
haftmann@24155
    42
   trouble with the ML-type system, these functions have the most
haftmann@24155
    43
   generic type, that is "Univ list -> Univ". The calling convention is
haftmann@24155
    44
   that the arguments come as a list, the last argument first. In
haftmann@24155
    45
   other words, a function call that usually would look like
haftmann@24155
    46
haftmann@24155
    47
   f x_1 x_2 ... x_n   or   f(x_1,x_2, ..., x_n)
haftmann@24155
    48
haftmann@24155
    49
   would be in our convention called as
haftmann@24155
    50
haftmann@24155
    51
              f [x_n,..,x_2,x_1]
haftmann@24155
    52
haftmann@24155
    53
   Moreover, to handle functions that are still waiting for some
haftmann@24155
    54
   arguments we have additionally a list of arguments collected to far
haftmann@24155
    55
   and the number of arguments we're still waiting for.
haftmann@24155
    56
*)
haftmann@24155
    57
wenzelm@25204
    58
datatype Univ =
haftmann@26064
    59
    Const of int * Univ list           (*named (uninterpreted) constants*)
haftmann@24155
    60
  | Free of string * Univ list         (*free variables*)
haftmann@25924
    61
  | DFree of string * int              (*free (uninterpreted) dictionary parameters*)
haftmann@27499
    62
  | BVar of int * Univ list            (*bound variables, named*)
haftmann@24155
    63
  | Abs of (int * (Univ list -> Univ)) * Univ list
haftmann@27499
    64
                                       (*abstractions as closures*);
haftmann@24155
    65
haftmann@24155
    66
(* constructor functions *)
haftmann@24155
    67
haftmann@25944
    68
fun abss n f = Abs ((n, f), []);
haftmann@25924
    69
fun apps (Abs ((n, f), xs)) ys = let val k = n - length ys in
haftmann@27499
    70
      case int_ord (k, 0)
haftmann@27499
    71
       of EQUAL => f (ys @ xs)
haftmann@27499
    72
        | LESS => let val (zs, ws) = chop (~ k) ys in apps (f (ws @ xs)) zs end
haftmann@27499
    73
        | GREATER => Abs ((k, f), ys @ xs) (*note: reverse convention also for apps!*)
haftmann@27499
    74
      end
haftmann@25924
    75
  | apps (Const (name, xs)) ys = Const (name, ys @ xs)
haftmann@25924
    76
  | apps (Free (name, xs)) ys = Free (name, ys @ xs)
haftmann@27499
    77
  | apps (BVar (n, xs)) ys = BVar (n, ys @ xs);
haftmann@24155
    78
haftmann@24155
    79
haftmann@24155
    80
(** assembling and compiling ML code from terms **)
haftmann@24155
    81
haftmann@24155
    82
(* abstract ML syntax *)
haftmann@24155
    83
haftmann@24155
    84
infix 9 `$` `$$`;
haftmann@24155
    85
fun e1 `$` e2 = "(" ^ e1 ^ " " ^ e2 ^ ")";
haftmann@25101
    86
fun e `$$` [] = e
haftmann@25101
    87
  | e `$$` es = "(" ^ e ^ " " ^ space_implode " " es ^ ")";
haftmann@24590
    88
fun ml_abs v e = "(fn " ^ v ^ " => " ^ e ^ ")";
haftmann@24155
    89
haftmann@24155
    90
fun ml_cases t cs =
haftmann@24155
    91
  "(case " ^ t ^ " of " ^ space_implode " | " (map (fn (p, t) => p ^ " => " ^ t) cs) ^ ")";
haftmann@25944
    92
fun ml_Let d e = "let\n" ^ d ^ " in " ^ e ^ " end";
haftmann@28337
    93
fun ml_as v t = "(" ^ v ^ " as " ^ t ^ ")";
haftmann@24155
    94
haftmann@24155
    95
fun ml_list es = "[" ^ commas es ^ "]";
haftmann@24155
    96
haftmann@24155
    97
fun ml_fundefs ([(name, [([], e)])]) =
haftmann@24155
    98
      "val " ^ name ^ " = " ^ e ^ "\n"
haftmann@24155
    99
  | ml_fundefs (eqs :: eqss) =
haftmann@24155
   100
      let
haftmann@24155
   101
        fun fundef (name, eqs) =
haftmann@24155
   102
          let
haftmann@24155
   103
            fun eqn (es, e) = name ^ " " ^ space_implode " " es ^ " = " ^ e
haftmann@24155
   104
          in space_implode "\n  | " (map eqn eqs) end;
haftmann@24155
   105
      in
haftmann@24155
   106
        (prefix "fun " o fundef) eqs :: map (prefix "and " o fundef) eqss
wenzelm@26931
   107
        |> cat_lines
haftmann@24155
   108
        |> suffix "\n"
haftmann@24155
   109
      end;
haftmann@24155
   110
haftmann@25944
   111
(* nbe specific syntax and sandbox communication *)
haftmann@25944
   112
haftmann@25944
   113
val univs_ref = ref (NONE : (unit -> Univ list -> Univ list) option);
haftmann@24155
   114
haftmann@24155
   115
local
haftmann@24155
   116
  val prefix =          "Nbe.";
haftmann@25944
   117
  val name_ref =        prefix ^ "univs_ref";
haftmann@24155
   118
  val name_const =      prefix ^ "Const";
haftmann@25944
   119
  val name_abss =       prefix ^ "abss";
haftmann@25924
   120
  val name_apps =       prefix ^ "apps";
haftmann@24155
   121
in
haftmann@24155
   122
haftmann@25944
   123
val univs_cookie = (name_ref, univs_ref);
haftmann@25944
   124
haftmann@28337
   125
fun nbe_fun 0 "" = "nbe_value"
haftmann@28337
   126
  | nbe_fun i c = "c_" ^ translate_string (fn "." => "_" | c => c) c ^ "_" ^ string_of_int i;
haftmann@25101
   127
fun nbe_dict v n = "d_" ^ v ^ "_" ^ string_of_int n;
haftmann@24155
   128
fun nbe_bound v = "v_" ^ v;
haftmann@28337
   129
fun nbe_default v = "w_" ^ v;
haftmann@24155
   130
haftmann@25924
   131
(*note: these three are the "turning spots" where proper argument order is established!*)
haftmann@25924
   132
fun nbe_apps t [] = t
haftmann@25924
   133
  | nbe_apps t ts = name_apps `$$` [t, ml_list (rev ts)];
haftmann@28337
   134
fun nbe_apps_local i c ts = nbe_fun i c `$` ml_list (rev ts);
haftmann@28337
   135
fun nbe_apps_constr idx_of c ts =
haftmann@28337
   136
  let
haftmann@28337
   137
    val c' = if !trace then string_of_int (idx_of c) ^ " (*" ^ c ^ "*)"
haftmann@28337
   138
      else string_of_int (idx_of c);
haftmann@28337
   139
  in name_const `$` ("(" ^ c' ^ ", " ^ ml_list (rev ts) ^ ")") end;
haftmann@25924
   140
haftmann@24155
   141
fun nbe_abss 0 f = f `$` ml_list []
haftmann@25944
   142
  | nbe_abss n f = name_abss `$$` [string_of_int n, f];
haftmann@24155
   143
haftmann@24155
   144
end;
haftmann@24155
   145
haftmann@28054
   146
open Basic_Code_Thingol;
haftmann@24155
   147
haftmann@25865
   148
(* code generation *)
haftmann@24155
   149
haftmann@26064
   150
fun assemble_eqnss idx_of deps eqnss =
haftmann@25944
   151
  let
haftmann@25944
   152
    fun prep_eqns (c, (vs, eqns)) =
haftmann@25924
   153
      let
haftmann@25944
   154
        val dicts = maps (fn (v, sort) => map_index (nbe_dict v o fst) sort) vs;
haftmann@28337
   155
        val num_args = length dicts + ((length o fst o hd) eqns);
haftmann@25944
   156
      in (c, (num_args, (dicts, eqns))) end;
haftmann@25944
   157
    val eqnss' = map prep_eqns eqnss;
haftmann@25944
   158
haftmann@25944
   159
    fun assemble_constapp c dss ts = 
haftmann@25944
   160
      let
haftmann@25944
   161
        val ts' = (maps o map) assemble_idict dss @ ts;
haftmann@25944
   162
      in case AList.lookup (op =) eqnss' c
haftmann@28337
   163
       of SOME (num_args, _) => if num_args <= length ts'
haftmann@28337
   164
            then let val (ts1, ts2) = chop num_args ts'
haftmann@28337
   165
            in nbe_apps (nbe_apps_local 0 c ts1) ts2
haftmann@28337
   166
            end else nbe_apps (nbe_abss num_args (nbe_fun 0 c)) ts'
haftmann@25944
   167
        | NONE => if member (op =) deps c
haftmann@28337
   168
            then nbe_apps (nbe_fun 0 c) ts'
haftmann@28337
   169
            else nbe_apps_constr idx_of c ts'
haftmann@25924
   170
      end
haftmann@25944
   171
    and assemble_idict (DictConst (inst, dss)) =
haftmann@25944
   172
          assemble_constapp inst dss []
haftmann@25944
   173
      | assemble_idict (DictVar (supers, (v, (n, _)))) =
haftmann@25944
   174
          fold_rev (fn super => assemble_constapp super [] o single) supers (nbe_dict v n);
haftmann@25924
   175
haftmann@28337
   176
    fun assemble_iterm match_cont constapp =
haftmann@24155
   177
      let
haftmann@25944
   178
        fun of_iterm t =
haftmann@25944
   179
          let
haftmann@28054
   180
            val (t', ts) = Code_Thingol.unfold_app t
haftmann@25944
   181
          in of_iapp t' (fold_rev (cons o of_iterm) ts []) end
haftmann@25944
   182
        and of_iapp (IConst (c, (dss, _))) ts = constapp c dss ts
haftmann@25944
   183
          | of_iapp (IVar v) ts = nbe_apps (nbe_bound v) ts
haftmann@25944
   184
          | of_iapp ((v, _) `|-> t) ts =
haftmann@25944
   185
              nbe_apps (nbe_abss 1 (ml_abs (ml_list [nbe_bound v]) (of_iterm t))) ts
haftmann@25944
   186
          | of_iapp (ICase (((t, _), cs), t0)) ts =
haftmann@25944
   187
              nbe_apps (ml_cases (of_iterm t) (map (pairself of_iterm) cs
haftmann@28337
   188
                @ [("_", case match_cont of SOME s => s | NONE => of_iterm t0)])) ts
haftmann@25944
   189
      in of_iterm end;
haftmann@24155
   190
haftmann@28337
   191
    fun assemble_eqn c dicts default_args (i, (args, rhs)) =
haftmann@28337
   192
      let
haftmann@28337
   193
        val is_eval = (c = "");
haftmann@28337
   194
        val default_rhs = nbe_apps_local (i+1) c (dicts @ default_args);
haftmann@28337
   195
        val match_cont = if is_eval then NONE else SOME default_rhs;
haftmann@28337
   196
        val assemble_arg = assemble_iterm NONE
haftmann@28337
   197
          (fn c => fn _ => fn ts => nbe_apps_constr idx_of c ts);
haftmann@28337
   198
        val assemble_rhs = assemble_iterm match_cont assemble_constapp;
haftmann@28337
   199
        val eqns = if is_eval then
haftmann@28337
   200
            [([ml_list (rev (dicts @ map assemble_arg args))], assemble_rhs rhs)]
haftmann@28337
   201
          else
haftmann@28337
   202
            [([ml_list (rev (dicts @ map2 ml_as default_args
haftmann@28337
   203
                (map assemble_arg args)))], assemble_rhs rhs),
haftmann@28337
   204
              ([ml_list (rev (dicts @ default_args))], default_rhs)]
haftmann@28337
   205
      in (nbe_fun i c, eqns) end;
haftmann@28337
   206
haftmann@25944
   207
    fun assemble_eqns (c, (num_args, (dicts, eqns))) =
haftmann@25944
   208
      let
haftmann@28337
   209
        val default_args = map nbe_default
haftmann@28337
   210
          (Name.invent_list [] "a" (num_args - length dicts));
haftmann@28337
   211
        val eqns' = map_index (assemble_eqn c dicts default_args) eqns
haftmann@28337
   212
          @ (if c = "" then [] else [(nbe_fun (length eqns) c,
haftmann@28337
   213
            [([ml_list (rev (dicts @ default_args))],
haftmann@28337
   214
              nbe_apps_constr idx_of c (dicts @ default_args))])]);
haftmann@28337
   215
      in (eqns', nbe_abss num_args (nbe_fun 0 c)) end;
haftmann@24155
   216
haftmann@25944
   217
    val (fun_vars, fun_vals) = map_split assemble_eqns eqnss';
haftmann@28337
   218
    val deps_vars = ml_list (map (nbe_fun 0) deps);
haftmann@28337
   219
  in ml_abs deps_vars (ml_Let (ml_fundefs (flat fun_vars)) (ml_list fun_vals)) end;
haftmann@25944
   220
haftmann@25944
   221
(* code compilation *)
haftmann@25944
   222
wenzelm@28274
   223
fun compile_eqnss _ gr raw_deps [] = []
wenzelm@28274
   224
  | compile_eqnss ctxt gr raw_deps eqnss =
haftmann@24155
   225
      let
haftmann@26064
   226
        val (deps, deps_vals) = split_list (map_filter
haftmann@26064
   227
          (fn dep => Option.map (fn univ => (dep, univ)) (fst ((Graph.get_node gr dep)))) raw_deps);
haftmann@26064
   228
        val idx_of = raw_deps
haftmann@26064
   229
          |> map (fn dep => (dep, snd (Graph.get_node gr dep)))
haftmann@26064
   230
          |> AList.lookup (op =)
haftmann@26064
   231
          |> (fn f => the o f);
haftmann@26064
   232
        val s = assemble_eqnss idx_of deps eqnss;
haftmann@24155
   233
        val cs = map fst eqnss;
haftmann@25944
   234
      in
haftmann@25944
   235
        s
haftmann@25944
   236
        |> tracing (fn s => "\n--- code to be evaluated:\n" ^ s)
wenzelm@28274
   237
        |> ML_Context.evaluate ctxt
haftmann@25944
   238
            (Output.tracing o enclose "\n---compiler echo:\n" "\n---\n",
haftmann@25944
   239
            Output.tracing o enclose "\n--- compiler echo (with error):\n" "\n---\n")
haftmann@25944
   240
            (!trace) univs_cookie
haftmann@25944
   241
        |> (fn f => f deps_vals)
haftmann@25944
   242
        |> (fn univs => cs ~~ univs)
haftmann@25944
   243
      end;
haftmann@25190
   244
haftmann@25944
   245
(* preparing function equations *)
haftmann@24155
   246
haftmann@28054
   247
fun eqns_of_stmt (_, Code_Thingol.Fun (_, [])) =
haftmann@25101
   248
      []
haftmann@28054
   249
  | eqns_of_stmt (const, Code_Thingol.Fun ((vs, _), eqns)) =
haftmann@25101
   250
      [(const, (vs, map fst eqns))]
haftmann@28054
   251
  | eqns_of_stmt (_, Code_Thingol.Datatypecons _) =
haftmann@25101
   252
      []
haftmann@28054
   253
  | eqns_of_stmt (_, Code_Thingol.Datatype _) =
haftmann@25101
   254
      []
haftmann@28054
   255
  | eqns_of_stmt (class, Code_Thingol.Class (v, (superclasses, classops))) =
haftmann@25101
   256
      let
haftmann@25101
   257
        val names = map snd superclasses @ map fst classops;
haftmann@25101
   258
        val params = Name.invent_list [] "d" (length names);
haftmann@25101
   259
        fun mk (k, name) =
haftmann@25101
   260
          (name, ([(v, [])],
haftmann@25101
   261
            [([IConst (class, ([], [])) `$$ map IVar params], IVar (nth params k))]));
haftmann@25101
   262
      in map_index mk names end
haftmann@28054
   263
  | eqns_of_stmt (_, Code_Thingol.Classrel _) =
haftmann@25101
   264
      []
haftmann@28054
   265
  | eqns_of_stmt (_, Code_Thingol.Classparam _) =
haftmann@25101
   266
      []
haftmann@28054
   267
  | eqns_of_stmt (inst, Code_Thingol.Classinst ((class, (_, arities)), (superinsts, instops))) =
haftmann@25101
   268
      [(inst, (arities, [([], IConst (class, ([], [])) `$$
haftmann@25101
   269
        map (fn (_, (_, (inst, dicts))) => IConst (inst, (dicts, []))) superinsts
haftmann@25101
   270
        @ map (IConst o snd o fst) instops)]))];
haftmann@24155
   271
wenzelm@28274
   272
fun compile_stmts ctxt stmts_deps =
haftmann@25101
   273
  let
haftmann@25101
   274
    val names = map (fst o fst) stmts_deps;
haftmann@25101
   275
    val names_deps = map (fn ((name, _), deps) => (name, deps)) stmts_deps;
haftmann@25101
   276
    val eqnss = maps (eqns_of_stmt o fst) stmts_deps;
haftmann@26064
   277
    val refl_deps = names_deps
haftmann@25190
   278
      |> maps snd
haftmann@25190
   279
      |> distinct (op =)
haftmann@26064
   280
      |> fold (insert (op =)) names;
haftmann@26064
   281
    fun new_node name (gr, (maxidx, idx_tab)) = if can (Graph.get_node gr) name
haftmann@26064
   282
      then (gr, (maxidx, idx_tab))
haftmann@26064
   283
      else (Graph.new_node (name, (NONE, maxidx)) gr,
haftmann@26064
   284
        (maxidx + 1, Inttab.update_new (maxidx, name) idx_tab));
haftmann@25190
   285
    fun compile gr = eqnss
wenzelm@28274
   286
      |> compile_eqnss ctxt gr refl_deps
haftmann@25190
   287
      |> rpair gr;
haftmann@25101
   288
  in
haftmann@26064
   289
    fold new_node refl_deps
haftmann@26064
   290
    #> apfst (fold (fn (name, deps) => fold (curry Graph.add_edge name) deps) names_deps
haftmann@26064
   291
      #> compile
haftmann@26064
   292
      #-> fold (fn (name, univ) => (Graph.map_node name o apfst) (K (SOME univ))))
haftmann@25101
   293
  end;
haftmann@24155
   294
wenzelm@28274
   295
fun ensure_stmts ctxt program =
haftmann@25101
   296
  let
haftmann@26064
   297
    fun add_stmts names (gr, (maxidx, idx_tab)) = if exists ((can o Graph.get_node) gr) names
haftmann@26064
   298
      then (gr, (maxidx, idx_tab))
haftmann@26064
   299
      else (gr, (maxidx, idx_tab))
wenzelm@28274
   300
        |> compile_stmts ctxt (map (fn name => ((name, Graph.get_node program name),
haftmann@27103
   301
          Graph.imm_succs program name)) names);
haftmann@27103
   302
  in fold_rev add_stmts (Graph.strong_conn program) end;
haftmann@24155
   303
haftmann@25944
   304
haftmann@25944
   305
(** evaluation **)
haftmann@25944
   306
haftmann@25944
   307
(* term evaluation *)
haftmann@25944
   308
haftmann@28296
   309
fun eval_term ctxt gr deps ((vs, ty) : typscheme, t) =
haftmann@25924
   310
  let 
haftmann@28054
   311
    val frees = Code_Thingol.fold_unbound_varnames (insert (op =)) t []
haftmann@25924
   312
    val frees' = map (fn v => Free (v, [])) frees;
haftmann@25924
   313
    val dict_frees = maps (fn (v, sort) => map_index (curry DFree v o fst) sort) vs;
haftmann@25924
   314
  in
haftmann@25935
   315
    ("", (vs, [(map IVar frees, t)]))
wenzelm@28274
   316
    |> singleton (compile_eqnss ctxt gr deps)
haftmann@25924
   317
    |> snd
haftmann@25924
   318
    |> (fn t => apps t (rev (dict_frees @ frees')))
haftmann@25924
   319
  end;
haftmann@24155
   320
haftmann@24839
   321
(* reification *)
haftmann@24155
   322
haftmann@26064
   323
fun term_of_univ thy idx_tab t =
haftmann@24155
   324
  let
haftmann@25101
   325
    fun take_until f [] = []
haftmann@25101
   326
      | take_until f (x::xs) = if f x then [] else x :: take_until f xs;
haftmann@26064
   327
    fun is_dict (Const (idx, _)) =
haftmann@26064
   328
          let
haftmann@26064
   329
            val c = the (Inttab.lookup idx_tab idx);
haftmann@26064
   330
          in
haftmann@28054
   331
            (is_some o Code_Name.class_rev thy) c
haftmann@28054
   332
            orelse (is_some o Code_Name.classrel_rev thy) c
haftmann@28054
   333
            orelse (is_some o Code_Name.instance_rev thy) c
haftmann@26064
   334
          end
haftmann@25101
   335
      | is_dict (DFree _) = true
haftmann@25101
   336
      | is_dict _ = false;
haftmann@24155
   337
    fun of_apps bounds (t, ts) =
haftmann@24155
   338
      fold_map (of_univ bounds) ts
haftmann@24155
   339
      #>> (fn ts' => list_comb (t, rev ts'))
haftmann@26064
   340
    and of_univ bounds (Const (idx, ts)) typidx =
haftmann@24155
   341
          let
haftmann@25101
   342
            val ts' = take_until is_dict ts;
haftmann@28054
   343
            val c = (the o Code_Name.const_rev thy o the o Inttab.lookup idx_tab) idx;
haftmann@26970
   344
            val (_, T) = Code.default_typ thy c;
haftmann@26739
   345
            val T' = map_type_tvar (fn ((v, i), S) => TypeInfer.param (typidx + i) (v, [])) T;
haftmann@24155
   346
            val typidx' = typidx + maxidx_of_typ T' + 1;
haftmann@25101
   347
          in of_apps bounds (Term.Const (c, T'), ts') typidx' end
haftmann@24155
   348
      | of_univ bounds (Free (name, ts)) typidx =
haftmann@24155
   349
          of_apps bounds (Term.Free (name, dummyT), ts) typidx
haftmann@27499
   350
      | of_univ bounds (BVar (n, ts)) typidx =
haftmann@27499
   351
          of_apps bounds (Bound (bounds - n - 1), ts) typidx
haftmann@24155
   352
      | of_univ bounds (t as Abs _) typidx =
haftmann@24155
   353
          typidx
haftmann@25924
   354
          |> of_univ (bounds + 1) (apps t [BVar (bounds, [])])
haftmann@24155
   355
          |-> (fn t' => pair (Term.Abs ("u", dummyT, t')))
haftmann@24155
   356
  in of_univ 0 t 0 |> fst end;
haftmann@24155
   357
haftmann@25101
   358
(* function store *)
haftmann@25101
   359
haftmann@25101
   360
structure Nbe_Functions = CodeDataFun
haftmann@25101
   361
(
haftmann@26064
   362
  type T = (Univ option * int) Graph.T * (int * string Inttab.table);
haftmann@26064
   363
  val empty = (Graph.empty, (0, Inttab.empty));
haftmann@27609
   364
  fun purge thy cs (gr, (maxidx, idx_tab)) =
haftmann@27609
   365
    let
haftmann@27609
   366
      val cs_exisiting =
haftmann@28054
   367
        map_filter (Code_Name.const_rev thy) (Graph.keys gr);
haftmann@27609
   368
      val dels = (Graph.all_preds gr
haftmann@28054
   369
          o map (Code_Name.const thy)
haftmann@27609
   370
          o filter (member (op =) cs_exisiting)
haftmann@27609
   371
        ) cs;
haftmann@27609
   372
    in (Graph.del_nodes dels gr, (maxidx, idx_tab)) end;
haftmann@25101
   373
);
haftmann@25101
   374
haftmann@25101
   375
(* compilation, evaluation and reification *)
haftmann@25101
   376
haftmann@27103
   377
fun compile_eval thy program vs_ty_t deps =
haftmann@26064
   378
  let
wenzelm@28274
   379
    val ctxt = ProofContext.init thy;
wenzelm@28274
   380
    val (gr, (_, idx_tab)) = Nbe_Functions.change thy (ensure_stmts ctxt program);
haftmann@26064
   381
  in
haftmann@26064
   382
    vs_ty_t
wenzelm@28274
   383
    |> eval_term ctxt gr deps
haftmann@26064
   384
    |> term_of_univ thy idx_tab
haftmann@26064
   385
  end;
haftmann@25101
   386
haftmann@24155
   387
(* evaluation with type reconstruction *)
haftmann@24155
   388
haftmann@27103
   389
fun eval thy t program vs_ty_t deps =
haftmann@24155
   390
  let
haftmann@26747
   391
    fun subst_const f = map_aterms (fn t as Term.Const (c, ty) => Term.Const (f c, ty)
haftmann@26747
   392
      | t => t);
haftmann@28054
   393
    val subst_triv_consts = subst_const (Code_Unit.resubst_alias thy);
haftmann@24347
   394
    val ty = type_of t;
haftmann@26739
   395
    val type_free = AList.lookup (op =)
haftmann@26739
   396
      (map (fn (s, T) => (s, Term.Free (s, T))) (Term.add_frees t []));
haftmann@26739
   397
    val type_frees = Term.map_aterms
haftmann@26739
   398
      (fn (t as Term.Free (s, _)) => the_default t (type_free s) | t => t);
wenzelm@27264
   399
    fun type_infer t =
wenzelm@27264
   400
      singleton (TypeInfer.infer_types (Syntax.pp_global thy) (Sign.tsig_of thy) I
wenzelm@27264
   401
        (try (Type.strip_sorts o Sign.the_const_type thy)) (K NONE) Name.context 0)
wenzelm@27264
   402
      (TypeInfer.constrain ty t);
haftmann@24155
   403
    fun check_tvars t = if null (Term.term_tvars t) then t else
haftmann@24155
   404
      error ("Illegal schematic type variables in normalized term: "
wenzelm@26952
   405
        ^ setmp show_types true (Syntax.string_of_term_global thy) t);
wenzelm@26952
   406
    val string_of_term = setmp show_types true (Syntax.string_of_term_global thy);
haftmann@24155
   407
  in
haftmann@27103
   408
    compile_eval thy program vs_ty_t deps
haftmann@25167
   409
    |> tracing (fn t => "Normalized:\n" ^ string_of_term t)
haftmann@26747
   410
    |> subst_triv_consts
haftmann@26739
   411
    |> type_frees
haftmann@25167
   412
    |> tracing (fn t => "Vars typed:\n" ^ string_of_term t)
haftmann@26739
   413
    |> type_infer
haftmann@25167
   414
    |> tracing (fn t => "Types inferred:\n" ^ string_of_term t)
haftmann@26739
   415
    |> check_tvars
haftmann@25101
   416
    |> tracing (fn t => "---\n")
haftmann@24155
   417
  end;
haftmann@24155
   418
haftmann@24155
   419
(* evaluation oracle *)
haftmann@24155
   420
wenzelm@28290
   421
val (_, norm_oracle) = Context.>>> (Context.map_theory_result
wenzelm@28290
   422
  (Thm.add_oracle ("norm", fn (thy, t, program, vs_ty_t, deps) =>
wenzelm@28290
   423
    Thm.cterm_of thy (Logic.mk_equals (t, eval thy t program vs_ty_t deps)))));
haftmann@24155
   424
haftmann@26747
   425
fun add_triv_classes thy =
haftmann@26747
   426
  let
haftmann@26747
   427
    val inters = curry (Sorts.inter_sort (Sign.classes_of thy))
haftmann@28054
   428
      (Code_Unit.triv_classes thy);
haftmann@26747
   429
    fun map_sorts f = (map_types o map_atyps)
haftmann@26747
   430
      (fn TVar (v, sort) => TVar (v, f sort)
haftmann@26747
   431
        | TFree (v, sort) => TFree (v, f sort));
haftmann@26747
   432
  in map_sorts inters end;
haftmann@26747
   433
haftmann@24839
   434
fun norm_conv ct =
haftmann@24155
   435
  let
haftmann@24155
   436
    val thy = Thm.theory_of_cterm ct;
wenzelm@28290
   437
    fun evaluator' t program vs_ty_t deps = norm_oracle (thy, t, program, vs_ty_t, deps);
haftmann@26739
   438
    fun evaluator t = (add_triv_classes thy t, evaluator' t);
haftmann@28054
   439
  in Code_Thingol.eval_conv thy evaluator ct end;
haftmann@24155
   440
haftmann@26739
   441
fun norm_term thy t =
haftmann@24839
   442
  let
haftmann@27103
   443
    fun evaluator' t program vs_ty_t deps = eval thy t program vs_ty_t deps;
haftmann@26739
   444
    fun evaluator t = (add_triv_classes thy t, evaluator' t);
haftmann@28054
   445
  in (Code.postprocess_term thy o Code_Thingol.eval_term thy evaluator) t end;
haftmann@24839
   446
haftmann@24155
   447
(* evaluation command *)
haftmann@24155
   448
haftmann@24155
   449
fun norm_print_term ctxt modes t =
haftmann@24155
   450
  let
haftmann@24155
   451
    val thy = ProofContext.theory_of ctxt;
haftmann@24839
   452
    val t' = norm_term thy t;
haftmann@24839
   453
    val ty' = Term.type_of t';
wenzelm@26952
   454
    val ctxt' = Variable.auto_fixes t ctxt;
wenzelm@24634
   455
    val p = PrintMode.with_modes modes (fn () =>
wenzelm@26952
   456
      Pretty.block [Pretty.quote (Syntax.pretty_term ctxt' t'), Pretty.fbrk,
wenzelm@26952
   457
        Pretty.str "::", Pretty.brk 1, Pretty.quote (Syntax.pretty_typ ctxt' ty')]) ();
haftmann@24155
   458
  in Pretty.writeln p end;
haftmann@24155
   459
haftmann@24155
   460
haftmann@24155
   461
(** Isar setup **)
haftmann@24155
   462
wenzelm@24508
   463
fun norm_print_term_cmd (modes, s) state =
haftmann@24155
   464
  let val ctxt = Toplevel.context_of state
wenzelm@24508
   465
  in norm_print_term ctxt modes (Syntax.read_term ctxt s) end;
haftmann@24155
   466
wenzelm@28290
   467
val setup =
wenzelm@28290
   468
  Value.add_evaluator ("nbe", norm_term o ProofContext.theory_of);
haftmann@24155
   469
haftmann@24155
   470
local structure P = OuterParse and K = OuterKeyword in
haftmann@24155
   471
haftmann@24155
   472
val opt_modes = Scan.optional (P.$$$ "(" |-- P.!!! (Scan.repeat1 P.xname --| P.$$$ ")")) [];
haftmann@24155
   473
wenzelm@24867
   474
val _ =
haftmann@24155
   475
  OuterSyntax.improper_command "normal_form" "normalize term by evaluation" K.diag
haftmann@28227
   476
    (opt_modes -- P.term >> (Toplevel.keep o norm_print_term_cmd));
haftmann@24155
   477
haftmann@24155
   478
end;
haftmann@24155
   479
haftmann@24155
   480
end;
haftmann@28337
   481