Sciweavers

Share
OOPSLA
2010
Springer
8 years 1 months ago
Type classes as objects and implicits
Type classes were originally developed in Haskell as a disciplined alternative to ad-hoc polymorphism. Type classes have been shown to provide a type-safe solution to important ch...
Bruno C. d. S. Oliveira, Adriaan Moors, Martin Ode...
JFP
2010
109views more  JFP 2010»
8 years 1 months ago
Generic programming with C++ concepts and Haskell type classes - a comparison
Earlier studies have introduced a list of high-level evaluation criteria to assess how well a language supports generic programming. Languages that meet all criteria include Haske...
Jean-Philippe Bernardy, Patrik Jansson, Marcin Zal...
ICFP
2010
ACM
8 years 4 months ago
Instance chains: type class programming without overlapping instances
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
J. Garrett Morris, Mark P. Jones
SFP
2004
8 years 4 months ago
Generic proofs for combinator-based generic programs
Abstract: Generic programming can bring important benefits to software engineering. In particular, it reduces the burden of verification, since generic proofs can be instantiated a...
Fermín Reig
TPHOL
1995
IEEE
8 years 7 months ago
HOLCF: Higher Order Logic of Computable Functions
This paper presents a survey of HOLCF, a higher order logic of computable functions. The logic HOLCF is based on HOLC, a variant of the well known higher order logic HOL, which o e...
Franz Regensburger
ESOP
2000
Springer
8 years 7 months ago
Type Classes with Functional Dependencies
Abstract. Type classes in Haskell allow programmers to define functions that can be used on a set of different types, with a potentially different implementation in each case. For ...
Mark P. Jones
FOAL
2007
ACM
8 years 7 months ago
Aspect-oriented programming with type classes
We consider the problem of adding aspects to a strongly typed language which supports type classes. We show that type classes as supported by the Glasgow Haskell Compiler can mode...
Martin Sulzmann, Meng Wang
IFL
2001
Springer
137views Formal Methods» more  IFL 2001»
8 years 7 months ago
A Generic Programming Extension for Clean
Abstract. Generic programming enables the programmer to define functions by induction on the structure of types. Defined once, such a generic function can be used to generate a s...
Artem Alimarine, Marinus J. Plasmeijer
PLDI
2005
ACM
8 years 9 months ago
Essential language support for generic programming
Concepts are an essential language feature for generic programming in the large. Concepts allow for succinct expression of constraints on type parameters of generic algorithms, en...
Jeremy G. Siek, Andrew Lumsdaine
HASKELL
2006
ACM
8 years 9 months ago
RepLib: a library for derivable type classes
Some type class instances can be automatically derived from the structure of types. As a result, the Haskell language includes the “deriving” mechanism to automatic generates ...
Stephanie Weirich
books