Abstract
In previous chapters I introduced several of the pillars of Haskell programming: the pure functional paradigm and the strongly typed nature of the language, which nevertheless allows powerful type constructs such as parametric polymorphism and type classes. This chapter will be devoted to understanding the unique evaluation model of Haskell, based on laziness, and the consequences of that choice.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Alejandro Serrano Mena
About this chapter
Cite this chapter
Mena, A.S. (2014). Laziness and Infinite Structures. In: Beginning Haskell. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4302-6251-0_5
Download citation
DOI: https://doi.org/10.1007/978-1-4302-6251-0_5
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4302-6250-3
Online ISBN: 978-1-4302-6251-0
eBook Packages: Professional and Applied ComputingProfessional and Applied Computing (R0)Apress Access Books