APA (7th ed.) Citation

DANVY, O. (2022). Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant. Journal of Functional Programming, 32, 1. https://doi.org/10.1017/S0956796822000107

Chicago Style (17th ed.) Citation

DANVY, OLIVIER. "Fold–unfold Lemmas for Reasoning About Recursive Programs Using the Coq Proof Assistant." Journal of Functional Programming 32 (2022): 1. https://doi.org/10.1017/S0956796822000107.

MLA (9th ed.) Citation

DANVY, OLIVIER. "Fold–unfold Lemmas for Reasoning About Recursive Programs Using the Coq Proof Assistant." Journal of Functional Programming, vol. 32, 2022, p. 1, https://doi.org/10.1017/S0956796822000107.