|
System CT extends ML-like type inference for supporting overloading and polymorphic recursion. The simplicity of core-ML type inference is maintained, with no exception or special constructs included for coping with overloading. It uses a new decidable type inference algorithm for typing polymorphic recursion, extending the set of typeable terms of core-ML
This work tries to deal with some classic restrictions (e.g., the monomorphism restriction). The site includes links to papers.
A Haskell implementation is provided.
Posted to theory by Ehud Lamm on 8/27/01; 5:41:28 AM
|
|
System CT
