A short proof of Curry’s normal form theorem
HTML articles powered by AMS MathViewer
- by Roger Hindley and Bruce Lercher
- Proc. Amer. Math. Soc. 24 (1970), 808-810
- DOI: https://doi.org/10.1090/S0002-9939-1970-0255405-X
- PDF | Request permission
References
- 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 10.2307/2271660
- Bruce Lercher, The decidability of Hindley’s axioms for strong reduction, J. Symbolic Logic 32 (1967), 237–239. MR 214471, DOI 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 10.2307/1968669
Bibliographic Information
- © Copyright 1970 American Mathematical Society
- 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