Poised Solutions Tech Library

Programming in Haskell

Programming in Haskell Author: Graham Hutton Publisher: Cambridge Published: 2007 Pages: 171

Programming in Haskell.

Programming in Haskell Chapters

Programming in Haskell Chapters

1. Introduction
   • Functions
   • Functional Programming
   • Features of Haskell
   • Historical Background
   • A Taste of Haskell
2. First Steps
   • The Hugs System
   • The Standard Prelude
   • Function Application
   • Haskell Scripts
3. Types and classes
   • Basic Concepts
   • Basic Types
   • List Types
   • Tupe Types
   • Function Types
   • Curried Functions
   • Polymorphic Types
   • Overloaded Types
   • Basic Classes
4. Defining Functions
   • New from Old
   • Conditional Expressions
   • Guarded Equations
   • Pattern Matching
   • Lambda Expressions
   • Sections
5. List Comprehensions
   • Generators
   • Guards
   • The zip function
   • String Comprehension
   • The Caesar Cipher
6. Recursive Functions
   • Basic Concepts
   • Recursion Lists
   • Multiple Arguments
   • Multiple Recursion
   • Mutual Recrusion
   • Advice on Recrusion
7. High-order Functions
   • Basic Concepts
   • Processing Lists
   • The foldr Function
   • The foldl Function
   • The composition operator
   • String transmitter
8. Functional Parsers
   • Parsers
   • The parser Type
   • Basic Parsers
   • Sequencing
   • Choice
   • Derived Primitives
   • Handling Space
   • Arithmetic Expressions
9. Interactive Programs
   • Interaction
   • The input/output type
   • Basic Actions
   • Sequencing
   • Derived Primitives
   • Calculator
   • Game of Life
10. Declaring Types and Classes
    • Type Declarations
    • Data Declarations
    • Recursive Types
    • Tautology Checker
    • Abstract Machine
    • Class and Instance Declarations
11. The Countdown Problem
    • Introduction
    • Formalising the Problem
    • Brute Force Solution
    • Combining Generation and Evaluation
    • Exploiting Algebraic Properties
12. Lazy Evaluation
    • Evaluation Strategies
    • Termination
    • Number of Reductions
    • Infintie Structures
    • Modular Programming
    • Strict Application
13. Reasoning About Programs
    Equational Reasoning Reasoning about Haskell Simple Examples Induction on Numbers Induction on Lists Making Append Vanish Compiler Correctness

Programming in Haskell Appendices

1. Stadard Prelude
   • Classes
   • Logical values
   • Characters and strings
   • Numbers
   • Tuples
   • Maybe
   • Lists
   • Functions
   • input / output
2. Symbol Table
3. Bibliography
4. Index