From Javascript to Haskell : Functional Programming made simple

An introduction to functional programming concepts like currying, closures, and referential transparency by refactoring imperative JavaScript to Haskell.

Did you ever had a colleague that said «Well, it's simple. I just used a partial application on that curried function using higher order functions and closures» ? Did you understand anything ? If not, then that talk is what you are looking for. Functional programming uses a lot of concepts that are familiar to mathematicians. And that's scary ! But, applied to computing, it's actually pretty simple ! While live coding a refactoring that transforms a imperative code to a functional one, main concepts of functional programming will be introduced when necessary and explained deeply. At the end of this talk, you will understand these key concepts : - Referential transparency - Functions as first class citizens - Higher order functions - Closures - Lambda calculus - Currying - Partial application - Function composition - «Point-free» notation Follow the code step by step : github.com/FaustXVI/functional-programming-introduction/tree…