src/Tools/nbe.ML
author haftmann
Tue Apr 22 22:00:25 2008 +0200 (2008-04-22)
changeset 26739 947b6013e863
parent 26064 65585de05a66
child 26747 f32fa5f5bdd1
permissions -rw-r--r--
different handling of eq class 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@25924
    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@26739
    26
  val setup: class list -> (string * string) list -> 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@24155
    62
  | BVar of int * Univ list            (*bound named variables*)
haftmann@24155
    63
  | Abs of (int * (Univ list -> Univ)) * Univ list
haftmann@24381
    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@25924
    70
      if k = 0 then f (ys @ xs)
haftmann@25924
    71
      else if k < 0 then
haftmann@25924
    72
        let val (zs, ws) = chop (~ k) ys
haftmann@25924
    73
        in apps (f (ws @ xs)) zs end
haftmann@25924
    74
      else Abs ((k, f), ys @ xs) end (*note: reverse convention also for apps!*)
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@25924
    77
  | apps (BVar (name, xs)) ys = BVar (name, 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@24155
    93
haftmann@24155
    94
fun ml_list es = "[" ^ commas es ^ "]";
haftmann@24155
    95
haftmann@24155
    96
fun ml_fundefs ([(name, [([], e)])]) =
haftmann@24155
    97
      "val " ^ name ^ " = " ^ e ^ "\n"
haftmann@24155
    98
  | ml_fundefs (eqs :: eqss) =
haftmann@24155
    99
      let
haftmann@24155
   100
        fun fundef (name, eqs) =
haftmann@24155
   101
          let
haftmann@24155
   102
            fun eqn (es, e) = name ^ " " ^ space_implode " " es ^ " = " ^ e
haftmann@24155
   103
          in space_implode "\n  | " (map eqn eqs) end;
haftmann@24155
   104
      in
haftmann@24155
   105
        (prefix "fun " o fundef) eqs :: map (prefix "and " o fundef) eqss
haftmann@24155
   106
        |> space_implode "\n"
haftmann@24155
   107
        |> suffix "\n"
haftmann@24155
   108
      end;
haftmann@24155
   109
haftmann@25944
   110
(* nbe specific syntax and sandbox communication *)
haftmann@25944
   111
haftmann@25944
   112
val univs_ref = ref (NONE : (unit -> Univ list -> Univ list) option);
haftmann@24155
   113
haftmann@24155
   114
local
haftmann@24155
   115
  val prefix =          "Nbe.";
haftmann@25944
   116
  val name_ref =        prefix ^ "univs_ref";
haftmann@24155
   117
  val name_const =      prefix ^ "Const";
haftmann@25944
   118
  val name_abss =       prefix ^ "abss";
haftmann@25924
   119
  val name_apps =       prefix ^ "apps";
haftmann@24155
   120
in
haftmann@24155
   121
haftmann@25944
   122
val univs_cookie = (name_ref, univs_ref);
haftmann@25944
   123
haftmann@25935
   124
fun nbe_fun "" = "nbe_value"
haftmann@25935
   125
  | nbe_fun c = "c_" ^ translate_string (fn "." => "_" | c => c) c;
haftmann@25101
   126
fun nbe_dict v n = "d_" ^ v ^ "_" ^ string_of_int n;
haftmann@24155
   127
fun nbe_bound v = "v_" ^ v;
haftmann@24155
   128
haftmann@25924
   129
(*note: these three are the "turning spots" where proper argument order is established!*)
haftmann@25924
   130
fun nbe_apps t [] = t
haftmann@25924
   131
  | nbe_apps t ts = name_apps `$$` [t, ml_list (rev ts)];
haftmann@25924
   132
fun nbe_apps_local c ts = nbe_fun c `$` ml_list (rev ts);
haftmann@26064
   133
fun nbe_apps_constr idx ts =
haftmann@26064
   134
  name_const `$` ("(" ^ string_of_int idx ^ ", " ^ ml_list (rev ts) ^ ")");
haftmann@25924
   135
haftmann@24155
   136
fun nbe_abss 0 f = f `$` ml_list []
haftmann@25944
   137
  | nbe_abss n f = name_abss `$$` [string_of_int n, f];
haftmann@24155
   138
haftmann@24155
   139
end;
haftmann@24155
   140
haftmann@24219
   141
open BasicCodeThingol;
haftmann@24155
   142
haftmann@25865
   143
(* code generation *)
haftmann@24155
   144
haftmann@26064
   145
fun assemble_eqnss idx_of deps eqnss =
haftmann@25944
   146
  let
haftmann@25944
   147
    fun prep_eqns (c, (vs, eqns)) =
haftmann@25924
   148
      let
haftmann@25944
   149
        val dicts = maps (fn (v, sort) => map_index (nbe_dict v o fst) sort) vs;
haftmann@25944
   150
        val num_args = length dicts + (length o fst o hd) eqns;
haftmann@25944
   151
      in (c, (num_args, (dicts, eqns))) end;
haftmann@25944
   152
    val eqnss' = map prep_eqns eqnss;
haftmann@25944
   153
haftmann@25944
   154
    fun assemble_constapp c dss ts = 
haftmann@25944
   155
      let
haftmann@25944
   156
        val ts' = (maps o map) assemble_idict dss @ ts;
haftmann@25944
   157
      in case AList.lookup (op =) eqnss' c
haftmann@25944
   158
       of SOME (n, _) => if n <= length ts'
haftmann@25924
   159
            then let val (ts1, ts2) = chop n ts'
haftmann@25924
   160
            in nbe_apps (nbe_apps_local c ts1) ts2
haftmann@25924
   161
            end else nbe_apps (nbe_abss n (nbe_fun c)) ts'
haftmann@25944
   162
        | NONE => if member (op =) deps c
haftmann@25944
   163
            then nbe_apps (nbe_fun c) ts'
haftmann@26064
   164
            else nbe_apps_constr (idx_of c) ts'
haftmann@25924
   165
      end
haftmann@25944
   166
    and assemble_idict (DictConst (inst, dss)) =
haftmann@25944
   167
          assemble_constapp inst dss []
haftmann@25944
   168
      | assemble_idict (DictVar (supers, (v, (n, _)))) =
haftmann@25944
   169
          fold_rev (fn super => assemble_constapp super [] o single) supers (nbe_dict v n);
haftmann@25924
   170
haftmann@25944
   171
    fun assemble_iterm constapp =
haftmann@24155
   172
      let
haftmann@25944
   173
        fun of_iterm t =
haftmann@25944
   174
          let
haftmann@25944
   175
            val (t', ts) = CodeThingol.unfold_app t
haftmann@25944
   176
          in of_iapp t' (fold_rev (cons o of_iterm) ts []) end
haftmann@25944
   177
        and of_iapp (IConst (c, (dss, _))) ts = constapp c dss ts
haftmann@25944
   178
          | of_iapp (IVar v) ts = nbe_apps (nbe_bound v) ts
haftmann@25944
   179
          | of_iapp ((v, _) `|-> t) ts =
haftmann@25944
   180
              nbe_apps (nbe_abss 1 (ml_abs (ml_list [nbe_bound v]) (of_iterm t))) ts
haftmann@25944
   181
          | of_iapp (ICase (((t, _), cs), t0)) ts =
haftmann@25944
   182
              nbe_apps (ml_cases (of_iterm t) (map (pairself of_iterm) cs
haftmann@25944
   183
                @ [("_", of_iterm t0)])) ts
haftmann@25944
   184
      in of_iterm end;
haftmann@24155
   185
haftmann@25944
   186
    fun assemble_eqns (c, (num_args, (dicts, eqns))) =
haftmann@25944
   187
      let
haftmann@26064
   188
        val assemble_arg = assemble_iterm
haftmann@26064
   189
          (fn c => fn _ => fn ts => nbe_apps_constr (idx_of c) ts);
haftmann@25944
   190
        val assemble_rhs = assemble_iterm assemble_constapp;
haftmann@25944
   191
        fun assemble_eqn (args, rhs) =
haftmann@25944
   192
          ([ml_list (rev (dicts @ map assemble_arg args))], assemble_rhs rhs);
haftmann@25944
   193
        val default_args = map nbe_bound (Name.invent_list [] "a" num_args);
haftmann@26064
   194
        val default_eqn = if c = "" then NONE
haftmann@26064
   195
          else SOME ([ml_list (rev default_args)],
haftmann@26064
   196
            nbe_apps_constr (idx_of c) default_args);
haftmann@25944
   197
      in
haftmann@26064
   198
        ((nbe_fun c, map assemble_eqn eqns @ the_list default_eqn),
haftmann@25944
   199
          nbe_abss num_args (nbe_fun c))
haftmann@25944
   200
      end;
haftmann@24155
   201
haftmann@25944
   202
    val (fun_vars, fun_vals) = map_split assemble_eqns eqnss';
haftmann@25944
   203
    val deps_vars = ml_list (map nbe_fun deps);
haftmann@25944
   204
  in ml_abs deps_vars (ml_Let (ml_fundefs fun_vars) (ml_list fun_vals)) end;
haftmann@25944
   205
haftmann@25944
   206
(* code compilation *)
haftmann@25944
   207
haftmann@25944
   208
fun compile_eqnss gr raw_deps [] = []
haftmann@25944
   209
  | compile_eqnss gr raw_deps eqnss = 
haftmann@24155
   210
      let
haftmann@26064
   211
        val (deps, deps_vals) = split_list (map_filter
haftmann@26064
   212
          (fn dep => Option.map (fn univ => (dep, univ)) (fst ((Graph.get_node gr dep)))) raw_deps);
haftmann@26064
   213
        val idx_of = raw_deps
haftmann@26064
   214
          |> map (fn dep => (dep, snd (Graph.get_node gr dep)))
haftmann@26064
   215
          |> AList.lookup (op =)
haftmann@26064
   216
          |> (fn f => the o f);
haftmann@26064
   217
        val s = assemble_eqnss idx_of deps eqnss;
haftmann@24155
   218
        val cs = map fst eqnss;
haftmann@25944
   219
      in
haftmann@25944
   220
        s
haftmann@25944
   221
        |> tracing (fn s => "\n--- code to be evaluated:\n" ^ s)
haftmann@25944
   222
        |> ML_Context.evaluate
haftmann@25944
   223
            (Output.tracing o enclose "\n---compiler echo:\n" "\n---\n",
haftmann@25944
   224
            Output.tracing o enclose "\n--- compiler echo (with error):\n" "\n---\n")
haftmann@25944
   225
            (!trace) univs_cookie
haftmann@25944
   226
        |> (fn f => f deps_vals)
haftmann@25944
   227
        |> (fn univs => cs ~~ univs)
haftmann@25944
   228
      end;
haftmann@25190
   229
haftmann@25944
   230
(* preparing function equations *)
haftmann@24155
   231
haftmann@25101
   232
fun eqns_of_stmt (_, CodeThingol.Fun (_, [])) =
haftmann@25101
   233
      []
haftmann@25101
   234
  | eqns_of_stmt (const, CodeThingol.Fun ((vs, _), eqns)) =
haftmann@25101
   235
      [(const, (vs, map fst eqns))]
haftmann@25101
   236
  | eqns_of_stmt (_, CodeThingol.Datatypecons _) =
haftmann@25101
   237
      []
haftmann@25101
   238
  | eqns_of_stmt (_, CodeThingol.Datatype _) =
haftmann@25101
   239
      []
haftmann@25101
   240
  | eqns_of_stmt (class, CodeThingol.Class (v, (superclasses, classops))) =
haftmann@25101
   241
      let
haftmann@25101
   242
        val names = map snd superclasses @ map fst classops;
haftmann@25101
   243
        val params = Name.invent_list [] "d" (length names);
haftmann@25101
   244
        fun mk (k, name) =
haftmann@25101
   245
          (name, ([(v, [])],
haftmann@25101
   246
            [([IConst (class, ([], [])) `$$ map IVar params], IVar (nth params k))]));
haftmann@25101
   247
      in map_index mk names end
haftmann@25101
   248
  | eqns_of_stmt (_, CodeThingol.Classrel _) =
haftmann@25101
   249
      []
haftmann@25101
   250
  | eqns_of_stmt (_, CodeThingol.Classparam _) =
haftmann@25101
   251
      []
haftmann@25101
   252
  | eqns_of_stmt (inst, CodeThingol.Classinst ((class, (_, arities)), (superinsts, instops))) =
haftmann@25101
   253
      [(inst, (arities, [([], IConst (class, ([], [])) `$$
haftmann@25101
   254
        map (fn (_, (_, (inst, dicts))) => IConst (inst, (dicts, []))) superinsts
haftmann@25101
   255
        @ map (IConst o snd o fst) instops)]))];
haftmann@24155
   256
haftmann@25101
   257
fun compile_stmts stmts_deps =
haftmann@25101
   258
  let
haftmann@25101
   259
    val names = map (fst o fst) stmts_deps;
haftmann@25101
   260
    val names_deps = map (fn ((name, _), deps) => (name, deps)) stmts_deps;
haftmann@25101
   261
    val eqnss = maps (eqns_of_stmt o fst) stmts_deps;
haftmann@26064
   262
    val refl_deps = names_deps
haftmann@25190
   263
      |> maps snd
haftmann@25190
   264
      |> distinct (op =)
haftmann@26064
   265
      |> fold (insert (op =)) names;
haftmann@26064
   266
    fun new_node name (gr, (maxidx, idx_tab)) = if can (Graph.get_node gr) name
haftmann@26064
   267
      then (gr, (maxidx, idx_tab))
haftmann@26064
   268
      else (Graph.new_node (name, (NONE, maxidx)) gr,
haftmann@26064
   269
        (maxidx + 1, Inttab.update_new (maxidx, name) idx_tab));
haftmann@25190
   270
    fun compile gr = eqnss
haftmann@26064
   271
      |> compile_eqnss gr refl_deps
haftmann@25190
   272
      |> rpair gr;
haftmann@25101
   273
  in
haftmann@26064
   274
    fold new_node refl_deps
haftmann@26064
   275
    #> apfst (fold (fn (name, deps) => fold (curry Graph.add_edge name) deps) names_deps
haftmann@26064
   276
      #> compile
haftmann@26064
   277
      #-> fold (fn (name, univ) => (Graph.map_node name o apfst) (K (SOME univ))))
haftmann@25101
   278
  end;
haftmann@24155
   279
haftmann@25101
   280
fun ensure_stmts code =
haftmann@25101
   281
  let
haftmann@26064
   282
    fun add_stmts names (gr, (maxidx, idx_tab)) = if exists ((can o Graph.get_node) gr) names
haftmann@26064
   283
      then (gr, (maxidx, idx_tab))
haftmann@26064
   284
      else (gr, (maxidx, idx_tab))
haftmann@26064
   285
        |> compile_stmts (map (fn name => ((name, Graph.get_node code name),
haftmann@25101
   286
          Graph.imm_succs code name)) names);
haftmann@25101
   287
  in fold_rev add_stmts (Graph.strong_conn code) end;
haftmann@24155
   288
haftmann@25944
   289
haftmann@25944
   290
(** evaluation **)
haftmann@25944
   291
haftmann@25944
   292
(* term evaluation *)
haftmann@25944
   293
haftmann@25924
   294
fun eval_term gr deps ((vs, ty), t) =
haftmann@25924
   295
  let 
haftmann@25924
   296
    val frees = CodeThingol.fold_unbound_varnames (insert (op =)) t []
haftmann@25924
   297
    val frees' = map (fn v => Free (v, [])) frees;
haftmann@25924
   298
    val dict_frees = maps (fn (v, sort) => map_index (curry DFree v o fst) sort) vs;
haftmann@25924
   299
  in
haftmann@25935
   300
    ("", (vs, [(map IVar frees, t)]))
haftmann@25924
   301
    |> singleton (compile_eqnss gr deps)
haftmann@25924
   302
    |> snd
haftmann@25924
   303
    |> (fn t => apps t (rev (dict_frees @ frees')))
haftmann@25924
   304
  end;
haftmann@24155
   305
haftmann@24839
   306
(* reification *)
haftmann@24155
   307
haftmann@26064
   308
fun term_of_univ thy idx_tab t =
haftmann@24155
   309
  let
haftmann@25101
   310
    fun take_until f [] = []
haftmann@25101
   311
      | take_until f (x::xs) = if f x then [] else x :: take_until f xs;
haftmann@26064
   312
    fun is_dict (Const (idx, _)) =
haftmann@26064
   313
          let
haftmann@26064
   314
            val c = the (Inttab.lookup idx_tab idx);
haftmann@26064
   315
          in
haftmann@26064
   316
            (is_some o CodeName.class_rev thy) c
haftmann@26064
   317
            orelse (is_some o CodeName.classrel_rev thy) c
haftmann@26064
   318
            orelse (is_some o CodeName.instance_rev thy) c
haftmann@26064
   319
          end
haftmann@25101
   320
      | is_dict (DFree _) = true
haftmann@25101
   321
      | is_dict _ = false;
haftmann@24155
   322
    fun of_apps bounds (t, ts) =
haftmann@24155
   323
      fold_map (of_univ bounds) ts
haftmann@24155
   324
      #>> (fn ts' => list_comb (t, rev ts'))
haftmann@26064
   325
    and of_univ bounds (Const (idx, ts)) typidx =
haftmann@24155
   326
          let
haftmann@25101
   327
            val ts' = take_until is_dict ts;
haftmann@26064
   328
            val c = (the o CodeName.const_rev thy o the o Inttab.lookup idx_tab) idx;
haftmann@24423
   329
            val T = Code.default_typ thy c;
haftmann@26739
   330
            val T' = map_type_tvar (fn ((v, i), S) => TypeInfer.param (typidx + i) (v, [])) T;
haftmann@24155
   331
            val typidx' = typidx + maxidx_of_typ T' + 1;
haftmann@25101
   332
          in of_apps bounds (Term.Const (c, T'), ts') typidx' end
haftmann@24155
   333
      | of_univ bounds (Free (name, ts)) typidx =
haftmann@24155
   334
          of_apps bounds (Term.Free (name, dummyT), ts) typidx
haftmann@24155
   335
      | of_univ bounds (BVar (name, ts)) typidx =
haftmann@24155
   336
          of_apps bounds (Bound (bounds - name - 1), ts) typidx
haftmann@24155
   337
      | of_univ bounds (t as Abs _) typidx =
haftmann@24155
   338
          typidx
haftmann@25924
   339
          |> of_univ (bounds + 1) (apps t [BVar (bounds, [])])
haftmann@24155
   340
          |-> (fn t' => pair (Term.Abs ("u", dummyT, t')))
haftmann@24155
   341
  in of_univ 0 t 0 |> fst end;
haftmann@24155
   342
haftmann@25101
   343
(* function store *)
haftmann@25101
   344
haftmann@25101
   345
structure Nbe_Functions = CodeDataFun
haftmann@25101
   346
(
haftmann@26064
   347
  type T = (Univ option * int) Graph.T * (int * string Inttab.table);
haftmann@26064
   348
  val empty = (Graph.empty, (0, Inttab.empty));
haftmann@26064
   349
  fun merge _ ((gr1, (maxidx1, idx_tab1)), (gr2, (maxidx2, idx_tab2))) =
haftmann@26064
   350
    (Graph.merge (K true) (gr1, gr2), (IntInf.max (maxidx1, maxidx2),
haftmann@26064
   351
      Inttab.merge (K true) (idx_tab1, idx_tab2)));
haftmann@26064
   352
  fun purge _ NONE _ = empty
haftmann@26064
   353
    | purge NONE _ _ = empty
haftmann@26064
   354
    | purge (SOME thy) (SOME cs) (gr, (maxidx, idx_tab)) =
haftmann@25101
   355
        let
haftmann@25101
   356
          val cs_exisiting =
haftmann@25101
   357
            map_filter (CodeName.const_rev thy) (Graph.keys gr);
haftmann@25101
   358
          val dels = (Graph.all_preds gr
haftmann@25101
   359
              o map (CodeName.const thy)
haftmann@25101
   360
              o filter (member (op =) cs_exisiting)
haftmann@25101
   361
            ) cs;
haftmann@26064
   362
        in (Graph.del_nodes dels gr, (maxidx, idx_tab)) end;
haftmann@25101
   363
);
haftmann@25101
   364
haftmann@25101
   365
(* compilation, evaluation and reification *)
haftmann@25101
   366
haftmann@25101
   367
fun compile_eval thy code vs_ty_t deps =
haftmann@26064
   368
  let
haftmann@26064
   369
    val (gr, (_, idx_tab)) = Nbe_Functions.change thy (ensure_stmts code);
haftmann@26064
   370
  in
haftmann@26064
   371
    vs_ty_t
haftmann@26064
   372
    |> eval_term gr deps
haftmann@26064
   373
    |> term_of_univ thy idx_tab
haftmann@26064
   374
  end;
haftmann@25101
   375
haftmann@26739
   376
(* trivial type classes *)
haftmann@26739
   377
haftmann@26739
   378
structure Nbe_Triv_Classes = TheoryDataFun
haftmann@26739
   379
(
haftmann@26739
   380
  type T = class list * (string * string) list;
haftmann@26739
   381
  val empty = ([], []);
haftmann@26739
   382
  val copy = I;
haftmann@26739
   383
  val extend = I;
haftmann@26739
   384
  fun merge _ ((classes1, consts1), (classes2, consts2)) =
haftmann@26739
   385
    (Library.merge (op =) (classes1, classes2), Library.merge (op =) (consts1, consts2));
haftmann@26739
   386
)
haftmann@26739
   387
haftmann@26739
   388
fun add_triv_classes thy =
haftmann@26739
   389
  let
haftmann@26739
   390
    val (trivs, _) = Nbe_Triv_Classes.get thy;
haftmann@26739
   391
    val inters = curry (Sorts.inter_sort (Sign.classes_of thy)) trivs;
haftmann@26739
   392
    fun map_sorts f = (map_types o map_atyps)
haftmann@26739
   393
      (fn TVar (v, sort) => TVar (v, f sort)
haftmann@26739
   394
        | TFree (v, sort) => TFree (v, f sort));
haftmann@26739
   395
  in map_sorts inters end;
haftmann@26739
   396
haftmann@26739
   397
fun subst_triv_consts thy =
haftmann@26739
   398
  let
haftmann@26739
   399
    fun subst_const f = map_aterms (fn t as Term.Const (c, ty) => (case f c
haftmann@26739
   400
         of SOME c' => Term.Const (c', ty)
haftmann@26739
   401
          | NONE => t)
haftmann@26739
   402
      | t => t);
haftmann@26739
   403
    val (_, consts) = Nbe_Triv_Classes.get thy;
haftmann@26739
   404
    val subst_inst = perhaps (Option.map fst o AxClass.inst_of_param thy);
haftmann@26739
   405
  in map_aterms (subst_const (AList.lookup (op =) consts o subst_inst)) end;
haftmann@26739
   406
haftmann@24155
   407
(* evaluation with type reconstruction *)
haftmann@24155
   408
haftmann@26739
   409
fun eval thy t code vs_ty_t deps =
haftmann@24155
   410
  let
haftmann@24347
   411
    val ty = type_of t;
haftmann@26739
   412
    val type_free = AList.lookup (op =)
haftmann@26739
   413
      (map (fn (s, T) => (s, Term.Free (s, T))) (Term.add_frees t []));
haftmann@26739
   414
    val type_frees = Term.map_aterms
haftmann@26739
   415
      (fn (t as Term.Free (s, _)) => the_default t (type_free s) | t => t);
haftmann@26739
   416
    fun type_infer t = [(t, ty)]
haftmann@26739
   417
      |> TypeInfer.infer_types (Sign.pp thy) (Sign.tsig_of thy) I
haftmann@26739
   418
           (try (Type.strip_sorts o Sign.the_const_type thy)) (K NONE)
haftmann@26739
   419
           Name.context 0 NONE
haftmann@26739
   420
      |> fst |> the_single |> fst;
haftmann@24155
   421
    fun check_tvars t = if null (Term.term_tvars t) then t else
haftmann@24155
   422
      error ("Illegal schematic type variables in normalized term: "
haftmann@24155
   423
        ^ setmp show_types true (Sign.string_of_term thy) t);
haftmann@25167
   424
    val string_of_term = setmp show_types true (Sign.string_of_term thy);
haftmann@24155
   425
  in
haftmann@25101
   426
    compile_eval thy code vs_ty_t deps
haftmann@25167
   427
    |> tracing (fn t => "Normalized:\n" ^ string_of_term t)
haftmann@26739
   428
    |> subst_triv_consts thy
haftmann@26739
   429
    |> type_frees
haftmann@25167
   430
    |> tracing (fn t => "Vars typed:\n" ^ string_of_term t)
haftmann@26739
   431
    |> type_infer
haftmann@25167
   432
    |> tracing (fn t => "Types inferred:\n" ^ string_of_term t)
haftmann@26739
   433
    |> check_tvars
haftmann@25101
   434
    |> tracing (fn t => "---\n")
haftmann@24155
   435
  end;
haftmann@24155
   436
haftmann@24155
   437
(* evaluation oracle *)
haftmann@24155
   438
haftmann@26739
   439
exception Norm of term * CodeThingol.code
haftmann@24381
   440
  * (CodeThingol.typscheme * CodeThingol.iterm) * string list;
haftmann@24155
   441
haftmann@26739
   442
fun norm_oracle (thy, Norm (t, code, vs_ty_t, deps)) =
haftmann@26739
   443
  Logic.mk_equals (t, eval thy t code vs_ty_t deps);
haftmann@24155
   444
haftmann@26739
   445
fun norm_invoke thy t code vs_ty_t deps =
haftmann@26739
   446
  Thm.invoke_oracle_i thy "HOL.norm" (thy, Norm (t, code, vs_ty_t, deps));
haftmann@24283
   447
  (*FIXME get rid of hardwired theory name*)
haftmann@24155
   448
haftmann@24839
   449
fun norm_conv ct =
haftmann@24155
   450
  let
haftmann@24155
   451
    val thy = Thm.theory_of_cterm ct;
haftmann@26739
   452
    fun evaluator' t code vs_ty_t deps = norm_invoke thy t code vs_ty_t deps;
haftmann@26739
   453
    fun evaluator t = (add_triv_classes thy t, evaluator' t);
haftmann@26739
   454
  in CodePackage.evaluate_conv thy evaluator ct end;
haftmann@24155
   455
haftmann@26739
   456
fun norm_term thy t =
haftmann@24839
   457
  let
haftmann@26739
   458
    fun evaluator' t code vs_ty_t deps = eval thy t code vs_ty_t deps;
haftmann@26739
   459
    fun evaluator t = (add_triv_classes thy t, evaluator' t);
haftmann@26739
   460
  in (Code.postprocess_term thy o CodePackage.evaluate_term thy evaluator) t end;
haftmann@24839
   461
haftmann@24155
   462
(* evaluation command *)
haftmann@24155
   463
haftmann@24155
   464
fun norm_print_term ctxt modes t =
haftmann@24155
   465
  let
haftmann@24155
   466
    val thy = ProofContext.theory_of ctxt;
haftmann@24839
   467
    val t' = norm_term thy t;
haftmann@24839
   468
    val ty' = Term.type_of t';
wenzelm@24634
   469
    val p = PrintMode.with_modes modes (fn () =>
wenzelm@24920
   470
      Pretty.block [Pretty.quote (Syntax.pretty_term ctxt t'), Pretty.fbrk,
wenzelm@24920
   471
        Pretty.str "::", Pretty.brk 1, Pretty.quote (Syntax.pretty_typ ctxt ty')]) ();
haftmann@24155
   472
  in Pretty.writeln p end;
haftmann@24155
   473
haftmann@24155
   474
haftmann@24155
   475
(** Isar setup **)
haftmann@24155
   476
wenzelm@24508
   477
fun norm_print_term_cmd (modes, s) state =
haftmann@24155
   478
  let val ctxt = Toplevel.context_of state
wenzelm@24508
   479
  in norm_print_term ctxt modes (Syntax.read_term ctxt s) end;
haftmann@24155
   480
haftmann@26739
   481
fun setup nbe_classes nbe_consts =
haftmann@26739
   482
  Theory.add_oracle ("norm", norm_oracle)
haftmann@26739
   483
  #> Nbe_Triv_Classes.map (K (nbe_classes, nbe_consts));
haftmann@24155
   484
haftmann@24155
   485
local structure P = OuterParse and K = OuterKeyword in
haftmann@24155
   486
haftmann@24155
   487
val opt_modes = Scan.optional (P.$$$ "(" |-- P.!!! (Scan.repeat1 P.xname --| P.$$$ ")")) [];
haftmann@24155
   488
wenzelm@24867
   489
val _ =
haftmann@24155
   490
  OuterSyntax.improper_command "normal_form" "normalize term by evaluation" K.diag
haftmann@24155
   491
    (opt_modes -- P.typ >> (Toplevel.keep o norm_print_term_cmd));
haftmann@24155
   492
haftmann@24155
   493
end;
haftmann@24155
   494
haftmann@24155
   495
end;