Programming in Scala”

Recommendations

Info

CONTENTS Hints for exercises in chapter 11 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60 Hints for exercises in chapter 12 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62 Hints for exercises in chapter 13 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 Hints for exercises in chapter 15 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64 Answers to exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65 Answers to exercises for chapter 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65 Answers to exercises for chapter 3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66 Answers to exercises for chapter 4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 76 Answers to exercises for chapter 5 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79 Answers to exercises for chapter 6 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85 Answers to exercises for chapter 7 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 90 Answers to exercises for chapter 8 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95 Answers to exercises for chapter 9 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 100 Answers to exercises for chapter 10 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 105 Answers to exercises for chapter 11 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 112 Answers to exercises for chapter 12 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121 Answers to exercises for chapter 13 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 128 Answers to exercises for chapter 14 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 130 Answers to exercises for chapter 15 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 132 A brief introduction to Haskell, and why it matters . . . . . . . . . . . . . . . . . . . . . . 138 About Haskell . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 138 Haskell syntax . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 148
CONTENTS 1 Copyright (c) 2012, Manning Publications, Co., Rúnar Óli Bjarnason, and other contributors Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the “Software”), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Page 2 and 3: A companion booklet to ”Functiona
Page 6 and 7: About this booklet This booklet con
Page 8 and 9: Errata 4 run(listOfN(3, "ab" | "cad
Page 10 and 11: Chapter notes Chapter notes provide
Page 12 and 13: Chapter notes 8 Parametricity When
Page 14 and 15: Chapter notes 10 data structures, b
Page 16 and 17: Chapter notes 12 Notes on chapter 4
Page 18 and 19: Chapter notes 14 like this will res
Page 20 and 21: Chapter notes 16 This may seem like
Page 22 and 23: Chapter notes 18 case class Moore[S
Page 26 and 27: Chapter notes 22 forAll(Gen.listOf(
Page 28 and 29: Chapter notes 24 grammars require l
Page 30 and 31: Chapter notes 26 Single pass parsin
Page 32 and 33: Chapter notes 28 This reads: “for
Page 34 and 35: Chapter notes 30 That is, if we hav
Page 36 and 37: Chapter notes 32 type Id[A] = A def
Page 38 and 39: Chapter notes 34 def map[R,A,B](f:
Page 40 and 41: Chapter notes 36 counit is pronounc
Page 44 and 45: Chapter notes 40 apply(u, unit(y))
Page 46 and 47: Chapter notes 42 Fusion law: sequen
Page 48 and 49: Chapter notes 44 trait Translate[F[
Page 50 and 51: Chapter notes 46 of a value separat
Page 52 and 53: Chapter notes 48 Each of these oper
Page 54 and 55:
Hints for exercises This section co
Page 56 and 57:
Hints for exercises 52 Exercise 3.1
Page 58 and 59:
Page 60 and 61:
Page 62 and 63:
Page 64 and 65:
Hints for exercises 60 Exercise 10.
Page 66 and 67:
Hints for exercises 62 Hints for ex
Page 68 and 69:
Hints for exercises 64 Exercise 13.
Page 70 and 71:
Answers to exercises 66 def curry[A
Page 72 and 73:
Answers to exercises 68 def dropWhi
Page 74 and 75:
Answers to exercises 70 def reverse
Page 76 and 77:
Answers to exercises 72 /* The disc
Page 78 and 79:
Answers to exercises 74 @annotation
Page 80 and 81:
Answers to exercises 76 def leaf[A]
Page 82 and 83:
Answers to exercises 78 def travers
Page 84 and 85:
Answers to exercises 80 def toList:
Page 86 and 87:
Answers to exercises 82 def map[B](
Page 88 and 89:
Answers to exercises 84 def zipWith
Page 90 and 91:
Answers to exercises 86 def double(
Page 92 and 93:
Answers to exercises 88 def _ints(c
Page 94 and 95:
Answers to exercises 90 sealed trai
Page 96 and 97:
Answers to exercises 92 def sequenc
Page 98 and 99:
Answers to exercises 94 } def choic
Page 100 and 101:
Answers to exercises 96 Exercise 8.
Page 102 and 103:
Answers to exercises 98 * the given
Page 104 and 105:
Answers to exercises 100 val forkPr
Page 106 and 107:
Answers to exercises 102 for { digi
Page 108 and 109:
Answers to exercises 104 /** Displa
Page 110 and 111:
Answers to exercises 106 Exercise 1
Page 112 and 113:
Answers to exercises 108 def foldMa
Page 114 and 115:
Answers to exercises 110 trait Fold
Page 116 and 117:
Answers to exercises 112 def toList
Page 118 and 119:
Answers to exercises 114 since it
Page 120 and 121:
Answers to exercises 116 compose(co
Page 122 and 123:
Answers to exercises 118 join(join(
Page 124 and 125:
Answers to exercises 120 case class
Page 126 and 127:
Answers to exercises 122 trait Appl
Page 128 and 129:
Answers to exercises 124 map2(unit(
Page 130 and 131:
Answers to exercises 126 def sequen
Page 132 and 133:
Answers to exercises 128 override d
Page 134 and 135:
Answers to exercises 130 /* * Exerc
Page 136 and 137:
Answers to exercises 132 } // Remov
Page 138 and 139:
Answers to exercises 134 def sum2:
Page 140 and 141:
Answers to exercises 136 Exercise 1
Page 142 and 143:
A brief introduction to Haskell, an
Page 144 and 145:
Page 146 and 147:
Page 148 and 149:
Page 150 and 151:
Page 152:
show all

Programming in Scala”

Create successful ePaper yourself

Delete template?

Save as template?