Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant.
Saved in:
| Title: | Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant. |
|---|---|
| Authors: | DANVY, OLIVIER1 (AUTHOR) danvy@acm.org |
| Source: | Journal of Functional Programming. 2022, Vol. 32, p1-27. 27p. |
| Database: | Mathematics Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
Be the first to leave a comment!
