scientific article; zbMATH DE number 1808200

MaRDI QIDQ3149663zbMATH OpenFDO

Authors T. Joly

Publication date 30 September 2002

zbMATH Keywords

simply typed \(\lambda\)-calculuscomplexity of a \(\lambda\)-termfinitely generated types

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• Non finitely generated types and λ-terms combinatoric representation cost
• Counting and generating lambda terms
• On some enumerative problems in lambda calculus
• scientific article; zbMATH DE number 4072354
• Statistical properties of simple types

Cited in

(12)

• BCK-combinators and linear \(\lambda\)-terms have types
• Term collections in {\(\lambda\)} and {\(\rho\)}-calculi
• Dependency Tree Automata
• Non finitely generated types and λ-terms combinatoric representation cost
• Statman's hierarchy theorem
• Finite generation and presentation problems for lambda calculus and combinatory logic
• Reducibility of types in typed lambda calculus. Comment on a paper by Richard Statman
• \(\Sigma\)-predicates of finite types over an admissible set
• scientific article; zbMATH DE number 2085249 (Why is no real title available?)
• On some enumerative problems in lambda calculus
• scientific article; zbMATH DE number 4057507 (Why is no real title available?)
• Infinite \(\lambda\)-calculus and types

This page was built for publication:

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