Essays about Programming in Joy

These essays are adapted from Jupyter notebooks. I hope to have those hosted somewhere where people can view them “live” and interact with them, possibly on MS Azure. For now, Sphinx does such a great job rendering the HTML that I am copying over some notebooks in ReST format and hand-editing them into these documents.

• Developing a Program in Joy
  • Project Euler, first problem: “Multiples of 3 and 5”
  • Generator Version
  • A little further analysis renders iteration unnecessary.
  • The Simplest Program
• Replacing Functions in the Dictionary
  • A long trace
  • Replacing size with a Python Version
  • A shorter trace
• Treating Trees
  • A Function to Traverse a BTree
  • Adding Nodes to the BTree
  • Interlude: The cmp combinator
  • Interlude: Factoring and Naming
  • A Version of BTree-iter that does In-Order Traversal
  • Getting values by key
  • TODO: BTree-delete
  • Tree with node and list of trees.
  • Miscellaneous Crap
  • A General Form for Trees
  • Automatically deriving the recursion combinator for a data type?
• Newton’s method
  • A Generator for Approximations
  • Finding Consecutive Approximations within a Tolerance
  • Finding Square Roots
• Quadratic formula
  • Write a program with variable names.
  • Derive a definition.
• No Updates
• Categorical Programming