Improve prettiness of list comprehension

This commit is contained in:
Julian Ospald 2015-04-20 15:07:59 +02:00
parent 25f4783b07
commit b20d4cadfc
No known key found for this signature in database
GPG Key ID: 220CD1C5BDEED020
1 changed files with 1 additions and 1 deletions

View File

@ -8,7 +8,7 @@ $S = \{2 \times x\ |\ x \in \mathbb{N},\ x \leq 10\}$
How does this look in haskell?
\pause
\begin{haskellcode}
> [x*2 | x <- [1..10]]
> [ 2 * x | x <- [1..10]]
\end{haskellcode}
\pause
Now let's say we want all numbers between 50 and 100 that have the remainder 0 when divided by 12: