- The Haskell School of Expression
- Introduction to Functional Programming using Haskell
- The Haskell School of Expression: Learning Functional Programming through Multimedia
- Haskell: The Craft of Functional Programming
- A Gentle Introduction to Haskell, Version 98
- The Fun of Programming
- Purely Functional Data Structures
- Practical.Foundations.for.Programming
- The Haskell Road to Logic, Maths and Programming
- Pearls of Functional Algorithm Design
- Algorithms: A Functional Programming Approach
- Type Theory and Functional Programming
- Lambda-Calculus and combinators
- introduce to fictional programming through lambda caculus
- The lambda calculus: its syntax and semantics
- On HaskellWiki
- 13 Type classes
- 18 GADT
- 21 Arbitrary-rank polymorphism
- 22 Phantom types
- 27 Qualified types
- as popularized by Oleg Kiselyov,Streams
- QuickCheck: a lightweight tool for random testing of Haskell programs
- Giving Haskell a promotion
- Template meta-programming for Haskell
- https://www.haskell.org/documentation/
- http://dev.stephendiehl.com/hask/
- http://nikita-volkov.github.io/profiling-cabal-projects/
- Foldable / Traversable / Typeable `newtype MyInt = MyInt Int (Deriving Typeable)` ` 2 :: MyInt`
- Lens
- xmonad
- snap
- LambdaHack
- preclude
- mtl / transform
- Data.Text
- ByteString
- pandoc
- Parsec
- QuickCheck
- HUnit
- HXT study
- Morphism
- isomorphism
- polymorphism
- monomorphism
- [X] failed at getting access token need callback at getting auth code
- [ ] post the finding
- Polymorphic Components
- From Hindley-Milner Types to First-Class Structures by Mark P. Jones
- RankNTypes
- Arbitrary-rank polymorphism in the GHC User’s Guide.
- Practical type inference for arbitrary-rank types, Simon Peyton Jones, Mark Shields,etc.
- Boxy types: type inference for higher-rank types and impredicativity, Simon Peyton Jones, ICFP 2006.
- Semantics of Types and Classes in the Haskell 98 Report
- Existential Quantification
- Subsumed by GADT. ( Simple unification-based type inference for GADTs by Simon Peyton Jones )
- Polymorphic Type Inference and Abstract Data Types by K. Läufer and M. Odersky, in TOPLAS, Sep 1994.
- Universal Quantification / Polymorphism
- Chapter 12
- Note taken on [2011-05-16 Mon 06:02]
finish once…probably need re-read..
- [X] what and how
- Home page
- [X] how to create Test suite
- [X] substitue function / re exp
- levarge map f
- a regx module
TAG | Full Name |
---|---|
PIH | Programming in Haskell |
LYGH | Learn Your Good Haskell |