[hcoop/debian/mlton.git] / doc / guide / localhost / InfixingOperators

<!DOCTYPE html>\r
<html lang="en">\r
<head>\r
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">\r
<meta name="generator" content="AsciiDoc 8.6.9">\r
<title>InfixingOperators</title>\r
<link rel="stylesheet" href="./asciidoc.css" type="text/css">\r
<link rel="stylesheet" href="./pygments.css" type="text/css">\r
\r
\r
<script type="text/javascript" src="./asciidoc.js"></script>\r
<script type="text/javascript">\r
/*<![CDATA[*/\r
asciidoc.install();\r
/*]]>*/\r
</script>\r
<link rel="stylesheet" href="./mlton.css" type="text/css">\r
</head>\r
<body class="article">\r
<div id="banner">\r
<div id="banner-home">\r
<a href="./Home">MLton 20180207</a>\r
</div>\r
</div>\r
<div id="header">\r
<h1>InfixingOperators</h1>\r
</div>\r
<div id="content">\r
<div id="preamble">\r
<div class="sectionbody">\r
<div class="paragraph"><p>Fixity specifications are not part of signatures in\r
<a href="StandardML">Standard ML</a>. When one wants to use a module that\r
provides functions designed to be used as infix operators there are\r
several obvious alternatives:</p></div>\r
<div class="ulist"><ul>\r
<li>\r
<p>\r
Use only prefix applications. Unfortunately there are situations\r
where infix applications lead to considerably more readable code.\r
</p>\r
</li>\r
<li>\r
<p>\r
Make the fixity declarations at the top-level. This may lead to\r
collisions and may be unsustainable in a large project. Pollution of\r
the top-level should be avoided.\r
</p>\r
</li>\r
<li>\r
<p>\r
Make the fixity declarations at each scope where you want to use\r
infix applications. The duplication becomes inconvenient if the\r
operators are widely used. Duplication of code should be avoided.\r
</p>\r
</li>\r
<li>\r
<p>\r
Use non-standard extensions, such as the <a href="MLBasis"> ML Basis system</a>\r
to control the scope of fixity declarations. This has the obvious\r
drawback of reduced portability.\r
</p>\r
</li>\r
<li>\r
<p>\r
Reuse existing infix operator symbols (<span class="monospaced">^</span>, <span class="monospaced">+</span>, <span class="monospaced">-</span>, &#8230;).  This\r
can be convenient when the standard operators aren&#8217;t needed in the\r
same scope with the new operators.  On the other hand, one is limited\r
to the standard operator symbols and the code may appear confusing.\r
</p>\r
</li>\r
</ul></div>\r
<div class="paragraph"><p>None of the obvious alternatives is best in every case. The following\r
describes a slightly less obvious alternative that can sometimes be\r
useful. The idea is to approximate Haskell&#8217;s special syntax for\r
treating any identifier enclosed in grave accents (backquotes) as an\r
infix operator. In Haskell, instead of writing the prefix application\r
<span class="monospaced">f x y</span> one can write the infix application <span class="monospaced">x &grave;f&grave; y</span>.</p></div>\r
</div>\r
</div>\r
<div class="sect1">\r
<h2 id="_infixing_operators">Infixing operators</h2>\r
<div class="sectionbody">\r
<div class="paragraph"><p>Let&#8217;s first take a look at the definitions of the operators:</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">infix</span><span class="w">  </span><span class="mi">3</span><span class="w"> </span><span class="n">&lt;\</span><span class="w">     </span><span class="k">fun</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="n">&lt;\</span><span class="w"> </span><span class="n">f</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">fn</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="n">f</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">)</span><span class="w">     </span><span class="cm">(* Left section      *)</span><span class="w"></span>\r
<span class="k">infix</span><span class="w">  </span><span class="mi">3</span><span class="w"> </span><span class="n">\&gt;</span><span class="w">     </span><span class="k">fun</span><span class="w"> </span><span class="n">f</span><span class="w"> </span><span class="n">\&gt;</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">f</span><span class="w"> </span><span class="n">y</span><span class="w">                  </span><span class="cm">(* Left application  *)</span><span class="w"></span>\r
<span class="k">infixr</span><span class="w"> </span><span class="mi">3</span><span class="w"> </span><span class="n">/&gt;</span><span class="w">     </span><span class="k">fun</span><span class="w"> </span><span class="n">f</span><span class="w"> </span><span class="n">/&gt;</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">fn</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="n">f</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">)</span><span class="w">     </span><span class="cm">(* Right section     *)</span><span class="w"></span>\r
<span class="k">infixr</span><span class="w"> </span><span class="mi">3</span><span class="w"> </span><span class="n">&lt;/</span><span class="w">     </span><span class="k">fun</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="n">&lt;/</span><span class="w"> </span><span class="n">f</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">f</span><span class="w"> </span><span class="n">x</span><span class="w">                  </span><span class="cm">(* Right application *)</span><span class="w"></span>\r
\r
<span class="k">infix</span><span class="w">  </span><span class="mi">2</span><span class="w"> </span><span class="n">o</span><span class="w">  </span><span class="cm">(* See motivation below *)</span><span class="w"></span>\r
<span class="k">infix</span><span class="w">  </span><span class="mi">0</span><span class="w"> </span><span class="n">:=</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>The left and right sectioning operators, <span class="monospaced">&lt;\</span> and <span class="monospaced">/&gt;</span>, are useful in\r
SML for partial application of infix operators.\r
<a href="References#Paulson96"> ML For the Working Programmer</a> describes curried\r
functions <span class="monospaced">secl</span> and <span class="monospaced">secr</span> for the same purpose on pages 179-181.\r
For example,</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="n">List</span><span class="p">.</span><span class="n">map</span><span class="w"> </span><span class="p">(</span><span class="k">op</span><span class="n">-</span><span class="w"> </span><span class="n">/&gt;</span><span class="w"> </span><span class="n">y</span><span class="p">)</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>is a function for subtracting <span class="monospaced">y</span> from a list of integers and</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="n">List</span><span class="p">.</span><span class="n">exists</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="n">&lt;\</span><span class="w"> </span><span class="k">op</span><span class="p">=)</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>is a function for testing whether a list contains an <span class="monospaced">x</span>.</p></div>\r
<div class="paragraph"><p>Together with the left and right application operators, <span class="monospaced">\&gt;</span> and <span class="monospaced">&lt;/</span>,\r
the sectioning operators provide a way to treat any binary function\r
(i.e. a function whose domain is a pair) as an infix operator.  In\r
general,</p></div>\r
<div class="listingblock">\r
<div class="content monospaced">\r
<pre>x0 &lt;\f1\&gt; x1 &lt;\f2\&gt; x2 ... &lt;\fN\&gt; xN = fN (... f2 (f1 (x0, x1), x2) ..., xN)</pre>\r
</div></div>\r
<div class="paragraph"><p>and</p></div>\r
<div class="listingblock">\r
<div class="content monospaced">\r
<pre>xN &lt;/fN/&gt; ... x2 &lt;/f2/&gt; x1 &lt;/f1/&gt; x0  =  fN (xN, ... f2 (x2, f1 (x1, x0)) ...)</pre>\r
</div></div>\r
<div class="sect2">\r
<h3 id="_examples">Examples</h3>\r
<div class="paragraph"><p>As a fairly realistic example, consider providing a function for sequencing\r
comparisons:</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">structure</span><span class="w"> </span><span class="n">Order</span><span class="w"> </span><span class="cm">(* ... *)</span><span class="w"> </span><span class="p">=</span><span class="w"></span>\r
<span class="w">   </span><span class="k">struct</span><span class="w"></span>\r
<span class="w">      </span><span class="cm">(* ... *)</span><span class="w"></span>\r
<span class="w">      </span><span class="k">val</span><span class="w"> </span><span class="n">orWhenEq</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">fn</span><span class="w"> </span><span class="p">(</span><span class="n">EQUAL</span><span class="p">,</span><span class="w"> </span><span class="n">th</span><span class="p">)</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="n">th</span><span class="w"> </span><span class="p">()</span><span class="w"></span>\r
<span class="w">                      </span><span class="p">|</span><span class="w"> </span><span class="p">(</span><span class="n">other</span><span class="p">,</span><span class="w">  </span><span class="p">_)</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="n">other</span><span class="w"></span>\r
<span class="w">      </span><span class="cm">(* ... *)</span><span class="w"></span>\r
<span class="w">   </span><span class="k">end</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>Using <span class="monospaced">orWhenEq</span> and the infixing operators, one can write a\r
<span class="monospaced">compare</span> function for triples as</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">fun</span><span class="w"> </span><span class="n">compare</span><span class="w"> </span><span class="p">(</span><span class="n">fad</span><span class="p">,</span><span class="w"> </span><span class="n">fbe</span><span class="p">,</span><span class="w"> </span><span class="n">fcf</span><span class="p">)</span><span class="w"> </span><span class="p">((</span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">,</span><span class="w"> </span><span class="n">c</span><span class="p">),</span><span class="w"> </span><span class="p">(</span><span class="n">d</span><span class="p">,</span><span class="w"> </span><span class="n">e</span><span class="p">,</span><span class="w"> </span><span class="n">f</span><span class="p">))</span><span class="w"> </span><span class="p">=</span><span class="w"></span>\r
<span class="w">    </span><span class="n">fad</span><span class="w"> </span><span class="p">(</span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">d</span><span class="p">)</span><span class="w"> </span><span class="n">&lt;\Order</span><span class="p">.</span><span class="n">orWhenEq\&gt;</span><span class="w"> </span><span class="n">`fbe</span><span class="w"> </span><span class="p">(</span><span class="n">b</span><span class="p">,</span><span class="w"> </span><span class="n">e</span><span class="p">)</span><span class="w"> </span><span class="n">&lt;\Order</span><span class="p">.</span><span class="n">orWhenEq\&gt;</span><span class="w"> </span><span class="n">`fcf</span><span class="w"> </span><span class="p">(</span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="n">f</span><span class="p">)</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>where <span class="monospaced">&grave;</span> is defined as</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">fun</span><span class="w"> </span><span class="n">`f</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">fn</span><span class="w"> </span><span class="p">()</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="n">f</span><span class="w"> </span><span class="n">x</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>Although <span class="monospaced">orWhenEq</span> can be convenient (try rewriting the above without\r
it), it is probably not useful enough to be defined at the top level\r
as an infix operator. Fortunately we can use the infixing operators\r
and don&#8217;t have to.</p></div>\r
<div class="paragraph"><p>Another fairly realistic example would be to use the infixing operators with\r
the technique described on the <a href="Printf">Printf</a> page. Assuming that you would have\r
a <span class="monospaced">Printf</span> module binding <span class="monospaced">printf</span>, <span class="monospaced">&grave;</span>, and formatting combinators\r
named <span class="monospaced">int</span> and <span class="monospaced">string</span>, you could write</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">let</span><span class="w"> </span><span class="k">open</span><span class="w"> </span><span class="n">Printf</span><span class="w"> </span><span class="k">in</span><span class="w"></span>\r
<span class="w">  </span><span class="n">printf</span><span class="w"> </span><span class="p">(</span><span class="n">`</span><span class="s">&quot;Here&#39;s an int &quot;</span><span class="n">&lt;\int\&gt;</span><span class="s">&quot; and a string &quot;</span><span class="n">&lt;\string\&gt;</span><span class="s">&quot;.&quot;</span><span class="p">)</span><span class="w"> </span><span class="mi">13</span><span class="w"> </span><span class="s">&quot;foo&quot;</span><span class="w"> </span><span class="k">end</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>without having to duplicate the fixity declarations. Alternatively, you could\r
write</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="n">P</span><span class="p">.</span><span class="n">printf</span><span class="w"> </span><span class="p">(</span><span class="n">P</span><span class="p">.</span><span class="n">`</span><span class="s">&quot;Here&#39;s an int &quot;</span><span class="n">&lt;\P</span><span class="p">.</span><span class="n">int\&gt;</span><span class="s">&quot; and a string &quot;</span><span class="n">&lt;\P</span><span class="p">.</span><span class="n">string\&gt;</span><span class="s">&quot;.&quot;</span><span class="p">)</span><span class="w"> </span><span class="mi">13</span><span class="w"> </span><span class="s">&quot;foo&quot;</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>assuming you have the made the binding</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">structure</span><span class="w"> </span><span class="n">P</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">Printf</span><span class="w"></span>\r
</pre></div></div></div>\r
</div>\r
</div>\r
</div>\r
<div class="sect1">\r
<h2 id="_application_and_piping_operators">Application and piping operators</h2>\r
<div class="sectionbody">\r
<div class="paragraph"><p>The left and right application operators may also provide some notational\r
convenience on their own. In general,</p></div>\r
<div class="listingblock">\r
<div class="content monospaced">\r
<pre>f \&gt; x1 \&gt; ... \&gt; xN = f x1 ... xN</pre>\r
</div></div>\r
<div class="paragraph"><p>and</p></div>\r
<div class="listingblock">\r
<div class="content monospaced">\r
<pre>xN &lt;/ ... &lt;/ x1 &lt;/ f = f x1 ... xN</pre>\r
</div></div>\r
<div class="paragraph"><p>If nothing else, both of them can eliminate parentheses. For example,</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="n">foo</span><span class="w"> </span><span class="p">(</span><span class="mi">1</span><span class="w"> </span><span class="n">+</span><span class="w"> </span><span class="mi">2</span><span class="p">)</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">foo</span><span class="w"> </span><span class="n">\&gt;</span><span class="w"> </span><span class="mi">1</span><span class="w"> </span><span class="n">+</span><span class="w"> </span><span class="mi">2</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>The left and right application operators are related to operators\r
that could be described as the right and left piping operators:</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">infix</span><span class="w">  </span><span class="mi">1</span><span class="w"> </span><span class="n">&gt;|</span><span class="w">     </span><span class="k">val</span><span class="w"> </span><span class="k">op</span><span class="n">&gt;|</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">op</span><span class="n">&lt;/</span><span class="w">      </span><span class="cm">(* Left pipe *)</span><span class="w"></span>\r
<span class="k">infixr</span><span class="w"> </span><span class="mi">1</span><span class="w"> </span><span class="n">|&lt;</span><span class="w">     </span><span class="k">val</span><span class="w"> </span><span class="k">op</span><span class="n">|&lt;</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">op</span><span class="n">\&gt;</span><span class="w">      </span><span class="cm">(* Right pipe *)</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>As you can see, the left and right piping operators, <span class="monospaced">&gt;|</span> and <span class="monospaced">|&lt;</span>,\r
are the same as the right and left application operators,\r
respectively, except the associativities are reversed and the binding\r
strength is lower. They are useful for piping data through a sequence\r
of operations. In general,</p></div>\r
<div class="listingblock">\r
<div class="content monospaced">\r
<pre>x &gt;| f1 &gt;| ... &gt;| fN = fN (... (f1 x) ...) = (fN o ... o f1) x</pre>\r
</div></div>\r
<div class="paragraph"><p>and</p></div>\r
<div class="listingblock">\r
<div class="content monospaced">\r
<pre>fN |&lt; ... |&lt; f1 |&lt; x = fN (... (f1 x) ...) = (fN o ... o f1) x</pre>\r
</div></div>\r
<div class="paragraph"><p>The right piping operator, <span class="monospaced">|&lt;</span>, is provided by the Haskell prelude as\r
<span class="monospaced">$</span>. It can be convenient in CPS or continuation passing style.</p></div>\r
<div class="paragraph"><p>A use for the left piping operator is with parsing combinators. In a\r
strict language, like SML, eta-reduction is generally unsafe. Using\r
the left piping operator, parsing functions can be formatted\r
conveniently as</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">fun</span><span class="w"> </span><span class="n">parsingFunc</span><span class="w"> </span><span class="n">input</span><span class="w"> </span><span class="p">=</span><span class="w"></span>\r
<span class="w">   </span><span class="n">input</span><span class="w"> </span><span class="n">&gt;|</span><span class="w"> </span><span class="cm">(* ... *)</span><span class="w"></span>\r
<span class="w">         </span><span class="n">||</span><span class="w"> </span><span class="cm">(* ... *)</span><span class="w"></span>\r
<span class="w">         </span><span class="n">||</span><span class="w"> </span><span class="cm">(* ... *)</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>where <span class="monospaced">||</span> is supposed to be a combinator provided by the parsing combinator\r
library.</p></div>\r
</div>\r
</div>\r
<div class="sect1">\r
<h2 id="_about_precedences">About precedences</h2>\r
<div class="sectionbody">\r
<div class="paragraph"><p>You probably noticed that we redefined the\r
<a href="OperatorPrecedence">precedences</a> of the function composition operator\r
<span class="monospaced">o</span> and the assignment operator <span class="monospaced">:=</span>. Doing so is not strictly\r
necessary, but can be convenient and should be relatively\r
safe. Consider the following motivating examples from\r
<a href="WesleyTerpstra"> Wesley W. Terpstra</a> relying on the redefined\r
precedences:</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="n">Word8</span><span class="p">.</span><span class="n">fromInt</span><span class="w"> </span><span class="n">o</span><span class="w"> </span><span class="n">Char</span><span class="p">.</span><span class="n">ord</span><span class="w"> </span><span class="n">o</span><span class="w"> </span><span class="n">s</span><span class="w"> </span><span class="n">&lt;\String</span><span class="p">.</span><span class="n">sub</span><span class="w"></span>\r
<span class="cm">(* Combining sectioning and composition *)</span><span class="w"></span>\r
\r
<span class="n">x</span><span class="w"> </span><span class="n">:=</span><span class="w"> </span><span class="n">s</span><span class="w"> </span><span class="n">&lt;\String</span><span class="p">.</span><span class="n">sub\&gt;</span><span class="w"> </span><span class="n">i</span><span class="w"></span>\r
<span class="cm">(* Assigning the result of an infixed application *)</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>In imperative languages, assignment usually has the lowest precedence\r
(ignoring statement separators). The precedence of <span class="monospaced">:=</span> in the\r
<a href="BasisLibrary"> Basis Library</a> is perhaps unnecessarily high, because\r
an expression of the form <span class="monospaced">r := x</span> always returns a unit, which makes\r
little sense to combine with anything. Dropping <span class="monospaced">:=</span> to the lowest\r
precedence level makes it behave more like in other imperative\r
languages.</p></div>\r
<div class="paragraph"><p>The case for <span class="monospaced">o</span> is different. With the exception of <span class="monospaced">before</span> and\r
<span class="monospaced">:=</span>, it doesn&#8217;t seem to make much sense to use <span class="monospaced">o</span> with any of the\r
operators defined by the <a href="BasisLibrary"> Basis Library</a> in an\r
unparenthesized expression. This is simply because none of the other\r
operators deal with functions. It would seem that the precedence of\r
<span class="monospaced">o</span> could be chosen completely arbitrarily from the set <span class="monospaced">{1, ..., 9}</span>\r
without having any adverse effects with respect to other infix\r
operators defined by the <a href="BasisLibrary"> Basis Library</a>.</p></div>\r
</div>\r
</div>\r
<div class="sect1">\r
<h2 id="_design_of_the_symbols">Design of the symbols</h2>\r
<div class="sectionbody">\r
<div class="paragraph"><p>The closest approximation of Haskell&#8217;s <span class="monospaced">x &grave;f&grave; y</span> syntax\r
achievable in Standard ML would probably be something like\r
<span class="monospaced">x &grave;f^ y</span>, but <span class="monospaced">^</span> is already used for string\r
concatenation by the <a href="BasisLibrary"> Basis Library</a>. Other\r
combinations of the characters <span class="monospaced">&grave;</span> and <span class="monospaced">^</span> would be\r
possible, but none seems clearly the best visually. The symbols <span class="monospaced">&lt;\</span>,\r
<span class="monospaced">\&gt;</span>, <span class="monospaced">&lt;/</span>, and <span class="monospaced">/&gt;</span> are reasonably concise and have a certain\r
self-documenting appearance and symmetry, which can help to remember\r
them.  As the names suggest, the symbols of the piping operators <span class="monospaced">&gt;|</span>\r
and <span class="monospaced">|&lt;</span> are inspired by Unix shell pipelines.</p></div>\r
</div>\r
</div>\r
<div class="sect1">\r
<h2 id="_also_see">Also see</h2>\r
<div class="sectionbody">\r
<div class="ulist"><ul>\r
<li>\r
<p>\r
<a href="Utilities">Utilities</a>\r
</p>\r
</li>\r
</ul></div>\r
</div>\r
</div>\r
</div>\r
<div id="footnotes"><hr></div>\r
<div id="footer">\r
<div id="footer-text">\r
</div>\r
<div id="footer-badges">\r
</div>\r
</div>\r
</body>\r
</html>\r