Finite combinatory logic with intersection types
From MaRDI portal
Recommendations
Cites work
- A filter lambda model and the completeness of type assignment
- A finite set of functions with an EXPTIME-complete composition problem
- An extension of basic functionality theory for -calculus
- Finite combinatory logic with intersection types
- Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
- scientific article; zbMATH DE number 2185668 (Why is no real title available?)
- scientific article; zbMATH DE number 3811535 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- Inhabitation of Low-Rank Intersection Types
- Intersection Types as Logical Formulae
- Intersection types for combinatory logic
- Programming Languages and Systems
- Recognizability in the Simply Typed Lambda-Calculus
- Synthesis from Component Libraries
- The emptiness problem for intersection types
- The Inhabitation Problem for Rank Two Intersection Types
- The Logic of Persistent Intersection
Cited in
(10)- Combinatory logic with polymorphic types
- Finite combinatory logic with intersection types
- scientific article; zbMATH DE number 4143942 (Why is no real title available?)
- Restoration of types in reflexive combinatory logic
- scientific article; zbMATH DE number 1189067 (Why is no real title available?)
- Bounded combinatory logic
- scientific article; zbMATH DE number 1377610 (Why is no real title available?)
- Using inhabitation in bounded combinatory logic with intersection types for composition synthesis
- Taming the merge operator
- Finite combinatory logic with predicates
This page was built for publication: Finite combinatory logic with intersection types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3007665)