Révision 243 CSL17/preliminaries.tex

preliminaries.tex (revision 243)
151 151 
	\begin{itemize}
152 152 
	\item The boolean predicates $\notfn (;x)$,  $\andfn(;x,y)$, $\orfn(;x,y)$, $\equivfn(;x,y)$ can all be defined on safe arguments, simply by computing by case distinction using the conditional function.
153 153 
	%\item $\bit(l;x)$ returns the $\mode l$th bit of $x$.
154 
	\item We can define the function $\bit(l;x)$ which returns the $|l|$th least significant bit of $x$. For instance $\bit(11;1011)=0$.
154 
	\item We can define the function $\bit(l;x)$ which returns the $|l|$th least significant bit of $x$. For instance $\bit(11;1101)=0$.
155 155
156 156 
	For that let us first define the function $\shorten(l;x)$ which returns the $|x|- |l|+1$ prefix of $x$, as follows:
157 157 
	\begin{eqnarray*}

Formats disponibles : Unified diff