Recursion: See Recursion. @TeaLeavesProgramming
Recursion: See Recursion.  @TeaLeavesProgramming
Uploaded November 2025 | Updated November 2026, 3 hours ago
We work some selected exercises from Problem Set 3a of the MOOC at http://haskell.mooc.fi. Specifically, this problem set focuses on writing "bare" recursive functions without using higher order helpers.

Join this channel to get access to perks; the "Thanks, peterb!" tier is a great way to show your support without breaking the bank, and the "Early Access" tier gets you access to most of my videos about a week early.

youtube.com/channel/UCd7i-ppmXgznXLKf-HsB2QQ/join
Recursion: See Recursion.Know When To Fold Em: Haskell MOOC Set 4bQED, the Propositional Logic Game, Part 2Lets Play The Fools Errand, Part 10Wizardry: The Five Ordeals Part 3Haskell for Dilettantes, Part 3b: Homework 1, Exercise 2Haskell For Dilettantes 17: finishing ApplicativeWizardry: The Murphys Ghost TrickFPGA on Mac: What About VHDL?TR-49 (A No-Spoilers Review)Haskell For Dilettantes 6a: Homework 2, Exercise 1This Option Will Change How You Play Wizardry: The Five Ordeals
Tea Leaves |

Recursion: See "Recursion".

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER