Reducibility of types in typed lambda calculus. Comment on a paper by Richard Statman
From MaRDI portal
Publication:1104311
DOI10.1016/0890-5401(88)90054-5zbMath0647.03008MaRDI QIDQ1104311
Publication date: 1988
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(88)90054-5
03B40: Combinatory logic and lambda calculus