Haskell. But there are other examples of "pure functional programming". And the state of the art is dependently typed languages, which are essentially theorem p

Haskell. But there are other examples of "pure functional programming". And the state of the art is dependently typed languages, which are essentially theorem provers but can be used to extract working code.