Learn You a Haskell for Great Good! - Miran Lipovaca [181]
list-viewing functionality, A Multitasking Task List
remove function, A Multitasking Task List
running, A Multitasking Task List
view function, A Multitasking Task List
tasks. See to-do list, Adding Logging to Programs
tell function, using with log values, Adding Logging to Programs
terminal, Reading and Writing Files, Reading and Writing Files, Grab the Handles!, Grab the Handles!
printing text files to, Grab the Handles!
reading from, Reading and Writing Files
writing to, Reading and Writing Files
text files, printing to terminal, Grab the Handles!
threeCoins stateful computation, Randomness and the State Monad
thunk, defined, Bytestrings
to-do list, Grab the Handles!, To-Do Lists, Deleting Items, Deleting Items, Command-Line Arguments, Command-Line Arguments, Command-Line Arguments, More Fun with To-Do Lists, More Fun with To-Do Lists
adding tasks to, Command-Line Arguments
appendFile function, Grab the Handles!
bracketOnError function, Deleting Items
cleaning up, Deleting Items
deleting items from, To-Do Lists
functionality, Command-Line Arguments
removing tasks from, More Fun with To-Do Lists
viewing tasks, More Fun with To-Do Lists
traffic light, defining states of, Inside the Eq Type Class, A Yes-No Type Class
Tree type constructor, as instance of Functor, Maybe As a Functor
trees. See also zippers, Improving Our List, Improving Our List, Trees Are Functors, Too, Folding with Monoids, Folding with Monoids, Folding with Monoids, Folding with Monoids, Zippers, Taking a Walk, Taking a Walk, Going Back Up, Going Back Up, Manipulating Trees Under Focus, Manipulating a Filesystem, Manipulating a Filesystem
balancing, Improving Our List
converting to lists, Folding with Monoids
going to tops of, Manipulating Trees Under Focus
in zippers example, Zippers
manipulating under focus, Going Back Up
mapping, Trees Are Functors, Too
moving up in, Going Back Up
nodes for monoids, Folding with Monoids
nonempty node for monoids, Folding with Monoids
providing safety nets for, Manipulating a Filesystem
representing breadcrumbs, Taking a Walk
subtrees of, Taking a Walk
using monads with, Manipulating a Filesystem
using with folds and monoids, Folding with Monoids
triangle, right, Using Pairs
triples, Pattern Matching with Tuples, Pattern Matching with Tuples, Representing the Road System in Haskell
pattern matching, Pattern Matching with Tuples
using with road system, Representing the Road System in Haskell
True Boolean value, Starting Out
tuples, I'm a List Comprehension, Tuples, Tuples, Tuples, Tuples, Tuples, Tuples, Using Tuples, Using Tuples, Using Tuples, Using Pairs, Finding the Right Triangle, Explicit Type Declaration, Common Haskell Types, Pattern Matching, Defining a New Data Type, Representing the Road System in Haskell
as types, Common Haskell Types
changing vectors to, Tuples
fixed size of, Tuples
pairs, Using Tuples
pattern matching with, Pattern Matching
triples, Using Tuples, Finding the Right Triangle
using, Tuples
using commas with, Tuples
using parentheses with, Tuples
using with list comprehensions, Using Pairs
using with road system, Representing the Road System in Haskell
using with shapes, Defining a New Data Type
vs. lists, I'm a List Comprehension, Using Tuples, Explicit Type Declaration
two-dimensional vector, representing, Tuples
:t (type) command, Explicit Type Declaration, Common Haskell Types, Implementing zipWith
type annotations, The Ord Type Class
type class constraints, Should We Parameterize Our Car?
type class instances, using newtype with, Wrapping an Existing Type into a New Type
type classes, Type Variables, Type Classes 101, Type Classes 101, The Ord Type Class, The Ord Type Class, The Read Type Class, The Read Type Class, The Bounded Type Class, The Bounded Type Class, The Integral Type Class, Some Final Notes on Type Classes, Vector von Doom, Derived Instances, Equating People, Equating People, Show Me How to Read, Order in the Court!, Order