From 886987ab09235d044a4cc000b979f9ba5aade80b Mon Sep 17 00:00:00 2001
From: jim
Date: Sun, 8 Feb 2015 19:29:28 -0500
Subject: [PATCH 1/1] s/first/shortest/
---
topics/week3_lists.mdwn | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/topics/week3_lists.mdwn b/topics/week3_lists.mdwn
index 14663cda..6f7c1e0f 100644
--- a/topics/week3_lists.mdwn
+++ b/topics/week3_lists.mdwn
@@ -48,7 +48,7 @@ Haskell also has an extension that permits you to iterate over multiple lists *i
[ 10*x + y | y <- [4, 5, 6] | x <- [1, 2, 3] ]
-will evaluate to `[14, 25, 36]`. If the lists are of unequal length, Haskell stops when it exhausts the first. These behaviors are similar to the `map2` function you defined in the week 1 homework. That also took an argument from each of several sequences in parallel. (The corresponding functions in Haskell are called `zip` and `zipWith`.)
+will evaluate to `[14, 25, 36]`. If the lists are of unequal length, Haskell stops when it exhausts the shortest. These behaviors are similar to the `map2` function you defined in the week 1 homework. That also took an argument from each of several sequences in parallel. (The corresponding functions in Haskell are called `zip` and `zipWith`.)
OCaml [permits lists comprehensions as an extension](http://stackoverflow.com/questions/27652428/list-comprehension-in-ocaml), and [so too does Scheme](http://srfi.schemers.org/srfi-42/srfi-42.html), but these are a bit harder to use.
--
2.11.0