I think that Haskell is a good example, Miranda and Clean also.
Prolog and Mercury also, although things like the cut operator make it a bit more complicated.
Scheme and clojure are both procedural languages, with good support for function composition.
Clojure has good support for immutable data structures, but that's not quite what we're after here.
The ACL2 theorem prover is probably the closest in the lisp family.
C++ is gradually trying to get its toes wet with things like constexpr functions, and templates, but ... :)
Which is not to say that procedures and algorithms are bad, and functions are good -- it's just that procedures are easy to execute and functions involve harder proof-work -- there are good economic reasons for the bias toward procedures in programming languages.
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
I think that Haskell is a good example, Miranda and Clean also.
Prolog and Mercury also, although things like the cut operator make it a bit more complicated.
Scheme and clojure are both procedural languages, with good support for function composition.
Clojure has good support for immutable data structures, but that's not quite what we're after here.
The ACL2 theorem prover is probably the closest in the lisp family.
C++ is gradually trying to get its toes wet with things like constexpr functions, and templates, but ... :)
Which is not to say that procedures and algorithms are bad, and functions are good -- it's just that procedures are easy to execute and functions involve harder proof-work -- there are good economic reasons for the bias toward procedures in programming languages.