Scheme Lisp: Feel the Cool
summary
Claims that Scheme is “the best language” get tested with concrete examples: the one-line syntax of s-exprs, building lists from cons/car/cdr pairs, recursion to implement sum and sort, higher-order functions like map and an apply-twice example, and lambda closures used to make counters holding state. The demo shows eval/quote for code-as-data, homemade cons/car implemented with functions, and Church-style numbers built from functions — all executed in the REPL to prove they work.
AI-written summary · about
chapters (7)
- 0:00Introduction to Scheme
- 1:07How simple Scheme is
- 16:59How weird Scheme is
- 29:30Recursion and functions
- 42:02How cool Scheme is
- 1:05:11Advanced Scheme concepts
- 1:19:32Conclusion and resources
related talks
43mAn Imperishable Wonderland of Infinite Fun
58mKeynote: Why Functional Programming Matters
41mChoosing Your Next Programming Language
40mFun with Functional Programming in Clojure
44mFunctional Programming You Already Know
36mConcrete Functional Programming
06mInterview
48mIt’s birds all the way down: Fun Introduction to Lambda Calculus