Index
A
Ad hoc polymorphism
Algorithms
bubblesort
mergesort
quicksort
Arbitrary monad
await command
B
Binary data
Binary package
bindState function
Bits operation
Bubblesort algorithm
Bytestring
C
Cabal
errors package
local source
pipes package
system package
cabal command
cabal--help command
Cabal packages
Cartesian product
Case expressions
Class methods
Concurrency
Constructors
Control.Concurrent module
Core libraries
Criterion
Cross-site scripting (XSS) attacks
Currying
cycle function
D
Deadlocks
Divergence
Divide-and-conquer algorithm
drop function
E
elem function
elemIndices/elemIndex function
else..if statements
eof parser
Eq class
F
fact function
filter function
find function
findIndex/findIndices function
First in, first out (FIFO)
fold functions
foldr function
Functional dependency
Functional programming
advantages
definition
fold
nested functions
vs.
OOP
Functor
G
Get monad
getLine function
Get monad
Get-put
getState function
GHC Bootstrap libraries
Glasgow Haskell Compiler(GHC)
components
definition
examples
GUI
in terminal
Guards
H
Hackage database
Haskell
basic types
records
structures, enumerations
synonyms
type constructor
type signature
type system
Haskell 2010 libraries
Haskell files
cd command
do block
import command
load command
reload command
Haskell Stack
acme-missile package
commands
hello-world project
Unix system
Windows
Hierarchy of classes
Higher-order function
I, J, K
Infix function
Inheritance
Instance declaration
IO monad
L
Lambda expressions
Lazy evaluation
length function
Lens
installation
isomorphism
library
mathematical operators
simpleTransactions
traversal
traverse
types
let..in clause
List
comparison
empty list
init function
last function
!! operator
++ operator
: operator
string
List comprehension
check function
Data.List module
double function
if..then..else statement
Long-term support (LTS) package
M
map function
mapTreeM function
mapTreeState function
Maybe monad
MaybeT transformer
Mergesort algorithm
Monad class
Monad
binary tree
branch
leaf
combinators
defined
binding operation (>>=)
m type constructor
return function
rules
state constructor
Monad transformer stack
Monad transform library
N
Nested functions
Nonlazy languages
NULL reference
O
Object-oriented programming (OOP)
Optimization flags
Overloading
P
Parallel computing
Parallelism
Parallel package
Parallel programming
Parsec package
Parsing process
Partition operation
Pattern matching
result
types
uses
Pipes
client
DoNothing
DoSomething 0
installation
library
server module
stdinLn
streaming
Pivot
Prelude
Prism’s a
Processors
Profiling
Cabal
GHC
Stack
Unix
Put monad
Put-get
Put-put
putStrLn function
Q
Quicksort algorithm
Quicksort technique
R
Random library
Recursion
filter function
for/while loops
Haskell
lists functions
pattern matching
recursiveReverse
Reduce
repeat function
returnState function
reverse function
runStateM function
S
scan functions
Scoping variables
Serialization component
show function
Side effect
Software transactional memory (STM)
splitAt function
stack build command
stack exec my-project-exe command
stack install <package_name> command
stack new command
stack setup command
Standard classes
Statically typing
Currying
rules
scoping variables
type
type system
uncurring
Strings/tokens
sum function
T, U
takeWhile function
Threads
thunks
Transformers
TransformersStack.hs
Traversal’ s a
Tuples
definition
pairs
writing
Type
class
constructor
signature
signatures
V
vector package
W, X
weigh library
where clause
Y, Z
Yesod
devel server
editor
quit server
scaffold site
stack build command
stack build tool
stack install yesod-bin--install-ghc
templates
test
text display
yield command
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.