Home / IT & Computer Science / Coding & Programming / Functional Programming in Haskell: Supercharge Your Coding / Summary
Summary
Summary of the key concepts covered in this activity
The lambda calculus is a formal model for computation using only lambda functions. Haskell, like other functional languages, is based on the lambda calculus.
The reduction rules from the lambda calculus are used to reduce expressions in Haskell.
© University of Glasgow
This article is from the online course:
Functional Programming in Haskell: Supercharge Your Coding
Created by
This article is from the free online
Functional Programming in Haskell: Supercharge Your Coding
