Abstract
A notion of dimension in intersection typed λ-calculi is presented. The dimension of a typed λ-term is given by the minimal norm of an elaboration (a proof theoretic decoration) necessary for typing the term at its type, and, intuitively, measures intersection introduction as a resource.
Bounded-dimensional intersection type calculi are shown to enjoy subject reduction, since terms can be elaborated in non-increasing norm under β-reduction. We prove that a multiset interpretation (corresponding to a non-idempotent and non-linear interpretation of intersection) of dimensionality corresponds to the number of simultaneous constraints required during search for inhabitants. As a consequence, the inhabitation problem is decidable in bounded multiset dimension, and it is proven to be EXPSPACE-complete. This result is a substantial generalization of inhabitation for the rank 2-fragment, yielding a calculus with decidable inhabitation which is independent of rank.
Our results give rise to a new criterion (dimensional bound) for subclasses of intersection type calculi with a decidable inhabitation problem, which is orthogonal to previously known criteria, and which should have immediate applications in synthesis. Additionally, we give examples of dimensional analysis of fragments of the intersection type system, including conservativity over simple types, rank 2-types, and normal form typings, and we provide some observations towards dimensional analysis of other systems. It is suggested (for future work) that our notion of dimension may have semantic interpretations in terms of of reduction complexity.
- H. P. Barendregt. The Lambda Calculus. Its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics, 2nd Edition. Elsevier Science Publishers, 1984.Google Scholar
- H. P. Barendregt, M. Coppo, and M. Dezani-Ciancaglini. A Filter Lambda Model and the Completeness of Type Assignment. Journal of Symbolic Logic, 48(4):931–940, 1983.Google Scholar
Cross Ref
- H. P. Barendregt, W. Dekkers, and R. Statman. Lambda Calculus with Types. Perspectives in Logic, Cambridge University Press, 2013. ISBN 978-0-521-76614-2. Google Scholar
Cross Ref
- A. Bernadet and S. Graham-Lengrand. Non-Idempotent Intersection Types and Strong Normalization. Logical Methods in Computer Science, 9(4:3):1 – 46, 2013.Google Scholar
- A. Bucciareli, D. Kesner, and S. Ronchi Della Rocca. The inhabitation problem for non-idempotent intersection types. In TCS 2014, Proceedings of 8th IFIP TC 1 /WG 2.2 International Conference on Theoretical Computer Science, Rome, Italy, September 1-3, 2014. Springer, 2014.Google Scholar
- M. W. Bunder. The inhabitation problem for intersection types. J. Harland and P. Manyem, editors, Computing: The Australasian Theory Symposium, volume 77 of Conferences in Research and Practice in Information Technology, Australian Computer Society, pages 7 – 14, 2008. Google Scholar
Digital Library
- A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114–133, 1981. Google Scholar
Digital Library
- M. Coppo and P. Giannini. Principal types and unification for a simple intersection type system. Information and Computation, 122 (1):70–96, 1995. Google Scholar
Digital Library
- M. Coppo, M. Dezani-Ciancaglini, and B. Venneri. Principal Type Schemes and Lambda-Calculus Semantics, pages 480–490. Accademic Press, London, 1980. Ed.: R. Hindley and J. Seldin.Google Scholar
- M. Coppo, M. Dezani-Ciancaglini, and B. Venneri. Functional Characters of Solvable Terms. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, pages 45–58, 1981.Google Scholar
- E. De Benedetti and S. Ronchi Della Rocca. Call-by-value, elementary time and intersection types. In FOPARA 2015, Foundational and Practical Aspects of Resource Analysis - 4th International Workshop, London, UK, April 11 2015, Revised Selected Papers, pages 40–59. Springer LNCS 9964, 2016.Google Scholar
- E. De Benedetti and S. Ronchi Della Rocca. A type assignment for λ-calculus complete both for FPTIME and strong normalization. Information and Computation, 248:195–214, 2016. Google Scholar
Digital Library
- Google Scholar
- D. de Carvalho. Execution time of lambda-terms via denotational semantics and intersection types. CoRR, abs /0905.4251, 2009.Google Scholar
- B. Düdder, M. Martens, J. Rehof, and P. Urzyczyn. Bounded Combinatory Logic. In CSL 2012, Proceedings of Computer Science Logic, volume 16 of LIPIcs, pages 243–258. Schloss Dagstuhl, 2012.Google Scholar
Digital Library
- B. Düdder, M. Martens, and J. Rehof. Staged Composition Synthesis. In ESOP 2014, Proceedings of European Symposium on Programming, Grenoble, France 2014, volume 8410 of LNCS, pages 67–86. Springer, 2014. Google Scholar
- A. Dudenhefner and J. Rehof. Intersection Type Calculi of Bounded Dimension (Extended Version). Technical Report 857, Faculty of Computer Science (TU Dortmund), 2016. http://www-seal.cs.tu-dortmund.de/seal/downloads/ research/cls/TR857-DIM.pdf.Google Scholar
Digital Library
- J. Frankle, P. Osera, D. Walker, and S. Zdancewic. Example-directed synthesis: a type-theoretic interpretation. In POPL 2016, Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, St. Petersburg, FL, USA, January 20 - 22, 2016, pages 802–815, 2016. Google Scholar
Cross Ref
- P. Giannini and S. Ronchi Della Rocca. Characterization of typings in polymorphic type discipline. In LICS 1988, Proceedings of the Third Annual Symposium on Logic in Computer Science, Edinburgh, Scotland, UK, July 5-8, 1988, pages 61–70, 1988.Google Scholar
Digital Library
- J. R. Hindley. Basic Simple Type Theory. Cambridge Tracts in Theoretical Computer Science, vol. 42, Cambridge University Press, 2008. Google Scholar
Digital Library
- H. Hüttel, I. Lanese, V. T. Vasconcelos, L. Caires, M. Carbone, P.-M. Deniélou, D. Mostrous, L. Padovani, A. Ravara, E. Tuosto, H. T. Vieira, and G. Zavattaro. Foundations of session types and behavioural contracts. ACM Computing Surveys, 49(1):3:1–3:36, Apr. 2016. Google Scholar
Digital Library
- A. J. Kfoury and J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In POPL 1999, Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Antonio, TX, USA, January 20-22, 1999, pages 161–174, 1999. Google Scholar
Digital Library
- T. Kurata and M. Takahashi. Decidable properties of intersection type systems. In TLCA 1995, Proceedings of Typed Lambda Calculus and Applications, volume 902 of LNCS, pages 297–311. Springer, 1995. Google Scholar
Digital Library
- Google Scholar
Digital Library
- D. Kuśmierek. The Inhabitation Problem for Rank Two Intersection Types. In TLCA 2007, Proceedings of Typed Lambda Calculus and Applications, volume 4583 of LNCS, pages 240–254. Springer, 2007. Google Scholar
Cross Ref
- D. Leivant. Polymorphic Type Inference. In POPL 1983, Proceedings of the 10th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 88–98. ACM, 1983. Google Scholar
- Google Scholar
Digital Library
- R. Loader. The undecidability of lambda definability. Logic, Meaning and Computation: Essays in Memory of Alonzo Church, pages 331– 342, 2001.Google Scholar
Digital Library
- G. Plotkin. Lambda definability and logical relations. Technical Report Memorandum SAI-RM-4, School of Artificial Intelligence, University of Edinburgh, 1973.Google Scholar
Digital Library
- J. Rehof and P. Urzyczyn. Finite Combinatory Logic with Intersection Types. In TLCA 2011, Proceedings of Typed Lambda Calculus and Applications, volume 6690 of LNCS, pages 169–183. Springer, 2011. Google Scholar
Digital Library
- J. Rehof and P. Urzyczyn. The Complexity of Inhabitation with Explicit Intersection. In R. L. Constable and A. Silva, editors, Logic and Program Semantics - Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday, volume 7230 of LNCS, pages 256–270. Springer, 2012. Google Scholar
- S. Salvati. Recognizability in the Simply Typed Lambda-Calculus. In H. Ono, M. Kanazawa, and R. J. G. B. de Queiroz, editors, WoLLIC 2009, Proceedings of Workshop on Logic, Language, Information and Computation, volume 5514 of LNCS, pages 48–60. Springer, 2009. Google Scholar
Cross Ref
- S. Salvati, G. Manzonetto, M. Gehrke, and H. P. Barendregt. Urzyczyn and Loader are logically related. In ICALP 2012, Proceedings of Automata, Languages, and Programming - 39th International Colloquium, Warwick, UK, July 9-13, 2012, volume 7392 of LNCS, pages 364–376. Springer, 2012. Google Scholar
Digital Library
- R. Statman. Intuitionistic Propositional Logic Is Polynomial-space Complete. Theoretical Computer Science, 9:67–72, 1979.Google Scholar
Digital Library
- P. Urzyczyn. The Emptiness Problem for Intersection Types. Journal of Symbolic Logic, 64(3):1195–1215, 1999.Google Scholar
Digital Library
- P. Urzyczyn. Inhabitation of Low-Rank Intersection Types. In TLCA 2009, Proceedings of Typed Lambda Calculus and Applications, volume 5608 of LNCS, pages 356–370. Springer, 2009. Google Scholar
Digital Library
- Google Scholar
- S. van Bakel. Complete Restrictions of the Intersection Type Discipline. Theoretical Computer Science, 102:135 – 163, 1992. Google Scholar
- Google Scholar
- S. van Bakel. Intersection Type Assignment Systems. Theoretical Computer Science, 151(2):385 – 435, 1995. Google Scholar
- S. van Bakel. Strict Intersection Types for the Lambda Calculus. ACM Computing Surveys, 43(3), 2011. Google Scholar
Index Terms
Intersection type calculi of bounded dimension
Recommendations
Principality and approximation under dimensional bound
We develop an algebraic and algorithmic theory of principality for the recently introduced framework of intersection type calculi with dimensional bound. The theory enables inference of principal type information under dimensional bound, it provides an ...
Intersection type calculi of bounded dimension
POPL '17: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming LanguagesA notion of dimension in intersection typed λ-calculi is presented. The dimension of a typed λ-term is given by the minimal norm of an elaboration (a proof theoretic decoration) necessary for typing the term at its type, and, intuitively, measures ...
On strong normalization and type inference in the intersection type discipline
We introduce a new unification procedure for the type inference problem in the intersection type discipline. It is well known that type inference in this case should succeed exactly for the strongly normalizing expressions. We give a proof for the ...







Comments