Abstract | ||
---|---|---|
Although Warren's method for the evaluation in Prolog of expressions with higher-order functions appears to have been neglected, it is of great value. Warren's paper needs to be supplemented in two respects. He showed ex- amples of a translation from λ expressions to clauses, but did not present ag eneral method. Here we present a general translation program and prove it correct with respect to the axioms of equalit ya nd thos eo f the λ-calculus. Warren's paper only argues in general terms that a structure- sharing Prolog implementation can be expected to efficiently evaluate the result of his translation. We show a comparison of timings between lisp and a structure-copying implementation of Prolog. The result suggests that Warren's method is about as efficient as the Lisp method for the evaluation of λ expressions involving higher-order functions. |
Year | Venue | Keywords |
---|---|---|
1990 | International Conference on Logic Programming/Joint International Conference and Symposium on Logic Programming | functional programming,higher order functions |
Field | DocType | ISBN |
Fifth-generation programming language,Programming language,Horn clause,Functional programming,Lisp,Algorithm,Symbolic programming,Prolog,Declarative programming,Logic programming,Mathematics | Conference | 0-262-73090-1 |
Citations | PageRank | References |
9 | 1.04 | 7 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
M. H. M. Cheng | 1 | 27 | 3.98 |
M. H. Van Emden | 2 | 1236 | 416.63 |
B.E. Richards | 3 | 9 | 2.06 |