Type Inference with Nonstructural Subtyping

Forfattere

  • Jens Palsberg
  • Mitchell Wand
  • Patrick O'Keefe

DOI:

https://doi.org/10.7146/brics.v2i33.19936

Resumé

We present an O(n^3) time type inference algorithm for a type
system with a largest type !, a smallest type ?, and the usual ordering
between function types. The algorithm infers type annotations of
minimal size, and it works equally well for recursive types. For the
problem of typability, our algorithm is simpler than the one of Kozen,
Palsberg, and Schwartzbach for type inference without ?. This may
be surprising, especially because the system with ? is strictly more
powerful.

Downloads

Publiceret

1995-06-03

Citation/Eksport

Palsberg, J., Wand, M., & O’Keefe, P. (1995). Type Inference with Nonstructural Subtyping. BRICS Report Series, 2(33). https://doi.org/10.7146/brics.v2i33.19936

Nummer

Nr. 33 (1995): RS-33 Type Inference with Nonstructural Subtyping

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).