## Mapping Adl to the Bird-Meertens Formalism (1994)

Citations: | 1 - 1 self |

### BibTeX

@TECHREPORT{Alexander94mappingadl,

author = {Brad Alexander},

title = {Mapping Adl to the Bird-Meertens Formalism},

institution = {},

year = {1994}

}

### OpenURL

### Abstract

Bulk data operations such as map and reduce are an elegant medium for expressing repetitive computation over aggregate data structures. They also serve as a tool for abstraction: not all details of the computation, such as the exact ordering of the constituent operations, need to be specified by the programmer. A precise description of the behaviour of the bulk data operator is the preserve of the language implementor. If the implementation of these operators is parallel then they become a medium for expressing implicit data parallelism. There is a large body of work formally the relating bulk data operators to each other and to their underlying data types. Much of this research stems from Category Theory where a number of general properties of types and operators have been established. One theoretical framework in particular, the Bird-Meertens Formalism (BMF), has proved to be extremely useful. The BMF theory of a type provides a set of operators on that type and a set of algebraic id...