Skip to main content
SpringerLink
Log in

The Boom Hierarchy

  • Chapter
Functional Programming, Glasgow 1993

Part of the book series: Workshops in Computing ((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.

Supported by a postgraduate research studentship from the Science and Engineering Research Council

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Roland Backhouse. An exploration of the Bird-Meertens Formalism. International Summerschool on Constructive Algorithmics, Ameland 1989, September 1989.

    Google Scholar 

  2. 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. 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. Johan Jeuring. Theories for algorithm calculation. Lecture Notes of the STOP Summerschool on Constructive Algorithmics, 1, September 1992.

    Google Scholar 

  5. Jean Lipman. Calder’s Universe. Harrison House, New York, 1976.

    Google Scholar 

  6. 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 

Download references

Author information

Authors and Affiliations

  1. Computing Science Department, University of Glasgow, Glasgow, Scotland

    Alexander Bunkenburg

Authors
  1. Alexander Bunkenburg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science, The University, Glasgow, G12 8QQ, Scotland

    John T. O’Donnell PhD  & Kevin Hammond PhD  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1994 British Computer Society

About this chapter

Cite this chapter

Bunkenburg, A. (1994). The Boom Hierarchy. In: O’Donnell, J.T., Hammond, K. (eds) Functional Programming, Glasgow 1993. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3236-3_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3236-3_1

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19879-6

  • Online ISBN: 978-1-4471-3236-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation