Skip to main content
Log in

Notes on “A CUCH-machine: The automatic treatment of bound variables”

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

The method described in Ref. 1 does not always correctly establish the bonds between the variables. In fact, during the reduction to normal form of the λ-formula ((ty)(λyy)) and of all those in which the same variable that is free in the left subformula of an application occurs bound in the right subformula, this variable is wrongly considered as bound. To prevent this, it is necessary to modify the levels assigned to the formulas in the β-generation. We therefore give the correct β-generation statements and the correct algorithm of the β-generation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Reference

  1. C. Böhm and M. Dezani, “A CUCH-machine: The automatic treatment of bound variables,”Int. J. Computer Inf. Sci. 1(2):171–191 (1972).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

See Ref. 1.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Böhm, C., Dezani, M. Notes on “A CUCH-machine: The automatic treatment of bound variables”. International Journal of Computer and Information Sciences 2, 157–160 (1973). https://doi.org/10.1007/BF00976061

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00976061

Keywords

Navigation