Codifying guarded definitions with recursive schemes

  • Eduarde Giménez
Conference paper

DOI: 10.1007/3-540-60579-7_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 996)
Cite this paper as:
Giménez E. (1995) Codifying guarded definitions with recursive schemes. In: Dybjer P., Nordström B., Smith J. (eds) Types for Proofs and Programs. TYPES 1994. Lecture Notes in Computer Science, vol 996. Springer, Berlin, Heidelberg

Abstract

We formalize an extension of the Calculus of Constructions with inductive and coinductive types which allows a more direct description of recursive definitions. The approach we follow is close to the one proposed for Martin-Löf's type theory in [5]. Recursive objects can be defined by fixed-point definitions as in functional programming languages, and a syntactical checking of these definitions avoids the introduction of non-normalizable terms. We show that the conditions for accepting a recursive definition proposed in [5] are not sufficient for the Calculus of Constructions, and we modify them. As a way of justifying our conditions, we develop a general method to codify a fix point definition satisfying them using well-known recursive schemes, like primitive recursion and co-recursion. We also propose different reduction rules from the ones used in [5] in order to obtain a decidable conversion relation for the system.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Eduarde Giménez
    • 1
  1. 1.LIP-IMAG URA CNRS 1398ENS LyonLyon Cedex 07France

Personalised recommendations