Are applicative languages inefficient?
- 1 June 1988
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 23 (6) , 135-139
- https://doi.org/10.1145/44546.44559
Abstract
Side-effects are forbidden in applicative languages like Prolog [3], FP [2], pure Lisp [9], and SISAL [8]. Algorithms can often be reformulated applicatively with no loss of efficiency. It is not known whether this is always the case. Here are seven problems which have been resistant to efficient reformulation. The reader is invited to produce an efficient applicative program or lower-bound argument for any of these.Keywords
This publication has 2 references indexed in Scilit:
- A new data structure for representing sorted listsActa Informatica, 1982
- Can programming be liberated from the von Neumann style?Communications of the ACM, 1978