Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-22T11:08:36.316Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Published online by Cambridge University Press:  06 March 2023

OLIVIER DANVY Open the ORCID record for OLIVIER DANVY [Opens in a new window]
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content. As you have access to this content, full HTML content is provided on this page. A PDF of this content is also available in through the ‘Save PDF’ action button.
Type
Erratum
Information
Journal of Functional Programming , Volume 33 , 2023 , e3
Check for updates
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2023. Published by Cambridge University Press

This manuscript was published in Journal of Functional Programming with supplementary material missing.

The supplementary material has now been published online and the supplementary material statement has been added to the original article in both the online PDF and HTML versions of this article.

The publisher apologises for this error.

References

Danvy, O. (2022) Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant. Journal of Functional Programming, 32, E13. doi: 10.1017/S0956796822000107 CrossRefGoogle Scholar
Submit a response

Discussions

No Discussions have been published for this article.