Abstract
We introduce an extension of the Calculus of Construction with inductive and co-inductive types that preserves normalisation, while keeping a relatively simple collection of typing rules. This extension considerably enlarges the expressiveness of the language, enabling a direct representation of recursive programs in type theory.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Amadio and S. Coupet. Analysis of a guard condition in type theory. Technical Report 3300, INRIA, October 1997. Extended abstract to appear in ETAPS 98 (FoSSaCS).
B. Barras, S. Boutin, C. Cornes, J. Courant, J.C. Filliatre, E. Giménez, H. Herbelin, G. Huet, C. Mu noz, C. Murthy, C. Parent, C. Paulin, A. SaÏbi, and B. Werner. The Coq Proof Assistant Reference Manual — Version V6.1. Technical Report 0203, INRIA, 1997.
R. Bird and P. Wadler. Introduction to Functional Programming. Prentice-Hall, UK, 1988.
P. Caspi and M. Pouzet. Synchronous Kahn networks. In ACM Sigplan International Conference of Functional Programming, May 1996.
T. Coquand. Metamathematical Investigations of a Calculus of Constructions. In P. Odifreddi, editor, Logic and Computer Science, volume 31 of The APIC series, pages 91–122. Academic Press, 1990.
T. Coquand. Infinite objects in type theory. In H. Barendregt and T. Nipkow, editors, Workshop on Types for Proofs and Programs, number 806 in LNCS, pages 62–78. Springer-Verlag, 1993.
H. Geuvers. A short and flexible proof of strong normalisation for the Calculus of Constructions. In P. Dybjer, B. Nordström, and J. Smith, editors, Workshop on Types of proofs and programs, number 996 in LNCS, pages 14–38. Springer-Verlag, 1994.
E. Giménez. Codifying guarded definitions with recursive schemes. In Workshop on Types for Proofs and Programs, number 996 in LNCS, pages 39–59. Springer-Verlag, 1994.
E. Giménez. A Calculus of Infinite Constructions and its application to the verification of communicating systems. PhD thesis, Ecole Normale Supérieure de Lyon, 1996.
E. Giménez. A calculus for typing recursive definitions: rules and soundness. Technical report, INRIA, 1998.
E. Giménez. A tutorial on recursive types in coq. Technical report, INRIA, 1998. Electronically distributed with the system Coq.
Jean-Pierre Jouannaud and Mitsuhiro Okada. Inductive data type systems. Theoretical Computer Science, 173(2):349–391, February 1997.
F.P. Mendler. Inductive Definitions in Type Theory. PhD thesis, Cornell University, 1987.
B. Nordström, K. Petersson, and J. Smith. Programming in Martin-Löf's Type Theory: An Introduction, volume 7 of International Series of Monographs on Computer Science. Oxford Science Publications, 1990.
C. Paulin. Inductive Definitions in the System Coq — Rules and Properties. In M. Bezem and J.-F. Groote, editors, Typed Lambda Calculi and Applications, number 664 in LNCS. Springer-Verlag, 1993.
C. Paulin-Mohring. Définitions Inductives en Théorie des Types d'Ordre Supérieur. Habilitation à diriger les recherches, Université Claude Bernard Lyon I, December 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Giménez, E. (1998). Structural recursive definitions in type theory. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055070
Download citation
DOI: https://doi.org/10.1007/BFb0055070
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64781-2
Online ISBN: 978-3-540-68681-1
eBook Packages: Springer Book Archive