Learn You a Haskell for Great Good! - Miran Lipovaca [168]
curried functions, Higher-Order Functions, Curried Functions, Curried Functions, Printing Functions, Functions As Functors
max, Curried Functions
printing functions, Printing Functions
sections, Curried Functions
cycle function, using with lists, Texas Ranges
D
data keyword, Making Our Own Types and Type Classes, Wrapping an Existing Type into a New Type, On newtype Laziness, type vs. newtype vs. data
using, type vs. newtype vs. data
vs. newtype, Wrapping an Existing Type into a New Type, On newtype Laziness
data structures. See also zippers, Lambdas, Lambdas, Focusing on Lists
reducing to values, Lambdas
using zippers with, Focusing on Lists
data types. See also algebraic data types; concrete types; recursive data structures; type constructors; type parameters; types, Making Our Own Types and Type Classes, Exporting Our Shapes in a Module, Record Syntax, Should We Parameterize Our Car?, Should We Parameterize Our Car?, Vector von Doom, Derived Instances, Either a As a Functor, Either a As a Functor, Wrapping an Existing Type into a New Type, type vs. newtype vs. data
3D vector, Should We Parameterize Our Car?
applying to type constructors, Either a As a Functor
defining, Making Our Own Types and Type Classes, Vector von Doom
for describing people, Exporting Our Shapes in a Module, Derived Instances
identifying, Either a As a Functor
making, type vs. newtype vs. data
record syntax, Record Syntax
wrapping with newtype keywords, Wrapping an Existing Type into a New Type
Data.ByteString.Lazy module, Bytestrings
Data.Char module, Caesar Cipher Salad, Let's Find Some Cool Numbers
Data.List module, Modules, Solving Problems with Module Functions, Solving Problems with Module Functions, Counting Words, Needle in the Haystack, Deleting Items, Deleting Items
!! function, Deleting Items
any function, Needle in the Haystack
delete function, Deleting Items
group function, Solving Problems with Module Functions
tails function, Counting Words
words function, Solving Problems with Module Functions
Data.Map module, Enter Data.Map, Enter Data.Map, Exporting Our Shapes in a Module, Should We Parameterize Our Car?
fromListWith function, Enter Data.Map
lookup function, Enter Data.Map
Map k v parameterized type, Should We Parameterize Our Car?
Data.Monoid module, Product and Sum, Product and Sum, Product and Sum
Product type, Product and Sum
Sum type, Product and Sum
Day type, Any Day of the Week
deferred computation, Bytestrings
definitions, functions as, Baby's First Functions
deletetodo.hs program, saving and compiling, Deleting Items
derived instances, Vector von Doom, Derived Instances, Equating People, Equating People
equating people, Derived Instances
Read type class, Equating People
Show type class, Equating People
deriving keyword, using with newtype, Wrapping an Existing Type into a New Type
dictionaries, Almost As Good: Association Lists
difference lists, using, Inefficient List Construction
digitToInt function, Let's Find Some Cool Numbers
disjunction (||) Boolean operator, Starting Out
div function, Calling Functions
/ (division), using with RPN functions, Writing an RPN Function
division (/), using with RPN functions, Writing an RPN Function
do expressions. See also monads, I/O Actions As Functors, I/O Actions As Functors, do Notation, do Notation, do Notation, Pierre Returns, Pierre Returns, The State Monad
actions of, I/O Actions As Functors
failure of pattern matching in, Pierre Returns
let lines in, do Notation
monadic expressions in, do Notation
monadic values in, do Notation
results of, The State Monad
writing, Pierre Returns
do notation, Gluing I/O Actions Together, Banana on a Wire, Pierre Returns, do Notation and List Comprehensions, MonadPlus and the guard Function, The Writer Type
and <-, Gluing I/O Actions Together
and list comprehensions, do Notation and List Comprehensions
pattern matching and failure, Pierre Returns
using with Writer monad, The Writer Type
.. (dots), using