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
db4objects. Homepage At http://www.db4o.com/
Haskell programming language. At http://www.haskell.org/
Barendregt, H.: The Lambda Calculus: Its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics, vol. 103, revised edn. North-Holland, Amsterdam (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)
Gafter, N., et al.: JSR proposal: closures for Java. Homepage. At http://www.javac.info/consensus-closures-jsr.html
Moscow, M.L.: At http://www.itu.dk/people/sestoft/mosml.html
Peyton Jones, S., Lester, D.: Implementing Functional Languages. Prentice-Hall, New York (1992)
Sestoft, P.: Lambda calculus reduction workbench. Web page (1996). At http://www.itu.dk/people/sestoft/lamreduce/
Sestoft, P.: Deriving a lazy abstract machine. J. Funct. Program. 7(3), 231–264 (1997)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag London
About this chapter
Cite this chapter
Sestoft, P. (2012). Higher-Order Functions. In: Programming Language Concepts. Undergraduate Topics in Computer Science, vol 50. Springer, London. https://doi.org/10.1007/978-1-4471-4156-3_5
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4156-3_5
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4155-6
Online ISBN: 978-1-4471-4156-3
eBook Packages: Computer ScienceComputer Science (R0)