We prove a general strong normalisation theorem for higher type rewrite systems based on Tait's strong computability predicates and a strictly continuous domain-theoretic semantics. The theorem applies to extensions of Godel's system T, but also to various forms of barrecursion for which strong normalisation was hitherto unknown.
['Ulrich Berger']
Continuous semantics for strong normalisation