A Predicative Strong Normalisation Proof for a lambda-Calculus with Interleaving Inductive Types

  • Authors:

  • Andreas Abel;Thorsten Altenkirch

  • Affiliations:

  • -;-

  • Venue:
  • TYPES '99 Selected papers from the International Workshop on Types for Proofs and Programs
  • Year:
  • 1999

  • Least and Greatest Fixpoints in Game Semantics

    FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009

  • Fair reactive programming

    Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a new strong normalisation proof for a λ-calculus with interleaving strictly positive inductive types λµ which avoids the use of impredicative reasoning, i.e., the theorem of Knaster-Tarski. Instead it only uses predicative, i.e., strictly positive inductive definitions on the metalevel. To achieve this we show that every strictly positive operator on types gives rise to an operator on saturated sets which is not only monotone but also (deterministically) set based - a concept introduced by Peter Aczel in the context of intuitionistic set theory. We also extend this to coinductive types using greatest fixpoints of strictly monotone operators on the metalevel.