|
|
@@ -30,7 +30,7 @@ url = {https://doi.org/10.1145/345099.345100},
|
|
|
doi = {10.1145/345099.345100},
|
|
|
abstract = {We study two partial type inference methods for a language combining subtyping and impredicative polymorphism. Both methods are local in the sense that missing annotations are recovered using only information from adjacent nodes in the syntax tree, without long-distance constraints such as unification variables. One method infers type arguments in polymorphic applications using a local constraint solver. The other infers annotations on bound variables in function abstractions by propagating type constraints downward from enclosing application nodes. We motivate our design choices by a statistical analysis of the uses of type inference in a sizable body of existing ML code.},
|
|
|
journal = {ACM Trans. Program. Lang. Syst.},
|
|
|
-month = {jan},
|
|
|
+month = jan,
|
|
|
pages = {1–44},
|
|
|
numpages = 44,
|
|
|
keywords = {subtyping, polymorphism, type inference}
|
|
|
@@ -50,7 +50,7 @@ url = {https://doi.org/10.1145/3450952},
|
|
|
doi = {10.1145/3450952},
|
|
|
abstract = {Bidirectional typing combines two modes of typing: type checking, which checks that a program satisfies a known type, and type synthesis, which determines a type from the program. Using checking enables bidirectional typing to support features for which inference is undecidable; using synthesis enables bidirectional typing to avoid the large annotation burden of explicitly typed languages. In addition, bidirectional typing improves error locality. We highlight the design principles that underlie bidirectional type systems, survey the development of bidirectional typing from the prehistoric period before Pierce and Turner’s local type inference to the present day, and provide guidance for future investigations.},
|
|
|
journal = {ACM Comput. Surv.},
|
|
|
-month = {may},
|
|
|
+month = may,
|
|
|
articleno = 98,
|
|
|
numpages = 38,
|
|
|
keywords = {type inference, Type checking}
|
Peter Thiemann