Create a database of all possible expressions of token length small enough to not explode any data storage. Given a type, show a DAG of at least as general types, showing all expressions of each type at their node, capped by "a", which is inhabited only by undefined. Compare the exference project.
Create a database of all possible expressions of token length small enough to not explode any data storage. Given a type, show a DAG of at least as general types, showing all expressions of each type at their node, capped by "a", which is inhabited only by
undefined. Compare the exference project.