10 lines
663 B
TeX
10 lines
663 B
TeX
How about \emph{recursion}? Let's define the modulo of any \emph{Int} to \emph{2}.
|
|
\pause
|
|
\begin{haskellcode}
|
|
mod2 :: Int -> Int
|
|
mod2 x
|
|
| x - 2 == 0 = 0
|
|
| x - 2 < 0 = x
|
|
| otherwise = mod2 (x - 2)
|
|
\end{haskellcode}
|
|
These \verb#|# things above are called \textbf{guards} and are similar to \emph{pattern matching}. They are processed in order. If the condition on the left side of the equation is true, then it returns what stands on the right side of the equation. If it's false, then it processes the next line.\\ \code{otherwise} on the last line is just defined as \code{True}, to make these constructs easier to read and catch all other cases of input. |