Why the usual candidates of reducibility do not work for the symmetric λμ-calculus

7Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

Abstract

The symmetric λμ-calculus is the λμ-calculus introduced by Parigot in which the reduction rule μ′, which is the symmetric of μ, is added. We give examples explaining why the technique using the usual candidates of reducibility does not work. We also prove a standardization theorem for this calculus. © 2005 Elsevier B.V. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

David, R., & Nour, K. (2005). Why the usual candidates of reducibility do not work for the symmetric λμ-calculus. In Electronic Notes in Theoretical Computer Science (Vol. 140, pp. 101–111). https://doi.org/10.1016/j.entcs.2005.06.020

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free