BibTeX
@MISC{Wansbrough99anovel,
author = {Keith Wansbrough},
title = {A Novel Problem in Constraint-Based Type Inference},
year = {1999}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this document, we have simpli ed the languages. Firstly, we have omitted constructors and case, replacing them instead by the choice operator e 1 8 e 2 which nondeterministically selects one branch to evaluate. This simpler construct retains the key property of unpredictable (by the type system) selection among alternatives. Secondly, we have omitted the (trivial) rules for type abstraction and application.
Citations
| 322 | Principal type-schemes for functional programs - Damas, Milner - 1982 |
| 108 | Componential set-based analysis - Flanagan, Felleisen - 1997 |
| 88 | What are principal typings and what are they good for - Jim - 1998 |
| 81 | Type inference with constrained types. Theory and Practice of Object Systems - Odersky, Sulzmann, et al. - 1999 |
| 77 | Once upon a type - Turner, Wadler, et al. - 1995 |
| 60 | Subtyping constrained types - Trifonov, Smith - 1996 |
| 35 | Simplifying subtyping constraints: a theory - Pottier - 2001 |
| 33 | Once upon a polymorphic type - Wansbrough, Jones - 1999 |
| 23 | Reactive Objects and Functional Programming - Nordlander - 1999 |
| 12 | Polymorphic recursion and subtype quali Polymorphic binding-time analysis in polynomial time - Dussart, Henglein, et al. - 1995 |
| 12 | Pragmatic subtyping in polymorphic languages - Nordlander - 1998 |
| 2 | Hindley /Milner style type systems in constraint form - Sulzmann, Muller, et al. - 1999 |
