Continuous Semantics for Strong Normalization
نویسنده
چکیده
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.
منابع مشابه
Continuous Semantics for Termination Proofs
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.
متن کاملContinuous semantics for strong normalisation
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.
متن کاملContinuous Normalization for the Lambda-Calculus and Gödel’s T
Building on previous work by Mints, Buchholz and Schwichtenberg, a simplified version of continuous normalization for the untyped λ-calculus and Gödel’s T is presented and analyzed in the coalgebraic framework of non-wellfounded terms with so-called repetition constructors. The primitive recursive normalization function is uniformly continuous w.r.t. the natural metric on non-wellfounded terms....
متن کاملSemantics with Intersection Types ∗ Steffen
2 Approximation and normalization results 9 2.1 Approximants . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.2 Approximation result . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 2.3 Principal pairs and Semantics . . . . . . . . . . . . . . . . . . . . . . . . . . 14 2.4 Normalization results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15...
متن کاملA Semantic Normalization Proof for System T
Semantics methods have been used to prove cut elimination theorems for a long time. It is only recently that they have been extended to prove strong normalization results. For instance using the notion of super-consistency that is a semantic criterion for theories expressed in deduction modulo implying strong normalization. However, the strong normalization of System T has always been reluctant...
متن کامل