Haskell Language
- Getting started with Haskell Language
- Awesome Book
- Awesome Community
- Awesome Course
- Awesome Tutorial
- Awesome YouTube
- Applicative Functor
- Arbitrary-rank polymorphism with RankNTypes
- Arithmetic
- Arrows
- Attoparsec
- Bifunctor
- Cabal
- Category Theory
- Common functors as the base of cofree comonads
- Common GHC Language Extensions
- Common monads as free monads
- Concurrency
- Containers - Data.Map
- Creating Custom Data Types
- Data.Aeson - JSON in Haskell
- Data.Text
- Databases
- Date and Time
- Fixity declarations
- Foldable
- Foreign Function Interface
- Free Monads
- Function call syntax
- Function composition
- Functor
- Generalized Algebraic Data Types
- GHCJS
- Google Protocol Buffers
- Graphics with Gloss
- Gtk3
- Higher-order functions
- Infix operators
- IO
- Lens
- List Comprehensions
- Lists
- Logging
- Modules
- Monad Transformers
- Monads
- Monoid
- Optimization
- Overloaded Literals
- Parallelism
- Parsing HTML with taggy-lens and lens
- Partial Application
- Phantom types
- Pipes
- Profunctor
- Proxies
- QuickCheck
- Reactive-banana
- Reader / ReaderT
- Record Syntax
- Recursion Schemes
- Rewrite rules (GHC)
- Role
- Sorting Algorithms
- Stack
- State Monad
- Streaming IO
- Strictness
- Syntax in Functions
- Template Haskell & QuasiQuotes
- Testing with Tasty
- Traversable
- Tuples (Pairs, Triples, ...)
- Type algebra
- Type Application
- Type Classes
- Type Families
- Typed holes
- Using GHCi
- Vectors
- Web Development
- XML
- zipWithM
Haskell Language Higher-order functions
Remarks
Higher Order Functions are functions that take functions as parameters and/or return functions as their return values.
