Abstract
The complexity of type reconstruction for simply-typed lambda calculus with subtype relation resulting from single inheritance (i.e. being a disjoint union of tree-like posets) is analyzed. As a result a class of posets including (but not restricted to) trees is defined, for which the said problem is solvable in polynomial time.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Kim Bruce and John C. Mitchell. Per models of subtyping, recursive types and higher-order polymorphism. In Conf. Rec. ACM Symp. Principles of Programming Languages, 1992.
Dexter Kozen, Jens Palsberg, and Michael I. Schwartzbach. Efficient inference of partial types. Technical Report DAIMI PB-394, Computer science Dept., Aarhus University, April 1992.
Patrick Lincoln and John C. Mitchell. Algorithmic aspects of type inference with subtypes. In Conf. Rec. ACM Symp. Principles of Programming Languages, pages 293–304, 1992.
John C. Mitchell. Coercion and type inference. In Conf. Rec. ACM Symp. Principles of Programming Languages, pages 175–185, 1984.
P. Nevermann and I. Rival. Holes in ordered sets. Graphs and Combinatorics, (1):339–350, 1985.
Benjamin C. Pierce and David N. Turner. Object-oriented programming without recursive types. Technical Report ECS-LFCS-92-225, LFCS, University of Edinburgh, August 1992.
Jerzy Tiuryn. Subtype inequalities. In Proc. 7th IEEE Symp. Logic in Computer Science, pages 308–315, 1992.
Jerzy Tiuryn and Mitchell Wand. Type reconstruction with recursive types and atomic subtyping. In M.-C. Gaudel and J.-P. Jouannaud, editors, TAPSOFT'93: Theory and Practice of Software Development, LNCS 668, pages 686–701, 1993.
M. Wand and Patrick O'Keefe. On the complexity of type inference with coercion. In Proc. ACM Conf. Functional Programming and Computer Architecture, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benke, M. (1993). Efficient type reconstruction in the presence of inheritance. In: Borzyszkowski, A.M., Sokołowski, S. (eds) Mathematical Foundations of Computer Science 1993. MFCS 1993. Lecture Notes in Computer Science, vol 711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57182-5_19
Download citation
DOI: https://doi.org/10.1007/3-540-57182-5_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57182-7
Online ISBN: 978-3-540-47927-7
eBook Packages: Springer Book Archive