Distributed Applicative Arrays

H. Kuchen, G. Geiler

	   Lists, the typical data structures of functional programming
	   languages, force a strictly sequential computation of
	   their elements and hence are badly suited for parallel
	   implementations. Some other applicative data structures are
	   proposed, which are appropriate for implementations of such
	   languages on loosely coupled multiprocessor systems. Besides
	   so called sequences, i.e. list-like structures internally
	   represented by binary trees, we mainly consider a distributed
	   applicative version of arrays. Some experimental results
	   allow a comparison of those data structures.