Finite combinatory logic with predicates

DOI10.4230/LIPICS.TYPES.2023.2MaRDI QIDQ6865662zbMATH OpenFDO

Authors Andrej Dudenhefner, Christoph Stahl, Constantin Chaumet, Felix Laarmann, Jakob Rehof

Publication date 30 January 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.TYPES.2023.2

zbMATH Keywords

combinatory logicinhabitationintersection typesprogram synthesis

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites work

• A filter lambda model and the completeness of type assignment
• Bottom-Up Tree Automata with Term Constraints
• Bounded combinatory logic
• Finite combinatory logic with intersection types
• Ground reducibility is EXPTIME-complete
• scientific article; zbMATH DE number 1330134 (Why is no real title available?)
• scientific article; zbMATH DE number 6744146 (Why is no real title available?)
• Intersection types for combinatory logic
• Introduction to generalized type systems
• On the power of magic
• Pumping, cleaning and symbolic constraints solving
• Restricting tree grammars with term rewriting
• The Semantics of Predicate Logic as a Programming Language

This page was built for publication: Finite combinatory logic with predicates

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