Published August 28, 2020
| Version v2
Software
Open
Completeness and complexity of reasoning about call-by-value in Hoare logic (Proof Files)
Description
This archive contains a Coq formalization of parts of the completeness proof of the paper "Completeness and complexity of reasoning about call-by-value in Hoare logic".