"This article continues our series on compiler development using HLVM. An example is provided that breaks the current compiler. The bug is investigated using different techniques and a well-known solution is implemented. The resulting compiler is then tested on a substantially more complicated symbolic computation and is found to obtain the correct result. Moreover, the time taken to perform this symbolic computation using HLVM is found to be very competitive despite the fact that HLVM was not at all designed for this purpose...."
To read this article and more, subscribe to The OCaml Journal today!