Home / IT & Computer Science / Coding & Programming / Functional Programming in Haskell: Supercharge Your Coding / Summary
Summary
Summary of the key concepts covered in this activity
© University of Glasgow
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
Reach your personal and professional goals
Unlock access to hundreds of expert online courses and degrees from top universities and educators to gain accredited qualifications and professional CV-building certificates.
Join over 18 million learners to launch, switch or build upon your career, all at your own pace, across a wide range of topic areas.
