Abstract
Why do functional languages have more difficulties with arrays than procedural languages? The problems arising in the designing of functional languages with arrays and in their implementations are manifold. They can be classified according to 1) first principles, 2) semantics, 3) pragmatics, and 4) performance. This paper attempts to give an outline of the issues in this area, and their relation to the lambda calculus. The lambda calculus is a formal system and as such seemingly remote from practical applications. However, specific representations and implementations of that system may be utilized to realize arrays such that progress is made towards a compromise of 1) adhering to first principles, 2) clear semantics, 3) obvious pragmatics, and 4) high performance. To be more specific, a form of the lambda calculus which uses a particular representation of variables, namely De Bruijn indices, may be a vehicle to represent arrays and the functions to manipulate them.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Abdali S.K., “An Abstraction Algorithm for Combinatory Logic.” The Journal of Symbolic Logic, Vol. 41, Number 1, March 1976, pp. 222–224.
Backus, J. “Can Programming be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs.” CACM, V21, N8, pp613–641, (1978).
Berkling, K.J., “Headorder Reduction: A Graph Reduction Scheme for the Operational Lambda Calculus,” Proceedings of the Los Alamos Graph Reduction Workshop, Springer Lecture Notes in Computer Science, Vol 279, (1986).
Burge, W.H. “Recursive Programming Techniques.” Addison-Wesley, Reading Massachusetts, (1975).
Mullin, L.M.R. “A Mathematics of Arrays.” Ph.D. Dissertation, School of CIS, Syracuse University, (1988).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media New York
About this chapter
Cite this chapter
Berkling, K. (1991). Arrays and The Lambda Calculus. In: Mullin, L.M.R., Jenkins, M., Hains, G., Bernecky, R., Gao, G. (eds) Arrays, Functional Languages, and Parallel Systems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4002-1_1
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4002-1_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6789-5
Online ISBN: 978-1-4615-4002-1
eBook Packages: Springer Book Archive