Basic Haskell: higher-order functions

	Currying
	Infix operators versus prefix functions
	Operator sections
	The map functional
	Higher-order predicates
	The fold functions
	Other useful higher-order functions The standard Prelude defines scores of useful functions, many of which enjoy great generality due to the abstractional capabilities of polymorphic types and higher-order functions > zipWith (*) [1..10] [1..10] [1,4,9,16,25,36,49,64,81,100] > :t replicate replicate :: Int -> a -> [a] > zipWith replicate [1..6] ['a'..'z'] ["a","bb","ccc","dddd","eeeee","ffffff"] > takeWhile (<100) [ 2^n | n<-[1..] ] [2,4,8,16,32,64] > :t takeWhile takeWhile :: (a -> Bool) -> [a] -> [a]