Abstract
Because of the generality and flexibility of the data structures that we developed in Chapter 3, many common computational procedures can be implemented as operations on such structures, either to build additional structures meeting some interesting constraint, or to enumerate such additional structures. The branch of mathematics that deals with these operations is called combinatorics. In this chapter, we’ll see the algorithms that our tool kit provides for expressing such operations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer-Verlag GmbH Germany, part of Springer Nature
About this chapter
Cite this chapter
Stone, J.D. (2018). Combinatorial Constructions. In: Algorithms for Functional Programming. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-57970-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-57970-1_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-57968-8
Online ISBN: 978-3-662-57970-1
eBook Packages: Computer ScienceComputer Science (R0)