We present an approach to compiler implementation using Oliveira and Cook’s structured graphs that avoids the use of explicit jumps in the generated code. The advantage of our method is that it takes the implementation of a compiler using a tree type along with its correctness proof and turns it into a compiler implementation using a graph type along with a correctness proof. The implementation and correctness proof of a compiler using a tree type without explicit jumps is simple, but yields code duplication. Our method provides a convenient way of improving such a compiler without giving up the benefits of simple reasoning.
|Titel||Functional and Logic Programming|
|Redaktører||Michael Codish, Eijiro Sumii|
|Forlag||Springer International Publishing, Switzerland|
|Publikationsdato||1 jun. 2014|
|Status||Udgivet - 1 jun. 2014|
- compiler,verification,graphs,fold,free monad