3 ms·
First of all — way faster machine code. Many other things are features or bugs depending of your preferences. For me, for example, eager evaluation is a big im
by yashrk 3y ago
First of all — way faster machine code.
Many other things are features or bugs depending of your preferences. For me, for example, eager evaluation is a big improvement, but YMMV.
- tromp 3y ago> eager evaluation is a big improvement Does it have any support for laziness? E.g. could one define the list of all fibonacci numbers similarly to Haskell's fib = let f a b = a : f b (a+b) in f 0 1
- satvikpendem 3y agoHow does it compare to HVM [0]? It is an alternative to GHC that in some cases is orders of magnitudes faster, at least from their benchmarks. [0] https://github.com/HigherOrderCO/hvm https://github.com/HigherOrderCO/hvm
- weatherlight 3y agoi thought the orders of magnitudes faster benchmarks were around lazy evaluation, and probably wouldn't apply here.
- tkz1312 3y agoRoc uses perceus, which is a reference counting model that allows for opportunistic in place mutation if it is safe to do so. HVM is more like a fundamentally new evaluation model that is parallel by default. They are both very exciting, but HVM is much more radical and probably needs at least a few more years until it starts to be seriously practical.