A CUCH-machine: The automatic treatment of bound variables. (English) Zbl 0277.68026


68Q25 Analysis of algorithms and problem complexity
03B40 Combinatory logic and lambda calculus


Full Text: DOI


[1] G. Ausiello, ?Automatic reduction of CUCH expressions by means of the value method,?Atti del I Congresso Nazionale dell’AICA, Napoli 26?29 settembre 1968 (Rome, 1971), pp. 174?184.
[2] C. Böhm and W. Gross, ?Introduction to the CUCH,? inAutomata Theory, ed. by E. R. Caianiello (Academic Press, New York, 1966), pp. 35?65.
[3] C. Böhm, ?The CUCH as a formal and description language,? inFormal Languages Description Languages for Computer Programming,? ed. by T. B. Steel, Jr. (North-Holland, Amsterdam, 1966), pp. 179?197.
[4] A. Church, ?The calculi of lambda-conversion,? Ann. Math. Stud. No. 6, Princeton University Press, 1941. · JFM 67.0041.01
[5] J. B. Curry and R. Feys,Combinatory Logic, Vol. 1 (North-Holland, Amsterdam, 1958). · Zbl 0081.24104
[6] S. Ginsburg, Sheila A. Greibach, and Michael A. Harrison, ?One-way stack automata,?ACM,14(2): 389?418 (1967). · Zbl 0171.14803
[7] P. Landin, ?A correspondence between ALGOL 60 and Church’s lambda notation,?Comm. ACM (February/March 1965). · Zbl 0134.33403
[8] D. Scott, ?Outline of a mathematical theory of computation,? Oxford University Computing Laboratory Programming Research Group (1970).
[9] C. Strachey, ?Towards a formal semantics,? inFormal Languages Description Languages, for Computer Programming, ed. by T. B. Steel, Jr. (North-Holland, Amsterdam, 1966), pp. 198?216.
[10] P. Wegner,Programming Languages, Information Structures and Machine Organisation (McGraw-Hill, New York, 1968).
[11] C. McGowan, ?The correctness of a modified SECD machine,? 2nd Annual ACM Symposium on the Theory of Computation, 1970, North Hampton, pp. 149?157.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.