-
The error message is:
```
[ 5 of 13] Compiling Data.Profunctor.Product.Tuples ( Data/Profunctor/Product/Tuples.hs, dist/build/Data/Profunctor/Product/Tuples.o )
: error:
node: createProces…
-
I propose adding two more types related to `Enumeraion` and `IEnumeraion`.
```haskell
-- Inverse of Enumeration
-- (can be seen as a classification of values of `a`
-- onto a set of integers up…
-
At the moment, in order to define a `Profunctor` instance, one needs to write all of `dimap`, `lmap` an `rmap` functions, but the latter two can be implemented in terms of the first two (and vice vers…
-
This would allow people to define lens-style `Fold`s, `Prism`s and `Iso`s without depending on lens.
-
I think it should be something like this:
-
When running `idris --install profunctors.ipkg` I get the following error messages:
```
Type checking ./Data/Profunctor.idr
./Data/Profunctor.idr:40:27-51:
|
40 | dimap f g (Kleisli h) = K…
-
Trying to compile:
```
class Profunctor (p : Type -> Type -> Type) where
dimap : (a -> b) -> (c -> d) -> p b c -> p a d
dimap f g = lmap f . rmap g
lmap : (a -> b) -> p b c -> p a c
lmap f =…
-
These instance methods look too strict.
* https://github.com/tomjaguarpaw/product-profunctors/blob/b8635f819df2a9362940b5126427e45aa97f3040/Data/Profunctor/Product.hs#L110
* https://github.com/t…
-
It seems Bénabou named profunctors "distributors" after the analogy with distributions.
I should probably add a terminology note for this in the chapter on profunctors.
-
I would like to write sth like this:
```scala
import skolems.∀
object Stuff {
trait Profunctor[=>:[_, _]] {
def dimap[S,T,A,B](sa: S => A, bt: B => T): A =>: B => S =>: T
}
type…