On recursive functions and well–founded relations in the calculus of constructions

  • Authors:

  • J. L. Freire;E. Freire;A. Blanco

  • Affiliations:

  • Department of Computer Science, LFCIA, University of A Coruña, Coruña, Spain;Department of Computer Science, LFCIA, University of A Coruña, Coruña, Spain;Department of Computer Science, LFCIA, University of A Coruña, Coruña, Spain

  • Venue:
  • EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a reflection about function construction through well-founded recursion in the type theory known as Calculus of Inductive Constructions. It shows the expressive power of this calculus when dealing with concepts as accesibility and noetherianity among others. The properties of the General Recursion Scheme ([2]) and its relation with Structural Recursion in inductive types are analyzed. As a consequence, a methodology arises which is illustrated with some examples.We use the INRIA's compiler of the Calculus of Inductive Constructions: Coq [6].