Hostname: page-component-6bf8c574d5-zc66z Total loading time: 0 Render date: 2025-03-09T16:37:38.657Z Has data issue: false hasContentIssue false
  • English
  • Français

Continuous semantics for strong normalisation

Published online by Cambridge University Press:  11 October 2006

ULRICH BERGER
ULRICH BERGER
Affiliation:
Department of Computer Science, University of Wales Swansea, Swansea, SA2 8PP, U.K. Email: u.berger@swan.ac.uk
Get access Rights & Permissions [Opens in a new window]

Abstract

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 Gödel's system T, but also to various forms of barrecursion for which strong normalisation was hitherto unknown.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 16 , Issue 5 , October 2006 , pp. 751 - 762
Copyright
2006 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)