Computer Science – Programming Languages
Scientific paper
2005-07-14
Computer Science
Programming Languages
Scientific paper
We consider type inference in the Hindley/Milner system extended with type annotations and constraints with a particular focus on Haskell-style type classes. We observe that standard inference algorithms are incomplete in the presence of nested type annotations. To improve the situation we introduce a novel inference scheme for checking type annotations. Our inference scheme is also incomplete in general but improves over existing implementations as found e.g. in the Glasgow Haskell Compiler (GHC). For certain cases (e.g. Haskell 98) our inference scheme is complete. Our approach has been fully implemented as part of the Chameleon system (experimental version of Haskell).
Stuckey Peter J.
Sulzmann Martin
Wazny Jeremy
No associations
LandOfFree
Improved Inference for Checking Annotations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Improved Inference for Checking Annotations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved Inference for Checking Annotations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-575014