Abstract
A higher-order functional language is one in which a function may be used as a value, just like an integer or a boolean. That is, the value of a variable may be a function, and a function may take a function as argument and may return a function as a result.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Barendregt, H.: The lambda calculus: its syntax and semantics. In: Studies in Logic and the Foundations of Mathematics, vol. 103, revised edn. North-Holland (1984)
Church, A.: An unsolvable problem of elementary number theory. Am. J. Math. 58(2), 345–363 (1936)
Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. In: OSDI 2004 (2004)
Haskell programming language. http://www.haskell.org/
Moscow ML: http://mosml.org/
Peyton Jones, S., Lester, D.: Implementing Functional Languages. Prentice-Hall (1992)
Sestoft, P.: Lambda calculus reduction workbench. Web page (1996). http://www.itu.dk/people/sestoft/lamreduce/
Sestoft, P.: Deriving a lazy abstract machine. J. Funct. Program. 7(3), 231–264 (1997)
Sestoft, P.: Java Precisely, 3rd edn. The MIT Press, Cambridge (2016)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Sestoft, P. (2017). Higher-Order Functions. In: Programming Language Concepts. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-60789-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-60789-4_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-60788-7
Online ISBN: 978-3-319-60789-4
eBook Packages: Computer ScienceComputer Science (R0)