## An introduction to the theories of bulk data types (1994)

Citations: | 1 - 0 self |

### BibTeX

@TECHREPORT{Dobson94anintroduction,

author = {Simon Dobson},

title = {An introduction to the theories of bulk data types},

institution = {},

year = {1994}

}

### OpenURL

### Abstract

This note summarises my understanding to date of two closely-related theories for dealing with “bulk ” data types: the Bird-Meertens formalism (henceforth abbreviated to BMF) and its extension in categorical data types (CDT). I've been led to this study for two reasons: as interesting formalisms for program derivation in their own right, and as a possible basis for defining useful operations for shared abstract data types. In this note I cover all the essential ideas I've found so far, and include a bibliography of the theories. Overview specifications using a small number of higher-order constructs. Functions are expressed as combinations of functions over data structures, avoiding the explicit use of recursion. This both simplifies proofs of correctness and allows the possibility for efficient (possibly parallel) implementation of the combination operators over a range of data types. A small-scale theory leads to potentially large-scale applications. The theory does not, however, start from a standpoint of immediate mechanisation. To do so, in Bird and Meertens ' view, would severely limit the many ways in which an