MRSC: a toolkit for building multi-result supercompilers
The paper explains the principles of multi-result supercompilation. We introduce
a formalism for representing supercompilation algorithms as rewriting rules for
graphs of congurations. Some low-level technical details related to the implementation
of multi-result supercompilation in MRSC are discussed. In particular,
we consider the advantages of using spaghetti stacks for representing graphs of configurations.