DMCA
Elements of a Relational Theory of Datatypes (1993)
| Venue: | Formal Program Development, volume 755 of Lecture Notes in Computer Science |
| Citations: | 43 - 0 self |
BibTeX
@INPROCEEDINGS{Backhouse93elementsof,
author = {Roland Backhouse and Paul Hoogendijk},
title = {Elements of a Relational Theory of Datatypes},
booktitle = {Formal Program Development, volume 755 of Lecture Notes in Computer Science},
year = {1993},
pages = {7--42},
publisher = {Springer-Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The "Boom hierarchy" is a hierarchy of types that begins at the level of trees and includes lists, bags and sets. This hierarchy forms the basis for the calculus of total functions developed by Bird and Meertens, and which has become known as the "BirdMeertens formalism". This paper describes a hierarchy of types that logically precedes the Boom hierarchy. We show how the basic operators of the Bird-Meertens formalism (map, reduce and filter) can be introduced in a logical sequence by beginning with a very simple structure and successively refining that structure. The context of this work is a relational theory of datatypes, rather than a calculus of total functions. Elements of the theory necessary to the later discussion are summarised at the beginning of the paper. 1 Introduction This paper reports on an experiment into the design of a programming algebra. The algebra is an algebra of datatypes oriented towards the calculation of polymorphic functions and relations. Its design d...
