Continuous semantics for strong normalisation

  title={Continuous semantics for strong normalisation},
  author={Ulrich Berger},
  journal={Mathematical Structures in Computer Science},
We prove a general strong normalization 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 Gödel’s system T , but also to various forms of bar recursion for which strong normalization was hitherto unknown. 

From This Paper

Topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 22 references

Mathematical theory of domains

  • V. Stoltenberg-Hansen, E. Griffor, I. Lindström
  • 1993
2 Excerpts

Similar Papers

Loading similar papers…