0 PROGRAMMING IN HASKELL Chapter 4 - Defining Functions.

0 PROGRAMMING IN HASKELL Chapter 4 - Defining Functions. slide 0
Download 0 PROGRAMMING IN HASKELL Chapter 4 - Defining Functions.

Post on 19-Dec-2015

216 views

Category:

Documents

2 download

TRANSCRIPT

  • Slide 1
  • 0 PROGRAMMING IN HASKELL Chapter 4 - Defining Functions
  • Slide 2
  • 1 Conditional Expressions As in most programming languages, functions can be defined using conditional expressions. abs :: Int Int abs n = if n 0 then n else -n abs takes an integer n and returns n if it is non-negative and -n otherwise.
  • Slide 3
  • 2 Conditional expressions can be nested: signum :: Int Int signum n = if n < 0 then -1 else if n == 0 then 0 else 1 zIn Haskell, conditional expressions must always have an else branch, which avoids any possible ambiguity problems with nested conditionals. Note:
  • Slide 4
  • 3 Guarded Equations As an alternative to conditionals, functions can also be defined using guarded equations. abs n | n 0 = n | otherwise = -n As previously, but using guarded equations.
  • Slide 5
  • 4 Guarded equations can be used to make definitions involving multiple conditions easier to read: zThe catch all condition otherwise is defined in the prelude by otherwise = True. Note: signum n | n < 0 = -1 | n == 0 = 0 | otherwise = 1
  • Slide 6
  • 5 Pattern Matching Many functions have a particularly clear definition using pattern matching on their arguments. not :: Bool Bool not False = True not True = False not maps False to True, and True to False.
  • Slide 7
  • 6 Functions can often be defined in many different ways using pattern matching. For example (&&) :: Bool Bool Bool True && True = True True && False = False False && True = False False && False = False True && True = True _ && _ = False can be defined more compactly by
  • Slide 8
  • 7 True && b = b False && _ = False However, the following definition is more efficient, because it avoids evaluating the second argument if the first argument is False: zThe underscore symbol _ is a wildcard pattern that matches any argument value. Note:
  • Slide 9
  • 8 zPatterns may not repeat variables. For example, the following definition gives an error: b && b = b _ && _ = False zPatterns are matched in order. For example, the following definition always returns False: _ && _ = False True && True = True
  • Slide 10
  • 9 List Patterns Internally, every non-empty list is constructed by repeated use of an operator (:) called cons that adds an element to the start of a list. [1,2,3,4] Means 1:(2:(3:(4:[]))).
  • Slide 11
  • 10 Functions on lists can be defined using x:xs patterns. head :: [a] a head (x:_) = x tail :: [a] [a] tail (_:xs) = xs head and tail map any non-empty list to its first and remaining elements.
  • Slide 12
  • 11 Note: zx:xs patterns must be parenthesised, because application has priority over (:). For example, the following definition gives an error: zx:xs patterns only match non-empty lists: > head [] Error head x:_ = x
  • Slide 13
  • 12 Integer Patterns pred :: Int Int pred (n+1) = n As in mathematics, functions on integers can be defined using n+k patterns, where n is an integer variable and k>0 is an integer constant. pred maps any positive integer to its predecessor.
  • Slide 14
  • 13 Note: zn+k patterns must be parenthesised, because application has priority over +. For example, the following definition gives an error: zn+k patterns only match integers k. > pred 0 Error pred n+1 = n
  • Slide 15
  • 14 Lambda Expressions Functions can be constructed without naming the functions by using lambda expressions. x x+x the nameless function that takes a number x and returns the result x+x.
  • Slide 16
  • 15 zThe symbol is the Greek letter lambda, and is typed at the keyboard as a backslash \. zIn mathematics, nameless functions are usually denoted using the symbol, as in x x+x. zIn Haskell, the use of the symbol for nameless functions comes from the lambda calculus, the theory of functions on which Haskell is based. Note:
  • Slide 17
  • 16 Why Are Lambda's Useful? Lambda expressions can be used to give a formal meaning to functions defined using currying. For example: add x y = x+y add = x ( y x+y) means
  • Slide 18
  • 17 const :: a b a const x _ = x is more naturally defined by const :: a (b a) const x = _ x Lambda expressions are also useful when defining functions that return functions as results. For example:
  • Slide 19
  • 18 odds n = map f [0..n-1] where f x = x*2 + 1 can be simplified to odds n = map ( x x*2 + 1) [0..n-1] Lambda expressions can be used to avoid naming functions that are only referenced once. For example:
  • Slide 20
  • 19 Sections An operator written between its two arguments can be converted into a curried function written before its two arguments by using parentheses. For example: > 1+2 3 > (+) 1 2 3
  • Slide 21
  • 20 This convention also allows one of the arguments of the operator to be included in the parentheses. For example: > (1+) 2 3 > (+2) 1 3 In general, if is an operator then functions of the form ( ), (x ) and ( y) are called sections.
  • Slide 22
  • 21 Why Are Sections Useful? Useful functions can sometimes be constructed in a simple way using sections. For example: - successor function - reciprocation function - doubling function - halving function (1+) (*2) (/2) (1/)
  • Slide 23
  • 22 Exercises Consider a function safetail that behaves in the same way as tail, except that safetail maps the empty list to the empty list, whereas tail gives an error in this case. Define safetail using: (a)a conditional expression; (b)guarded equations; (c)pattern matching. Hint: the library function null :: [a] Bool can be used to test if a list is empty. (1)
  • Slide 24
  • 23 Give three possible definitions for the logical or operator (||) using pattern matching. (2) Redefine the following version of (&&) using conditionals rather than patterns: (3) True && True = True _ && _ = False Do the same for the following version:(4) True && b = b False && _ = False