A short proof of Curry’s normal form theorem
Authors:
Roger Hindley and Bruce Lercher
Journal:
Proc. Amer. Math. Soc. 24 (1970), 808-810
MSC:
Primary 02.85
DOI:
https://doi.org/10.1090/S0002-9939-1970-0255405-X
MathSciNet review:
0255405
Full-text PDF Free Access
References | Similar Articles | Additional Information
- Haskell B. Curry and Robert Feys, Combinatory logic. Vol. I, Studies in logic and the foundations of mathematics, North-Holland Publishing Co., Amsterdam, 1958. MR 0094298 H. B. Curry, Combinatory logic. Vol. 2, with the collaboration of R. Hindley and J. P. Seldin (in preparation).
- Roger Hindley, Axioms for strong reduction in combinatory logic, J. Symbolic Logic 32 (1967), 224–236. MR 214470, DOI https://doi.org/10.2307/2271660
- Bruce Lercher, The decidability of Hindley’s axioms for strong reduction, J. Symbolic Logic 32 (1967), 237–239. MR 214471, DOI https://doi.org/10.2307/2271661
- J. B. Rosser, A mathematical logic without variables. I, Ann. of Math. (2) 36 (1935), no. 1, 127–150. MR 1503213, DOI https://doi.org/10.2307/1968669
Retrieve articles in Proceedings of the American Mathematical Society with MSC: 02.85
Retrieve articles in all journals with MSC: 02.85
Additional Information
Article copyright:
© Copyright 1970
American Mathematical Society