List processing primitives for parallel computation

Authors:
Tom Axford;Mike Joy
Affiliations:
School of Computer Science, University of Birmingham, Birmingham B15 2TT, U.K.;Department of Computer Science, University of Warwick, Coventry CV4 7AL, U.K.
Venue:
Computer Languages
Year:
1993

Citing 7
Cited 0

Miranda: a non-strict functional language with polymorphic types

Proc. of a conference on Functional programming languages and computer architecture
Functional programming using standard ML

Functional programming using standard ML
Parallel implementations of functional programming languages

The Computer Journal - Special issue on Lazy functional programming
Convex hulls of finite sets of points in two and three dimensions

Communications of the ACM
An elementary language construct for parallel programming

ACM SIGPLAN Notices
A micro-manual for LISP - not the whole truth

ACM SIGPLAN Notices - Special issue: History of programming languages conference
History of LISP

ACM SIGPLAN Notices - Special issue: History of programming languages conference

Quantified Score

Hi-index	0.00

Visualization

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.