-
The addition of the Field type class is a significant improvement. Thank you for that.
I implemented the operations of the field GF(16) and then defined vectors and matrices over this field. It a…
-
In our current approach to teaching Daml, we necessarily teach use of existing typeclasses, as we define many as part of the Daml standard library and triggers library, but not definition of one's own…
-
Instead of defining a Tree as a data, we could define it as a typeclass:
``` haskell
class Tree a where
eval :: Tree -> a
derive :: Tree -> Tree
replace :: Tree -> a -> Tree
clean ::…
-
## Compiler version
3.2.2, 3.3.0-RC4
## Minimized code
```scala
trait Foo[A]
object Foo:
trait Codec[A] extends Foo[A]
object Codec:
inline def derived[A]: Codec[A] = ???
end Fo…
-
the code base should be more rely on the Haskell type system.
there is duplicate code like :
combine -> CashflowFrame -> CashflowFrame -> CashflowFrame
which is just a `` in semigroup..
…
-
## Motivation
Unlike Haskell, Scala allows multiple implicit instances of a type. This makes implicits cover a lot more use cases. Besides type classes, implicits can also express
- capabilitie…
-
See: https://github.com/non/algebra/pull/126#discussion_r45569352
`Group[Map[K, V]]` needs a vetor space style `Eq[Map[K, V]]` that considers `eqv(Some(0), None)`
one proposal is for the dependant …
-
#### Description of the problem
@robbertkrebbers pointed out that `Set Implicit Arguments.` doesn't work well with typeclasses.
Self-contained example: after:
```
Set Implicit Arguments.
Clas…
-
```
Set Typeclasses Unique Solutions.
Class test A := {
a: A
}.
Instance blah: test bool := {
a := true
}.
…
-
It’d be great to be able to define a typeclass, instance(s), and then automatically use the appropriate instance (or supplied parameter) when using an overloaded symbol.
Right now we define the “cl…