This note
covers the following topics: Functions and their definitions, First look at
Haskell, Using the interpreter, Haskell basics, Higher order functions, More
list notation, More on data types, Input or output, Problem solving, Haskell
laws, Program synthesis, Models of reduction, Divide and conquer algorithms and
infinite data structures.
Author(s): H Conrad Cunningham, University of Mississippi
This book covers topics on basic types,
compilers vs. interpreters, functions, pattern matching, list manipulation,
polymorphism, sorting algorithms, user-defined datatypes, abstract datatypes,
tree traversals, input or output, and memoization, introduction to programming
concepts, algorithms, and data structures. They also touch on arrays, priority
queues, heaps, and dynamic programming.