| From: Sam Tobin-Hochstadt (samth at ccs.neu.edu) Date: Sun Oct 3 10:01:31 EDT 2010 |
|
On Sun, Oct 3, 2010 at 7:43 AM, Matthew Flatt <mflatt at cs.utah.edu> wrote: > > Sam and Vincent: Any thoughts on how easy or difficult the change would > be for Typed Racket (and its optimizer)? What would the precise hierarchy be? In other words, what would be the predicate for each type? Would there be automatic coercions? Also, what members of that hierarchy would work with current float-specific operations? -- sam th samth at ccs.neu.edu
| Posted on the dev mailing list. |
|
![[logo]](/logo.png){kind=logo}