We present a modular proof of the strong normalisation of intuitionistic logic with permutation-conversions. This proof is based on the notions of negative translation and CPS-simu...
Abstract. We investigate conditions under which con uence and or termination are preserved for constructor-sharing and hierarchical combinations of rewrite systems, one of which is...