Type reconstruction with recursive types and atomic subtyping-Reference-Cited by-同舟云学术

Type reconstruction with recursive types and atomic subtyping

Published:1993 Issue: Volume: Page:686-701
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Tiuryn Jerzy,Wand Mitchell

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-56610-4_98.pdf

Reference17 articles.

1. Roberto M. Amadio and Luca Cardelli. Subtyping Recursive Types. In Conf. Rec. 18th ACM Symposium on Principles of Programming Languages, pages 104–118, 1991.

2. Kim B. Bruce. A Paradigmatic Object-Oriented Programming Language: Design, Static Typing and Semantics. Technical Report CS-92-01, Williams College, January 1992.

3. William R. Cook, Walter L. Hill, and Peter S. Canning. Subtyping is not Inheritance. In Conf. Rec. 17th ACM Symposium on Principles of Programming Languages, pages 125–135, 1990.

4. Bruno Courcelle. Fundamental Properties of Infinite Trees. Theoretical Computer Science, 25:95–109, 1983.

5. Y.-C. Full and P. Mishra. Type Inference with Subtypes. In Proceedings European Symposium on Programming, pages 94–114, 1988.

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

1. Resolving Plural Ambiguities by Type Reconstruction;Formal Grammar;2012

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

3. Satisfying subtype inequalities in polynomial space;Theoretical Computer Science;2002-04

4. Constraint Solving on Terms;Constraints in Computational Logics;2001

5. Constraint automata and the complexity of recursive subtype entailment;Automata, Languages and Programming;1998