Busting the Func'ing Jargon
summary
Walks through concrete F# examples: immutable record value updates (with copy syntax), lists built with cons, and the claim that all functions are curried by default in F#. Implements summing, filtering and reversing a list, shows naive recursion blows the stack on large inputs and rewrites them as tail recursion with an accumulator to avoid overflow, then factors those patterns into a single fold implementation so sum/filter/reverse become one reusable, tested-friendly pattern.
AI-written summary · about
chapters (25)
- 0:00Introduction
- 1:13What is Functional Programming
- 3:18Jargon
- 4:35Immutability
- 5:11Record Types
- 8:21Bindings
- 9:23Pure vs impure functions
- 11:25impure function example
- 13:52referential transparency
- 17:19functions as firstclass values
- 18:36currying
- 20:47partial application
- 21:42partial application example
- 25:49algebraic data types
- 27:18some types
- 29:20value semantics
- 32:05Recursion
- 35:46Match Expressions
- 40:43Tail Recursion
- 44:42Reverse Immutable Lists
- 47:49Folding Lists
- 51:17Folding in C
- 51:41Summary
- 53:46Resources
- 55:19Questions
