IMPLEMENTATION OF PARALLEL DATA STRUCTURES IN BULK-SYNCHRONOUS PARALLEL ML Frederic Gava (LACL, Paris 12) A functional data-parallel language called BSML was designed for programming Bulk-Synchronous Parallel algorithms, a model of computing which allows parallel programs to be ported to a wide range of architectures. BSML is based on an extension of the ML language with parallel operations on a parallel data structure called parallel vector. The execution time can be estimated. Dead-locks and indeterminism are avoided. Many sequential algorithms do not have parallel counterparts and many non-computer science researchers do not want to deal with parallel programming. In sequential programming environments, common data structures are often provided through reusable libraries to simplify the development of applications. A parallel representation of some data structures is thus an important issue to write parallel programs without dealing with all the features of a parallel language. In this paper we describe the implementation in BSML of some important parallel data structures and show how those data types can address the needs of many potential users of parallel machines that have so far been deterred by the complexity of parallelizing code.