Abstract
There is a lot of freedom in inductive definitions. A type may be a constant whose type is one of the sorts in the system, it may also be a function, this function may have a dependent type, and some of its arguments may be parameters. The constructors may be constants or functions, possibly with a dependent type, their arguments may or may not be in the inductive type, and these arguments may themselves be functions. In this section, we want to study the limits of this freedom.
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
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). ** Foundations of Inductive Types. 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_14
Download citation
DOI: https://doi.org/10.1007/978-3-662-07964-5_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05880-6
Online ISBN: 978-3-662-07964-5
eBook Packages: Springer Book Archive