Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1993: Mathematical Foundations of Computer Science 1993 pp 272–280Cite as

Efficient type reconstruction in the presence of inheritance

Extended abstract

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 711))

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.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. John C. Mitchell. Coercion and type inference. In Conf. Rec. ACM Symp. Principles of Programming Languages, pages 175–185, 1984.

    Google Scholar 

  5. P. Nevermann and I. Rival. Holes in ordered sets. Graphs and Combinatorics, (1):339–350, 1985.

    Google Scholar 

  6. 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.

    Google Scholar 

  7. Jerzy Tiuryn. Subtype inequalities. In Proc. 7th IEEE Symp. Logic in Computer Science, pages 308–315, 1992.

    Google Scholar 

  8. 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.

    Google Scholar 

  9. M. Wand and Patrick O'Keefe. On the complexity of type inference with coercion. In Proc. ACM Conf. Functional Programming and Computer Architecture, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Warsaw University, ul. Banacha 2, 02-097, Warsaw, Poland

    Marcin Benke

Authors
  1. Marcin Benke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej M. Borzyszkowski Stefan Sokołowski

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation