Combinatory weak reduction in lambda calculus

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.198, Iss.1, 1998-05, pp. : 239-247

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

The self-reduction in lambda calculus

By Song F.F. Xu Y. Qian Y.

Theoretical Computer Science, Vol. 235, Iss. 1, 2000-03 ,pp. : 171-181

Elsevier

Access to resources Recommend Favorite

Expressing combinatory reduction systems derivations in the rewriting calculus

By Bertolissi Clara

LISP and Symbolic Computation, Vol. 19, Iss. 4, 2006-12 ,pp. : 345-376

Springer Publishing Company

Access to resources Recommend Favorite

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

Polymorphic lambda calculus and subtyping

By Fiech

Theoretical Computer Science, Vol. 278, Iss. 1, 2002-05 ,pp. : 111-140

Elsevier

Access to resources Recommend Favorite

The differential lambda-calculus

By Ehrhard T. Regnier L.

Theoretical Computer Science, Vol. 309, Iss. 1, 2003-12 ,pp. : 1-41

Elsevier

Access to resources Recommend Favorite