Abstract
In Haskell, the type system is quite detailed. From a theoretical point of view, it comes from typed Lambda calculus, introduced in 1930 by Alfonso Church,, where the types are automatically deducted from the way the objects are processed. Such programming languages are statically typed. More precisely, the processing is enforced by and based on the rules of a mathematical type system.
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
Notes
- 1.
Alfonso Church, https://en.wikipedia.org/wiki/Alonzo_Church
- 2.
Lambda calculus, https://en.wikipedia.org/wiki/Lambda_calculus
- 3.
- 4.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Stefania Loredana Nita and Marius Mihailescu
About this chapter
Cite this chapter
Nita, S.L., Mihailescu, M. (2019). Static Typing. In: Haskell Quick Syntax Reference. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-4507-1_2
Download citation
DOI: https://doi.org/10.1007/978-1-4842-4507-1_2
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-4506-4
Online ISBN: 978-1-4842-4507-1
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)