English

Revisiting the Fast Fourier Transform in Rocq

Logic in Computer Science 2025-08-15 v5

Abstract

This notes explains how a standard algorithm that constructs the discrete Fourier transform has been formalised and proved correct in the Coq proof assistant using the SSReflect extension.

Cite

@article{arxiv.2210.05225,
  title  = {Revisiting the Fast Fourier Transform in Rocq},
  author = {Laurent Théry},
  journal= {arXiv preprint arXiv:2210.05225},
  year   = {2025}
}
R2 v1 2026-06-28T03:13:11.967Z