hasufell/haskell-lectures
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Add more questions

Browse Source
This commit is contained in:
Julian Ospald 2015-04-21 00:24:45 +02:00
parent 717c1b370f
commit 002ba1d830
No known key found for this signature in database
GPG Key ID: 220CD1C5BDEED020
1 changed files with 11 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
VL2/content/VL2_questions_for_you.tex
View File

@ -3,7 +3,17 @@
\item what is the difference between \hinline{foldr} and \hinline{foldl}? \item what is the difference between \hinline{foldr} and \hinline{foldl}?
\item what is the difference between explicit and implicit recursion? Give examples \item what is the difference between explicit and implicit recursion? Give examples
\item how many arguments does a haskell function have (strictly speaking)? \item how many arguments does a haskell function have (strictly speaking)?
\item Are these type signatures technically equivalent?
\begin{haskellcode}
f :: Int -> Int -> Char -> Int -> Int -> Char
f :: Int -> Int -> (Char -> (Int -> (Int -> Char)))
\end{haskellcode}
% $
\item what do you have to keep in mind in order to make function composition work? \item what do you have to keep in mind in order to make function composition work?
\item can you define \hinline{map} and \hinline{filter} in terms of \hinline{foldr}? \item can you define \hinline{map} and \hinline{filter} in terms of \hinline{foldr}?
\item what is eta reduction (or: eta abstraction)? \item simplify (and eta reduce) the following code snippet
\begin{haskellcode}
f x y = (\d e -> d * e) x $ y
\end{haskellcode}
% $
\end{itemize} \end{itemize}