From Simple IO to Monad Transformers by Zimmer, J. Adrian -- Read -- Imperial Library of Trantor

Index

Title Page Copyright Page Annotated List of Keywords Annotated List of Sections Preface I. Pure Versus Impure

Ia Scope Example Ib Impure Code

II. Functional Programming and the Real World

IIa Decomposed Haskell Program IIb Question IIc Answer

III. Monads and the (>>=) Combinator

IIIa Question IIIb Answer

IV. The return Function

IVa getInt IVb ask IVc return_or_recurs IVd Question IVe Answer

V. Mimicking Composition of Functions

Va Question Vb Answer

VI. The do Block

VIa Scoping In do Block VIb Java-like Scoping VIc Equivalent Monadic Expression VId Substitution 1 VIe Substitution 2 VIf Substitution 3 VIg Monadic Expression Equivalent to do Block VIh Equivalence Step 1 VIj Equivalence Step 2 VIk Equivalence Step 3 VIl Equivalence Step 4 VIm Equivalence Step 5 VIn Question VIo Answer

VII. The List Monad

VIIa Nested do Block Loop VIIb Defining pairs I VIIc Defining pairs II VIId Defining pairs III VIIe Question VIIf Answer VIIg Program Testing pairs

VIII. Introduction to Monad Transformers

VIIIa 'Hello World' VIIIb 'Hello World' Using LisT VIIIc A Bit About GHCI VIIId GHCI Example VIIIe Nonloop Example VIIIf Question VIIIg Answer

IX. Intro to the State Monad

IXa State Monad (>>=) IXb Question IXc Answer

X. More About the State Monad

Xa Deriving >> for the State monad Xb Testing get and put Xc Question Xd Answer

XI. A StateT Example.

XIa Repeated next_coins XIb Definition of recurs XIc Definition of dispense XId Question XIe Answer

XII. Monads

XIIa Definition of Monad XIIb Monadic Axioms XIIc Question XIId Answer

About the Author