A World Without Assignment

on YouTube ↗31m

" summary

Demonstrates that Ruby and Scheme solve common problems without mutation by using recursion, lists, anonymous functions and function composition, with no assignment and explicit avoidance of set! or =. Shows factorial, Fibonacci and an exponent helper using tail-call optimization to avoid deep stacks, builds a scheme and Ruby implementation of the classic coin count-change = 292 for a dollar, and reports the Ruby version runs correctly while the Scheme version reads more concise.

AI-written summary · about

" chapters (10)

1. 0:00Intro
2. 2:47Functional Programming
3. 3:29No Assignment
4. 4:11Why Functional
5. 6:15Scheme 101
6. 11:54Recursion
7. 13:03Tail Call Optimization
8. 15:51Making Change
9. 16:18Writing an Example
10. 23:57More Functions

" related talks

• 29mA World Without AssignmentAja Hammerly · RubyConf 2014
• 53mY Not- Adventures in Functional ProgrammingJim Weirich · RubyConf 2012
• 33mBetter Ruby through Functional ProgrammingDean Wampler · RubyConf 2008
• 41m4 Programming Paradigms in 45 minutesAja Hammerly · RubyHACK 2018
• 47mExtreme Object-Oriented RubyJohn Cinnamond · Full Stack Fest 2015
• 43mFunctional Programming and RubyPat Shaughnessy · GoRuCo 2013
• 32mStupid Ruby TricksMike Moore · Ruby on Ales 2015
• 31mSide-effects are not your friendRyan Lemmer · Rubyfuza 2013