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

Andreas Abel, Thorsten Altenkirch. A Predicative Strong Normalisation Proof for a lambda-Calculus with Interleaving Inductive Types. In Thierry Coquand, Peter Dybjer, Bengt Nordström, Jan M. Smith, editors, Types for Proofs and Programs, International Workshop TYPES 99, Lökeberg, Sweden, June 12-16, 1999, Selected Papers. Volume 1956 of Lecture Notes in Computer Science, pages 21-40, Springer, 1999. [doi]

Abstract

Abstract is missing.