Learn · Introduction To Lambda Calculus
Lecture 10 of 20Week 2
Haskell: A Brief Introduction
Prof. Rajdeep Niyogi · IIT Roorkee
Credits and licence
- From
- Introduction To Lambda Calculus, IIT Roorkee (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- Foundations of Lambda Calculus
- Syntax of Lambda Calculus
- Free Variable, Scope, and Reduction
- Normal Forms
- Encoding if-then-else and Recursion
- Combinators and Recursive Functions
- Church numerals and design of some functions
- Encoding Boolean Operations and Standard Combinators
- Data Structures in Lambda Calculus
- Haskell: A Brief Introduction
- Type and Type Systems
- Typed Lambda Calculus
- A Formal Type Assignment System
- The structure of a term, a TA𝜆 deduction, and a type
- Restricted Lambda Terms and Type Safe
- Term Unification
- Principal Type Algorithm
- Curry-Howard Correspondence I
- Curry-Howard Correspondence-II
- Strong Polymorphic Types