We develop a specification in Natural Semantics of a compiler from the
lambda calculus with let and letrec (miniSML) to the SECD
machine. We prove that the compiler specification is correct by
simplifying the approach of Despeyroux  and changing the proof
technique to work with non-terminating semantics. We then extend the
SECD to handle lazy evaluation and outline the proof of the compiler
specification for this.
We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at email@example.com