The Library
List processing in parallel languages
Tools
Axford, T. H. and Joy, Mike (1993) List processing in parallel languages. University of Warwick. Department of Computer Science. (Department of Computer Science Research Report). (Unpublished)
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Abstract
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: | Report | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software | ||||
Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science | ||||
Series Name: | Department of Computer Science Research Report | ||||
Publisher: | University of Warwick. Department of Computer Science | ||||
Official Date: | 1993 | ||||
Dates: |
|
||||
Number: | Number 219 | ||||
DOI: | CS-RR-219 | ||||
Institution: | University of Warwick | ||||
Theses Department: | Department of Computer Science | ||||
Status: | Not Peer Reviewed | ||||
Publication Status: | Unpublished | ||||
Reuse Statement (publisher, data, author rights): | T.H. Axford and M.S. Joy, “List Processing Primitives for Parallel Computation”, <i>Computer Languages</i> <b>19</b>(1), pp. 1-17 (1993) | ||||
Related URLs: |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |