Run MAKE.
This commit is contained in:
parent
da0e1e685e
commit
356f67dd7d
|
|
@ -2,8 +2,9 @@ python build_index.py ./source/index.md > ./html/index.html
|
||||||
python build_index.py ./source/Thun.md > ./html/Thun.html
|
python build_index.py ./source/Thun.md > ./html/Thun.html
|
||||||
python build_index.py ./source/notebooks/BigNums.md > ./html/notebooks/BigInts.html
|
python build_index.py ./source/notebooks/BigNums.md > ./html/notebooks/BigInts.html
|
||||||
python build_index.py ./source/notebooks/NerdSnipe.md > ./html/notebooks/NerdSnipe.html
|
python build_index.py ./source/notebooks/NerdSnipe.md > ./html/notebooks/NerdSnipe.html
|
||||||
|
python build_index.py ./source/notebooks/DeriveZip.md > ./html/notebooks/DeriveZip.html
|
||||||
python build_index.py ./source/notebooks/Generator_Programs.md > ./html/notebooks/Generator_Programs.html
|
python build_index.py ./source/notebooks/Generator_Programs.md > ./html/notebooks/Generator_Programs.html
|
||||||
(cd ../implementations/Elm/ ; make)
|
(cd ../implementations/Elm/ ; make)
|
||||||
cp -f ../implementations/Elm/demo/Joy.js ./html/Joy.js
|
cp -f ../implementations/Elm/demo/Joy.js ./html/Joy.js
|
||||||
(cd ../reference/ ; make)
|
(cd reference ; python ./to_html.py)
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -26,28 +26,28 @@
|
||||||
<p>Now then, we have two non-empty lists:</p>
|
<p>Now then, we have two non-empty lists:</p>
|
||||||
<pre><code>[a b c ...] [e f g ...] R0 [zip] R1
|
<pre><code>[a b c ...] [e f g ...] R0 [zip] R1
|
||||||
</code></pre>
|
</code></pre>
|
||||||
<p>Let's imagine a function <code>shift-pair</code>:</p>
|
<p>Let's imagine a function <code>uncons-pair</code>:</p>
|
||||||
<pre><code> [a ...] [e ...] shift-pair
|
<pre><code> [a ...] [e ...] uncons-pair
|
||||||
--------------------------------
|
--------------------------------
|
||||||
[a e] [...] [...]
|
[a e] [...] [...]
|
||||||
</code></pre>
|
</code></pre>
|
||||||
<p>I'm going to defer derivation of that for now.</p>
|
<p>I'm going to defer derivation of that for now.</p>
|
||||||
<pre><code>[a b c ...] [e f g ...] shift-pair [zip] R1
|
<pre><code>[a b c ...] [e f g ...] uncons-pair [zip] R1
|
||||||
|
|
||||||
[a e] [b c ...] [f g ...] [zip] R1
|
[a e] [b c ...] [f g ...] [zip] R1
|
||||||
</code></pre>
|
</code></pre>
|
||||||
<p>And so <code>R1</code> is <code>i cons</code> (it's a list builder.)</p>
|
<p>And so <code>R1</code> is <code>i cons</code> (it's a list builder.)</p>
|
||||||
<pre><code>zip == [null] [pop] [shift-pair] [i cons] genrec
|
<pre><code>zip == [null] [pop] [uncons-pair] [i cons] genrec
|
||||||
</code></pre>
|
</code></pre>
|
||||||
<p>And now:</p>
|
<p>And now:</p>
|
||||||
<pre><code>shift-pair == uncons-two [quote-two] dipd
|
<pre><code>uncons-pair == uncons-two [quote-two] dipd
|
||||||
</code></pre>
|
</code></pre>
|
||||||
<p>w/</p>
|
<p>w/</p>
|
||||||
<pre><code>uncons-two == [uncons] ii swapd
|
<pre><code>uncons-two == [uncons] ii swapd
|
||||||
quote-two == unit cons
|
quote-two == unit cons
|
||||||
|
|
||||||
[zip [null] [pop] [shift-pair] [i cons] genrec] inscribe
|
[zip [null] [pop] [uncons-pair] [i cons] genrec] inscribe
|
||||||
[shift-pair uncons-two [quote-two] dipd] inscribe
|
[uncons-pair uncons-two [quote-two] dipd] inscribe
|
||||||
[uncons-two [uncons] ii swapd] inscribe
|
[uncons-two [uncons] ii swapd] inscribe
|
||||||
[quote-two unit cons] inscribe
|
[quote-two unit cons] inscribe
|
||||||
</code></pre>
|
</code></pre>
|
||||||
|
|
|
||||||
File diff suppressed because it is too large
Load Diff
|
|
@ -22,33 +22,33 @@ Now then, we have two non-empty lists:
|
||||||
|
|
||||||
[a b c ...] [e f g ...] R0 [zip] R1
|
[a b c ...] [e f g ...] R0 [zip] R1
|
||||||
|
|
||||||
Let's imagine a function `shift-pair`:
|
Let's imagine a function `uncons-pair`:
|
||||||
|
|
||||||
[a ...] [e ...] shift-pair
|
[a ...] [e ...] uncons-pair
|
||||||
--------------------------------
|
--------------------------------
|
||||||
[a e] [...] [...]
|
[a e] [...] [...]
|
||||||
|
|
||||||
I'm going to defer derivation of that for now.
|
I'm going to defer derivation of that for now.
|
||||||
|
|
||||||
[a b c ...] [e f g ...] shift-pair [zip] R1
|
[a b c ...] [e f g ...] uncons-pair [zip] R1
|
||||||
|
|
||||||
[a e] [b c ...] [f g ...] [zip] R1
|
[a e] [b c ...] [f g ...] [zip] R1
|
||||||
|
|
||||||
And so `R1` is `i cons` (it's a list builder.)
|
And so `R1` is `i cons` (it's a list builder.)
|
||||||
|
|
||||||
zip == [null] [pop] [shift-pair] [i cons] genrec
|
zip == [null] [pop] [uncons-pair] [i cons] genrec
|
||||||
|
|
||||||
And now:
|
And now:
|
||||||
|
|
||||||
shift-pair == uncons-two [quote-two] dipd
|
uncons-pair == uncons-two [quote-two] dipd
|
||||||
|
|
||||||
w/
|
w/
|
||||||
|
|
||||||
uncons-two == [uncons] ii swapd
|
uncons-two == [uncons] ii swapd
|
||||||
quote-two == unit cons
|
quote-two == unit cons
|
||||||
|
|
||||||
[zip [null] [pop] [shift-pair] [i cons] genrec] inscribe
|
[zip [null] [pop] [uncons-pair] [i cons] genrec] inscribe
|
||||||
[shift-pair uncons-two [quote-two] dipd] inscribe
|
[uncons-pair uncons-two [quote-two] dipd] inscribe
|
||||||
[uncons-two [uncons] ii swapd] inscribe
|
[uncons-two [uncons] ii swapd] inscribe
|
||||||
[quote-two unit cons] inscribe
|
[quote-two unit cons] inscribe
|
||||||
|
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue