Statman's hierarchy theorem

DOI10.23638/LMCS-13(4:19)2017MaRDI QIDQ4596793zbMATH OpenFDO

Authors Bram Westerbaan, Bas Westerbaan, Rutger Kuyper, Carst Tankink, Remy Viehoff, Henk Barendregt

Publication date 11 December 2017

Full work available at URL https://arxiv.org/abs/1711.05497

zbMATH Keywords

simply typed lambda calculushead reducibility

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Reducibility of types in typed lambda calculus. Comment on a paper by Richard Statman
• A simple proof of a theorem of Statman
• Statistical properties of simple types
• scientific article; zbMATH DE number 1808200
• scientific article; zbMATH DE number 7029315

Cited in

(3)

• scientific article; zbMATH DE number 1959621 (Why is no real title available?)
• Reducibility of types in typed lambda calculus. Comment on a paper by Richard Statman
• A simple proof of a theorem of Statman

This page was built for publication: Statman's hierarchy theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596793)