Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
Repository logo
  • Communities & Collections
  • All of DSpace
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Martin, SULZMANN"

Now showing 1 - 2 of 2
Results Per Page
Sort Options
  • No Thumbnail Available
    Item
    C++ templates/traits versus Haskell type classes
    (2005-02-16T09:41:40Z) Sunil, KOTHARI; Martin, SULZMANN
    This article presents an in-depth study of the close connection between Haskell type classes and C++ template/traits mechanism - two different facilties for implementing generic programming concepts. Haskell type classes and various extensions can be closely mimicked by C++ templates/traits and related mechanisms. We highlight the subtleties related to type-based computations and the limitations induced by language design on the program behaviour by a number of examples.
  • No Thumbnail Available
    Item
    Improved Inference for Checking Type Annotations
    (2005-02-16T08:53:42Z) Peter.J, STUCKEY; Martin, SULZMANN; Jeremy, WAZNY
    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).

DSpace software copyright © 2002-2025 LYRASIS

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback