• Choose a category
• All
• Classic-Fiction

failure in do notation, Pierre Returns

failure of, Pattern Matching

on function parameters, case Expressions

tell function, Pattern Matching with Lists and List Comprehensions

using with constructors, Shaping Up

using with monads, Making Monads

using with newtype keywords, Using newtype to Make Type Class Instances

using with type class instances, A Traffic Light Data Type

with let expressions, let It Be

with list comprehensions, Pattern Matching with Tuples

with lists, Pattern Matching with Tuples

with tuples, Pattern Matching

with where keyword, where's Scope

x:xs pattern, Pattern Matching with Tuples

patterns, Pattern Matching with Lists and List Comprehensions, Pattern Matching with Lists and List Comprehensions, Writing an RPN Function

using with RPN functions, Writing an RPN Function

vs. guards, Pattern Matching with Lists and List Comprehensions

people, describing via data types, Derived Instances

performance, Copying Files with Bytestrings, Using Difference Lists, Comparing Performance

comparing via Writer monad, Using Difference Lists

enhancing via bytestrings, Copying Files with Bytestrings

. (period), using with functions, Importing Modules

period (.), using with functions, Importing Modules

phoneBook, Almost As Good: Association Lists, Almost As Good: Association Lists, Enter Data.Map, Enter Data.Map, Type Synonyms

association list, Almost As Good: Association Lists, Enter Data.Map

using type synonyms with, Type Synonyms

Pierre example, Walk the Line, do Notation, do Notation

of do notation, do Notation

of monads, Walk the Line

+ (plus) operator, Starting Out, Calling Functions

plus (+) operator, Starting Out, Calling Functions

Point data type, using with shapes, Shaping Up

point-free style, Point-Free Style, Writing an RPN Function, Writing an RPN Function

converting function to, Writing an RPN Function

defining functions in, Point-Free Style

pole, representing in Pierre example, Walk the Line

polymorphic functions, Type Variables

pop function, using with stacks, Stateful Computations, The State Monad

powerset, getting, filterM

predicates, I'm a List Comprehension, I'm a List Comprehension, The map Function

adding to list comprehensions, I'm a List Comprehension

using with filter function, The map Function

prefix functions, calling, Starting Out

Prelude> prompt, Starting Out

print I/O function, putStr

printing, Printing Functions, Printing Functions, Grab the Handles!

functions, Printing Functions

text files to terminal, Grab the Handles!

probabilities, expressing, Making Monads

problems, implementing solutions to, Writing an RPN Function

Product type, using with monoids, Product and Sum

programs, Modules, Transforming Input, Using do Notation with Writer

adding logging to, Using do Notation with Writer

exiting, Transforming Input

prompt, changing, Starting Out

pure method, Using Applicative Functors, Using Applicative Functors, The Applicative Style, The Applicative Style, Zip Lists

using with applicative functors, Using Applicative Functors, The Applicative Style

using with zip lists, Zip Lists

push function, using with stacks, Stateful Computations

put function, using with state, The State Monad

putChar I/O function, putStr

putStr I/O function, Putting It in Reverse

putStrLn function, type of, Hello, World!

Q

quicksort algorithm, zip

R

random data, getting, Dealing with Bad Input

random function, Randomness, Randomness, Randomness, Randomness, Randomness, Randomness and the State Monad

Random type class, Randomness

RandomGen type class, Randomness

StdGen type, Randomness

type signature, Randomness

using, Randomness

random generators, Randomness, Randomness and I/O, Tasteful Stateful Computations

making, Randomness

regenerating, Randomness and I/O

random string, generating, More Random Functions

randomness and I/O, More Random Functions

randoms function, More Random Functions

ranges. See also list ranges, Texas Ranges,