Compiling a subset of APL into a typed intermediate language

TY - GEN

T1 - Compiling a subset of APL into a typed intermediate language

AU - Elsman, Martin

AU - Dybdal, Martin

PY - 2014/6/9

Y1 - 2014/6/9

N2 - We present a compiler and a typed intermediate language for a subset of APL. The intermediate language treats all numeric data as multi-dimensional arrays and the type system makes explicit the ranks of arrays. Primitive operators are polymorphic in rank and in the type of the underlying data operated on. The frontend of the APL compiler deals with much of the gory details of the APL language, including infix resolution, resolution of identity items for reduce operations, resolution of default element values for empty arrays, scalar extensions, and resolution of certain kinds of overloading. We demonstrate the usefulness of the intermediate language by showing that it can be compiled efficiently, using known techniques, such as delayed arrays, into a C-like language. We also demonstrate that the language is sufficiently expressive that some primitive operators, such as APL's inner product operator, which works on arrays of arbitrary dimensions, can be compiled using more primitive operators..

AB - We present a compiler and a typed intermediate language for a subset of APL. The intermediate language treats all numeric data as multi-dimensional arrays and the type system makes explicit the ranks of arrays. Primitive operators are polymorphic in rank and in the type of the underlying data operated on. The frontend of the APL compiler deals with much of the gory details of the APL language, including infix resolution, resolution of identity items for reduce operations, resolution of default element values for empty arrays, scalar extensions, and resolution of certain kinds of overloading. We demonstrate the usefulness of the intermediate language by showing that it can be compiled efficiently, using known techniques, such as delayed arrays, into a C-like language. We also demonstrate that the language is sufficiently expressive that some primitive operators, such as APL's inner product operator, which works on arrays of arbitrary dimensions, can be compiled using more primitive operators..

U2 - 10.1145/2627373.2627390

DO - 10.1145/2627373.2627390

M3 - Article in proceedings

SN - 978-1-4503-2937-8

SP - 101

EP - 106

BT - Proceedings of ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming (ARRAY’14)

PB - Association for Computing Machinery

T2 - ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming 2014

Y2 - 12 June 2014 through 13 June 2014

ER -