The logic of persistent intersection

Fundamenta Informaticae

Volumn 103, Issue 1-4, 2010, Pages 303-322

  Urzyczyn, Paweł ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ELIMINATION RULES; INTERSECTION TYPES;

COMPUTABILITY AND DECIDABILITY;

EID: 78650737996     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/FI-2010-330     Document Type: Article

References (14)

1. F. Alessi and F. Barbanera. Strong conjunction and intersection types. In A. Tarlecki, editor, MFCS, volume 520 of LNCS, pages 64-73. Springer, 1991.
2. M.W. Bunder. The inhabitation problem for intersection types. In J. Harland and P. Manyem, editors, Computing: The Australasian Theory Symposium, volume 77 of Conferences in Research and Practice in Information Technology, pages 7-14. Australian Computer Society, 2008.
3. M. Dezani-Ciancaglini, S. Ghilezan, and B. Venneri. The "relevance" of intersection and union types. Notre Dame Journal of Formal Logic, 38(2):246-269, 1997.
4. D. Kozen. Theory of Computation. Springer, 2006.
5. T. Kurata and M. Takahashi. Decidable properties of intersection type systems. In M. Dezani-Ciancaglini and G. Plotkin, editors, TLCA, volume 902 of LNCS, pages 297-311. Springer, 1995.
6. D. Kuśmierek. The inhabitation problem for rank two intersection types. In S. Ronchi Della Rocca, editor, TLCA, volume 4583 of LNCS, pages 240-254. Springer, 2007.
7. G.E. Mints. The completeness of provable realizability. Notre Dame Journal of Formal Logic, 30:420-441, 1989.
8. S. Ronchi Della Rocca and L. Roversi. Intersection logic. In L. Fribourg, editor, CSL, volume 2142 of LNCS, pages 414-428. Springer, 2001.
9. S. Salvati. Recognizability in the simply typed lambda-calculus. In H. Ono, M. Kanazawa, and R. J. G. B. de Queiroz, editors, WoLLIC, volume 5514 of LNCS, pages 48-60. Springer, 2009.
10. M.H. Sørensen and P. Urzyczyn. Lectures on the Curry-Howard Isomorphism, volume 149 of Studies in Logic and the Foundations of Mathematics. Elsevier, 2006.
11. R. Statman. Intuitionistic propositional logic is polynomial-space complete. Theoretical Computer Science, 9(1):67-72, 1979.
12. P. Urzyczyn. The emptiness problem for intersection types. Journal of Symbolic Logic, 64(3):1195-1215, 1999.
13. P. Urzyczyn. Inhabitation of low-rank intersection types. In P.-L. Curien, editor, TLCA, volume 5608 of LNCS, pages 356-370. Springer, 2009.
14. B. Venneri. Intersection types as logical formulae. Journal of Logic and Computation, 4(2):109-124, 1994.