src/Tools/nbe.ML
author haftmann
Thu, 07 May 2009 16:22:35 +0200
changeset 31064 ce37d8f48a9f
parent 31049 396d4d6a1594
child 31156 90fed3d4430f
permissions -rw-r--r--
treat frees driectly by the LCF kernel
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
    Authors:    Klaus Aehlig, LMU Muenchen; Tobias Nipkow, Florian Haftmann, TU Muenchen
d86867645f4f nbe improved
haftmann
parents:
diff changeset
     3
24839
199c48ec5a09 step towards proper purge operation
haftmann
parents: 24713
diff changeset
     4
Normalization by evaluation, based on generic code generator.
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
     5
*)
d86867645f4f nbe improved
haftmann
parents:
diff changeset
     6
d86867645f4f nbe improved
haftmann
parents:
diff changeset
     7
signature NBE =
d86867645f4f nbe improved
haftmann
parents:
diff changeset
     8
sig
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
     9
  val norm_conv: cterm -> thm
30970
3fe2e418a071 generic postprocessing scheme for term evaluations
haftmann
parents: 30947
diff changeset
    10
  val norm: theory -> term -> term
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
    11
25204
36cf92f63a44 replaced Secure.evaluate by ML_Context.evaluate;
wenzelm
parents: 25190
diff changeset
    12
  datatype Univ =
26064
65585de05a66 using integers for pattern matching
haftmann
parents: 26011
diff changeset
    13
      Const of int * Univ list               (*named (uninterpreted) constants*)
25924
f974a1c64348 improved implementation
haftmann
parents: 25865
diff changeset
    14
    | DFree of string * int                  (*free (uninterpreted) dictionary parameters*)
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    15
    | BVar of int * Univ list
28350
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
    16
    | Abs of (int * (Univ list -> Univ)) * Univ list
25924
f974a1c64348 improved implementation
haftmann
parents: 25865
diff changeset
    17
  val apps: Univ -> Univ list -> Univ        (*explicit applications*)
25944
haftmann
parents: 25935
diff changeset
    18
  val abss: int -> (Univ list -> Univ) -> Univ
28337
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
    19
                                             (*abstractions as closures*)
28350
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
    20
  val same: Univ -> Univ -> bool
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    21
25204
36cf92f63a44 replaced Secure.evaluate by ML_Context.evaluate;
wenzelm
parents: 25190
diff changeset
    22
  val univs_ref: (unit -> Univ list -> Univ list) option ref
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    23
  val trace: bool ref
25924
f974a1c64348 improved implementation
haftmann
parents: 25865
diff changeset
    24
26747
f32fa5f5bdd1 moved 'trivial classes' to foundation of code generator
haftmann
parents: 26739
diff changeset
    25
  val setup: theory -> theory
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    26
end;
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    27
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    28
structure Nbe: NBE =
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    29
struct
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    30
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    31
(* generic non-sense *)
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    32
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    33
val trace = ref false;
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    34
fun tracing f x = if !trace then (Output.tracing (f x); x) else x;
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    35
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    36
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    37
(** the semantical universe **)
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    38
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    39
(*
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    40
   Functions are given by their semantical function value. To avoid
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    41
   trouble with the ML-type system, these functions have the most
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    42
   generic type, that is "Univ list -> Univ". The calling convention is
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    43
   that the arguments come as a list, the last argument first. In
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    44
   other words, a function call that usually would look like
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    45
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    46
   f x_1 x_2 ... x_n   or   f(x_1,x_2, ..., x_n)
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    47
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    48
   would be in our convention called as
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    49
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    50
              f [x_n,..,x_2,x_1]
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    51
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    52
   Moreover, to handle functions that are still waiting for some
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    53
   arguments we have additionally a list of arguments collected to far
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    54
   and the number of arguments we're still waiting for.
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    55
*)
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    56
25204
36cf92f63a44 replaced Secure.evaluate by ML_Context.evaluate;
wenzelm
parents: 25190
diff changeset
    57
datatype Univ =
26064
65585de05a66 using integers for pattern matching
haftmann
parents: 26011
diff changeset
    58
    Const of int * Univ list           (*named (uninterpreted) constants*)
25924
f974a1c64348 improved implementation
haftmann
parents: 25865
diff changeset
    59
  | DFree of string * int              (*free (uninterpreted) dictionary parameters*)
27499
150558266831 clarified code
haftmann
parents: 27264
diff changeset
    60
  | BVar of int * Univ list            (*bound variables, named*)
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    61
  | Abs of (int * (Univ list -> Univ)) * Univ list
27499
150558266831 clarified code
haftmann
parents: 27264
diff changeset
    62
                                       (*abstractions as closures*);
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    63
28350
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
    64
fun same (Const (k, xs)) (Const (l, ys)) = k = l andalso sames xs ys
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
    65
  | same (DFree (s, k)) (DFree (t, l)) = s = t andalso k = l
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
    66
  | same (BVar (k, xs)) (BVar (l, ys)) = k = l andalso sames xs ys
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
    67
  | same _ _ = false
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
    68
and sames xs ys = length xs = length ys andalso forall (uncurry same) (xs ~~ ys);
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
    69
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    70
(* constructor functions *)
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    71
25944
haftmann
parents: 25935
diff changeset
    72
fun abss n f = Abs ((n, f), []);
25924
f974a1c64348 improved implementation
haftmann
parents: 25865
diff changeset
    73
fun apps (Abs ((n, f), xs)) ys = let val k = n - length ys in
27499
150558266831 clarified code
haftmann
parents: 27264
diff changeset
    74
      case int_ord (k, 0)
150558266831 clarified code
haftmann
parents: 27264
diff changeset
    75
       of EQUAL => f (ys @ xs)
150558266831 clarified code
haftmann
parents: 27264
diff changeset
    76
        | LESS => let val (zs, ws) = chop (~ k) ys in apps (f (ws @ xs)) zs end
150558266831 clarified code
haftmann
parents: 27264
diff changeset
    77
        | GREATER => Abs ((k, f), ys @ xs) (*note: reverse convention also for apps!*)
150558266831 clarified code
haftmann
parents: 27264
diff changeset
    78
      end
25924
f974a1c64348 improved implementation
haftmann
parents: 25865
diff changeset
    79
  | apps (Const (name, xs)) ys = Const (name, ys @ xs)
27499
150558266831 clarified code
haftmann
parents: 27264
diff changeset
    80
  | apps (BVar (n, xs)) ys = BVar (n, ys @ xs);
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    81
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    82
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    83
(** assembling and compiling ML code from terms **)
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    84
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    85
(* abstract ML syntax *)
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    86
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    87
infix 9 `$` `$$`;
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    88
fun e1 `$` e2 = "(" ^ e1 ^ " " ^ e2 ^ ")";
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
    89
fun e `$$` [] = e
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
    90
  | e `$$` es = "(" ^ e ^ " " ^ space_implode " " es ^ ")";
24590
733120d04233 delayed evaluation
haftmann
parents: 24508
diff changeset
    91
fun ml_abs v e = "(fn " ^ v ^ " => " ^ e ^ ")";
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    92
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    93
fun ml_cases t cs =
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    94
  "(case " ^ t ^ " of " ^ space_implode " | " (map (fn (p, t) => p ^ " => " ^ t) cs) ^ ")";
25944
haftmann
parents: 25935
diff changeset
    95
fun ml_Let d e = "let\n" ^ d ^ " in " ^ e ^ " end";
28337
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
    96
fun ml_as v t = "(" ^ v ^ " as " ^ t ^ ")";
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
    97
28350
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
    98
fun ml_and [] = "true"
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
    99
  | ml_and [x] = x
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   100
  | ml_and xs = "(" ^ space_implode " andalso " xs ^ ")";
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   101
fun ml_if b x y = "(if " ^ b ^ " then " ^ x ^ " else " ^ y ^ ")";
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   102
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   103
fun ml_list es = "[" ^ commas es ^ "]";
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   104
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   105
fun ml_fundefs ([(name, [([], e)])]) =
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   106
      "val " ^ name ^ " = " ^ e ^ "\n"
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   107
  | ml_fundefs (eqs :: eqss) =
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   108
      let
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   109
        fun fundef (name, eqs) =
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   110
          let
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   111
            fun eqn (es, e) = name ^ " " ^ space_implode " " es ^ " = " ^ e
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   112
          in space_implode "\n  | " (map eqn eqs) end;
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   113
      in
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   114
        (prefix "fun " o fundef) eqs :: map (prefix "and " o fundef) eqss
26931
aa226d8405a8 cat_lines;
wenzelm
parents: 26747
diff changeset
   115
        |> cat_lines
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   116
        |> suffix "\n"
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   117
      end;
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   118
25944
haftmann
parents: 25935
diff changeset
   119
(* nbe specific syntax and sandbox communication *)
haftmann
parents: 25935
diff changeset
   120
haftmann
parents: 25935
diff changeset
   121
val univs_ref = ref (NONE : (unit -> Univ list -> Univ list) option);
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   122
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   123
local
28350
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   124
  val prefix =      "Nbe.";
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   125
  val name_ref =    prefix ^ "univs_ref";
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   126
  val name_const =  prefix ^ "Const";
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   127
  val name_abss =   prefix ^ "abss";
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   128
  val name_apps =   prefix ^ "apps";
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   129
  val name_same =   prefix ^ "same";
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   130
in
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   131
25944
haftmann
parents: 25935
diff changeset
   132
val univs_cookie = (name_ref, univs_ref);
haftmann
parents: 25935
diff changeset
   133
28337
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   134
fun nbe_fun 0 "" = "nbe_value"
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   135
  | 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
   136
fun nbe_dict v n = "d_" ^ v ^ "_" ^ string_of_int n;
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   137
fun nbe_bound v = "v_" ^ v;
28337
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   138
fun nbe_default v = "w_" ^ v;
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   139
25924
f974a1c64348 improved implementation
haftmann
parents: 25865
diff changeset
   140
(*note: these three are the "turning spots" where proper argument order is established!*)
f974a1c64348 improved implementation
haftmann
parents: 25865
diff changeset
   141
fun nbe_apps t [] = t
f974a1c64348 improved implementation
haftmann
parents: 25865
diff changeset
   142
  | nbe_apps t ts = name_apps `$$` [t, ml_list (rev ts)];
28337
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   143
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
   144
fun nbe_apps_constr idx_of c ts =
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   145
  let
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   146
    val c' = if !trace then string_of_int (idx_of c) ^ " (*" ^ c ^ "*)"
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   147
      else string_of_int (idx_of c);
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   148
  in name_const `$` ("(" ^ c' ^ ", " ^ ml_list (rev ts) ^ ")") end;
25924
f974a1c64348 improved implementation
haftmann
parents: 25865
diff changeset
   149
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   150
fun nbe_abss 0 f = f `$` ml_list []
25944
haftmann
parents: 25935
diff changeset
   151
  | nbe_abss n f = name_abss `$$` [string_of_int n, f];
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   152
28350
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   153
fun nbe_same v1 v2 = "(" ^ name_same ^ " " ^ nbe_bound v1 ^ " " ^ nbe_bound v2 ^ ")";
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   154
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   155
end;
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   156
28054
2b84d34c5d02 restructured and split code serializer module
haftmann
parents: 27609
diff changeset
   157
open Basic_Code_Thingol;
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   158
25865
a141d6bfd398 tuned comment
haftmann
parents: 25204
diff changeset
   159
(* code generation *)
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   160
26064
65585de05a66 using integers for pattern matching
haftmann
parents: 26011
diff changeset
   161
fun assemble_eqnss idx_of deps eqnss =
25944
haftmann
parents: 25935
diff changeset
   162
  let
haftmann
parents: 25935
diff changeset
   163
    fun prep_eqns (c, (vs, eqns)) =
25924
f974a1c64348 improved implementation
haftmann
parents: 25865
diff changeset
   164
      let
25944
haftmann
parents: 25935
diff changeset
   165
        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
   166
        val num_args = length dicts + ((length o fst o hd) eqns);
25944
haftmann
parents: 25935
diff changeset
   167
      in (c, (num_args, (dicts, eqns))) end;
haftmann
parents: 25935
diff changeset
   168
    val eqnss' = map prep_eqns eqnss;
haftmann
parents: 25935
diff changeset
   169
haftmann
parents: 25935
diff changeset
   170
    fun assemble_constapp c dss ts = 
haftmann
parents: 25935
diff changeset
   171
      let
haftmann
parents: 25935
diff changeset
   172
        val ts' = (maps o map) assemble_idict dss @ ts;
haftmann
parents: 25935
diff changeset
   173
      in case AList.lookup (op =) eqnss' c
28337
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   174
       of SOME (num_args, _) => if num_args <= length ts'
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   175
            then let val (ts1, ts2) = chop num_args ts'
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   176
            in nbe_apps (nbe_apps_local 0 c ts1) ts2
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   177
            end else nbe_apps (nbe_abss num_args (nbe_fun 0 c)) ts'
25944
haftmann
parents: 25935
diff changeset
   178
        | NONE => if member (op =) deps c
28337
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   179
            then nbe_apps (nbe_fun 0 c) ts'
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   180
            else nbe_apps_constr idx_of c ts'
25924
f974a1c64348 improved implementation
haftmann
parents: 25865
diff changeset
   181
      end
25944
haftmann
parents: 25935
diff changeset
   182
    and assemble_idict (DictConst (inst, dss)) =
haftmann
parents: 25935
diff changeset
   183
          assemble_constapp inst dss []
haftmann
parents: 25935
diff changeset
   184
      | assemble_idict (DictVar (supers, (v, (n, _)))) =
haftmann
parents: 25935
diff changeset
   185
          fold_rev (fn super => assemble_constapp super [] o single) supers (nbe_dict v n);
25924
f974a1c64348 improved implementation
haftmann
parents: 25865
diff changeset
   186
28350
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   187
    fun assemble_iterm constapp =
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   188
      let
28350
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   189
        fun of_iterm match_cont t =
25944
haftmann
parents: 25935
diff changeset
   190
          let
28054
2b84d34c5d02 restructured and split code serializer module
haftmann
parents: 27609
diff changeset
   191
            val (t', ts) = Code_Thingol.unfold_app t
28350
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   192
          in of_iapp match_cont t' (fold_rev (cons o of_iterm NONE) ts []) end
31049
396d4d6a1594 explicit type arguments in constants
haftmann
parents: 30970
diff changeset
   193
        and of_iapp match_cont (IConst (c, ((_, dss), _))) ts = constapp c dss ts
28350
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   194
          | of_iapp match_cont (IVar v) ts = nbe_apps (nbe_bound v) ts
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   195
          | of_iapp match_cont ((v, _) `|-> t) ts =
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   196
              nbe_apps (nbe_abss 1 (ml_abs (ml_list [nbe_bound v]) (of_iterm NONE t))) ts
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   197
          | of_iapp match_cont (ICase (((t, _), cs), t0)) ts =
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   198
              nbe_apps (ml_cases (of_iterm NONE t)
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   199
                (map (fn (p, t) => (of_iterm NONE p, of_iterm match_cont t)) cs
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   200
                  @ [("_", case match_cont of SOME s => s | NONE => of_iterm NONE t0)])) ts
25944
haftmann
parents: 25935
diff changeset
   201
      in of_iterm end;
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   202
28350
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   203
    fun subst_nonlin_vars args =
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   204
      let
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   205
        val vs = (fold o Code_Thingol.fold_varnames)
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   206
          (fn v => AList.map_default (op =) (v, 0) (curry (op +) 1)) args [];
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   207
        val names = Name.make_context (map fst vs);
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   208
        fun declare v k ctxt = let val vs = Name.invents ctxt v k
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   209
          in (vs, fold Name.declare vs ctxt) end;
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   210
        val (vs_renames, _) = fold_map (fn (v, k) => if k > 1
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   211
          then declare v (k - 1) #>> (fn vs => (v, vs))
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   212
          else pair (v, [])) vs names;
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   213
        val samepairs = maps (fn (v, vs) => map (pair v) vs) vs_renames;
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   214
        fun subst_vars (t as IConst _) samepairs = (t, samepairs)
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   215
          | subst_vars (t as IVar v) samepairs = (case AList.lookup (op =) samepairs v
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   216
             of SOME v' => (IVar v', AList.delete (op =) v samepairs)
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   217
              | NONE => (t, samepairs))
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   218
          | subst_vars (t1 `$ t2) samepairs = samepairs
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   219
              |> subst_vars t1
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   220
              ||>> subst_vars t2
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   221
              |>> (op `$)
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   222
          | subst_vars (ICase (_, t)) samepairs = subst_vars t samepairs;
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   223
        val (args', _) = fold_map subst_vars args samepairs;
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   224
      in (samepairs, args') end;
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   225
28337
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   226
    fun assemble_eqn c dicts default_args (i, (args, rhs)) =
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   227
      let
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   228
        val is_eval = (c = "");
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   229
        val default_rhs = nbe_apps_local (i+1) c (dicts @ default_args);
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   230
        val match_cont = if is_eval then NONE else SOME default_rhs;
28350
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   231
        val assemble_arg = assemble_iterm
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   232
          (fn c => fn _ => fn ts => nbe_apps_constr idx_of c ts) NONE;
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   233
        val assemble_rhs = assemble_iterm assemble_constapp match_cont ;
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   234
        val (samepairs, args') = subst_nonlin_vars args;
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   235
        val s_args = map assemble_arg args';
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   236
        val s_rhs = if null samepairs then assemble_rhs rhs
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   237
          else ml_if (ml_and (map (uncurry nbe_same) samepairs))
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   238
            (assemble_rhs rhs) default_rhs;
28337
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   239
        val eqns = if is_eval then
28350
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   240
            [([ml_list (rev (dicts @ s_args))], s_rhs)]
28337
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   241
          else
28350
715163ec93c0 non left-linear equations for nbe
haftmann
parents: 28337
diff changeset
   242
            [([ml_list (rev (dicts @ map2 ml_as default_args s_args))], s_rhs),
28337
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   243
              ([ml_list (rev (dicts @ default_args))], default_rhs)]
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   244
      in (nbe_fun i c, eqns) end;
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   245
25944
haftmann
parents: 25935
diff changeset
   246
    fun assemble_eqns (c, (num_args, (dicts, eqns))) =
haftmann
parents: 25935
diff changeset
   247
      let
28337
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   248
        val default_args = map nbe_default
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   249
          (Name.invent_list [] "a" (num_args - length dicts));
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   250
        val eqns' = map_index (assemble_eqn c dicts default_args) eqns
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   251
          @ (if c = "" then [] else [(nbe_fun (length eqns) c,
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   252
            [([ml_list (rev (dicts @ default_args))],
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   253
              nbe_apps_constr idx_of c (dicts @ default_args))])]);
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   254
      in (eqns', nbe_abss num_args (nbe_fun 0 c)) end;
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   255
25944
haftmann
parents: 25935
diff changeset
   256
    val (fun_vars, fun_vals) = map_split assemble_eqns eqnss';
28337
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   257
    val deps_vars = ml_list (map (nbe_fun 0) deps);
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   258
  in ml_abs deps_vars (ml_Let (ml_fundefs (flat fun_vars)) (ml_list fun_vals)) end;
25944
haftmann
parents: 25935
diff changeset
   259
haftmann
parents: 25935
diff changeset
   260
(* code compilation *)
haftmann
parents: 25935
diff changeset
   261
28274
9873697fa411 ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents: 28227
diff changeset
   262
fun compile_eqnss _ gr raw_deps [] = []
9873697fa411 ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents: 28227
diff changeset
   263
  | compile_eqnss ctxt gr raw_deps eqnss =
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   264
      let
26064
65585de05a66 using integers for pattern matching
haftmann
parents: 26011
diff changeset
   265
        val (deps, deps_vals) = split_list (map_filter
65585de05a66 using integers for pattern matching
haftmann
parents: 26011
diff changeset
   266
          (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
   267
        val idx_of = raw_deps
65585de05a66 using integers for pattern matching
haftmann
parents: 26011
diff changeset
   268
          |> map (fn dep => (dep, snd (Graph.get_node gr dep)))
65585de05a66 using integers for pattern matching
haftmann
parents: 26011
diff changeset
   269
          |> AList.lookup (op =)
65585de05a66 using integers for pattern matching
haftmann
parents: 26011
diff changeset
   270
          |> (fn f => the o f);
65585de05a66 using integers for pattern matching
haftmann
parents: 26011
diff changeset
   271
        val s = assemble_eqnss idx_of deps eqnss;
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   272
        val cs = map fst eqnss;
25944
haftmann
parents: 25935
diff changeset
   273
      in
haftmann
parents: 25935
diff changeset
   274
        s
haftmann
parents: 25935
diff changeset
   275
        |> tracing (fn s => "\n--- code to be evaluated:\n" ^ s)
30672
beaadd5af500 more systematic type use_context, with particular values ML_Parse.global_context and ML_Context.local_context;
wenzelm
parents: 30288
diff changeset
   276
        |> ML_Context.evaluate ctxt (!trace) univs_cookie
25944
haftmann
parents: 25935
diff changeset
   277
        |> (fn f => f deps_vals)
haftmann
parents: 25935
diff changeset
   278
        |> (fn univs => cs ~~ univs)
haftmann
parents: 25935
diff changeset
   279
      end;
25190
5cd8486c5a4f clarified implementation
haftmann
parents: 25167
diff changeset
   280
30672
beaadd5af500 more systematic type use_context, with particular values ML_Parse.global_context and ML_Context.local_context;
wenzelm
parents: 30288
diff changeset
   281
25944
haftmann
parents: 25935
diff changeset
   282
(* preparing function equations *)
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   283
28663
bd8438543bf2 code identifier namings are no longer imperative
haftmann
parents: 28423
diff changeset
   284
fun eqns_of_stmt (_, Code_Thingol.Fun (_, (_, []))) =
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   285
      []
28663
bd8438543bf2 code identifier namings are no longer imperative
haftmann
parents: 28423
diff changeset
   286
  | eqns_of_stmt (const, Code_Thingol.Fun (_, ((vs, _), eqns))) =
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   287
      [(const, (vs, map fst eqns))]
28054
2b84d34c5d02 restructured and split code serializer module
haftmann
parents: 27609
diff changeset
   288
  | eqns_of_stmt (_, Code_Thingol.Datatypecons _) =
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   289
      []
28054
2b84d34c5d02 restructured and split code serializer module
haftmann
parents: 27609
diff changeset
   290
  | eqns_of_stmt (_, Code_Thingol.Datatype _) =
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   291
      []
28663
bd8438543bf2 code identifier namings are no longer imperative
haftmann
parents: 28423
diff changeset
   292
  | eqns_of_stmt (class, Code_Thingol.Class (_, (v, (superclasses, classops)))) =
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   293
      let
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   294
        val names = map snd superclasses @ map fst classops;
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   295
        val params = Name.invent_list [] "d" (length names);
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   296
        fun mk (k, name) =
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   297
          (name, ([(v, [])],
31049
396d4d6a1594 explicit type arguments in constants
haftmann
parents: 30970
diff changeset
   298
            [([IConst (class, (([], []), [])) `$$ map IVar params], IVar (nth params k))]));
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   299
      in map_index mk names end
28054
2b84d34c5d02 restructured and split code serializer module
haftmann
parents: 27609
diff changeset
   300
  | eqns_of_stmt (_, Code_Thingol.Classrel _) =
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   301
      []
28054
2b84d34c5d02 restructured and split code serializer module
haftmann
parents: 27609
diff changeset
   302
  | eqns_of_stmt (_, Code_Thingol.Classparam _) =
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   303
      []
28054
2b84d34c5d02 restructured and split code serializer module
haftmann
parents: 27609
diff changeset
   304
  | eqns_of_stmt (inst, Code_Thingol.Classinst ((class, (_, arities)), (superinsts, instops))) =
31049
396d4d6a1594 explicit type arguments in constants
haftmann
parents: 30970
diff changeset
   305
      [(inst, (arities, [([], IConst (class, (([], []), [])) `$$
396d4d6a1594 explicit type arguments in constants
haftmann
parents: 30970
diff changeset
   306
        map (fn (_, (_, (inst, dicts))) => IConst (inst, (([], dicts), []))) superinsts
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   307
        @ map (IConst o snd o fst) instops)]))];
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   308
28274
9873697fa411 ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents: 28227
diff changeset
   309
fun compile_stmts ctxt stmts_deps =
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   310
  let
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   311
    val names = map (fst o fst) stmts_deps;
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   312
    val names_deps = map (fn ((name, _), deps) => (name, deps)) stmts_deps;
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   313
    val eqnss = maps (eqns_of_stmt o fst) stmts_deps;
26064
65585de05a66 using integers for pattern matching
haftmann
parents: 26011
diff changeset
   314
    val refl_deps = names_deps
25190
5cd8486c5a4f clarified implementation
haftmann
parents: 25167
diff changeset
   315
      |> maps snd
5cd8486c5a4f clarified implementation
haftmann
parents: 25167
diff changeset
   316
      |> distinct (op =)
26064
65585de05a66 using integers for pattern matching
haftmann
parents: 26011
diff changeset
   317
      |> fold (insert (op =)) names;
65585de05a66 using integers for pattern matching
haftmann
parents: 26011
diff changeset
   318
    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
   319
      then (gr, (maxidx, idx_tab))
65585de05a66 using integers for pattern matching
haftmann
parents: 26011
diff changeset
   320
      else (Graph.new_node (name, (NONE, maxidx)) gr,
65585de05a66 using integers for pattern matching
haftmann
parents: 26011
diff changeset
   321
        (maxidx + 1, Inttab.update_new (maxidx, name) idx_tab));
25190
5cd8486c5a4f clarified implementation
haftmann
parents: 25167
diff changeset
   322
    fun compile gr = eqnss
28274
9873697fa411 ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents: 28227
diff changeset
   323
      |> compile_eqnss ctxt gr refl_deps
25190
5cd8486c5a4f clarified implementation
haftmann
parents: 25167
diff changeset
   324
      |> rpair gr;
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   325
  in
26064
65585de05a66 using integers for pattern matching
haftmann
parents: 26011
diff changeset
   326
    fold new_node refl_deps
65585de05a66 using integers for pattern matching
haftmann
parents: 26011
diff changeset
   327
    #> 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
   328
      #> compile
65585de05a66 using integers for pattern matching
haftmann
parents: 26011
diff changeset
   329
      #-> fold (fn (name, univ) => (Graph.map_node name o apfst) (K (SOME univ))))
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   330
  end;
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   331
28706
3fef773ae6b1 restored incremental code generation
haftmann
parents: 28663
diff changeset
   332
fun ensure_stmts ctxt naming program =
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   333
  let
26064
65585de05a66 using integers for pattern matching
haftmann
parents: 26011
diff changeset
   334
    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
   335
      then (gr, (maxidx, idx_tab))
65585de05a66 using integers for pattern matching
haftmann
parents: 26011
diff changeset
   336
      else (gr, (maxidx, idx_tab))
28274
9873697fa411 ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents: 28227
diff changeset
   337
        |> 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
   338
          Graph.imm_succs program name)) names);
28706
3fef773ae6b1 restored incremental code generation
haftmann
parents: 28663
diff changeset
   339
  in
3fef773ae6b1 restored incremental code generation
haftmann
parents: 28663
diff changeset
   340
    fold_rev add_stmts (Graph.strong_conn program)
3fef773ae6b1 restored incremental code generation
haftmann
parents: 28663
diff changeset
   341
    #> pair naming
3fef773ae6b1 restored incremental code generation
haftmann
parents: 28663
diff changeset
   342
  end;
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   343
25944
haftmann
parents: 25935
diff changeset
   344
haftmann
parents: 25935
diff changeset
   345
(** evaluation **)
haftmann
parents: 25935
diff changeset
   346
haftmann
parents: 25935
diff changeset
   347
(* term evaluation *)
haftmann
parents: 25935
diff changeset
   348
30947
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   349
fun eval_term ctxt gr deps (vs : (string * sort) list, t) =
25924
f974a1c64348 improved implementation
haftmann
parents: 25865
diff changeset
   350
  let 
f974a1c64348 improved implementation
haftmann
parents: 25865
diff changeset
   351
    val dict_frees = maps (fn (v, sort) => map_index (curry DFree v o fst) sort) vs;
f974a1c64348 improved implementation
haftmann
parents: 25865
diff changeset
   352
  in
31064
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   353
    ("", (vs, [([], t)]))
28274
9873697fa411 ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents: 28227
diff changeset
   354
    |> singleton (compile_eqnss ctxt gr deps)
25924
f974a1c64348 improved implementation
haftmann
parents: 25865
diff changeset
   355
    |> snd
31064
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   356
    |> (fn t => apps t (rev dict_frees))
25924
f974a1c64348 improved implementation
haftmann
parents: 25865
diff changeset
   357
  end;
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   358
24839
199c48ec5a09 step towards proper purge operation
haftmann
parents: 24713
diff changeset
   359
(* reification *)
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   360
30947
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   361
fun typ_of_itype program vs (ityco `%% itys) =
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   362
      let
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   363
        val Code_Thingol.Datatype (tyco, _) = Graph.get_node program ityco;
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   364
      in Type (tyco, map (typ_of_itype program vs) itys) end
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   365
  | typ_of_itype program vs (ITyVar v) =
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   366
      let
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   367
        val sort = (the o AList.lookup (op =) vs) v;
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   368
      in TFree ("'" ^ v, sort) end;
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   369
28663
bd8438543bf2 code identifier namings are no longer imperative
haftmann
parents: 28423
diff changeset
   370
fun term_of_univ thy program idx_tab t =
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   371
  let
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   372
    fun take_until f [] = []
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   373
      | take_until f (x::xs) = if f x then [] else x :: take_until f xs;
28663
bd8438543bf2 code identifier namings are no longer imperative
haftmann
parents: 28423
diff changeset
   374
    fun is_dict (Const (idx, _)) = (case (Graph.get_node program o the o Inttab.lookup idx_tab) idx
bd8438543bf2 code identifier namings are no longer imperative
haftmann
parents: 28423
diff changeset
   375
         of Code_Thingol.Class _ => true
bd8438543bf2 code identifier namings are no longer imperative
haftmann
parents: 28423
diff changeset
   376
          | Code_Thingol.Classrel _ => true
bd8438543bf2 code identifier namings are no longer imperative
haftmann
parents: 28423
diff changeset
   377
          | Code_Thingol.Classinst _ => true
bd8438543bf2 code identifier namings are no longer imperative
haftmann
parents: 28423
diff changeset
   378
          | _ => false)
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   379
      | is_dict (DFree _) = true
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   380
      | is_dict _ = false;
28663
bd8438543bf2 code identifier namings are no longer imperative
haftmann
parents: 28423
diff changeset
   381
    fun const_of_idx idx = (case (Graph.get_node program o the o Inttab.lookup idx_tab) idx
bd8438543bf2 code identifier namings are no longer imperative
haftmann
parents: 28423
diff changeset
   382
         of Code_Thingol.Fun (c, _) => c
bd8438543bf2 code identifier namings are no longer imperative
haftmann
parents: 28423
diff changeset
   383
          | Code_Thingol.Datatypecons (c, _) => c
bd8438543bf2 code identifier namings are no longer imperative
haftmann
parents: 28423
diff changeset
   384
          | Code_Thingol.Classparam (c, _) => c);
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   385
    fun of_apps bounds (t, ts) =
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   386
      fold_map (of_univ bounds) ts
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   387
      #>> (fn ts' => list_comb (t, rev ts'))
26064
65585de05a66 using integers for pattern matching
haftmann
parents: 26011
diff changeset
   388
    and of_univ bounds (Const (idx, ts)) typidx =
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   389
          let
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   390
            val ts' = take_until is_dict ts;
28663
bd8438543bf2 code identifier namings are no longer imperative
haftmann
parents: 28423
diff changeset
   391
            val c = const_of_idx idx;
28423
9fc3befd8191 clarified codegen interfaces
haftmann
parents: 28350
diff changeset
   392
            val (_, T) = Code.default_typscheme thy c;
30022
1d8b8fa19074 maintain order of constructors in datatypes; clarified conventions for type schemes
haftmann
parents: 29272
diff changeset
   393
            val T' = map_type_tfree (fn (v, _) => TypeInfer.param typidx (v, [])) T;
1d8b8fa19074 maintain order of constructors in datatypes; clarified conventions for type schemes
haftmann
parents: 29272
diff changeset
   394
            val typidx' = typidx + 1;
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   395
          in of_apps bounds (Term.Const (c, T'), ts') typidx' end
27499
150558266831 clarified code
haftmann
parents: 27264
diff changeset
   396
      | of_univ bounds (BVar (n, ts)) typidx =
150558266831 clarified code
haftmann
parents: 27264
diff changeset
   397
          of_apps bounds (Bound (bounds - n - 1), ts) typidx
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   398
      | of_univ bounds (t as Abs _) typidx =
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   399
          typidx
25924
f974a1c64348 improved implementation
haftmann
parents: 25865
diff changeset
   400
          |> of_univ (bounds + 1) (apps t [BVar (bounds, [])])
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   401
          |-> (fn t' => pair (Term.Abs ("u", dummyT, t')))
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   402
  in of_univ 0 t 0 |> fst end;
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   403
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   404
(* function store *)
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   405
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   406
structure Nbe_Functions = CodeDataFun
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   407
(
28706
3fef773ae6b1 restored incremental code generation
haftmann
parents: 28663
diff changeset
   408
  type T = Code_Thingol.naming * ((Univ option * int) Graph.T * (int * string Inttab.table));
3fef773ae6b1 restored incremental code generation
haftmann
parents: 28663
diff changeset
   409
  val empty = (Code_Thingol.empty_naming, (Graph.empty, (0, Inttab.empty)));
3fef773ae6b1 restored incremental code generation
haftmann
parents: 28663
diff changeset
   410
  fun purge thy cs (naming, (gr, (maxidx, idx_tab))) =
27609
b23c9ad0fe7d tuned code theorem bookkeeping
haftmann
parents: 27499
diff changeset
   411
    let
28706
3fef773ae6b1 restored incremental code generation
haftmann
parents: 28663
diff changeset
   412
      val names_delete = cs
3fef773ae6b1 restored incremental code generation
haftmann
parents: 28663
diff changeset
   413
        |> map_filter (Code_Thingol.lookup_const naming)
3fef773ae6b1 restored incremental code generation
haftmann
parents: 28663
diff changeset
   414
        |> filter (can (Graph.get_node gr))
3fef773ae6b1 restored incremental code generation
haftmann
parents: 28663
diff changeset
   415
        |> Graph.all_preds gr;
3fef773ae6b1 restored incremental code generation
haftmann
parents: 28663
diff changeset
   416
      val gr' = Graph.del_nodes names_delete gr;
3fef773ae6b1 restored incremental code generation
haftmann
parents: 28663
diff changeset
   417
    in (naming, (gr', (maxidx, idx_tab))) end;
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   418
);
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   419
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   420
(* compilation, evaluation and reification *)
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   421
30947
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   422
fun compile_eval thy naming program vs_t deps =
26064
65585de05a66 using integers for pattern matching
haftmann
parents: 26011
diff changeset
   423
  let
28274
9873697fa411 ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents: 28227
diff changeset
   424
    val ctxt = ProofContext.init thy;
28706
3fef773ae6b1 restored incremental code generation
haftmann
parents: 28663
diff changeset
   425
    val (_, (gr, (_, idx_tab))) =
3fef773ae6b1 restored incremental code generation
haftmann
parents: 28663
diff changeset
   426
      Nbe_Functions.change thy (ensure_stmts ctxt naming program o snd);
26064
65585de05a66 using integers for pattern matching
haftmann
parents: 26011
diff changeset
   427
  in
30947
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   428
    vs_t
28274
9873697fa411 ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents: 28227
diff changeset
   429
    |> eval_term ctxt gr deps
28663
bd8438543bf2 code identifier namings are no longer imperative
haftmann
parents: 28423
diff changeset
   430
    |> term_of_univ thy program idx_tab
26064
65585de05a66 using integers for pattern matching
haftmann
parents: 26011
diff changeset
   431
  end;
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   432
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   433
(* evaluation with type reconstruction *)
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   434
31064
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   435
fun normalize thy naming program ((vs0, (vs, ty)), t) deps =
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   436
  let
26747
f32fa5f5bdd1 moved 'trivial classes' to foundation of code generator
haftmann
parents: 26739
diff changeset
   437
    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
   438
      | t => t);
30947
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   439
    val resubst_triv_consts = subst_const (Code_Unit.resubst_alias thy);
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   440
    val ty' = typ_of_itype program vs0 ty;
27264
843472ae2116 simplified TypeInfer.infer_types;
wenzelm
parents: 27103
diff changeset
   441
    fun type_infer t =
843472ae2116 simplified TypeInfer.infer_types;
wenzelm
parents: 27103
diff changeset
   442
      singleton (TypeInfer.infer_types (Syntax.pp_global thy) (Sign.tsig_of thy) I
843472ae2116 simplified TypeInfer.infer_types;
wenzelm
parents: 27103
diff changeset
   443
        (try (Type.strip_sorts o Sign.the_const_type thy)) (K NONE) Name.context 0)
30947
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   444
      (TypeInfer.constrain ty' t);
29272
fb3ccf499df5 use regular Term.add_XXX etc.;
wenzelm
parents: 28706
diff changeset
   445
    fun check_tvars t = if null (Term.add_tvars t []) then t else
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   446
      error ("Illegal schematic type variables in normalized term: "
26952
df36f4c52ee8 command 'normal_form': proper context via Variable.auto_fixes;
wenzelm
parents: 26931
diff changeset
   447
        ^ 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
   448
    val string_of_term = setmp show_types true (Syntax.string_of_term_global thy);
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   449
  in
30947
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   450
    compile_eval thy naming program (vs, t) deps
25167
0fd59d8e2bad fixed typo
haftmann
parents: 25101
diff changeset
   451
    |> tracing (fn t => "Normalized:\n" ^ string_of_term t)
30947
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   452
    |> resubst_triv_consts
26739
947b6013e863 different handling of eq class for nbe
haftmann
parents: 26064
diff changeset
   453
    |> type_infer
25167
0fd59d8e2bad fixed typo
haftmann
parents: 25101
diff changeset
   454
    |> tracing (fn t => "Types inferred:\n" ^ string_of_term t)
26739
947b6013e863 different handling of eq class for nbe
haftmann
parents: 26064
diff changeset
   455
    |> check_tvars
25101
cae0f68b693b now employing dictionaries
haftmann
parents: 25098
diff changeset
   456
    |> tracing (fn t => "---\n")
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   457
  end;
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   458
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   459
(* evaluation oracle *)
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   460
30947
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   461
fun add_triv_classes thy = curry (Sorts.inter_sort (Sign.classes_of thy))
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   462
  (Code_Unit.triv_classes thy);
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   463
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   464
fun mk_equals thy lhs raw_rhs =
26747
f32fa5f5bdd1 moved 'trivial classes' to foundation of code generator
haftmann
parents: 26739
diff changeset
   465
  let
30947
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   466
    val ty = Thm.typ_of (Thm.ctyp_of_term lhs);
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   467
    val eq = Thm.cterm_of thy (Term.Const ("==", ty --> ty --> propT));
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   468
    val rhs = Thm.cterm_of thy raw_rhs;
dd551284a300 re-engineering of evaluation conversions
haftmann
parents: 30942
diff changeset
   469
  in Thm.mk_binop eq lhs rhs end;
26747
f32fa5f5bdd1 moved 'trivial classes' to foundation of code generator
haftmann
parents: 26739
diff changeset
   470
30942
1e246776f876 diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents: 30672
diff changeset
   471
val (_, raw_norm_oracle) = Context.>>> (Context.map_theory_result
31064
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   472
  (Thm.add_oracle (Binding.name "norm", fn (thy, naming, program, vsp_ty_t, deps, ct) =>
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   473
    mk_equals thy ct (normalize thy naming program vsp_ty_t deps))));
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   474
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   475
fun norm_oracle thy naming program vsp_ty_t deps ct =
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   476
  raw_norm_oracle (thy, naming, program, vsp_ty_t, deps, ct);
30942
1e246776f876 diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents: 30672
diff changeset
   477
31064
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   478
fun no_frees_conv conv ct =
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   479
  let
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   480
    val frees = Thm.add_cterm_frees ct [];
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   481
    fun apply_beta free thm = Thm.combination thm (Thm.reflexive free)
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   482
      |> Conv.fconv_rule (Conv.arg_conv (Conv.try_conv (Thm.beta_conversion false)))
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   483
      |> Conv.fconv_rule (Conv.arg1_conv (Thm.beta_conversion false));
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   484
  in
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   485
    ct
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   486
    |> fold_rev Thm.cabs frees
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   487
    |> conv
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   488
    |> fold apply_beta frees
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   489
  end;
30942
1e246776f876 diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents: 30672
diff changeset
   490
31064
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   491
fun no_frees_rew rew t =
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   492
  let
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   493
    val frees = map Free (Term.add_frees t []);
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   494
  in
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   495
    t
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   496
    |> fold_rev lambda frees
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   497
    |> rew
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   498
    |> (fn t' => Term.betapplys (t', frees))
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   499
  end;
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   500
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   501
val norm_conv = no_frees_conv (fn ct =>
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   502
  let
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   503
    val thy = Thm.theory_of_cterm ct;
31064
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   504
  in Code_Thingol.eval_conv thy (add_triv_classes thy) (norm_oracle thy) ct end);
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   505
31064
ce37d8f48a9f treat frees driectly by the LCF kernel
haftmann
parents: 31049
diff changeset
   506
fun norm thy = no_frees_rew (Code_Thingol.eval thy (add_triv_classes thy) I (normalize thy));
24839
199c48ec5a09 step towards proper purge operation
haftmann
parents: 24713
diff changeset
   507
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   508
(* evaluation command *)
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   509
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   510
fun norm_print_term ctxt modes t =
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   511
  let
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   512
    val thy = ProofContext.theory_of ctxt;
30970
3fe2e418a071 generic postprocessing scheme for term evaluations
haftmann
parents: 30947
diff changeset
   513
    val t' = norm thy t;
24839
199c48ec5a09 step towards proper purge operation
haftmann
parents: 24713
diff changeset
   514
    val ty' = Term.type_of t';
26952
df36f4c52ee8 command 'normal_form': proper context via Variable.auto_fixes;
wenzelm
parents: 26931
diff changeset
   515
    val ctxt' = Variable.auto_fixes t ctxt;
24634
38db11874724 simplified PrintMode interfaces;
wenzelm
parents: 24612
diff changeset
   516
    val p = PrintMode.with_modes modes (fn () =>
26952
df36f4c52ee8 command 'normal_form': proper context via Variable.auto_fixes;
wenzelm
parents: 26931
diff changeset
   517
      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
   518
        Pretty.str "::", Pretty.brk 1, Pretty.quote (Syntax.pretty_typ ctxt' ty')]) ();
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   519
  in Pretty.writeln p end;
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   520
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   521
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   522
(** Isar setup **)
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   523
24508
c8b82fec6447 replaced ProofContext.read_term/prop by general Syntax.read_term/prop;
wenzelm
parents: 24493
diff changeset
   524
fun norm_print_term_cmd (modes, s) state =
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   525
  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
   526
  in norm_print_term ctxt modes (Syntax.read_term ctxt s) end;
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   527
30970
3fe2e418a071 generic postprocessing scheme for term evaluations
haftmann
parents: 30947
diff changeset
   528
val setup = Value.add_evaluator ("nbe", norm o ProofContext.theory_of);
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   529
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   530
local structure P = OuterParse and K = OuterKeyword in
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   531
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   532
val opt_modes = Scan.optional (P.$$$ "(" |-- P.!!! (Scan.repeat1 P.xname --| P.$$$ ")")) [];
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   533
24867
e5b55d7be9bb simplified interfaces for outer syntax;
wenzelm
parents: 24839
diff changeset
   534
val _ =
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   535
  OuterSyntax.improper_command "normal_form" "normalize term by evaluation" K.diag
28227
77221ee0f7b9 generic value command
haftmann
parents: 28054
diff changeset
   536
    (opt_modes -- P.term >> (Toplevel.keep o norm_print_term_cmd));
24155
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   537
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   538
end;
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   539
d86867645f4f nbe improved
haftmann
parents:
diff changeset
   540
end;
28337
93964076e7b8 case default fallback for NBE
haftmann
parents: 28296
diff changeset
   541