1. Lecture 14: Advanced Topic: Functional Programming
CS5363 Compiler and
Programming Languages

2. Outline Basic Concepts Types and Classes Lists Recursions
High Order Functions

3. What is Functional Programming?
Opinions differ, and it is difficult to give a precise definition, but generally speaking:
Functional programming is style of programming in which the basic method of computation is the application of functions to arguments;
A functional language is one that supports and encourages the functional style.

4. Example Summing the integers 1 to 10 in Java:
total = 0;
for (i = 1; i  10; ++i)
total = total+i;
The computation method is variable assignment. 4

5. Example Summing the integers 1 to 10 in Haskell:
The computation method is function application. 5

6. Why is it Useful?
Again, there are many possible answers to this question, but generally speaking:
The abstract nature of functional programming leads to considerably simpler programs;
It also supports a number of powerful new ways to structure and reason about programs.

7. What is Hugs?
An interpreter for Haskell, and the most widely used implementation of the language;
An interactive system, which is well-suited for teaching and prototyping purposes;
Hugs is freely available from:

8. The Standard Prelude
When Hugs is started it first loads the library file Prelude.hs, and then repeatedly prompts the user for an expression to be evaluated.
For example:
> 2+3*4 14
> (2+3)*4 20

9. The standard prelude also provides many useful functions that operate on lists. For example:
> length [1,2,3,4] 4
> product [1,2,3,4] 24
> take 3 [1,2,3,4,5]
[1,2,3]

10. Function Application
In mathematics, function application is denoted using parentheses, and multiplication is often denoted using juxtaposition or space.
f(a,b) + c d
Apply the function f to a and b, and add the result to the product of c and d.

11. As previously, but in Haskell syntax.
In Haskell, function application is denoted using space, and multiplication is denoted using *.
f a b + c*d
As previously, but in Haskell syntax.

12. Means (f a) + b, rather than f (a + b).
Moreover, function application is assumed to have higher priority than all other operators.
f a + b
Means (f a) + b, rather than f (a + b).

13. Examples Mathematics Haskell f(x) f x f(x,y) f x y f(g(x)) f (g x)
f(x,g(y))
f(x)g(y)
f x
f x y
f (g x)
f x (g y)
f x * g y

14. My First Script
When developing a Haskell script, it is useful to keep two windows open, one running an editor for the script, and the other running Hugs.
Start an editor, type in the following two function definitions, and save the script as test.hs:
double x = x + x
quadruple x = double (double x)

15. Leaving the editor open, in another window start up Hugs with the new script:
% hugs test.hs
Now both Prelude.hs and test.hs are loaded, and functions from both scripts can be used:
> quadruple 10 40
> take (double 2) [1..6]
[1,2,3,4]

16. div is enclosed in back quotes, not forward;
Leaving Hugs open, return to the editor, add the following two definitions, and resave:
factorial n = product [1..n]
average ns = sum ns `div` length ns
Note:
div is enclosed in back quotes, not forward;
x `f` y is just syntactic sugar for f x y.

17. Hugs does not automatically reload scripts when they are changed, so a reload command must be executed before the new definitions can be used:
> :reload
Reading file "test.hs"
> factorial 10
> average [1..5] 3

18. Outline Basic Concepts Types and Classes Lists Recursions
High Order Functions

19. All functions that map a logical value to a logical value.
What is a Type?
A type is a collection of related values.
Bool
The logical values
False and True.
All functions that map a logical value to a logical value.
Bool  Bool

20. Types in Haskell
We use the notation e :: T to mean that evaluating the expression e will produce a value of type T.
False :: Bool
not :: Bool  Bool
not False :: Bool
False && True :: Bool

21. Note:
Every expression must have a valid type, which is calculated prior to evaluating the expression by a process called type inference;
Haskell programs are type safe, because type errors can never occur during evaluation;
Type inference detects a very large class of programming errors, and is one of the most powerful and useful features of Haskell.

22. Basic Types Haskell has a number of basic types, including:
Char
String
Integer
Int
Bool
- Logical values
- Single characters
- Strings of characters
- Fixed-precision integers
- Arbitrary-precision integers

23. List Types A list is sequence of values of the same type: In general:
[False,True,False] :: [Bool]
[’a’,’b’,’c’,’d’] :: [Char]
In general:
[T] is the type of lists with elements of type T.

24. The type of a list says nothing about its length:
Note:
The type of a list says nothing about its length:
[False,True] :: [Bool]
[False,True,False] :: [Bool]
The type of the elements is unrestricted. For example, we can have lists of lists:
[[’a’],[’b’,’c’]] :: [[Char]]

25. Tuple Types A tuple is a sequence of values of different types:
(False,True) :: (Bool,Bool)
(False,’a’,True) :: (Bool,Char,Bool)
In general:
(T1,T2,…,Tn) is the type of n-tuples whose ith components have type Ti for any i in 1…n.

26. The type of a tuple encodes its arity:
Note:
The type of a tuple encodes its arity:
(False,True) :: (Bool,Bool)
(False,True,False) :: (Bool,Bool,Bool)
The type of the components is unrestricted:
(’a’,(False,’b’)) :: (Char,(Bool,Char))
(True,[’a’,’b’]) :: (Bool,[Char])

27. Function Types
A function is a mapping from values of one type to values of another type:
not :: Bool  Bool
isDigit :: Char  Bool
In general:
T1  T2 is the type of functions that map arguments of type T1 to results of type T2.

28. Note:
The argument and result types are unrestricted. For example, functions with multiple arguments or results are possible using lists or tuples:
add :: (Int,Int)  Int
add (x,y) = x+y
zeroto :: Int  [Int]
zeroto n = [0..n]

29. What are the types of the following values?
[’a’,’b’,’c’]
(’a’,’b’,’c’)
[(False,’0’),(True,’1’)]
[isDigit,isLower,isUpper]
[char -> boolean]

30. Curried Functions
Functions with multiple arguments are also possible by returning functions as results:
add’ :: Int  (Int  Int)
(add’ x) y = x + y
f = add’ x
f y = x + y
add’ takes an integer x and returns a function. In turn, this function takes an integer y and returns the result x+y.

31. Note:
add and add’ produce the same final result, but add takes its two arguments at the same time, whereas add’ takes them one at a time:
add :: (Int,Int)  Int
add’ :: Int  (Int  Int)
Functions that take their arguments one at a time are called curried functions.

32. Functions with more than two arguments can be curried by returning nested functions:
mult :: Int  (Int  (Int  Int))
mult x y z = x*y*z
mult takes an integer x and returns a function, which in turn takes an integer y and returns a function, which finally takes an integer z and returns the result x*y*z.

33. Means Int  (Int  (Int  Int)).
Curry Conventions
To avoid excess parentheses when using curried functions, two simple conventions are adopted:
The arrow  associates to the right.
Int  Int  Int  Int
Means Int  (Int  (Int  Int)).

34. As a consequence, it is then natural for function application to associate to the left.
mult x y z
Means ((mult x) y) z.
Unless tupling is explicitly required, all functions in Haskell are normally defined in curried form.

35. Polymorphic Types
The function length calculates the length of any list, irrespective of the type of its elements.
> length [1,3,5,7] 4
> length ["Yes","No"] 2
> length [isDigit,isLower,isUpper] 3

36. A type with variables is called polymorphic.
This idea is made precise in the type for length by the inclusion of a type variable:
length :: [a]  Int
For any type a, length takes a list of values of type a and returns an integer.
A type with variables is called polymorphic.

37. Note:
Many of the functions defined in the standard prelude are polymorphic. For example:
fst :: (a,b)  a
head :: [a]  a
take :: Int  [a]  [a]
zip :: [a]  [b]  [(a,b)]

38. Overloaded Types
The arithmetic operator + calculates the sum of any two numbers of the same numeric type.
For example:
> 1+2 3
>
3.3

39. A type with constraints is called overloaded.
This idea is made precise in the type for + by the inclusion of a class constraint:
(+) :: Num a  a  a  a
For any type a in the class Num of numeric types, + takes two values of type a and returns another.
A type with constraints is called overloaded.

40. Types whose values can be compared for equality and difference using
Classes in Haskell
A class is a collection of types that support certain operations, called the methods of the class.
Types whose values can be compared for equality and difference using
(==) :: a  a  Bool
(/=) :: a  a  Bool Eq

41. Haskell has a number of basic classes, including:
- Equality types Eq
- Ordered types
Ord
Show
- Showable types
Read
- Readable types
Num
- Numeric types

42. Example methods: (==) :: Eq a  a  a  Bool
(<) :: Ord a  a  a  Bool
show :: Show a  a  String
read :: Read a  String  a
() :: Num a  a  a  a

43. What are the types of the following functions?
second xs = head (tail xs)
swap (x,y) = (y,x)
pair x y = (x,y)
a -> b -> (a, b)
double x = x*2
Num a => a -> a
palindrome xs = reverse xs == xs
twice f x = f (f x)
(a -> a) -> a -> a

44. 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.

45. Conditional expressions can be nested:
signum :: Int  Int
signum n = if n < 0 then -1 else
if n == 0 then 0 else 1
Note:
In Haskell, conditional expressions must always have an else branch, which avoids any possible ambiguity problems with nested conditionals.

46. As previously, but using guarded equations.
As an alternative to conditionals, functions can also be defined using guarded equations.
abs n | n  = n
| otherwise = -n
As previously, but using guarded equations.

47. Guarded equations can be used to make definitions involving multiple conditions easier to read:
signum n | n < = -1
| n == 0 = 0
| otherwise = 1
Note:
The catch all condition otherwise is defined in the prelude by otherwise = True.

48. not maps False to True, and True to False.
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.

49. can be defined more compactly by
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
can be defined more compactly by
True && True = True
_ && _ = False

50. However, the following definition is more efficient, as it avoids evaluating the second argument if the first argument is False:
False && _ = False
True && b = b
Note:
The underscore symbol _ is the wildcard pattern that matches any argument value.

51. Outline Basic Concepts Types and Classes Lists Recursions
High Order Functions

52. List Patterns
In Haskell, every non-empty list is constructed by repeated use of an operator : called “cons” that adds a new element to the start of a list.
[1,2,3]
Means 1:(2:(3:[])).

53. The cons operator can also be used in patterns, in which case it destructs a non-empty list.
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.

54. Set Comprehensions
In mathematics, the comprehension notation can be used to construct new sets from old sets.
{x2 | x  {1..5}}
The set {1,4,9,16,25} of all numbers x2 such that x is an element of the set {1..5}.

55. Lists Comprehensions
In Haskell, a similar comprehension notation can be used to construct new lists from old lists.
[x^2 | x  [1..5]]
The list [1,4,9,16,25] of all numbers x^2 such that x is an element of the list [1..5].

56. Note:
The expression x  [1..5] is called a generator, as it states how to generate values for x.
Comprehensions can have multiple generators, separated by commas. For example:
> [(x,y) | x  [1..3], y  [1..2]]
[(1,1),(1,2),(2,1),(2,2),(3,1),(3,2)]

57. Changing the order of the generators changes the order of the elements in the final list:
> [(x,y) | y  [1..2], x  [1..3]]
[(1,1),(2,1),(3,1),(1,2),(2,2),(3,2)]
Multiple generators are like nested loops, with later generators as more deeply nested loops whose variables change value more frequently.

58. The list [(1,1),(1,2),(1,3),(2,2),(2,3),(3,3)]
Dependant Generators
Later generators can depend on the variables that are introduced by earlier generators.
[(x,y) | x  [1..3], y  [x..3]]
The list [(1,1),(1,2),(1,3),(2,2),(2,3),(3,3)]
of all pairs of numbers (x,y) such that x,y are elements of the list [1..3] and x  y.

59. Using a dependant generator we can define the library function that concatenates a list of lists:
concat :: [[a]]  [a]
concat xss = [x | xs  xss, x  xs]
For example:
> concat [[1,2,3],[4,5],[6]]
[1,2,3,4,5,6]

60. Guards
List comprehensions can use guards to restrict the values produced by earlier generators.
[x | x  [1..10], even x]
The list [2,4,6,8,10] of all numbers x such that x is an element of the list [1..10] and x is even.

61. Using a guard we can define a function that maps a positive integer to its list of factors:
factors :: Int  [Int]
factors n = [x | x  [1..n]
, n `mod` x == 0]
For example:
> factors 15
[1,3,5,15]

62. A positive integer is prime if its only factors are 1 and itself
A positive integer is prime if its only factors are 1 and itself. Hence, using factors we can define a function that decides if a number is prime:
prime :: Int  Bool
prime n = factors n == [1,n]
For example:
> prime 15
False
> prime 7
True

63. Using a guard we can now define a function that returns the list of all primes up to a given limit:
primes :: Int  [Int]
primes n = [x | x  [1..n], prime x]
For example:
> primes 40
[2,3,5,7,11,13,17,19,23,29,31,37]

64. Outline Basic Concepts Types and Classes Lists Recursions
High Order Functions

65. Introduction
As we have seen, many functions can naturally be defined in terms of other functions.
factorial :: Int  Int
factorial n = product [1..n]
factorial maps any integer n to the product of the integers between 1 and n.

66. Expressions are evaluated by a stepwise process of applying functions to their arguments.
For example:
factorial 3
product [1..3] =
product [1,2,3] =
1*2*3 = 6 =

67. Recursive Functions
In Haskell, functions can also be defined in terms of themselves. Such functions are called recursive.
factorial 0 = 1
factorial n = n * factorial (n-1)
factorial maps 0 to 1, and any other integer to the product of itself with the factorial of its predecessor.

68. For example: = = = = = = = factorial 3 3 * factorial 2
3 * (2 * (1 * 1)) =
3 * (2 * 1) =
3 * 2 = = 6

69. Why is Recursion Useful?
Some functions, such as factorial, are simpler to define in terms of other functions;
In practice, however, most functions can naturally be defined in terms of themselves;
Properties of functions defined using recursion can be proved using the simple but powerful mathematical technique of induction.

70. Recursion on Lists
Recursion is not restricted to numbers, but can also be used to define functions on lists.
product :: [Int]  Int
product [] = 1
product (x:xs) = x * product xs
product maps the empty list to 1, and any non-empty list to its head multiplied by the product of its tail.

71. For example: = = = = = = product [1,2,3] product (1:(2:(3:[])))
1 * (2 * (3 * 1)) = 6 =

72. Quicksort
The quicksort algorithm for sorting a list of integers can be specified by the following two rules:
The empty list is already sorted;
Non-empty lists can be sorted by sorting the tail values  the head, sorting the tail values  the head, and then appending the resulting lists on either side of the head value.

73. Using recursion, this specification can be translated directly into an implementation:
qsort :: [Int]  [Int]
qsort [] = []
qsort (x:xs) = qsort [a | a  xs, a  x]
++ [x] ++
qsort [b | b  xs, b  x]
Note:
This is probably the simplest implementation of quicksort in any programming language!

74. For example (abbreviating qsort as q):
++ [3] ++
q [4,5]
q [1]
q []
++ [2] ++
q []
q [5]
++ [4] ++
[1] [] []
[5]

75. Outline Basic Concepts Types and Classes Lists Recursions
High Order Functions

76. Introduction
A function is called higher-order if it takes a function as an argument or returns a function as a result.
twice :: (a  a)  a  a
twice f x = f (f x)
twice is higher-order because it
takes a function as its first argument.

77. Why Are They Useful?
Common programming idioms, such as applying a function twice, can naturally be encapsulated as general purpose higher-order functions;
Special purpose languages can be defined within Haskell using higher-order functions, such as for list processing, interaction, or parsing;
Algebraic properties of higher-order functions can be used to reason about programs.

78. The Map Function
The higher-order library function called map applies a function to every element of a list.
map :: (a  b)  [a]  [b]
For example:
> map (+1) [1,3,5,7]
[2,4,6,8]

79. The map function can be defined in a particularly simple manner using a list comprehension:
map f xs = [f x | x  xs]
# x y = f x : y
map f = foldr # []
Alternatively, for the purposes of proofs, the map function can also be defined using recursion:
map f [] = []
map f (x:xs) = f x : map f xs

80. filter :: (a  Bool)  [a]  [a]
The Filter Function
The higher-order library function filter selects every element from a list that satisfies a predicate.
filter :: (a  Bool)  [a]  [a]
For example:
> filter even [1..10]
[2,4,6,8,10]

81. filter p xs = [x | x  xs, p x]
Filter can be defined using a list comprehension:
filter p xs = [x | x  xs, p x]
Alternatively, it can be defined using recursion:
filter p [] = []
filter p (x:xs)
| p x = x : filter p xs
| otherwise = filter p xs

82. The Foldr Function
A number of functions on lists can be defined using the following simple pattern of recursion:
f [] = v
f (x:xs) = x  f xs
f maps the empty list to a value v, and any non-empty list to a function  applied to its head and f of its tail.

83. v = 0 v = 1 v = True For example: sum [] = 0 sum (x:xs) = x + sum xs
 = +
product [] = 1
product (x:xs) = x * product xs
v = 1
 = *
and [] = True
and (x:xs) = x && and xs
v = True
 = &&

84. The higher-order library function foldr (“fold right”) encapsulates this simple pattern of recursion, with the function  and the value v as arguments.
For example:
sum = foldr (+) 0
product = foldr (*) 1
and = foldr (&&) True

85. Foldr itself can be defined using recursion:
foldr () v [] = v
foldr () v (x:xs) =
x  foldr () v xs
In practice, however, it is better to think of foldr non-recursively, as simultaneously replacing each
cons in a list by a function, and [] by a value.

86. For example: = = = = Replace each cons by + and [] by 0. sum [1,2,3]
foldr (+) 0 [1,2,3] =
foldr (+) 0 (1:(2:(3:[]))) =
1+(2+(3+0)) = 6 =
Replace each cons
by + and [] by 0.

87. Why Is Foldr Useful?
Some recursive functions on lists, such as sum, are simpler to define using foldr;
Properties of functions defined using foldr can be proved using algebraic properties of foldr, such as fusion and the banana split rule;
Advanced program optimisations can be simpler if foldr is used in place of explicit recursion.