Combinator-based compilation of recursive functions with different parameter passing modes (Q1085601)

Wand's technique of deriving compilers from denotational semantics is applied to a block-structured language with recursive functions. The emphasis is on compilation of different parameter passing modes and a simple storage management. The technique starts by eliminating \(\lambda\)- variables from semantic equations through the introduction of special- purpose combinators. The final code consists of combinators equivalent to target-machine instructions (running-system procedures). The method enables us to derive a compiler and a running system directly from the denotational semantics of a language.