Bounded combinatory logic

DOI10.4230/LIPICS.CSL.2012.243zbMATH Open1252.03029OpenAlexW2288082802MaRDI QIDQ4649550FDOQ4649550

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

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

zbMATH Keywords

inhabitationintersection typescomposition synthesis

Mathematics Subject Classification ID

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

Cited In (11)

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

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)