Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant (Q5051990)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant |
scientific article; zbMATH DE number 7620649
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant |
scientific article; zbMATH DE number 7620649 |
Statements
Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant (English)
0 references
18 November 2022
0 references
0.7514500617980957
0 references
0.7057561874389648
0 references
0.6874063014984131
0 references
0.6863483190536499
0 references
