Abstract
It is shown that the inhabitation problem for intersection types without the intersection introduction rule is Expspace-complete and that the further restriction without subtyping is Pspace-complete.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barendregt, H., Coppo, M., Dezani-Ciancaglini, M.: A filter lambda model and the completeness of type assignment. Journal of Symbolic Logic 48(4), 931–940 (1983)
Barendregt, H., Abramsky, S., Gabbay, D.M., Maibaum, T.S.E., Barendregt, H.P.: Lambda calculi with types. In: Handbook of Logic in Computer Science, pp. 117–309. Oxford University Press (1992)
Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. Journal of the ACM 28(1), 114–133 (1981)
Coppo, M., Dezani-Ciancaglini, M.: An extension of basic functionality theory for lambda-calculus. Notre Dame Journal of Formal Logic 21, 685–693 (1980)
Dezani-Ciancaglini, M., Hindley, R.: Intersection types for combinatory logic. Theoretical Computer Science 100(2), 303–324 (1992)
Hindley, J.R.: The Simple Semantics for Coppo-Dezani-Sallé Types. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) International Symposium on Programming 1982. LNCS, vol. 137, pp. 212–226. Springer, Heidelberg (1982)
Kurata, T., Takahashi, M.: Decidable Properties of Intersection Type Systems. In: Dezani-Ciancaglini, M., Plotkin, G. (eds.) TLCA 1995. LNCS, vol. 902, pp. 297–311. Springer, Heidelberg (1995)
Kuśmierek, D.: The Inhabitation Problem for Rank Two Intersection Types. In: Ronchi Della Rocca, S. (ed.) TLCA 2007. LNCS, vol. 4583, pp. 240–254. Springer, Heidelberg (2007)
Leivant, D.: Polymorphic type inference. In: Proc. 10th ACM Symp. on Principles of Programming Languages, pp. 88–98. ACM (January 1983)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)
Pottinger, G.: A type assignment for the strongly normalizable lambda-terms. In: Hindley, J., Seldin, J. (eds.) To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp. 561–577. Academic Press (1980)
Rehof, J., Urzyczyn, P.: Finite Combinatory Logic with Intersection Types. In: Ong, L. (ed.) TLCA 2011. LNCS, vol. 6690, pp. 169–183. Springer, Heidelberg (2011)
Salvati, S.: Recognizability in the Simply Typed Lambda-Calculus. In: Ono, H., Kanazawa, M., de Queiroz, R. (eds.) WoLLIC 2009. LNCS, vol. 5514, pp. 48–60. Springer, Heidelberg (2009)
Statman, R.: Intuitionistic propositional logic is polynomial-space complete. Theoretical Computer Science 9, 67–72 (1979)
Urzyczyn, P.: Inhabitation in Typed Lambda-Calculi (a Syntactic Approach). In: de Groote, P., Hindley, J.R. (eds.) TLCA 1997. LNCS, vol. 1210, pp. 373–389. Springer, Heidelberg (1997)
Urzyczyn, P.: The emptiness problem for intersection types. Journal of Symbolic Logic 64(3), 1195–1215 (1999)
Urzyczyn, P.: Inhabitation of Low-Rank Intersection Types. In: Curien, P.-L. (ed.) TLCA 2009. LNCS, vol. 5608, pp. 356–370. Springer, Heidelberg (2009)
Urzyczyn, P.: The logic of persistent intersection. Fundamenta Informaticae 103, 303–322 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Rehof, J., Urzyczyn, P. (2012). The Complexity of Inhabitation with Explicit Intersection. In: Constable, R.L., Silva, A. (eds) Logic and Program Semantics. Lecture Notes in Computer Science, vol 7230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29485-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-29485-3_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29484-6
Online ISBN: 978-3-642-29485-3
eBook Packages: Computer ScienceComputer Science (R0)