src/Tools/nbe.ML
author wenzelm
Wed Dec 31 18:53:17 2008 +0100 (2008-12-31)
changeset 29272 fb3ccf499df5
parent 28706 3fef773ae6b1
child 30022 1d8b8fa19074
permissions -rw-r--r--
use regular Term.add_XXX etc.;
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@25101
     9
  val norm_conv: cterm -> thm
haftmann@25101
    10
  val norm_term: theory -> term -> term
haftmann@25101
    11
wenzelm@25204
    12
  datatype Univ =
haftmann@26064
    13
      Const of int * Univ list               (*named (uninterpreted) constants*)
haftmann@25924
    14
    | Free of string * Univ list             (*free (uninterpreted) variables*)
haftmann@25924
    15
    | DFree of string * int                  (*free (uninterpreted) dictionary parameters*)
haftmann@24155
    16
    | BVar of int * Univ list
haftmann@28350
    17
    | Abs of (int * (Univ list -> Univ)) * Univ list
haftmann@25924
    18
  val apps: Univ -> Univ list -> Univ        (*explicit applications*)
haftmann@25944
    19
  val abss: int -> (Univ list -> Univ) -> Univ
haftmann@28337
    20
                                             (*abstractions as closures*)
haftmann@28350
    21
  val same: Univ -> Univ -> bool
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@28350
    66
fun same (Const (k, xs)) (Const (l, ys)) = k = l andalso sames xs ys
haftmann@28350
    67
  | same (Free (s, xs)) (Free (t, ys)) = s = t andalso sames xs ys
haftmann@28350
    68
  | same (DFree (s, k)) (DFree (t, l)) = s = t andalso k = l
haftmann@28350
    69
  | same (BVar (k, xs)) (BVar (l, ys)) = k = l andalso sames xs ys
haftmann@28350
    70
  | same _ _ = false
haftmann@28350
    71
and sames xs ys = length xs = length ys andalso forall (uncurry same) (xs ~~ ys);
haftmann@28350
    72
haftmann@24155
    73
(* constructor functions *)
haftmann@24155
    74
haftmann@25944
    75
fun abss n f = Abs ((n, f), []);
haftmann@25924
    76
fun apps (Abs ((n, f), xs)) ys = let val k = n - length ys in
haftmann@27499
    77
      case int_ord (k, 0)
haftmann@27499
    78
       of EQUAL => f (ys @ xs)
haftmann@27499
    79
        | LESS => let val (zs, ws) = chop (~ k) ys in apps (f (ws @ xs)) zs end
haftmann@27499
    80
        | GREATER => Abs ((k, f), ys @ xs) (*note: reverse convention also for apps!*)
haftmann@27499
    81
      end
haftmann@25924
    82
  | apps (Const (name, xs)) ys = Const (name, ys @ xs)
haftmann@25924
    83
  | apps (Free (name, xs)) ys = Free (name, ys @ xs)
haftmann@27499
    84
  | apps (BVar (n, xs)) ys = BVar (n, ys @ xs);
haftmann@24155
    85
haftmann@24155
    86
haftmann@24155
    87
(** assembling and compiling ML code from terms **)
haftmann@24155
    88
haftmann@24155
    89
(* abstract ML syntax *)
haftmann@24155
    90
haftmann@24155
    91
infix 9 `$` `$$`;
haftmann@24155
    92
fun e1 `$` e2 = "(" ^ e1 ^ " " ^ e2 ^ ")";
haftmann@25101
    93
fun e `$$` [] = e
haftmann@25101
    94
  | e `$$` es = "(" ^ e ^ " " ^ space_implode " " es ^ ")";
haftmann@24590
    95
fun ml_abs v e = "(fn " ^ v ^ " => " ^ e ^ ")";
haftmann@24155
    96
haftmann@24155
    97
fun ml_cases t cs =
haftmann@24155
    98
  "(case " ^ t ^ " of " ^ space_implode " | " (map (fn (p, t) => p ^ " => " ^ t) cs) ^ ")";
haftmann@25944
    99
fun ml_Let d e = "let\n" ^ d ^ " in " ^ e ^ " end";
haftmann@28337
   100
fun ml_as v t = "(" ^ v ^ " as " ^ t ^ ")";
haftmann@24155
   101
haftmann@28350
   102
fun ml_and [] = "true"
haftmann@28350
   103
  | ml_and [x] = x
haftmann@28350
   104
  | ml_and xs = "(" ^ space_implode " andalso " xs ^ ")";
haftmann@28350
   105
fun ml_if b x y = "(if " ^ b ^ " then " ^ x ^ " else " ^ y ^ ")";
haftmann@28350
   106
haftmann@24155
   107
fun ml_list es = "[" ^ commas es ^ "]";
haftmann@24155
   108
haftmann@24155
   109
fun ml_fundefs ([(name, [([], e)])]) =
haftmann@24155
   110
      "val " ^ name ^ " = " ^ e ^ "\n"
haftmann@24155
   111
  | ml_fundefs (eqs :: eqss) =
haftmann@24155
   112
      let
haftmann@24155
   113
        fun fundef (name, eqs) =
haftmann@24155
   114
          let
haftmann@24155
   115
            fun eqn (es, e) = name ^ " " ^ space_implode " " es ^ " = " ^ e
haftmann@24155
   116
          in space_implode "\n  | " (map eqn eqs) end;
haftmann@24155
   117
      in
haftmann@24155
   118
        (prefix "fun " o fundef) eqs :: map (prefix "and " o fundef) eqss
wenzelm@26931
   119
        |> cat_lines
haftmann@24155
   120
        |> suffix "\n"
haftmann@24155
   121
      end;
haftmann@24155
   122
haftmann@25944
   123
(* nbe specific syntax and sandbox communication *)
haftmann@25944
   124
haftmann@25944
   125
val univs_ref = ref (NONE : (unit -> Univ list -> Univ list) option);
haftmann@24155
   126
haftmann@24155
   127
local
haftmann@28350
   128
  val prefix =      "Nbe.";
haftmann@28350
   129
  val name_ref =    prefix ^ "univs_ref";
haftmann@28350
   130
  val name_const =  prefix ^ "Const";
haftmann@28350
   131
  val name_abss =   prefix ^ "abss";
haftmann@28350
   132
  val name_apps =   prefix ^ "apps";
haftmann@28350
   133
  val name_same =   prefix ^ "same";
haftmann@24155
   134
in
haftmann@24155
   135
haftmann@25944
   136
val univs_cookie = (name_ref, univs_ref);
haftmann@25944
   137
haftmann@28337
   138
fun nbe_fun 0 "" = "nbe_value"
haftmann@28337
   139
  | nbe_fun i c = "c_" ^ translate_string (fn "." => "_" | c => c) c ^ "_" ^ string_of_int i;
haftmann@25101
   140
fun nbe_dict v n = "d_" ^ v ^ "_" ^ string_of_int n;
haftmann@24155
   141
fun nbe_bound v = "v_" ^ v;
haftmann@28337
   142
fun nbe_default v = "w_" ^ v;
haftmann@24155
   143
haftmann@25924
   144
(*note: these three are the "turning spots" where proper argument order is established!*)
haftmann@25924
   145
fun nbe_apps t [] = t
haftmann@25924
   146
  | nbe_apps t ts = name_apps `$$` [t, ml_list (rev ts)];
haftmann@28337
   147
fun nbe_apps_local i c ts = nbe_fun i c `$` ml_list (rev ts);
haftmann@28337
   148
fun nbe_apps_constr idx_of c ts =
haftmann@28337
   149
  let
haftmann@28337
   150
    val c' = if !trace then string_of_int (idx_of c) ^ " (*" ^ c ^ "*)"
haftmann@28337
   151
      else string_of_int (idx_of c);
haftmann@28337
   152
  in name_const `$` ("(" ^ c' ^ ", " ^ ml_list (rev ts) ^ ")") end;
haftmann@25924
   153
haftmann@24155
   154
fun nbe_abss 0 f = f `$` ml_list []
haftmann@25944
   155
  | nbe_abss n f = name_abss `$$` [string_of_int n, f];
haftmann@24155
   156
haftmann@28350
   157
fun nbe_same v1 v2 = "(" ^ name_same ^ " " ^ nbe_bound v1 ^ " " ^ nbe_bound v2 ^ ")";
haftmann@28350
   158
haftmann@24155
   159
end;
haftmann@24155
   160
haftmann@28054
   161
open Basic_Code_Thingol;
haftmann@24155
   162
haftmann@25865
   163
(* code generation *)
haftmann@24155
   164
haftmann@26064
   165
fun assemble_eqnss idx_of deps eqnss =
haftmann@25944
   166
  let
haftmann@25944
   167
    fun prep_eqns (c, (vs, eqns)) =
haftmann@25924
   168
      let
haftmann@25944
   169
        val dicts = maps (fn (v, sort) => map_index (nbe_dict v o fst) sort) vs;
haftmann@28337
   170
        val num_args = length dicts + ((length o fst o hd) eqns);
haftmann@25944
   171
      in (c, (num_args, (dicts, eqns))) end;
haftmann@25944
   172
    val eqnss' = map prep_eqns eqnss;
haftmann@25944
   173
haftmann@25944
   174
    fun assemble_constapp c dss ts = 
haftmann@25944
   175
      let
haftmann@25944
   176
        val ts' = (maps o map) assemble_idict dss @ ts;
haftmann@25944
   177
      in case AList.lookup (op =) eqnss' c
haftmann@28337
   178
       of SOME (num_args, _) => if num_args <= length ts'
haftmann@28337
   179
            then let val (ts1, ts2) = chop num_args ts'
haftmann@28337
   180
            in nbe_apps (nbe_apps_local 0 c ts1) ts2
haftmann@28337
   181
            end else nbe_apps (nbe_abss num_args (nbe_fun 0 c)) ts'
haftmann@25944
   182
        | NONE => if member (op =) deps c
haftmann@28337
   183
            then nbe_apps (nbe_fun 0 c) ts'
haftmann@28337
   184
            else nbe_apps_constr idx_of c ts'
haftmann@25924
   185
      end
haftmann@25944
   186
    and assemble_idict (DictConst (inst, dss)) =
haftmann@25944
   187
          assemble_constapp inst dss []
haftmann@25944
   188
      | assemble_idict (DictVar (supers, (v, (n, _)))) =
haftmann@25944
   189
          fold_rev (fn super => assemble_constapp super [] o single) supers (nbe_dict v n);
haftmann@25924
   190
haftmann@28350
   191
    fun assemble_iterm constapp =
haftmann@24155
   192
      let
haftmann@28350
   193
        fun of_iterm match_cont t =
haftmann@25944
   194
          let
haftmann@28054
   195
            val (t', ts) = Code_Thingol.unfold_app t
haftmann@28350
   196
          in of_iapp match_cont t' (fold_rev (cons o of_iterm NONE) ts []) end
haftmann@28350
   197
        and of_iapp match_cont (IConst (c, (dss, _))) ts = constapp c dss ts
haftmann@28350
   198
          | of_iapp match_cont (IVar v) ts = nbe_apps (nbe_bound v) ts
haftmann@28350
   199
          | of_iapp match_cont ((v, _) `|-> t) ts =
haftmann@28350
   200
              nbe_apps (nbe_abss 1 (ml_abs (ml_list [nbe_bound v]) (of_iterm NONE t))) ts
haftmann@28350
   201
          | of_iapp match_cont (ICase (((t, _), cs), t0)) ts =
haftmann@28350
   202
              nbe_apps (ml_cases (of_iterm NONE t)
haftmann@28350
   203
                (map (fn (p, t) => (of_iterm NONE p, of_iterm match_cont t)) cs
haftmann@28350
   204
                  @ [("_", case match_cont of SOME s => s | NONE => of_iterm NONE t0)])) ts
haftmann@25944
   205
      in of_iterm end;
haftmann@24155
   206
haftmann@28350
   207
    fun subst_nonlin_vars args =
haftmann@28350
   208
      let
haftmann@28350
   209
        val vs = (fold o Code_Thingol.fold_varnames)
haftmann@28350
   210
          (fn v => AList.map_default (op =) (v, 0) (curry (op +) 1)) args [];
haftmann@28350
   211
        val names = Name.make_context (map fst vs);
haftmann@28350
   212
        fun declare v k ctxt = let val vs = Name.invents ctxt v k
haftmann@28350
   213
          in (vs, fold Name.declare vs ctxt) end;
haftmann@28350
   214
        val (vs_renames, _) = fold_map (fn (v, k) => if k > 1
haftmann@28350
   215
          then declare v (k - 1) #>> (fn vs => (v, vs))
haftmann@28350
   216
          else pair (v, [])) vs names;
haftmann@28350
   217
        val samepairs = maps (fn (v, vs) => map (pair v) vs) vs_renames;
haftmann@28350
   218
        fun subst_vars (t as IConst _) samepairs = (t, samepairs)
haftmann@28350
   219
          | subst_vars (t as IVar v) samepairs = (case AList.lookup (op =) samepairs v
haftmann@28350
   220
             of SOME v' => (IVar v', AList.delete (op =) v samepairs)
haftmann@28350
   221
              | NONE => (t, samepairs))
haftmann@28350
   222
          | subst_vars (t1 `$ t2) samepairs = samepairs
haftmann@28350
   223
              |> subst_vars t1
haftmann@28350
   224
              ||>> subst_vars t2
haftmann@28350
   225
              |>> (op `$)
haftmann@28350
   226
          | subst_vars (ICase (_, t)) samepairs = subst_vars t samepairs;
haftmann@28350
   227
        val (args', _) = fold_map subst_vars args samepairs;
haftmann@28350
   228
      in (samepairs, args') end;
haftmann@28350
   229
haftmann@28337
   230
    fun assemble_eqn c dicts default_args (i, (args, rhs)) =
haftmann@28337
   231
      let
haftmann@28337
   232
        val is_eval = (c = "");
haftmann@28337
   233
        val default_rhs = nbe_apps_local (i+1) c (dicts @ default_args);
haftmann@28337
   234
        val match_cont = if is_eval then NONE else SOME default_rhs;
haftmann@28350
   235
        val assemble_arg = assemble_iterm
haftmann@28350
   236
          (fn c => fn _ => fn ts => nbe_apps_constr idx_of c ts) NONE;
haftmann@28350
   237
        val assemble_rhs = assemble_iterm assemble_constapp match_cont ;
haftmann@28350
   238
        val (samepairs, args') = subst_nonlin_vars args;
haftmann@28350
   239
        val s_args = map assemble_arg args';
haftmann@28350
   240
        val s_rhs = if null samepairs then assemble_rhs rhs
haftmann@28350
   241
          else ml_if (ml_and (map (uncurry nbe_same) samepairs))
haftmann@28350
   242
            (assemble_rhs rhs) default_rhs;
haftmann@28337
   243
        val eqns = if is_eval then
haftmann@28350
   244
            [([ml_list (rev (dicts @ s_args))], s_rhs)]
haftmann@28337
   245
          else
haftmann@28350
   246
            [([ml_list (rev (dicts @ map2 ml_as default_args s_args))], s_rhs),
haftmann@28337
   247
              ([ml_list (rev (dicts @ default_args))], default_rhs)]
haftmann@28337
   248
      in (nbe_fun i c, eqns) end;
haftmann@28337
   249
haftmann@25944
   250
    fun assemble_eqns (c, (num_args, (dicts, eqns))) =
haftmann@25944
   251
      let
haftmann@28337
   252
        val default_args = map nbe_default
haftmann@28337
   253
          (Name.invent_list [] "a" (num_args - length dicts));
haftmann@28337
   254
        val eqns' = map_index (assemble_eqn c dicts default_args) eqns
haftmann@28337
   255
          @ (if c = "" then [] else [(nbe_fun (length eqns) c,
haftmann@28337
   256
            [([ml_list (rev (dicts @ default_args))],
haftmann@28337
   257
              nbe_apps_constr idx_of c (dicts @ default_args))])]);
haftmann@28337
   258
      in (eqns', nbe_abss num_args (nbe_fun 0 c)) end;
haftmann@24155
   259
haftmann@25944
   260
    val (fun_vars, fun_vals) = map_split assemble_eqns eqnss';
haftmann@28337
   261
    val deps_vars = ml_list (map (nbe_fun 0) deps);
haftmann@28337
   262
  in ml_abs deps_vars (ml_Let (ml_fundefs (flat fun_vars)) (ml_list fun_vals)) end;
haftmann@25944
   263
haftmann@25944
   264
(* code compilation *)
haftmann@25944
   265
wenzelm@28274
   266
fun compile_eqnss _ gr raw_deps [] = []
wenzelm@28274
   267
  | compile_eqnss ctxt gr raw_deps eqnss =
haftmann@24155
   268
      let
haftmann@26064
   269
        val (deps, deps_vals) = split_list (map_filter
haftmann@26064
   270
          (fn dep => Option.map (fn univ => (dep, univ)) (fst ((Graph.get_node gr dep)))) raw_deps);
haftmann@26064
   271
        val idx_of = raw_deps
haftmann@26064
   272
          |> map (fn dep => (dep, snd (Graph.get_node gr dep)))
haftmann@26064
   273
          |> AList.lookup (op =)
haftmann@26064
   274
          |> (fn f => the o f);
haftmann@26064
   275
        val s = assemble_eqnss idx_of deps eqnss;
haftmann@24155
   276
        val cs = map fst eqnss;
haftmann@25944
   277
      in
haftmann@25944
   278
        s
haftmann@25944
   279
        |> tracing (fn s => "\n--- code to be evaluated:\n" ^ s)
wenzelm@28274
   280
        |> ML_Context.evaluate ctxt
haftmann@25944
   281
            (Output.tracing o enclose "\n---compiler echo:\n" "\n---\n",
haftmann@25944
   282
            Output.tracing o enclose "\n--- compiler echo (with error):\n" "\n---\n")
haftmann@25944
   283
            (!trace) univs_cookie
haftmann@25944
   284
        |> (fn f => f deps_vals)
haftmann@25944
   285
        |> (fn univs => cs ~~ univs)
haftmann@25944
   286
      end;
haftmann@25190
   287
haftmann@25944
   288
(* preparing function equations *)
haftmann@24155
   289
haftmann@28663
   290
fun eqns_of_stmt (_, Code_Thingol.Fun (_, (_, []))) =
haftmann@25101
   291
      []
haftmann@28663
   292
  | eqns_of_stmt (const, Code_Thingol.Fun (_, ((vs, _), eqns))) =
haftmann@25101
   293
      [(const, (vs, map fst eqns))]
haftmann@28054
   294
  | eqns_of_stmt (_, Code_Thingol.Datatypecons _) =
haftmann@25101
   295
      []
haftmann@28054
   296
  | eqns_of_stmt (_, Code_Thingol.Datatype _) =
haftmann@25101
   297
      []
haftmann@28663
   298
  | eqns_of_stmt (class, Code_Thingol.Class (_, (v, (superclasses, classops)))) =
haftmann@25101
   299
      let
haftmann@25101
   300
        val names = map snd superclasses @ map fst classops;
haftmann@25101
   301
        val params = Name.invent_list [] "d" (length names);
haftmann@25101
   302
        fun mk (k, name) =
haftmann@25101
   303
          (name, ([(v, [])],
haftmann@25101
   304
            [([IConst (class, ([], [])) `$$ map IVar params], IVar (nth params k))]));
haftmann@25101
   305
      in map_index mk names end
haftmann@28054
   306
  | eqns_of_stmt (_, Code_Thingol.Classrel _) =
haftmann@25101
   307
      []
haftmann@28054
   308
  | eqns_of_stmt (_, Code_Thingol.Classparam _) =
haftmann@25101
   309
      []
haftmann@28054
   310
  | eqns_of_stmt (inst, Code_Thingol.Classinst ((class, (_, arities)), (superinsts, instops))) =
haftmann@25101
   311
      [(inst, (arities, [([], IConst (class, ([], [])) `$$
haftmann@25101
   312
        map (fn (_, (_, (inst, dicts))) => IConst (inst, (dicts, []))) superinsts
haftmann@25101
   313
        @ map (IConst o snd o fst) instops)]))];
haftmann@24155
   314
wenzelm@28274
   315
fun compile_stmts ctxt stmts_deps =
haftmann@25101
   316
  let
haftmann@25101
   317
    val names = map (fst o fst) stmts_deps;
haftmann@25101
   318
    val names_deps = map (fn ((name, _), deps) => (name, deps)) stmts_deps;
haftmann@25101
   319
    val eqnss = maps (eqns_of_stmt o fst) stmts_deps;
haftmann@26064
   320
    val refl_deps = names_deps
haftmann@25190
   321
      |> maps snd
haftmann@25190
   322
      |> distinct (op =)
haftmann@26064
   323
      |> fold (insert (op =)) names;
haftmann@26064
   324
    fun new_node name (gr, (maxidx, idx_tab)) = if can (Graph.get_node gr) name
haftmann@26064
   325
      then (gr, (maxidx, idx_tab))
haftmann@26064
   326
      else (Graph.new_node (name, (NONE, maxidx)) gr,
haftmann@26064
   327
        (maxidx + 1, Inttab.update_new (maxidx, name) idx_tab));
haftmann@25190
   328
    fun compile gr = eqnss
wenzelm@28274
   329
      |> compile_eqnss ctxt gr refl_deps
haftmann@25190
   330
      |> rpair gr;
haftmann@25101
   331
  in
haftmann@26064
   332
    fold new_node refl_deps
haftmann@26064
   333
    #> apfst (fold (fn (name, deps) => fold (curry Graph.add_edge name) deps) names_deps
haftmann@26064
   334
      #> compile
haftmann@26064
   335
      #-> fold (fn (name, univ) => (Graph.map_node name o apfst) (K (SOME univ))))
haftmann@25101
   336
  end;
haftmann@24155
   337
haftmann@28706
   338
fun ensure_stmts ctxt naming program =
haftmann@25101
   339
  let
haftmann@26064
   340
    fun add_stmts names (gr, (maxidx, idx_tab)) = if exists ((can o Graph.get_node) gr) names
haftmann@26064
   341
      then (gr, (maxidx, idx_tab))
haftmann@26064
   342
      else (gr, (maxidx, idx_tab))
wenzelm@28274
   343
        |> compile_stmts ctxt (map (fn name => ((name, Graph.get_node program name),
haftmann@27103
   344
          Graph.imm_succs program name)) names);
haftmann@28706
   345
  in
haftmann@28706
   346
    fold_rev add_stmts (Graph.strong_conn program)
haftmann@28706
   347
    #> pair naming
haftmann@28706
   348
  end;
haftmann@24155
   349
haftmann@25944
   350
haftmann@25944
   351
(** evaluation **)
haftmann@25944
   352
haftmann@25944
   353
(* term evaluation *)
haftmann@25944
   354
haftmann@28296
   355
fun eval_term ctxt gr deps ((vs, ty) : typscheme, t) =
haftmann@25924
   356
  let 
haftmann@28054
   357
    val frees = Code_Thingol.fold_unbound_varnames (insert (op =)) t []
haftmann@25924
   358
    val frees' = map (fn v => Free (v, [])) frees;
haftmann@25924
   359
    val dict_frees = maps (fn (v, sort) => map_index (curry DFree v o fst) sort) vs;
haftmann@25924
   360
  in
haftmann@25935
   361
    ("", (vs, [(map IVar frees, t)]))
wenzelm@28274
   362
    |> singleton (compile_eqnss ctxt gr deps)
haftmann@25924
   363
    |> snd
haftmann@25924
   364
    |> (fn t => apps t (rev (dict_frees @ frees')))
haftmann@25924
   365
  end;
haftmann@24155
   366
haftmann@24839
   367
(* reification *)
haftmann@24155
   368
haftmann@28663
   369
fun term_of_univ thy program idx_tab t =
haftmann@24155
   370
  let
haftmann@25101
   371
    fun take_until f [] = []
haftmann@25101
   372
      | take_until f (x::xs) = if f x then [] else x :: take_until f xs;
haftmann@28663
   373
    fun is_dict (Const (idx, _)) = (case (Graph.get_node program o the o Inttab.lookup idx_tab) idx
haftmann@28663
   374
         of Code_Thingol.Class _ => true
haftmann@28663
   375
          | Code_Thingol.Classrel _ => true
haftmann@28663
   376
          | Code_Thingol.Classinst _ => true
haftmann@28663
   377
          | _ => false)
haftmann@25101
   378
      | is_dict (DFree _) = true
haftmann@25101
   379
      | is_dict _ = false;
haftmann@28663
   380
    fun const_of_idx idx = (case (Graph.get_node program o the o Inttab.lookup idx_tab) idx
haftmann@28663
   381
         of Code_Thingol.Fun (c, _) => c
haftmann@28663
   382
          | Code_Thingol.Datatypecons (c, _) => c
haftmann@28663
   383
          | Code_Thingol.Classparam (c, _) => c);
haftmann@24155
   384
    fun of_apps bounds (t, ts) =
haftmann@24155
   385
      fold_map (of_univ bounds) ts
haftmann@24155
   386
      #>> (fn ts' => list_comb (t, rev ts'))
haftmann@26064
   387
    and of_univ bounds (Const (idx, ts)) typidx =
haftmann@24155
   388
          let
haftmann@25101
   389
            val ts' = take_until is_dict ts;
haftmann@28663
   390
            val c = const_of_idx idx;
haftmann@28423
   391
            val (_, T) = Code.default_typscheme thy c;
haftmann@26739
   392
            val T' = map_type_tvar (fn ((v, i), S) => TypeInfer.param (typidx + i) (v, [])) T;
haftmann@24155
   393
            val typidx' = typidx + maxidx_of_typ T' + 1;
haftmann@25101
   394
          in of_apps bounds (Term.Const (c, T'), ts') typidx' end
haftmann@24155
   395
      | of_univ bounds (Free (name, ts)) typidx =
haftmann@24155
   396
          of_apps bounds (Term.Free (name, dummyT), ts) typidx
haftmann@27499
   397
      | of_univ bounds (BVar (n, ts)) typidx =
haftmann@27499
   398
          of_apps bounds (Bound (bounds - n - 1), ts) typidx
haftmann@24155
   399
      | of_univ bounds (t as Abs _) typidx =
haftmann@24155
   400
          typidx
haftmann@25924
   401
          |> of_univ (bounds + 1) (apps t [BVar (bounds, [])])
haftmann@24155
   402
          |-> (fn t' => pair (Term.Abs ("u", dummyT, t')))
haftmann@24155
   403
  in of_univ 0 t 0 |> fst end;
haftmann@24155
   404
haftmann@25101
   405
(* function store *)
haftmann@25101
   406
haftmann@25101
   407
structure Nbe_Functions = CodeDataFun
haftmann@25101
   408
(
haftmann@28706
   409
  type T = Code_Thingol.naming * ((Univ option * int) Graph.T * (int * string Inttab.table));
haftmann@28706
   410
  val empty = (Code_Thingol.empty_naming, (Graph.empty, (0, Inttab.empty)));
haftmann@28706
   411
  fun purge thy cs (naming, (gr, (maxidx, idx_tab))) =
haftmann@27609
   412
    let
haftmann@28706
   413
      val names_delete = cs
haftmann@28706
   414
        |> map_filter (Code_Thingol.lookup_const naming)
haftmann@28706
   415
        |> filter (can (Graph.get_node gr))
haftmann@28706
   416
        |> Graph.all_preds gr;
haftmann@28706
   417
      val gr' = Graph.del_nodes names_delete gr;
haftmann@28706
   418
    in (naming, (gr', (maxidx, idx_tab))) end;
haftmann@25101
   419
);
haftmann@25101
   420
haftmann@25101
   421
(* compilation, evaluation and reification *)
haftmann@25101
   422
haftmann@28706
   423
fun compile_eval thy naming program vs_ty_t deps =
haftmann@26064
   424
  let
wenzelm@28274
   425
    val ctxt = ProofContext.init thy;
haftmann@28706
   426
    val (_, (gr, (_, idx_tab))) =
haftmann@28706
   427
      Nbe_Functions.change thy (ensure_stmts ctxt naming program o snd);
haftmann@26064
   428
  in
haftmann@26064
   429
    vs_ty_t
wenzelm@28274
   430
    |> eval_term ctxt gr deps
haftmann@28663
   431
    |> term_of_univ thy program idx_tab
haftmann@26064
   432
  end;
haftmann@25101
   433
haftmann@24155
   434
(* evaluation with type reconstruction *)
haftmann@24155
   435
haftmann@28706
   436
fun eval thy t naming program vs_ty_t deps =
haftmann@24155
   437
  let
haftmann@26747
   438
    fun subst_const f = map_aterms (fn t as Term.Const (c, ty) => Term.Const (f c, ty)
haftmann@26747
   439
      | t => t);
haftmann@28054
   440
    val subst_triv_consts = subst_const (Code_Unit.resubst_alias thy);
haftmann@24347
   441
    val ty = type_of t;
haftmann@26739
   442
    val type_free = AList.lookup (op =)
haftmann@26739
   443
      (map (fn (s, T) => (s, Term.Free (s, T))) (Term.add_frees t []));
haftmann@26739
   444
    val type_frees = Term.map_aterms
haftmann@26739
   445
      (fn (t as Term.Free (s, _)) => the_default t (type_free s) | t => t);
wenzelm@27264
   446
    fun type_infer t =
wenzelm@27264
   447
      singleton (TypeInfer.infer_types (Syntax.pp_global thy) (Sign.tsig_of thy) I
wenzelm@27264
   448
        (try (Type.strip_sorts o Sign.the_const_type thy)) (K NONE) Name.context 0)
wenzelm@27264
   449
      (TypeInfer.constrain ty t);
wenzelm@29272
   450
    fun check_tvars t = if null (Term.add_tvars t []) then t else
haftmann@24155
   451
      error ("Illegal schematic type variables in normalized term: "
wenzelm@26952
   452
        ^ setmp show_types true (Syntax.string_of_term_global thy) t);
wenzelm@26952
   453
    val string_of_term = setmp show_types true (Syntax.string_of_term_global thy);
haftmann@24155
   454
  in
haftmann@28706
   455
    compile_eval thy naming program vs_ty_t deps
haftmann@25167
   456
    |> tracing (fn t => "Normalized:\n" ^ string_of_term t)
haftmann@26747
   457
    |> subst_triv_consts
haftmann@26739
   458
    |> type_frees
haftmann@25167
   459
    |> tracing (fn t => "Vars typed:\n" ^ string_of_term t)
haftmann@26739
   460
    |> type_infer
haftmann@25167
   461
    |> tracing (fn t => "Types inferred:\n" ^ string_of_term t)
haftmann@26739
   462
    |> check_tvars
haftmann@25101
   463
    |> tracing (fn t => "---\n")
haftmann@24155
   464
  end;
haftmann@24155
   465
haftmann@24155
   466
(* evaluation oracle *)
haftmann@24155
   467
wenzelm@28290
   468
val (_, norm_oracle) = Context.>>> (Context.map_theory_result
haftmann@28706
   469
  (Thm.add_oracle ("norm", fn (thy, t, naming, program, vs_ty_t, deps) =>
haftmann@28706
   470
    Thm.cterm_of thy (Logic.mk_equals (t, eval thy t naming program vs_ty_t deps)))));
haftmann@24155
   471
haftmann@26747
   472
fun add_triv_classes thy =
haftmann@26747
   473
  let
haftmann@26747
   474
    val inters = curry (Sorts.inter_sort (Sign.classes_of thy))
haftmann@28054
   475
      (Code_Unit.triv_classes thy);
haftmann@26747
   476
    fun map_sorts f = (map_types o map_atyps)
haftmann@26747
   477
      (fn TVar (v, sort) => TVar (v, f sort)
haftmann@26747
   478
        | TFree (v, sort) => TFree (v, f sort));
haftmann@26747
   479
  in map_sorts inters end;
haftmann@26747
   480
haftmann@24839
   481
fun norm_conv ct =
haftmann@24155
   482
  let
haftmann@24155
   483
    val thy = Thm.theory_of_cterm ct;
haftmann@28706
   484
    fun evaluator' t naming program vs_ty_t deps =
haftmann@28706
   485
      norm_oracle (thy, t, naming, program, vs_ty_t, deps);
haftmann@26739
   486
    fun evaluator t = (add_triv_classes thy t, evaluator' t);
haftmann@28054
   487
  in Code_Thingol.eval_conv thy evaluator ct end;
haftmann@24155
   488
haftmann@26739
   489
fun norm_term thy t =
haftmann@24839
   490
  let
haftmann@28706
   491
    fun evaluator' t naming program vs_ty_t deps = eval thy t naming program vs_ty_t deps;
haftmann@26739
   492
    fun evaluator t = (add_triv_classes thy t, evaluator' t);
haftmann@28054
   493
  in (Code.postprocess_term thy o Code_Thingol.eval_term thy evaluator) t end;
haftmann@24839
   494
haftmann@24155
   495
(* evaluation command *)
haftmann@24155
   496
haftmann@24155
   497
fun norm_print_term ctxt modes t =
haftmann@24155
   498
  let
haftmann@24155
   499
    val thy = ProofContext.theory_of ctxt;
haftmann@24839
   500
    val t' = norm_term thy t;
haftmann@24839
   501
    val ty' = Term.type_of t';
wenzelm@26952
   502
    val ctxt' = Variable.auto_fixes t ctxt;
wenzelm@24634
   503
    val p = PrintMode.with_modes modes (fn () =>
wenzelm@26952
   504
      Pretty.block [Pretty.quote (Syntax.pretty_term ctxt' t'), Pretty.fbrk,
wenzelm@26952
   505
        Pretty.str "::", Pretty.brk 1, Pretty.quote (Syntax.pretty_typ ctxt' ty')]) ();
haftmann@24155
   506
  in Pretty.writeln p end;
haftmann@24155
   507
haftmann@24155
   508
haftmann@24155
   509
(** Isar setup **)
haftmann@24155
   510
wenzelm@24508
   511
fun norm_print_term_cmd (modes, s) state =
haftmann@24155
   512
  let val ctxt = Toplevel.context_of state
wenzelm@24508
   513
  in norm_print_term ctxt modes (Syntax.read_term ctxt s) end;
haftmann@24155
   514
wenzelm@28290
   515
val setup =
wenzelm@28290
   516
  Value.add_evaluator ("nbe", norm_term o ProofContext.theory_of);
haftmann@24155
   517
haftmann@24155
   518
local structure P = OuterParse and K = OuterKeyword in
haftmann@24155
   519
haftmann@24155
   520
val opt_modes = Scan.optional (P.$$$ "(" |-- P.!!! (Scan.repeat1 P.xname --| P.$$$ ")")) [];
haftmann@24155
   521
wenzelm@24867
   522
val _ =
haftmann@24155
   523
  OuterSyntax.improper_command "normal_form" "normalize term by evaluation" K.diag
haftmann@28227
   524
    (opt_modes -- P.term >> (Toplevel.keep o norm_print_term_cmd));
haftmann@24155
   525
haftmann@24155
   526
end;
haftmann@24155
   527
haftmann@24155
   528
end;
haftmann@28337
   529