Continuous semantics for strong normalization

Authors:
Ulrich Berger
Affiliations:
Department of Computer Science, University of Wales Swansea, Swansea, UK
Venue:
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Year:
2005

Citing 5
Cited 2

Lambda calculi with types

Handbook of logic in computer science (vol. 2)
Strict Functionals for Termination Proofs

TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
The Calculus of algebraic Constructions

RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Monotone Inductive and Coinductive Constructors of Rank 2

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
A Computational Interpretation of Open Induction

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science

Constructive mathematics and functional programming

ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
An abstract strong normalization theorem

CSL'05 Proceedings of the 19th international conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.