Introduction To Haskell Programming

Wishlist Share
Share Course
Page Link
Share On Social Media

About Course

Introduction To Haskell Programming.

Functional programming is an elegant, concise and powerful programming paradigm. This style encourages breaking up programming tasks into logical units that can be easily translated into provably correct code. Haskell brings together the best features of functional programming and is increasingly being used in the industry, both for building rapid prototypes and for actual deployment.

INTENDED AUDIENCE: Anyone interested in learning this language

What Will You Learn?

  • Week 1: Introduction to Haskell and the ghci interpreter
  • Week 2: Defining functions: guards, pattern matching, and recursion
  • Week 3: Lists, strings, and tuples
  • Week 4: Types and polymorphism
  • Week 5: Higher-order functions on lists: map, filter, list comprehension
  • week 6: Computation as rewriting, lazy evaluation, and infinite data structures
  • Week 7: Conditional polymorphism and type classes
  • Week 8: User-defined data types: lists, queues, trees
  • Week 9: Input/output and the ghc compiler
  • Week 10:Arrays

Course Content

Introduction To Haskell Programming

  • Functions
    11:08
  • Types
    00:00
  • Haskell
    00:00
  • Running Haskell programs
    00:00
  • Currying
    00:00
  • Examples
    00:00
  • Lists
    00:00
  • Functions on lists
    00:00
  • More list functions
    00:00
  • Characters and strings
    00:00
  • Tuples
    00:00
  • Computation as rewriting
    00:00
  • Polymorphism and higher-order functions
    00:00
  • Map and filter
    00:00
  • List comprehension
    00:00
  • Folding through a list
    00:00
  • Measuring efficiency
    00:00
  • Sorting
    00:00
  • Using infinite lists
    00:00
  • Conditional polymorphism
    00:00
  • Defining functions in ghci
    00:00
  • User-defined datatypes
    00:00
  • Abstract datatypes
    00:00
  • Modules
    00:00
  • Recursive data types
    00:00
  • Binary search trees
    00:00
  • Balanced search trees
    00:00
  • Arrays
    00:00
  • Input/Output
    00:00

Student Ratings & Reviews

No Review Yet
No Review Yet