Skip to content
New issue

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

Use reflexivity in Coq proofs #10

Open
Gbury opened this issue Sep 8, 2017 · 0 comments
Open

Use reflexivity in Coq proofs #10

Gbury opened this issue Sep 8, 2017 · 0 comments

Comments

@Gbury
Copy link
Owner

Gbury commented Sep 8, 2017

Currently coq proof can be quite slow (and even fail to check within reasonable time/memory).
One solution would be to change the structure of coq output from a srie of tactics to the following: write a reflexive function which would compute on a custom data structure (such as a list of resolutions).

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant