Topics
- Getting started with Haskell Language
- Getting started with scheme
- Type Classes
- IO
- Record Syntax
- Partial Application
- Monoid
- Lists
- Sorting Algorithms
- Definite Clause Grammars (DCGs)
- Monads
- Strictness
- Syntax in Functions
- Functor
- Function composition
- Higher-order functions
- Containers - Data.Map
- Fixity declarations
- Typed holes
- Date and Time
- List Comprehensions
- Modules
- Applicative Functor
Examples
- Hello, World!
- Reading from file handles
- The Maybe monad
- Partially Applied Adding Function
- An instance of Monoid for lists
- Collapsing a list of Monoids into a single value
- Numeric Monoids
- Getting the 'a' "out of" 'IO a'
- Copying Records while Changing Field Values
- List Literals
- List Concatenation
- Merge Sort
- Quicksort
- Monoid
- Parsing with DCGs
- List basics
- Processing lists
- Accessing elements in lists
- Basic List Comprehensions
- Ranges
- Permutation Sort
- Fibonacci, Using Lazy Evaluation
- Selection sort
- Primes
- Basic Functions on Lists
- List Monad
- Monad as a Subclass of Applicative
- Using where and guards
- Right-to-left composition
- Left-to-right composition
- do-notation
- Basics of Higher Order Functions
- Lambda Expressions
- Constructing
- Composition with binary function
- Example declarations
- foldl
- foldr
- Finding Today's Date
- Adding, Subtracting and Comparing Days
- Patterns in Generator Expressions
- Guards
- Nested Generators
- Parallel Comprehensions
- Local Bindings
- Do Notation
- Filtering with `filter`
- Exporting Constructors
- Qualifying Imports
- Checking If Empty
- Finding Values
- Inserting Elements
- Deleting Elements
- Importing the Module
- Lazy patterns
- Functors in Category Theory
- Deriving Functor
- Alternative definition
- Common instances of Applicative
