Similar Items: Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus
- Strong normalisation for applied lambda calculi
- Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories
- Non-idempotent intersection types and strong normalisation
- The language of Stratified Sets is confluent and strongly normalising
- The Safe Lambda Calculus
- A proof of strong normalisation using domain theory