Improved Inference for Checking Type Annotations
dc.contributor.author | Peter.J, STUCKEY | en_US |
dc.contributor.author | Martin, SULZMANN | en_US |
dc.contributor.author | Jeremy, WAZNY | en_US |
dc.date.accessioned | 2005-02-16T08:53:42Z | en_US |
dc.date.accessioned | 2017-01-23T06:59:33Z | |
dc.date.available | 2005-02-16T08:53:42Z | en_US |
dc.date.available | 2017-01-23T06:59:33Z | |
dc.date.issued | 2005-02-16T08:53:42Z | en_US |
dc.description.abstract | 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). | en_US |
dc.format.extent | 388013 bytes | en_US |
dc.format.mimetype | application/pdf | en_US |
dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/1525 | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartofseries | TRA2/05 | en_US |
dc.title | Improved Inference for Checking Type Annotations | en_US |
dc.type | Technical Report | en_US |