Gentle Intro: Index

---

• 1Introduction
• 2Values, Types, and Other Goodies
• 2.1Polymorphic Types
• 2.2User-Defined Types
• 2.2.1Recursive Types
• 2.3Type Synonyms
• 2.4Built-in Types Are Not Special
• 2.4.1List Comprehensions and Arithmetic Sequences
• 2.4.2Strings
• 3Functions
• 3.1Lambda Abstractions
• 3.2Infix Operators
• 3.2.1Sections
• 3.2.2Fixity Declarations
• 3.3Functions are Non-strict
• 3.4"Infinite" Data Structures
• 3.5The Error Function
• 4Case Expressions and Pattern Matching
• 4.1Pattern-Matching Semantics
• 4.2An Example
• 4.3Case Expressions
• 4.4Lazy Patterns
• 4.5Lexical Scoping and Nested Forms
• 4.6Layout
• 5Type Classes and Overloading
• 6Types, Again
• 6.1The Newtype Declaration
• 6.2Field Labels
• 6.3Strict Data Constructors
• 7Input/Output
• 7.1Basic I/O Operations
• 7.2Programming With Actions
• 7.3Exception Handling
• 7.4Files, Channels, and Handles
• 7.5Haskell and Imperative Programming
• 8Standard Haskell Classes
• 8.1Equality and Ordered Classes
• 8.2The Enumeration Class
• 8.3The Read and Show Classes
• 8.4Derived Instances
• 9About Monads
• 9.1Monadic Classes
• 9.2Built-in Monads
• 9.3Using Monads
• 10Numbers
• 10.1Numeric Class Structure
• 10.2Constructed Numbers
• 10.3Numeric Coercions and Overloaded Literals
• 10.4Default Numeric Types
• 11Modules
• 11.1Qualified Names
• 11.2Abstract Data Types
• 11.3More Features
• 12Typing Pitfalls
• 12.1Let-Bound Polymorphism
• 12.2Numeric Overloading
• 12.3The Monomorphism Restriction
• 13Arrays
• 13.1Index types
• 13.2Array Creation
• 13.3Accumulation
• 13.4Incremental updates
• 13.5An example: Matrix Multiplication
• 14The Next Stage
• 15Acknowledgements