Topic Answers Author Views
Welcome 0 Manning 260
10.1.5 tree insertion 3 wem 41
EXERCISE 9.29 unfold 1 wem 42
EXERCISE 9.28 Write a fibs function 1 wem 31
EXERCISE 9.16 1 wem 58
EXERCISE 9.12 dropAtMost() 5 wem 56
EXERCISE 9.9 sequenceResult() 1 wem 43
EXERCISE 9.1 Implement Lazy<A> 1 wem 45
EXERCISE 8.22 divide(depth: Int) 1 wem 27
EXERCISE 8.17 Create a groupBy function 1 wem 35
EXERCISE 8.13 (foldLeft with early escape) 1 wem 46
EXERCISE 8.8 zipWith 1 wem 58
EXERCISE 8.5 comment 1 wem 41
EXERCISE 7.12 & 7.13 1 wem 42
7.5.3 Adding factory functions 1 wem 34
Comment on 'Anonymous Functions' 3 wem 153
6.4.4 Option use cases 1 wem 33
EXERCISE 5.20 Implement flatMap 1 wem 52
6.3 max function equivalence 1 wem 43
6.3 max function type parameters 1 wem 27
5.11.2 How to get away with variance abuse 3 wem 50
Exercise 5.3 drop() 2 wem 51
EXERCISE 4.1 Implement a corecursive add function 1 wem 48
Chapter 8.15: Suggestion for simplification 1 Krustowski 37
4.1.2 Implementing recursion 1 wem 33
3.17 The identity function 1 wem 37
Chapter 5.15: Test case insufficient? 1 Krustowski 91
4.6 Using Recursive Functions code suggestion 1 mikezx6r 961
Incorrect assumption about copy constructors page 83-84 0 supotuco 257
map vs flatMap 1 MattP 293
4.4.1 tailcall command not found 1 mikezx6r 339
3.10 issue with example 2 mikezx6r 274
Difference with Functional Programming in Java 1 supotuco 464