Weak normalization implies strong normalization in a class of non-dependent pure type systems

@article{Barthe2001WeakNI,
  title={Weak normalization implies strong normalization in a class of non-dependent pure type systems},
  author={Gilles Barthe and John Hatcliff and M S{\o}rensen},
  journal={Theor. Comput. Sci.},
  year={2001},
  volume={269},
  pages={317-361}
}
  • Gilles Barthe, John Hatcliff, M Sørensen
  • Published 2001
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • Abstract The Barendregt–Geuvers–Klop conjecture states that every weakly normalizing pure type system is also strongly normalizing. We show that this is true for a uniform class of systems which includes, e.g., the left-hand side of Barendregt's λ -cube as well as the system λU . This seems to be the first result giving a positive answer to the conjecture not merely for some concrete systems for which strong normalization is known to hold, but for a uniform class of systems in which not all… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 10 CITATIONS

    A partial translation from λU to λ2

    VIEW 5 EXCERPTS
    CITES BACKGROUND & RESULTS
    HIGHLY INFLUENCED

    Verification of redecoration for infinite triangular matrices using coinduction

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    Monadic translation of classical sequent calculus

    VIEW 1 EXCERPT
    CITES BACKGROUND

    The semantic analysis of advanced programming languages

    VIEW 1 EXCERPT
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 24 REFERENCES

    Strong Normalization from Weak Normalization in Typed -calculi

    • Morten Heine Ssrensen, Nederpelt, +4 authors Wells However
    • 1997
    VIEW 2 EXCERPTS

    On weak and strong normalisations

    VIEW 2 EXCERPTS

    A - Translation and Looping Combinators in Pure Type Systems

    VIEW 16 EXCERPTS
    HIGHLY INFLUENTIAL

    The Conservation Theorem revisited

    VIEW 2 EXCERPTS

    Extensions of Pure Type Systems

    VIEW 2 EXCERPTS

    "Delayability" in Proofs of Strong Normalizability in the Typed Lambda Calculus

    VIEW 2 EXCERPTS

    New notions of reduction and non-semantic proofs of strong /spl beta/-normalization in typed /spl lambda/-calculi

    VIEW 2 EXCERPTS