A Proof of Weak Termination of Typed lambda-sigma-Calculi

Jean Goubault-Larrecq. A Proof of Weak Termination of Typed lambda-sigma-Calculi. In Eduardo Giménez, Christine Paulin-Mohring, editors, Types for Proofs and Programs, International Workshop TYPES 96, Aussois, France, December 15-19, 1996, Selected Papers. Volume 1512 of Lecture Notes in Computer Science, pages 134-153, Springer, 1996.

Abstract

Abstract is missing.