Revisiting the Fast Fourier Transform in Rocq
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913989162696704 |
|---|---|
| author | Théry, Laurent |
| author_facet | Théry, Laurent |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2210_05225 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Revisiting the Fast Fourier Transform in Rocq Théry, Laurent Logic in Computer Science 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. |
| title | Revisiting the Fast Fourier Transform in Rocq |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2210.05225 |