Advertisement

On Strong Normalization of the Calculus of Constructions with Type-Based Termination

  • Benjamin Grégoire
  • Jorge Luis Sacchini
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6397)

Abstract

Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-based termination is a mechanism for ensuring termination that uses types annotated with size information to check that recursive calls are performed on smaller arguments. Our long-term goal is to extend the Calculus of Inductive Constructions with a type-based termination mechanism and prove its logical consistency. In this paper, we present an extension of the Calculus of Constructions (including universes and impredicativity) with sized natural numbers, and prove strong normalization and logical consistency. Moreover, the proof can be easily adapted to include other inductive types.

Keywords

Recursive Function Recursive Call Typing Rule Proof Assistant Inductive Type 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abel, A.: A Polymorphic Lambda-Calculus with Sized Higher-Order Types. PhD thesis, Ludwig-Maximilians-Universität München (2006)Google Scholar
  2. 2.
    Altenkirch, T.: Constructions, Inductive Types and Strong Normalization. PhD thesis, University of Edinburgh (November 1993)Google Scholar
  3. 3.
    Barras, B.: Sets in coq, coq in sets. In: 1st Coq Workshop (August 2009)Google Scholar
  4. 4.
    Barthe, G., Grégoire, B., Pastawski, F.: CIC\(\widehat{~}\): Type-based termination of recursive definitions in the Calculus of Inductive Constructions. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, pp. 257–271. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  5. 5.
    Blanqui, F.: A type-based termination criterion for dependently-typed higher-order rewrite systems. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 24–39. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  6. 6.
    Giménez, E.: Structural recursive definitions in type theory. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 397–408. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  7. 7.
    Grgoire, B., Sacchini, J.L.: On strong normalization of the Calculus of Constructions with type-based termination (2010), http://www-sop.inria.fr/members/Jorge-Luis.Sacchini/papers/sn.pdf
  8. 8.
    Hughes, J., Pareto, L., Sabry, A.: Proving the correctness of reactive systems using sized types. In: POPL, pp. 410–423 (1996)Google Scholar
  9. 9.
    Lee, C.S., Jones, N.D., Ben-Amram, A.M.: The size-change principle for program termination. In: POPL, pp. 81–92 (2001)Google Scholar
  10. 10.
    Luo, Z.: Computation and reasoning: a type theory for computer science. Oxford University Press, Inc., New York (1994)zbMATHGoogle Scholar
  11. 11.
    Melliès, P.-A., Werner, B.: A generic normalisation proof for pure type systems. In: Giménez, E. (ed.) TYPES 1996. LNCS, vol. 1512, pp. 254–276. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  12. 12.
    Wahlstedt, D.: Dependent Type Theory with Parameterized First-Order Data Types and Well-Founded Recursion. PhD thesis, Chalmers University of Technology (2007) ISBN 978-91-7291-979-2Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Benjamin Grégoire
    • 1
  • Jorge Luis Sacchini
    • 1
  1. 1.INRIA Sophia Antipolis - MéditerranéeFrance

Personalised recommendations