Reducibility of types in typed lambda calculus. Comment on a paper by Richard Statman

DOI10.1016/0890-5401(88)90054-5zbMath0647.03008OpenAlexW2074282135MaRDI QIDQ1104311

Wil Dekkers

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

zbMATH Keywords

typeslambda calculuswell order

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

This page was built for publication: Reducibility of types in typed lambda calculus. Comment on a paper by Richard Statman