- Full text PDF available (1)
- This year (0)
- Last 5 years (0)
- Last 10 years (0)
Journals and Conferences
Benkard explains the precedence rules of APL with a syntactic binding hierarchy [1,2]. This paper uses the hierarchy as a basis for developing a more formal description of APL syntax which can be applied directly in a syntax analyzer. The flexibility of this approach makes it useful as a basis for examining the effect of proposed syntax changes and the… (More)
In any stored-program computer system, information is constantly transferred between the memory and the instruction processor. Machine instructions are a major portion of this traffic. Since transfer bandwidth is a limited resource, inefficiency in the encoding of instruction information (low code density) can have definite hardware and performance costs.… (More)
A pure functional notation for defining APL objects is described, and constructed with previous work in this area. The notation is extended to address both theoretical and pragmatic programming considerations. The notation is compatible with existing implementations, and is shown to straightforwardly incorporate popular extensions to the language.