Drop broken links (#678)

* Rename README.MD to README.md * Rename AbstractAlgebra.MD to AbstractAlgebra.md * rename *.MD => *.md * rename links *.MD => *.md * remove broken links, drop publications section
lemastero · Dec 4, 2024 · 3bf5fd0 · 3bf5fd0
1 parent 1501937
commit 3bf5fd0
Show file tree

Hide file tree

Showing 20 changed files with 50 additions and 115 deletions.
diff --git a/AbstractAlgebra.MD → AbstractAlgebra.md b/AbstractAlgebra.MD → AbstractAlgebra.md
diff --git a/Adjunction.MD → Adjunction.md b/Adjunction.MD → Adjunction.md
diff --git a/BasicAbstractions.MD → BasicAbstractions.md b/BasicAbstractions.MD → BasicAbstractions.md
@@ -71,7 +71,7 @@ def widen[A, B >: A](fa: F[A]): F[B]
 
 Functor definition does not require any conditions on type constructor `F` or any other operations (unlike Applicative, Monad).
 Therefore pretty much everything is a Functor. Notable exceptions are:
-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`.
+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`.
 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/)
 3. abstractions that behave like a Functor but not there are some controversies:
 
@@ -82,7 +82,7 @@ Therefore pretty much everything is a Functor. Notable exceptions are:
 
 * Many abstractions have enough structure, so we can define `map` that obeys the laws. Such as `Monad` defined using `pure` and `flatMap`.
   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.
-  See [Free constructions](./Free.MD#free-constructions) for `Free functors`.
+  See [Free constructions](./Free.md#free-constructions) for `Free functors`.
 
 * Resources:
     * herding cats - Functor - @eed3si9n [(blog post)](http://eed3si9n.com/herding-cats/Functor.html)
@@ -474,7 +474,7 @@ trait StateMonad[F[_],S] extends Monad[F] {
 
 ### State Monad
 
-You can define useful operations on [State](./README.MD#state). This could be abstract over in `StateMonad` typeclass:
+You can define useful operations on [State](./README.md#state). This could be abstract over in `StateMonad` typeclass:
 ```scala
 trait StateMonad[F[_],S] extends Monad[F] {
   def update: (S => S) => F[S]

diff --git a/Bifunctors.MD → Bifunctors.md b/Bifunctors.MD → Bifunctors.md
diff --git a/CombinatoryBirds.MD → CombinatoryBirds.md b/CombinatoryBirds.MD → CombinatoryBirds.md
diff --git a/Comonads.MD → Comonads.md b/Comonads.MD → Comonads.md
diff --git a/ComputationalTrinitarianism.MD → ComputationalTrinitarianism.md b/ComputationalTrinitarianism.MD → ComputationalTrinitarianism.md
diff --git a/Contravariant.MD → Contravariant.md b/Contravariant.MD → Contravariant.md
diff --git a/Free.MD → Free.md b/Free.MD → Free.md
diff --git a/FunctionalDataStructures.MD → FunctionalDataStructures.md b/FunctionalDataStructures.MD → FunctionalDataStructures.md
@@ -1,4 +1,4 @@
-# [Functional data structures](./FunctionalDataStructures.MD)
+# [Functional data structures](./FunctionalDataStructures.md)
 * Resources:
   * [typelevel/cats-collections](https://github.com/typelevel/cats-collections)
   * [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)

diff --git a/HigherKinded.MD → HigherKinded.md b/HigherKinded.MD → HigherKinded.md
diff --git a/KanExtensions.MD → KanExtensions.md b/KanExtensions.MD → KanExtensions.md
diff --git a/Limits.MD → Limits.md b/Limits.MD → Limits.md
diff --git a/Optics.MD → Optics.md b/Optics.MD → Optics.md
@@ -16,7 +16,6 @@
 
 ## Van Laarhoven Optics
 
-* [Monocle Learning Resources](https://julien-truffaut.github.io/Monocle/learning_resources.html)
 * [Twan van Laarhoven: CPS based functional references](https://www.twanvl.nl/blog/haskell/cps-functional-references)
 * [Functor Optics](http://oleg.fi/gists/posts/2017-12-23-functor-optics.html)
 
@@ -90,4 +89,4 @@ trait Grates[S, T, A, B] { // https://r6research.livejournal.com/28050.html
   * Jeremy Gibbons - Profunctor Optics Modular Data Accessors [(video)](https://www.youtube.com/watch?v=sfWzUMViP0M)
   * Grate: A new kind of Optic: [(blog post)](https://r6research.livejournal.com/28050.html)
   * Tambara Modules - Brendan Fong [(video)](https://www.youtube.com/watch?v=67hJW6J4Mic)
-  * Profunctor optics, a categorical update - Mario Román, Bryce Clarke, Fosco Loregian, Emily Pillmore, Derek Elkins, Bartosz Milewski [(video)](https://www.youtube.com/watch?v=ceCwD7L0t3w), [(slides)](http://events.cs.bham.ac.uk/syco/strings3-syco5/slides/roman.pdf), [(gist)](https://gist.github.com/emilypi/407838d9c321d5b21ebc1828ad2bedcb)
+  * Profunctor optics, a categorical update - Mario Román, Bryce Clarke, Fosco Loregian, Emily Pillmore, Derek Elkins, Bartosz Milewski [(video)](https://www.youtube.com/watch?v=ceCwD7L0t3w), [(gist)](https://gist.github.com/emilypi/407838d9c321d5b21ebc1828ad2bedcb)
diff --git a/OtherEncodingsOfCT.MD → OtherEncodingsOfCT.md b/OtherEncodingsOfCT.MD → OtherEncodingsOfCT.md
diff --git a/Profunctors.MD → Profunctors.md b/Profunctors.MD → Profunctors.md
diff --git a/README.MD → README.md b/README.MD → README.md
diff --git a/RecursionSchemas.MD → RecursionSchemas.md b/RecursionSchemas.MD → RecursionSchemas.md
@@ -38,15 +38,15 @@
 case class Fix[F[_]](unFix: F[Fix[F]])
 ```
 
-* Implementations: [Scalaz](https://github.com/slamdata/matryoshka/blob/master/core/shared/src/main/scala/matryoshka/data/Fix.scala) [ekmett/recursion-schemes](http://hackage.haskell.org/package/recursion-schemes/docs/Data-Functor-Foldable.html#t:Fix) [andyscott/droste](https://github.com/andyscott/droste/blob/master/modules/core/src/main/scala/qq/droste/data/Fix.scala)
+* Implementations: [Scalaz](https://github.com/slamdata/matryoshka/blob/master/core/shared/src/main/scala/matryoshka/data/Fix.scala) [ekmett/recursion-schemes](http://hackage.haskell.org/package/recursion-schemes/docs/Data-Functor-Foldable.html#t:Fix) [andyscott/droste](https://github.com/higherkindness/droste/blob/main/modules/core/src/main/scala-2/higherkindness/droste/data/Fix.scala)
 
 ## Mu
 
-* Implementations: [matryoshka](https://github.com/slamdata/matryoshka/blob/master/core/shared/src/main/scala/matryoshka/data/Mu.scala), [andyscott/droste](https://github.com/andyscott/droste/blob/master/modules/core/src/main/scala/qq/droste/data/Mu.scala), [ekmett/recursion-schemes](http://hackage.haskell.org/package/recursion-schemes/docs/Data-Functor-Foldable.html#t:Mu), [purescript-fixed-points](https://pursuit.purescript.org/packages/purescript-fixed-points/docs/Data.Functor.Mu)
+* Implementations: [matryoshka](https://github.com/slamdata/matryoshka/blob/master/core/shared/src/main/scala/matryoshka/data/Mu.scala), [andyscott/droste](https://github.com/higherkindness/droste/blob/main/modules/core/src/main/scala/higherkindness/droste/data/Mu.scala), [ekmett/recursion-schemes](http://hackage.haskell.org/package/recursion-schemes/docs/Data-Functor-Foldable.html#t:Mu), [purescript-fixed-points](https://pursuit.purescript.org/packages/purescript-fixed-points/docs/Data.Functor.Mu)
 
 ## Nu
 
-* Implementations: [Scala matryoshka](https://github.com/slamdata/matryoshka/blob/master/core/shared/src/main/scala/matryoshka/data/Nu.scala), [andyscott/droste](https://github.com/andyscott/droste/blob/master/modules/core/src/main/scala/qq/droste/data/Nu.scala), [ekmett/recursion-schemes](http://hackage.haskell.org/package/recursion-schemes/docs/Data-Functor-Foldable.html#t:Nu), [purescript-fixed-points](https://pursuit.purescript.org/packages/purescript-fixed-points/docs/Data.Functor.Nu)
+* Implementations: [Scala matryoshka](https://github.com/slamdata/matryoshka/blob/master/core/shared/src/main/scala/matryoshka/data/Nu.scala), [andyscott/droste](https://github.com/higherkindness/droste/blob/main/modules/core/src/main/scala/higherkindness/droste/data/Nu.scala), [ekmett/recursion-schemes](http://hackage.haskell.org/package/recursion-schemes/docs/Data-Functor-Foldable.html#t:Nu), [purescript-fixed-points](https://pursuit.purescript.org/packages/purescript-fixed-points/docs/Data.Functor.Nu)
 
 # Recursion schemas - Folds
 

diff --git a/Topos.MD → Topos.md b/Topos.MD → Topos.md
@@ -23,5 +23,5 @@ Resources:
   * Category Theory: Toposes - MathProofsable [(video playlist)](https://www.youtube.com/watch?v=gKYpvyQPhZo&list=PL4FD0wu2mjWM3ZSxXBj4LRNsNKWZYaT7k)
   * Computational Quadrinitarianism (Curious Correspondences go Cubical) - Gershom Bazerman [(blog post)](http://comonad.com/reader/2018/computational-quadrinitarianism-curious-correspondences-go-cubical/)
   * [fdilke/bewl](https://github.com/fdilke/bewl) (A DSL for the internal language of a topos)
-  * [resources about topos theory](./ComputationalTrinitarianism.MD#topos-theory)
+  * [resources about topos theory](./ComputationalTrinitarianism.md#topos-theory)
   * nLab [Topos](https://ncatlab.org/nlab/show/topos), [Subobject Classifier](https://ncatlab.org/nlab/show/subobject+classifier), [Lawvere-Tierney topology](https://ncatlab.org/nlab/show/Lawvere-Tierney+topology)
diff --git a/notes/Monoidal Categories Notes.MD b/notes/Monoidal Categories Notes.MD
@@ -398,7 +398,6 @@ TODO
 
 # References
   * Some Definitions Everyone Should Know - John C. Baez [(pdf)](http://math.ucr.edu/home/baez/qg-fall2004/definitions.pdf)
-  * Monoidal Categories, Higher Categories - Jamie Vicary [(pdf)](http://events.cs.bham.ac.uk/mgs2019/vicary.pdf)
   * Notions of Computation as Monoids - Exequiel Rivas, Mauro Jaskelioff [(arxiv.org/abs/1406.4823)](https://arxiv.org/pdf/1406.4823.pdf)
   * Discrimination is Wrong: Improving Productivity - Edward Kmett [(video from YOW! Conferences)](https://www.youtube.com/watch?v=eXDJ5Jcbgk8), [(video from ZuriHac 2015)](https://www.youtube.com/watch?v=cB8DapKQz-I), [(slides)](http://yowconference.com.au/slides/yowlambdajam2015/Kmett-DiscriminationIsWrong.pdf)
   * Braided Monoidal Categories - Andre Joyal, Ross Street [(pdf)](http://maths.mq.edu.au/~street/JS1.pdf)