mirror/ioccc
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

force use of pandoc version >= 3.1.12.2

Browse Source 
The `bin/pandoc-wrapper.sh` tool will verify that the ssytem
has a recent enough version of `pandoc(1)`.

We explain why we insist on `pandoc(1)`. version >= 3.1.12.2
in comments where the $PANDOC_MIN_VERSION is set.

Added `--wrap=preserve` as a default argument to `pandoc(1)`.
While this change will impact every HTML file generated,
we believe this will improve the ability of someone to look
at the generated HTML and correlate with the original markdown.

Changed `bin/pandoc-wrapper.sh` VERSION from "1.4.2 2024-03-17"
to "1.4.3 2024-03-18".

Performed `make www` to achieve all of the above and to generate
HTML using the new  `--wrap=preserve` `pandoc(1)` mode.
This commit is contained in:
Landon Curt Noll committed 2024-03-18 01:26:39 -07:00
1 parent 9eb7a54e9f
commit b0b212acb1
402 files changed
+37061 -55132
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

2012/tromp/how.html
+14 -20
View File
@@ -121,34 +121,28 @@
<!-- START: this line starts content for HTML phase 21 by: bin/pandoc-wrapper.sh via bin/md2html.sh -->
<h1 id="spoiler">Spoiler</h1>
<p>The program implements a so called <a
href="https://en.wikipedia.org/wiki/Krivine_machine">Krivine
machine</a>, enhanced with a <a
href="https://en.wikipedia.org/wiki/BIOS">basic input/output system</a>
and a reference counting <a
href="https://en.wikipedia.org/wiki/Waste_collector">garbage
collector</a>. The Krivine machine is a stepwise transformer of a global
state consisting of the current term, the current environment (a list of
closures), and a stack of continuations (see the 3rd reference for
details).</p>
<p>The term space holds <a
href="https://en.wikipedia.org/wiki/Lambda_calculus">lambda calculus</a>
terms in the following format. 0 denotes some form of I/O; the only four
occurrences are at:</p>
<p>The program implements a so called <a href="https://en.wikipedia.org/wiki/Krivine_machine">Krivine
machine</a>, enhanced with a <a href="https://en.wikipedia.org/wiki/BIOS">basic
input/output system</a> and a reference
counting <a href="https://en.wikipedia.org/wiki/Waste_collector">garbage collector</a>. The
Krivine machine is a stepwise transformer of a global state consisting of the
current term, the current environment (a list of closures), and a stack of
continuations (see the 3rd reference for details).</p>
<p>The term space holds <a href="https://en.wikipedia.org/wiki/Lambda_calculus">lambda
calculus</a> terms in the following
format. 0 denotes some form of I/O; the only four occurrences are at:</p>
<pre><code> C=13: recognizes end of a byte
C=20: recognize output of 0 bit
C=21: recognize output of 1 bit
C=end: input list, expanded lazily</code></pre>
<p><code>1</code> denotes a variable, with the next entry its <a
href="https://en.wikipedia.org/wiki/De_Bruijn_index">de Bruijn
<p><code>1</code> denotes a variable, with the next entry its <a href="https://en.wikipedia.org/wiki/De_Bruijn_index">de Bruijn
index</a>.</p>
<p><code>2</code> denotes application with the next entry the size of
the term being applied.</p>
<p><code>2</code> denotes application with the next entry the size of the term being applied.</p>
<p><code>3</code> denotes lambda abstraction.</p>
<p>A closure consists of the following items:</p>
<ol start="0" type="1">
<li>pointer to the next closure (as part of an environment), or next
record on free list.</li>
<li>pointer to the next closure (as part of an environment), or next record on
free list.</li>
<li>reference count.</li>
<li>pointer to environment.</li>
<li>lambda term (index in term space).</li>