Improved Inference for Checking Annotations

Simple item page
dc.creatorStuckey, Peter J
dc.creatorSulzmann, Martin
dc.creatorWazny, Jeremy
dc.date2005-07-14
dc.date.accessioned2026-07-07T03:23:13Z
dc.date.available2026-07-07T03:23:13Z
dc.descriptionWe 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).
dc.identifierhttps://arxiv.org/abs/cs/0507036
dc.identifierhttp://arxiv.org/abs/cs/0507036
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32859
dc.subjectProgramming Languages
dc.subjectLogic in Computer Science
dc.titleImproved Inference for Checking Annotations
dc.typetext

Files

Collections

arXiv