Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword or section
Like this
3Activity

Table Of Contents

2.1 Hugs
2.1.1 Where to get it
2.1.2 Installation procedures
2.1.3 How to run it
2.2. GLASGOW HASKELL COMPILER 7
2.1.4 Program options
2.1.5 How to get help
2.2 Glasgow Haskell Compiler
2.2.1 Where to get it
2.2.2 Installation procedures
2.2.3 How to run the compiler
2.2.4 How to run the interpreter
2.2.5 Program options
2.2.6 How to get help
2.3 NHC
2.3.1 Where to get it
2.3.2 Installation procedures
2.3.3 How to run it
2.3.4 Program options
2.3.5 How to get help
2.4 Editors
3.1 Arithmetic
3.2 Pairs, Triples and More
3.3 Lists
3.3.1 Strings
3.3.2 Simple List Functions
3.4 Source Code Files
3.5 Functions
3.5.1 Let Bindings
3.5.2 Infix
3.6 Comments
3.7 Recursion
3.8 Interactivity
Type Basics
4.1 Simple Types
4.2 Polymorphic Types
4.3 Type Classes
4.3.1 Motivation
4.3.2 Equality Testing
4.3.3 The Num Class
4.3.4 The Show Class
4.4 Function Types
4.4.1 Lambda Calculus
4.4.2 Higher-Order Types
4.4.3 That Pesky IO Type
4.4.4 Explicit Type Declarations
4.4.5 Functional Arguments
4.5 Data Types
4.5.1 Pairs
4.5.2 Multiple Constructors
4.5.3 Recursive Datatypes
4.5.4 Binary Trees
4.5.5 Enumerated Sets
4.6. CONTINUATION PASSING STYLE 53
4.5.6 The Unit type
4.6 Continuation Passing Style
Basic Input/Output
5.1 The RealWorld Solution
5.2 Actions
5.3 The IO Library
5.4 A File Reading Program
Modules
6.1 Exports
6.2 Imports
6.3 Hierarchical Imports
6.4. LITERATE VERSUS NON-LITERATE 71
6.4 Literate Versus Non-Literate
6.4.1 Bird-scripts
6.4.2 LaTeX-scripts
Advanced Features
7.1 Sections and Infix Operators
7.2 Local Declarations
7.3 Partial Application
7.4 Pattern Matching
7.5 Guards
7.6. INSTANCE DECLARATIONS 85
7.6 Instance Declarations
7.6.1 The Eq Class
7.6.2 The Show Class
7.6.3 Other Important Classes
7.6.4 Class Contexts
7.6.5 Deriving Classes
7.7 Datatypes Revisited
7.7.1 Named Fields
7.8.2 List Comprehensions
7.9 Arrays
7.10 Finite Maps
7.11 Layout
7.12 The Final Word on Lists
8.1 Type Synonyms
8.2 Newtypes
8.3 Datatypes
8.3.1 Strict Fields
8.4 Classes
8.4.1 Pong
8.4.2 Computations
8.5 Instances
8.8 Default
9.1 Do Notation
9.2 Definition
9.3 A Simple State Monad
9.4 Common Monads
9.5 Monadic Combinators
9.6 MonadPlus
9.7 Monad Transformers
9.8 Parsing Monads
9.8.1 A Simple Parsing Monad
9.8.2 Parsec
0 of .
Results for:
No results containing your search query
P. 1
Hakell

Hakell

Ratings: (0)|Views: 3,718|Likes:
Published by luminitabaciu

More info:

Published by: luminitabaciu on Feb 28, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

02/28/2011

pdf

text

original

You're Reading a Free Preview
Pages 4 to 57 are not shown in this preview.
You're Reading a Free Preview
Pages 61 to 101 are not shown in this preview.
You're Reading a Free Preview
Pages 105 to 110 are not shown in this preview.
You're Reading a Free Preview
Pages 114 to 124 are not shown in this preview.
You're Reading a Free Preview
Pages 128 to 192 are not shown in this preview.

Activity (3)

You've already reviewed this. Edit your review.
1 thousand reads
1 hundred reads
levieuxdjo liked this

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->