Since 2014
Type Inference with Nonstructural Subtyping
BRICS Report Series
View Archive Info| Field | Value | |
| Title |
Type Inference with Nonstructural Subtyping
|
|
| Creator |
Palsberg, Jens
Wand, Mitchell O'Keefe, Patrick |
|
| Description |
We present an O(n^3) time type inference algorithm for a typesystem with a largest type !, a smallest type ?, and the usual orderingbetween function types. The algorithm infers type annotations ofminimal size, and it works equally well for recursive types. For theproblem of typability, our algorithm is simpler than the one of Kozen,Palsberg, and Schwartzbach for type inference without ?. This maybe surprising, especially because the system with ? is strictly morepowerful.
|
|
| Publisher |
Aarhus University
|
|
| Contributor |
—
|
|
| Date |
1995-06-03
|
|
| Type |
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion — |
|
| Format |
application/pdf
|
|
| Identifier |
https://tidsskrift.dk/brics/article/view/19936
10.7146/brics.v2i33.19936 |
|
| Source |
BRICS Report Series; No 33 (1995): RS-33 Type Inference with Nonstructural Subtyping
BRICS Report Series; No 33 (1995): RS-33 Type Inference with Nonstructural Subtyping 1601-5355 0909-0878 |
|
| Language |
eng
|
|
| Relation |
https://tidsskrift.dk/brics/article/view/19936/17589
|
|
| Rights |
Copyright (c) 2015 BRICS Report Series
|
|