LIST PROCESSING PRIMITIVES FOR PARALLEL COMPUTATION
UNSPECIFIED. (1993) LIST PROCESSING PRIMITIVES FOR PARALLEL COMPUTATION. COMPUTER LANGUAGES, 19 (1). pp. 1-17. ISSN 0096-0551Full text not available from this repository.
A new model of list processing is proposed which is more suitable as a basic data structure for architecture-independent programming languages than the traditional model of lists. Its main primitive functions are: concatenate, which concatenates two lists; split, which partitions a list into two parts; and length, which gives the number of elements in a list. This model contains a degree of non-determinism which allows greater freedom to the implementation to achieve high performance on both parallel and serial architectures.
|Item Type:||Journal Article|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Journal or Publication Title:||COMPUTER LANGUAGES|
|Publisher:||PERGAMON-ELSEVIER SCIENCE LTD|
|Number of Pages:||17|
|Page Range:||pp. 1-17|
Actions (login required)