-
Schemas **must** be readable at runtime. In other words, we must provide a way to read/write schemas from/to the wire.
Schemas composed only of `One`, `:+:` and `:*:` (so-called "essential schemas…
-
I noticed something strange while doing some refactoring: PR #10277 introduced a test that should "fail in both cases" (with and without the `-principal` option, and that seems reasonable:
[tests/t…
-
When constructing things inside of the splicer, it's easy to make mistakes and accidentally produce ill-typed terms, which can be really hard to debug. This is _especially_ true when dealing with univ…
-
The idea is to allow the player to interpret himself some strings as a Nomex ().
This would allow the rules themselves to read code inputted by the players. Currently the players are inputting the new…
-
I think that my definition of the `Case` constructor might be a little restrictive because I think the soda level function can return differently typed values. We could make an existential type just t…
-
I would like a "fast" mode for Haddock. Often when I'm writing Haddocks, I just want to quickly build the docs and see how they render, and find out if I've introduced any parse errors (e.g. `--^` on …
-
I think they would add stronger compile time guarantees as well as serve as documentation about Fortran's AST invariants. This could be useful for source to source transformations as a sort of added c…
-
Proposes a new type of GenType that is incompatible with the existing GenType (will probably have the name GenType v2 or something quite different)
### Motivation
GenType is a must in today's JS…
-
It would be really cool to have compiletime info about datatype size. This has the potential to make both the generics and TH derivations more efficient. Certainly for TH it would cause the compiler…
-
How do we handle output, vs queries?
```
display :: Effect () -- output is a side-effect
display :: Effect Output -- output is returned, no side effect
```
We also need to consider reply. W…