Skip to content

Commit 1016df4

Browse files
committed
rename links *.MD => *.md
1 parent eaa18cc commit 1016df4

File tree

4 files changed

+39
-39
lines changed

4 files changed

+39
-39
lines changed

BasicAbstractions.md

+3-3
Original file line numberDiff line numberDiff line change
@@ -71,7 +71,7 @@ def widen[A, B >: A](fa: F[A]): F[B]
7171

7272
Functor definition does not require any conditions on type constructor `F` or any other operations (unlike Applicative, Monad).
7373
Therefore pretty much everything is a Functor. Notable exceptions are:
74-
1. function input arguments (they are in `negative position`) or any input like type - see [Contravariant](./Contravariant.MD#contravariant-contravariant-functor) We can define Functor only for return type - because type is in `positive position`.
74+
1. function input arguments (they are in `negative position`) or any input like type - see [Contravariant](./Contravariant.md#contravariant-contravariant-functor) We can define Functor only for return type - because type is in `positive position`.
7575
2. abstractions where type can be both input and output, see [Invariant](#invariant-invariant-functor-exponential-functor) and blog post [Rotten Bananas by Edward Kmett](http://comonad.com/reader/2008/rotten-bananas/)
7676
3. abstractions that behave like a Functor but not there are some controversies:
7777

@@ -82,7 +82,7 @@ Therefore pretty much everything is a Functor. Notable exceptions are:
8282

8383
* Many abstractions have enough structure, so we can define `map` that obeys the laws. Such as `Monad` defined using `pure` and `flatMap`.
8484
Another notable example is `Coyoneda` that wraps any type constructor and allows to use `map` on it. Functor instance is neccessary only when we want to extract the end result.
85-
See [Free constructions](./Free.MD#free-constructions) for `Free functors`.
85+
See [Free constructions](./Free.md#free-constructions) for `Free functors`.
8686

8787
* Resources:
8888
* herding cats - Functor - @eed3si9n [(blog post)](http://eed3si9n.com/herding-cats/Functor.html)
@@ -474,7 +474,7 @@ trait StateMonad[F[_],S] extends Monad[F] {
474474

475475
### State Monad
476476

477-
You can define useful operations on [State](./README.MD#state). This could be abstract over in `StateMonad` typeclass:
477+
You can define useful operations on [State](./README.md#state). This could be abstract over in `StateMonad` typeclass:
478478
```scala
479479
trait StateMonad[F[_],S] extends Monad[F] {
480480
def update: (S => S) => F[S]

FunctionalDataStructures.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# [Functional data structures](./FunctionalDataStructures.MD)
1+
# [Functional data structures](./FunctionalDataStructures.md)
22
* Resources:
33
* [typelevel/cats-collections](https://github.com/typelevel/cats-collections)
44
* [What's new in purely functional data structures since Okasaki?](https://cstheory.stackexchange.com/questions/1539/whats-new-in-purely-functional-data-structures-since-okasaki)

0 commit comments

Comments
 (0)