×

zbMATH — the first resource for mathematics

A direct proof of the confluence of combinatory strong reduction. (English) Zbl 1187.68125
Summary: I give a proof of the confluence of combinatory strong reduction that does not use the one of \(\lambda \)-calculus. I also give simple and direct proofs of a standardization theorem for this reduction and the strong normalization of simply typed terms.

MSC:
68N18 Functional programming and lambda calculus
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] David, R., Une preuve simple de résultats classiques en \(\lambda\)-calcul, C. R. acad. sci. Paris, t.320, Série I, 1401-1406, (1995) · Zbl 0830.03003
[2] Curry, H.B.; Feys, R., Combinatory logic, vol. I, (1974), North Holland · Zbl 0175.27601
[3] H.B. Curry, J.R. Hindley, J.P. Seldin, Combinatory Logic, vol. II, North Holland · Zbl 0242.02029
[4] Hindley, J.R., Axioms for strong reduction in combinatory logic, Journal of symbolic logic, 32-2, 237-239, (1967) · Zbl 0153.00603
[5] Hindley, J.R.; Seldin, J.P., Introduction to combinators and \(\lambda\)-calculus, (1986), Cambridge University Press · Zbl 0614.03014
[6] Lercher, B., The decidability of hindley’s axioms for strong reduction, Journal of symbolic logic, 32-2, 224-236, (1967) · Zbl 0153.00701
[7] Minari, P., A solution to curry and hindley’s problem on combinatory strong reduction, Archive for mathematical logic, 48, 2, 159-184, (2009) · Zbl 1172.03009
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.