A set of lairs for data parallel assignment is outlined. The laws illustrate the mathematical tractability of this programming construct and provide a means of correctly transforming a complex assignment into a sequence of simpler assignments which m~v then be interpreted on a variety of parallel architectures.