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 I: Ordered Binary Trees
  • Adding Nodes to the Tree
  • Interlude: cmp combinator
  • A Function to Traverse this Structure
  • Interlude: A Set-like Datastructure
  • A Version of Tree-iter that does In-Order Traversal
  • Getting values by key
  • Tree-delete
  • Appendix: The source code.
• Treating Trees II: treestep
  • Derive the recursive function.
  • Extract the givens to parameterize the program.
  • Define treestep
  • Examples
  • Redefining the Ordered Binary Tree in terms of treestep.
  • With treegrind?
  • treegrind with step
  • Do we have the flexibility to reimplement Tree-get?
  • Putting it together
• 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