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

Satisfying subtype inequalities in polynomial space

Published:1997 Issue: Volume: Page:265-277
ISSN:0302-9743
Container-title:Static Analysis
language:
Short-container-title:

Author:

Frey Alexandre

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0032747

Reference18 articles.

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. Gabbay, C.J. Hogger, and J.A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming. Oxford University Press, Oxford, UK, 1994.

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

1. Type Checking Evolving Languages with MSOS;Semantics and Algebraic Specification;2009

2. Subtyping Constraints in Quasi-lattices;Lecture Notes in Computer Science;2003

3. Type Inference with Structural Subtyping: A Faithful Formalization of an Efficient Constraint Solver;Programming Languages and Systems;2003

4. Simplifying Subtyping Constraints: A Theory;Information and Computation;2001-11

5. Subtyping Functional+Nonempty Record Types;Computer Science Logic;1999