A Formalisation of a Fast Fourier Transform

10/11/2022

∙

by   Laurent Théry, et al.

∙

0

∙

share

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.