SUMMARY.md

Table of contents

• Introduction to Haskell

Introduction

• Functions
• Functional Programming vs Imperative Programming
• Installing Haskell
• Haskell Modules
• Loading Modules into GHCi
• Expressions
• Laziness
• Immutability

Types in Haskell

• Introduction
• Basic Types
• Static Type Check
• Polymorphic and Overloaded Types
• Data Structure Types
  • Lists
    • List Functions
  • Tuples
• Function Types
  • Curried Functions
  • Partial Application

Defining Functions / Working with Functions

• The Layout Rule
• Local Definitions
• The Infix Operator
• Conditionals
  • If-then-else Statements
  • MultiWayIf
  • Guarded Equations
  • Case-of Statements
• Pattern Matching
  • Tuple Patterns
  • List Patterns
• Lambda functions
• Function Operators

List Comprehensions

• List Comprehensions

Higher-order Functions

• Introduction
• The map Function
• The filter Function

Recursion

• Introduction
• 4 Steps to Defining Recursive Functions
• Recursion Practice
• Folds
  • Fold Right (foldr)
  • Fold Left (foldl)

Cutom Types

• Declaring Types
  • Type Synonyms
  • Data Declarations
  • Newtype declarations

Type Classes

• Introduction
• Basic Classes
  • Eq – Equality Types
  • Ord – ordered types
  • Show – Showable Types
  • Read – readable types
  • Num – Numeric Types
  • Integral – Integral Types
  • Fractional – Fractional Types
  • Enum – Enumeration Types
• Derived Instances
• Exercise – Making a Card Deck Type

Interactive Programming

• Introduction
• Input / Output Actions
• Sequencing Actions
• Exercise - Numbers Guessing Game

Functors, Applicatives and Monads

• Introduction
• Functors
• Applicative Functors
• Monads
  • Maybe Monad
  • List Monad
  • Monad Laws

---

• References / Further Reading