-
Liskov and Leibniz are more useful than the Predef versions, thanks to their interesting combinators.
However, demanding a `
-
## Minimized code
```Scala
import scala.Option
object Test extends App {
trait A[+X]
class B[+X](val x: X) extends A[X]
object B {
def unapply[X](b: B[X]): Option[X] = Some(b.x)
…
-
Exception: compiler/typecheck/TcTyClsDecls.hs:(1377,5)-(1379,67): Irrefutable pattern failed for pattern Just (subst,
_)
-
Is there any plan to bring the Indexed (Monads) to `bs-abstract`? It could be especially useful when state management is involved.
I made a small gist [here](https://gist.github.com/gaku-sei/434d4d…
-
This works:
```haskell
data Foo a where
MkFoo :: Foo Bool
data Bar a where
MkBar :: Int -> Bar Int
deriveUniverseSome ''Foo
deriveUniverseSome ''Bar
```
But if you replace that `M…
-
## Compiler version
3.2.2
3.3.0-RC3
## Minimized code
```Scala
enum Foo[A]:
case Bar[X, Y]() extends Foo[X | Y]
def go[A](foo: Foo[A]): Unit =
foo match
case b: Foo.Bar[x, y] …
-
Does @functionaljava rules out any support for higher order type polymorphism?
(ie, like how it is done in https://github.com/DanielGronau/highj/wiki)
If yes, what about about a safer, closed-world im…
-
Completion record defined as only containing language values, however in a number of places specification values are returned (References, primary example).
ecma262 has a couple of interesting issu…
-
On the following code, merlin does not highlight the last declaration. `ocamlc -w -A+39 test.ml` does warn for the 4 lines.
``` ocaml
type _ t = A : unit t
(* f is highlighted, Warning 39: unused r…
-
```
{-# language UnicodeSyntax #-}
module Main where
import Prelude qualified as A
data Term a where
Lit :: A.Int -> Term A.Int
Succ :: Term A.Int -> Term A.Int
IsZero :: Term A.Int ->…