-
It would be good to have standard definitions of the type class laws for the classes in the Prelude, and prove them for the instances we provide. Here is an example of how this would look:
```agda
o…
-
Specifically it is not clear to me why `Show`, `Rangeable` or `HasAttributes` are needed to parse markdown. These extra constraints are hard for me to satisfy for the types I want to work with.
-
I'm opening this issue just to give some feedback on these two exercises.
- So in Monad exercise `OptionT` is introduced. You can deduce some of its meaning from the text on the exercise but I've had …
-
Currently, our "cost" type is a `Double` or a new-typed `Double` labeled `ExtendedReal`.
Our use-case for `Cost` does not overlap well with the `Num` and related "numeric" type-class instances.
…
-
Breaking changes
---
* [x] Values of the Maybe and Either types are no longer compatible with Ramda
* [x] Nothing() is now known simply as Nothing
* [x] and and or are now monomorphic
* [x] xor h…
-
- `~/.config` needs to be built before I can link karabiner config to it
- ctags brew install not working
- does not deal with folders already existing for `~/.vim` link
- cleanup script breaks on …
-
I believe one should PR the content of this repo into mathlib bit by bit to preserve this repo. Afterall, a Chinese proverb says that "anything not PR'ed into mathlib is lost in time".
I imagine th…
-
It seems that `Conj[T]` would require an `Ordering` which sorts elements by hierarchy precedence and then a simple override combination operator, which is in turn a monoid. Specifically, `Conj[T](T1,…
-
Would be super groovy if you could search for functions in-scope with `:s`. Here is what you can do in the Idris repl:
```
Idris> :search Monad f => f a -> f b -> f a
< Prelude.Applicative.(*>) : App…
-
It sticks around "Compiling Test.Main" for about 30 minutes (I have stopped it by myself). At that moment `purs.bin` was consuming about 40 gb of virtual memory. It looks in Activity monitor this way:…