H. Xi. Upper bounds for standardization and an application. To appear in the Journal of Symbolic Logic. An earlier version appeared in the Proceedings of the 5th Kurt Godel Colloquium, volume 1289 of Lecture Notes in Computer Science, pages 335--348, Springer-Verlag, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Perpetual Reductions in λ-Calculus - van Raamsdonk, Severi.. (1999) (6 citations) (Correct)
....in terms of the bounds for P and Q. This technique uses implicitly a version of the fundamental lemma of maximality see the proof of the main lemma [63, p.407] Springintveld [71] applies the technique to the dependent system P and to the weak version of higher order typed calculus. Xi [85] gives a proof of the standardization theorem which provides an upper bound on the length of the standard reduction path obtained from any given reduction path, and Xi uses this to provide upper bounds for the length of reduction paths in simply typed calculus. Van Daalen proves strong ....
H. Xi. Upper bounds for standardization and an application. To appear in the Journal of Symbolic Logic. An earlier version appeared in the Proceedings of the 5th Kurt Godel Colloquium, volume 1289 of Lecture Notes in Computer Science, pages 335--348, Springer-Verlag, 1997.
Normalization in λ-Calculus and Type Theory - Sørensen (1997) (Correct)
....in terms of the bounds for P and Q. This technique uses implicitly a version of the fundamental lemma of maximality see the proof of the main lemma [115, p.407] Springintveld [123] applies the technique to the dependent system P and to the weak version of higher order typed calculus. Xi [143] gives a proof of the standardization theorem which provides an upper bound on the length of the standard reduction path obtained from any given reduction path, and Xi uses this to provide upper bounds for the length of reduction paths in simply typed calculus. Van Daalen proves strong ....
H. Xi. Upper bounds for standardization and an application. To appear in the Journal of Symbolic Logic. An earlier version appeared in the Proceedings of the 5th Kurt Godel Colloquium, volume 1289 of Lecture Notes in Computer Science, pages 335--348, Springer-Verlag, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC