Stuck on an issue?
Lightrun Answers was designed to reduce the constant googling that comes with debugging 3rd party libraries. It collects links to all the places you might be looking at while hunting down a tough bug.
And, if you’re still stuck at the end, we’re happy to hop on a call to see how we can help out.
`rewrite` keyword as in `Agda` and `Coq`?
See original GitHub issueAs title.
For example, suppose we have +-comm and (p + m) <= (p + n), and we want to prove (m + p) <= (n + p). We could just rewrite twice in Agda and Coq. Can we do it in Aya like this right now?
Issue Analytics
- State:
- Created 2 years ago
- Comments:12 (12 by maintainers)
Top Results From Across the Web
Agda: Simulate Coq's rewrite tactic - Stack Overflow
You can use the Agda keyword rewrite to apply a propositional equivalence on your goal: insertCorrect : ∀ {n} -> ∀ x l...
Read more >Hack your type theory with rewrite rules - Jesper Cockx
This is the purpose of rewrite rules in Agda (as well as in some other languages like Dedukti): to allow the user of...
Read more >4 Proof Assistants
I have been mentioning the proof assistants Agda and Coq together, ... We've seen that Agda rewrites goal and context as a result...
Read more >Extending Agda with User-Defined Rewrite Rules
Dependently typed languages such as Coq and Agda can statically guarantee the ... 8 Agda's rewrite keyword should not be confused with rewrite...
Read more >Victor Cacciari Miraldo Proof by Rewriting in Agda
Small rewrites are quite simple to perform using the rewrite keyword. ... In Coq this would be Prop, but Agda has no set...
Read more >
Top Related Medium Post
No results found
Top Related StackOverflow Question
No results found
Troubleshoot Live Code
Lightrun enables developers to add logs, metrics and snapshots to live code - no restarts or redeploys required.
Start Free
Top Related Reddit Thread
No results found
Top Related Hackernoon Post
No results found
Top Related Tweet
No results found
Top Related Dev.to Post
No results found
Top Related Hashnode Post
No results found
That’s OK. I’ll first have a look at the post when I have time. Then maybe I’ll try to learn something about tactic framework. I don’t know much about it now.
I’d like to do it in Agda’s approach, but first consider dealing with bindings in a dependently typed language… We’re about to (or maybe far from – it all depends on @wsx-ucb) have HOAS in the core, so maybe we can reflect it to the object language. Maybe someone should read https://jesper.sikanda.be/posts/1001-syntax-representations.html