scientific article; zbMATH DE number 1808200

zbMATH Open1002.03014MaRDI QIDQ3149663FDOQ3149663

Authors: T. Joly 

Publication date: 30 September 2002

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cited In (12)

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

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)