Type classes in Haskell

Hall, Cordelia; Hammond, Kevin; Jones, Simon Peyton; Wadler, Philip

doi:10.1007/3-540-57880-3_16

Cited by 36 publications

(37 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…-The target language is C++ instead of ML [58] or System F [59]. This impacts the translation because C++ has neither parametric polymorphism nor closures, both of which are used extensively in the translations for Haskell.…”

Section: An Implementation Of Gmentioning

confidence: 99%

See 1 more Smart Citation

A language for generic programming in the large

Siek

Lumsdaine

2011

Science of Computer Programming

View full text Add to dashboard Cite

a b s t r a c tGeneric programming is an effective methodology for developing reusable software libraries. Many programming languages provide generics and have features for describing interfaces, but none completely support the idioms used in generic programming. To address this need we developed the language G. The central feature of G is the concept, a mechanism for organizing constraints on generics that is inspired by the needs of modern C++ libraries. G provides modular type checking and separate compilation (even of generics). These characteristics support modular software development, especially the smooth integration of independently developed components. In this article we present the rationale for the design of G and demonstrate the expressiveness of G with two case studies: porting the Standard Template Library and the Boost Graph Library from C++ to G. The design of G shares much in common with the concept extension proposed for the next C++ Standard (the authors participated in its design) but there are important differences described in this article.

show abstract

Section: An Implementation Of Gmentioning

confidence: 99%

“…The goal of the prototype is not to produce high performance executables but instead to demonstrate the implementability of G and provide an executable semantics. The basic idea of the translation comes from Haskell type classes [58,59]. The constraints on generic functions are translated into extra function parameters.…”

Section: An Implementation Of Gmentioning

confidence: 99%

A language for generic programming in the large

Siek

Lumsdaine

2011

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

“…• type classes [15]: Type classes are Haskell's major innovation for supporting ad-hoc polymorphism. A type class declaration corresponds to the type-signature of an overloaded value -or rather, to a collection of type signatures.…”

Section: Related Workmentioning

confidence: 99%

Generic programming in 3D

Hinze

Löh

2009

Science of Computer Programming

View full text Add to dashboard Cite

a b s t r a c t Support for generic programming consists of three essential ingredients: support for overloaded functions, a run-time type representation, and a generic view on data. Different approaches to datatype-generic programming occupy different points in this design space. In this article, we revisit the ''Scrap your boilerplate'' approach and identify its location within the three-dimensional design space. The characteristic features of ''Scrap your boilerplate'' are its two generic views, the 'spine' view for consuming and transforming data, and the 'type-spine' view for producing data. We show how to combine these views with different overloading mechanisms and type representations.

show abstract

“…For this purpose, we make use of the type class resolution mechanism [11] to instrument programs with run-time checks. The idea is that whenever we come across a program part which gives rise to an unresolved constraint, we replace this program part with an error statement (i.e.…”

Section: Mixing Static and Dynamic Verificationmentioning

confidence: 99%

“…We conclude in Section 5 where we also discuss related work. We assume some familiarity with type classes [38,11]. Throughout the paper, we will use Haskell-style syntax in examples.…”

Section: Introductionmentioning

confidence: 99%

Language-Based Program Verification via Expressive Types

Sulzmann

Voicu

2007

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

Recent developments in the area of expressive types have the prospect to supply the ordinary programmer with a programming language rich enough to verify complex program properties. Program verification is made possible via tractable type checking. We explore this possibility by considering two specific examples; verifying sortedness and resource usage verification. We show that advanced type error diagnosis methods become essential to assist the user in case of type checking failure. Our results point out new research directions for the development of programming environments in which users can write and verify their programs.

show abstract

Type classes in Haskell

Cited by 36 publications

References 9 publications

A language for generic programming in the large

A language for generic programming in the large

Generic programming in 3D

Language-Based Program Verification via Expressive Types

Contact Info

Product

Resources

About