Abstract
In addition to the simple values that we’ve encountered so far, many of the algorithms that we’ll study operate on composite values, data structures, that contain other values as components and provide specific kinds of access to those other values. Scheme provides a few kinds of data structures as primitive (including lists, which we have also encountered above).
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). Data Structures. In: Algorithms for Functional Programming. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-57970-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-57970-1_3
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)