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