Risorsa Analitica di Monografia

After a short review of some data structures proposed by traditional functional languages, some requirements that a data structuring primitives should meet for suitable implementation on parallel architectures are introduced; the drawbacks of the classic list data structure are evidenced and consequently two alternative structures are proposed; the first is based on unordered collection of objects (and hereafter called bag ): its formal definition is given and the non–determinism of the related primitive operators are discussed; the second, limited function , is a way for defining functions over finite and countable domains: its significant implications, mainly related with parallel architectures, are described