Abstract
A unifying model for lambda style reduction and combinator style reduction is presented. Both reduction types will be described as tree transforming mechanisms thus avoiding as many of the usual implementation details as possible. It will be shown that there is a very strong correspondence between the two reduction mechanisms. This correspondence offers a basis for a fair comparison of the complexities of both mechanisms.
The author is funded by Deutsche Forschungsgemeinschaft SFB 124 — VLSI Entwurfsmethoden und Parallelität
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
11. Literature
T.J.W. Clarke, P.J.S. Gladstone, C.D. MacLean and A.C. Norman, “SKIM — The S, K, I Reduction Machine”, Procedings of the 1980 ACM Lisp Conference, p. 128–135, Aug. 1980.
P. Henderson, “Functional Programming: Application and Implementation”, Prentice-Hall International Series in Computer Science, 1980.
P. Hudak and D. Kranz, “A Combinator-based Compiler for a Functional Language”, Eleventh annual ACM Symposium on Principles of Programming Languages, January 1984.
R. J. M. Hughes, “Super-Combinators”, Conference Record of the 1982 ACM Symposium on LISP and Functional Programming1–10, 1982.
T. Ida and A. Konagaya, “Comparison of closure reduction and combinator reduction schemes”, unpublished, 1984.
Simon Peyton Jones, “An Investigation on the Relative Efficiencies of Combinators and Lambda Expressions”, Conference Record od the 1982 ACM Symposium on Lisp and Functional Programming, p. 150–158, Aug. 1982.
M.S. Joy and V.J. Rayward-Smith, F.W. Burton, “Efficient Combinator Code”, Computer Lang. Vol. 10, No. 3/4, 1985.
J.R. Kennaway, “The Complexity of a Translation of λ-calculus to Combinators”, Report CS/82/23/E, p. University of East Anglia, 1982.
H.G. Oberhauser, “A Fully Lazy Lambda Style Graph Reducer”, SFB 124-C1, 06/1986, Universität des Saarlandes, West Germany, 1986.
H.G. Oberhauser, “On the Correspondence of Lambda Style Reduction and Combinator Style Reduction”, SFB 124-C1, 02/1986, Universität des Saarlandes, West Germany, 1986.
W.R. Stoye, T.J.W. Clarke and A.C. Norman, “Some Practical Methods for Rapid Combinator Reduction”, 1984 ACM Symposium on Lisp and Functional Programming, p. 159–166, 1984.
D.A. Turner, “A new implementation technique for applicative languages”, Software — Practice and Experience, 9, p. 31–49, Sept. 1979.
D.A. Turner, “Another algorithm for bracket abstraction”, The Journal of Symbolic Logic, 44, June 1979.
C. P. Wadsworth, “Semantics and Pragmatics of the Lambda-Calculus.”, Ph.D Thesis, Oxford University, 1971.
D.S. Wise, “Interpreters for Functional Languages”, Functional Programming and it's Applications, an advanced course. Cambridge University Press, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oberhauser, HG. (1987). On the correspondence of lambda style reduction and combinator style reduction. In: Fasel, J.H., Keller, R.M. (eds) Graph Reduction. GR 1986. Lecture Notes in Computer Science, vol 279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18420-1_47
Download citation
DOI: https://doi.org/10.1007/3-540-18420-1_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18420-1
Online ISBN: 978-3-540-47963-5
eBook Packages: Springer Book Archive