CSCE 314 Programming Languages - TAMU Computer Science ...

More documents

Recommendations

Info

Using recursion, this specification can betranslated directly into an implementation:Note:qsort :: [Int] -> [Int]qsort [] = []qsort (x:xs) =qsort smaller ++ [x] ++ qsort largerwheresmaller = [a | a
For example (abbreviating qsort as q):q [3,2,4,1,5]q [2,1] ++ [3] ++ q [4,5]q [1] ++ [2] ++ q [] q [] ++ [4] ++ q [5][1] [] [] [5]47
Page 1 and 2: CSCE 314Programming LanguagesHaskel
Page 3 and 4: Conditional ExpressionsAs in most p
Page 5 and 6: Guarded Equations (Cont.)Guards and
Page 7 and 8: Functions can often be defined in m
Page 9 and 10: List PatternsInternally, every non-
Page 11 and 12: Totality of Functions (Total) funct
Page 13 and 14: Why Are Lambda's Useful?1. Lambda e
Page 15 and 16: Case ExpressionsPattern matching ne
Page 17 and 18: Let vs. WhereThe let … in … is
Page 19 and 20: Why Are Sections Useful?Useful func
Page 21 and 22: (2)(3)Give three possible definitio
Page 23 and 24: List Comprehensions A convenient sy
Page 25 and 26: For example:> [(x,y) | y
Page 27 and 28: GuardsList comprehensions can use g
Page 29 and 30: The Zip FunctionA useful library fu
Page 31 and 32: Exercises(1)A triple (x,y,z) of pos
Page 33 and 34: (3)The scalar product of two lists
Page 35 and 36: A Function without RecursionMany fu
Page 37 and 38: Note: The base case factorial 0 = 1
Page 39 and 40: Recursion on ListsLists have natura
Page 41 and 42: Using a similar pattern of recursio
Page 43 and 44: Laziness RevisitedLaziness interact
Page 45: QuicksortThe quicksort algorithm fo
Page 49 and 50: Produce a list with n identical ele
Page 51: (3) Define a recursive functionmsor

CSCE 314 Programming Languages - TAMU Computer Science ...

Create successful ePaper yourself

Delete template?

Save as template?