-
> NOTE This issue has been modified several times as I have learned more about Typeclass derivation. Please see the Edit sections below for latest info.
In Quill, we frequently use the following pa…
-
With Task gone, it's now time to look at IO. Instead of deleting scalaz.effect outright however, I thought it best to raise an issue to see if `MonadIO` or any typeclasses in effect are worth salvagin…
-
Supposing the following implementation:
```scala
package example
import simulacrum.typeclass
/**
* My formatter
*
* @tparam A
*/
@typeclass trait Show[A] {
/**
* Formats…
-
#### Version
Tested with coq 8.6 and 8.7
#### Description of the problem
As illustrated by the snippet below, in some cases, hints added using `Hint Resolve` seem to not be picked up by `type…
-
Here's a (somewhat) minimized example involving parameter records:
```coq
Require Import Coq.ZArith.ZArith. Open Scope Z_scope.
Require Import Coq.Init.Byte.
Module word.
Class word {width …
-
Spire currently has good support for:
- concrete data types (Rational, SafeLong, etc...)
- abstract typeclasses that mimic abstract algebraic structures (rings, fields, etc...)
We want to reduc…
-
As @mandubian pointed out on Gitter:
```haskell
class JavaConverter a b where
toJava :: a -> b
fromJava :: b -> a
```
makes type inference really difficult.
We can split it up and add …
-
It's a bit of a shame that things like `bfs` and `dfs` are duplicated for every single `AdjacencyMap` representation. For example `Algebra.Graph.Labelled.AdjacencyMap` does not even have a DFS at the …
-
I think that these typeclasses should go into Algebra.
-
Trying to use typeclasses a little... here is my minimal repro:
```
class block (index: Type0) = {
// Astract footprint.
state: index -> Type0;
footprint: #i:index -> h:HS.mem -> s:state …