@@ -34,7 +34,7 @@ __Table of Contents__
34
34
* [ Continuation] ( #continuation )
35
35
* [ Pure Function] ( #pure-function )
36
36
* [ Side effects] ( #side-effects )
37
- * [ Idempotent ] ( #idempotent )
37
+ * [ Idempotence ] ( #idempotence )
38
38
* [ Point-Free Style] ( #point-free-style )
39
39
* [ Predicate] ( #predicate )
40
40
* [ Contracts] ( #contracts )
@@ -56,7 +56,7 @@ __Table of Contents__
56
56
* [ Monoid] ( #monoid )
57
57
* [ Monad] ( #monad )
58
58
* [ Comonad] ( #comonad )
59
- * [ Kleisi Composition] ( #kleisi -composition )
59
+ * [ Kleisli Composition] ( #kleisli -composition )
60
60
* [ Applicative Functor] ( #applicative-functor )
61
61
* [ Morphism] ( #morphism )
62
62
* [ Homomorphism] ( #homomorphism )
@@ -291,7 +291,7 @@ const differentEveryTime = new Date()
291
291
console .log (' IO is a side effect!' )
292
292
```
293
293
294
- ## Idempotent
294
+ ## Idempotence
295
295
296
296
A function is idempotent if reapplying it to its result does not produce a different result.
297
297
@@ -519,7 +519,7 @@ const mult = a => b => a * b
519
519
const liftedMult = liftA2 (mult) // this function now works on functors like array
520
520
521
521
liftedMult ([1 , 2 ], [3 ]) // [3, 6]
522
- liftA2 (a => b => a + b)([1 , 2 ], [3 , 4 ]) // [4, 5, 5, 6 ]
522
+ liftA2 (a => b => a + b)([1 , 2 ], [30 , 40 ]) // [31, 41, 32, 42 ]
523
523
```
524
524
525
525
Lifting a one-argument function and applying it does the same thing as ` map ` .
@@ -726,7 +726,7 @@ CoIdentity(1).extract() // 1
726
726
CoIdentity (1 ).extend ((co ) => co .extract () + 1 ) // CoIdentity(2)
727
727
```
728
728
729
- ## Kleisi Composition
729
+ ## Kleisli Composition
730
730
731
731
An operation for composing two [ monad] ( #monad ) -returning functions (Kleisli Arrows) where they have compatible types. In Haskell this is the ` >=> ` operator.
732
732
0 commit comments