Download presentation
Presentation is loading. Please wait.
1
CSE 3302 Programming Languages Chengkai Li Spring 2008 Functional Programming Language: Haskell (cont’d) Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, 2008 1
2
Grading Homework (HW): 25%. (HW1, HW2, HW3, HW4, HW5) Machine Problems (MP): 20%. (MP1, MP2) Essays (ES): 10%. Midterm exam: 20%. Final exam: 25%. Bonus points: 5%. Based on class participation. some additional bonus points (in MP2, HW5) Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, 2008 2
3
Letter Grades curve-based The cutoffs for letter grades are based on your performance. Bonus point: can only increase your grade Example: cutoff for A: 88.5 your raw score: 86 bonus points: 3 your grade: B -> A (86+3>88.5) Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, 2008 3
4
What’s ahead HW4: due by April 21 st HW5: due by May 2nd Essay: have you started yet? (due at May 1 st ) Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, 2008 4
5
Grades on WebCT Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, 2008 5
6
Foldl and Foldr foldl :: (a -> b -> a) -> a -> [b] -> a foldl f z [] = z foldl f z (x:xs) = foldl f (f z x) xs foldr :: (a -> b -> b) -> b -> [a] -> b foldr f z [] = z foldr f z (x:xs) = f x (foldr f z xs) Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, 2008 6
![Foldl and Foldr foldl :: (a -> b -> a) -> a -> [b] -> a foldl f z [] = z foldl f z (x:xs) = foldl f (f z x) xs foldr :: (a -> b -> b) -> b -> [a] -> b foldr f z [] = z foldr f z (x:xs) = f x (foldr f z xs) Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li,](http://images.slideplayer.com./38/10795635/slides/slide_6.jpg "Foldl and Foldr foldl :: (a -> b -> a) -> a -> [b] -> a foldl f z [] = z foldl f z (x:xs) = foldl f (f z x) xs foldr :: (a -> b -> b) -> b -> [a] -> b foldr f z [] = z foldr f z (x:xs) = f x (foldr f z xs) Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li,")
7
Foldr: is right-associative Foldl: is left-associative Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, 2008 7 foldr (-) 1 [2,3,4] foldl (-) 1 [2,3,4] (section 3.3.2 in the tutorial)
![Foldr: is right-associative Foldl: is left-associative Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, foldr (-) 1 [2,3,4] foldl (-) 1 [2,3,4] (section in the tutorial)](http://images.slideplayer.com./38/10795635/slides/slide_7.jpg "Foldr: is right-associative Foldl: is left-associative Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, foldr (-) 1 [2,3,4] foldl (-) 1 [2,3,4] (section in the tutorial)")
8
Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, 2008 8 foldr v [x0,x1, …, xn] = x0 (x1 (…(xn v)…)) foldl v [x0,x1, …, xn] = (…((v x0) x1)…) xn
![Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, foldr v [x0,x1, …, xn] = x0 (x1 (…(xn v)…)) foldl v [x0,x1, …, xn] = (…((v x0) x1)…) xn](http://images.slideplayer.com./38/10795635/slides/slide_8.jpg "Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, foldr v [x0,x1, …, xn] = x0 (x1 (…(xn v)…)) foldl v [x0,x1, …, xn] = (…((v x0) x1)…) xn")
9
Lambda Expressions A function can be constructed without giving it a name by using a lambda expression. \x -> x+1 The nameless function that takes a number x and returns the result x+1. Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, 2008 9
10
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 Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, 2008 10
11
Another example means Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, 2008 11 compose f g x = f (g x) compose f g = \x -> f (g x)
12
Exercises 1.Write a recursive function sum n that returns 1 + 2 + …. + n Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, 2008 12
13
Exercises 2.Write a recursive function genlist n that returns [ 1, 2, …, n ]. Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, 2008 13
![Exercises 2.Write a recursive function genlist n that returns [ 1, 2, …, n ].](http://images.slideplayer.com./38/10795635/slides/slide_13.jpg "Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li,")
14
Exercises 2. (cont.)Check to make sure n>0, otherwise return empty list. Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, 2008 14
15
Exercises 3.Check if an element is a member of a list. Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, 2008 15
16
Exercises 4.Implement ++ Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, 2008 16
17
Exercises 4. (cont.) Merge two lists and return a list with elements sorted Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, 2008 17
18
Exercises 5.A triple (x,y,z) of positive integers is pythagorean if x^2+y^2=z^2. Using list comprehension to define a function pyths::Int->[(Int, Int, Int)] that returns the list of all pythagorean triples whose components are at most a given limit. For example: >pyths 10 [(3,4,5), (4,3,5), (6,8,10), (8,6,10)] Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, 2008 18
19
Exercises 5. (cont.) Make sure x <= y <= z Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, 2008 19
20
Exercises 6. Define list comprehension [ f x | x <- xs, p x] using map and filter. Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, 2008 20
![Exercises 6. Define list comprehension [ f x | x <- xs, p x] using map and filter.](http://images.slideplayer.com./38/10795635/slides/slide_20.jpg "Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li,")
21
Exercises 7. Define map f and filter p using foldr Lecture 20 – Functional Programming, Spring 2008 CSE3302 Programming Languages, UT-Arlington ©Chengkai Li, 2008 21
Similar presentations
![ML Lists.1 Standard ML Lists. ML Lists.2 Lists A list is a finite sequence of elements. [3,5,9] [a, list ] [] Elements may appear more than once.](/8/2339041/big_thumb.jpg "ML Lists.1 Standard ML Lists. ML Lists.2 Lists A list is a finite sequence of elements. [3,5,9] [a, list ] [] Elements may appear more than once.>")
![ML Lists.1 Standard ML Lists. ML Lists.2 Lists A list is a finite sequence of elements. [3,5,9] [a, list ] [] ML lists are immutable. Elements.](/11/3275740/big_thumb.jpg "ML Lists.1 Standard ML Lists. ML Lists.2 Lists A list is a finite sequence of elements. [3,5,9] [a, list ] [] ML lists are immutable. Elements.>")
