Abstract
A recursive specification “defines a function in terms of itself.” Recursive definitions occur commonly in the mathematical literature including that prior to the computer age. Here, the art of separating out “improper” recursive definitions was regarded as but one of the many skills necessary to write correct mathematics. But modern computer languages allow recursive specification to be expressed directly. Since the implementation of a programming language must respond to any recursive program, no matter how ill- conceived, we must pay attention to the mathematical question of what an “arbitrary” recursive specification should mean.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Manes, E.G., Arbib, M.A. (1986). Recursive Specifications. In: Algebraic Approaches to Program Semantics. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4962-7_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4962-7_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-9377-4
Online ISBN: 978-1-4612-4962-7
eBook Packages: Springer Book Archive