Haskell Quick Syntax Reference (A Pocket Guide to the Language, APIs, and Library)

This condensed code and syntax reference presents the essential Haskell syntax in a well-organized format that can be used as a quick and handy reference, including applications to cloud computing and data analysis. This book covers the functional programming features of Haskell as well as strong static typing, lazy evaluation, extensive parallelism, and concurrency. You won’t find any technical jargon, bloated samples, drawn out history lessons, or witty stories in this book. What you will find is a language reference that is concise, to the point and highly accessible. The Haskell Quick Syntax Reference is packed with useful information and is a must-have for any Haskell programmer working in big data, data science, and cloud computing. What You Will Learn • Quickly and effectively use the Haskell programming language • Take advantage of strong static typing • Work with lazy evaluations • Harness concurrency and extensive parallelism using Haskell Who This Book Is For Experienced programmers who may be new to Haskell or have experience with Haskell and who just want a quick reference guide on it. Table of Contents 4 About the Authors 11 About the Technical Reviewer 13 Introduction 14 Chapter 1: Functional Programming 20 The Advantages of Functional Programming 20 Functional Programming vs. Object-Oriented Programming 21 Summary 22 Chapter 2: Static Typing 23 Currying and Uncurrying 24 Scoping Variables 26 Types 28 Summary 29 References 30 Chapter 3: GHC 31 Introducing GHC 31 Examples 34 Summary 36 References 36 Chapter 4: Types 37 Basic Types in Haskell 37 Defining Your Own Types 40 Synonyms 42 Structures and Enumerations 42 Records 43 Type System 44 Summary 45 References 46 Chapter 5: Tuples 47 Writing Tuples 47 Predefined Functions for Pairs 48 Summary 50 References 50 Chapter 6: Lists 51 Basic Functions on Lists 51 Other Functions 55 Summary 58 References 58 Chapter 7: Functions 59 Haskell Files 59 Pattern Matching 62 Case Expressions 63 Guards 64 Clauses 65 Lambda Expressions 67 Infix Functions 67 Higher-Order Functions 68 Summary 69 References 69 Chapter 8: Recursion 70 Handling for and while Loops from Imperative Languages 72 Recursion on Lists 73 Pattern Matching and Recursion 76 Summary 77 References 77 Chapter 9: List Comprehension 79 Introduction 79 Other Functions on Lists 82 Summary 84 References 85 Chapter 10: Classes 86 Standard Classes 86 The Eq Class 87 Inheritance 88 Creating Your Own Type Class 91 Advanced Type Classes 92 Maybe, Just, and Nothing 94 Functor 94 Summary 95 References 96 Chapter 11: Pattern Matching 97 Pattern Matching and Constructors 99 Uses of Pattern Matching 100 Summary 101 References 102 Chapter 12: Monads 103 Introduction 103 The Three Rules 105 The Right Unit 105 The Left Unit 106 Associativity 107 An Example 108 Useful Combinators 115 Summary 115 References 116 Chapter 13: Monad Transformers 117 Simple Transformers 117 MaybeT Transformer 118 Building a Simple Monad Transformer Stack 121 Summary 123 References 123 Chapter 14: Parsec 125 Summary 127 References 127 Chapter 15: Folds 128 Summary 130 Reference 131 Chapter 16: Algorithms 132 Quicksort 132 Mergesort 134 Bubble sort 136 Summary 137 Reference 137 Chapter 17: Parsing 138 Summary 142 References 143 Chapter 18: Parallelism and Concurrency 144 Parallelism 145 Concurrency 147 Summary 147 References 147 Chapter 19: Haskell Pipes 149 Summary 156 References 156 Chapter 20: Lens 157 Summary 162 References 163 Chapter 21: Lazy Evaluation 164 Summary 168 References 168 Chapter 22: Performance 169 Type Signatures 169 Optimization Flags 169 Profiling 170 The weigh Library 172 Other Techniques 173 References 173 Chapter 23: Haskell Stack 175 Summary 180 References 181 Chapter 24: Yesod 182 Installing and Configuring Yesod 183 Using Yesod in a Practical Example 194 Summary 196 References 196 Chapter 25: Haskell Libraries 197 Prelude 197 Haskell 2010 Libraries 198 GHC Bootstrap Libraries 199 Core Libraries and Haskell Platform Libraries 199 The Hackage Database 200 Summary 200 References 201 Chapter 26: Cabal 202 Summary 207 References 208 Index 209 "This condensed code and syntax reference presents the essential Haskell syntax in a well-organized format that can be used as a quick and handy reference, including applications to cloud computing and data analysis. This book covers the functional programming features of Haskell as well as strong static typing, lazy evaluation, extensive parallelism, and concurrency You won't find any technical jargon, bloated samples, drawn out history lessons, or witty stories in this book. What you will find is a language reference that is concise, to the point and highly accessible. The Haskell Quick Syntax Reference is packed with useful information and is a must-have for any Haskell programmer working in big data, data science, and cloud computing. You will: Quickly and effectively use the Haskell programming language Take advantage of strong static typing Work with lazy evaluations Harness concurrency and extensive parallelism using Haskell"--Publisher's website "This condensed code and syntax reference presents the essential Haskell syntax in a well-organized format that can be used as a quick and handy reference, including applications to cloud computing and data analysis. This book covers the functional programming features of Haskell as well as strong static typing, lazy evaluation, extensive parallelism, and concurrency You won't find any technical jargon, bloated samples, drawn out history lessons, or witty stories in this book. What you will find is a language reference that is concise, to the point and highly accessible. The Haskell Quick Syntax Reference is packed with useful information and is a must-have for any Haskell programmer working in big data, data science, and cloud computing. You will: Quickly and effectively use the Haskell programming language Take advantage of strong static typing Work with lazy evaluations Harness concurrency and extensive parallelism using Haskell"-- Back cover