https://docs.python.org/3/whatsnew/3.10.html#pep-634-structural-pattern-matching
"PEP 636 -- Structural Pattern Matching: Tutorial"
https://www.python.org/dev/peps/pep-0636/
"Computational Fairy Tales: Computer science concepts as told through fairy
tales."
I've since done it in hoon, taught as "martian computing" at University of
Illinois.
https://github.com/davis68/martian-computing
Hoon version:
https://flic.kr/p/2mKTPas
(base) Kirbys-MacBook-Pro:base mac$ cd gen
(base) Kirbys-MacBook-Pro:gen mac$ cat crystalball.hoon
!:
:: Crystal Ball
Actually what does that look like with a stack within one function call? Is
it always possible to write recursive functions with a stack (in order to
avoid and the function call overhead (which includes a locals() dict on a
stack anyway for every function call))
"Why is a function/method call
