scientific article; zbMATH DE number 7204434

DOI10.4230/LIPICS.FSCD.2017.15zbMATH Open1434.03050MaRDI QIDQ5111311FDOQ5111311

Authors Andrej Dudenhefner, Jakob Rehof 

Publication date 26 May 2020

zbMATH Keywords

complexitytype theorylambda calculusinhabitationprincipal typesimple types

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatory logic and lambda calculus (03B40)

Recommendations

• scientific article; zbMATH DE number 2185726
• PRINCIPAL TYPE ASSIGNMENT TO LAMBDA TERMS
• Counting a type's (principal) inhabitants

Cites work

• scientific article; zbMATH DE number 2185726 (Why is no real title available?)
• scientific article; zbMATH DE number 5852776 (Why is no real title available?)
• scientific article; zbMATH DE number 1342274 (Why is no real title available?)
• scientific article; zbMATH DE number 5239554 (Why is no real title available?)
• Implicational relevance logic is 2-\textsc{ExpTime}-complete
• Intersection type calculi of bounded dimension
• Intuitionistic propositional logic is polynomial-space complete
• On Long Normal Inhabitants of a Type
• Staged composition synthesis
• Using inhabitation in bounded combinatory logic with intersection types for composition synthesis

Cited in

(6)

• Which simple types have a unique inhabitant?
• Counting a type's (principal) inhabitants
• Decidability of several concepts of finiteness for simple types
• A unifying framework for type inhabitation
• PRINCIPAL TYPE ASSIGNMENT TO LAMBDA TERMS
• Lower end of the linial-post spectrum

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 Q5111311)