most citedComputable analysis and notions of continuity in Coq

2 citations

researchers with a paper here
collaborating institutions

2 papers

cs.LO2022★ 1 cited

Revisiting the Fast Fourier Transform in Rocq

Laurent Théry

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 ex…

cs.LO2019★ 2 cited

Computable analysis and notions of continuity in Coq

Florian Steinberg, Laurent Thery, Holger Thies

We give a number of formal proofs of theorems from the field of computable analysis. Many of our results specify executable algorithms that work on infinite inputs by means of oper…