Abstract:
In an earlier paper we developed an intermediate representation for languages based on
composition, and showed how the representation could facilitate generating code for functional
languages, such as FP. In this paper we follow the same philosophical approach, using instead
the applicative language APL. Further, we show how this intermediate representation simplifies the task of generating code for highly parallel machines, such as the Connection Machine.
