Part of the book series:Workshops in Computing ((WORKSHOPS COMP.))
88Accesses
7Citations
Abstract
The Boom Hierarchy is the family of data structurestree, 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 functionsreduce, map, andfilter 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
Subscribe and save
- Get 10 units per month
- Download Article/Chapter or eBook
- 1 Unit = 1 Article or 1 Chapter
- Cancel anytime
Buy Now
- Chapter
- JPY 3498
- Price includes VAT (Japan)
- eBook
- JPY 5719
- Price includes VAT (Japan)
- Softcover Book
- JPY 7149
- Price includes VAT (Japan)
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Roland Backhouse. An exploration of the Bird-Meertens Formalism.International Summerschool on Constructive Algorithmics, Ameland 1989, September 1989.
Richard S. Bird. An introduction to the theory of lists. In M. Broy, editor,Logic of Programming and Calculi of Discrete Design, volume F36 ofNATO ASI Series. Springer Verlag, 1986.
Paul F. Hoogendijk.(Relational) Programming Laws in Boom Hierarchy of Types, volume 669 ofLecture Notes in Computing Science. Springer, June/July 1992.
Johan Jeuring. Theories for algorithm calculation.Lecture Notes of the STOP Summerschool on Constructive Algorithmics, 1, September 1992.
Jean Lipman.Calder’s Universe. Harrison House, New York, 1976.
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.
Author information
Authors and Affiliations
Computing Science Department, University of Glasgow, Glasgow, Scotland
Alexander Bunkenburg
- Alexander Bunkenburg
Search author on:PubMed Google Scholar
Editor information
Editors and Affiliations
Department of Computing Science, The University, Glasgow, G12 8QQ, Scotland
John T. O’Donnell PhD & Kevin Hammond PhD &
Rights 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
Publisher Name:Springer, London
Print ISBN:978-3-540-19879-6
Online ISBN:978-1-4471-3236-3
eBook Packages:Springer Book Archive
Share this chapter
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative