Down the Oregon Trail with Functional C#
summary
Reimplements the 1975 Oregon Trail in C# as a playable, testable system, claiming near 100% unit test coverage and enforcing no mutable variables and almost no statements. Uses records, extension methods and an abstract-type “maybe/operation” pattern to model input/output, a trampolined iterateUntil to replace loops, and tiny monad-like flows to stop processing when the party dies. Recreates hunting minigame (type “bang” timing), inventory and turn logic and it runs end-to-end.
AI-written summary · about
chapters (9)
- 0:00Introduction
- 1:52Functional programming
- 12:52Why FP matters
- 23:45Oregon Trail history
- 30:27User interaction
- 43:48Inventory management
- 53:44Game state
- 58:42Game events
- 1:00:06Future projects
related talks
01h 02mDown the Oregon Trail with Functional C#
49mRefactoring toward a more functional style in F#
58mFunctional Programming with C#
01h 09mFunctional Programming with C#
53mLet's Have Some Fun with Game Of Life:& Learn to Think Functionally Along the Way
01h 08mThinking Functionally with C#
01h 47mFunctional C++
36mBack to the Future: How 80s Arcade Games Taught me Clojure