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. keywords: code generation, vector machines, applicative and functional languages 1 Introduction In an earlier paper [Bud88b] we introduced an intermediate representation specifically designed for use with languages based on composition. Examples of such languages include functional languages, such as FP [Bac78], and applicative languages, such as APL [Ive80]. We then argued that it was not only easy to convert from such languages into this representation, but also easy to generate actual machine code from the representation. The ear...

Citations