Everything passes now.

Although there are some disturbing diagnostics
regarding type recursion during unification
which didn't happen with the old system.

src/compiler/flx_bind/flx_bbind.ml

@@ -441,8 +441,8 @@ print_endline ("\n===================\nBETA EVERYTHING \n=======================
 Flx_bsym_table.iter 
   (fun bid parent bsym ->
     let f_btype t = Flx_beta.beta_reduce "Global beta reduction" state.counter bsym_table  Flx_srcref.dummy_sr t in
-    let f_bexpr e = Flx_bexpr.map ~f_btype e in
-    let f_bexe exe = Flx_bexe.map ~f_btype exe in 
+    let rec f_bexpr e =  Flx_bexpr.map ~f_btype ~f_bexpr e in
+    let f_bexe exe = Flx_bexe.map ~f_btype ~f_bexpr exe in 
     let bbdcl = Flx_bbdcl.map ~f_btype ~f_bexe ~f_bexpr bsym.bbdcl in
     let bsym = Flx_bsym.replace_bbdcl bsym bbdcl in 
     Flx_bsym_table.update bsym_table bid bsym

src/compiler/flx_frontend/flx_numono.ml

@@ -281,6 +281,18 @@ is a virtual function. Not much is going to be kept.
     failwith "SYSTEM ERROR: monomorphisation failed"
   end;
 
+  Flx_bsym_table.iter 
+    (fun bid parent bsym ->
+      let f_btype t = Flx_beta.beta_reduce "Post Mono Global beta reduction" syms.counter bsym_table  Flx_srcref.dummy_sr t in
+      let rec f_bexpr e =  Flx_bexpr.map ~f_btype ~f_bexpr e in
+      let f_bexe exe = Flx_bexe.map ~f_btype ~f_bexpr exe in 
+      let bbdcl = Flx_bbdcl.map ~f_btype ~f_bexe ~f_bexpr bsym.bbdcl in
+      let bsym = Flx_bsym.replace_bbdcl bsym bbdcl in 
+      Flx_bsym_table.update bsym_table bid bsym
+    ) bsym_table
+  ;
+
+
   if syms.Flx_mtypes2.compiler_options.Flx_options.print_flag then 
   begin
     print_endline "";

src/compiler/flx_frontend/flx_xcoerce.ml

@@ -262,6 +262,10 @@ justified by theory, it doesn't check if, for example, that
 compact linear type transformations are actually isomorphisms, etc
 *)
 and expand_coercion new_table bsym_table counter parent remap ((srcx,srct) as srce) dstt sr =
+(*
+print_endline ("Src type " ^ Flx_print.sbt bsym_table srct);
+print_endline ("Dst type " ^ Flx_print.sbt bsym_table dstt);
+*)
   if Flx_typeeq.type_eq (Flx_print.sbt bsym_table) counter srct dstt
   then srce
   else
@@ -392,9 +396,11 @@ and process_expr new_table bsym_table counter parent sr expr =
 
 let process_exe new_table bsym_table counter parent exe =
   let sr = Flx_bexe.get_srcref exe in
-  let newexe = Flx_bexe.map ~f_bexpr:(process_expr new_table bsym_table counter parent sr) exe in
 (*
   print_endline ("Old bexe=" ^ Flx_print.sbx bsym_table exe);
+*)
+  let newexe = Flx_bexe.map ~f_bexpr:(process_expr new_table bsym_table counter parent sr) exe in
+(*
   print_endline ("New bexe=" ^ Flx_print.sbx bsym_table newexe);
 *)
   newexe

src/compiler/flx_opt/flx_opt.ml

@@ -66,7 +66,6 @@ let stack_calls syms bsym_table =
 (* Do some platform independent optimizations of the code. *)
 let optimize_bsym_table' syms bsym_table (root_proc: int option) =
   print_debug syms "//OPTIMISING";
-
   let bsym_table = print_time syms "[flx_opt]; Expanding Coercions (polymorphic)" begin fun () ->
   (* make wrappers for non-function functional values *)
   Flx_xcoerce.expand_coercions syms bsym_table end