We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
willi_kappler asked whether it is possible to one day implement dependent types or refinement types in Rust as a crate.
There might be several ways to do this.
For example, one idea is to use TypeId and a hash table to look up function pointers.
Another approach could be to use Prop types together with normal Rust code.
Yet another idea is to use a solver that generates proofs in Rust.
The text was updated successfully, but these errors were encountered:
No branches or pull requests
willi_kappler asked whether it is possible to one day implement dependent types or refinement types in Rust as a crate.
There might be several ways to do this.
For example, one idea is to use TypeId and a hash table to look up function pointers.
Another approach could be to use Prop types together with normal Rust code.
Yet another idea is to use a solver that generates proofs in Rust.
The text was updated successfully, but these errors were encountered: