Abstract
Structural recursion is powerful, especially in combination with higher-order definitions, as we have seen in the example of Ackermann’s function. Nevertheless, it is not always adapted to describe algorithms where termination is difficult to express as structural recursion with respect to one of the arguments.
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
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bertot, Y., Castéran, P. (2004). * General Recursion. In: Interactive Theorem Proving and Program Development. Texts in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-07964-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-662-07964-5_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05880-6
Online ISBN: 978-3-662-07964-5
eBook Packages: Springer Book Archive