Datatype-Generic Programming

Gibbons, Jeremy

doi:10.1007/978-3-540-76786-2_1

Cited by 49 publications

(44 citation statements)

References 95 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Despite the redundant Unit and ⊥ types, these functors are isomorphic to the functors used to represent lists of numbers and 2-3 trees (Gibbons 2007;Yakushev et al 2009). To make our code more readable, we will omit the functor argument X and the subscripts a, p , s in the interpretation function ty X , whenever these may be inferred from the context.…”

Section: Datatype Re Ectionmentioning

confidence: 99%

Type-directed diffing of structured data

Miraldo

Dagand

Swierstra

2017

Proceedings of the 2nd ACM SIGPLAN International Workshop on Type-Driven Development

View full text Add to dashboard Cite

The Unix diff utility that compares lines of text is used pervasively by version control systems. Yet certain changes to a program may be di cult to describe accurately in terms of modi cations to individual lines of code. As a result, observing changes at such a xed granularity may lead to unnecessary con icts between di erent edits. This paper presents a generic representation for describing transformations between algebraic data types and a non-deterministic algorithm for computing such representations. These representations can be used to give a more accurate account of modi cations made to algebraic data structures -and the abstract syntax trees of computer programs in particular -as opposed to only considering modi cations between their textual representations.

show abstract

Section: Datatype Re Ectionmentioning

confidence: 99%

Type-directed diffing of structured data

Miraldo

Dagand

Swierstra

2017

Proceedings of the 2nd ACM SIGPLAN International Workshop on Type-Driven Development

View full text Add to dashboard Cite

show abstract

“…In the functional programming communities the term "generic programming" is often used to mean datatype-generic programming (DGP) (Gibbons 2003). DGP can be viewed as an advanced form of generic programming in which the structure of types is used to derive generic algorithms.…”

Section: Real-world Applicationsmentioning

confidence: 99%

Type classes as objects and implicits

Oliveira

Moors

Odersky

2010

Proceedings of the ACM International Conference on Object Oriented Programming Systems Languages and Applications

View full text Add to dashboard Cite

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 challenges in software engineering and programming languages such as, for example, retroactive extension of programs. They are also recognized as a good mechanism for concept-based generic programming and, more recently, have evolved into a mechanism for type-level computation.This paper presents a lightweight approach to type classes in object-oriented (OO) languages with generics using the CONCEPT pattern and implicits (a type-directed implicit parameter passing mechanism). This paper also shows how Scala's type system conspires with implicits to enable, and even surpass, many common extensions of the Haskell type class system, making Scala ideally suited for generic programming in the large.

show abstract

“…While concepts allows for case-by-case (ad-hoc) modelling, the modellings themselves are often datatype-generic (Gibbons 2007). Examples include serialisation functions, equality checking, etc.…”

Section: Structure-derived Modellingmentioning

confidence: 99%

Generic programming with C++ concepts and Haskell type classes—a comparison

Bernardy¹,

Jansson²,

Zalewski³

et al. 2010

J. Funct. Prog.

View full text Add to dashboard Cite

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 Haskell because of its type classes and C++ with the concept feature. We refine these criteria into a taxonomy that captures commonalities and differences between type classes in Haskell and concepts in C++ and discuss which differences are incidental and which ones are due to other language features. The taxonomy allows for an improved understanding of language support for generic programming, and the comparison is useful for the ongoing discussions among language designers and users of both languages.

show abstract

Datatype-Generic Programming

Cited by 49 publications

References 95 publications

Type-directed diffing of structured data

Type-directed diffing of structured data

Type classes as objects and implicits

Generic programming with C++ concepts and Haskell type classes—a comparison

Contact Info

Product

Resources

About