20250406

• reviewed review comments on my pull request I created yesterday
  • Even if it does not provide me with much experience, it has been a good exercise to train my brain.
• 30 minutes walk
• The Algebra of Wealth
• chest press, lat pull down, kettle lift, arm curl
• journaling

Quick Look: Tail Call Optimization

Tail recursion - HaskellWiki

In imperative languages, recursive function calls typically build up the call stack, which can lead to high memory usage. Functional languages often support tail call optimization, allowing a specific type of recursive functions (tail-recursive ones) to execute without growing the call stack, making them more memory-efficient.

TODO:

• Bring books from my parents’ house (20250411)
• Get a new sticker for my car (20250411)
• Browse PEP 484 - Type Hints
• DMV appointment (20250513 12:20 pm) @ San Jose

index 20250405 20250407