Rebuild docs with Python 3 and Sphinx 3.0.2.
This commit is contained in:
@@ -1,4 +1,3 @@
|
||||
|
||||
∂RE
|
||||
===
|
||||
|
||||
@@ -943,3 +942,5 @@ hmm...
|
||||
::
|
||||
|
||||
j = (01)*
|
||||
|
||||
|
||||
|
||||
@@ -1,4 +1,3 @@
|
||||
|
||||
Using ``x`` to Generate Values
|
||||
==============================
|
||||
|
||||
|
||||
@@ -1,4 +1,3 @@
|
||||
|
||||
`Newton's method <https://en.wikipedia.org/wiki/Newton%27s_method>`__
|
||||
=====================================================================
|
||||
|
||||
|
||||
@@ -1,4 +1,3 @@
|
||||
|
||||
Treating Trees I: Ordered Binary Trees
|
||||
======================================
|
||||
|
||||
|
||||
@@ -1,4 +1,3 @@
|
||||
|
||||
.. code:: ipython2
|
||||
|
||||
from notebook_preamble import J, V, define
|
||||
@@ -156,3 +155,4 @@ get the results. This is pretty typical of Joy code.
|
||||
4.0 [1.0] . first
|
||||
4.0 1.0 .
|
||||
|
||||
|
||||
|
||||
@@ -1,4 +1,3 @@
|
||||
|
||||
.. code:: ipython2
|
||||
|
||||
from notebook_preamble import D, DefinitionWrapper, J, V, define
|
||||
|
||||
@@ -1,4 +1,3 @@
|
||||
|
||||
Replacing Functions in the Dictionary
|
||||
=====================================
|
||||
|
||||
|
||||
@@ -1,4 +1,3 @@
|
||||
|
||||
The Four Fundamental Operations of Definite Action
|
||||
==================================================
|
||||
|
||||
|
||||
@@ -1,4 +1,3 @@
|
||||
|
||||
Treating Trees II: ``treestep``
|
||||
===============================
|
||||
|
||||
|
||||
@@ -1,4 +1,3 @@
|
||||
|
||||
Type Checking
|
||||
=============
|
||||
|
||||
|
||||
@@ -1,4 +1,3 @@
|
||||
|
||||
The Blissful Elegance of Typing Joy
|
||||
===================================
|
||||
|
||||
@@ -2049,6 +2048,11 @@ comments are now already in the form needed for the Python code:
|
||||
return (((a2, (a1, s1)), s2), ((a2, (a1, s1)), s2))
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
.. code:: ipython2
|
||||
|
||||
unstack = (S[1], S[0]), S[1]
|
||||
@@ -2107,6 +2111,7 @@ comments are now already in the form needed for the Python code:
|
||||
|
||||
|
||||
|
||||
|
||||
Part VI: Multiple Stack Effects
|
||||
-------------------------------
|
||||
|
||||
@@ -2495,6 +2500,7 @@ This function has to be modified to yield multiple results.
|
||||
yield update(result, (f_in, g_out))
|
||||
|
||||
|
||||
|
||||
.. code:: ipython2
|
||||
|
||||
def meta_compose(F, G):
|
||||
|
||||
@@ -1,4 +1,3 @@
|
||||
|
||||
Traversing Datastructures with Zippers
|
||||
======================================
|
||||
|
||||
@@ -351,3 +350,4 @@ from the subject datastructure:
|
||||
|
||||
[ n [ n [ n n x ...
|
||||
i d i d i d d Bingo!
|
||||
|
||||
|
||||
Reference in New Issue
Block a user