Titlebook: Arrays, Functional Languages, and Parallel Systems; Lenore M. R. Mullin,Michael Jenkins,Guang Gao Book 1991 Springer Science+Business Medi

Sigmoidoscopy

Alternative Evaluation of Array Expressions,ide three forms of array element evaluation: eager, latched, and lazy. Second, a method is described for efficiently applying lazy evaluation to . array expressions, not just grid selections. A rule based system is used to transform symbolic representations of arrays that use functions of index vectors.

裂口

Decimate

SAGE

Arrays and The Lambda Calculus,s with arrays and in their implementations are manifold. They can be classified according to 1) first principles, 2) semantics, 3) pragmatics, and 4) performance. This paper attempts to give an outline of the issues in this area, and their relation to the lambda calculus. The lambda calculus is a fo

–FER

Compiling APL,d ., targeted at the Cray X-MP. and the Thinking Machines Connection Machine CM2.. . used a number of advanced features of APL, including recursive data structures (boxed arrays) and the rank adverb, which considerably simplified the effort required to produce the compiler. The use of APL allowed th

CLIFF

有機體

Compiling Issues of Monolithic Arrays,icular, the scheduling of code blocks (or loops) defining monolithic arrays on a pipelined dataflow computer is studied. A general framework for fine-grain code scheduling in pipelined machines is developed which addresses both time and space efficiency simultaneously for loops typically found in ge

OTTER

Arrays in Sisal,e-scale scientific applications. Since arrays are an indispensable data structure for such applications, the designers of Sisal included arrays and a robust set of array operations in the language definition. In this paper, we review and evaluate those design decisions in light of the first Sisal co

蕁麻

CHAR

A Parallel Intermediate Representation based on Lambda Expressions,uage systems. We introduce two simple extensions to the lambda calculus that describe potentially parallel computations. These extensions permit us to use the lambda calculus as an intermediate form for languages that operate on large data items as single entities, such as FP or APL. We conclude by