Skip to main content
SpringerLink
Log in

Type Reconstruction for Functional Programs with Subtyping over a Lattice of Atomic Types

  • Conference paper
Mathematical Foundations of Computer Science 1999 (MFCS 1999)

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

  • 679 Accesses

Abstract

We propose a uniform and systematic way of constructing solutions (in any admissible shape) for systems of subtype inequalities. It is done via systems which we call interval systems.

Partly supported by NSF grant CCR-9417382 and by Polish KBN Grant 8 T11C 035 14.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Dwork, P. Kanellakis, and J.C. Mitchell. On the sequential nature of unification. J. Logic Programming, 1:35–50, 1984.

    Article  MathSciNet  Google Scholar 

  2. A. Prey. Satisfying subtype inequalities in polynomial space. In Pascal Van Hentenryck, editor, Proceedings of the Forth International Symposium on Static Analysis (SAS’97), number 1302 in Lecture Notes in Computer Science, pages 265–277, Paris, Prance, September 1997. Springer Verlag.

    Google Scholar 

  3. M. Hoang and J.C. Mitchell. Lower bounds on type inference with subtypes. In Conf. Rec. ACM Symp. Principles of Programming Languages, 1995.

    Google Scholar 

  4. J.C. Mitchell. Polymorphic type inference and containment. Information and Computation, 76(2/3):211–249, 1988. Reprinted in Logical Foundations of Functional Programming, ed. G. Huet, Addison-Wesley (1990) 153–194.

    Article  MathSciNet  Google Scholar 

  5. J. Tiuryn. Subtype inequalities. In Proc. IEEE Symp. on Logic in Computer Science, pages 308–315, 1992.

    Google Scholar 

  6. J. Tiuryn. Subtyping over a lattice (abstract). In G. Gottlob, A. Leitsch, and D. Mundici, editors, Computational Logic and Proof Theory. 5-th Kurt Gödel Colloquium, KGC’97, volume 1289 of Lecture Notes in Computer Science, pages 84–88. Springer Verlag, 1997. Full version: http://zls.mimuw.edu.pl/~tiuryn/papers.html.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Jerzy Tiuryn

Authors
  1. Jerzy Tiuryn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, University of Wrocław, Przesmyckiego 20, PL-51-151, Wrocław, Poland

    Mirosław Kutyłowski , Leszek Pacholski  & Tomasz Wierzbicki ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tiuryn, J. (1999). Type Reconstruction for Functional Programs with Subtyping over a Lattice of Atomic Types. In: Kutyłowski, M., Pacholski, L., Wierzbicki, T. (eds) Mathematical Foundations of Computer Science 1999. MFCS 1999. Lecture Notes in Computer Science, vol 1672. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48340-3_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-48340-3_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66408-6

  • Online ISBN: 978-3-540-48340-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation