|benchmark references wanted David.Tarditi@B.GP.CS.CMU.EDU (1990-06-24)|
|Keywords:||code, Prolog, optimize|
|Date:||Sun, 24 Jun 90 20:37:11 GMT|
I often see claims about the speed of programs written in functional
programming languages versus those written in conventional imperative
languages. These claims range from "competitive" to "uncompetitive"
performance (whatever these terms may mean).
I am looking for benchmark information that substantiates these claims. I
would like references to published articles, books, and technical reports.
I would also like information on comparative benchmarks for compilers for
Scheme-like languages (i.e. T, SML, and whatever else is out there).
Please send e-mail to email@example.com.
I will post a summary of the responses later this summer. I am interested
in these numbers because they would form a basis for judgments about
optimizing compilers for these various languages, and also because they
would form a basis for predicting the performance of various kinds of
applications if they were written in these languages. For instance, how
would an application which was bound by the speed of its comparison-based
sorting routine do in these various languages ?
Return to the
Search the comp.compilers archives again.