Why I Like Functional Programming
summary
Functional programming claims: referential transparency lets algebraic reasoning replace mutable state. Concrete wins: a binary‑tree insert shrinks from imperative loops to a few Scala lines; random generators use the state monad to return (value,nextState) instead of mutating seeds; effects become values via Option/Either/Task/IO so composition and testing get simple. A real bug arises from Scala futures that start running on creation, fixed by switching to task semantics. Libraries named: Cats Scalaz Monocle Doobie http4s fs2.
AI-written summary · about
chapters (15)
- 0:00Intro
- 0:28UC Santa Barbara
- 2:54Physics
- 4:14Example
- 6:17Changing Major
- 8:47Functional Programming Definition
- 10:17Type Signature
- 14:57Quadratic Equation
- 16:26Fetch Data
- 19:52Separation of Concerns
- 21:17Option Datatype
- 24:52Functors
- 28:49Lens
- 34:40Modify
- 40:34Averse Traverse
related talks
28mHow to Get Started With Functional Programming
45mThe Structure of Programming Revolutions
41mHow to Get People Excited about Functional Programming
42mIntroducing A Functional Language At Work
01h 00mIntro to FP in Scala: Exploring a Toolbox for Solving Problems - Part 1 of 6
20mBreaking the entry barriers: making the scary keywords accessible.
29mScala for Everyone
39mTyped FP on the Job Why Bother