Certainly the costs are different, but I don't see why the end result is necessarily slower. You save a lot of time by avoiding allocations and unnecessary copying. You could do the same with a low-level interface, but not with the same degree of safety.
Sandro Pal-Kristian Engstad wrote: > Sandro Magi wrote: >> You could always compose lifted computations. So arithmetic would >> operate on and produce lifted expressions instead of actual values. >> > You could, but it would most likely be death to your performance. This > issue is probably the main cause for arrays in OCaml being mutable. > > PKE. > _______________________________________________ bitc-dev mailing list [email protected] http://www.coyotos.org/mailman/listinfo/bitc-dev
