Philip Wadler wrote:
> By the way, FFTW although written in C, was generated by a functional
> program written in Caml. You can find more details on the web page
I asked the authors (Steven Johnson and Matteo Frigo from MIT) a few
months ago why they chose Objective Caml over SML, Haskell, and Scheme.
The answer was bascially because they knew it already and it ran well on
one of their older laptops.
I think what it more interesting is that fact that the code uses
explicit recursion (as oppose to "traditional" loop based algorithms)
and all of the codelets/butterflys are executed via byte code. On top
of that, it managed to beat most other FFT packages available today.
--Matt Donadio ([EMAIL PROTECTED])
