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