Abstract
Systems of lambda calculus are of importance for most knowledge representation theories and in particular for several systems for Natural Language Processing. During the implementation of lambda systems several problems arise that are directly related to the presence of bound variables. These problems can be avoided using translations from lambda calculus into combinatory systems, which give origin to extremely simple reduction machines. In this article we present and prove the correctness of a translation algorithm, that, when compared with other systems, has quite good properties in terms of memory space as well as in terms of length of evaluations.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S. Abdali. An abstraction algorithm for combinatory logic. Journal of Symbolic Logic, 41:222–224, 1976.
H. Barendregt. Functional programming and lambda calculus. Handbook of Theoretical Computer Science, pages 322–63, 1990.
L. Cardelli. Semantics of multiple inheritance. In Kahn, MacQueen, and Plotkin, editors, Semantics of Data Types, volume 173 of LNCS. Springer Verlag, 1984.
H. Curry and R. Feys. Combinatory Logic Vol. 1. North-Holland, Amsterdam, 1958.
M. Dalrymple, S. M. Shieber, and F. C. N. Pereira. Ellipsis and higher-order unification. Linguistics and Philosophy, 14:399–452, 1991.
D. Dowty, R. Wall, and S. Peters. Introduction to Montague Semantics. D. Reidel Publishing Company, Dordrecht, 1985.
J. Hugues. Supercombinators, a new implementation method for applicative languages. Proc. ACM Symp. on Lisp and Functional Programming, pages 1–10, 1988.
J. P. S. J. Roger Hindley. Introduction to Combinators and λ-Calculus. Cambridge University Press, 1986.
J. R. Kennaway and M. R. Sleep. Counting director strings. University of East Anglia, Norwich, 1984.
J. Mulder. Complexity of combinatory code. Preprint 389, University Utrecht, Department of Mathematics, August 1985.
F. Pereira. Categorial semantics and scoping. Computational Linguistics, 16(1), 1990.
F. Pereira and S. Shieber. Prolog and natural-language analysis. CSLI Lecture Notes, 10, 1987.
S. Peyton Jones. The implementation of functional programming languages. Prentice-Hall, 1987.
M. Schönfinkel. Über die Bausteine der mathematischen Logik. Mathematische Annalen, 92:305–316, 1924.
R. Statman. On translating lambda terms into combinators; the basis problem. pages 378–382. IEEE, 1986. Proceedings of the LICS'86.
D. Turner. Another algorithm for bracket abstraction. Journal of Symbolic Logic,44:267–270, 1979.
D. Turner. A new implementation technique for applicative languages. Software-Practice and Experience, 9:31–49, 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Broda, S., Damas, L. (1995). A new translation algorithm from lambda calculus into combinatory logic. In: Pinto-Ferreira, C., Mamede, N.J. (eds) Progress in Artificial Intelligence. EPIA 1995. Lecture Notes in Computer Science, vol 990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60428-6_30
Download citation
DOI: https://doi.org/10.1007/3-540-60428-6_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60428-0
Online ISBN: 978-3-540-45595-0
eBook Packages: Springer Book Archive