Basic types, Lists, Trees, Higher-order functions

More documents

Recommendations

Info

List constructors: [], nil and ::<strong>Lists</strong> are generated as follows:• the empty list is a list, designated [] or nil• if x is an element and xs is a list,then so is x :: xs(type consistency):: associate to the right, i.e. x 1 ::x 2 ::xs means x 1 ::(x 2 ::xs)c○Michael R. Hansen, Spring 2005 – p.17/59
List constructors: [], nil and ::<strong>Lists</strong> are generated as follows:• the empty list is a list, designated [] or nil• if x is an element and xs is a list,then so is x :: xs(type consistency):: associate to the right, i.e. x 1 ::x 2 ::xs means x 1 ::(x 2 ::xs)::❅ ❅❅x 1 ::x 2❅ ❅❅xsGraph for x 1 ::x 2 ::xsc○Michael R. Hansen, Spring 2005 – p.17/59
Page 3 and 4: Basic Types: IntegersA data type co
Page 5 and 6: RealsType name : realValues : ˜27.
Page 7 and 8: Overloaded Operators and Type infer
Page 13 and 14: CharactersType name charValues #"a"
Page 15 and 16: BooleansType name boolValues false,
Page 17 and 18: Tuple patternsExtract components of
Page 19 and 20: Let expressions — let dec in e en
Page 21 and 22: Lists: Overview• values and const
Page 23 and 24: ListsA list is a finite sequence of
Page 29 and 30: Trees for listsA non-empty list [x
Page 31: List constructors: [], nil and ::Li
Page 35 and 36: AppendThe infix operator @ (called
Page 37 and 38: Append: polymorphic type> infixr 5
Page 39 and 40: Membership — equality typesDeclar
Page 41 and 42: Examples• remove(x, ys) : removes
Page 43 and 44: Disjoint Sets: An ExampleA shape is
Page 45 and 46: Constructors in Patternsfun area(Ci
Page 47 and 48: Enumeration types - the order typed
Page 49 and 50: smallest — continuedThe predefine
Page 51 and 52: TreesA finite tree is a value which
Page 53 and 54: Binary TreesA recursive datatype is
Page 55 and 56: Binary search trees: InsertionRecur
Page 57 and 58: Deletions in search treesDelete min
Page 59 and 60: Expressions: Computation of valuesc
Page 61 and 62: Higher-order functionsA function f
Page 63 and 64: Anonymous functionsExpressions deno
Page 65 and 66: The function: mapApplies a function
Page 67 and 68: ExerciseDeclare a functiong [x 1 ,
Page 69 and 70: ExerciseDeclare member function usi
Page 71 and 72: ExerciseDeclare a functionsubset(xs
Page 73 and 74: ExerciseDeclare a functioninter(xs,
Page 75 and 76: Higher-order list functions: foldr
Page 77 and 78: Higher-order list functions: foldl

Basic types, Lists, Trees, Higher-order functions

Create successful ePaper yourself

Delete template?

Save as template?