Satisfying subtype inequalities in polynomial space-Reference-Cited by-同舟云学术

Satisfying subtype inequalities in polynomial space

Published:2002-04 Issue:1-2 Volume:277 Page:105-117
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Frey Alexandre

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference18 articles.

1. Subtyping recursive types;Amadio;ACM Trans. Programming Languages Systems,1993

2. F. Baader, J.H. Siekmann, Unification theory, in: D.M. Gabbay, C.J. Hogger, J.A. Robinson (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press, Oxford, UK, 1994.

3. M. Benke, Efficient type reconstruction in the presence of inheritance, Technical Report TR 94-10(199), Institute of Informatics, Warsaw University, December 1994.

4. M. Benke, Some complexity bounds for subtype inequalities, Technical Report TR 95-20(220), Institute of Informatics, Warsaw University, 1995.

5. F. Bourdoncle, S. Merz, Type checking higher-order polymorphic multi-methods, Conf. Rec. 24th Annu. ACM Symp. on Principles of Programming Languages, ACM, Paris, January 1997, pp. 302–315.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Consistency and Complexity of Multiplicative Additive System Virtual;Scientific Annals of Computer Science;2015

2. Intersection Type Matching with Subtyping;Lecture Notes in Computer Science;2013

3. Extending Hindley-Milner Type Inference with Coercive Structural Subtyping;Programming Languages and Systems;2011

4. Complexity of Subtype Satisfiability over Posets;Programming Languages and Systems;2005

5. Structural subtyping of non-recursive types is decidable;18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.