An investigation of the relative efficiencies of lambda expressions and combinators

  • Simon Peyton Jones

Proc ACM symposium on Lisp and functional programming |

Published by ACM

Publication

In  “A new implementation for applicative languages” Turner uses combinators to implement lambda expressions.  This paper describes an experimental investigation of the efficiency of Turner’s technique compared to more traditional reducers.