Skip to main content
SpringerLink
Log in

Equational axiomatization of bicoercibility for polymorphic types

  • Functional Programming Theory
  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1995)

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

Abstract

Two polymorphic types σ and τ are said to be bicoercible if there is a coercion from σ to τ and conversely. We give a complete equational axiomatization of bicoercible types and prove that the relation of bicoercibility is decidable.

This work is partly supported by NSF Grant CCR-9113196, KBN Grant 2 P301 031 06 and by ESPRIT BRA7232 GENTZEN.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Benke, “Efficient type reconstruction in the presence of inheritance”, in: A. M. Borzyszkowski, S. Sokolowski (Eds.) MFCS'93: Mathematical Foundations of Computer science, Proc. 18th Intern. Symp., Gdansk 1993, Springer-Verlag LNCS 711, (1993), 272–280.

    Google Scholar 

  2. V. Breazu-Tannen, T. Coquand, C.A. Gunter, and A. Scedrov, “Inheritanceas implicit coercion”, Information and Computation 93, (1991), 172–221.

    Google Scholar 

  3. L. Cardelli, S. Martini, J.C. Mitchell, and A. Scedrov, “An extension of system F with subtyping”, Information and Computation 94, (1994), 4–56.

    Google Scholar 

  4. G. Castagna, G. Ghelli, and G. Longo, “A calculus of overloaded functions with subtyping”, Proceedings, ACM conference on LISP and Functional Programming, San Francisco (1992). Information and Computation 117 (1995), 115–135.

    Google Scholar 

  5. G. Castagna, and B.C. Pierce, “Decidable bounded quantification”, 21st Ann. ACM Symposium on Principles of Programming Languages, (1994), 151–162.

    Google Scholar 

  6. R. Di Cosmo, Isomorphisms of types: from λ-calculus to information retrieval and language design, Birkhauser, 1995.

    Google Scholar 

  7. G. Longo, K. Milsteed, and S. Soloviev, “A logic of subtyping”, Proc. 10-th IEEE Symp. Logic in Computer Science, San Diego (1995), 292–299.

    Google Scholar 

  8. J.C. Mitchell, “Polymorphic type inference and containment”, in: G. Huet (Ed.), Logical Foundations of Functional Programming, Addison-Wesley (1990), 153–193.

    Google Scholar 

  9. B.C. Pierce, “Bounded quantification is undecidable”, 19th Ann. ACM Symposium on Principles of Programming Languages, (1992), 305–315. Information and Computation 112 (1994), 131–165.

    Google Scholar 

  10. J. Tiuryn, “Subtype inequalities”, Proc. 7-th IEEE Symp. Logic in Computer Science, Santa Cruz (1992), 308–315.

    Google Scholar 

  11. J. Tiuryn, and M. Wand, “Type reconstruction with recursive types and atomic subtyping”, in: M.-C. Gaudel and J.-P. Jouannaud (Eds.) TAPSOFT'93: Theory and Practice of Software Development, Proc. 4th Intern. Joint Conf. CAAP/FASE, Springer-Verlag LNCS 668, (1993), 686–701.

    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

P. S. Thiagarajan

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tiuryn, J. (1995). Equational axiomatization of bicoercibility for polymorphic types. In: Thiagarajan, P.S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1995. Lecture Notes in Computer Science, vol 1026. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60692-0_47

Download citation

  • DOI: https://doi.org/10.1007/3-540-60692-0_47

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60692-5

  • Online ISBN: 978-3-540-49263-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation