Similar Items: A proof of strong normalisation using domain theory
- Strong normalisation for applied lambda calculi
- Non-idempotent intersection types and strong normalisation
- The language of Stratified Sets is confluent and strongly normalising
- Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi
- Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus
- Reduction Free Normalisation for a proof irrelevant type of propositions