Skip to main content
Conference Proceedings

Efficient type reconstruction in the presence of inheritance

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1993) 711 LNCS 272-280
DOI: 10.1007/3-540-57182-5_19
11Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Benke, M. (1993). Efficient type reconstruction in the presence of inheritance. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 711 LNCS, pp. 272–280). Springer Verlag. https://doi.org/10.1007/3-540-57182-5_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free