Functional Programming Essentials
summary
Covers FP origins from Lambda calculus, Lisp and Fortran and claims the real essentials are expressions and data structures rather than category-theory jargon; demonstrates list code (length, sum, product) implemented by recursion and a single generic fold abstraction; emphasizes pure functions and immutability to avoid side effects, achieve referential transparency and make unit testing trivial; warns that the conference lists 44 concepts that could take years to learn and recommends pragmatic use of libraries like cats based on team needs.
AI-written summary · about
chapters (30)
- 0:00Intro
- 1:11Redefining Functional Programming
- 1:43Standardized Ladder of Functional Programming
- 3:00Kelley Robinson Introduction
- 3:42Overview
- 4:21Paradigm
- 5:02How do we get here
- 5:30The Lambda Calculus
- 6:41Scala
- 7:41Modern Functional Languages
- 8:33Fortran
- 9:39Logic Theory Machine
- 10:37IPL
- 12:36History Matters
- 13:50The Essentials
- 15:59Functional Programming is Stuff
- 16:51Expressions
- 19:01Side Effects
- 20:09Pure Functions
- 23:09Data Structures
- 27:48The Ladder
- 33:38Buzzer
- 34:17Learning for Learning
- 36:58Scala is not too complex
- 38:00Functional Programming in Scala
- 38:43Recursive Constants
- 39:33Make Functional Programming Easy
- 40:05Functional Programming Libraries
- 42:37Quiz
- 43:02Interview
related talks
41mFunctional programming: Give it a chance!
41mFunctional Programming for Dummies*
44mFunctional Programming You Already Know
31mA Primer on Functional Programming
42mFunctional Programming in 40 Minutes
43mFunctional programming is not just lambdas!
01h 44mFunctional Programming: Technical Reasons to Adapt
27mFunctional Programming for Pythonistas