# HG changeset patch
# User Adam Chlipala <adam@chlipala.net>
# Date 1425585514 18000
# Node ID 1218daa14279f092b823a2c14fae1380fe36dfa1
# Parent  8cf40452c900cacdefc9a6d4b14b0e7b80dfc9e9
Document new infix operators

diff -r 8cf40452c900 -r 1218daa14279 doc/manual.tex
--- a/doc/manual.tex	Thu Mar 05 14:50:31 2015 -0500
+++ b/doc/manual.tex	Thu Mar 05 14:58:34 2015 -0500
@@ -632,6 +632,8 @@
 
 It is possible to write a $\mt{let}$ expression with its constituents in reverse order, along the lines of Haskell's \cd{where}.  An expression $\mt{let} \; e \; \mt{where} \; ed^* \; \mt{end}$ desugars to $\mt{let} \; ed^* \; \mt{in} \; e \; \mt{end}$.
 
+Ur/Web also includes a few more infix operators: $f \; \texttt{<|} \; x$ desugars to $f \; x$, $x \; \texttt{|>} \; f$ to $f \; x$, $f \; \texttt{<{}<{}<} \; g$ to $\mt{Top}.\mt{compose} \; f \; g$, and $g \; \texttt{>{}>{}>} \; f$ to $\mt{Top}.\mt{compose} \; f \; g$.  (The latter two are doing function composition in the usual way.)  Furthermore, any identifier may be changed into an infix operator by placing it between backticks, e.g. a silly way to do addition is $x \; \texttt{`}\mt{plus}\texttt{`} \; y$ instead of $x + y$.
+
 
 \section{Static Semantics}