Abstract
We say a function or procedure or data type is recursive, or is defined by recursion, if the use of the definition recurs within that definition itself.
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
© 1978 Springer-Verlag, New York Inc.
About this chapter
Cite this chapter
Alagić, S., Arbib, M.A. (1978). Recursion. In: The Design of Well-Structured and Correct Programs. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-6272-5_6
Download citation
DOI: https://doi.org/10.1007/978-1-4612-6272-5_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6274-9
Online ISBN: 978-1-4612-6272-5
eBook Packages: Springer Book Archive