The Boom Hierarchy

  • Alexander Bunkenburg
Part of the Workshops in Computing book series (WORKSHOPS COMP.)

Abstract

The Boom Hierarchy is the family of data structures tree, list, bag, set. By combining their properties in other ways, more data structures can be made, like mobiles. The paper defines the data structures of this extended Boom Hierarchy and shows how the functions reduce, map, and filter are applied to them.

Keywords

Bana 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bac89]
    Roland Backhouse. An exploration of the Bird-Meertens Formalism. International Summerschool on Constructive Algorithmics, Ameland 1989, September 1989.Google Scholar
  2. [Bir86]
    Richard S. Bird. An introduction to the theory of lists. In M. Broy, editor, Logic of Programming and Calculi of Discrete Design, volume F36 of NATO ASI Series. Springer Verlag, 1986.Google Scholar
  3. [Hoo92]
    Paul F. Hoogendijk. (Relational) Programming Laws in Boom Hierarchy of Types, volume 669 of Lecture Notes in Computing Science. Springer, June/July 1992.Google Scholar
  4. [Jeu92]
    Johan Jeuring. Theories for algorithm calculation. Lecture Notes of the STOP Summerschool on Constructive Algorithmics, 1, September 1992.Google Scholar
  5. [Lip76]
    Jean Lipman. Calder’s Universe. Harrison House, New York, 1976.Google Scholar
  6. [Mee86]
    Lambert Meertens. Algorithmics — towards programming as a mathematical activity. Mathematics and Computer Science, 1, 1986. CWI Monographs (J. W. de Bakker, M. Hazewinkel, J. K. Lenstra, eds.) North Holland, Puhl. Co.Google Scholar

Copyright information

© British Computer Society 1994

Authors and Affiliations

  • Alexander Bunkenburg
    • 1
  1. 1.Computing Science DepartmentUniversity of GlasgowGlasgowScotland

Personalised recommendations