On 19 Jul 2003, Luke Palmer wrote: > [1] It would be totally cool to use a Haskell- or ML-style type > inference system, but those things just don't work in procedural > languages.
Could you clarify what you mean by "don't work" here? ML has both assignment and type inference, so it seems like it's at least possible to do this; O'Caml generates some pretty fast code, too, so it seems like it can be practical as well. Of course, perl6's being _dynamic_ may sink this, but its being _procedural_ doesn't seem like it would pose a problem. /s
