-
**This testcase is generated by a fuzzer.**
Compiler Explorer: [https://godbolt.org/z/n9oM9dYbc](https://godbolt.org/z/n9oM9dYbc)
This invalid code will crash on Clang Assertion Trunk.
```cpp
…
-
When defining new objects and inductive types in one ```MetaCoq Run``` call from their ```term``` AST, if your definitions are dependent, it can lead to a universe level error not present when definin…
-
I would be interesting to add, at least to some extent, the possibility to define a "force field" able to generate flows different from uniform ones. This would result in a drastic increment in the po…
-
```
let push = fn (vector: Vec, item: T) -> Vet
let pop = fn (vector: Vec, item: T) -> Vet
```
Avoid subtraction whenever possible.
-
This fails on 1.1.3
```scala
import izumi.reflect.Tag
trait Base {
object Nested {
trait Member
}
}
object A extends Base
object B extends Base
assert(Tag[A.Nested.Member] != Ta…
-
Inspired by Agda, allow you to define types not only based on other types but also based on values. Supposedly this should somehow allow the compiler to report more mistakes at compile time, not sure …
-
After working with Medea, we find that we cannot express the following usecase:
IF tag = "OrderAddress" THEN dbObject must use a single specified schema (out of 9 possible types)
-
Consider how to extend the type system to dependent types.
-
list inputs currently only lists the types under the root namespace. We also need to know what dependent types there are and list these.
-
See issue #97 for some prior discussion.
Consider a simple nested object which groups expense per hobby per person :
```
{
joe: {
skating: {time: 1000, money: 300},
cooking: {time: 9999, m…