docs/sphinx_docs/_build/html/notebooks/index.html

   1
   2 <!DOCTYPE html>
   3
   4 <html>
   5   <head>
   6     <meta charset="utf-8" />
   7     <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
   8
   9     <title>Essays about Programming in Joy &#8212; Thun 0.4.1 documentation</title>
  10     <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
  11     <link rel="stylesheet" type="text/css" href="../_static/alabaster.css" />
  12     <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
  13     <script src="../_static/jquery.js"></script>
  14     <script src="../_static/underscore.js"></script>
  15     <script src="../_static/doctools.js"></script>
  16     <link rel="index" title="Index" href="../genindex.html" />
  17     <link rel="search" title="Search" href="../search.html" />
  18     <link rel="next" title="Developing a Program in Joy" href="Developing.html" />
  19     <link rel="prev" title="Type Inference of Joy Expressions" href="../types.html" />
  20
  21   <link rel="stylesheet" href="../_static/custom.css" type="text/css" />
  22
  23
  24   <meta name="viewport" content="width=device-width, initial-scale=0.9, maximum-scale=0.9" />
  25
  26   </head><body>
  27
  28
  29     <div class="document">
  30       <div class="documentwrapper">
  31         <div class="bodywrapper">
  32
  33
  34           <div class="body" role="main">
  35
  36   <section id="essays-about-programming-in-joy">
  37 <h1>Essays about Programming in Joy<a class="headerlink" href="#essays-about-programming-in-joy" title="Permalink to this headline">¶</a></h1>
  38 <p>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.</p>
  39 <div class="toctree-wrapper compound">
  40 <ul>
  41 <li class="toctree-l1"><a class="reference internal" href="Developing.html">Developing a Program in Joy</a><ul>
  42 <li class="toctree-l2"><a class="reference internal" href="Developing.html#project-euler-first-problem-multiples-of-3-and-5">Project Euler, first problem: “Multiples of 3 and 5”</a></li>
  43 <li class="toctree-l2"><a class="reference internal" href="Developing.html#generator-version">Generator Version</a></li>
  44 <li class="toctree-l2"><a class="reference internal" href="Developing.html#a-little-further-analysis-renders-iteration-unnecessary">A little further analysis renders iteration unnecessary.</a></li>
  45 <li class="toctree-l2"><a class="reference internal" href="Developing.html#the-simplest-program">The Simplest Program</a></li>
  46 </ul>
  47 </li>
  48 <li class="toctree-l1"><a class="reference internal" href="Quadratic.html">Quadratic formula</a><ul>
  49 <li class="toctree-l2"><a class="reference internal" href="Quadratic.html#write-a-straightforward-program-with-variable-names">Write a straightforward program with variable names.</a></li>
  50 <li class="toctree-l2"><a class="reference internal" href="Quadratic.html#derive-a-definition">Derive a definition.</a></li>
  51 </ul>
  52 </li>
  53 <li class="toctree-l1"><a class="reference internal" href="Replacing.html">Replacing Functions in the Dictionary</a><ul>
  54 <li class="toctree-l2"><a class="reference internal" href="Replacing.html#a-long-trace">A long trace</a></li>
  55 <li class="toctree-l2"><a class="reference internal" href="Replacing.html#replacing-size-with-a-python-version">Replacing <code class="docutils literal notranslate"><span class="pre">size</span></code> with a Python version</a></li>
  56 <li class="toctree-l2"><a class="reference internal" href="Replacing.html#a-shorter-trace">A shorter trace</a></li>
  57 </ul>
  58 </li>
  59 <li class="toctree-l1"><a class="reference internal" href="Recursion_Combinators.html">Recursion Combinators</a><ul>
  60 <li class="toctree-l2"><a class="reference internal" href="Recursion_Combinators.html#designing-recursive-functions">Designing Recursive Functions</a></li>
  61 <li class="toctree-l2"><a class="reference internal" href="Recursion_Combinators.html#primitive-recursive-functions">Primitive Recursive Functions</a></li>
  62 <li class="toctree-l2"><a class="reference internal" href="Recursion_Combinators.html#hylomorphism">Hylomorphism</a></li>
  63 <li class="toctree-l2"><a class="reference internal" href="Recursion_Combinators.html#hylomorphism-in-joy">Hylomorphism in Joy</a></li>
  64 <li class="toctree-l2"><a class="reference internal" href="Recursion_Combinators.html#derivation-of-hylomorphism-combinator">Derivation of <code class="docutils literal notranslate"><span class="pre">hylomorphism</span></code> combinator</a></li>
  65 <li class="toctree-l2"><a class="reference internal" href="Recursion_Combinators.html#four-specializations">Four Specializations</a></li>
  66 <li class="toctree-l2"><a class="reference internal" href="Recursion_Combinators.html#anamorphism">Anamorphism</a></li>
  67 <li class="toctree-l2"><a class="reference internal" href="Recursion_Combinators.html#catamorphism">Catamorphism</a></li>
  68 <li class="toctree-l2"><a class="reference internal" href="Recursion_Combinators.html#example-factorial-function">Example: Factorial Function</a></li>
  69 <li class="toctree-l2"><a class="reference internal" href="Recursion_Combinators.html#example-tails">Example: <code class="docutils literal notranslate"><span class="pre">tails</span></code></a></li>
  70 <li class="toctree-l2"><a class="reference internal" href="Recursion_Combinators.html#conclusion-patterns-of-recursion">Conclusion: Patterns of Recursion</a></li>
  71 <li class="toctree-l2"><a class="reference internal" href="Recursion_Combinators.html#appendix-fun-with-symbols">Appendix: Fun with Symbols</a></li>
  72 </ul>
  73 </li>
  74 <li class="toctree-l1"><a class="reference internal" href="Ordered_Binary_Trees.html">Treating Trees I: Ordered Binary Trees</a><ul>
  75 <li class="toctree-l2"><a class="reference internal" href="Ordered_Binary_Trees.html#adding-nodes-to-the-tree">Adding Nodes to the Tree</a></li>
  76 <li class="toctree-l2"><a class="reference internal" href="Ordered_Binary_Trees.html#interlude-cmp-combinator">Interlude: <code class="docutils literal notranslate"><span class="pre">cmp</span></code> combinator</a></li>
  77 <li class="toctree-l2"><a class="reference internal" href="Ordered_Binary_Trees.html#a-function-to-traverse-this-structure">A Function to Traverse this Structure</a></li>
  78 <li class="toctree-l2"><a class="reference internal" href="Ordered_Binary_Trees.html#interlude-a-set-like-datastructure">Interlude: A Set-like Datastructure</a></li>
  79 <li class="toctree-l2"><a class="reference internal" href="Ordered_Binary_Trees.html#a-version-of-tree-iter-that-does-in-order-traversal">A Version of <code class="docutils literal notranslate"><span class="pre">Tree-iter</span></code> that does In-Order Traversal</a></li>
  80 <li class="toctree-l2"><a class="reference internal" href="Ordered_Binary_Trees.html#getting-values-by-key">Getting values by key</a></li>
  81 <li class="toctree-l2"><a class="reference internal" href="Ordered_Binary_Trees.html#tree-delete">Tree-delete</a></li>
  82 <li class="toctree-l2"><a class="reference internal" href="Ordered_Binary_Trees.html#appendix-the-source-code">Appendix: The source code.</a></li>
  83 </ul>
  84 </li>
  85 <li class="toctree-l1"><a class="reference internal" href="Treestep.html">Treating Trees II: <code class="docutils literal notranslate"><span class="pre">treestep</span></code></a><ul>
  86 <li class="toctree-l2"><a class="reference internal" href="Treestep.html#derive-the-recursive-function">Derive the recursive function.</a></li>
  87 <li class="toctree-l2"><a class="reference internal" href="Treestep.html#extract-the-givens-to-parameterize-the-program">Extract the givens to parameterize the program.</a></li>
  88 <li class="toctree-l2"><a class="reference internal" href="Treestep.html#define-treestep">Define <code class="docutils literal notranslate"><span class="pre">treestep</span></code></a></li>
  89 <li class="toctree-l2"><a class="reference internal" href="Treestep.html#examples">Examples</a></li>
  90 <li class="toctree-l2"><a class="reference internal" href="Treestep.html#redefining-the-ordered-binary-tree-in-terms-of-treestep">Redefining the Ordered Binary Tree in terms of <code class="docutils literal notranslate"><span class="pre">treestep</span></code>.</a></li>
  91 <li class="toctree-l2"><a class="reference internal" href="Treestep.html#with-treegrind">With <code class="docutils literal notranslate"><span class="pre">treegrind</span></code>?</a></li>
  92 <li class="toctree-l2"><a class="reference internal" href="Treestep.html#treegrind-with-step"><code class="docutils literal notranslate"><span class="pre">treegrind</span></code> with <code class="docutils literal notranslate"><span class="pre">step</span></code></a></li>
  93 <li class="toctree-l2"><a class="reference internal" href="Treestep.html#do-we-have-the-flexibility-to-reimplement-tree-get">Do we have the flexibility to reimplement <code class="docutils literal notranslate"><span class="pre">Tree-get</span></code>?</a></li>
  94 <li class="toctree-l2"><a class="reference internal" href="Treestep.html#putting-it-together">Putting it together</a></li>
  95 </ul>
  96 </li>
  97 <li class="toctree-l1"><a class="reference internal" href="Generator_Programs.html">Using <code class="docutils literal notranslate"><span class="pre">x</span></code> to Generate Values</a><ul>
  98 <li class="toctree-l2"><a class="reference internal" href="Generator_Programs.html#direco"><code class="docutils literal notranslate"><span class="pre">direco</span></code></a></li>
  99 <li class="toctree-l2"><a class="reference internal" href="Generator_Programs.html#making-generators">Making Generators</a></li>
 100 <li class="toctree-l2"><a class="reference internal" href="Generator_Programs.html#generating-multiples-of-three-and-five">Generating Multiples of Three and Five</a></li>
 101 <li class="toctree-l2"><a class="reference internal" href="Generator_Programs.html#project-euler-problem-one">Project Euler Problem One</a></li>
 102 <li class="toctree-l2"><a class="reference internal" href="Generator_Programs.html#a-generator-for-the-fibonacci-sequence">A generator for the Fibonacci Sequence.</a></li>
 103 <li class="toctree-l2"><a class="reference internal" href="Generator_Programs.html#project-euler-problem-two">Project Euler Problem Two</a></li>
 104 <li class="toctree-l2"><a class="reference internal" href="Generator_Programs.html#how-to-compile-these">How to compile these?</a></li>
 105 <li class="toctree-l2"><a class="reference internal" href="Generator_Programs.html#an-interesting-variation">An Interesting Variation</a></li>
 106 </ul>
 107 </li>
 108 <li class="toctree-l1"><a class="reference internal" href="Newton-Raphson.html">Newton’s method</a><ul>
 109 <li class="toctree-l2"><a class="reference internal" href="Newton-Raphson.html#a-generator-for-approximations">A Generator for Approximations</a></li>
 110 <li class="toctree-l2"><a class="reference internal" href="Newton-Raphson.html#finding-consecutive-approximations-within-a-tolerance">Finding Consecutive Approximations within a Tolerance</a></li>
 111 </ul>
 112 </li>
 113 <li class="toctree-l1"><a class="reference internal" href="Zipper.html">Traversing Datastructures with Zippers</a><ul>
 114 <li class="toctree-l2"><a class="reference internal" href="Zipper.html#trees">Trees</a></li>
 115 <li class="toctree-l2"><a class="reference internal" href="Zipper.html#zipper-in-joy">Zipper in Joy</a></li>
 116 <li class="toctree-l2"><a class="reference internal" href="Zipper.html#dip-and-infra"><code class="docutils literal notranslate"><span class="pre">dip</span></code> and <code class="docutils literal notranslate"><span class="pre">infra</span></code></a></li>
 117 <li class="toctree-l2"><a class="reference internal" href="Zipper.html#z"><code class="docutils literal notranslate"><span class="pre">Z</span></code></a></li>
 118 <li class="toctree-l2"><a class="reference internal" href="Zipper.html#addressing">Addressing</a></li>
 119 <li class="toctree-l2"><a class="reference internal" href="Zipper.html#determining-the-right-path-for-an-item-in-a-tree">Determining the right “path” for an item in a tree.</a></li>
 120 </ul>
 121 </li>
 122 <li class="toctree-l1"><a class="reference internal" href="Types.html">The Blissful Elegance of Typing Joy</a><ul>
 123 <li class="toctree-l2"><a class="reference internal" href="Types.html#part-i-poials-rules">Part I: Pöial’s Rules</a></li>
 124 <li class="toctree-l2"><a class="reference internal" href="Types.html#part-ii-implementation">Part II: Implementation</a></li>
 125 <li class="toctree-l2"><a class="reference internal" href="Types.html#part-iii-compiling-yin-functions">Part III: Compiling Yin Functions</a></li>
 126 <li class="toctree-l2"><a class="reference internal" href="Types.html#part-iv-types-and-subtypes-of-arguments">Part IV: Types and Subtypes of Arguments</a></li>
 127 <li class="toctree-l2"><a class="reference internal" href="Types.html#part-v-functions-that-use-the-stack">Part V: Functions that use the Stack</a></li>
 128 <li class="toctree-l2"><a class="reference internal" href="Types.html#part-vi-multiple-stack-effects">Part VI: Multiple Stack Effects</a></li>
 129 <li class="toctree-l2"><a class="reference internal" href="Types.html#part-vii-typing-combinators">Part VII: Typing Combinators</a></li>
 130 <li class="toctree-l2"><a class="reference internal" href="Types.html#conclusion">Conclusion</a></li>
 131 <li class="toctree-l2"><a class="reference internal" href="Types.html#appendix-joy-in-the-logical-paradigm">Appendix: Joy in the Logical Paradigm</a></li>
 132 </ul>
 133 </li>
 134 <li class="toctree-l1"><a class="reference internal" href="TypeChecking.html">Type Checking</a><ul>
 135 <li class="toctree-l2"><a class="reference internal" href="TypeChecking.html#an-example">An Example</a></li>
 136 <li class="toctree-l2"><a class="reference internal" href="TypeChecking.html#unification-works-in-reverse">Unification Works “in Reverse”</a></li>
 137 <li class="toctree-l2"><a class="reference internal" href="TypeChecking.html#failing-a-check">Failing a Check</a></li>
 138 </ul>
 139 </li>
 140 <li class="toctree-l1"><a class="reference internal" href="NoUpdates.html">No Updates</a></li>
 141 <li class="toctree-l1"><a class="reference internal" href="Categorical.html">Categorical Programming</a></li>
 142 <li class="toctree-l1"><a class="reference internal" href="The_Four_Operations.html">The Four Fundamental Operations of Definite Action</a><ul>
 143 <li class="toctree-l2"><a class="reference internal" href="The_Four_Operations.html#sequence">Sequence</a></li>
 144 <li class="toctree-l2"><a class="reference internal" href="The_Four_Operations.html#branch">Branch</a></li>
 145 <li class="toctree-l2"><a class="reference internal" href="The_Four_Operations.html#loop">Loop</a></li>
 146 <li class="toctree-l2"><a class="reference internal" href="The_Four_Operations.html#parallel">Parallel</a></li>
 147 </ul>
 148 </li>
 149 <li class="toctree-l1"><a class="reference internal" href="Derivatives_of_Regular_Expressions.html">∂RE</a><ul>
 150 <li class="toctree-l2"><a class="reference internal" href="Derivatives_of_Regular_Expressions.html#brzozowskis-derivatives-of-regular-expressions">Brzozowski’s Derivatives of Regular Expressions</a></li>
 151 <li class="toctree-l2"><a class="reference internal" href="Derivatives_of_Regular_Expressions.html#implementation">Implementation</a></li>
 152 <li class="toctree-l2"><a class="reference internal" href="Derivatives_of_Regular_Expressions.html#lets-try-it-out">Let’s try it out…</a></li>
 153 <li class="toctree-l2"><a class="reference internal" href="Derivatives_of_Regular_Expressions.html#larger-alphabets">Larger Alphabets</a></li>
 154 <li class="toctree-l2"><a class="reference internal" href="Derivatives_of_Regular_Expressions.html#state-machine">State Machine</a></li>
 155 <li class="toctree-l2"><a class="reference internal" href="Derivatives_of_Regular_Expressions.html#reversing-the-derivatives-to-generate-matching-strings">Reversing the Derivatives to Generate Matching Strings</a></li>
 156 </ul>
 157 </li>
 158 </ul>
 159 </div>
 160 </section>
 161
 162
 163           </div>
 164
 165         </div>
 166       </div>
 167       <div class="sphinxsidebar" role="navigation" aria-label="main navigation">
 168         <div class="sphinxsidebarwrapper">
 169 <h1 class="logo"><a href="../index.html">Thun</a></h1>
 170
 171
 172
 173
 174
 175
 176
 177
 178 <h3>Navigation</h3>
 179 <ul class="current">
 180 <li class="toctree-l1"><a class="reference internal" href="Intro.html">Thun: Joy in Python</a></li>
 181 <li class="toctree-l1"><a class="reference internal" href="../joy.html">Joy Interpreter</a></li>
 182 <li class="toctree-l1"><a class="reference internal" href="../stack.html">Stack or Quote or Sequence or List…</a></li>
 183 <li class="toctree-l1"><a class="reference internal" href="../parser.html">Parsing Text into Joy Expressions</a></li>
 184 <li class="toctree-l1"><a class="reference internal" href="../pretty.html">Tracing Joy Execution</a></li>
 185 <li class="toctree-l1"><a class="reference internal" href="../library.html">Function Reference</a></li>
 186 <li class="toctree-l1"><a class="reference internal" href="../lib.html">Functions Grouped by, er, Function with Examples</a></li>
 187 <li class="toctree-l1"><a class="reference internal" href="../types.html">Type Inference of Joy Expressions</a></li>
 188 <li class="toctree-l1 current"><a class="current reference internal" href="#">Essays about Programming in Joy</a><ul>
 189 <li class="toctree-l2"><a class="reference internal" href="Developing.html">Developing a Program in Joy</a></li>
 190 <li class="toctree-l2"><a class="reference internal" href="Quadratic.html">Quadratic formula</a></li>
 191 <li class="toctree-l2"><a class="reference internal" href="Replacing.html">Replacing Functions in the Dictionary</a></li>
 192 <li class="toctree-l2"><a class="reference internal" href="Recursion_Combinators.html">Recursion Combinators</a></li>
 193 <li class="toctree-l2"><a class="reference internal" href="Ordered_Binary_Trees.html">Treating Trees I: Ordered Binary Trees</a></li>
 194 <li class="toctree-l2"><a class="reference internal" href="Treestep.html">Treating Trees II: <code class="docutils literal notranslate"><span class="pre">treestep</span></code></a></li>
 195 <li class="toctree-l2"><a class="reference internal" href="Generator_Programs.html">Using <code class="docutils literal notranslate"><span class="pre">x</span></code> to Generate Values</a></li>
 196 <li class="toctree-l2"><a class="reference internal" href="Newton-Raphson.html">Newton’s method</a></li>
 197 <li class="toctree-l2"><a class="reference internal" href="Zipper.html">Traversing Datastructures with Zippers</a></li>
 198 <li class="toctree-l2"><a class="reference internal" href="Types.html">The Blissful Elegance of Typing Joy</a></li>
 199 <li class="toctree-l2"><a class="reference internal" href="TypeChecking.html">Type Checking</a></li>
 200 <li class="toctree-l2"><a class="reference internal" href="NoUpdates.html">No Updates</a></li>
 201 <li class="toctree-l2"><a class="reference internal" href="Categorical.html">Categorical Programming</a></li>
 202 <li class="toctree-l2"><a class="reference internal" href="The_Four_Operations.html">The Four Fundamental Operations of Definite Action</a></li>
 203 <li class="toctree-l2"><a class="reference internal" href="Derivatives_of_Regular_Expressions.html">∂RE</a></li>
 204 </ul>
 205 </li>
 206 </ul>
 207
 208 <div class="relations">
 209 <h3>Related Topics</h3>
 210 <ul>
 211   <li><a href="../index.html">Documentation overview</a><ul>
 212       <li>Previous: <a href="../types.html" title="previous chapter">Type Inference of Joy Expressions</a></li>
 213       <li>Next: <a href="Developing.html" title="next chapter">Developing a Program in Joy</a></li>
 214   </ul></li>
 215 </ul>
 216 </div>
 217 <div id="searchbox" style="display: none" role="search">
 218   <h3 id="searchlabel">Quick search</h3>
 219     <div class="searchformwrapper">
 220     <form class="search" action="../search.html" method="get">
 221       <input type="text" name="q" aria-labelledby="searchlabel" autocomplete="off" autocorrect="off" autocapitalize="off" spellcheck="false"/>
 222       <input type="submit" value="Go" />
 223     </form>
 224     </div>
 225 </div>
 226 <script>$('#searchbox').show(0);</script>
 227
 228
 229
 230
 231
 232
 233
 234
 235         </div>
 236       </div>
 237       <div class="clearer"></div>
 238     </div>
 239     <div class="footer" role="contentinfo">
 240 <a rel="license" href="http://creativecommons.org/licenses/by-nc-sa/4.0/">
 241 <img alt="Creative Commons License" style="border-width:0" src="https://i.creativecommons.org/l/by-nc-sa/4.0/88x31.png" />
 242 </a>
 243 <br />
 244 <span xmlns:dct="http://purl.org/dc/terms/" property="dct:title">Thun Documentation</span> by <a xmlns:cc="http://creativecommons.org/ns#" href="https://joypy.osdn.io/" property="cc:attributionName" rel="cc:attributionURL">Simon Forman</a> is licensed under a <a rel="license" href="http://creativecommons.org/licenses/by-nc-sa/4.0/">Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License</a>.<br />Based on a work at <a xmlns:dct="http://purl.org/dc/terms/" href="https://osdn.net/projects/joypy/" rel="dct:source">https://osdn.net/projects/joypy/</a>.
 245       Created using <a href="http://sphinx-doc.org/">Sphinx</a> 4.3.0.
 246     </div>
 247
 248   </body>
 249 </html>