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.
CITATION STYLE
Giménez, E. (1998). Structural recursive definitions in type theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1443 LNCS, pp. 397–408). Springer Verlag. https://doi.org/10.1007/bfb0055070
Mendeley helps you to discover research relevant for your work.