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

Author： Barthe G. Hatcliff J. Sorensen M.H.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.269, Iss.1, 2001-10, pp. : 317-361

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Strong Normalization from Weak Normalization by Translation into the Lambda-I-Calculus

By Gørtz I.L.

LISP and Symbolic Computation, Vol. 16, Iss. 3, 2003-09 ,pp. : 253-285

Springer Publishing Company

Access to resources Recommend Favorite

Normalization of non-standard words

By Sproat R. Black A.W. Chen S. Kumar S. Ostendorf M. Richards C.

Computer Speech & Language, Vol. 15, Iss. 3, 2001-07 ,pp. : 287-333

Academic Press

Access to resources Recommend Favorite

Some characteristics of strong innermost normalization

By Krishna Rao

Theoretical Computer Science, Vol. 239, Iss. 1, 2000-05 ,pp. : 141-164

Elsevier

Access to resources Recommend Favorite

Explicit substitution On the edge of strong normalization

By Bloo R. Geuvers H.

Theoretical Computer Science, Vol. 211, Iss. 1, 1999-01 ,pp. : 375-395

Elsevier

Access to resources Recommend Favorite

Normalization, approximation, and semantics for combinator systems

By van Bakel S. Fernandez M.

Theoretical Computer Science, Vol. 290, Iss. 1, 2003-01 ,pp. : 975-1019

Elsevier

Access to resources Recommend Favorite