@@ -1,5 +1,7 @@
11\section{Provisional Definitions}
22
3+\label{sect:provisional}
4+
35Sometimes when programming with dependent types, the type required by the type
46checker and the type of the program we have written will be different (in that
57they do not have the same normal form), but nevertheless provably equal. For
@@ -195,6 +197,19 @@ We can complete this proof using the \texttt{trivial} tactic, which finds
195197\texttt{value} in the premisses. The proof of the second lemma proceeds in
196198exactly the same way.
197199
200+We can now test the \texttt{natToBin} function from Section
201+\ref{sect:nattobin} at the prompt. 42 is 101010 in
202+binary. The binary digits are reversed:
203+
204+\begin{SaveVerbatim}{ntbtest}
205+
206+*views> show (natToBin 42)
207+"[False, True, False, True, False, True]" : String
208+
209+\end{SaveVerbatim}
210+\useverb{ntbtest}
211+
212+
198213\subsection{Suspension of Disbelief}
199214
200215\Idris{} requires that proofs be complete before compiling programs (although