Bounded combinatory logic

DOI10.4230/LIPICS.CSL.2012.243MaRDI QIDQ4649550zbMATH OpenOpenAlexFDO

Authors Boris Düdder, Moritz Martens, Jakob Rehof, Paweł Urzyczyn

Publication date 22 November 2012

Full work available at URL https://doi.org/10.4230/lipics.csl.2012.243

zbMATH Keywords

composition synthesisinhabitationintersection types

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Finite combinatory logic with intersection types
• Using inhabitation in bounded combinatory logic with intersection types for composition synthesis
• Bounded combinatory logic and lower complexity
• Typability in bounded dimension
• Intersection type calculi of bounded dimension

Cited in

(12)

• The untyped computational \(\lambda \)-calculus and its intersection type discipline
• Extracting \(\mathsf{BB'IW}\) inhabitants of simple types from proofs in the sequent calculus \(LT_\to^t\) for implicational ticket entailment
• Restricted combinatory unification
• Bounded combinatory logic and lower complexity
• Finite combinatory logic with intersection types
• A basis result in combinatory logic
• scientific article; zbMATH DE number 1337623 (Why is no real title available?)
• Compact bracket abstraction in combinatory logic
• Using inhabitation in bounded combinatory logic with intersection types for composition synthesis
• Lower end of the linial-post spectrum
• Finite combinatory logic with predicates
• Bounded nondeterminism of logic programs

This page was built for publication: Bounded combinatory logic

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