On Mon, Apr 30, 2012 at 08:48:38AM -0400, Sam Tobin-Hochstadt wrote: > > > 5) Is there a Hindlye/Milner style type inferencing algorithm for typed > > racket being worked on? > > The Typed Racket type system contains a number of features that go > beyond what's supported in Hindley/Milner style type systems, and so > we can't use that inference system. Currently, Typed Racket uses > local type inference to infer many of the types in your program, but > we'd like to infer more of them -- this is an ongoing area of > research. However, inferring all the types in the program, the way > that ML and Haskell do, is not a goal of Typed Racket -- having type > annotations there makes the program self-documenting and easier to > understand, improves type error messages, and supports advanced type > system features.
ML and such go too far. Don't go there. I really like having tatically checked type annotations. They make life a lot easier. It's types I want, not typability, -- hendrik ____________________ Racket Users list: http://lists.racket-lang.org/users
