From b20d4cadfcda8bebb2b5fe25394f65db7ed508bf Mon Sep 17 00:00:00 2001
From: Julian Ospald <jospald@fh-bielefeld.de>
Date: Mon, 20 Apr 2015 15:07:59 +0200
Subject: [PATCH] Improve prettiness of list comprehension

---
 VL1/content/VL1_write_haskell9.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/VL1/content/VL1_write_haskell9.tex b/VL1/content/VL1_write_haskell9.tex
index 748d525..991c076 100644
--- a/VL1/content/VL1_write_haskell9.tex
+++ b/VL1/content/VL1_write_haskell9.tex
@@ -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: