Intersection types for combinatory logic
Theoretical Computer Science
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The simple semantics for Coppe-Dezani-Sallé types
Proceedings of the 5th Colloquium on International Symposium on Programming
Decidable Properties of Intersection Type Systems
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
A finite set of functions with an EXPTIME-complete composition problem
Theoretical Computer Science
Synthesis from Component Libraries
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Recognizability in the Simply Typed Lambda-Calculus
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Inhabitation of Low-Rank Intersection Types
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
The inhabitation problem for rank two intersection types
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
The Logic of Persistent Intersection
Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
A type system equivalent to a model checker
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Graph-based proof counting and enumeration with applications for program fragment synthesis
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
The complexity of inhabitation with explicit intersection
Logic and Program Semantics
| Hi-index | 0.00 |
Combinatory logic is based on modus ponens and a schematic (polymorphic) interpretation of axioms. In this paper we propose to consider expressive combinatory logics under the restriction that axioms are not interpreted schematically but "literally", corresponding to a monomorphic interpretation of types. We thereby arrive at finite combinatory logic, which is strictly finitely axiomatisable and based solely on modus ponens. We show that the provability (inhabitation) problem for finite combinatory logic with intersection types is Exptime-complete with or without subtyping. This result contrasts with the general case, where inhabitation is known to be Expspace-complete in rank 2 and undecidable for rank 3 and up. As a by-product of the considerations in the presence of subtyping, we show that standard intersection type subtyping is in Ptime. From an application standpoint, we can consider intersection types as an expressive specification formalism for which our results show that functional composition synthesis can be automated.