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