View in EDS HTML Full Text PDF Full Text

Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant.

Saved in:
Bibliographic Details
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.
Description
ISSN:09567968
DOI:10.1017/S0956796822000107