Optimal reduction of functional expressions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1490)
The usual implementations of functional programming languages based on a weak evaluation paradigm (no reduction inside a lambda), betray the very spirit, i.e. the higher-order nature, of lambda-calculus.
- [AG98]A. Asperti, S.Guerrini The Optimal Implementation of Functional Programming Languages. To appear in the “Cambridge Tracts in Theoretical Computer Science” Series, Cambridge University Press, 1998.Google Scholar
© Springer-Verlag Berlin Heidelberg 1998