Satisfying subtype inequalities in polynomial space

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1302 LNCS, Issue , 1997, Pages 265-277

  Frey, Alexandre ^a  

^a PSL RESEARCH UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENTIATION (CALCULUS); STATIC ANALYSIS;

LAMBDA CALCULUS; LOWER BOUNDS; POLYNOMIAL SPACE; PSPACE-COMPLETE; SIMPLE TYPES; SUBTYPINGS; TYPE INFERENCES; UPPER BOUND;

CALCULATIONS;

EID: 85008549023     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0032747     Document Type: Conference Paper

References (18)

1. Roberto M. Amadio and Luca Cardelli. Subtyping recursive types. ACM Transactions on Programming Languages and Systems, 15(4): 575-631, September 1993.
2. Marcin Benke. Efficient type reconstruction in the presence of inheritance. Technical Report TR 94-10(199), Institute of Informatics, Warsaw University, December 1994.
3. Marcin Benke. Some complexity bounds for subtype inequalities. Technical Report TR 95-20(220), Institute of Informatics, Warsaw University, 1995.
4. François Bourdoncle and Stephan Merz. Type checking higher-order polymorphic multi-methods. In Conference Record of the 24th Annual ACM Symposium on Principles of Programming Languages, pages 302-315, Paris, January 1997. ACM.
5. Franz Baader and Jörg H. Siekmann. Unification theory. In D.M. Gab-bay, C.J. Hogger, and J.A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming. Oxford University Press, Oxford, UK, 1994.
6. Bruno Courcelle. Fundamental properties of infinite trees. Theoretical Computer Science, 25: 95-169, 1983.
7. You-Chin Fuh and Prateek Mishra. Type inference with subtypes. In H. Ganzinger, editor, Proceedings of the European Symposium on Programming, volume 300 of Lecture Notes in Computer Science, pages 94-114. Springer Verlag, 1988.
8. You-Chin Fuh and Prateek Mishra. Polymorphic subtype inference: Closing the theory-practice gap. In J. Diaz and F. Orejas, editors, Proceedings of the International Joint Conference on Theory and Practice of Software Development: Vol.2, pages 167-183. LNCS 352. Springer, March 1989.
9. My Hoang and John C. Mitchell. Lower bounds on type inference with subtypes. In Conference Record of POPL '95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 176-185, San Francisco, California, January 1995.
10. D. Kozen, J. Palsberg, and M. I. Schwartzbach. Efficient recursive sub-typing. In ACM, editor, Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 419-428, Charleston, South Carolina, January 1993.
11. Robin Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17(3): 348-375, December 1978.
12. J. Mitchell. Coercion and type inference (summary). In Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, pages 175-185. ACM, ACM, January 1984.
13. Christos H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
14. Jens Palsberg and Patrick O’Keefe. A type system equivalent to flow analysis. In Conference Record of POPL '95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 367-378, San Francisco, California, January 1995.
15. Vaughan Pratt and Jerzy Tiuryn. Satisfiability of inequalities in a poset. Technical Report TR 95-15(215), Institute of Informatics, Warsaw University, 1995.
16. Jerzy Tiuryn. Subtype inequalities. In Proceedings, Seventh Annual IEEE Symposium on Logic in Computer Science, pages 308-315, Santa Cruz, California, 22-25 June 1992. IEEE Computer Society Press.
17. Valery TVifonov and Scott Smith. Subtyping constrained types. In Springer Verlag, editor, Proceedings of the Third International Symposium on Static Analysis (SAS’ 96), number 1145 in Lecture Notes in Computer Science, pages 349-365, Aachen, Germany, September 1996.
18. Jerzy Tiuryn and Mitchell Wand. Type reconstruction with recursive types and atomic subtyping. In GAAP '93: 18th Colloquium on Trees in Algebra and Programming, July 1993.