Skip to content

Programming in Haskell

ISBN-10: 0521692695

ISBN-13: 9780521692694

Edition: 2006

Authors: Graham Hutton

List price: $64.99
Blue ribbon 30 day, 100% satisfaction guarantee!
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Description:

No further information has been provided for this title. .
Customers also bought

Book details

List price: $64.99
Copyright year: 2006
Publisher: Cambridge University Press
Publication date: 1/15/2007
Binding: Paperback
Pages: 184
Size: 7.50" wide x 9.75" long x 0.50" tall
Weight: 0.748

Preface
Introduction
Functions
Functional programming
Features of Haskell
Historical background
A taste of Haskell
Chapter remarks
Exercises
First steps
The Hugs system
The standard prelude
Function application
Haskell scripts
Chapter remarks
Exercises
Types and classes
Basic concepts
Basic types
List types
Tuple types
Function types
Curried functions
Polymorphic types
Overloaded types
Basic classes
Chapter remarks
Exercises
Defining functions
New from old
Conditional expressions
Guarded equations
Pattern matching
Lambda expressions
Sections
Chapter remarks
Exercises
List comprehensions
Generators
Guards
The zip function
String comprehensions
The Caesar cipher
Chapter remarks
Exercises
Recursive functions
Basic concepts
Recursion on lists
Multiple arguments
Multiple recursion
Mutual recursion
Advice on recursion
Chapter remarks
Exercises
Higher-order functions
Basic concepts
Processing lists
The foldr function
The foldl function
The composition operator
String transmitter
Chapter remarks
Exercises
Functional parsers
Parsers
The parser type
Basic parsers
Sequencing
Choice
Derived primitives
Handling spacing
Arithmetic expressions
Chapter remarks
Exercises
Interactive programs
Interaction
The input/output type
Basic actions
Sequencing
Derived primitives
Calculator
Game of life
Chapter remarks
Exercises
Declaring types and classes
Type declarations
Data declarations
Recursive types
Tautology checker
Abstract machine
Class and instance declarations
Chapter remarks
Exercises
The countdown problem
Introduction
Formalising the problem
Brute force solution
Combining generation and evaluation
Exploiting algebraic properties
Chapter remarks
Exercises
Lazy evaluation
Introduction
Evaluation strategies
Termination
Number of reductions
Infinite structures
Modular programming
Strict application
Chapter remarks
Exercises
Reasoning about programs
Equational reasoning
Reasoning about Haskell
Simple examples
Induction on numbers
Induction on lists
Making append vanish
Compiler correctness
Chapter remarks
Exercises
Standard prelude
Classes
Logical values
Characters and strings
Numbers
Tuples
Maybe
Lists
Functions
Input/output
Symbol table
Bibliography
Index