Loved the in-depth coverage and explanations. I thought the visualizations were very nice.
I didn't find any technical issues - just maybe some stuff I noticed that you may or may not want to include:
The final sum PTC refactor differs in that it now returns undefined rather than 0 for an empty list. In fancy terms, we've removed the identity element, making it a semigroup operation rather than a monoidal one, which means we've lost safety.
The fib ptc/continutation refactor exploits the closure equivalence you explain in ch7: x is eq to () => x. Which i think is super neat and is the basis of many FP optimizations and amounts to (i think) a left kan extension in category theory.
Small typo we likely we'll need to use => we'll likely need to use
So hell yes. This was my favorite chapter so far!
Loved the in-depth coverage and explanations. I thought the visualizations were very nice.
I didn't find any technical issues - just maybe some stuff I noticed that you may or may not want to include:
The final sum PTC refactor differs in that it now returns
undefinedrather than0for an empty list. In fancy terms, we've removed the identity element, making it a semigroup operation rather than a monoidal one, which means we've lost safety.The fib ptc/continutation refactor exploits the closure equivalence you explain in ch7:
xis eq to() => x. Which i think is super neat and is the basis of many FP optimizations and amounts to (i think) a left kan extension in category theory.Small typo
we likely we'll need to use=>we'll likely need to useThat's it!