-
Add support for GADTs
-
Given inductively defined naturals `data N = Z | S N` we can define finite sets as follows:
``` haskell
data Fin :: N -> Type where
FZ :: Fin (S n)
FS :: Fin n -> Fin (S n)
```
If I wrap the abo…
-
I tried to figure it out but didn't really know what to say. I didn't understand how or why to use them.
-
Generalized ADTs are pretty standard technology in typed FP. They're in OCaml and GHC. I don't think it would be too controversial if we implemented them too.
[This](https://www.microsoft.com/en-us/r…
-
- What are they?
- What is their encoding in Scala (http://lambdalog.seanseefried.com/posts/2011-11-22-gadts-in-scala.html)
- Why would you use them?
/cc @tmcgilchrist
-
This one is ridiculously hard to describe in an intuitive way, so this will definitely go into an advanced section.
Not sure what practical examples would fit for e.g. UI development... IMO it's a …
-
We can define folds for `Seq` more efficiently. See thread starting https://github.com/haskell/containers/issues/1016#issuecomment-2336465956 and in particular the code by treeowl in https://github.co…
-
Can support for GADT / ADT
-
Hi, thanks for this cool library.
Is support for GADTs planned?
-
I'd like to see something about GADTs and advanced module uses in this part.