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

Table Of Contents

2.1 Polymorphic Types
2.2 User-Defined Types
2.3 Type Synonyms
2.4.2 Strings
3.1 Lambda Abstractions
3.2.1 Sections
3.2.2 Fixity Declarations
3.3 Functions are Non-strict
3.4 "Infinite" Data Structures
3.5 The Error Function
4.1 Pattern-Matching Semantics
4.2 An Example
4.3 Case Expressions
4.4 Lazy Patterns
4.5 Lexical Scoping and Nested Forms
4.6 Layout
5 Type Classes and Overloading
6.1 The Newtype Declaration
6.2 Field Labels
6.3 Strict Data Constructors
7.1 Basic I/O Operations
7.2 Programming With Actions
7.3 Exception Handling
7.5 Haskell and Imperative Programming
8.1 Equality and Ordered Classes
8.2 The Enumeration Class
8.3 The Read and Show Classes
8.4 Derived Instances
9.1 Monadic Classes
9.2 Built-in Monads
9.3 Using Monads
10.1 Numeric Class Structure
10.2 Constructed Numbers
10.3 Numeric Coercions and Overloaded Literals
11.1 Qualified Names
11.2 Abstract Data Types
11.3 More Features
12.1 Let-Bound Polymorphism
12.2 Numeric Overloading
12.3 The Monomorphism Restriction
13.1 Index types
13.2 Array Creation
13.3 Accumulation
13.4 Incremental updates
13.5 An example: Matrix Multiplication
14 The Next Stage
15 Acknowledgements
0 of .
Results for:
No results containing your search query
P. 1


Ratings: (0)|Views: 10|Likes:
Published by marimbague

More info:

Published by: marimbague on Feb 26, 2011
Copyright:Attribution Non-commercial


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





You're Reading a Free Preview
Pages 4 to 7 are not shown in this preview.
You're Reading a Free Preview
Pages 11 to 64 are not shown in this preview.

You're Reading a Free Preview

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